plan.tex 5.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128
  1. \documentclass[a4paper]{article}
  2. \usepackage{hyperref}
  3. \title{Using local binary patterns to read license plates in photographs}
  4. \date{November 17th, 2011}
  5. % Paragraph indentation
  6. \setlength{\parindent}{0pt}
  7. \setlength{\parskip}{1ex plus 0.5ex minus 0.2ex}
  8. \begin{document}
  9. \maketitle
  10. \section*{Project members}
  11. Gijs van der Voort\\
  12. Richard Torenvliet\\
  13. Jayke Meijer\\
  14. Tadde\"us Kroes\\
  15. Fabi\'en Tesselaar
  16. \tableofcontents
  17. \setcounter{secnumdepth}{1}
  18. \section{Problem description}
  19. License plates are used for uniquely identifying motorized vehicles and are
  20. made to be read by humans from great distances and in all kinds of weather
  21. conditions.
  22. Reading license plates with a computer is much more difficult. Our dataset
  23. contains photographs of license plates from various angles and distances. This
  24. means that not only do we have to implement a method to read the actual
  25. characters, but also have to determine the location of the license plate and
  26. its transformation due to different angles.
  27. We will focus our research on reading the transformed characters on the
  28. license plate, of which we know where the letters are located. This is because
  29. Microsoft recently published a new and effective method to find the location of
  30. text in an image.
  31. In short our program must be able to do the following:
  32. \begin{enumerate}
  33. \item Use perspective transformation to obtain an upfront view of license
  34. plate.
  35. \item Reduce noise where possible.
  36. \item Extract each character using the location points in the info file.
  37. \item Transform character to a normal form.
  38. \item Create a local binary pattern histogram vector.
  39. \item Match the found vector with a learning set.
  40. \end{enumerate}
  41. \section{Solution}
  42. Now that the problem is defined, the next step is stating a solution. This will
  43. come in a few steps as well.
  44. \subsection{Transformation}
  45. A simple perspective transformation will be sufficient to transform and resize
  46. the plate to a normalized format. The corner positions of license plates in the
  47. dataset are supplied together with the dataset.
  48. \subsection{Reducing noise}
  49. Small amounts of noise will probably be suppressed by usage of a Gaussian
  50. filter. A real problem occurs in very dirty license plates, where branches and
  51. dirt over a letter could radically change the local binary pattern. A question
  52. we can ask ourselves here, is whether we want to concentrate ourselves on these
  53. exceptional cases. By law, license plates have to be readable. Therefore, we
  54. will first direct our attention at getting a higher score in the 'regular' test
  55. set before addressing these cases. Considered the fact that the LBP algorithm
  56. divides a letter into a lot of cells, there is a good change that a great
  57. number of cells will still match the learning set, and thus still return the
  58. correct character as a best match. Therefore, we expect the algorithm to be
  59. very robust when dealing with noisy images.
  60. \subsection{Extracting a letter}
  61. Because we are already given the locations of the characters, we only need to
  62. transform those locations using the same perspective transformation used to
  63. create a front facing license plate. The next step is to transform the
  64. characters to a normalized manner. The size of the letter W is used as a
  65. standard to normalize the width of all the characters, because W is the widest
  66. character of the alphabet. We plan to also normalize the height of characters,
  67. the best manner for this is still to be determined.
  68. \begin{enumerate}
  69. \item Crop the image in such a way that the character precisely fits the
  70. image.
  71. \item Scale the image to a standard height.
  72. \item Extend the image on either the left or right side to a certain width.
  73. \end{enumerate}
  74. The resulting image will always have the same size, the character contained
  75. will always be of the same height, and the character will alway be positioned
  76. at either the left of right side of the image.
  77. \subsection{Local binary patterns}
  78. Once we have separate digits and characters, we intent to use Local Binary
  79. Patterns to determine what character or digit we are dealing with. Local Binary
  80. Patters are a way to classify a texture based on the distribution of edge
  81. directions in the image. Since letters on a license plate consist mainly of
  82. straight lines and simple curves, LBP should be suited to identify these.
  83. To our knowledge, LBP has yet not been used in this manner before. Therefore,
  84. it will be the first thing to implement, to see if it lives up to the
  85. expectations. When the proof of concept is there, it can be used in the final
  86. program.
  87. Important to note is that due to the normalization of characters before
  88. applying LBP. Therefore, no further normalization is needed on the histograms.
  89. Given the LBP of a character, a Support Vector Machine can be used to classify
  90. the character to a character in a learning set. The SVM uses
  91. \subsection{Matching the database}
  92. Given the LBP of a character, a Support Vector Machine can be used to classify
  93. the character to a character in a learning set. The SVM uses the collection of
  94. histograms of an image as a feature vector. The SVM can be trained with a
  95. subsection of the given dataset called the ''Learning set''. Once trained, the
  96. entire classifier can be saved as a Pickle object\footnote{See
  97. \url{http://docs.python.org/library/pickle.html}} for later usage.
  98. \end{document}