Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

An Analysis of Edge Detection Methodologies in Spatial and Morphological Perspective

View through CrossRef
Now-a-days, edge detection through image processing is become core research due to its wide application in different fields such as medical and industries. In digital image processing, edge detection and feature extraction are considered as an active research area. Different researcher has designed different methods (i.e.- Prewitt, Sobel, and Roberts) for edge detection in images for better visualization result. The basic purpose of edge detection process is to interpret pixels values to find more significant, useful, and meaningful information of image. The most important and strong feature in any image is called its edge, which can be detect by using different image processing algorithm. Therefore, fast, simple, and robust method for edge detection is become a basic need for edge detection and feature extraction. In this paper, we propose a morphological based edge detection algorithm, which based on three basic steps (i) Image Acquisition, (ii) Image enhancement and (iii) Morphological edge detection filter. In the result, we compare proposed algorithm with existing spatial domain algorithm i.e.- Prewitt, Sobel, Laplacian of Gaussian, and kirsch to show the robustness and efficiency of proposed morphological algorithm. Moreover, we did a quality-based comparison of all edge detection algorithm by using different quality matrix. After doing the comparison, it is clear that the performance of proposed algorithm is better than the existing in term of time, efficiency and quality.
Title: An Analysis of Edge Detection Methodologies in Spatial and Morphological Perspective
Description:
Now-a-days, edge detection through image processing is become core research due to its wide application in different fields such as medical and industries.
In digital image processing, edge detection and feature extraction are considered as an active research area.
Different researcher has designed different methods (i.
e.
- Prewitt, Sobel, and Roberts) for edge detection in images for better visualization result.
The basic purpose of edge detection process is to interpret pixels values to find more significant, useful, and meaningful information of image.
The most important and strong feature in any image is called its edge, which can be detect by using different image processing algorithm.
Therefore, fast, simple, and robust method for edge detection is become a basic need for edge detection and feature extraction.
In this paper, we propose a morphological based edge detection algorithm, which based on three basic steps (i) Image Acquisition, (ii) Image enhancement and (iii) Morphological edge detection filter.
In the result, we compare proposed algorithm with existing spatial domain algorithm i.
e.
- Prewitt, Sobel, Laplacian of Gaussian, and kirsch to show the robustness and efficiency of proposed morphological algorithm.
Moreover, we did a quality-based comparison of all edge detection algorithm by using different quality matrix.
After doing the comparison, it is clear that the performance of proposed algorithm is better than the existing in term of time, efficiency and quality.

Related Results

Magic graphs
Magic graphs
DE LA TESIS<br/>Si un graf G admet un etiquetament super edge magic, aleshores G es diu que és un graf super edge màgic. La tesis està principalment enfocada a l'estudi del c...
Optimizing edge cloud deployments for video analytics
Optimizing edge cloud deployments for video analytics
(English) As our digital world and physical realities blend together, we, as users, are growing to expect real-time interaction wherever and whenever we want. Newer internet servic...
AI-driven zero-touch orchestration of edge-cloud services
AI-driven zero-touch orchestration of edge-cloud services
(English) 6G networks demand orchestration systems capable of managing thousands of distributed microservices under sub-millisecond latency constraints. Traditional centralized app...
Geo‐information mapping improves Canny edge detection method
Geo‐information mapping improves Canny edge detection method
Abstract Aiming at the shortcomings of the current Canny edge detection method in terms of noise removal, threshold setting, and edge recognition, this paper prop...
Product of digraphs, (super) edge-magic valences and related problems
Product of digraphs, (super) edge-magic valences and related problems
Discrete Mathematics, and in particular Graph Theory, has gained a lot of popularity during the last 7 decades. Among the many branches in Graph Theory, graph labelings has experim...
Territories -in- between
Territories -in- between
There is an increasing body of literature suggesting that the conventional idea of a gradual transition in spatial structure from urban to rural does not properly reflect contempor...
THE FORCING EDGE FIXING EDGE-TO-VERTEX MONOPHONIC NUMBER OF A GRAPH
THE FORCING EDGE FIXING EDGE-TO-VERTEX MONOPHONIC NUMBER OF A GRAPH
For a connected graph G = (V, E), a set Se ⊆ E(G)–{e} is called an edge fixing edge-to-vertex monophonic set of an edge e of a connected graph G if every vertex of G lies on an e –...
The upper connected edge geodetic number of a graph
The upper connected edge geodetic number of a graph
For a non-trivial connected graph G, a set S ? V (G) is called an edge geodetic set of G if every edge of G is contained in a geodesic joining some pair of vertices in S. The...

Back to Top