Segmentation and skeletonization on arbitrary graphs using multiscale morphology and active contours
From MaRDI portal
Recommendations
Cites work
- \omega-Harmonic Functions and Inverse Conductivity Problems on Networks
- A fast level set based algorithm for topology-independent shape modeling.
- A geometric model for active contours in image processing
- A shock-capturing algorithm for the differential equations of dilation and erosion
- Axioms and fundamental equations of image processing
- Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- Geodesic active contours
- Hamilton-Jacobi skeletons
- Hierarchical Shape Decomposition via Level Sets
- Highly accurate schemes for PDE-based morphology with general convex structuring elements
- scientific article; zbMATH DE number 3902440 (Why is no real title available?)
- scientific article; zbMATH DE number 3502485 (Why is no real title available?)
- scientific article; zbMATH DE number 914826 (Why is no real title available?)
- scientific article; zbMATH DE number 2201292 (Why is no real title available?)
- Medial representations. Mathematics, algorithms and applications
- Multiscale medial loci and their properties
- Nonlocal PDEs-Based Morphology on Weighted Graphs for Image and Data Processing
- On the evolution of curves via a function of curvature. I: The classical case
- Pattern spectrum and multiscale shape representation
- Skeleton-based morphological coding of binary images
- Some Morphological Operators in Graph Spaces
Cited in
(3)
This page was built for publication: Segmentation and skeletonization on arbitrary graphs using multiscale morphology and active contours
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5258542)