|
|
|
|
LEADER |
01000naa a22002652 4500 |
001 |
NLM211015210 |
003 |
DE-627 |
005 |
20231224012721.0 |
007 |
tu |
008 |
231224s1985 xx ||||| 00| ||eng c |
028 |
5 |
2 |
|a pubmed24n0703.xml
|
035 |
|
|
|a (DE-627)NLM211015210
|
035 |
|
|
|a (NLM)21869263
|
040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
041 |
|
|
|a eng
|
100 |
1 |
|
|a Cohen, Y
|e verfasserin
|4 aut
|
245 |
1 |
0 |
|a Hierarchical coding of binary images
|
264 |
|
1 |
|c 1985
|
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 02.10.2012
|
500 |
|
|
|a Date Revised 12.11.2019
|
500 |
|
|
|a published: Print
|
500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
520 |
|
|
|a Quadtrees are a compact hierarchical method of representation of images. In this paper, we explore a number of hierarchical image representations as applied to binary images, of which quadtrees are a single exemplar. We discuss quadtrees, binary trees, and an adaptive hierarchical method. Extending these methods into the third dimension of time results in several other methods. All of these methods are discussed in terms of time complexity, worst case and average compression of random images, and compression results on binary images derived from natural scenes. The results indicate that quadtrees are the most effective for two-dimensional images, but the adaptive algorithms are more effective for dynamic image sequences
|
650 |
|
4 |
|a Journal Article
|
700 |
1 |
|
|a Landy, M S
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Pavel, M
|e verfasserin
|4 aut
|
773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 7(1985), 3 vom: 01. März, Seite 284-98
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
773 |
1 |
8 |
|g volume:7
|g year:1985
|g number:3
|g day:01
|g month:03
|g pages:284-98
|
912 |
|
|
|a GBV_USEFLAG_A
|
912 |
|
|
|a SYSFLAG_A
|
912 |
|
|
|a GBV_NLM
|
912 |
|
|
|a GBV_ILN_350
|
951 |
|
|
|a AR
|
952 |
|
|
|d 7
|j 1985
|e 3
|b 01
|c 03
|h 284-98
|