Skip to main content

Non-rigid Point Set Registration Based on Iterative Linear Optimization

  • Conference paper
  • First Online:
Advances in Image and Graphics Technologies (IGTA 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 634))

Included in the following conference series:

  • 703 Accesses

Abstract

This paper presents a novel point set registration algorithm based on iterative linear optimization, which can be used to register both rigid and non-rigid point set. Firstly, a new cost function was constructed to evaluate the summation of squared distance between the two point sets, in which rigid transformation, non-rigid elastic deformation and complex deformation were all included for consideration. Secondly, the proposed cost was linearized using to obtain a linear cost function of registration parameters. Thirdly, the registration parameters were solved by iterative optimization using Tikhonov regularization. Experimental results validated the performances of proposed method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Fitsgibbon, A.W.: Robust registration of 2D and 3D point set. Image Vis. Comput. 21(13), 1145–1153 (2001)

    Google Scholar 

  2. Hasler, D., Sbaiz, L., SÜSstrunk, S.: Outlier modeling in image matching. IEEE Trans. Pattern Anal. Mach. Intell. 25(3), 301–315 (2003)

    Article  Google Scholar 

  3. Jian, B., Vemuri, B.: A robust algorithm for point set registration using mixture of Gaussians. In: IEEE International Conference on Computer Vision, vol. 2, pp. 1246–1251(2005)

    Google Scholar 

  4. Chui, H., Rangarajan, A.: A new point matching for non-rigid registration. Comput. Vis. Image Underst. 89(2–3), 114–141 (2003)

    Article  MATH  Google Scholar 

  5. Sofien, B., Andrea, T.: Dynamic 2D/3D registration. The Eurographics Association. http://lgg.epfl.ch/2d3dRegistration

Download references

Acknowledgments

This research was supported by National Natural Science Foundation of China (Grant No. 51305390, 61501394) and Natural Science Foundation of HeBei Province (Grant No. F2016203312).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hongbin Lin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media Singapore

About this paper

Cite this paper

Lin, H., Zhang, D. (2016). Non-rigid Point Set Registration Based on Iterative Linear Optimization. In: Tan, T., et al. Advances in Image and Graphics Technologies. IGTA 2016. Communications in Computer and Information Science, vol 634. Springer, Singapore. https://doi.org/10.1007/978-981-10-2260-9_19

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-2260-9_19

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-2259-3

  • Online ISBN: 978-981-10-2260-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics