Halftoning with minimum spanning trees and its application to maze-like images

Kohei Inoue, Kiichi Urahama

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

We propose a method for generating halftone images by using minimum spanning trees (MSTs). We generate a stippling from an input image by using centroidal Voronoi tessellation (CVT), and then connect all the points in the stippling with an MST. We derive a relationship of darkness between the input image and the MST halftone image by approximating CVT with the hexagonal lattice, and utilize it for correcting the brightness of the MST halftone images. We also propose methods for generating maze-like images on the basis of the MST halftone images. We embed user-specified solution paths in the MST halftone images in two ways. Experimental results show that the solution paths are successfully embedded and hidden in the maze-like images.

Original languageEnglish
Pages (from-to)638-647
Number of pages10
JournalComputers and Graphics (Pergamon)
Volume33
Issue number5
DOIs
Publication statusPublished - Oct 1 2009

Fingerprint

Luminance

All Science Journal Classification (ASJC) codes

  • Engineering(all)
  • Human-Computer Interaction
  • Computer Graphics and Computer-Aided Design

Cite this

Halftoning with minimum spanning trees and its application to maze-like images. / Inoue, Kohei; Urahama, Kiichi.

In: Computers and Graphics (Pergamon), Vol. 33, No. 5, 01.10.2009, p. 638-647.

Research output: Contribution to journalArticle

@article{c0ee8df7ebdf413dae52fa2fa1e7ee9d,
title = "Halftoning with minimum spanning trees and its application to maze-like images",
abstract = "We propose a method for generating halftone images by using minimum spanning trees (MSTs). We generate a stippling from an input image by using centroidal Voronoi tessellation (CVT), and then connect all the points in the stippling with an MST. We derive a relationship of darkness between the input image and the MST halftone image by approximating CVT with the hexagonal lattice, and utilize it for correcting the brightness of the MST halftone images. We also propose methods for generating maze-like images on the basis of the MST halftone images. We embed user-specified solution paths in the MST halftone images in two ways. Experimental results show that the solution paths are successfully embedded and hidden in the maze-like images.",
author = "Kohei Inoue and Kiichi Urahama",
year = "2009",
month = "10",
day = "1",
doi = "10.1016/j.cag.2008.09.015",
language = "English",
volume = "33",
pages = "638--647",
journal = "Computers and Graphics",
issn = "0097-8493",
publisher = "Elsevier Limited",
number = "5",

}

TY - JOUR

T1 - Halftoning with minimum spanning trees and its application to maze-like images

AU - Inoue, Kohei

AU - Urahama, Kiichi

PY - 2009/10/1

Y1 - 2009/10/1

N2 - We propose a method for generating halftone images by using minimum spanning trees (MSTs). We generate a stippling from an input image by using centroidal Voronoi tessellation (CVT), and then connect all the points in the stippling with an MST. We derive a relationship of darkness between the input image and the MST halftone image by approximating CVT with the hexagonal lattice, and utilize it for correcting the brightness of the MST halftone images. We also propose methods for generating maze-like images on the basis of the MST halftone images. We embed user-specified solution paths in the MST halftone images in two ways. Experimental results show that the solution paths are successfully embedded and hidden in the maze-like images.

AB - We propose a method for generating halftone images by using minimum spanning trees (MSTs). We generate a stippling from an input image by using centroidal Voronoi tessellation (CVT), and then connect all the points in the stippling with an MST. We derive a relationship of darkness between the input image and the MST halftone image by approximating CVT with the hexagonal lattice, and utilize it for correcting the brightness of the MST halftone images. We also propose methods for generating maze-like images on the basis of the MST halftone images. We embed user-specified solution paths in the MST halftone images in two ways. Experimental results show that the solution paths are successfully embedded and hidden in the maze-like images.

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

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

U2 - 10.1016/j.cag.2008.09.015

DO - 10.1016/j.cag.2008.09.015

M3 - Article

AN - SCOPUS:71849089601

VL - 33

SP - 638

EP - 647

JO - Computers and Graphics

JF - Computers and Graphics

SN - 0097-8493

IS - 5

ER -