Fast marching based superpixels
From MaRDI portal
Recommendations
Cites work
- A fast marching level set method for monotonically advancing fronts.
- A parallel architecture for curve-evolution partial differential equations
- An Iterative Spanning Forest Framework for Superpixel Segmentation
- Contour and texture analysis for image segmentation
- Efficient graph-based image segmentation
- Eikonal-based models of random tessellations
- Fast marching based superpixels generation
- Fast Marching Methods
- Hierarchical Segmentation Based Upon Multi-resolution Approximations and the Watershed Transform
- New parameterizations for Bayesian seismic tomography
- Waterpixels
Cited in
(7)- Rooted spanning superpixels
- Fast marching based superpixels generation
- Structure-sensitive superpixels via geodesic distance
- Principal geodesic analysis boundary delineation with superpixel-based constraints
- SuperPatchMatch: An Algorithm for Robust Correspondences Using Superpixel Patches
- SLICT: computing texture-sensitive superpixels in medical images
- Accelerated algorithms for growing segments from image regions
This page was built for publication: Fast marching based superpixels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1980898)