Sciweavers

15 search results - page 1 / 3
» Matching Patterns of Line Segments by Eigenvector Decomposit...
Sort
View
SSIAI
2002
IEEE
14 years 13 days ago
Matching Patterns of Line Segments by Eigenvector Decomposition
This paper presents an algorithm for matching line segments in two images which are related by an affine transformation. Images are represented as patterns of line segments. Areas...
H. B. Chan, Y. S. Hung
SODA
2001
ACM
86views Algorithms» more  SODA 2001»
13 years 9 months ago
Pattern matching for sets of segments
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of ...
Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
CPM
2006
Springer
107views Combinatorics» more  CPM 2006»
13 years 11 months ago
Tiling an Interval of the Discrete Line
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
Olivier Bodini, Eric Rivals
ISMIR
2004
Springer
157views Music» more  ISMIR 2004»
14 years 27 days ago
Pattern Matching in Polyphonic Music as a Weighted Geometric Translation Problem
We consider the music pattern matching problem—to find occurrences of a small fragment of music called the “pattern” in a larger body of music called the “score”—as a...
Anna Lubiw, Luke Tanur
COMPGEOM
2003
ACM
14 years 23 days ago
Polygon decomposition based on the straight line skeleton
We propose a novel type of decomposition for polygonal shapes. It is thought that, for the task of object recognition, the human visual system uses a part-based representation. De...
Mirela Tanase, Remco C. Veltkamp