The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Non-Rigid Point Set Registration by Preserving Global and Local Structures
Open accessAbstract
In previous work on point registration, the input point sets are often represented using Gaussian mixture models and the registration is then addressed through a probabilistic approach, which aims to exploit global relationships on the point sets. For non-rigid shapes, however, the local structures among neighboring points are also strong and stable and thus helpful in recovering the point correspondence. In this paper, we formulate point registration as the estimation of a mixture of densities, where local features, such as shape context, are used to assign the membership probabilities of the mixture model. This enables us to preserve both global and local structures during matching. The transformation between the two point sets is specified in a reproducing kernel Hilbert space and a sparse approximation is adopted to achieve a fast implementation. Extensive experiments on both synthesized and real data show the robustness of our approach under various types of distortions, such as deformation, noise, outliers, rotation, and occlusion. It greatly outperforms the state-of-the-art methods, especially when the data is badly degraded.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
A method for registration of 3-D shapes
Besl, P. J., & McKay, N. D. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.121791 · Cited by 18,103
Solutions of Ill-Posed Problems.
Bell, J. B., Tikhonov, A. N., & Arsenin, V. Y. (1978) · Mathematics of Computation · doi:10.2307/2006360 · Cited by 8,101
Shape matching and object recognition using shape contexts
Belongie, S., Malik, J., & Puzicha, J. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.993558 · Cited by 6,306
Aronszajn, N. (1950) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1950-0051437-7 · Cited by 5,380
A survey of image registration techniques
Brown, L. G. (1992) · ACM Computing Surveys · doi:10.1145/146370.146374 · Cited by 4,057
Efficient variants of the ICP algorithm
Rusinkiewicz, S., & Levoy, M. (2002) · Proceedings Third International Conference on 3-D Digital Imaging and Modeling · doi:10.1109/im.2001.924423 · Cited by 3,945
Fast Point Feature Histograms (FPFH) for 3D registration
Rusu, R. B., Blodow, N., & Beetz, M. (2009) · 2009 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2009.5152473 · Cited by 3,878
Point Set Registration: Coherent Point Drift
Myronenko, A., & Song, X. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.46 · Cited by 2,762
Pattern recognition and machine learning
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5091 · Cited by 2,650
Contour integration by the human visual system: Evidence for a local “association field”
Field, D. J., Hayes, A., & Hess, R. F. (1993) · Vision Research · doi:10.1016/0042-6989(93)90156-q · Cited by 1,614
A new point matching algorithm for non-rigid registration
Chui, H., & Rangarajan, A. (2003) · Computer Vision and Image Understanding · doi:10.1016/s1077-3142(03)00009-2 · Cited by 1,560
Robust Point Set Registration Using Gaussian Mixture Models
Jian, B., & Vemuri, B. C. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.223 · Cited by 975
Robust registration of 2D and 3D point sets
Fitzgibbon, A. W. (2003) · Image and Vision Computing · doi:10.1016/j.imavis.2003.09.004 · Cited by 925
10.2 Maximum Likelihood from Incomplete Data
(2024) · Hierarchical Quantile Modeling · doi:10.1051/978-2-7598-3719-9.c026 · Cited by 780
Robust Point Matching via Vector Field Consensus
Ma, J., Zhao, J., Tian, J., Yuille, A. L., & Tu, Z. (2014) · IEEE Transactions on Image Processing · doi:10.1109/tip.2014.2307478 · Cited by 566
Self-citationOn Learning Vector-Valued Functions
Micchelli, C. A., & Pontil, M. (2005) · Neural Computation · doi:10.1162/0899766052530802 · Cited by 494
Robust Feature Matching for Remote Sensing Image Registration via Locally Linear Transforming
Ma, J., Zhou, H., Zhao, J., Gao, Y., Jiang, J., & Tian, J. (2015) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2015.2441954 · Cited by 474
Self-citationSkeleton Pruning by Contour Partitioning with Discrete Curve Evolution
Bai, X., Latecki, L., & Liu, W.-Y. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.59 · Cited by 425
A Correlation-Based Approach to Robust Point Set Registration
Tsin, Y., & Kanade, T. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24672-5_44 · Cited by 416
Kim, V. G., Lipman, Y., & Funkhouser, T. (2011) · ACM SIGGRAPH 2011 papers · doi:10.1145/1964921.1964974 · Cited by 307
Fully Automatic Registration of 3D Point Clouds
Makadia, A., Patterson, A. I., & Daniilidis, K. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR'06) · doi:10.1109/cvpr.2006.122 · Cited by 306
Kim, V. G., Lipman, Y., & Funkhouser, T. (2011) · ACM Transactions on Graphics · doi:10.1145/2010324.1964974 · Cited by 298
Robust point matching for nonrigid shapes by preserving local neighborhood structures
Zheng, Y., & Doermann, D. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.81 · Cited by 296
The softassign Procrustes matching algorithm
Rangarajan, A., Chui, H., & Bookstein, F. L. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63046-5_3 · Cited by 282
Learning Context-Sensitive Shape Similarity by Graph Transduction
Bai, X., Yang, X., Latecki, L. J., Liu, W., & Tu, Z. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.85 · Cited by 280
Ma, J., Qiu, W., Zhao, J., Ma, Y., Yuille, A. L., & Tu, Z. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2388434 · Cited by 280
Self-citationNon-rigid visible and infrared face registration via regularized Gaussian fields criterion
Ma, J., Zhao, J., Ma, Y., & Tian, J. (2015) · Pattern Recognition · doi:10.1016/j.patcog.2014.09.005 · Cited by 223
Self-citationRigid and Articulated Point Registration with Expectation Conditional Maximization
Horaud, R., Forbes, F., Yguel, M., Dewaele, G., & Zhang, J. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.94 · Cited by 212
A computational theory for the perception of coherent visual motion
Yuille, A. L., & Grzywacz, N. M. (1988) · Nature · doi:10.1038/333071a0 · Cited by 210
Self-citationVECTOR VALUED REPRODUCING KERNEL HILBERT SPACES OF INTEGRABLE FUNCTIONS AND MERCER THEOREM
Carmeli, C., Vito, E. D., & Toigo, A. (2006) · Analysis and Applications · doi:10.1142/s0219530506000838 · Cited by 210
Shape Matching and Recognition – Using Generative Models and Informative Features
Tu, Z., & Yuille, A. L. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24672-5_16 · Cited by 195
Self-citationRegularized vector field learning with sparse approximation for mismatch removal
Ma, J., Zhao, J., Tian, J., Bai, X., & Tu, Z. (2013) · Pattern Recognition · doi:10.1016/j.patcog.2013.05.017 · Cited by 193
Self-citationShape matching and classification using height functions
Wang, J., Bai, X., You, X., Liu, W., & Latecki, L. J. (2011) · Pattern Recognition Letters · doi:10.1016/j.patrec.2011.09.042 · Cited by 189
Robust Estimation of Nonrigid Transformation for Point Set Registration
Ma, J., Zhao, J., Tian, J., Tu, Z., & Yuille, A. L. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.279 · Cited by 176
Self-citationArticulated Shape Matching Using Laplacian Eigenfunctions and Unsupervised Point Registration
Mateus, D., Horaud, R., Knossow, D., Fabio Cuzzolin, A., & Boyer, E. (2008) · Cited by 168
Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration
Mateus, D., Horaud, R., Knossow, D., Cuzzolin, F., & Boyer, E. (2008) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2008.4587538 · Cited by 130
A robust method for vector field learning with application to mismatch removing
Zhao, J. Y., Ma, J., Tian, J., Ma, J., & Zhang, D. (2011) · doi:10.1109/cvpr.2011.5995336 · Cited by 102
Self-citationTopology Preserving Relaxation Labeling for Nonrigid Point Matching
Lee, J.-H., & Won, C. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.179 · Cited by 66
3D Shape Registration Using Spectral Graph Embedding and Probabilistic Matching
Sharma, A. K., Horaud, R., & Mateus, D. (2017) · CRC Press eBooks · doi:10.1201/b12281-15 · Cited by 10
Deformable Registration of Feature-Endowed Point Sets Based on Tensor Fields
Wassermann, D., Ross, J. C., Washko, G. R., Wells, W. M., & Estépar, R. S. J. (2014) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2014.355 · Cited by 4
Cited by
Image Matching from Handcrafted to Deep Features: A Survey
Ma, J., Jiang, X., Fan, A., Jiang, J., & Yan, J. (2021) · International Journal of Computer Vision · doi:10.1007/s11263-020-01359-2 · Cited by 990
Self-citationMa, J., Zhao, J., Jiang, J., Zhou, H., & Guo, X. (2019) · International Journal of Computer Vision · doi:10.1007/s11263-018-1117-z · Cited by 601
Self-citationA review of multimodal image matching: Methods and applications
Jiang, X., Ma, J., Xiao, G., Shao, Z., & Guo, X. (2021) · Information Fusion · doi:10.1016/j.inffus.2021.02.012 · Cited by 532
Self-citationGuided Locality Preserving Feature Matching for Remote Sensing Image Registration
Ma, J., Jiang, J., Zhou, H., Zhao, J., & Guo, X. (2018) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2018.2820040 · Cited by 283
Self-citation
Metadata
- Authors
- Ma, J., Zhao, J., & Yuille, A. L.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2016-01
- Volume
- 25
- Issue
- 1
- Pages
- 53-64
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W2124141313
- Cited by
- 334
- References
- 43
- FWCI
- 37.17
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
