Name
Abstract | ||
|---|---|---|
This paper further investigates a new approach for self-dual morphological processing, where eroded images have all shapes shrunk in a contrast-invariant way. In the binary case, we operate on a given image with morphological operators in the so-called ''adjacency lattice,'' which is intimately related to the image's adjacency tree. These operators are generalized to grayscale images by means of the so-called ''shape-tree semilattice,'' which is based on the tree of shapes of the given image. Apart of reviewing their original definition, different algorithms for computing the shape-tree morphological operators are addressed. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.imavis.2006.04.016 | Image Vision Comput. |
Keywords | Field | DocType |
original definition,different algorithm,shape-tree semilattices,adjacency lattice,self-dual operators,tree of shapes,morphological operator,adjacency tree,binary case,new approach,fillhole,shape-tree morphological operator,self-dual morphological processing,complete inf-semilattices,shape-tree semilattice | Adjacency list,Discrete mathematics,Combinatorics,Lattice (order),Morphological processing,Tree of shapes,Operator (computer programming),Semilattice,Mathematics,Grayscale,Binary number | Journal |
Volume | Issue | ISSN |
25 | 4 | Image and Vision Computing |
Citations | PageRank | References |
4 | 0.51 | 12 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Renato Keshet | 1 | 338 | 27.26 |