A METHOD OF COMPUTING A SPACE FILLING CURVE FOR ARBITRARILY SHAPED REGION
|
Accession number;04A0171222
|
| Title;A METHOD OF COMPUTING A SPACE FILLING CURVE FOR ARBITRARILY SHAPED REGION |
| Author;
HIRATSUKA S
(Fukuoka Ind. Sci. & Technol. Foundation)
UESHIGE Y
(Kitakyushu Foundation For The Advancement Of Ind.)
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.75-78(2004)
|
| Figure&Table&Reference;FIG.7, REF.9 |
| Pub. Country;Japan |
| Language;English |
| Abstract;The space filling curve (SFC) is defined as a one-to-one mapping between a two dimensional (2-D) space and a 1-D line segment. There are many applications using SFC in the area of image processing, computer graphics, database, etc. Though region-based image processing has been studied for over a decade, however, only a few applications utilized SFC to describe an arbitrarily shaped region appeared in literature. In this paper, we propose a robust and fast method of developing SFC for an arbitrarily shaped region. The method consists of four steps: (1) diving the target region into several squares, (2) linking the squares with a spanning tree, (3) setting Moore SFC in each of the square (Moore SFC is a close looped version of Hilbert's SFC presented by Moore in 1900), (4) connecting each of the Moore SFCs at the linking spots where two squares are linked together. We apply our method on lossy image compression to evaluate the performance. (author abst.) |
|
|
|
Related Articles;
|
|
