1725 search results - page 148 / 345 » Relaxed genetic programming |
148
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
We set out an object localization scheme based on a convex programming matching method. The proposed approach is designed to match general objects, especially objects with very li...
168
click to vote
PAMI
2007
15 years 6 months ago
2007
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
169
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
148
click to vote
IRREGULAR
1997
Springer
15 years 10 months ago
1997
Springer
ing with shared data abstractions Simon Dobson1 and Don Goodeve2 1 Well-Founded Systems Unit, CLRC Rutherford Appleton Laboratory, UK 2 School of Computer Studies, University of Le...
179
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...