1992
DOI: 10.1007/bf01212715
|View full text |Cite
|
Sign up to set email alerts
|

Local association based recognition of two-dimensional objects

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
13
0

Year Published

1995
1995
2005
2005

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(13 citation statements)
references
References 22 publications
0
13
0
Order By: Relevance
“…The indexing structure is based on work presented in [22] and [23]. In contrast to many shape comparison methods, the polygon hashing method maps all local features to a common space, denoted in Figure 2 as the index space.…”
Section: Polygon Hashingmentioning
confidence: 99%
“…The indexing structure is based on work presented in [22] and [23]. In contrast to many shape comparison methods, the polygon hashing method maps all local features to a common space, denoted in Figure 2 as the index space.…”
Section: Polygon Hashingmentioning
confidence: 99%
“…Then the two highest results, called here W, 1 and W, 2 associated to the masks m 1 and m 2 , respectively, are determined. If the highest sum, always assumed to be W,I' is equal to zero then the center pixel of the window does necessarily not belong to the path, and the output pixel is set to 0.…”
Section: Pathfinder IImentioning
confidence: 99%
“…A second condition to be analyzed is when W, 1 and W, 2 have an equal value and m 1 and m 2 are adjacent (adjacent paths are those which are different from one another by just one pixel). This situation is considered a stalemate, because the two different pixels in each path could be equally labeled contour pixels.…”
Section: Pathfinder IImentioning
confidence: 99%
See 2 more Smart Citations