Binary partition tree as an efficient representation for image processing, segmentation, and information retrieval

This paper discusses the interest of binary partition trees as a region-oriented image representation. Binary partition trees concentrate in a compact and structured representation a set of meaningful regions that can be extracted from an image. They offer a multiscale representation of the image an...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 9(2000), 4 vom: 15., Seite 561-76
1. Verfasser: Salembier, P (VerfasserIn)
Weitere Verfasser: Garrido, L
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 NLM177432837
003 DE-627
005 20231223150214.0
007 cr uuu---uuuuu
008 231223s2000 xx |||||o 00| ||eng c
024 7 |a 10.1109/83.841934  |2 doi 
028 5 2 |a pubmed24n0592.xml 
035 |a (DE-627)NLM177432837 
035 |a (NLM)18255430 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Salembier, P  |e verfasserin  |4 aut 
245 1 0 |a Binary partition tree as an efficient representation for image processing, segmentation, and information retrieval 
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 16.12.2009 
500 |a Date Revised 07.02.2008 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a This paper discusses the interest of binary partition trees as a region-oriented image representation. Binary partition trees concentrate in a compact and structured representation a set of meaningful regions that can be extracted from an image. They offer a multiscale representation of the image and define a translation invariant 2-connectivity rule among regions. As shown in this paper, this representation can be used for a large number of processing goals such as filtering, segmentation, information retrieval and visual browsing. Furthermore, the processing of the tree representation leads to very efficient algorithms. Finally, for some applications, it may be interesting to compute the binary partition tree once and to store it for subsequent use for various applications. In this context, the paper shows that the amount of bits necessary to encode a binary partition tree remains moderate 
650 4 |a Journal Article 
700 1 |a Garrido, L  |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), 4 vom: 15., Seite 561-76  |w (DE-627)NLM09821456X  |x 1941-0042  |7 nnns 
773 1 8 |g volume:9  |g year:2000  |g number:4  |g day:15  |g pages:561-76 
856 4 0 |u http://dx.doi.org/10.1109/83.841934  |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 4  |b 15  |h 561-76