1996
DOI: 10.1007/978-1-4613-0469-2_5
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of Multiscale Morphology Approaches: PDE Implemented Via Curve Evolution Versus Chamfer Distance Transform

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

1996
1996
2013
2013

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 10 publications
0
3
0
Order By: Relevance
“…In particular, finite difference methods such as the Osher-Sethian schemes [22,23,32] and the Rouy-Tourin method [25,38] are widely-used in this context. PDE-based algorithms for dilation/erosion offer two advantages over classical set-theoretic schemes [2,8,26]: first of all, they give excellent results for nondigitally scalable structuring elements whose shapes cannot be represented correctly on a discrete grid, for instance discs or ellipses. Secondly, the time t plays the role of a continuous scale parameter.…”
Section: Introductionmentioning
confidence: 99%
“…In particular, finite difference methods such as the Osher-Sethian schemes [22,23,32] and the Rouy-Tourin method [25,38] are widely-used in this context. PDE-based algorithms for dilation/erosion offer two advantages over classical set-theoretic schemes [2,8,26]: first of all, they give excellent results for nondigitally scalable structuring elements whose shapes cannot be represented correctly on a discrete grid, for instance discs or ellipses. Secondly, the time t plays the role of a continuous scale parameter.…”
Section: Introductionmentioning
confidence: 99%
“…Continuous multiscale morphology using the above curve evolution algorithm for numerically implementing the dilation PDE yields better approximations to disks and avoids the abrupt shape discretization inherent in modeling digital multiscale using discrete polygons [16,57]. Comparing it to discrete multiscale morphology using chamfer distance transforms, we note that for binary images: (1) the chamfer distance transform is easier to implement and yields similar errors for small scale dilations/erosions; (2) implementing the distance transform via curve evolution is more complex, but at medium and large scales gives a better and very close approximation to Euclidean geometry, i.e., to morphological operations with the disk structuring element.…”
Section: Differential Equations For Continuous-scale Morphologymentioning
confidence: 99%
“…Many other morphological processes such as openings, closings, top hats and morphological derivative operators can be derived from them. While dilation/erosion are frequently realised using a set-theoretical framework, an alternative formulation is available via partial differential equations (PDEs) (Alvarez et al 1993;Arehart et al 1993;Brockett and Maragos 1992;Butt and Maragos 1996;van den Boomgaard 1992). Compared to the set-theoretical approach, the latter offers the conceptual advantages of digital scalability and subpixel accuracy.…”
mentioning
confidence: 99%