Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,142
Multiway cuts and spectral clustering
, 2003
"... We look at spectral clustering as optimization. We show that near some special points called perfect, spectral clustering optimizes simultaneously two criteria: a dissimilarity measure that we call the multiway normalized cut (MNCut) and a cluster coherence measure that we call the gap. The immedia ..."
Abstract
-
Cited by 20 (0 self)
- Add to MetaCart
We look at spectral clustering as optimization. We show that near some special points called perfect, spectral clustering optimizes simultaneously two criteria: a dissimilarity measure that we call the multiway normalized cut (MNCut) and a cluster coherence measure that we call the gap
Contour and Texture Analysis for Image Segmentation
, 2001
"... This paper provides an algorithm for partitioning grayscale images into disjoint regions of coherent brightness and texture. Natural images contain both textured and untextured regions, so the cues of contour and texture differences are exploited simultaneously. Contours are treated in the interveni ..."
Abstract
-
Cited by 404 (28 self)
- Add to MetaCart
are to belong to the same region, we use the spectral graph theoretic framework of normalized cuts to find partitions of the image into regions of coherent texture and brightness. Experimental results on a wide range of images are shown.
Geometry images
- IN PROC. 29TH SIGGRAPH
, 2002
"... Surface geometry is often modeled with irregular triangle meshes. The process of remeshing refers to approximating such geometry using a mesh with (semi)-regular connectivity, which has advantages for many graphics applications. However, current techniques for remeshing arbitrary surfaces create onl ..."
Abstract
-
Cited by 342 (24 self)
- Add to MetaCart
simple 2D array of quantized points. Surface signals like normals and colors are stored in similar 2D arrays using the same implicit surface parametrization — texture coordinates are absent. To create a geometry image, we cut an arbitrary mesh along a network of edge paths, and parametrize the resulting
Multiway cut for stereo and motion with slanted surfaces
- In International Conference on Computer Vision
, 1999
"... Slanted surfaces pose a problem for correspondence algorithms utilizing search because of the greatly increased number of possibilities, when compared with frontoparallel surfaces. In this paper we propose an algorithm to compute correspondence between stereo images or between frames of a motionsequ ..."
Abstract
-
Cited by 138 (2 self)
- Add to MetaCart
motionsequence by minimizingan energy functional that accounts for slanted surfaces. The energy is minimized in a greedy strategy that alternates between segmenting the image into a number of non-overlapping regions (using the multiway-cut algorithm of Boykov, Veksler, and Zabih) and finding the affine
An improved approximation algorithm for multiway cut
- Journal of Computer and System Sciences
, 1998
"... Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Multiway Cut is the problem of finding a multiway cut of minimum cost. Previously, a very simple combinatorial algorithm due ..."
Abstract
-
Cited by 71 (5 self)
- Add to MetaCart
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Multiway Cut is the problem of finding a multiway cut of minimum cost. Previously, a very simple combinatorial algorithm due
NORMALIZED CUTS ARE APPROXIMATELY INVERSE EXIT TIMES
"... Abstract. Normalized Cut is a widely used measure of separation between clusters in a graph. In this paper we provide a novel probabilistic perspective on this measure. We show that for a partition of a graph into two weakly connected sets, V = A ⊎ B, the multiway normalized cut is approximately MNc ..."
Abstract
- Add to MetaCart
Abstract. Normalized Cut is a widely used measure of separation between clusters in a graph. In this paper we provide a novel probabilistic perspective on this measure. We show that for a partition of a graph into two weakly connected sets, V = A ⊎ B, the multiway normalized cut is approximately
Motion Segmentation and Tracking Using Normalized Cuts
, 1998
"... We propose a motion segmentation algorithm that aims to break a scene into its most prominent moving groups. A weighted graph is constructed on the ira. age sequence by connecting pixels that arc in the spatio-temporal neighborhood of each other. At each pizel, we define motion profile vectors which ..."
Abstract
-
Cited by 179 (6 self)
- Add to MetaCart
which capture the probability distribution of the image veloczty. The distance between motion profiles is used to assign a weight on the graph edges. 5rsmg normalized cuts we find the most salient partitions of the spatiotemporaI graph formed by the image sequence. For swmenting long image sequences
On weighted multiway cuts in trees
- MATHEMATICAL PROGRAMMING
, 1994
"... A min-max theorem is developed for the multiway cut problem of edge-weighted trees. We present a polynomial time algorithm to construct an optimal dual solution, if edge weights come in unary representation. Applications to biology also require some more complex edge weights. We describe a dynarnic ..."
Abstract
-
Cited by 14 (0 self)
- Add to MetaCart
A min-max theorem is developed for the multiway cut problem of edge-weighted trees. We present a polynomial time algorithm to construct an optimal dual solution, if edge weights come in unary representation. Applications to biology also require some more complex edge weights. We describe a dynarnic
Results 1 - 10
of
3,142
