315 search results - page 49 / 63 » An Optimal Algorithm for the Maximum-Density Segment Problem |
PAMI
2007
13 years 6 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
GBRPR
2005
Springer
14 years 7 days ago
2005
Springer
Abstract. An appropriate image representation induces some good image treatment algorithms. Hypergraph theory is a theory of finite combinatorial sets, modeling a lot of problems ...
CBMS
2000
IEEE
13 years 11 months ago
2000
IEEE
This paper presents the developement of a novel, fullyautomatic tracking and segmentation system to extract the boundary of the carotid artery from ultrasound images in real-time....
CVPR
2009
IEEE
15 years 1 months ago
2009
IEEE
Normalized Cut is a widely used technique for solving a
variety of problems. Although finding the optimal normalized
cut has proven to be NP-hard, spectral relaxations can
be ap...
ISBI
2009
IEEE
14 years 1 months ago
2009
IEEE
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...