15 December 2003 Combining spanning trees and normalized cuts for Internet retrieval
Author Affiliations +
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 produces too many segments for an Internet search retrieval scheme. The top-down scheme 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.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Sharat Chandran, Sharat Chandran, Abhishek Ranjan, Abhishek Ranjan, "Combining spanning trees and normalized cuts for Internet retrieval", Proc. SPIE 5304, Internet Imaging V, (15 December 2003); doi: 10.1117/12.528556; https://doi.org/10.1117/12.528556
PROCEEDINGS
8 PAGES


SHARE
Back to Top