Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Least square image matting
EN
This paper addresses the well-known problem of natural image matting. Most of the previous matting algorithms require the user to define the tri-map, which is an inconvenient work and sometimes a burden, especially in a complex situation. This paper uses ceratain user defined foreground and background strokes to estimate the image matte. First we use a Gauss Markov random field to model the matting problem. Then we use the least square optimization approach to solve it. Experimental results show that our approach could properly handle confused boundaries. It also could deal with semi-transparent conditions such as fire etc.
EN
A new approach to color image segmentation is demonstrated here. The color iamge, which is usually in the RGB space, is translated into the CIE(Lab) color space. The three components are smoothed using a variation-based approach. By minimizing an energy functional with a non-convex regular function, we can get a smoothed image. During the iteraction, the edges of the image are preserved. A soft C-means clustering algorithm, which is an improvement on the hard C-means algorithm, is employed to segment them after smoothing. This algorithm overcomes the problem of dependence of the initializations, Finally, an experiment is given to show the effectiveness and robustness of the method.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.