Abstract
|
|
---|---|
In some recent papers we have introduced a notion of continuity in digital spaces which extends the usual notion of digital continuity. Our approach, which uses multivalued maps, provides a better framework to define topological notions, like retractions, in a far more realistic way than by using just single-valued digitally continuous functions. In particular, we have characterized the deletion of simple points and some well known parallel thinning algorithm as a particular type of retractions, called (N,k)-retractions. In this paper we give a full characterization of the thinning algorithms that can be modeled as $(\Nn ,k)$-retractions. This class agrees, with minor modifications, with the class of thinning algorithms satisfying Ronse necessary conditions for preservation of topology. | |
International
|
Si |
JCR
|
Si |
Title
|
Pattern Recognition Letters |
ISBN
|
0167-8655 |
Impact factor JCR
|
1,03 |
Impact info
|
|
Volume
|
|
|
|
Journal number
|
33 |
From page
|
1477 |
To page
|
1484 |
Month
|
SIN MES |
Ranking
|