Inf-structuring functions: a unifying theory of connections and connected operators
From MaRDI portal
Publication:2353427
DOI10.1007/s10851-014-0515-2zbMath1331.68257OpenAlexW2093495729MaRDI QIDQ2353427
Publication date: 14 July 2015
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-014-0515-2
connectionmathematical morphologyhyperconnectionconnected operatorattribute space connectioninf-structuring function
Related Items (2)
On the gold standard for security of universal steganography ⋮ Viscous-Hyperconnected Attribute Filters: A First Algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Idempotent block splitting on partial partitions. I: Isotone operators
- Idempotent block splitting on partial partitions. II: Non-isotone operators
- Locality and adjacency stability constraints for morphological connected operators
- Geodesic methods in quantitative image analysis
- The existence theorem of absolute equilibrium about games on connected graph with state payoff vector
- Partition-induced connections and operators for pattern analysis
- A new fuzzy connectivity measure for fuzzy sets and associated fuzzy attribute openings
- Connectivity on complete lattices
- A theoretical tour of connectivity in image processing and analysis
- A lattice approach to image segmentation
- Multiscale connected operators
- Orders on Partial Partitions and Maximal Partitioning of Sets
- Connective Segmentation Generalized to Arbitrary Complete Lattices
- Hyperconnections and Openings on Complete Lattices
- Toward a New Axiomatic for Hyper-Connections
- The algebraic basis of mathematical morphology
- An Axiomatic Approach to Hyperconnectivity
- Hyperconnectivity, Attribute-Space Connectivity and Path Openings: Theoretical Relationships
- Component-Trees and Multi-value Images: A Comparative Study
- Connected Morphological Operators for Binary Images
- Connectivity on Complete Lattices: New Results
- A multiscale approach to connectivity
- Digital Topology on Graphs
- A Comparison of Many Max-tree Computation Algorithms
- Constructive Links between Some Morphological Hierarchies on Edge-Weighted Graphs
- A Quasi-linear Algorithm to Compute the Tree of Shapes of nD Images
- Playing with Kruskal: Algorithms for Morphological Trees in Edge-Weighted Graphs
- Semi-connections and Hierarchies
- Towards Connected Filtering Based on Component-Graphs
- Inf-structuring Functions and Self-dual Marked Flattenings in bi-Heyting Algebra
- Hyperconnections and Hierarchical Representations for Grayscale and Multiband Image Processing
This page was built for publication: Inf-structuring functions: a unifying theory of connections and connected operators
