An Elastica Geodesic Approach with Convexity Shape Prior

Abstract

The minimal geodesic models based on the Eikonal equations are capable of finding suitable solutions in various image segmentation scenarios. Existing geodesic-based segmentation approaches usually exploit the image features in conjunction with geometric regularization terms (such as curve length or elastica length) for computing geodesic paths. In this paper, we consider a more complicated problem: finding simple and closed geodesic curves which are imposed a convexity shape prior. The proposed approach relies on an orientation-lifting strategy, by which a planar curve can be mapped to an high-dimensional orientation space. The convexity shape prior serves as a constraint for the construction of local metrics. The geodesic curves in the lifted space then can be efficiently computed through the fast marching method. In addition, we introduce a way to incorporate region-based homogeneity features into the proposed geodesic model so as to solve the region-based segmentation issues with shape prior constraints.

Cite

Text

Chen et al. "An Elastica Geodesic Approach with Convexity Shape Prior." International Conference on Computer Vision, 2021. doi:10.1109/ICCV48922.2021.00682

Markdown

[Chen et al. "An Elastica Geodesic Approach with Convexity Shape Prior." International Conference on Computer Vision, 2021.](https://mlanthology.org/iccv/2021/chen2021iccv-elastica/) doi:10.1109/ICCV48922.2021.00682

BibTeX

@inproceedings{chen2021iccv-elastica,
  title     = {{An Elastica Geodesic Approach with Convexity Shape Prior}},
  author    = {Chen, Da and Cohen, Laurent D. and Mirebeau, Jean-Marie and Tai, Xue-Cheng},
  booktitle = {International Conference on Computer Vision},
  year      = {2021},
  pages     = {6900-6909},
  doi       = {10.1109/ICCV48922.2021.00682},
  url       = {https://mlanthology.org/iccv/2021/chen2021iccv-elastica/}
}