Estimation analysis of Edge and Line Detection Methods in Digital Image Processing

Abstract

This paper provides an estimation evaluation of the edge and line detection methods in virtual photo processing. This analysis evaluates the performance of numerous facet and line detection algorithms in phrases of facet/line first-rate, accuracy, computational complexity, and robustness to noise in the context of artificial and actual-international snapshots. Mainly, it discusses the overall performance of 4 edge detection methods: Roberts, Prewitt, Sobel, and Canny; and 3 line detection techniques: Hough remodel, Linear Estimation, and Probabilistic Hough remodel. as compared to the classical algorithms, the Probabilistic Hough rework algorithm is determined to have the excellent accuracy and robustness to noise. Furthermore, a contrast of computational complexities shows that the Hough transform has the bottom complexity and computational time, even as the Linear Estimation algorithm has the best complexity and computational time. The primary outcome of this study is that the brink/line first-rate, accuracy, computational complexity, and robustness are very dependent on the sort of entered snapshots and the respective selected parameters.