Peano scanning of arbitrary size images

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 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 languageEnglish
Title of host publicationIAPR 1992 - 11th IAPR International Conference on Pattern Recognition
Subtitle of host publicationImage, Speech, and Signal Analysis
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages565-568
Number of pages4
Volume3
ISBN (Electronic)0818629207
DOIs
Publication statusPublished - 1992 Jan 1
Externally publishedYes
Event11th IAPR International Conference on Pattern Recognition, IAPR 1992 - The Hague, Netherlands
Duration: 1992 Aug 301992 Sep 1

Other

Other11th IAPR International Conference on Pattern Recognition, IAPR 1992
CountryNetherlands
CityThe Hague
Period92/8/3092/9/1

Fingerprint

Scanning

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition

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 (Vol. 3, pp. 565-568). [202050] 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, Seiichiro; Kawaguchi, E.

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

Research output: Chapter in Book/Report/Conference proceedingConference 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. vol. 3, 202050, 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
Pérez A, Kamata S, Kawaguchi E. Peano scanning of arbitrary size images. In IAPR 1992 - 11th IAPR International Conference on Pattern Recognition: Image, Speech, and Signal Analysis. Vol. 3. Institute of Electrical and Electronics Engineers Inc. 1992. p. 565-568. 202050 https://doi.org/10.1109/ICPR.1992.202050
Pérez, A. ; Kamata, Seiichiro ; Kawaguchi, E. / Peano scanning of arbitrary size images. IAPR 1992 - 11th IAPR International Conference on Pattern Recognition: Image, Speech, and Signal Analysis. Vol. 3 Institute of Electrical and Electronics Engineers Inc., 1992. pp. 565-568
@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 Seiichiro Kamata and E. Kawaguchi",
year = "1992",
month = "1",
day = "1",
doi = "10.1109/ICPR.1992.202050",
language = "English",
volume = "3",
pages = "565--568",
booktitle = "IAPR 1992 - 11th IAPR International Conference on Pattern Recognition",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Peano scanning of arbitrary size images

AU - Pérez, A.

AU - Kamata, Seiichiro

AU - Kawaguchi, E.

PY - 1992/1/1

Y1 - 1992/1/1

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

VL - 3

SP - 565

EP - 568

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

PB - Institute of Electrical and Electronics Engineers Inc.

ER -