52,340 research outputs found

    The fusion of edge detection and mathematical morphology algorithm for shape boundary recognition

    Get PDF
    Edge detection is important in image analysis to form the shape of an object.Edge is the boundary between different textures, which helps with object segmentation and recognition.Currently, several edge detection techniques are able to identify objects but are unable to localize the shape of an object. To address this problem, this paper proposes a fusion of selected edge detection algorithms with mathematical morphology to enhance the ability to detect the object shape boundary. Edge detection algorithm is used to simplify image data by minimizing the amount of pixel to be processed, whereas the mathematical morphology is used for smoothing effects and localizing the object shape using mathematical theory sets.The discussion section focuses on the improved edge map and boundary morphology (EmaBm) algorithm as a new technique for shape boundary recognition.A comparative analysis of various edge detection algorithms is presented.It reveals that the LoG’s edge detection embedded in EmaBM algorithm performs better than the other edge detection algorithms for fruit shape boundary recognition. Implementation of the proposed method shows that it is robust and applicable for various kind of fruit images and is more accurate than the existing edge detection algorithms

    Cardiac Cavity Segmentation in Echocardiography Using Triangle Equation

    Get PDF
    In this paper, cardiac cavity segmentation in echocardiography is proposed. The method uses triangle equation algorithms to detect and reconstruct the border. Prior to the application of both algorithms, some preprocessings have to be carried out. The first step is high boost filter to enhance high frequency component while still keeping the low frequency component. The second step is applying morphological and thresholding operations to eliminate noise and convert the image into binary image. The third step is negative laplacian filter to apply edge detector. The fourth step is region filter to eliminate small region. The last step is using triangle equation to detect and reconstruct the imprecise border. This technique is able to perform segmentation and detect border of cardiac cavity from echocardiographics sequences. Keywords: cardiac cavity, high boost filter, morphology, negative laplacian, region filter, and triangle equation

    A reconfigurable real-time morphological system for augmented vision

    Get PDF
    There is a significant number of visually impaired individuals who suffer sensitivity loss to high spatial frequencies, for whom current optical devices are limited in degree of visual aid and practical application. Digital image and video processing offers a variety of effective visual enhancement methods that can be utilised to obtain a practical augmented vision head-mounted display device. The high spatial frequencies of an image can be extracted by edge detection techniques and overlaid on top of the original image to improve visual perception among the visually impaired. Augmented visual aid devices require highly user-customisable algorithm designs for subjective configuration per task, where current digital image processing visual aids offer very little user-configurable options. This paper presents a highly user-reconfigurable morphological edge enhancement system on field-programmable gate array, where the morphological, internal and external edge gradients can be selected from the presented architecture with specified edge thickness and magnitude. In addition, the morphology architecture supports reconfigurable shape structuring elements and configurable morphological operations. The proposed morphology-based visual enhancement system introduces a high degree of user flexibility in addition to meeting real-time constraints capable of obtaining 93 fps for high-definition image resolution

    A Cosmic Watershed: the WVF Void Detection Technique

    Get PDF
    On megaparsec scales the Universe is permeated by an intricate filigree of clusters, filaments, sheets and voids, the Cosmic Web. For the understanding of its dynamical and hierarchical history it is crucial to identify objectively its complex morphological components. One of the most characteristic aspects is that of the dominant underdense Voids, the product of a hierarchical process driven by the collapse of minor voids in addition to the merging of large ones. In this study we present an objective void finder technique which involves a minimum of assumptions about the scale, structure and shape of voids. Our void finding method, the Watershed Void Finder (WVF), is based upon the Watershed Transform, a well-known technique for the segmentation of images. Importantly, the technique has the potential to trace the existing manifestations of a void hierarchy. The basic watershed transform is augmented by a variety of correction procedures to remove spurious structure resulting from sampling noise. This study contains a detailed description of the WVF. We demonstrate how it is able to trace and identify, relatively parameter free, voids and their surrounding (filamentary and planar) boundaries. We test the technique on a set of Kinematic Voronoi models, heuristic spatial models for a cellular distribution of matter. Comparison of the WVF segmentations of low noise and high noise Voronoi models with the quantitatively known spatial characteristics of the intrinsic Voronoi tessellation shows that the size and shape of the voids are succesfully retrieved. WVF manages to even reproduce the full void size distribution function.Comment: 24 pages, 15 figures, MNRAS accepted, for full resolution, see http://www.astro.rug.nl/~weygaert/tim1publication/watershed.pd

    Gap Filling of 3-D Microvascular Networks by Tensor Voting

    Get PDF
    We present a new algorithm which merges discontinuities in 3-D images of tubular structures presenting undesirable gaps. The application of the proposed method is mainly associated to large 3-D images of microvascular networks. In order to recover the real network topology, we need to ïŹll the gaps between the closest discontinuous vessels. The algorithm presented in this paper aims at achieving this goal. This algorithm is based on the skeletonization of the segmented network followed by a tensor voting method. It permits to merge the most common kinds of discontinuities found in microvascular networks. It is robust, easy to use, and relatively fast. The microvascular network images were obtained using synchrotron tomography imaging at the European Synchrotron Radiation Facility. These images exhibit samples of intracortical networks. Representative results are illustrated
    • 

    corecore