Abstract
In this paper, a simple but efficient scheme to recognize shapes is proposed. In our scheme, all of the boundary points are used to calculate the centroid of an object, then the distance between each feature point and the centroid is computed. We have shown that the time complexity of our shape matching algorithm is O( m), where m is the number of feature points. The most important advantage of our method is its independence to translation, rotation and scaling of objects.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
