Skip to main content

Obtaining Ellipse Common Tangent Line Equations by the Rolling Tangent Line Method

  • Conference paper
  • First Online:
Book cover Machine Learning and Intelligent Communications (MLICOM 2017)

Abstract

In the field of image processing and machine vision, it is sometimes necessary to obtain common tangent line equations and tangent point coordinates from ellipses. A rolling tangent line method was proposed to obtain the 4 common tangent line equations and 8 tangent point coordinates from two ellipses in this paper. The principle of this method is simple and it is easy to program on a computer. Use this method to process two ellipse targets in an image and the experiment results show that the 4 common tangent equations and 8 tangent point coordinates can be obtained in high precision and the maximum execution time is less than 0.1 s.

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. Mateos, G.G.: A camera calibration technique using targets of circular features. In: 5th Ibero-America Symposium On Pattern Recognition (SIARP) (2000)

    Google Scholar 

  2. Guangjun, Z., Fuqiang, Z.: Position and orientation estimation method for landing of unmanned aerial vehicle with two circle based computer vision. Acta Aeronautica et Astronautica Sinica 26(3), 344–348 (2005)

    Google Scholar 

  3. Xiaoxiang, Z.: Seek common tangent with the iterative method. Discipl. Explor. 5, 28–29 (2015)

    Google Scholar 

  4. Hartley, R., Zisserman, A.: Multiple View Geometry in Computer Vision. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  5. Otsu, N.: A threshold selection method from gray-level histograms. IEEE Trans. Syst. Man, Cybern. 9(1), 62–66 (1979)

    Article  MathSciNet  Google Scholar 

  6. Cabaret, L., Lacassagne, L., Oudni, L.: A review of world’s fastest connected component labeling algorithms: speed and energy estimation. In: 2014 Conference on IEEE Design and Architectures for Signal and Image Processing (DASIP), pp. 1–6 (2014)

    Google Scholar 

  7. Wu, K., Otoo, E., Shoshani, A.: Optimizing connected component labeling algorithms. In: Medical Imaging. International Society for Optics and Photonics, pp. 1965–1976 (2005)

    Google Scholar 

  8. Weiss, M.A.: Data Structures and Algorithm Analysis in C. Addison-Wesley, Reading (1997)

    MATH  Google Scholar 

  9. Amirfakhrian, M., Mafikandi, H.: Approximation of parametric curves by moving least squares method. Appl. Math. Comput. 283, 290–298 (2016)

    MathSciNet  MATH  Google Scholar 

  10. Apollonius of Perga: Treatise on Conic Sections. Cambridge University Press, Cambridge (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mingjian Sun .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Feng, N., Jiang, T., Duan, S., Sun, M. (2018). Obtaining Ellipse Common Tangent Line Equations by the Rolling Tangent Line Method. In: Gu, X., Liu, G., Li, B. (eds) Machine Learning and Intelligent Communications. MLICOM 2017. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 227. Springer, Cham. https://doi.org/10.1007/978-3-319-73447-7_61

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-73447-7_61

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-73446-0

  • Online ISBN: 978-3-319-73447-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics