85 

 

[37] 

M. Daily, S. Medasani, R. Behringer, and M. Trivedi, “Self-driving cars,” Computer (Long 
Beach Calif), vol. 50, no. 12, pp. 18–23, 2017. 

[38] 

R. C. Gonzalez, Digital image processing. Pearson education india, 2009. 

[39] 

T. Kumar and K. Verma, “A Theory Based on Conversion of RGB image to Gray image,” 
International Journal of Computer Applications, vol. 7, no. 2, pp. 7–10, 2010. 

[40] 

E. S. Gedraite and M. Hadad, “Investigation on the effect of a Gaussian Blur in image filtering 
and segmentation,” in Proceedings ELMAR-2011, 2011, pp. 393–396. 

[41] 

J. Canny, “A computational approach to edge detection,” IEEE Transactions on pattern 
analysis and machine intelligence, no. 6, pp. 679–698, 1986. 

[42] 

Z. Xu, X. Baojie, and W. Guoxin, “Canny edge detection based on Open CV,” in 2017 13th 
IEEE international conference on electronic measurement & instruments (ICEMI), 2017, pp. 
53–56. 

[43] 

E. R. Davies, Computer and machine vision: theory, algorithms, practicalities. Academic 
Press, 2012. 

[44] 

D. Forsyth and J. Ponce, Computer vision: A modern approach. Prentice hall, 2011. 

[45] 

Y. Zhu, R. Urtasun, R. Salakhutdinov, and S. Fidler, “segdeepm: Exploiting segmentation and 
context in deep neural networks for object detection,” in Proceedings of the IEEE Conference 
on Computer Vision and Pattern Recognition, 2015, pp. 4703–4711. 

[46] 

R. O. Duda and P. E. Hart, “Use of the Hough transformation to detect lines and curves in 
pictures,” Commun ACM, vol. 15, no. 1, pp. 11–15, 1972. 

[47] 

P. Arbelaez, M. Maire, C. Fowlkes, J. Malik, and P. Arbeí Aez, “Contour Detection and 
Hierarchical Image Segmentation,” 2010. [Online]. Available: 
http://www.eecs.berkeley.edu/Pubs/TechRpts/2010/EECS-2010-17.html 

[48] 

R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of computer 
computations, Springer, 1972, pp. 85–103. 

[49] 

D. S. Johnson, “A catalog of complexity classes,” in Algorithms and complexity, Elsevier, 
1990, pp. 67–161. 

[50] 

J. Hartmanis and R. E. Stearns, “On the computational complexity of algorithms,” 
Transactions of the American Mathematical Society, vol. 117, pp. 285–306, 1965. 

[51] 

T. Baker, J. Gill, and R. Solovay, “Relativizations of the P=?NP question,” SIAM Journal on 
computing, vol. 4, no. 4, pp. 431–442, 1975. 

[52] 

L. Fortnow, “The status of the P versus NP problem,” Commun ACM, vol. 52, no. 9, pp. 78–86, 
2009. 

[53] 

G. Meurant, Algorithms and Complexity. Elsevier Science, 2014. [Online]. Available: 
https://books.google.gr/books?id=6WriBQAAQBAJ