Sciweavers

262 search results - page 36 / 53
» Image Registration with Minimum Spanning Tree Algorithm
Sort
View
PPSN
2004
Springer
15 years 3 months ago
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
Patrick Briest, Dimo Brockhoff, Bastian Degener, M...
PAMI
2010
245views more  PAMI 2010»
14 years 8 months ago
A Combinatorial Solution for Model-Based Image Segmentation and Real-Time Tracking
—We propose a combinatorial solution to determine the optimal elastic matching of a deformable template to an image. The central idea is to cast the optimal matching of each temp...
Thomas Schoenemann, Daniel Cremers
ISAAC
2007
Springer
146views Algorithms» more  ISAAC 2007»
15 years 3 months ago
Bounded Tree-Width and CSP-Related Problems
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
Tommy Färnqvist, Peter Jonsson
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
15 years 1 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
CVPR
2008
IEEE
15 years 4 months ago
Normalized tree partitioning for image segmentation
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
Jingdong Wang, Yangqing Jia, Xian-Sheng Hua, Chang...