Sciweavers

2527 search results - page 13 / 506
» Discrete optimization in computer vision
Sort
View
ICPR
2010
IEEE
14 years 4 months ago
Continuous Markov Random Field Optimization using Fusion Move Driven Markov Chain Monte Carlo Technique
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...
Wonsik Kim (Seoul National University), Kyoung Mu ...
SCALESPACE
2009
Springer
14 years 4 months ago
A Scale-Space Approach to Landmark Constrained Image Registration
Adding external knowledge improves the results for ill-posed problems. In this paper we present a new multi-level optimization framework for image registration when adding landmark...
Eldad Haber, Stefan Heldmann, Jan Modersitzki
AHS
2006
IEEE
119views Hardware» more  AHS 2006»
14 years 3 months ago
Particle Swarm Optimization with Discrete Recombination: An Online Optimizer for Evolvable Hardware
Self-reconfigurable adaptive systems have the possibility of adapting their own hardware configuration. This feature provides enhanced performance and flexibility, reflected i...
Jorge Peña, Andres Upegui, Eduardo Sanchez
ICIAP
2005
ACM
14 years 3 months ago
Markovian Energy-Based Computer Vision Algorithms on Graphics Hardware
This paper shows how Markovian segmentation algorithms used to solve well known computer vision problems such as motion estimation, motion detection and stereovision can be signi...
Pierre-Marc Jodoin, Max Mignotte, Jean-Franç...