3 research outputs found
Active Contour Models for Manifold Valued Image Segmentation
Image segmentation is the process of partitioning a image into different
regions or groups based on some characteristics like color, texture, motion or
shape etc. Active contours is a popular variational method for object
segmentation in images, in which the user initializes a contour which evolves
in order to optimize an objective function designed such that the desired
object boundary is the optimal solution. Recently, imaging modalities that
produce Manifold valued images have come up, for example, DT-MRI images, vector
fields. The traditional active contour model does not work on such images. In
this paper, we generalize the active contour model to work on Manifold valued
images. As expected, our algorithm detects regions with similar Manifold values
in the image. Our algorithm also produces expected results on usual gray-scale
images, since these are nothing but trivial examples of Manifold valued images.
As another application of our general active contour model, we perform texture
segmentation on gray-scale images by first creating an appropriate Manifold
valued image. We demonstrate segmentation results for manifold valued images
and texture images
A survey and comparison of contemporary algorithms for computing the matrix geometric mean
In this paper we present a survey of various algorithms for computing matrix geometric means and derive new second-order optimization algorithms to compute the Karcher mean. These new algorithms are constructed using the standard definition of the Riemannian Hessian. The survey includes the ALM list of desired properties for a geometric mean, the analytical expression for the mean of two matrices, algorithms based on the centroid computation in Euclidean (flat) space, and Riemannian optimization techniques to compute the Karcher mean (preceded by a short introduction into differential geometry). A change of metric is considered in the optimization techniques to reduce the complexity of the structures used in these algorithms. Numerical experiments are presented to compare the existing and the newly developed algorithms. We conclude that currently first-order algorithms are best suited for this optimization problem as the size and/or number of the matrices increase. Copyright © 2012, Kent State University