Share Email Print
cover

Proceedings Paper

Combining spanning trees and normalized cuts for Internet retrieval
Author(s): Sharat Chandran; Abhishek Ranjan
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 15 December 2003
PDF: 8 pages
Proc. SPIE 5304, Internet Imaging V, (15 December 2003); doi: 10.1117/12.528556
Show Author Affiliations
Sharat Chandran, Indian Institute of Technology Bombay (India)
University of Maryland/College Park (United States)
Abhishek Ranjan, Indian Institute of Technology Bombay (India)


Published in SPIE Proceedings Vol. 5304:
Internet Imaging V
Simone Santini; Raimondo Schettini, Editor(s)

© SPIE. Terms of Use
Back to Top