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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
