Connectivity preserving transformations for higher dimensional binary images

DOI10.1016/j.dam.2009.03.011zbMath1230.68208OpenAlexW2143526636MaRDI QIDQ967396

Arnab Sinha, Arijit Bishnu, Anvesh Komuravelli

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.03.011

zbMATH Keywords

binary image transformationconnectivity modelsIP-equivalencelocal interchange

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Machine vision and scene understanding (68T45)

Related Items (1)

Reconfiguration of connected graph partitions

Cites Work

• Pushing squares around
• Interchangeable pairs of pixels in two-valued digital images
• Two simply connected sets that have the same area are IP-equivalent

This page was built for publication: Connectivity preserving transformations for higher dimensional binary images