A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
Feature preserving non-rigid iterative weighted closest point and semi-curvature registration
2022
IEEE Transactions on Image Processing
Preserved Fulltext
Preserving features of a surface as characteristic local shape properties captured e.g. by curvature, during non-rigid registration is always difficult where finding meaningful correspondences, assuring ...
In this paper, we present a non-rigid registration method utilizing a newly defined semi-curvature, which is inspired by the definition of the Gaussian curvature. ...
Feature preserving non-rigid iterative weighted closest point and semi-curvature registration Farzam Tajdari 1 , Toon Huysmans 1,2 , Yusheng Yang 1,3 and Yu Song 1 , Member, IEEE Abstract-Preserving features ...
doi:10.1109/tip.2022.3148822
pmid:35139017
fatcat:nxlu74feirhr7a4xoxrubywsri
CT-PET Landmark-based Lung Registration Using a Dynamic Breathing Model
2007
14th International Conference on Image Analysis and Processing (ICIAP 2007)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper deals with the problem of non-linear landmark-based registration of CT (at two different instants of the breathing cycle, intermediate expirations) and PET images of thoracic regions. ...
We propose a general method to introduce a breathing model in a registration procedure in order to simulate the instant in the breathing cycle most similar to the PET image and guarantee physiologically ...
as follows: (1) Select landmarks on the CT mesh M C (with Gaussian or/and mean curvatures); (2) Estimate corresponding landmarks on the PET (using the Iterative Closest Point algorithm [2] ); (3) i = ...
doi:10.1109/iciap.2007.4362857
dblp:conf/iciap/ChambonMSRAB07
fatcat:iucma6wpfjgihbgwxaw23uxbvq
Level-set surface segmentation and registration for computing intrasurgical deformations
1999
Medical Imaging 1999: Image Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A by-product of this stage is a Euclidean distance and closest point map which is later exploited to speed up the rigid and non-rigid surface registration. ...
These explicit point pairs in turn are used in conjunction with a closed-form SVDbased rigid transformation computation and with fast recursive splines to make each rigid and non-rigid registration iteration ...
This work was supported by the National Science and Engineering Research Council of Canada NSERC grant 0GP0155058, and the Medical Resarch Council of Canada MRC grant MT11540. ...
doi:10.1117/12.348499
dblp:conf/miip/AudetteP99
fatcat:f4mazeynnnb5dmyxe7aztlltvq
Triangular Model Registration Algorithm through Differential Topological Singularity Points by Helmholtz-Hodge Decomposition
2019
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Iterative closest point algorithms suffer from non-convergence and local minima when dealing with cloud points with a different sampling density. ...
INDEX TERMS Iterative closest point algorithm, computer aided manufacturing, differential equations, HHD. 34776 2169-3536 ...
The iterative closest point (ICP) is currently the most popular rigid registration algorithm [1] . ...
doi:10.1109/access.2019.2905079
fatcat:26ulpzfhineufjn3k7mqew3hri
Non-rigid Registration by Geometry-Constrained Diffusion
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Assume that only partial knowledge about a non-rigid registration is given so that certain points, curves, or surfaces in one 3D image map to certain certain points, curves, or surfaces in another 3D image ...
We may thus keep any number of fiducial points, curves, and/or surfaces fixed while finding the simplest registration. ...
The authors also thank Sven Kreiborg (School of Dentistry, University of Copenhagen, Denmark) and Jeffrey L. ...
doi:10.1007/10704282_58
fatcat:x56fehzagbebjm73v4lguwprsq
Combining a breathing model and tumor-specific rigidity constraints for registration of CT-PET thoracic data
2008
Journal of Computer-Aided Surgery
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The authors alone are responsible for the content and writing of the paper. ...
The authors would like to thank Val-de-Grâce Hospital, Paris, France, and the MD Anderson Cancer Center, Orlando, Florida, for the images. ...
In particular, for the pathological cases, it avoids undesired tumor mis-registrations and preserves tumor geometry and intensity (this being guaranteed by the rigidity constraints, a main feature of the ...
doi:10.3109/10929080802431980
pmid:18821346
fatcat:flfia4qr5nawfjlabfewmiv6ge
Automatic Registration for Articulated Shapes
2008
Computer graphics forum (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We explicitly sample the motion, which gives a priori the set of possible rigid transformations between parts of the shapes. ...
We demonstrate the robustness of our method by aligning several synthetic and real-world datasets. ...
Mount and Sunil Arya for providing the ANN library, and Yuri Boykov, Olga Veksler, Ramin Zabih for providing an implementation of their graph cuts algorithm. ...
doi:10.1111/j.1467-8659.2008.01286.x
fatcat:asnili7usjatrbl7lrfhwq753i
Blending liquids
2014
ACM Transactions on Graphics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our contributions include a new space-time non-rigid iterative closest point algorithm that incorporates user guidance, a subsampling technique for efficient registration of meshes with millions of vertices ...
We introduce a semi-automatic method for matching two existing liquid animations, which we use to create new fluid motion that plausibly interpolates the input. ...
We thank Hao Li for the useful discussions about non-rigid ICP, Mark Luffel for his help with the hole-filling algorithm and David Hahn for the volume preserving edge collapse code. ...
doi:10.1145/2601097.2601126
fatcat:wvz7k4ncgva6jf2ab2j3cjfyli
A Study of Coronary Bifurcation Shape in a Normal Population
2016
Journal of Cardiovascular Translational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Coherent point drift was used for registration. ...
Principal component analysis shape scores were tested against clinical risk factors, quantifying the importance of recognised shape features in intervention including size, angles and curvature. ...
PMG is most grateful for the support received from the Green Lane Research and Educational Fund. The authors would like to thank Renee Miller and Greg Gamble for their assistance. ...
doi:10.1007/s12265-016-9720-2
pmid:28028693
pmcid:PMC5323506
fatcat:elaablzjgzd6bipbocpghmb7l4
3D Face Compression and Recognition using Spherical Wavelet Parametrization
2012
International Journal of Advanced Computer Science and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
These novelties include: First, an automatic pose correction and normalization process by using curvature analysis for nose tip detection and iterative closest point (ICP) image registration. ...
Two representation features based on spherical wavelet parameterization of the face image were proposed for the 3D face compression and recognition. ...
The ICP algorithm (originally Iterative Closest Point, and sometimes known as Iterative Corresponding Point) proposed by Besl and McKay [29] is a well-known standard algorithm for model registration ...
doi:10.14569/ijacsa.2012.030901
fatcat:p2rgc2x2bzajtmkw6ucbc2glla
An automatic assembly and completion framework for fragmented skulls
2011
2011 International Conference on Computer Vision
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
A two-step assembly framework is proposed: (1) rough assembly by an ICP-like template matching algorithm integrated with the slippage features and spin-image descriptors; (2) assembly refinement by a global ...
We develop a completion pipeline for fragmented and damaged skulls. ...
The template is usually deformed to match the subject through a non-rigid registration, often composed by a global rigid/affine transformation and a local non-linear deformation. ...
doi:10.1109/iccv.2011.6126540
dblp:conf/iccv/YinWLM11
fatcat:fo56tivuizcmda4gkprj7kb37m
Non-Rigid Registration Under Anisotropic Deformations
2019
Computer Aided Geometric Design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Extending from the well-known Iterative Closest Point (ICP) approach for rigid registration Besl and McKay (1992) ; Chen and Medioni (1992) , Non-rigid ICP (N-ICP) methods achieve registration for non-rigid ...
the respective weights of point-to-point and point-to-plane terms. ...
doi:10.1016/j.cagd.2019.04.014
fatcat:ctxgowkdcffpdlnaq4op7pu47a
High-Precision 3D Reconstruction for Small-to-Medium-Sized Objects Utilizing Line-Structured Light Scanning: A Review
2021
Remote Sensing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
High-quality digital point cloud information exists to help researchers to understand objects and environments. ...
However, current research mainly focuses on making adaptive adjustments to various scenarios and related issues in the application of this technology rather than looking for further improvements and enhancements ...
Traditional point cloud registration methods mainly rely on explicit neighborhood features such as curvature, point density, and surface continuity. ...
doi:10.3390/rs13214457
fatcat:6pnpg7rxcnaufcrbey2m335lnq
A scheme for automatically building three-dimensional morphometric anatomical atlases: application to a skull atlas
1998
Medical Image Analysis
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We detail each stage of the method, including the non-rigid registration algorithm, three-dimensional line averaging and statistical processes. ...
Finally, we use the resulting atlas to study a craniofacial disease; we show how we can obtain qualitative and quantitative results by contrasting a skull affected by a mandible deformation with the atlas ...
We are grateful to the reviewers for their useful comments and advice. ...
doi:10.1016/s1361-8415(01)80027-x
pmid:10638852
fatcat:m4tr2liylfb3blz6s6ps726wwi
A Survey of Non-Rigid 3D Registration
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Non-rigid registration computes an alignment between a source surface with a target surface in a non-rigid manner. ...
Both optimization-based and learning-based methods are covered. We also review benchmarks and datasets for evaluating non-rigid registration methods, and discuss potential future research directions. ...
Numerical solvers The optimization problem for non-rigid registration is typically non-linear and non-convex, and the solution is often computed using an iterative numerical solver. ...
arXiv:2203.07858v2
fatcat:qono2kgr2bgjhio6rqecntsloe
« Previous
Showing results 1 — 15 out of 609 results