Medial faces from a concise 3D thinning algorithm

Antoine Manzanera; Thierry M. Bernard; Francoise Preteux; Bernard Longuet

Medial faces from a concise 3D thinning algorithm

Antoine Manzanera, Thierry M. Bernard, Francoise Preteux, Bernard Longuet

DCE

Research output: Contribution to journal › Conference article › peer-review

Abstract

We propose in this paper a new 3D fully parallel thinning algorithm that we believe to be the most concise due to its simple characterization. The algorithm is indeed completely defined by a set of five patterns, three removing conditions and two non-removing conditions. These patterns are designed from the two fundamental and compatible constraints usually expected in skeleta: (1) Topology preservation and (2) Medial surface. From these two constraints, the removing patterns (α₁, α₂ and α₃) detect the non-local maxima, whereas the non-removing patterns (β₁ and β₂) prevent any topology change that the removing conditions could imply. We show that the three mentioned constraints are respected. The logical conciseness of our procedure, called MB-3D, makes it to our knowledge the easiest 3D thinning algorithm to implement. Some results are displayed, that illustrate the relevance of our approach.

Original language	English
Pages (from-to)	337-343
Number of pages	7
Journal	Proceedings of the IEEE International Conference on Computer Vision
Volume	1
Publication status	Published - 1 Jan 1999
Externally published	Yes
Event	Proceedings of the 1999 7th IEEE International Conference on Computer Vision (ICCV'99) - Kerkyra, Greece Duration: 20 Sept 1999 → 27 Sept 1999

Cite this

@article{479d10bcc7fc4f1d9d0389f14b071cdd,

title = "Medial faces from a concise 3D thinning algorithm",

abstract = "We propose in this paper a new 3D fully parallel thinning algorithm that we believe to be the most concise due to its simple characterization. The algorithm is indeed completely defined by a set of five patterns, three removing conditions and two non-removing conditions. These patterns are designed from the two fundamental and compatible constraints usually expected in skeleta: (1) Topology preservation and (2) Medial surface. From these two constraints, the removing patterns (α1, α2 and α3) detect the non-local maxima, whereas the non-removing patterns (β1 and β2) prevent any topology change that the removing conditions could imply. We show that the three mentioned constraints are respected. The logical conciseness of our procedure, called MB-3D, makes it to our knowledge the easiest 3D thinning algorithm to implement. Some results are displayed, that illustrate the relevance of our approach.",

author = "Antoine Manzanera and Bernard, \{Thierry M.\} and Francoise Preteux and Bernard Longuet",

year = "1999",

month = jan,

day = "1",

language = "English",

volume = "1",

pages = "337--343",

journal = "Proceedings of the IEEE International Conference on Computer Vision",

issn = "1550-5499",

note = "Proceedings of the 1999 7th IEEE International Conference on Computer Vision (ICCV'99) ; Conference date: 20-09-1999 Through 27-09-1999",

}

TY - JOUR

T1 - Medial faces from a concise 3D thinning algorithm

AU - Manzanera, Antoine

AU - Bernard, Thierry M.

AU - Preteux, Francoise

AU - Longuet, Bernard

PY - 1999/1/1

Y1 - 1999/1/1

N2 - We propose in this paper a new 3D fully parallel thinning algorithm that we believe to be the most concise due to its simple characterization. The algorithm is indeed completely defined by a set of five patterns, three removing conditions and two non-removing conditions. These patterns are designed from the two fundamental and compatible constraints usually expected in skeleta: (1) Topology preservation and (2) Medial surface. From these two constraints, the removing patterns (α1, α2 and α3) detect the non-local maxima, whereas the non-removing patterns (β1 and β2) prevent any topology change that the removing conditions could imply. We show that the three mentioned constraints are respected. The logical conciseness of our procedure, called MB-3D, makes it to our knowledge the easiest 3D thinning algorithm to implement. Some results are displayed, that illustrate the relevance of our approach.

AB - We propose in this paper a new 3D fully parallel thinning algorithm that we believe to be the most concise due to its simple characterization. The algorithm is indeed completely defined by a set of five patterns, three removing conditions and two non-removing conditions. These patterns are designed from the two fundamental and compatible constraints usually expected in skeleta: (1) Topology preservation and (2) Medial surface. From these two constraints, the removing patterns (α1, α2 and α3) detect the non-local maxima, whereas the non-removing patterns (β1 and β2) prevent any topology change that the removing conditions could imply. We show that the three mentioned constraints are respected. The logical conciseness of our procedure, called MB-3D, makes it to our knowledge the easiest 3D thinning algorithm to implement. Some results are displayed, that illustrate the relevance of our approach.

M3 - Conference article

AN - SCOPUS:0033284810

SN - 1550-5499

VL - 1

SP - 337

EP - 343

JO - Proceedings of the IEEE International Conference on Computer Vision

JF - Proceedings of the IEEE International Conference on Computer Vision

T2 - Proceedings of the 1999 7th IEEE International Conference on Computer Vision (ICCV'99)

Y2 - 20 September 1999 through 27 September 1999

ER -

Medial faces from a concise 3D thinning algorithm

Abstract

Fingerprint

Cite this