Sciweavers

2219 search results - page 7 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
PAMI
2007
176views more  PAMI 2007»
13 years 7 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
CVPR
2001
IEEE
14 years 9 months ago
Multi-Object Tracking Using Dynamical Graph Matching
Hwann-Tzong Chen, Horng-Horng Lin, Tyng-Luh Liu
JIB
2006
102views more  JIB 2006»
13 years 7 months ago
3D image and graph based Computation of Protein Surface
The accessible surface of a macromolecule is a significant determinant of its action. The interaction between biomolecules or protein-ligand is dependent on their surfaces rather ...
A. Ranganath, K. C. Shet, N. Vidyavathi
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
13 years 11 months ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn
ICIAP
2005
ACM
14 years 1 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ç...