doc merge

2 files changed, 131 insertions, 0 deletions

diff --git a/doc/dui.md b/doc/dui.md
index 3f72e1c..b8354c0 100644
--- a/doc/dui.md
+++ b/doc/dui.md
@@ -383,10 +383,141 @@ combination with the standard Pololu boards and Libraries.
 }
 \buildSystemConclusion
 
+## Traffic Sign Detection (TSD)
+
+The following chapters will look at the different methods used to detect signs in order to find a suitable solution for this project.
+
+### Color based
+
+The distinct color characteristics of traffic signs can attract drivers’ attention and can also provide important cues to design color based detection methods. In the past decades, a large amount of detection methods are designed to detect distinct traffic sign colors such as blue, red and yellow. These methods can be directly used for traffic sign detection, and can also be used for preliminary reduction of the search space,  followed by other detection methods
+
+#### RGB
+
+One can easily look at the RGB values to detect a certain color. Although the r,g and b values are heavily effected by different illuminations, therefore this isn't a reliable solution in variating lighting conditions.
+
+An example implementation: 
+
+```py
+#Red
+if(R >= ThR and G <= thG)
+
+#Blue
+if(B >= thB)
+
+#Yellow
+if((R + G) >= ThY)
+```
+
+It is possible to enhance the colors with maximum and minimum operations:
+
+```py
+fR(i) = max(0, min(iR − iG, iR − iB)/s),
+fB(i) = max(0, min(iB − iR, iB − iG)/s),
+fY(i) = max(0, min(iR − iB, iG − iB)/s).
+```
+
+This method can result in some issues on the blue channel (see source 1 page 86583 for more explanation). As a solution to this issue use the following formula for the blue channel instead:
+```py
+f′B(i) = max((0, iB − iR)/s).
+```
+
+#### HSV
+
+The HSV/HSI color space is more immune to the illumination challenges of RGB. The hue and saturation channels can be calculated using RGB, which increases the processing time.
+The following pseudo code shows how to detect the red, blue and yellow colors in this space.
+
+```python
+#Red
+if (H <= Th1 or 
+    H >= Th2)
+
+#Blue
+if (H >= Th1 and 
+    H <= Th2)
+
+#Yellow
+
+if (H >= Th1 and 
+    H <= Th2 and 
+    H <= Th3)
+```
+
+#### LAB
+
+This color space is used for finding uncorrelated color components, the L\*a\*b\* space was used for detecting blue, red, yellow and green colors. 
+
+#### Pixel classification
+
+This method avoids the use of fixed thresholds that might need adjusting at times. In order to resolve this some authors tried to transfer the problem into pixel classification where a neural network classifies every pixel in the input image, the pixel classification algorithms are often slower than other color extraction methods.
+
+#### results
+
+\def\signDetectionColor{
+The above described methods where also applied to a database in order to compare each method. This resulted in the conclusion that, using a normalized RGB space is giving the a mixture of most detections and least false-positve results. See source 1 page 86584 for the full report.
+}
+\signDetectionColor
+
+### Shape based
+
+Common standard shapes of traffic signs are triangle, circle, rectangle, and octagon. Shape characteristics used for shape detection include standard shapes, boundaries, texture, key points, etc.
+
+#### Hough
+
+See line detection hough.
+<!-- TODO: not enough info found -->
+
+#### Barnes *Fang et al* (fast radial symmetry)
+
+Seemingly a 'simpler' method 
+<!-- TODO: (currently no great references found) -->
+
+#### Fourier
+This method also deals with occlusion and morphing/rotating the shape flat again (when looking at it at an angle).
+
+#### Key points detection
+This, simply put, looks at the edges/corners in order to find an ROI.
+
+### Color & Shape based
+In some methods, the shape detection methods can be combined with color based methods to fulfill the traffic sign detection work.
+For example, using a color based detection to find a ROI and using shape detection in that ROI to determine if it is a sign.
+
+### Neural networks
+<!-- TODO: -->
+
+### results
+
+\def\signDetectionShape{
+Most shape based recognition methods are more complex than using a color based detection. But the method 'Fourier' seems the most useful as it can also deal with rotated and occluded objects. 
+}
+\signDetectionShape
+
+## Traffic Sign Recognition (TSR)
+After traffic sign detection or tracking, traffic sign recognition is performed to classify the detected traffic signs into correct classes.
+
+![signs example](img/signs.png)
+
+### Binary tree
+The binary-tree-based classification method usually classify traffic signs according to the shapes and colors in a coarse-to-fine tree process.
+
+### Support Vector Machine (SVM)
+As a binary-classification method, SVM classifies traffic signs using one-vs-one or one-vs-others classification process.
+
+## results
+
+\def\signRecognition{
+While making a binary tree is seemingly the most simple, yet effective solution. Using the 'Fourier' method is a bit more complex, it may be a better solution (this requires testing).
+}
+\signRecognition
+
 # Conclusion
 
 \communicationConclusion
 \buildSystemConclusion
+\signDetectionColor
+\signDetectionShape
+\signRecognition
 
+## Sources:
 
+1. [IEEE, Digital Object Identifier June 26, 2019 (pages 86578 - 86596)](https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8746141)
 
diff --git a/docs/imgs/signs.png b/doc/img/signs.png
index 8102ac4..8102ac4 100644
--- a/docs/imgs/signs.png
+++ b/doc/img/signs.png