|
Accession number;04A0171221
|
| Title;A MODEFIED METHOD OF ADAPTIVE SPACE-FILLING CODING |
| Author;
UESHIGE Y
(Kitakyushu Foundation For The Advancement Of Ind.)
HIRATSUKA S
(Fukuoka Ind. Sci. & Technol. Foundation)
KAMATA S
(Waseda Univ., Kitakyushu, Jpn)
|
Journal Title;IEIC Technical Report (Institute of Electronics, Information and Communication Engineers)
|
Journal Code:S0532B
|
ISSN:0913-5685
|
|
VOL.103;NO.539(IE2003 148-162);PAGE.71-74(2004)
|
| Figure&Table&Reference;FIG.5, REF.6 |
| Pub. Country;Japan |
| Language;English |
| Abstract;This paper describes a new method of adaptive space filling coding. One-dimensional (1-D) pixel data along with a space filling scanning can be generated adaptively from an original image by the conventional method. Because the scanning path is irregular, encoding cost for the scanning path information becomes expensive. This paper presents an algorithm for encoding scanning path information. Through the construction of a minimum spanning tree (MST) to represent the scanning path, absolute sum of difference between adjacent small blocks is evaluated. Context of the image selectively changes in accordance with this evaluation in order to generate Hilbert tree as a regular tree in flat region. Reduction of this scanning path information can be achieved. It is sufficient for describing the MST to encode the difference between the MST and the regular tree. Our experiment results show that the proposed method is efficient. (author abst.) |
|
|
|
Related Articles;
|
