Abstract
How to use a polygon with the fewest possible sides to approximate a shape boundary is an important issue in pattern recognition and image processing. A novel split-and-merge technique(SMT) is proposed. SMT starts with an initial shape boundary segmentation, split and merge are then alternately done against the shape boundary. The procedure is halted when the pre-specified iteration number is achieved. For increasing stability of SMT and improving its robustness to the initial segmentation, a ranking-selection scheme is utilized to choose the splitting and merging points. The experimental results show its superiority.
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.
