A Region-based Randers Geodesic Approach for Image Segmentation
- URL: http://arxiv.org/abs/1912.10122v3
- Date: Thu, 31 Aug 2023 00:53:12 GMT
- Title: A Region-based Randers Geodesic Approach for Image Segmentation
- Authors: Da Chen and Jean-Marie Mirebeau and Huazhong Shu and Laurent D. Cohen
- Abstract summary: We introduce a new variational image segmentation model based on the minimal geodesic path framework.
We also suggest a practical interactive image segmentation strategy, where the target boundary can be delineated by the concatenation of several piecewise geodesic paths.
- Score: 16.091797508701045
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The geodesic model based on the eikonal partial differential equation (PDE)
has served as a fundamental tool for the applications of image segmentation and
boundary detection in the past two decades. However, the existing approaches
commonly only exploit the image edge-based features for computing minimal
geodesic paths, potentially limiting their performance in complicated
segmentation situations. In this paper, we introduce a new variational image
segmentation model based on the minimal geodesic path framework and the eikonal
PDE, where the region-based appearance term that defines then regional
homogeneity features can be taken into account for estimating the associated
minimal geodesic paths. This is done by constructing a Randers geodesic metric
interpretation of the region-based active contour energy functional. As a
result, the minimization of the active contour energy functional is transformed
into finding the solution to the Randers eikonal PDE.
We also suggest a practical interactive image segmentation strategy, where
the target boundary can be delineated by the concatenation of several piecewise
geodesic paths. We invoke the Finsler variant of the fast marching method to
estimate the geodesic distance map, yielding an efficient implementation of the
proposed region-based Randers geodesic model for image segmentation.
Experimental results on both synthetic and real images exhibit that our model
indeed achieves encouraging segmentation performance.
Related papers
- CriDiff: Criss-cross Injection Diffusion Framework via Generative Pre-train for Prostate Segmentation [60.61972883059688]
CriDiff is a two-stage feature injecting framework with a Crisscross Injection Strategy (CIS) and a Generative Pre-train (GP) approach for prostate segmentation.
To effectively learn multi-level of edge features and non-edge features, we proposed two parallel conditioners in the CIS.
The GP approach eases the inconsistency between the images features and the diffusion model without adding additional parameters.
arXiv Detail & Related papers (2024-06-20T10:46:50Z) - SAR image segmentation algorithms based on I-divergence-TV model [0.7458485930898191]
We propose a novel variational active contour model based on I-divergence-TV model to segment Synthetic aperture radar (SAR) images with multiplicative gamma noise.
The proposed model can efficiently stop the contours at weak or blurred edges, and can automatically detect the exterior and interior boundaries of images.
arXiv Detail & Related papers (2023-12-09T04:14:46Z) - Grouping Boundary Proposals for Fast Interactive Image Segmentation [19.337758803223917]
We introduce a new image segmentation model based on the minimal geodesic framework.
We use an adaptive cut-based circular optimal path scheme and a graph-based boundary proposals grouping scheme.
Experimental results show that the proposed model indeed outperforms state-of-the-art minimal paths-based image segmentation approaches.
arXiv Detail & Related papers (2023-09-08T07:22:54Z) - Enhanced Sharp-GAN For Histopathology Image Synthesis [63.845552349914186]
Histopathology image synthesis aims to address the data shortage issue in training deep learning approaches for accurate cancer detection.
We propose a novel approach that enhances the quality of synthetic images by using nuclei topology and contour regularization.
The proposed approach outperforms Sharp-GAN in all four image quality metrics on two datasets.
arXiv Detail & Related papers (2023-01-24T17:54:01Z) - Active Nearest Neighbor Regression Through Delaunay Refinement [79.93030583257597]
We introduce an algorithm for active function approximation based on nearest neighbor regression.
Our Active Nearest Neighbor Regressor (ANNR) relies on the Voronoi-Delaunay framework from computational geometry to subdivide the space into cells with constant estimated function value.
arXiv Detail & Related papers (2022-06-16T10:24:03Z) - GraphWalks: Efficient Shape Agnostic Geodesic Shortest Path Estimation [93.60478281489243]
We propose a learnable network to approximate geodesic paths on 3D surfaces.
The proposed method provides efficient approximations of the shortest paths and geodesic distances estimations.
arXiv Detail & Related papers (2022-05-30T16:22:53Z) - Saliency-Driven Active Contour Model for Image Segmentation [2.8348950186890467]
We propose a novel model that uses the advantages of a saliency map with local image information (LIF) and overcomes the drawbacks of previous models.
The proposed model is driven by a saliency map of an image and the local image information to enhance the progress of the active contour models.
arXiv Detail & Related papers (2022-05-23T06:02:52Z) - Geodesic Models with Convexity Shape Prior [8.932981695464761]
In this paper, we take into account a more complicated problem: finding curvature-penalized geodesic paths with a convexity shape prior.
We establish new geodesic models relying on the strategy of orientation-lifting.
The convexity shape prior serves as a constraint for the construction of local geodesic metrics encoding a curvature constraint.
arXiv Detail & Related papers (2021-11-01T09:41:54Z) - Improving Metric Dimensionality Reduction with Distributed Topology [68.8204255655161]
DIPOLE is a dimensionality-reduction post-processing step that corrects an initial embedding by minimizing a loss functional with both a local, metric term and a global, topological term.
We observe that DIPOLE outperforms popular methods like UMAP, t-SNE, and Isomap on a number of popular datasets.
arXiv Detail & Related papers (2021-06-14T17:19:44Z) - BoundarySqueeze: Image Segmentation as Boundary Squeezing [104.43159799559464]
We propose a novel method for fine-grained high-quality image segmentation of both objects and scenes.
Inspired by dilation and erosion from morphological image processing techniques, we treat the pixel level segmentation problems as squeezing object boundary.
Our method yields large gains on COCO, Cityscapes, for both instance and semantic segmentation and outperforms previous state-of-the-art PointRend in both accuracy and speed under the same setting.
arXiv Detail & Related papers (2021-05-25T04:58:51Z) - Geodesic Paths for Image Segmentation with Implicit Region-based
Homogeneity Enhancement [19.309722425910465]
We introduce a flexible interactive image segmentation model based on the Eikonal partial differential equation (PDE) framework.
The proposed model indeed outperforms state-of-the-art minimal paths-based image segmentation approaches.
arXiv Detail & Related papers (2020-08-16T13:29:11Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.