Abstract
Two techniques for extracting foreground edges from an edge map are quantitatively tested and compared. Although Amir and Lindenbaum’s algorithm (Comput. Vision and Image Understanding 76 (1) (1999) 7) and Venkatesh and Rosin’s algorithm (Comput. Vision Graphics Image Process. 57 (2) (1995) 146) operate on very different principles it is shown that their results or of similar quality. The advantage of Venkatesh and Rosin’s algorithm is that it is computationally more efficient and does not require tuning parameters.
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.
