14704 search results - page 2716 / 2941 » computing 2007 |
144
click to vote
PAMI
2007
15 years 3 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
142
click to vote
PAMI
2007
15 years 3 months ago
2007
—In this paper, we present a new model for deformations of shapes. A pseudolikelihood is based on the statistical distribution of the gradient vector field of the gray level. The...
163
click to vote
PAMI
2007
15 years 3 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....
127
click to vote
PE
2007
Springer
15 years 3 months ago
2007
Springer
The simulation of mobility models such as the random waypoint often cause subtle problems, for example the decay of average speed as the simulation progresses, a difference betwee...
146
click to vote
PR
2007
15 years 3 months ago
2007
Image matching has been a central problem in computer vision and image processing for decades. Most of the previous approaches to image matching can be categorized into the intens...