Search NASA⌕ Search

Engineering topics

Staneva, Valentina

Publications and source records attributed to Staneva, Valentina.

A faster-converging algorithm for image segmentation with a modified Chan-Vese model

We propose an algorithm for segmentation of grayscale images. Our algorithm computes a solution to the convex, unconstrained minimization problem proposed by T. Chan., S. Esedoglu, and M. Nikolova in [1], which is closely related to the Chan-Vese level set algorithm for the Mumford-Shah segmentation model. Up to now this problem has been solved with a gradient descent method. Our approach is a quasi-Newton method based on the lagged diffusivity algorithm [2] for minimizing the total-variation functional for image denoising [3]. Our results show that our algorithm requires a much smaller number of iterations and less time to converge than gradient descent, and is able to segment noisy images correctly.

97 MATHEMATICS AND COMPUTING↗

Restricted isometry properties and nonconvex compressive sensing

In previous work, numerical experiments showed that ι p minimization with 0 < p < 1 recovers sparse signals from fewer linear measurements than does ι 1 minimization. It was also shown that a weaker restricted isometry property is sufficient to guarantee perfect recovery in the ι p case. In this work, we generalize this result to an ι p variant of the restricted isometry property, and then determine how many random Gaussian measurements are sufficient for the condition to hold with high probability.

97 MATHEMATICS AND COMPUTING↗