|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM167708953 |
| 003 |
DE-627 |
| 005 |
20231223113533.0 |
| 007 |
tu |
| 008 |
231223s2007 xx ||||| 00| ||eng c |
| 028 |
5 |
2 |
|a pubmed24n0559.xml
|
| 035 |
|
|
|a (DE-627)NLM167708953
|
| 035 |
|
|
|a (NLM)17224611
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Carneiro, Gustavo
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Supervised learning of semantic classes for image annotation and retrieval
|
| 264 |
|
1 |
|c 2007
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ohne Hilfsmittel zu benutzen
|b n
|2 rdamedia
|
| 338 |
|
|
|a Band
|b nc
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 27.03.2007
|
| 500 |
|
|
|a Date Revised 16.01.2007
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status MEDLINE
|
| 520 |
|
|
|a A probabilistic formulation for semantic image annotation and retrieval is proposed. Annotation and retrieval are posed as classification problems where each class is defined as the group of database images labeled with a common semantic label. It is shown that, by establishing this one-to-one correspondence between semantic labels and semantic classes, a minimum probability of error annotation and retrieval are feasible with algorithms that are 1) conceptually simple, 2) computationally efficient, and 3) do not require prior semantic segmentation of training images. In particular, images are represented as bags of localized feature vectors, a mixture density estimated for each image, and the mixtures associated with all images annotated with a common semantic label pooled into a density estimate for the corresponding semantic class. This pooling is justified by a multiple instance learning argument and performed efficiently with a hierarchical extension of expectation-maximization. The benefits of the supervised formulation over the more complex, and currently popular, joint modeling of semantic label and visual feature distributions are illustrated through theoretical arguments and extensive experiments. The supervised formulation is shown to achieve higher accuracy than various previously published methods at a fraction of their computational cost. Finally, the proposed method is shown to be fairly robust to parameter tuning
|
| 650 |
|
4 |
|a Journal Article
|
| 650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
| 650 |
|
4 |
|a Research Support, U.S. Gov't, Non-P.H.S.
|
| 700 |
1 |
|
|a Chan, Antoni B
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Moreno, Pedro J
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Vasconcelos, Nuno
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 29(2007), 3 vom: 16. März, Seite 394-410
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:29
|g year:2007
|g number:3
|g day:16
|g month:03
|g pages:394-410
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 29
|j 2007
|e 3
|b 16
|c 03
|h 394-410
|