Sciweavers

1525 search results - page 56 / 305
» Matching with Regular Constraints
Sort
View
CPM
2005
Springer
105views Combinatorics» more  CPM 2005»
15 years 11 months ago
Reducing the Size of NFAs by Using Equivalences and Preorders
Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...
Lucian Ilie, Roberto Solis-Oba, Sheng Yu
CAPTECH
1998
Springer
15 years 9 months ago
3D Part Recognition Method for Human Motion Analysis
A method for matching sequences from two perspective views of a moving person silhouette is presented. Regular (approximate uniform thickness) parts are detected on an image and a ...
Carlos Yániz, Jairo Rocha, Francisco J. Per...
IVC
2007
131views more  IVC 2007»
15 years 5 months ago
Multi-view correspondence by enforcement of rigidity constraints
Establishing the correct correspondence between features in an image set remains a challenging problem amongst computer vision researchers. In fact, the combinatorial nature of fe...
Ricardo Oliveira, João Xavier, João ...
VLSISP
2002
112views more  VLSISP 2002»
15 years 5 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
CVPR
2009
IEEE
17 years 19 days ago
Harris Corners in the Real World: A Principled Selection Criterion for Interest Points Based on Ecological Statistics
In this report, we consider whether statistical regularities in natural images might be exploited to provide an improved selection criterion for interest points. One approach that ...
Neil D. B. Bruce, Pierre Kornprobst