1995
DOI: 10.1016/0167-8655(95)00084-5
|View full text |Cite
|
Sign up to set email alerts
|

Character string recognition on maps, a rotation-invariant recognition method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0
1

Year Published

1998
1998
2016
2016

Publication Types

Select...
4
3
3

Relationship

0
10

Authors

Journals

citations
Cited by 30 publications
(17 citation statements)
references
References 1 publication
0
16
0
1
Order By: Relevance
“…Recognized elements are taken from cadastral maps such as presented in Figure 4. For recognized elements translation, scale and rotation are normalized [11]. Next, low cost features such as histograms and projection are calculated.…”
Section: Testsmentioning
confidence: 99%
“…Recognized elements are taken from cadastral maps such as presented in Figure 4. For recognized elements translation, scale and rotation are normalized [11]. Next, low cost features such as histograms and projection are calculated.…”
Section: Testsmentioning
confidence: 99%
“…However, some aspects of this pattern recognition problem are still the object of intensive research activities because of their specificity: multi-oriented and multi-scaled characters [20,23,42,43], connected characters [20,42,44], connected symbols [6], and geometric features identification [45]. This kind of problem is crucial, since characters and symbols carry very important information about the contents of a document: poor detection/recognition of such patterns leads to some very important problems in the interpretation process.…”
Section: Technical Documents Analysismentioning
confidence: 99%
“…(i) their completeness: given the quantities M/(0,0),M/(0,1) and {Ij(v,q)}, it is possible to return to the whole set of FM coefficients {Mf(v,q)}, and thus to reconstruct f(p, 9), by using the inverse AFMT in the following way:…”
Section: Analytic Prolongation Of the Fourier-mellin (Afmt) And Propementioning
confidence: 99%