Peano scanning of arbitrary size images

A. Pérez; S. Kamata; E. Kawaguchi

doi:10.1109/ICPR.1992.202050

Peano scanning of arbitrary size images

A. Pérez, S. Kamata, E. Kawaguchi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

20 Citations (Scopus)

Abstract

Discrete space-filling curves are not uniquely defined. In addition to the condition that the curve must pass for all the points of the array only once, continuously, it is necessary to add some critera to select the lest curves. Our aim is to preserve two-dimensional continuity as much as possible. The weighted sum of the distances of the points in the curve is minimized, wkere the weights are inversely proportional to the spatial distance between the points. However, the minimum is not unique. Particularly, space-filling curves always come on symmetric pairs. The generation of a near optimal space-filling curve is done hierarchically.

Original language	English
Title of host publication	IAPR 1992 - 11th IAPR International Conference on Pattern Recognition
Subtitle of host publication	Image, Speech, and Signal Analysis
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	565-568
Number of pages	4
ISBN (Electronic)	0818629207
DOIs	https://doi.org/10.1109/ICPR.1992.202050
Publication status	Published - 1992
Externally published	Yes
Event	11th IAPR International Conference on Pattern Recognition, IAPR 1992 - The Hague, Netherlands Duration: 1992 Aug 30 → 1992 Sept 1

Publication series

Name	Proceedings - International Conference on Pattern Recognition
Volume	3
ISSN (Print)	1051-4651

Other

Other	11th IAPR International Conference on Pattern Recognition, IAPR 1992
Country/Territory	Netherlands
City	The Hague
Period	92/8/30 → 92/9/1

ASJC Scopus subject areas

Computer Vision and Pattern Recognition

Access to Document

10.1109/ICPR.1992.202050

Cite this

Pérez, A., Kamata, S., & Kawaguchi, E. (1992). Peano scanning of arbitrary size images. In IAPR 1992 - 11th IAPR International Conference on Pattern Recognition: Image, Speech, and Signal Analysis (pp. 565-568). [202050] (Proceedings - International Conference on Pattern Recognition; Vol. 3). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICPR.1992.202050

Peano scanning of arbitrary size images. / Pérez, A.; Kamata, S.; Kawaguchi, E.

IAPR 1992 - 11th IAPR International Conference on Pattern Recognition: Image, Speech, and Signal Analysis. Institute of Electrical and Electronics Engineers Inc., 1992. p. 565-568 202050 (Proceedings - International Conference on Pattern Recognition; Vol. 3).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Pérez, A, Kamata, S & Kawaguchi, E 1992, Peano scanning of arbitrary size images. in IAPR 1992 - 11th IAPR International Conference on Pattern Recognition: Image, Speech, and Signal Analysis., 202050, Proceedings - International Conference on Pattern Recognition, vol. 3, Institute of Electrical and Electronics Engineers Inc., pp. 565-568, 11th IAPR International Conference on Pattern Recognition, IAPR 1992, The Hague, Netherlands, 92/8/30. https://doi.org/10.1109/ICPR.1992.202050

@inproceedings{5f52f191f6b6419ba5c4203c9565e098,

title = "Peano scanning of arbitrary size images",

abstract = "Discrete space-filling curves are not uniquely defined. In addition to the condition that the curve must pass for all the points of the array only once, continuously, it is necessary to add some critera to select the lest curves. Our aim is to preserve two-dimensional continuity as much as possible. The weighted sum of the distances of the points in the curve is minimized, wkere the weights are inversely proportional to the spatial distance between the points. However, the minimum is not unique. Particularly, space-filling curves always come on symmetric pairs. The generation of a near optimal space-filling curve is done hierarchically.",

author = "A. P{\'e}rez and S. Kamata and E. Kawaguchi",

note = "Publisher Copyright: {\textcopyright} 1992 IEEE.; 11th IAPR International Conference on Pattern Recognition, IAPR 1992 ; Conference date: 30-08-1992 Through 01-09-1992",

year = "1992",

doi = "10.1109/ICPR.1992.202050",

language = "English",

series = "Proceedings - International Conference on Pattern Recognition",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "565--568",

booktitle = "IAPR 1992 - 11th IAPR International Conference on Pattern Recognition",

}

TY - GEN

T1 - Peano scanning of arbitrary size images

AU - Pérez, A.

AU - Kamata, S.

AU - Kawaguchi, E.

PY - 1992

Y1 - 1992

N2 - Discrete space-filling curves are not uniquely defined. In addition to the condition that the curve must pass for all the points of the array only once, continuously, it is necessary to add some critera to select the lest curves. Our aim is to preserve two-dimensional continuity as much as possible. The weighted sum of the distances of the points in the curve is minimized, wkere the weights are inversely proportional to the spatial distance between the points. However, the minimum is not unique. Particularly, space-filling curves always come on symmetric pairs. The generation of a near optimal space-filling curve is done hierarchically.

AB - Discrete space-filling curves are not uniquely defined. In addition to the condition that the curve must pass for all the points of the array only once, continuously, it is necessary to add some critera to select the lest curves. Our aim is to preserve two-dimensional continuity as much as possible. The weighted sum of the distances of the points in the curve is minimized, wkere the weights are inversely proportional to the spatial distance between the points. However, the minimum is not unique. Particularly, space-filling curves always come on symmetric pairs. The generation of a near optimal space-filling curve is done hierarchically.

UR - http://www.scopus.com/inward/record.url?scp=84934497622&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84934497622&partnerID=8YFLogxK

U2 - 10.1109/ICPR.1992.202050

DO - 10.1109/ICPR.1992.202050

M3 - Conference contribution

AN - SCOPUS:84934497622

T3 - Proceedings - International Conference on Pattern Recognition

SP - 565

EP - 568

BT - IAPR 1992 - 11th IAPR International Conference on Pattern Recognition

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 11th IAPR International Conference on Pattern Recognition, IAPR 1992

Y2 - 30 August 1992 through 1 September 1992

ER -

Peano scanning of arbitrary size images

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this