Pareto-depth for multiple-query image retrieval

Most content-based image retrieval systems consider either one single query, or multiple queries that include the same object or represent the same semantic information. In this paper, we consider the content-based image retrieval problem for multiple query images corresponding to different image se...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 24(2015), 2 vom: 08. Feb., Seite 583-94
1. Verfasser: Hsiao, Ko-Jen (VerfasserIn)
Weitere Verfasser: Calder, Jeff, Hero, Alfred O 3rd
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2015
Zugriff auf das übergeordnete Werk:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Schlagworte:Journal Article Research Support, U.S. Gov't, Non-P.H.S.
LEADER 01000caa a22002652 4500
001 NLM244470324
003 DE-627
005 20250217214457.0
007 cr uuu---uuuuu
008 231224s2015 xx |||||o 00| ||eng c
024 7 |a 10.1109/TIP.2014.2378057  |2 doi 
028 5 2 |a pubmed25n0814.xml 
035 |a (DE-627)NLM244470324 
035 |a (NLM)25494509 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Hsiao, Ko-Jen  |e verfasserin  |4 aut 
245 1 0 |a Pareto-depth for multiple-query image retrieval 
264 1 |c 2015 
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 30.03.2015 
500 |a Date Revised 14.01.2015 
500 |a published: Print-Electronic 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a Most content-based image retrieval systems consider either one single query, or multiple queries that include the same object or represent the same semantic information. In this paper, we consider the content-based image retrieval problem for multiple query images corresponding to different image semantics. We propose a novel multiple-query information retrieval algorithm that combines the Pareto front method with efficient manifold ranking. We show that our proposed algorithm outperforms state of the art multiple-query retrieval algorithms on real-world image databases. We attribute this performance improvement to concavity properties of the Pareto fronts, and prove a theoretical result that characterizes the asymptotic concavity of the fronts 
650 4 |a Journal Article 
650 4 |a Research Support, U.S. Gov't, Non-P.H.S. 
700 1 |a Calder, Jeff  |e verfasserin  |4 aut 
700 1 |a Hero, Alfred O  |c 3rd  |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 24(2015), 2 vom: 08. Feb., Seite 583-94  |w (DE-627)NLM09821456X  |x 1941-0042  |7 nnns 
773 1 8 |g volume:24  |g year:2015  |g number:2  |g day:08  |g month:02  |g pages:583-94 
856 4 0 |u http://dx.doi.org/10.1109/TIP.2014.2378057  |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 24  |j 2015  |e 2  |b 08  |c 02  |h 583-94