2011 IEEE GCC Conference and Exhibition (GCC) 2011
DOI: 10.1109/ieeegcc.2011.5752479
|View full text |Cite
|
Sign up to set email alerts
|

Peak position recognizing characters in Saudi license plates

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2012
2012
2015
2015

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 1 publication
0
8
0
Order By: Relevance
“…Results of the segmentation and recognition method are shown in figures (7)(8)(9)(10) Plate after rotation BW Plate after rotation The proposed system locates and recognizes license plates under complex scenarios like variation of illumination, angle, and scale. Good results have been obtained.…”
Section: Resultsmentioning
confidence: 99%
“…Results of the segmentation and recognition method are shown in figures (7)(8)(9)(10) Plate after rotation BW Plate after rotation The proposed system locates and recognizes license plates under complex scenarios like variation of illumination, angle, and scale. Good results have been obtained.…”
Section: Resultsmentioning
confidence: 99%
“…Similarly, lines R, V and L are three vertical lines drawn across the image at distances f of the total width from the image right boundary, at the middle and f of the total width from the image left boundary respectively. A Peak is defined as a crossing from a black pixel to a white pixel [21] as the image is scanned from right to left (for lines T, H and B) or top to bottom (for lines R, V and L). A line starting with white pixels is considered to have one peak at the beginning.…”
Section: The Number Of Peaks Algorithmmentioning
confidence: 99%
“…We have two types of crossing lines for this algorithm as seen in Figure 17, the solid lines with titles adjacent to them as H, T, B, V, L and R, and are associated with the factor F. The other crossing lines are the dashed lines and are fixed at the 1/3 and 2/3 locations for the horizontal and the vertical lines [21]. The image is divided into nine different locations.…”
Section: Position Of the Peaks Algorithmmentioning
confidence: 99%
“…In this algorithm [21], the positions of the peaks for a given crossing line are considered for a given factor. We have two types of crossing lines for this algorithm as seen in Figure 17, the solid lines with titles adjacent to them as H, T, B, V, L and R, and are associated with the factor F. The other crossing lines are the dashed lines and are fixed at the 1/3 and 2/3 locations for the horizontal and the vertical lines [21].…”
Section: Position Of the Peaks Algorithmmentioning
confidence: 99%