Combining spanning trees and normalized cuts for Internet retrieval

Sharat Chandran; Abhishek Ranjan

doi:10.1117/12.528556

15 December 2003 Combining spanning trees and normalized cuts for Internet retrieval

Sharat Chandran, Abhishek Ranjan

Proceedings Volume 5304, Internet Imaging V; (2003) https://doi.org/10.1117/12.528556
Event: Electronic Imaging 2004, 2004, San Jose, California, United States

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.

Citation Download Citation

Sharat Chandran and Abhishek Ranjan "Combining spanning trees and normalized cuts for Internet retrieval", Proc. SPIE 5304, Internet Imaging V, (15 December 2003); https://doi.org/10.1117/12.528556

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available