著者
永江 孝規 安居院 猛 長橋 宏
出版者
一般社団法人 映像情報メディア学会
雑誌
テレビジョン学会技術報告 (ISSN:03864227)
巻号頁・発行日
vol.16, no.9, pp.25-30, 1992-01-24 (Released:2017-10-06)

The Peano scan is a path traversing an array of points and is very convoluted as a randam walk. This scan can be applied to sequential image transformation, instead of raster scan, and does not produce periodic patterns that are often observed in the case of raster scan. Also it is noted that the Peano scan has the same properties as that of quadtree or octree. If the distribution of values in a 2D or 3D array has clusters, then the clusters are preserved on the scan. This is the reason why this scan is applied to run-length compression and color quantization. The Peano scan, however, has restrictions in nature: the scanned array must be a square and the width and height must be a power of 2, because the scan is obtained by recursive division of the array, as quadtree. In the present article, some generalized Peano scans for any rectangular array are introduced, and halftoning is discussed as one of the applications of the Peano scans.

言及状況

外部データベース (DOI)

Twitter (2 users, 2 posts, 0 favorites)

よく Hilbert-Peano Curve って呼び方するの深く考えてなかったけど、Peano が平面充填曲線が作れるのを示して(1890年)、Hilbert が正方形の再帰的な分割方式を発表した(1891年)と。。 Peano… https://t.co/HaDNWTeMuq

収集済み URL リスト