18th International Conference on Pattern Recognition (ICPR'06) 2006
DOI: 10.1109/icpr.2006.879
|View full text |Cite
|
Sign up to set email alerts
|

Object Localization Based on Directional Information: Case of 2D Raster Data

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2006
2006
2012
2012

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 8 publications
(8 citation statements)
references
References 16 publications
0
8
0
Order By: Relevance
“…We have used it here to determine the behavior of the force histogram towards any invertible affine transformation. In the future, it should help us solve other issues, such as the inverse problem [6], object localization [22] and histogram composition [23]. We will also show that it can be extended to 3-D raster data, like the standard definition [24], and we will examine the case of vector data.…”
Section: Resultsmentioning
confidence: 99%
“…We have used it here to determine the behavior of the force histogram towards any invertible affine transformation. In the future, it should help us solve other issues, such as the inverse problem [6], object localization [22] and histogram composition [23]. We will also show that it can be extended to 3-D raster data, like the standard definition [24], and we will examine the case of vector data.…”
Section: Resultsmentioning
confidence: 99%
“…Two approximation algorithms (one based on a morphological approach [1] and one based on the partitioning of the image into parallel raster lines [11]) have been proposed and are commonly used [8,9,10]. Standard maps, unfortunately, have important flaws, as will be shown in Section 5.…”
Section: Directional Mapsmentioning
confidence: 99%
“…5 to 9 lead to a new approximation algorithm, which is faster and gives better results than the algorithm presented in [6]. Details can be found in [11].…”
Section: F-templatesmentioning
confidence: 99%
“…Besides this update procedure, the algorithm is the same as the algorithm presented in [11] (case of crisp objects). The reader can therefore refer to [11] for details on, e.g., optimization and template initialization (which is actually not F δB ← 0).…”
Section: B Implementationmentioning
confidence: 99%
See 1 more Smart Citation