Segmentation of vectorial image features using shape gradients and information measures. (English) Zbl 1478.94050
Summary: In this paper, we propose to focus on the segmentation of vectorial features (e.g. vector fields or color intensity) using region-based active contours. We search for a domain that minimizes a criterion based on homogeneity measures of the vectorial features. We choose to evaluate, within each region to be segmented, the average quantity of information carried out by the vectorial features, namely the joint entropy of vector components. We do not make any assumption on the underlying distribution of joint probability density functions of vector components, and so we evaluate the entropy using non parametric probability density functions. A local shape minimizer is then obtained through the evolution of a deformable domain in the direction of the shape gradient.
The first contribution of this paper lies in the methodological approach used to differentiate such a criterion. This approach is mainly based on shape optimization tools. The second one is the extension of this method to vectorial data. We apply this segmentation method on color images for the segmentation of color homogeneous regions. We then focus on the segmentation of synthetic vector fields and show interesting results where motion vector fields may be separated using both their length and their direction. Then, optical flow is estimated in real video sequences and segmented using the proposed technique. This leads to promising results for the segmentation of moving video objects.
The first contribution of this paper lies in the methodological approach used to differentiate such a criterion. This approach is mainly based on shape optimization tools. The second one is the extension of this method to vectorial data. We apply this segmentation method on color images for the segmentation of color homogeneous regions. We then focus on the segmentation of synthetic vector fields and show interesting results where motion vector fields may be separated using both their length and their direction. Then, optical flow is estimated in real video sequences and segmented using the proposed technique. This leads to promising results for the segmentation of moving video objects.
MSC:
| 94A08 | Image processing (compression, reconstruction, etc.) in information and communication theory |
| 68T45 | Machine vision and scene understanding |
Keywords:
image segmentation; active contours; image statistics; information; information theory; entropy; joint probability; shape optimization; shape gradient; motion segmentationReferences:
| [1] | G. Aubert, M. Barlaud, O. Faugeras, and S. Jehan-Besson, ”Image segmentation using active contours: Calculus of variations or shape gradients ?,” SIAM Applied Mathematics, Vol. 63, No. 6, pp. 2128–2154, 2003. · Zbl 1053.94003 · doi:10.1137/S0036139902408928 |
| [2] | V. Caselles, R. Kimmel, and G. Sapiro, ”Geodesic active contours,” International Journal of Computer Vision, Vol. 2, No. 1, pp. 61–79, 1997. · Zbl 0894.68131 · doi:10.1023/A:1007979827043 |
| [3] | T. Chan and L. Vese, ”Active contours without edges,” IEEE Transactions on Image Processing, Vol. 10, No. 2, pp. 266–277, 2001. · Zbl 1039.68779 · doi:10.1109/83.902291 |
| [4] | P. Charbonnier, L. Blanc-Féraud, G. Aubert, and M. Barlaud, ”Deterministic edge-preserving regularization in computed imaging,” IEEE Transactions on Image Processing, Vol. 6, No. 2, pp. 298–311, 1997. · doi:10.1109/83.551699 |
| [5] | C. Chesnaud, P. Réfrégier, and V. Boulet, ”Statistical region snake-based segmentation adapted to different physical noise models,” IEEE Transactions on Pattern Analysis and Machine Intelligence Vol. 21, pp. 1145–1156, 1999. · doi:10.1109/34.809108 |
| [6] | L. Cohen, E. Bardinet, and N. Ayache, ”Surface reconstruction using active contour models,” in SPIE Conf. on Geometric Methods in Comp. Vis. San Diego, 1993. |
| [7] | T. Cover and J. Thomas, Elements of Information Theory, Wiley-Interscience, 1991. · Zbl 0762.94001 |
| [8] | D. Cremers and S. Soatto, ”Variational space-time motion segmentation,” in IEEE Int. Conf. on Computer Vision, 2003, Vol. 2. pp. 886–892. |
| [9] | E. Debreuve, M. Barlaud, G. Aubert, and J. Darcourt, ”Space time segmentation using level set active contours applied to myocardial gated SPECT,” IEEE Transactions on Medical Imaging, Vol. 20, No. 7, pp. 643–659, 2001. · doi:10.1109/42.932748 |
| [10] | M. Delfour and J. Zolésio, Shape and geometries. Advances in Design and Control, SIAM, 2001. |
| [11] | S. Geman and D. McLure ”Bayesian image analysis: An application to single photon emission tomography,” In: Proc. Statist. Comput. Sect., 1985. |
| [12] | J. Gomes and O. Faugeras, ”Reconciling distance functions and level sets,” Journal of Visual Communication and Image Representation, Vol. 11, pp. 209–223, 2000. · doi:10.1006/jvci.1999.0439 |
| [13] | A. Herbulot, S. Jehan-Besson, M. Barlaud, and G. Aubert, ”Shape gradient for image segmentation using information theory,” in International Conference on Acoustics, Speech and Signal Processing. Montreal, 2004. |
| [14] | A. Herbulot, S. Jehan-Besson, M. Barlaud, and G. Aubert, ”Shape gradient for multi-modal image segmentation using mutual information,” In: International Conference on Image Processing. Singapore, 2004. |
| [15] | S. Jehan-Besson, M. Barlaud, and G. Aubert, ”Video object segmentation using eulerian region-based active contours,” in International Conference on Computer Vision. Vancouver, Canada, 2001. · Zbl 1053.94003 |
| [16] | S. Jehan-Besson, M. Barlaud, and G. Aubert, ”A 3-Step algorithm using region-based active contours for video objects detection,” EURASIP Journal on Applied Signal Processing, Special issue on Image Analysis for Multimedia Interactive Services, Vol. 2002, No. 6, pp. 572–581, 2002. |
| [17] | S. Jehan-Besson, M. Barlaud, and G. Aubert,”DREAM2S: Deformable regions driven by an eulerian accurate minimization method for image and video segmentation,” International Journal of Computer Vision, Vol. 53, pp. 45–70, 2003. · Zbl 1477.68375 · doi:10.1023/A:1023031708305 |
| [18] | S. Kichenassamy, A. Kumar, P.J. Olver, A. Tannenbaum, and A. Yezzi, ”Conformal curvature flows: From phase transitions to active vision,” Archive for Rational Mechanics and Analysis, Vol. 134, No. 3, pp. 275–301, 1996. · Zbl 0937.53029 · doi:10.1007/BF00379537 |
| [19] | J. Kim, J. Fisher III, A. Yezzi Jr., M. Cetin, and A. Willsky, ”Nonparametric methods for image segmentation using information theory and curve evolution,” in International Conference on Image Processing, 2002 |
| [20] | F. Maes, A. Collignon, D. Vandermeulen, G. Marchal, and P. Suetens, ”Multimodality image registration by maximization of mutual information,” IEEE Transactions on Medical Imaging, Vol. 16, No. 2, 1997. |
| [21] | E. Mémin and P. Pérez, ”Dense estimation and object-based segmentation of the optical flow with robust techniques,” IEEE Transactions on Image Processing, Vol. 7, No. 5, pp. 703–718, 1998. · doi:10.1109/83.668027 |
| [22] | J. Odobez and P. Bouthemy, ”Robust multiresolution estimation of parametric motion models,” Journal of Visual Communication and Image Representation, Vol. 6, No. 4, pp. 348–365, 1995. · doi:10.1006/jvci.1995.1029 |
| [23] | S. Osher and J. Sethian, ”Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulation,” Journal of Computational Physics, Vol. 79, pp. 12–49, 1988. · Zbl 0659.65132 · doi:10.1016/0021-9991(88)90002-2 |
| [24] | N. Paragios and R. Deriche, ”Geodesic active regions: A new paradigm to deal with frame partition problems in computer vision,” Journal of Visual Communication and Image Representation, Vol. 13, pp. 249–268, 2002. · doi:10.1006/jvci.2001.0475 |
| [25] | F. Precioso, M. Barlaud, T. Blu, and M. Unser: to appear, ”Robust real-time segmentation of images and videos using a smoothing-spline snake-based algorithm,” IEEE Transactions on Image Processing, 2005. |
| [26] | F. Ranchin and F. Dibos, ”Moving objects segmentation using optical flow estimation,” in Workshop on Mathematics and Image Analysis. Paris, 2004. |
| [27] | R. Ronfard, ”Region-based strategies for active contour models,” International Journal of Computer Vision, Vol. 13, No. 2, pp. 229–251, 1994. · doi:10.1007/BF01427153 |
| [28] | T. Roy, E. Debreuve, M. Barlaud, and G. Aubert, ”Segmentation of a vector field: Dominant parameter and shape otimization,” Journal of Mathematical Imaging and Vision (In Press), 2006. |
| [29] | C. Schnörr, ”Segmentation of visual motion by minimizing convex non-quadratic functionals,” in Proc. 12th Int. Conf. Pattern Recognition, Vol. A. Jerusalem, IEEE Computer Society Press, Los Alamitos, 1994, pp. 661–663. |
| [30] | C. Shannon, ”A mathematical theory of communication,” Bell Sys. Tech. J., Vol. 27, pp. 379–423, 1948. · Zbl 1154.94303 |
| [31] | J. Sokolowski and J. Zolésio, Introduction to Shape Optimization, Vol. 16 of Springer Series in Computational Mathematics. Springer-Verlag, 1992. |
| [32] | J. Weickert ”On discontinuity-preserving optic flow,” in Proc. Computer Vision and Mobile Robotics Workshop, 1998, Santorini, pp. 115–122. |
| [33] | W. Wells, P. Viola, H. Atsumi, S. Nakajima, and R. Kikinis, ”Multi-modal volume registration by maximization of mutual information,” Medical Image Analysis, Vol. 1, No. 1, pp. 35–51, 1996. · doi:10.1016/S1361-8415(01)80004-9 |
| [34] | A. Yezzi, A. Tsai, and A. Willsky, ”A statistical approach to snakes for bimodal and trimodal imagery,” in Int. Conference on Image Processing, Kobe Japan, 1999. |
| [35] | S. Zhu and A. Yuille, ”Region competition: Unifying snakes, region growing, and Bayes/MDL for multiband image segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 18, pp. 884–900, 1996. · doi:10.1109/34.537343 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
