The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2011 vol.33)
pp: 1324-1338
S.M. Shahed Nejhum , University of Florida, Gainesville
Jeffrey Ho , University of Florida, Gainesville
Ming-Hsuan Yang , University of California at Merced, Merced
ABSTRACT
Affine registration has a long and venerable history in computer vision literature, and in particular, extensive work has been done for affine registration in {\hbox{\rlap{I}\kern 2.0pt{\hbox{R}}}}^2 and {\hbox{\rlap{I}\kern 2.0pt{\hbox{R}}}}^3. This paper studies affine registration in {{\hbox{\rlap{I}\kern 2.0pt{\hbox{R}}}}}^m with m typically ranging from 4 to 12. To justify breaking of this dimension barrier, the first part of the paper describes three novel matching problems that can be formulated and solved as affine point-set registration problems in dimensions greater than three: stereo correspondence under motion, image set matching, and covariant point-set matching, problems that are not only interesting in their own right but also have potential for important vision applications. Unfortunately, most of the existing affine registration algorithms do not generalize easily to higher dimensions due to their inefficiency. Therefore, the second part of this paper develops a novel algorithm for estimating the affine transform between two point sets in {\hbox{\rlap{I}\kern 2.0pt{\hbox{R}}}}^m. Specifically, the algorithm follows the common approach of iteratively solving the correspondences and transform. The initial correspondences are determined using the novel notion of local spectral features, features constructed from local distance matrices. Unlike many correspondence-based methods, the proposed algorithm is capable of registering point sets of different size, and the use of local features provides some degree of robustness against noise and outliers. The proposed algorithm is validated on a variety of synthetic point sets in different dimensions with varying degrees of deformation and noise, and the paper also shows experimentally that several instances of the aforementioned three matching problems can indeed be solved satisfactorily using the proposed affine registration algorithm.
INDEX TERMS
Affine registration, point matching, stereo correspondence.
CITATION
S.M. Shahed Nejhum, Jeffrey Ho, Ming-Hsuan Yang, "Higher-Dimensional Affine Registration and Vision Applications", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.33, no. 7, pp. 1324-1338, July 2011, doi:10.1109/TPAMI.2010.219
REFERENCES
[1] A. Makadia, A.I. Patterson, and K. Daniilidis, "Fully Automatic Registration of 3D Point Clouds," Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 1297-1304, 2006.
[2] S. Belongie, J. Malik, and J. Puzicha, "Shape Matching and Object Recognition Using Shape Contexts," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 4, pp. 509-522, Apr. 2002.
[3] P.J. Besel and H.D. Mckay, "A Method for Registration of 3-D Shapes," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, no. 2, pp. 239-256, Feb. 1992.
[4] M. Brand, "Morphable 3D Models from Video," Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 456-463, 2001.
[5] C. Bregler, A. Hertzmann, and H. Biermann, "Recovering Non-Rigid 3D Shape from Image Streams," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 2690-2696, 2000.
[6] N. Campbell, "Multivariate Analysis I: Robust Covariance Estimation," Applied Statistics, vol. 29, no. 3, pp. 231-2137, 1980.
[7] M. Carcassoni and E. Hancock, "Spectral Correspondence for Point Pattern Matching," Pattern Recognition, vol. 36, no. 1, pp. 193-204, 2003.
[8] Y.-T. Chi, N. Shahed, J. Ho, and M.-H. Yang, "Higher Dimensional Affine Registration and Vision Applications," Proc. European Conf. Computer Vision, vol. 4, pp. 256-269, 2008.
[9] H. Chui and A. Rangarajan, "A New Algorithm for Non-Rigid Point Matching," Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 44-51, 2000.
[10] F.R.K. Chung, Spectral Graph Theory. Am. Math. Soc., 1997.
[11] T. Cootes, C. Taylor, D. Cooper, and J. Graham, "Active Shape Models: Their Training and Application," Computer Vision and Image Understanding, vol. 61, no. 1, pp. 38-59, 1995.
[12] S. Du, N. Zheng, S. Ying, and J. Liu, "Affine Iterative Closest Point Algorithm for Point Set Registration," Pattern Recognition Letters, vol. 31, no. 9, pp. 791-799, 2010.
[13] R. Duda and P. Hart, Pattern Classification. Wiley-Interscience, 2000.
[14] M. Fischler and R. Bolles, "Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography," Comm. ACM, vol. 24, no. 6, pp. 381-395, June 1981.
[15] A.W. Fitzgibbon, "Robust Registration of 2D and 3D Point Sets," Computer Vision and Image Understanding, vol. 2, nos. 13/14, pp. 1145-1153, 2003.
[16] J. Flusser and T. Suk, "Pattern Recognition by Affine Moment Invariants," Pattern Recognition, vol. 1, pp. 167-174, 1993.
[17] M. Garland and P. Heckbert, "Surface Simplification Using Quadric Error Metrics," Proc. SIGGRAPH, pp. 209-216, 1998.
[18] N. Gelfand, N. Mitra, L. Guibas, and H. Pottmann, "Robust Global Registration," Proc. Symp. Geometry Processing, pp. 197-207, 2005.
[19] C. Gope and N. Kehtarnavaz, "Affine Invariant Comparison of Point-Sets Using Convex Hulls and Hausdorff Distances," Pattern Recognition, vol. 40, pp. 309-320, 2007.
[20] A. Goshtasby and G. Stockman, "Point Pattern Matching Using Convex Hull Edges," IEEE Trans. Systems, Man, and Cybernetics, vol. 15, pp. 631-637, 1985.
[21] S. Granger and X. Pennec, "Multi-Scale EM-ICP: A Fast and Robust Approach for Surface Registration," Proc. European Conf. Computer Vision, vol. 3, pp. 418-432, 2002.
[22] M. Hagedoorn and R. Veltkamp, "Reliable and Efficient Pattern Matching Using an Affine Invariant Metric," Int'l J. Computer Vision, vol. 21, nos. 2/3, pp. 203-225, 1999.
[23] R. Hartley and A. Zisserman, Multiple View Geometry in Computer Vision, second ed. Cambridge Univ. Press, 2003.
[24] M.T. Heath, Scientific Computing—An Introductory Survey. McGraw-Hill, 2002.
[25] J. Heikkila, "Pattern Matching with Affine Moment Descriptors," Pattern Recognition, vol. 37, no. 9, pp. 1825-1834, 2004.
[26] B. Horn, "Closed-Form Solution of Absolute Orientation Using Unit Quaternions," J. Optical Soc. Am. A: Optics, Image Science, and Vision, vol. 4, no. 4, pp. 629-642, 1987.
[27] M.-K. Hu, "Visual Pattern Recognition by Moment Invariants," IEEE Trans. Information Theory, vol. IT-8, no. 2, pp. 179-187, Feb. 1962.
[28] D. Huttenlocher, "Fast Affine Point Matching: An Output-Sensitive Method," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 263-268, 1991.
[29] D. Huttenlocher, D. Klanderman, and A. Rucklige, "Comparing Images Using the Hausdorff Distance," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 9, pp. 850-863, Sept. 1993.
[30] A. Johnson and M. Herbert, "Using Spin Images for efficient Object Recognition in Cluttered 3D Scenes," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 21, no. 5, pp. 433-449, May 1999.
[31] I. Jolliffe, Principal Component Analysis. Springer-Verlag, 1986.
[32] Y. Lamdan, J. Schwartz, and H. Wolfson, "Affine Invariant Model-Based Object Recognition," IEEE Trans. Robotics Automation, vol. 6, no. 5, pp. 578-589, Oct. 1990.
[33] H. Li and R. Hartley, "The 3D-3D Registration Problem Revisited," Proc. IEEE Int'l Conf. Computer Vision, 2007.
[34] M. Pauly and M. Gross, "Spectral Processing of Point-Sampled Geometry," Proc. ACM SIGGRAPH, pp. 379-386, 2001.
[35] T. Reiss, "The Revised Fundamental Theorem of Moment Invariants," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 8, pp. 830-834, Aug. 1991.
[36] W. Rucklidge, "Efficiently Locating Objects Using the Hausdorff Distance," Int'l J. Computer Vision, vol. 24, no. 3, pp. 251-270, 1997.
[37] S. Rusinkiewicz and M. Levoy, "Efficient Variants of the ICP Algorithm," Proc. Third Int'l Conf. 3D Digital Imaging and Modeling, pp. 145-152, 2001.
[38] E. Ruymagaart, "A Robust Principal Component Analysis," J. Multivariate Analysis, vol. 1, pp. 485-497, 1981.
[39] R. Sarfari, N. Narsimhamurthi, M. Shridhar, and M. Ahmadi, "Affine Point Pattern Matching and Its Application to Form Registration," Proc. IEEE Symp. Circuits and Systems, vol. 2, pp. 656-659, 1996.
[40] S. Sclaroff and A. Pentland, "Modal Matching for Correspondence and Recognition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 6, pp. 545-561, June 1995.
[41] G. Scott and C. Lonquiet-Higgins, "An Algorithm for Associating the Features of Two Images," Proc. Royal Soc. London, vol. B244, pp. 21-26, 1991.
[42] G. Scott and C. Lonquiet-Higgins, "An Algorithm for Associating the Features of Two Images," Proc. Royal Soc. London, vol. B244, pp. 21-26, 1991.
[43] L. Shapiro and J. Brady, "Feature-Based Correspondence: An Eigenvector Approach," Image and Vision Computing, vol. 10, no. 5, pp. 283-288, 1992.
[44] G.C. Sharp, S.W. Lee, and D.K. Wehe, "ICP Registration Using Invariant Features," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 1, pp. 90-102, Jan. 2002.
[45] J. Sprinzak and M. Werman, "Affine Point Matching," Pattern Recognition Letters, vol. 15, pp. 337-339, 1994.
[46] G. Stockman, "Object Recognition and Localization via Pose Clustering," Computer Vision, Graphics, and Image Processing, vol. 40, no. 3, pp. 361-387, 1987.
[47] H. Suesse and W. Ortmann, "Robust Matching of Affinely Transformed Objects," Proc. Int'l Conf. Image Processing, vol. 2, pp. 375-378, 2003.
[48] C. Toamsi and T. Kanade, "Shape and Motion from Image Streams Under Orthography—A Factorization Method," Int'l J. Computer Vision, vol. 9, no. 2, pp. 137-154, 1992.
[49] F.D.L. Torre and M. Black, "Robust Principal Component Analysis for Computer Vision," Proc. Int'l Conf. Computer Vision, pp. 362-369, 2001.
[50] K. Voss and H. Suesse, "Affine Point Pattern Matching," Proc. Pattern Recognition, pp. 155-162, 2001.
[51] T. Wakahara, Y. Kimura, and A. Tomono, "Affine-Invariant Recognition of Gray-Scale Characters Using Global Affine Transformation Correlation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 4, pp. 384-395, Apr. 2001.
[52] Z. Wang and H. Xiao, "Dimension-Free Affine Shape Matching through Subspace Invariance," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2009.
[53] H. Wolfson and I. Rigoutsos, "Geometric Hashing: An Overview," IEEE Computational Science and Eng., vol. 4, no. 4, pp. 10-21, Oct. 1997.
[54] L. Xu and A. Yuille, "Robust Principal Component Analysis by Self-Organizing Rules Based on Statistical Physics Approach," IEEE Trans. Neural Networks, vol. 6, no. 1, pp. 131-143, Jan. 1995.
[55] Z. Yang and F. Cohen, "Cross-Weighted Moments and Affine Invariants for Image Registration and Matching," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 21, no. 8, pp. 804-814, Aug. 1999.
[56] Z. Yang and F. Cohen, "Image Registration and Object Recognition Using Affine Invariants and Convex Hulls," IEEE Trans. Image Processing, vol. 8, no. 7, pp. 934-946, July 1999.
[57] Z. Zhang, "Iterative Point Matching for Registration of Free-Form Curves," Int'l J. Computer Vision, vol. 13, no. 2, pp. 119-152, 1994.
11 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool