Sciweavers

2064 search results - page 78 / 413
» Segmentation Problems
Sort
View
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
14 years 17 days ago
An effective genetic algorithm for the minimum-label spanning tree problem
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
Jeremiah Nummela, Bryant A. Julstrom
ICCV
2009
IEEE
15 years 1 months ago
Convex Multi-Region Segmentation on Manifolds
In this paper, we address the problem of segmenting data defined on a manifold into a set of regions with uniform properties. In particular, we propose a numerical method when the ...
Amaël Delaunoy, Ketut Fundana, Emmanuel Prados, A...
ISBI
2011
IEEE
13 years 19 days ago
Group sparsity based classification for cervigram segmentation
This paper presents an algorithm to classify pixels in uterine cervix images into two classes, namely normal and abnormal tissues, and simultaneously select relevant features, usi...
Yang Yu, Junzhou Huang, Shaoting Zhang, Christophe...
WACV
2005
IEEE
14 years 2 months ago
Image Segmentation by Unsupervised Sparse Clustering
In this paper, we present a novel solution of image segmentation based on positiveness by regarding the segmentation as one of the graph-theoretic clustering problems. On the cont...
Byoung-Ki Jeon, Yun-Beom Jung, Ki-Sang Hong
ICPR
2002
IEEE
14 years 10 months ago
A Fast Leading Eigenvector Approximation for Segmentation and Grouping
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
Antonio Robles-Kelly, Sudeep Sarkar, Edwin R. Hanc...