ICAR Research Data Repository for Knowledge Management
Combining spanning trees and normalized cuts for internet retrieval
DSpace at IIT Bombay
View Archive Info| Field | Value | |
| Title |
Combining spanning trees and normalized cuts for internet retrieval
|
|
| Creator |
CHANDRAN, S
RANJAN, A |
|
| Subject |
normalized cuts
clustering internet retrieval |
|
| Description |
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.
|
|
| Publisher |
SPIE-INT SOC OPTICAL ENGINEERING
|
|
| Date |
2011-10-24T00:31:11Z
2011-12-15T09:11:20Z 2011-10-24T00:31:11Z 2011-12-15T09:11:20Z 2004 |
|
| Type |
Proceedings Paper
|
|
| Identifier |
INTERNET IMAGING V,5304,37-44
0-8194-5207-6 0277-786X http://dspace.library.iitb.ac.in/xmlui/handle/10054/15281 http://hdl.handle.net/100/2002 |
|
| Source |
5th Conference on Internet Imaging,San Jose, CA,JAN 19-20, 2004
|
|
| Language |
English
|
|