Simplifier points in 2D binary images

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

1 Citation (Scopus)

Abstract

The concept of a simple point is well known in digital topology: a black point in a binary picture is called a simple point if its deletion preserves topology. This paper introduces the notion of a simplifier point: a black point in a binary picture is simplifier if it is simple, and its deletion turns a non-simple border point into simple. We show that simplifier points are line end points for both (8, 4) and (4, 8) pictures on the square grid. Our result makes efficient implementation of endpoint-based topology-preserving 2D thinning algorithms possible.

Original languageEnglish
Title of host publicationCombinatorial Image Analysis - 18th International Workshop, IWCIA 2017, Proceedings
PublisherSpringer Verlag
Pages3-15
Number of pages13
ISBN (Print)9783319591070
DOIs
Publication statusPublished - Jan 1 2017
Event18th International Workshop on Combinatorial Image Analysis, IWCIA 2017 - Plovdiv, Bulgaria
Duration: Jun 19 2017Jun 21 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10256 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other18th International Workshop on Combinatorial Image Analysis, IWCIA 2017
CountryBulgaria
CityPlovdiv
Period6/19/176/21/17

Fingerprint

Binary images
Binary Image
Topology
Deletion
Digital Topology
Binary
Thinning
End point
Efficient Implementation
Grid
Line

Keywords

  • Digital topology
  • Discrete geometry
  • Thinning algorithms
  • Topology preservation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Palágyi, K. (2017). Simplifier points in 2D binary images. In Combinatorial Image Analysis - 18th International Workshop, IWCIA 2017, Proceedings (pp. 3-15). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10256 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-59108-7_1

Simplifier points in 2D binary images. / Palágyi, Kálmán.

Combinatorial Image Analysis - 18th International Workshop, IWCIA 2017, Proceedings. Springer Verlag, 2017. p. 3-15 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10256 LNCS).

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

Palágyi, K 2017, Simplifier points in 2D binary images. in Combinatorial Image Analysis - 18th International Workshop, IWCIA 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10256 LNCS, Springer Verlag, pp. 3-15, 18th International Workshop on Combinatorial Image Analysis, IWCIA 2017, Plovdiv, Bulgaria, 6/19/17. https://doi.org/10.1007/978-3-319-59108-7_1
Palágyi K. Simplifier points in 2D binary images. In Combinatorial Image Analysis - 18th International Workshop, IWCIA 2017, Proceedings. Springer Verlag. 2017. p. 3-15. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-59108-7_1
Palágyi, Kálmán. / Simplifier points in 2D binary images. Combinatorial Image Analysis - 18th International Workshop, IWCIA 2017, Proceedings. Springer Verlag, 2017. pp. 3-15 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{1234678e920f4946a541a674191e5d08,
title = "Simplifier points in 2D binary images",
abstract = "The concept of a simple point is well known in digital topology: a black point in a binary picture is called a simple point if its deletion preserves topology. This paper introduces the notion of a simplifier point: a black point in a binary picture is simplifier if it is simple, and its deletion turns a non-simple border point into simple. We show that simplifier points are line end points for both (8, 4) and (4, 8) pictures on the square grid. Our result makes efficient implementation of endpoint-based topology-preserving 2D thinning algorithms possible.",
keywords = "Digital topology, Discrete geometry, Thinning algorithms, Topology preservation",
author = "K{\'a}lm{\'a}n Pal{\'a}gyi",
year = "2017",
month = "1",
day = "1",
doi = "10.1007/978-3-319-59108-7_1",
language = "English",
isbn = "9783319591070",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "3--15",
booktitle = "Combinatorial Image Analysis - 18th International Workshop, IWCIA 2017, Proceedings",

}

TY - GEN

T1 - Simplifier points in 2D binary images

AU - Palágyi, Kálmán

PY - 2017/1/1

Y1 - 2017/1/1

N2 - The concept of a simple point is well known in digital topology: a black point in a binary picture is called a simple point if its deletion preserves topology. This paper introduces the notion of a simplifier point: a black point in a binary picture is simplifier if it is simple, and its deletion turns a non-simple border point into simple. We show that simplifier points are line end points for both (8, 4) and (4, 8) pictures on the square grid. Our result makes efficient implementation of endpoint-based topology-preserving 2D thinning algorithms possible.

AB - The concept of a simple point is well known in digital topology: a black point in a binary picture is called a simple point if its deletion preserves topology. This paper introduces the notion of a simplifier point: a black point in a binary picture is simplifier if it is simple, and its deletion turns a non-simple border point into simple. We show that simplifier points are line end points for both (8, 4) and (4, 8) pictures on the square grid. Our result makes efficient implementation of endpoint-based topology-preserving 2D thinning algorithms possible.

KW - Digital topology

KW - Discrete geometry

KW - Thinning algorithms

KW - Topology preservation

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

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

U2 - 10.1007/978-3-319-59108-7_1

DO - 10.1007/978-3-319-59108-7_1

M3 - Conference contribution

AN - SCOPUS:85020452641

SN - 9783319591070

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 3

EP - 15

BT - Combinatorial Image Analysis - 18th International Workshop, IWCIA 2017, Proceedings

PB - Springer Verlag

ER -