Abstract
Algorithms to detect pairs of edges that could be ends of a straight homogeneous generalized cylinder (SHGC) are proposed. Geometrical constraints for the ends of an SHGC are utilized to group edge elements and edge segments in a complex image. Two methods are investigated. The first algorithm is for a subset of SHGCs for which scaling factors of the cross section at both ends are the same. The second algorithm is for any SHGC. However, a modified version is implemented to reduce computation; given a reference and edge, it finds the edges possibly paired with it. Several examples of ends extracted from real images are reported to show the feasibility of the algorithm. >
Sign-in/Register to access full text options 
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.
