Equivalent sequential and parallel reductions in arbitrary binary pictures

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

A reduction transforms a binary picture only by changing some black points to white ones, which is referred to as deletion. Sequential reductions traverse the black points of a picture, and consider a single point for possible deletion, while parallel reductions can delete a set of black points simultaneously. Two reductions are called equivalent if they produce the same result for each input picture. A deletion rule is said to be equivalent if it yields a pair of equivalent parallel and sequential reductions. This paper introduces a class of equivalent deletion rules that allows us to establish a new sufficient condition for topology-preserving parallel reductions in arbitrary binary pictures. In addition we present a method of verifying that a deletion rule given by matching templates is equivalent, a necessary and sufficient condition for order-independent deletion rules, and a sufficient criterion for order-independent and translation-invariant parallel subfield-based algorithms.

Original languageEnglish
Article number1460009
JournalInternational Journal of Pattern Recognition and Artificial Intelligence
Volume28
Issue number7
DOIs
Publication statusPublished - 2014

Fingerprint

Template matching
Topology

Keywords

  • Digital topology
  • Discrete geometry
  • Order-independency
  • Thinning algorithms
  • Topology-preserving reductions

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Computer Vision and Pattern Recognition

Cite this

@article{1020d64403164cdc81330a2522df90a8,
title = "Equivalent sequential and parallel reductions in arbitrary binary pictures",
abstract = "A reduction transforms a binary picture only by changing some black points to white ones, which is referred to as deletion. Sequential reductions traverse the black points of a picture, and consider a single point for possible deletion, while parallel reductions can delete a set of black points simultaneously. Two reductions are called equivalent if they produce the same result for each input picture. A deletion rule is said to be equivalent if it yields a pair of equivalent parallel and sequential reductions. This paper introduces a class of equivalent deletion rules that allows us to establish a new sufficient condition for topology-preserving parallel reductions in arbitrary binary pictures. In addition we present a method of verifying that a deletion rule given by matching templates is equivalent, a necessary and sufficient condition for order-independent deletion rules, and a sufficient criterion for order-independent and translation-invariant parallel subfield-based algorithms.",
keywords = "Digital topology, Discrete geometry, Order-independency, Thinning algorithms, Topology-preserving reductions",
author = "K. Pal{\'a}gyi",
year = "2014",
doi = "10.1142/S021800141460009X",
language = "English",
volume = "28",
journal = "International Journal of Pattern Recognition and Artificial Intelligence",
issn = "0218-0014",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "7",

}

TY - JOUR

T1 - Equivalent sequential and parallel reductions in arbitrary binary pictures

AU - Palágyi, K.

PY - 2014

Y1 - 2014

N2 - A reduction transforms a binary picture only by changing some black points to white ones, which is referred to as deletion. Sequential reductions traverse the black points of a picture, and consider a single point for possible deletion, while parallel reductions can delete a set of black points simultaneously. Two reductions are called equivalent if they produce the same result for each input picture. A deletion rule is said to be equivalent if it yields a pair of equivalent parallel and sequential reductions. This paper introduces a class of equivalent deletion rules that allows us to establish a new sufficient condition for topology-preserving parallel reductions in arbitrary binary pictures. In addition we present a method of verifying that a deletion rule given by matching templates is equivalent, a necessary and sufficient condition for order-independent deletion rules, and a sufficient criterion for order-independent and translation-invariant parallel subfield-based algorithms.

AB - A reduction transforms a binary picture only by changing some black points to white ones, which is referred to as deletion. Sequential reductions traverse the black points of a picture, and consider a single point for possible deletion, while parallel reductions can delete a set of black points simultaneously. Two reductions are called equivalent if they produce the same result for each input picture. A deletion rule is said to be equivalent if it yields a pair of equivalent parallel and sequential reductions. This paper introduces a class of equivalent deletion rules that allows us to establish a new sufficient condition for topology-preserving parallel reductions in arbitrary binary pictures. In addition we present a method of verifying that a deletion rule given by matching templates is equivalent, a necessary and sufficient condition for order-independent deletion rules, and a sufficient criterion for order-independent and translation-invariant parallel subfield-based algorithms.

KW - Digital topology

KW - Discrete geometry

KW - Order-independency

KW - Thinning algorithms

KW - Topology-preserving reductions

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

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

U2 - 10.1142/S021800141460009X

DO - 10.1142/S021800141460009X

M3 - Article

VL - 28

JO - International Journal of Pattern Recognition and Artificial Intelligence

JF - International Journal of Pattern Recognition and Artificial Intelligence

SN - 0218-0014

IS - 7

M1 - 1460009

ER -