Sciweavers

608 search results - page 61 / 122
» Some Solutions to the Missing Feature Problem in Vision
Sort
View
JOTA
2011
149views more  JOTA 2011»
14 years 4 months ago
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
Napsu Karmitsa, Mario Tanaka Filho, José He...
CVPR
2011
IEEE
14 years 5 months ago
RUNE-Tag: a High Accuracy Fiducial Marker with Strong Occlusion Resilience
Over the last decades fiducial markers have provided widely adopted tools to add reliable model-based features into an otherwise general scene. Given their central role in many c...
Filippo Bergamasco, Andrea Albarelli, Andrea Torse...
ICCAD
2009
IEEE
106views Hardware» more  ICCAD 2009»
14 years 7 months ago
An efficient pre-assignment routing algorithm for flip-chip designs
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...
Po-Wei Lee, Chung-Wei Lin, Yao-Wen Chang, Chin-Fan...
EMMCVPR
2005
Springer
15 years 3 months ago
Probabilistic Subgraph Matching Based on Convex Relaxation
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
Christian Schellewald, Christoph Schnörr
CEC
2007
IEEE
15 years 4 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki