Journal Article10.1016/J.MEDIA.2010.03.005
A review of 3D/2D registration methods for image-guided interventions
837
TL;DR: The 3D/2D registration methods are reviewed with respect to image modality, image dimensionality, registration basis, geometric transformation, user interaction, optimization procedure, subject, and object of registration.
read more
About: This article is published in Medical Image Analysis. The article was published on 01 Apr 2012. The article focuses on the topics: Patient registration & Image registration.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
2D/3D fast fine registration in minimally invasive pelvic surgery
Fujiao Ju,Yuan Li,Jingxin Zhao,Mingjie Dong +3 more
Simulating X-ray images from deformable shape and intensity models on the GPU
Moritz Ehlke
- 01 Jan 2012
TL;DR: This work presents several fast and precise methods to generate x-ray images from statistical volumetric models, which are enriched with density information (Statistical Shape and Intensity Models, SSIMs), and a novel method is proposed that efficiently integrates both model deformation as well as x-rays simulation into a single, GPU-accelerated operation.
Globally Learnable Point Set Registration Between 3D CT and Multi-view 2D X-ray Images of Hip Phantom
Jin Pan,Zhe Min,Ang Zhang,Han Ma,Max Q. -H. Meng +4 more
TL;DR: This study proposes a novel 2D-3D registration approach using a point set Neural Network, combining global and local information to efficiently register 3D CT and 2D X-ray images of hip phantoms, improving accuracy and computation speed.
Augmented visualization with depth perception cues to improve the surgeon’s performance in minimally invasive surgery
TL;DR: A navigation system that supports surgeons in preoperative and intraoperative phases and an augmented reality system that superimposes virtual organs on the patient’s body together with depth and distance information are presented.
Fiducial-Free 2D/3D Registration for Robot-Assisted Femoroplasty
Cong Gao,Amirhossein Farvardin,Robert B. Grupp,Mahsan Bakhtiarinejad,Liuhong Ma,Mareike Thies,Mathias Unberath,Russell H. Taylor,Mehran Armand +8 more
- 28 Jul 2020
TL;DR: The fiducial-less 2D/3D registration is sufficiently accurate to guide robot assisted femoroplasty, and the biomechanical analysis showed that even with a 4 mm translational deviation from the optimal injection path, the yield load prior to fracture increased by 40%.
References
A method for registration of 3-D shapes
Paul J. Besl,H.D. McKay +1 more
TL;DR: In this paper, the authors describe a general-purpose representation-independent method for the accurate and computationally efficient registration of 3D shapes including free-form curves and surfaces, based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point.
20.6K
Multimodality image registration by maximization of mutual information
TL;DR: The results demonstrate that subvoxel accuracy with respect to the stereotactic reference solution can be achieved completely automatically and without any prior segmentation, feature extraction, or other preprocessing steps which makes this method very well suited for clinical applications.
Light field rendering
Marc Levoy,Pat Hanrahan +1 more
- 01 Aug 1996
TL;DR: This paper describes a sampled representation for light fields that allows for both efficient creation and display of inward and outward looking views, and describes a compression system that is able to compress the light fields generated by more than a factor of 100:1 with very little loss of fidelity.
Closed-form solution of absolute orientation using unit quaternions
TL;DR: A closed-form solution to the least-squares problem for three or more paints is presented, simplified by use of unit quaternions to represent rotation.
Least-Squares Fitting of Two 3-D Point Sets
TL;DR: An algorithm for finding the least-squares solution of R and T, which is based on the singular value decomposition (SVD) of a 3 × 3 matrix, is presented.