Halftone representation with random maze pattern based on centroidal voronoi tessellations and minimum spanning trees

Kohei Inoue; Kiichi Urahama

doi:10.3169/itej.62.1435

Halftone representation with random maze pattern based on centroidal voronoi tessellations and minimum spanning trees

Research output: Contribution to journal › Article › peer-review

Abstract

We describe a method for representing continuous tone of input monochromatic images with sparse and dense random maze patterns (RMPs). The RMPs are generated by connecting the generators of centroidal Voronoi tessellations (CVTs) with minimum spanning trees (MSTs). The brightness relationship between the input image and the RMP is derived by approximating the CVT with a hexagonal lattice, and utilized to correct the brightness for the RMP. We also describe a method for generating mazes with high degrees of difficulty in which the longest solution path between two subtrees generated by deleting a branch from the MST is identified.

Original language	English
Pages (from-to)	1435-1438
Number of pages	4
Journal	Kyokai Joho Imeji Zasshi/Journal of the Institute of Image Information and Television Engineers
Volume	62
Issue number	9
DOIs	https://doi.org/10.3169/itej.62.1435
Publication status	Published - Jan 1 2008

All Science Journal Classification (ASJC) codes

Media Technology
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.3169/itej.62.1435

Cite this

@article{10bcc54846724bc491bbd4b8c08768ec,

title = "Halftone representation with random maze pattern based on centroidal voronoi tessellations and minimum spanning trees",

abstract = "We describe a method for representing continuous tone of input monochromatic images with sparse and dense random maze patterns (RMPs). The RMPs are generated by connecting the generators of centroidal Voronoi tessellations (CVTs) with minimum spanning trees (MSTs). The brightness relationship between the input image and the RMP is derived by approximating the CVT with a hexagonal lattice, and utilized to correct the brightness for the RMP. We also describe a method for generating mazes with high degrees of difficulty in which the longest solution path between two subtrees generated by deleting a branch from the MST is identified.",

author = "Kohei Inoue and Kiichi Urahama",

year = "2008",

month = jan,

day = "1",

doi = "10.3169/itej.62.1435",

language = "English",

volume = "62",

pages = "1435--1438",

journal = "Terebijon Gakkaishi",

issn = "1342-6907",

publisher = "Institute of Image Information and Television Engineers",

number = "9",

}

TY - JOUR

T1 - Halftone representation with random maze pattern based on centroidal voronoi tessellations and minimum spanning trees

AU - Inoue, Kohei

AU - Urahama, Kiichi

PY - 2008/1/1

Y1 - 2008/1/1

N2 - We describe a method for representing continuous tone of input monochromatic images with sparse and dense random maze patterns (RMPs). The RMPs are generated by connecting the generators of centroidal Voronoi tessellations (CVTs) with minimum spanning trees (MSTs). The brightness relationship between the input image and the RMP is derived by approximating the CVT with a hexagonal lattice, and utilized to correct the brightness for the RMP. We also describe a method for generating mazes with high degrees of difficulty in which the longest solution path between two subtrees generated by deleting a branch from the MST is identified.

AB - We describe a method for representing continuous tone of input monochromatic images with sparse and dense random maze patterns (RMPs). The RMPs are generated by connecting the generators of centroidal Voronoi tessellations (CVTs) with minimum spanning trees (MSTs). The brightness relationship between the input image and the RMP is derived by approximating the CVT with a hexagonal lattice, and utilized to correct the brightness for the RMP. We also describe a method for generating mazes with high degrees of difficulty in which the longest solution path between two subtrees generated by deleting a branch from the MST is identified.

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

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

U2 - 10.3169/itej.62.1435

DO - 10.3169/itej.62.1435

M3 - Article

AN - SCOPUS:55549117475

SN - 1342-6907

VL - 62

SP - 1435

EP - 1438

JO - Terebijon Gakkaishi

JF - Terebijon Gakkaishi

IS - 9

ER -

Halftone representation with random maze pattern based on centroidal voronoi tessellations and minimum spanning trees

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this