Please use this identifier to cite or link to this item:
|Title:||Combining spanning trees and normalized cuts for internet retrieval|
|Publisher:||SPIE-INT SOC OPTICAL ENGINEERING|
|Citation:||INTERNET IMAGING V,5304,37-44|
|Abstract:||Graph based approaches succeed in producing meaningful regions in images when they are to be stored as entities in a database for content-based retrieval. Despite controlling various parameters, the bottom-up approach(1) produces too many segments for an Internet search retrieval scheme. The top-down scheme(2) can be adjusted for wide area searches, but has a high computational cost. In this work we combine the two approaches and retain the advantages of both approaches. The key idea is to use local approach for reducing the size of the problem that is fed to the normalized cut approach. Our algorithm runs in O(n log n) time.|
|Appears in Collections:||Proceedings papers|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.