Higher Dimensional Affine Registration and Vision Applications

  • Yu-Tseh Chi
  • S. M. Nejhum Shahed
  • Jeffrey Ho
  • Ming-Hsuan Yang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5305)


Affine registration has a long and venerable history in computer vision literature, and extensive work have been done for affine registrations in ℝ2 and ℝ3. In this paper, we study affine registrations in ℝ m for m > 3, and to justify breaking this dimension barrier, we show two interesting types of matching problems that can be formulated and solved as affine registration problems in dimensions higher than three: stereo correspondence under motion and image set matching. More specifically, for an object undergoing non-rigid motion that can be linearly modelled using a small number of shape basis vectors, the stereo correspondence problem can be solved by affine registering points in ℝ3n . And given two collections of images related by an unknown linear transformation of the image space, the correspondences between images in the two collections can be recovered by solving an affine registration problem in ℝ m , where m is the dimension of a PCA subspace. The algorithm proposed in this paper estimates the affine transformation between two point sets in ℝ m . It does not require continuous optimization, and our analysis shows that, in the absence of data noise, the algorithm will recover the exact affine transformation for almost all point sets with the worst-case time complexity of O(mk 2), k the size of the point set. We validate the proposed algorithm on a variety of synthetic point sets in different dimensions with varying degrees of deformation and noise, and we also show experimentally that the two types of matching problems can indeed be solved satisfactorily using the proposed affine registration algorithm.


Registration Algorithm Vision Application Iterative Close Point Iterative Close Point Algorithm Nonrigid Motion 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Scott, G., Lonquiet-Higgins, C.: An algorithm for associating the features of two images. Proc. of Royal Society of London B244, 21–26 (1991)CrossRefGoogle Scholar
  2. 2.
    Hartley, R., Zisserman, A.: Multiple View Geometry in Computer Vision. Cambridge University Press, Cambridge (2003)Google Scholar
  3. 3.
    Chui, H., Rangarajan, A.: A new algorithm for non-rigid point matching. In: Proc. IEEE Conf. on Comp. Vision and Patt. Recog, vol. 2, pp. 44–51 (2000)Google Scholar
  4. 4.
    Toamsi, C., Kanade, T.: Shape and motion from image streams under orthography—a factorization method. Int. J. Computer Vision 9(2), 137–154 (1992)CrossRefGoogle Scholar
  5. 5.
    Bregler, C., Hertzmann, A., Biermann, H.: Recovering non-rigid 3d shape from image streams. In: Proc. IEEE Conf. on Comp. Vision and Patt. Recog., pp. 2690–2696 (2000)Google Scholar
  6. 6.
    Besel, P.J., Mckay, H.D.: A method for registration of 3-d shapes. PAMI 14, 239–256 (1992)Google Scholar
  7. 7.
    Zhang, Z.: Iterative point matching for registration of free-form curves and surfaces. Int. J. Computer Vision 13, 119–152 (1994)CrossRefGoogle Scholar
  8. 8.
    Kanatani, K.: Motion segmentation by subspace separation and model selection. In: Proc. Int. Conf. on Computer Vision, vol. 2, pp. 586–591 (2001)Google Scholar
  9. 9.
    Brand, M.: Morphable 3d models from video. In: Proc. IEEE Conf. on Comp. Vision and Patt. Recog., vol. 2, pp. 456–463 (2001)Google Scholar
  10. 10.
    Fitzgibbon, A.W.: Robust registration of 2d and 3d point sets. Computer Vision and Image Understanding 2, 1145–1153 (2003)Google Scholar
  11. 11.
    Sharp, G.C., Lee, S.W., Wehe, D.K.: Icp registration using invariant features. IEEE Transactions on Pattern Analysis and Machine Intelligence 24, 90–102 (2002)CrossRefGoogle Scholar
  12. 12.
    Rusinkiewicz, S., Levoy, M.: Efficient variants of the icp algorithm. In: Proc. Third International Conference on 3D Digital Imaging and Modeling (3DIM), pp. 145–152 (2001)Google Scholar
  13. 13.
    Granger, S., Pennec, X.: Multi-scale em-icp: A fast and robust approach for surface registration. In: Proc. European Conf. on Computer Vision, vol. 3, pp. 418–432 (2002)Google Scholar
  14. 14.
    Makadia, A., Patterson, A.I., Daniilidis, K.: Fully automatic registration of 3d point clouds. In: Proc. IEEE Conf. on Comp. Vision and Patt. Recog., vol. 1, pp. 1297–1304 (2006)Google Scholar
  15. 15.
    Chung, F.R.K.: Spectral Graph Theory. American Mathematical Society (1997)Google Scholar
  16. 16.
    Hirsch, M.: Differential Topology. Springer, Heidelberg (1976)zbMATHGoogle Scholar
  17. 17.
    Fischler, M., Bolles, R.: Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography. Communications of the ACM 24, 381–395 (1981)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Yu-Tseh Chi
    • 1
  • S. M. Nejhum Shahed
    • 1
  • Jeffrey Ho
    • 1
  • Ming-Hsuan Yang
    • 2
  1. 1.CISE DepartmentUniversity of FloridaGainesville 
  2. 2.EECSUniversity of CaliforniaMerced 

Personalised recommendations