Active Contours without Edges and with Simple Shape Priors

Authors:
Eduard Sojka;Jan Gaura;Michal Krumnikl
Affiliations:
Faculty of Electrical Engineering and Informatics, Technical University of Ostrava, Ostrava-Poruba, Czech Republic 708 33;Faculty of Electrical Engineering and Informatics, Technical University of Ostrava, Ostrava-Poruba, Czech Republic 708 33;Faculty of Electrical Engineering and Informatics, Technical University of Ostrava, Ostrava-Poruba, Czech Republic 708 33
Venue:
ACIVS '08 Proceedings of the 10th International Conference on Advanced Concepts for Intelligent Vision Systems
Year:
2008

Citing 9
Cited 1

Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations

Journal of Computational Physics
Shape Modeling with Front Propagation: A Level Set Approach

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model

International Journal of Computer Vision
An Active Contour Model without Edges

SCALE-SPACE '99 Proceedings of the Second International Conference on Scale-Space Theories in Computer Vision
A Multiphase Dynamic Labeling Model for Variational Recognition-driven Image Segmentation

International Journal of Computer Vision
Dynamical Statistical Shape Priors for Level Set-Based Tracking

IEEE Transactions on Pattern Analysis and Machine Intelligence
Prior-based Segmentation and Shape Registration in the Presence of Perspective Distortion

International Journal of Computer Vision
Topological control of level set method depending on topology constraints

Pattern Recognition Letters
Active contours without edges

IEEE Transactions on Image Processing

A new level-set based algorithm for bimodal depth segmentation

ACIVS'12 Proceedings of the 14th international conference on Advanced Concepts for Intelligent Vision Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce two simple shape priors into the Chan and Vese level-set method, namely, a prescribed area and a prescribed area-to-perimeter ratio of particular objects. It is remarkable that these priors may be easily incorporated into the Euler-Lagrange equation of the original method. As a side effect of our experimenting with the method, we also introduce a new probability-based level-set function, which removes the need for reinitialisation and usually, according to our experience, speeds up the computation. Finally, we also propose a method how to treat, in a simple way, the situation in which the particular objects differ in brightness. Although the mentioned changes make the segmentation more reliable, they almost do not complicate the computation. The results of experiments are also presented.