84 search results - page 9 / 17 » Image partitioning with kernel mapping and graph cuts |
KDD
2005
ACM
14 years 8 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
MVA
2008
13 years 7 months ago
2008
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
PR
2000
2000
A region-level motion-based graph representation and labeling for tracking a spatial image partition
13 years 7 months ago
This paper addresses two image sequence analysis issues under a common framework. These tasks are, "rst, motion-based segmentation and second, updating and tracking over time...
PAMI
2010
13 years 5 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
ICCV
2009
IEEE
15 years 14 days ago
2009
IEEE
Geometric rearrangement of images includes operations
such as image retargeting, inpainting, or object rearrangement.
Each such operation can be characterized by a shiftmap:
the...