2127 search results - page 57 / 426 » Computing large matchings fast |
127
Voted
CGF
2004
15 years 3 months ago
2004
We present three methods for texturing point models from sample textures. The first method, the point parameterization method, uses a fast distortion-bounded parameterization algo...
126
click to vote
BPM
2009
Springer
15 years 10 months ago
2009
Springer
We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specifically on the applicat...
128
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
140
Voted
AMDO
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In this paper, we present a novel, fast, resolution-independent silhouette area-based matching approach. We approximate the silhouette area by a small set of axis-aligned...
166
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...