scispace - formally typeset
Search or ask a question
Topic

Structuring element

About: Structuring element is a research topic. Over the lifetime, 997 publications have been published within this topic receiving 26839 citations.


Papers
More filters
Proceedings ArticleDOI
07 Jan 2002
TL;DR: A new method to extract both superimposed and embedded graphical texts in a freeze-frame of news video and indicates a good performance on all the various kinds of images by adjusting the size of the structuring element.
Abstract: In this paper we present a new method to extract both superimposed and embedded graphical texts in a freeze-frame of news video. The algorithm is summarized in the following three steps. For the first step, we convert a color image into a gray-level image and apply contrast stretching to enhance the contrast of the input image. Then, a modified local adaptive thresholding is applied to the contrast-stretched image. The second step is divided into three processes: eliminating text-like components by applying erosion, dilation, and (OpenClose + CloseOpen)/2 morphological operations, maintaining text components using (OpenClose + CloseOpen)/2 operation with a new Geo-correction method, and subtracting two result images for eliminating false-positive components further. In the third filtering step, the characteristics of each component such as the ratio of the number of pixels in each candidate component to the number of its boundary pixels and the ratio of the minor to the major axis of each bounding box are used. Acceptable results have been obtained using the proposed method on 300 news images with a recognition rate of 93.6%. Also, our method indicates a good performance on all the various kinds of images by adjusting the size of the structuring element.

3 citations

01 Jan 2012
TL;DR: In order to define the basic morphological operations such as fuzzy erosion, dilation, opening and closing, a general method based upon fuzzy implication and inclusion grade operators is introduced.
Abstract: Morphological operators transform the original image into another image through the interaction with the other image of certain shape and size which is known as the structure element. Morphology provides a systematic approach to analyze the geometric characteristics of signals or images, and has been applied widely too many applications such as edge detection, objection segmentation, noise suppression and so on. Morphology aims to extend the binary morphological operators to grey-level images. In order to define the basic morphological operations such as fuzzy erosion, dilation, opening and closing, a general method based upon fuzzy implication and inclusion grade operators is introduced. The fuzzy morphological operations extend the ordinary morphological operations by using fuzzy sets where for fuzzy sets, the union operation is replaced by a maximum operation, and the intersection operation is replaced by a minimum operation.

3 citations

Proceedings ArticleDOI
03 Nov 2011
TL;DR: For the removal of the noise from the binary fabric image the morphological opening operation with the suitable structuring element is performed and 94.08% success rate of detection of defects is achieved.
Abstract: In this paper a new approach for the detection of defects in woven fabric is presented where the singular value decomposition (SVD) method is used. SVD basically removes the interlaced grating structure of the waft and warp of the fabric leaving aside the defective part of the fabric. An intensity threshold value along with the module of definite size is considered for the binarization of the background free fabric image. Finally, for the removal of the noise from the binary fabric image the morphological opening operation with the suitable structuring element is performed. The technique is tested on 287 fabric samples consisting of five different types of defects in three types of woven fabrics from TILDA database. 94.08% success rate of detection of defects is achieved.

3 citations

Book ChapterDOI
01 Jan 1996
TL;DR: One-pass constant time recursive algorithms for performing dilation and erosion of a binary image of a given size, with a line structuring element oriented in a given direction regardless of its length are discussed.
Abstract: Binary morphological dilation and erosion with long line structuring elements is computationally expensive when performed by the conventional methods of taking the unions and intersections of all translates of the input binary image with the structuring element. Thus, the overall computational complexity is a function of the product of the image size and that of the structuring element. This paper discusses one-pass constant time recursive algorithms for performing dilation and erosion of a binary image of a given size, with a line structuring element oriented in a given direction regardless of its length. The input binary image is scanned along a digital line generated in the specified orientation. Starting from every 1-pixel in the image directed distances of pixels are measured along the digital line and the pixel values are replaced with the computed values producing a grey scale image called the transform image. This is then thresholded with the desired length of the structuring element. When the resulting image is appropriately translated to account for the true origin of the structuring element, the result is the desired dilation/erosion. The timing of the recursive algorithm is evaluated with respect to the conventional morphological algorithm. It is shown to achieve a speedup of 5, on an average, over all orientations of the line structuring element of length 150 pixels when using a salt and pepper image of size 240 X 256 with the probability of a pixel being a 1-pixel set to 0.25.

3 citations

Journal Article
TL;DR: A new algorithm for automatic generation of 255 convex polyhedrons from its initial set named A containing all eight corners of the 3x3x3 rectangular grid is proposed and an algorithm for hierarchal path enumeration used in visualizing the relationships between convexpolyhedron sets and their corresponding subsets of other convexPolyhedrons is proposed.
Abstract: Three dimensional (3-D) structuring elements plays a vital role in the processing of three dimensional volumetric images such as 3-D medical images. These structuring elements are used in 3-D mathematical morphological operations such as erosion, dilation etc. There is no algebraic framework as such to systematically generate the 3-D structuring elements. The work discussed in this paper is systematically generating the 3-D structuring elements by using geometric filters (G-Filters). This paper initially gives a novel concept of what we call as geometric filters (G-Filters) defined over a 3-D rectangular grid of pixels. By using these G-Filters, 256 convex Polyhedrons are generated. The 256 different structuring elements could be created by using the 256 convex polyhedrons. These G-Filters have potential applications to processing of volumetric images. In addition, the paper describes in brief the algebra of G-Filters by formulating a lattice of convex polyhedrons constructed in a 3X3X3 grid of pixels. This paper proposes a new algorithm for automatic generation of 255 convex polyhedrons from its initial set named A containing all eight corners of the 3x3x3 rectangular grid. This paper also proposes an algorithm for hierarchal path enumeration used in visualizing the relationships between convex polyhedron sets and their corresponding subsets of other convex polyhedrons. Finally, an algorithm is proposed to generate 3D structuring element from a selected convex polyhedron.

3 citations


Network Information
Related Topics (5)
Image segmentation
79.6K papers, 1.8M citations
89% related
Feature extraction
111.8K papers, 2.1M citations
88% related
Image processing
229.9K papers, 3.5M citations
87% related
Feature (computer vision)
128.2K papers, 1.7M citations
85% related
Convolutional neural network
74.7K papers, 2M citations
84% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20236
202214
202112
202019
201929
201824