A Distributed Canny Edge Detector: Algorithm & FPGA Implementation
Journal Title: International Journal for Research in Applied Science and Engineering Technology (IJRASET) - Year 2015, Vol 3, Issue 5
Abstract
The Canny edge detector is one of the most widely used edge detection algorithms due to its superior performance. Unfortunately, not only is it computationally more intensive as compared with other edge detection algorithms, but it also has a higher latency because it is based on frame-level statistics. In this paper, we propose a mechanism to implement the canny algorithm at the block level without any loss in edge detection performance compared with the original frame-level Canny algorithm. Directly applying the original Canny algorithm at the block-level leads to excessive edges in smooth regions and to loss of significant edges in high-detailed regions since the original Canny computes the high and low thresholds based on the frame-level statistics. To solve this problem, we present a distributed Canny edge detection algorithm that adaptively computes the edge detection thresholds based on the block type and the local distribution of the gradients in the image block. In addition, the new algorithm uses a non-uniform gradient magnitude histogram to compute block-based hysteresis thresholds. The resulting block-based algorithm has significantly reduced latency and can be easily integrated with other block-based image codecs. It is capable of supporting fast edge detection of images and videos with high resolutions; including full-HD since the latency is now a function of the block size instead of the frame size. In addition, quantitative conformance evaluations and subjective tests show that the edge detection performance of the proposed algorithm is better than the original frame-based algorithm, especially when noise is present in the images. Finally, this algorithm is implemented using a 32 computing engine architecture and is synthesized on the Xilinx Virtex-5 FPGA. The synthesized architecture takes only 0.721 ms (including the SRAMREAD/WRITE time and the computation time) to detect edges of 512 × 512 images in the USC SIPI database when clocked at 100 MHz and is faster than existing FPGA and GPU implementations.
Authors and Affiliations
Veeranagouda Patil, Mrs. Chitra Prabhu
Keywords
Related Articles
- EP ID EP20469
- DOI -
- Views 217
- Downloads 5
A survey of cooperative blackhole attack in mobile ad hoc networks
A MANET is an infrastructure less network that consists of mobile nodes that communicate with each other over wireless links. In the absence of a fixed infrastructure, nodes have to cooperate with each other in order to...
Distribution Line Fault Detection & GSM Module Based Fault Signaling System
Any distribution network is prone to faults, and intermittency in power availability creates loss for the supplier as well as user. Majorly, a supply line can be effected by conditions of overvoltage and overcurrent, al...
Building an Aspect That Is Diagram - Built Taxonomy Prototypes in Data Repossession
We focus on a renowned graph-based model known Manifold Ranking which is a well-known graph-based ranking representation that ranks data samples relating to intrinsic geometrical structure exposed by a huge data. The pr...
Relaiblity and Fault Analysis in On-Chip Network
System on chips towards multicore design for taking advantage of technology scaling and also for speeding up system performance through increased parallelism in the fact that power wall limits the increase of the clock...
Survey of Data Mining Tools and Techniques for Customer Relationship Management (CRM)
The domain of Customer Relationship Management (CRM) has been gaining significance in various business management processes. CRM includes all the series of action that an organization uses to create and establish good...