Sciweavers

352 search results - page 32 / 71
» Fast Graph Pattern Matching
Sort
View
PR
2007
134views more  PR 2007»
13 years 7 months ago
An elastic partial shape matching technique
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
ICCV
2007
IEEE
14 years 9 months ago
Spatial Random Partition for Common Visual Pattern Discovery
Automatically discovering common visual patterns from a collection of images is an interesting but yet challenging task, in part because it is computationally prohibiting. Althoug...
Junsong Yuan, Ying Wu
GBRPR
2009
Springer
14 years 2 months ago
Matching Hierarchies of Deformable Shapes
This paper presents an approach to matching parts of deformable shapes. Multiscale salient parts of the two shapes are first identified. Then, these parts are matched if their im...
Nadia Payet, Sinisa Todorovic
STACS
1992
Springer
13 years 11 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
JGAA
2007
135views more  JGAA 2007»
13 years 7 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento