1998
DOI: 10.1007/s001380050082
|View full text |Cite
|
Sign up to set email alerts
|

A local method for contour matching and its parallel implementation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

1999
1999
2016
2016

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 14 publications
(13 citation statements)
references
References 27 publications
0
13
0
Order By: Relevance
“…It allows local tracking of edge points. Our algorithm is inspired from the Moving Edge (ME) algorithm [8,9,15]. Contours are first sampled at a regular interval.…”
Section: Door Trackingmentioning
confidence: 99%
See 2 more Smart Citations
“…It allows local tracking of edge points. Our algorithm is inspired from the Moving Edge (ME) algorithm [8,9,15]. Contours are first sampled at a regular interval.…”
Section: Door Trackingmentioning
confidence: 99%
“…Different tracking techniques have been proposed in the literature: they mainly differ in geometric features that are used to describe the tracked objects, e.g. contours [6,7], straight lines or segments [8], etc. Since doors are characterized by straight lines, we used the 2D Moving Edges (ME) tracker [8,9] while implementing an oriented gradient mask.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Nevertheless, we will still use the word "contour" to refer to the list of tracked points for convenience. The ME algorithm can be implemented with convolution efficiency, thereby leading to real-time computation [4,5].…”
Section: Computing Normal Displacementsmentioning
confidence: 99%
“…The former approach considers features such as simple geometrical primitives (points, segments [4,15], circles [23],. .…”
Section: Introductionmentioning
confidence: 99%