Sciweavers

2219 search results - page 39 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
ICCV
2007
IEEE
14 years 11 months ago
A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm
In this work, we present a common framework for seeded image segmentation algorithms that yields two of the leading methods as special cases - The Graph Cuts and the Random Walker...
Ali Kemal Sinop, Leo Grady
BMCBI
2002
108views more  BMCBI 2002»
13 years 8 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy
ICRA
2005
IEEE
192views Robotics» more  ICRA 2005»
14 years 2 months ago
A Robust Visual Odometry and Precipice Detection System Using Consumer-grade Monocular Vision
– We describe a monocular robot vision system which accomplishes accurate 3-DOF dead-reckoning, closedloop motion control, and precipice and obstacle detection, all in dynamic en...
Jason Campbell, Rahul Sukthankar, Illah R. Nourbak...
SEFM
2008
IEEE
14 years 3 months ago
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
Tuan-Hung Pham, Anh-Hoang Truong, Ninh-Thuan Truon...
ICSE
2003
IEEE-ACM
14 years 9 months ago
Whole Program Path-Based Dynamic Impact Analysis
Impact analysis, determining when a change in one part of a program affects other parts of the program, is timeconsuming and problematic. Impact analysis is rarely used to predict...
James Law, Gregg Rothermel