Hierarchical browsing and search of large image databases

The advent of large image databases (>10000) has created a need for tools which can search and organize images automatically by their content. This paper focuses on the use of hierarchical tree-structures to both speed-up search-by-query and organize databases for effective browsing. The first pa...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 9(2000), 3 vom: 15., Seite 442-55
1. Verfasser: Chen, J Y (VerfasserIn)
Weitere Verfasser: Bouman, C A, Dalton, J C
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2000
Zugriff auf das übergeordnete Werk:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM177432683
003 DE-627
005 20231223150214.0
007 cr uuu---uuuuu
008 231223s2000 xx |||||o 00| ||eng c
024 7 |a 10.1109/83.826781  |2 doi 
028 5 2 |a pubmed24n0592.xml 
035 |a (DE-627)NLM177432683 
035 |a (NLM)18255415 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Chen, J Y  |e verfasserin  |4 aut 
245 1 0 |a Hierarchical browsing and search of large image databases 
264 1 |c 2000 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 02.10.2012 
500 |a Date Revised 07.02.2008 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a The advent of large image databases (>10000) has created a need for tools which can search and organize images automatically by their content. This paper focuses on the use of hierarchical tree-structures to both speed-up search-by-query and organize databases for effective browsing. The first part of this paper develops a fast search algorithm based on best-first branch and bound search. This algorithm is designed so that speed and accuracy may be continuously traded-off through the selection of a parameter lambda. We find that the algorithm is most effective when used to perform an approximate search, where it can typically reduce computation by a factor of 20-40 for accuracies ranging from 80% to 90%. We then present a method for designing a hierarchical browsing environment which we call a similarity pyramid. The similarity pyramid groups similar images together while allowing users to view the database at varying levels of resolution. We show that the similarity pyramid is best constructed using agglomerative (bottom up) clustering methods, and present a fast sparse clustering method which dramatically reduces both memory and computation over conventional methods 
650 4 |a Journal Article 
700 1 |a Bouman, C A  |e verfasserin  |4 aut 
700 1 |a Dalton, J C  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society  |d 1992  |g 9(2000), 3 vom: 15., Seite 442-55  |w (DE-627)NLM09821456X  |x 1941-0042  |7 nnns 
773 1 8 |g volume:9  |g year:2000  |g number:3  |g day:15  |g pages:442-55 
856 4 0 |u http://dx.doi.org/10.1109/83.826781  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 9  |j 2000  |e 3  |b 15  |h 442-55