Sciweavers

3136 search results - page 220 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
15 years 7 months ago
Coordinate change operators for genetic algorithms
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
Elizabeth F. Wanner, Eduardo G. Carrano, Ricardo H...
CVPR
2009
IEEE
17 years 1 months ago
Global Optimization for Alignment of Generalized Shapes
In this paper, we introduce a novel algorithm to solve global shape registration problems. We use gray-scale “images” to represent source shapes, and propose a novel twocompo...
Hongsheng Li (Lehigh University), Tian Shen (Lehig...
CVPR
2007
IEEE
16 years 8 months ago
A Probabilistic Intensity Similarity Measure based on Noise Distributions
We derive a probabilistic similarity measure between two observed image intensities that is based on the noise properties of the camera. In many vision algorithms, the effect of c...
Yasuyuki Matsushita, Stephen Lin
ICCV
2007
IEEE
16 years 8 months ago
MRF Optimization via Dual Decomposition: Message-Passing Revisited
A new message-passing scheme for MRF optimization is proposed in this paper. This scheme inherits better theoretical properties than all other state-of-the-art message passing met...
Nikos Komodakis, Nikos Paragios, Georgios Tziritas
ECCV
2008
Springer
16 years 8 months ago
Belief Propagation with Directional Statistics for Solving the Shape-from-Shading Problem
The Shape-from-Shading [SfS] problem infers shape from reflected light, collected using a camera at a single point in space only. Reflected light alone does not provide sufficient ...
Tom S. F. Haines, Richard C. Wilson