Basin, lakes, and pore-grain space are important geophysical shapes, which can fit with the several
classical and fractal binary shapes, are processed by employing morphological transformations, and
methods. The decomposition of skeleton network (minimum morphological information) using various
classical structures like square, octagon and rhombus. Then derive the dilated subsets respective degree by
the structures for reconstruct the original image. Through shapiness index of pattern spectrum procedure,
we try test the reconstruction accuracy in a quantitative manner. It gives some general procedure to
characterise the shape-size complexity of surface water body. The reconstruction accuracy is against the
size of water bodies with which we produce the some example of different shapiness index for different
structuring element of shapes. In which quantitative manner approach yields better reconstruction level.
The complexity of water bodies are compared with the surfaces.
Performance analysis of contourlet based hyperspectral image fusion methodijitjournal
Recently, contourlet transform has been widely used in hyperspectral image fusion due to its advantages,
such as high directionality and anisotropy; and studies show that the contourlet-based fusion methods
perform better than the existing conventional methods including wavelet-based fusion methods. Few studies
have been done to comparatively analyze the performance of contourlet-based fusion methods;
furthermore, no research has been done to analyze the contourlet-based fusion methods by focusing on
their unique transform mechanisms. In addition, no research has focused on the original contourlet
transform and its upgraded versions. In this paper, we investigate three different kinds of contourlet
transform: i) original contourlet transform, ii) nonsubsampled contourlet transform, iii) contourlet
transform with sharp frequency localization. The latter two transforms were developed to overcome the
major drawbacks of the original contourlet transform; so it is necessary and beneficial to see how they
perform in the context of hyperspectral image fusion. The results of our comparative analysis show that the
latter two transforms perform better than the original contourlet transform in terms of increasing spatial
resolution and preserving spectral information.
2D Shape Reconstruction Based on Combined Skeleton-Boundary FeaturesCSCJournals
This paper proposes a new method for 2D shape reconstruction based on combining skeleton and boundary features. The method aims to mimic human perceptual processes by using both curvature properties of the shape boundary and structural properties of the shape skeleton. Junction points on the skeleton are used to identify likely protrusions, while boundary features like curvature, length and width are used to determine the strength of protrusions. Experiments show the reconstructed shapes match human perceptual judgments better than existing methods. The approach gives a stable reconstruction and is robust to noise.
A MORPHOLOGICAL MULTIPHASE ACTIVE CONTOUR FOR VASCULAR SEGMENTATIONijbbjournal
This paper presents a morphological active contour ideal for vascular segmentation in biomedical images.
The unenhanced images of vessels and background are successfully segmented using a two-step
morphological active contour based upon Chan and Vese’s Active Contour without Edges. Using dilation
and erosion as an approximation of curve evolution, the contour provides an efficient, simple, and robust
alternative to solving partial differential equations used by traditional level-set Active Contour models. The
proposed method is demonstrated with segmented data set images and compared to results garnered from
multiphase Active Contour without Edges, morphological watershed, and Fuzzy C-means segmentations.
Regression model for analyzing the dgs structures propagation characterisitcseSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Automated Medical image segmentation for detection of abnormal masses using W...IDES Editor
Research in the segmentation of medical images
will strive towards improving the accuracy, precision, and
computational speed of segmentation methods, as well as
reducing the amount of manual interaction. Accuracy and
precision can be improved by incorporating prior information
from atlases and by combining discrete and continuous-based
segmentation methods. The medical images consists a general
framework to segment curvilinear 2D objects The proposed
method based on Watershed algorithm is traditionally applied
on image domain. Then model uses a Markov chain in scale
to model the class labels that form the segmentation, but
augments this Markov chain structure by incorporating tree
based classifiers to model the transition probabilities between
adjacent scales. Experiments with real medical images show
that the proposed segmentation framework is efficient.
Hex-Cell is an interconnection network that has attractive features like the embedding capability of topological structures; such as; bus, ring, tree and mesh topologies. In this paper, we present two algorithms for embedding bus and ring topologies onto Hex-Cell interconnection network. We use three metrics to evaluate our proposed algorithms: dilation, congestion, and expansion. Our evaluation results
show that the congestion of our two proposed algorithms is equal to one; and the dilation is equal to 2d-1 for the first algorithm and 1 for the second.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Image Registration using NSCT and Invariant MomentCSCJournals
Image registration is a process of matching images, which are taken at different times, from different sensors or from different view points. It is an important step for a great variety of applications such as computer vision, stereo navigation, medical image analysis, pattern recognition and watermarking applications. In this paper an improved feature point selection and matching technique for image registration is proposed. This technique is based on the ability of nonsubsampled contourlet transform (NSCT) to extract significant features irrespective of feature orientation. Then the correspondence between the extracted feature points of reference image and sensed image is achieved using Zernike moments. Feature point pairs are used for estimating the transformation parameters mapping the sensed image to the reference image. Experimental results illustrate the registration accuracy over a wide range for panning and zooming movement and also the robustness of the proposed algorithm to noise. Apart from image registration proposed method can be used for shape matching and object classification. Keywords: Image Registration, NSCT, Contourlet Transform, Zernike Moment.
Performance analysis of contourlet based hyperspectral image fusion methodijitjournal
Recently, contourlet transform has been widely used in hyperspectral image fusion due to its advantages,
such as high directionality and anisotropy; and studies show that the contourlet-based fusion methods
perform better than the existing conventional methods including wavelet-based fusion methods. Few studies
have been done to comparatively analyze the performance of contourlet-based fusion methods;
furthermore, no research has been done to analyze the contourlet-based fusion methods by focusing on
their unique transform mechanisms. In addition, no research has focused on the original contourlet
transform and its upgraded versions. In this paper, we investigate three different kinds of contourlet
transform: i) original contourlet transform, ii) nonsubsampled contourlet transform, iii) contourlet
transform with sharp frequency localization. The latter two transforms were developed to overcome the
major drawbacks of the original contourlet transform; so it is necessary and beneficial to see how they
perform in the context of hyperspectral image fusion. The results of our comparative analysis show that the
latter two transforms perform better than the original contourlet transform in terms of increasing spatial
resolution and preserving spectral information.
2D Shape Reconstruction Based on Combined Skeleton-Boundary FeaturesCSCJournals
This paper proposes a new method for 2D shape reconstruction based on combining skeleton and boundary features. The method aims to mimic human perceptual processes by using both curvature properties of the shape boundary and structural properties of the shape skeleton. Junction points on the skeleton are used to identify likely protrusions, while boundary features like curvature, length and width are used to determine the strength of protrusions. Experiments show the reconstructed shapes match human perceptual judgments better than existing methods. The approach gives a stable reconstruction and is robust to noise.
A MORPHOLOGICAL MULTIPHASE ACTIVE CONTOUR FOR VASCULAR SEGMENTATIONijbbjournal
This paper presents a morphological active contour ideal for vascular segmentation in biomedical images.
The unenhanced images of vessels and background are successfully segmented using a two-step
morphological active contour based upon Chan and Vese’s Active Contour without Edges. Using dilation
and erosion as an approximation of curve evolution, the contour provides an efficient, simple, and robust
alternative to solving partial differential equations used by traditional level-set Active Contour models. The
proposed method is demonstrated with segmented data set images and compared to results garnered from
multiphase Active Contour without Edges, morphological watershed, and Fuzzy C-means segmentations.
Regression model for analyzing the dgs structures propagation characterisitcseSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Automated Medical image segmentation for detection of abnormal masses using W...IDES Editor
Research in the segmentation of medical images
will strive towards improving the accuracy, precision, and
computational speed of segmentation methods, as well as
reducing the amount of manual interaction. Accuracy and
precision can be improved by incorporating prior information
from atlases and by combining discrete and continuous-based
segmentation methods. The medical images consists a general
framework to segment curvilinear 2D objects The proposed
method based on Watershed algorithm is traditionally applied
on image domain. Then model uses a Markov chain in scale
to model the class labels that form the segmentation, but
augments this Markov chain structure by incorporating tree
based classifiers to model the transition probabilities between
adjacent scales. Experiments with real medical images show
that the proposed segmentation framework is efficient.
Hex-Cell is an interconnection network that has attractive features like the embedding capability of topological structures; such as; bus, ring, tree and mesh topologies. In this paper, we present two algorithms for embedding bus and ring topologies onto Hex-Cell interconnection network. We use three metrics to evaluate our proposed algorithms: dilation, congestion, and expansion. Our evaluation results
show that the congestion of our two proposed algorithms is equal to one; and the dilation is equal to 2d-1 for the first algorithm and 1 for the second.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Image Registration using NSCT and Invariant MomentCSCJournals
Image registration is a process of matching images, which are taken at different times, from different sensors or from different view points. It is an important step for a great variety of applications such as computer vision, stereo navigation, medical image analysis, pattern recognition and watermarking applications. In this paper an improved feature point selection and matching technique for image registration is proposed. This technique is based on the ability of nonsubsampled contourlet transform (NSCT) to extract significant features irrespective of feature orientation. Then the correspondence between the extracted feature points of reference image and sensed image is achieved using Zernike moments. Feature point pairs are used for estimating the transformation parameters mapping the sensed image to the reference image. Experimental results illustrate the registration accuracy over a wide range for panning and zooming movement and also the robustness of the proposed algorithm to noise. Apart from image registration proposed method can be used for shape matching and object classification. Keywords: Image Registration, NSCT, Contourlet Transform, Zernike Moment.
Medial Axis Transformation based Skeletonzation of Image Patterns using Image...IOSR Journals
1) The document discusses extracting the medial axis transform (MAT) of an image pattern using the Euclidean distance transform. The image is first converted to binary, then the Euclidean distance transform is used to compute the distance of each non-zero pixel to the closest zero pixel.
2) The medial axis transform represents the core or skeleton of an image pattern. There are different algorithms for extracting the skeleton or medial axis, including sequential and parallel algorithms. The skeleton provides a simple representation that preserves topological and size characteristics of the original shape.
3) The document provides background on medial axis transforms and different skeletonization algorithms. It then describes preparing the binary image and applying the Euclidean distance transform to extract the MAT and skeleton
Crdom cell re ordering based domino on-the-fly mappingVLSICS Design
This Domino logic is often the choice for designing high speed CMOS circuits. Often VLSI designers
choose library based approaches to perform technology mapping of large scale circuits involving static
CMOS logic style. Cells designed using Domino logic style have the flexibility to accommodate wide range
of functions in them. Hence, there is a scope to adopt a library free synthesis approach for circuits
designed using Domino logic. In this work, we present an approach for mapping a domino logic circuit
using an On-the-fly technique. First, we present a node mapping algorithm which maps a given Domino
logic netlist using On-the-fly technique. Next, using an Equivalence Table, we re-order the cells along the
critical path for delay, area benefit. Finally, we find an optimum re-ordering set which can obtain
maximum delay savings for a minimum area penalty. We have tested the efficacy of our approach with a
set of standard benchmark circuits. Our proposed mapping approach (CRDOM) obtained 21%
improvement in area and 17% improvement in delay compared to existing work.
A HYBRID MORPHOLOGICAL ACTIVE CONTOUR FOR NATURAL IMAGESIJCSEA Journal
Morphological active contours for image segmentation have become popular due to their low computational complexity coupled with their accurate approximation of the partial differential equations
involved in the energy minimization of the segmentation process. In this paper, a morphological active contour which mimics the energy minimization of the popular Chan-Vese Active Contour without Edges is coupled with a morphological edge-driven segmentation term to accurately segment natural images. By using morphological approximations of the energy minimization steps, the algorithm has a low computational complexity. Additionally, the coupling of the edge-based and region-based segmentation techniques allows the proposed method to be robust and accurate. We will demonstrate the accuracy and robustness of the algorithm using images from the Weizmann Segmentation Evaluation Database and report on the segmentation results using the Sorensen-Dice similarity coefficient.
A HYBRID MORPHOLOGICAL ACTIVE CONTOUR FOR NATURAL IMAGESIJCSEA Journal
Morphological active contours for image segmentation have become popular due to their low computational complexity coupled with their accurate approximation of the partial differential equations involved in the energy minimization of the segmentation process. In this paper, a morphological active contour which mimics the energy minimization of the popular Chan-Vese Active Contour without Edges is coupled with a morphological edge-driven segmentation term to accurately segment natural images. By using morphological approximations of the energy minimization steps, the algorithm has a low computational complexity. Additionally, the coupling of the edge-based and region-based segmentation techniques allows the proposed method to be robust and accurate. We will demonstrate the accuracy and robustness of the algorithm using images from the Weizmann Segmentation Evaluation Database and report on the segmentation results using the Sorensen-Dice similarity coefficient.
Adaptive Multiscale Stereo Images Matching Based on Wavelet Transform Modulus...CSCJournals
In this paper we propose a multiscale stereo correspondence matching method based on wavelets transform modulus maxima. Exploitation of maxima modulus chains has given us the opportunity to refine the search for corresponding. Based on the wavelet transform we construct maps of modules and phases for different scales, then extracted the maxima and then we build chains of maxima. Points constituents maxima modulus chains will be considered as points of interest in matching processes. The availability of all its multiscale information, allows searching under geometric constraints, for each point of interest in the left image corresponding one of the best points of constituent chains of the right image. The experiment results demonstrate that the number of corresponding has a very clear decrease when the scale increases. In several tests we obtained the uniqueness of the corresponding by browsing through the fine to coarse scales and calculations remain very reasonable. Abdelhak EZZINE aezzine@uae.ac.ma 39 imm serghiniya Rue liban ENSAT/ SIC/LABTIC Abdelmalek ESSAADI University Tangier, 99000, Morocco
Image registration using a weighted region adjacency graph. The document presents an image registration technique that uses weighted region adjacency graphs (RAGs). RAGs are constructed from medical images segmented using watershed transformation. Graph matching is performed using a multi-spectral technique based on singular value decomposition to find correspondences between weighted RAG vertices. The method is shown to successfully co-register 2D MRI brain images with errors between corresponding region centroids typically less than 7.5%.
This document summarizes a research paper that proposes a novel approach for enhancing digital images using morphological operators. The approach aims to improve contrast in images with poor lighting conditions. It uses two morphological operators based on Weber's law - the first employs blocked analysis while the second uses opening by reconstruction to define a multi-background. The performance of the proposed operators is evaluated on images with various backgrounds and lighting conditions. Key steps include dividing images into blocks, estimating minimum/maximum intensities in each block to determine background criteria, and applying contrast enhancement transformations based on the criteria. Opening by reconstruction is also used to approximate image background without modifying structures. Experimental results demonstrate the approach enhances images with poor lighting.
This document proposes using a novel dynamic fuzzy c-means (dFCM) clustering technique combined with an artificial neural network (ANN) approach to reconfigure power distribution networks and minimize active power loss. The dFCM clustering is used to preprocess the input data for the ANN by transforming the input space into kernels, reducing the size of the ANN needed. The proposed framework combines dFCM clustering and ANN and is tested on two power networks, showing benefits like very short processing time, high accuracy, and a simple ANN structure with few neurons compared to other traditional reconfiguration methods.
This document summarizes a research paper that proposes a new method for detecting moving objects in videos using background subtraction and morphological techniques. The method establishes a reliable background updating model and uses dynamic thresholding to obtain a more complete segmentation of moving objects. The algorithm is implemented on a Microblaze soft processor in VHDL and tested on a Spartan-3 FPGA board. Experimental results show the area and speed of the algorithm. In conclusion, the proposed method allows inherently parallel processing of video frames and can improve detection accuracy by operating at the region level using morphological operations.
Towards an adaptable spatial processing architectureArmando Guevara
An Adaptable Spatial Processing Architecture (ASPA) is what is needed to meet the demands of both multidisciplinary and specialized applications. ASPA fundamentals are based on a GFM that has a set of functional (GISP) primitives clearly defined that allows the automatic construction of a SOM. ASPA has to be designed based on the six continuity criterions given above. In this respect, ASPA would be an expert monitor based on a high level language consisting of spatial operators that have definable hierarchical constructs. These spatial operators can be organized following a programmable schema that would allow them to generate the SOM. ASPA would work in conjunction with a data base management system (DBMS). The DBMS would respond to both spatial and non-spatial operators. The heart of ASPA and the DBMS would be a GFM.
COMPOSITE TEXTURE SHAPE CLASSIFICATION BASED ON MORPHOLOGICAL SKELETON AND RE...sipij
After several decades of research, the development of an effective feature extraction method for texture
classification is still an ongoing effort. Therefore , several techniques have been proposed to resolve such
problems. In this paper a novel composite texture classification method based on innovative pre-processing
techniques, skeletonization and Regional moments (RM) is proposed. This proposed texture classification
approach, takes into account the ambiguity brought in by noise and the different caption and digitization
processes. To offer better classification rate, innovative pre-processing methods are applied on various
texture images first. Pre-processing mechanisms describe various methods of converting a grey level image
into binary image with minimal consideration of the noise model. Then shape features are evaluated using
RM on the proposed Morphological Skeleton (MS) method by suitable numerical characterization
measures for a precise classification. This texture classification study using MS and RM has given a good
performance. Good classification result is achieved from a single region moment RM10 while others failed
in classification.
In this paper, we analyze and compare the performance of fusion methods based on four different
transforms: i) wavelet transform, ii) curvelet transform, iii) contourlet transform and iv) nonsubsampled
contourlet transform. Fusion framework and scheme are explained in detail, and two different sets of
images are used in our experiments. Furthermore, eight different performancemetrics are adopted to
comparatively analyze the fusion results. The comparison results show that the nonsubsampled contourlet
transform method performs better than the other three methods, both spatially and spectrally. We also
observed from additional experiments that the decomposition level of 3 offered the best fusion performance,
anddecomposition levels beyond level-3 did not significantly improve the fusion results.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
The document presents a study on using the NURBS-based isogeometric finite element method for free vibration and buckling analysis of laminated composite plates. Key points:
- An isogeometric finite element method is developed using NURBS basis functions for the approximation of deflection fields and geometry parameterization.
- The Lagrange multiplier method is used to enforce essential boundary conditions and an orthogonal transformation technique is applied to the discrete eigenvalue equation.
- Numerical examples are presented to demonstrate the accuracy of the proposed method for laminated composite plates with different boundary conditions, fiber orientations, and modes of vibration/buckling. Results are verified against analytical and other numerical solutions.
Image processing techniques applied for pitting corrosion analysiseSAT Journals
Abstract
In order to study the behavior of the early stage of pitting corrosion, an image analysis based on discrete wavelet packet transform
and fractals was used. Image feature parameters were extracted and analyzed to characterize the pitting corrosion development with
test time. It was found that the feature parameters: Shannon entropy, energy, fractal dimension and intercept increased with the test
time. Therefore the image processing techniques were promising and effective tools to analyze and detect the pitting corrosion.
Keywords: corrosion, pitting corrosion, surface topography, surface analysis, carbon steel, tap water
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
This document contains summaries of several academic papers. The papers discuss topics related to computer vision, image processing, and machine learning including monocular depth estimation, subspace clustering, person re-identification, image set coding, 3D shape matching, single-image super-resolution, video synopsis, frame rate upconversion, in-loop filtering in video coding, microscopy image denoising, visual tracking, stereo matching, and brain image segmentation. Contact information is provided for TSYS Academic Projects in Adyar, India.
A NOVEL GRAPH REPRESENTATION FOR SKELETON-BASED ACTION RECOGNITIONsipij
Graph convolutional networks (GCNs) have been proven to be effective for processing structured data, so
that it can effectively capture the features of related nodes and improve the performance of model. More
attention is paid to employing GCN in Skeleton-Based action recognition. But there are some challenges
with the existing methods based on GCNs. First, the consistency of temporal and spatial features is ignored
due to extracting features node by node and frame by frame. We design a generic representation of
skeleton sequences for action recognition and propose a novel model called Temporal Graph Networks
(TGN), which can obtain spatiotemporal features simultaneously. Secondly, the adjacency matrix of graph
describing the relation of joints are mostly depended on the physical connection between joints. We
propose a multi-scale graph strategy to appropriately describe the relations between joints in skeleton
graph, which adopts a full-scale graph, part-scale graph and core-scale graph to capture the local features
of each joint and the contour features of important joints. Extensive experiments are conducted on two
large datasets including NTU RGB+D and Kinetics Skeleton. And the experiments results show that TGN
with our graph strategy outperforms other state-of-the-art methods.
Effect of sub classes on the accuracy of the classified imageiaemedu
This document discusses image classification techniques in remote sensing. It begins with an overview of the need for geometric corrections and rectification of satellite images to account for distortions. It then describes supervised and unsupervised classification methods for extracting land cover information from images. Supervised classification involves using training data to classify pixels, while unsupervised classification groups pixels into spectral classes based on natural clusters. The maximum likelihood algorithm assumes normal distributions and assigns pixels to the most probable class. Classification accuracy is assessed using an error matrix to evaluate omission and commission errors between the classified and reference maps. Increasing the number of classes in a classified image can reduce accuracy by making spectral distinctions between classes less clear.
This document describes a narrow band region approach for 2D and 3D image segmentation using deformable curves and surfaces. Specifically, it develops a region energy term involving a fixed-width band around the evolving curve or surface. This energy achieves a balance between local gradient features and global region statistics. The region energy is formulated to allow efficient computation on explicit parametric models and implicit level set models. Two different region terms are introduced, each suited to different configurations of the target object and its surroundings. The document derives the mathematical framework for computing the region energies and their gradients to allow minimization via gradient descent. It then discusses numerical implementations and provides experiments segmenting medical and natural images.
This document summarizes a theory for analyzing microstrip transmission lines on artificial periodic substrates. It proposes a double vector integral equation method involving two stages: 1) solving for the Green's function of the periodic structure, and 2) using this Green's function in a second integral equation to determine the fields and parameters of the microstrip line. Key aspects of the microstrip that can be determined include the propagation constant, characteristic impedance, and propagation bandgaps due to the periodic elements. The theory is validated through numerical comparisons to effective medium approximations and experimental data on a three-layer periodic substrate structure.
Medial Axis Transformation based Skeletonzation of Image Patterns using Image...IOSR Journals
1) The document discusses extracting the medial axis transform (MAT) of an image pattern using the Euclidean distance transform. The image is first converted to binary, then the Euclidean distance transform is used to compute the distance of each non-zero pixel to the closest zero pixel.
2) The medial axis transform represents the core or skeleton of an image pattern. There are different algorithms for extracting the skeleton or medial axis, including sequential and parallel algorithms. The skeleton provides a simple representation that preserves topological and size characteristics of the original shape.
3) The document provides background on medial axis transforms and different skeletonization algorithms. It then describes preparing the binary image and applying the Euclidean distance transform to extract the MAT and skeleton
Crdom cell re ordering based domino on-the-fly mappingVLSICS Design
This Domino logic is often the choice for designing high speed CMOS circuits. Often VLSI designers
choose library based approaches to perform technology mapping of large scale circuits involving static
CMOS logic style. Cells designed using Domino logic style have the flexibility to accommodate wide range
of functions in them. Hence, there is a scope to adopt a library free synthesis approach for circuits
designed using Domino logic. In this work, we present an approach for mapping a domino logic circuit
using an On-the-fly technique. First, we present a node mapping algorithm which maps a given Domino
logic netlist using On-the-fly technique. Next, using an Equivalence Table, we re-order the cells along the
critical path for delay, area benefit. Finally, we find an optimum re-ordering set which can obtain
maximum delay savings for a minimum area penalty. We have tested the efficacy of our approach with a
set of standard benchmark circuits. Our proposed mapping approach (CRDOM) obtained 21%
improvement in area and 17% improvement in delay compared to existing work.
A HYBRID MORPHOLOGICAL ACTIVE CONTOUR FOR NATURAL IMAGESIJCSEA Journal
Morphological active contours for image segmentation have become popular due to their low computational complexity coupled with their accurate approximation of the partial differential equations
involved in the energy minimization of the segmentation process. In this paper, a morphological active contour which mimics the energy minimization of the popular Chan-Vese Active Contour without Edges is coupled with a morphological edge-driven segmentation term to accurately segment natural images. By using morphological approximations of the energy minimization steps, the algorithm has a low computational complexity. Additionally, the coupling of the edge-based and region-based segmentation techniques allows the proposed method to be robust and accurate. We will demonstrate the accuracy and robustness of the algorithm using images from the Weizmann Segmentation Evaluation Database and report on the segmentation results using the Sorensen-Dice similarity coefficient.
A HYBRID MORPHOLOGICAL ACTIVE CONTOUR FOR NATURAL IMAGESIJCSEA Journal
Morphological active contours for image segmentation have become popular due to their low computational complexity coupled with their accurate approximation of the partial differential equations involved in the energy minimization of the segmentation process. In this paper, a morphological active contour which mimics the energy minimization of the popular Chan-Vese Active Contour without Edges is coupled with a morphological edge-driven segmentation term to accurately segment natural images. By using morphological approximations of the energy minimization steps, the algorithm has a low computational complexity. Additionally, the coupling of the edge-based and region-based segmentation techniques allows the proposed method to be robust and accurate. We will demonstrate the accuracy and robustness of the algorithm using images from the Weizmann Segmentation Evaluation Database and report on the segmentation results using the Sorensen-Dice similarity coefficient.
Adaptive Multiscale Stereo Images Matching Based on Wavelet Transform Modulus...CSCJournals
In this paper we propose a multiscale stereo correspondence matching method based on wavelets transform modulus maxima. Exploitation of maxima modulus chains has given us the opportunity to refine the search for corresponding. Based on the wavelet transform we construct maps of modules and phases for different scales, then extracted the maxima and then we build chains of maxima. Points constituents maxima modulus chains will be considered as points of interest in matching processes. The availability of all its multiscale information, allows searching under geometric constraints, for each point of interest in the left image corresponding one of the best points of constituent chains of the right image. The experiment results demonstrate that the number of corresponding has a very clear decrease when the scale increases. In several tests we obtained the uniqueness of the corresponding by browsing through the fine to coarse scales and calculations remain very reasonable. Abdelhak EZZINE aezzine@uae.ac.ma 39 imm serghiniya Rue liban ENSAT/ SIC/LABTIC Abdelmalek ESSAADI University Tangier, 99000, Morocco
Image registration using a weighted region adjacency graph. The document presents an image registration technique that uses weighted region adjacency graphs (RAGs). RAGs are constructed from medical images segmented using watershed transformation. Graph matching is performed using a multi-spectral technique based on singular value decomposition to find correspondences between weighted RAG vertices. The method is shown to successfully co-register 2D MRI brain images with errors between corresponding region centroids typically less than 7.5%.
This document summarizes a research paper that proposes a novel approach for enhancing digital images using morphological operators. The approach aims to improve contrast in images with poor lighting conditions. It uses two morphological operators based on Weber's law - the first employs blocked analysis while the second uses opening by reconstruction to define a multi-background. The performance of the proposed operators is evaluated on images with various backgrounds and lighting conditions. Key steps include dividing images into blocks, estimating minimum/maximum intensities in each block to determine background criteria, and applying contrast enhancement transformations based on the criteria. Opening by reconstruction is also used to approximate image background without modifying structures. Experimental results demonstrate the approach enhances images with poor lighting.
This document proposes using a novel dynamic fuzzy c-means (dFCM) clustering technique combined with an artificial neural network (ANN) approach to reconfigure power distribution networks and minimize active power loss. The dFCM clustering is used to preprocess the input data for the ANN by transforming the input space into kernels, reducing the size of the ANN needed. The proposed framework combines dFCM clustering and ANN and is tested on two power networks, showing benefits like very short processing time, high accuracy, and a simple ANN structure with few neurons compared to other traditional reconfiguration methods.
This document summarizes a research paper that proposes a new method for detecting moving objects in videos using background subtraction and morphological techniques. The method establishes a reliable background updating model and uses dynamic thresholding to obtain a more complete segmentation of moving objects. The algorithm is implemented on a Microblaze soft processor in VHDL and tested on a Spartan-3 FPGA board. Experimental results show the area and speed of the algorithm. In conclusion, the proposed method allows inherently parallel processing of video frames and can improve detection accuracy by operating at the region level using morphological operations.
Towards an adaptable spatial processing architectureArmando Guevara
An Adaptable Spatial Processing Architecture (ASPA) is what is needed to meet the demands of both multidisciplinary and specialized applications. ASPA fundamentals are based on a GFM that has a set of functional (GISP) primitives clearly defined that allows the automatic construction of a SOM. ASPA has to be designed based on the six continuity criterions given above. In this respect, ASPA would be an expert monitor based on a high level language consisting of spatial operators that have definable hierarchical constructs. These spatial operators can be organized following a programmable schema that would allow them to generate the SOM. ASPA would work in conjunction with a data base management system (DBMS). The DBMS would respond to both spatial and non-spatial operators. The heart of ASPA and the DBMS would be a GFM.
COMPOSITE TEXTURE SHAPE CLASSIFICATION BASED ON MORPHOLOGICAL SKELETON AND RE...sipij
After several decades of research, the development of an effective feature extraction method for texture
classification is still an ongoing effort. Therefore , several techniques have been proposed to resolve such
problems. In this paper a novel composite texture classification method based on innovative pre-processing
techniques, skeletonization and Regional moments (RM) is proposed. This proposed texture classification
approach, takes into account the ambiguity brought in by noise and the different caption and digitization
processes. To offer better classification rate, innovative pre-processing methods are applied on various
texture images first. Pre-processing mechanisms describe various methods of converting a grey level image
into binary image with minimal consideration of the noise model. Then shape features are evaluated using
RM on the proposed Morphological Skeleton (MS) method by suitable numerical characterization
measures for a precise classification. This texture classification study using MS and RM has given a good
performance. Good classification result is achieved from a single region moment RM10 while others failed
in classification.
In this paper, we analyze and compare the performance of fusion methods based on four different
transforms: i) wavelet transform, ii) curvelet transform, iii) contourlet transform and iv) nonsubsampled
contourlet transform. Fusion framework and scheme are explained in detail, and two different sets of
images are used in our experiments. Furthermore, eight different performancemetrics are adopted to
comparatively analyze the fusion results. The comparison results show that the nonsubsampled contourlet
transform method performs better than the other three methods, both spatially and spectrally. We also
observed from additional experiments that the decomposition level of 3 offered the best fusion performance,
anddecomposition levels beyond level-3 did not significantly improve the fusion results.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
The document presents a study on using the NURBS-based isogeometric finite element method for free vibration and buckling analysis of laminated composite plates. Key points:
- An isogeometric finite element method is developed using NURBS basis functions for the approximation of deflection fields and geometry parameterization.
- The Lagrange multiplier method is used to enforce essential boundary conditions and an orthogonal transformation technique is applied to the discrete eigenvalue equation.
- Numerical examples are presented to demonstrate the accuracy of the proposed method for laminated composite plates with different boundary conditions, fiber orientations, and modes of vibration/buckling. Results are verified against analytical and other numerical solutions.
Image processing techniques applied for pitting corrosion analysiseSAT Journals
Abstract
In order to study the behavior of the early stage of pitting corrosion, an image analysis based on discrete wavelet packet transform
and fractals was used. Image feature parameters were extracted and analyzed to characterize the pitting corrosion development with
test time. It was found that the feature parameters: Shannon entropy, energy, fractal dimension and intercept increased with the test
time. Therefore the image processing techniques were promising and effective tools to analyze and detect the pitting corrosion.
Keywords: corrosion, pitting corrosion, surface topography, surface analysis, carbon steel, tap water
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
This document contains summaries of several academic papers. The papers discuss topics related to computer vision, image processing, and machine learning including monocular depth estimation, subspace clustering, person re-identification, image set coding, 3D shape matching, single-image super-resolution, video synopsis, frame rate upconversion, in-loop filtering in video coding, microscopy image denoising, visual tracking, stereo matching, and brain image segmentation. Contact information is provided for TSYS Academic Projects in Adyar, India.
A NOVEL GRAPH REPRESENTATION FOR SKELETON-BASED ACTION RECOGNITIONsipij
Graph convolutional networks (GCNs) have been proven to be effective for processing structured data, so
that it can effectively capture the features of related nodes and improve the performance of model. More
attention is paid to employing GCN in Skeleton-Based action recognition. But there are some challenges
with the existing methods based on GCNs. First, the consistency of temporal and spatial features is ignored
due to extracting features node by node and frame by frame. We design a generic representation of
skeleton sequences for action recognition and propose a novel model called Temporal Graph Networks
(TGN), which can obtain spatiotemporal features simultaneously. Secondly, the adjacency matrix of graph
describing the relation of joints are mostly depended on the physical connection between joints. We
propose a multi-scale graph strategy to appropriately describe the relations between joints in skeleton
graph, which adopts a full-scale graph, part-scale graph and core-scale graph to capture the local features
of each joint and the contour features of important joints. Extensive experiments are conducted on two
large datasets including NTU RGB+D and Kinetics Skeleton. And the experiments results show that TGN
with our graph strategy outperforms other state-of-the-art methods.
Effect of sub classes on the accuracy of the classified imageiaemedu
This document discusses image classification techniques in remote sensing. It begins with an overview of the need for geometric corrections and rectification of satellite images to account for distortions. It then describes supervised and unsupervised classification methods for extracting land cover information from images. Supervised classification involves using training data to classify pixels, while unsupervised classification groups pixels into spectral classes based on natural clusters. The maximum likelihood algorithm assumes normal distributions and assigns pixels to the most probable class. Classification accuracy is assessed using an error matrix to evaluate omission and commission errors between the classified and reference maps. Increasing the number of classes in a classified image can reduce accuracy by making spectral distinctions between classes less clear.
This document describes a narrow band region approach for 2D and 3D image segmentation using deformable curves and surfaces. Specifically, it develops a region energy term involving a fixed-width band around the evolving curve or surface. This energy achieves a balance between local gradient features and global region statistics. The region energy is formulated to allow efficient computation on explicit parametric models and implicit level set models. Two different region terms are introduced, each suited to different configurations of the target object and its surroundings. The document derives the mathematical framework for computing the region energies and their gradients to allow minimization via gradient descent. It then discusses numerical implementations and provides experiments segmenting medical and natural images.
This document summarizes a theory for analyzing microstrip transmission lines on artificial periodic substrates. It proposes a double vector integral equation method involving two stages: 1) solving for the Green's function of the periodic structure, and 2) using this Green's function in a second integral equation to determine the fields and parameters of the microstrip line. Key aspects of the microstrip that can be determined include the propagation constant, characteristic impedance, and propagation bandgaps due to the periodic elements. The theory is validated through numerical comparisons to effective medium approximations and experimental data on a three-layer periodic substrate structure.
REGION CLASSIFICATION BASED IMAGE DENOISING USING SHEARLET AND WAVELET TRANSF...cscpconf
This paper proposes a neural network based region classification technique that classifies
regions in an image into two classes: textures and homogenous regions. The classification is
based on training a neural network with statistical parameters belonging to the regions of
interest. An application of this classification method is applied in image denoising by applying
different transforms to the two different classes. Texture is denoised by shearlets while
homogenous regions are denoised by wavelets. The denoised results show better performance
than either of the transforms applied independently. The proposed algorithm successfully
reduces the mean square error of the denoised result and provides perceptually good results.
VARIATIONAL MONTE-CARLO APPROACH FOR ARTICULATED OBJECT TRACKINGcsandit
In this paper, we describe a novel variational Monte Carlo approach for modeling and tracking
body parts of articulated objects. An articulated object (human target) is represented as a
dynamic Markov network of the different constituent parts. The proposed approach combines
local information of individual body parts and other spatial constraints influenced by
neighboring parts. The movement of the relative parts of the articulated body is modeled with
local information of displacements from the Markov network and the global information from
other neighboring parts. We explore the effect of certain model parameters (including the
number of parts tracked; number of Monte-Carlo cycles, etc.) on system accuracy and show that
ourvariational Monte Carlo approach achieves better efficiency and effectiveness compared to
other methods on a number of real-time video datasets containing single targets.
Multi Wavelet for Image Retrival Based On Using Texture and Color QuerysIOSR Journals
This document summarizes a research paper on using multi-wavelet transforms for content-based image retrieval. The paper proposes extracting multi-wavelet features from images in a database and query images to measure similarity. It calculates energy levels from multi-wavelet sub-bands and uses Canberra distance between feature vectors to retrieve similar images. The method achieves 98.5% accuracy and is faster than using Gabor wavelets. In conclusion, multi-wavelet transforms provide good performance for content-based image retrieval applications.
The document describes modeling the 3D geometry of relativistic jets based on 2D projection observations. It presents a mathematical model that uses Bayesian parameter estimation via MCMC to statistically estimate the 3D structural parameters of jet bends from measured 2D projection properties. Figures and equations show how the model accounts for projection effects to determine the intrinsic 3D geometry from observed 2D jet features like bend angles and distances.
This document presents a novel approach for measuring shape similarity and using it for object recognition. The key steps are:
1) Solving the correspondence problem between two shapes by attaching a descriptor called "shape context" to sample points on each shape. Shape context captures the distribution of remaining points relative to the reference point.
2) Using the point correspondences to estimate an aligning transformation between the shapes. This provides a measure of shape similarity as the matching error between corresponding points plus the magnitude of the transformation.
3) Treating recognition as a nearest neighbor problem to find the most similar stored prototype shape. The approach is demonstrated on various datasets including handwritten digits, silhouettes, and 3D objects
REGION CLASSIFICATION BASED IMAGE DENOISING USING SHEARLET AND WAVELET TRANSF...csandit
This paper proposes a neural network based region classification technique that classifies
regions in an image into two classes: textures and homogenous regions. The classification is
based on training a neural network with statistical parameters belonging to the regions of
interest. An application of this classification method is applied in image denoising by applying
different transforms to the two different classes. Texture is denoised by shearlets while
homogenous regions are denoised by wavelets. The denoised results show better performance
than either of the transforms applied independently. The proposed algorithm successfully
reduces the mean square error of the denoised result and provides perceptually good results.
EFFICIENT IMAGE RETRIEVAL USING REGION BASED IMAGE RETRIEVALsipij
1) The document describes an efficient region-based image retrieval system that uses discrete wavelet transform and k-means clustering. It segments images into regions, each characterized by features like size, mean, and covariance.
2) The system pre-processes images by resizing, converting to HSV color space, performing DWT, and using k-means clustering on DWT coefficients to generate regions. It extracts features for each region and stores them in a database.
3) For retrieval, it pre-processes the query image similarly and calculates similarities between the query regions and database regions based on their features, returning similar images.
OBIA on Coastal Landform Based on Structure Tensor csandit
This paper presents the OBIA method based on structure tensor to identify complex coastal
landforms. That is, develop Hessian matrix by Gabor filtering and calculate multiscale structure
tensor. Extract edge information of image from the trace of structure tensor and conduct
watershed segment of the image. Then, develop texons and create texton histogram. Finally,
obtain the final results by means of maximum likelihood classification with KL divergence as
the similarity measurement. The study findings show that structure tensor could obtain
multiscale and all-direction information with small data redundancy. Moreover, the method
described in the current paper has high classification accuracy
This document discusses fractal image compression using fractal functions. It introduces fractal geometry and fractal image compression. Fractal image compression works by finding self-similar patterns within an image and encoding them using fractal codes. The document proposes using a class of continuous fractal functions that depend on a finite set of parameters to build a mathematical model for fractal image encoding and decoding. This model represents numbers using a finite alphabet system and stochastic matrices, allowing images to be encoded and reconstructed from the fractal codes.
Multiple Ant Colony Optimizations for Stereo MatchingCSCJournals
The stereo matching problem, which obtains the correspondence between right and left images, can be cast as a search problem. The matching of all candidates in the same line forms a 2D optimization task and the two dimensional (2D) optimization is a NP-hard problem. There are two characteristics in stereo matching. Firstly, the local optimization process along each scan-line can be done concurrently; secondly, there are some relationship among adjacent scan-lines can be explored to promote the matching correctness. Although there are many methods, such as GCPs, GGCPs are proposed, but these so called GCPs maybe not be ground. The relationship among adjacent scan-lines is posteriori, that is to say the relationship can only be discovered after every optimization is finished. The Multiple Ant Colony Optimization(MACO) is efficient to solve large scale problem. It is a proper way to settle down the stereo matching task with constructed MACO, in which the master layer values the sub-solutions and propagate the reliability after every local optimization is finished. Besides, whether the ordering and uniqueness constraints should be considered during the optimization is discussed, and the proposed algorithm is proved to guarantee its convergence to find the optimal matched pairs.
The document proposes a new method for pose-consistent segmentation of 3D shapes based on a quantum mechanical feature descriptor called the Wave Kernel Signature (WKS). The method groups points on a shape's surface where quantum particles at different energy levels have similar probabilities of being measured. It learns clusters of points from multiple poses during training then segments new poses by assigning points to the most likely cluster. Experimental results show the segments agree with human intuition and labels are consistently transferred across poses, demonstrating the method is robust to noise and useful for shape retrieval.
Relevance Vector Machines for Earthquake Response Spectra drboon
This study uses Relevance Vector Machine (RVM) regression to develop a probabilistic model for the average horizontal component of 5%-damped earthquake response spectra. Unlike conventional models, the proposed approach does not require a functional form, and constructs the model based on a set predictive variables and a set of representative ground motion records. The RVM uses Bayesian inference to determine the confidence intervals, instead of estimating them from the mean squared errors on the training set. An example application using three predictive variables (magnitude, distance and fault mechanism) is presented for sites with shear wave velocities ranging from 450 m/s to 900 m/s. The predictions from the proposed model are compared to an existing parametric model. The results demonstrate the validity of the proposed model, and suggest that it can be used as an alternative to the conventional ground motion models. Future studies will investigate the effect of additional predictive variables on the predictive performance of the model.
Relevance Vector Machines for Earthquake Response Spectra drboon
This study uses Relevance Vector Machine (RVM) regression to develop a probabilistic model for the average horizontal component of 5%-damped earthquake response spectra. Unlike conventional models, the proposed approach does not require a functional form, and constructs the model based on a set predictive variables and a set of representative ground motion records. The RVM uses Bayesian inference to determine the confidence intervals, instead of estimating them from the mean squared errors on the training set. An example application using three predictive variables (magnitude, distance and fault mechanism) is presented for sites with shear wave velocities ranging from 450 m/s to 900 m/s. The predictions from the proposed model are compared to an existing parametric model. The results demonstrate the validity of the proposed model, and suggest that it can be used as an alternative to the conventional ground motion models. Future studies will investigate the effect of additional predictive variables on the predictive performance of the model.
6 superpixels using morphology for rock imageAlok Padole
The document describes a new superpixel segmentation algorithm called Superpixels Using Morphology (SUM) and compares it to existing algorithms. SUM uses a watershed transformation approach on an image's morphological gradient that has undergone area closing to efficiently generate superpixels. In experiments on rock images, SUM achieved under-segmentation error and boundary recall comparable to recent algorithms while being significantly faster, making it suitable for applications requiring fast superpixel generation.
This document summarizes an analysis of assembly algorithms and implementation of a De Bruijn graph approach to genome assembly. It discusses how De Bruijn graphs have become a common approach for assembly, representing reads as nodes and connecting nodes based on overlap of k-mers. The document outlines challenges in assembly including repeats and errors. It also summarizes two efficient data structures for representing De Bruijn graphs and describes implementing these to assemble microbial genomes and compare to the ABySS assembler.
Research on Image Classification Model of Probability Fusion Spectrum-Spatial...CSCJournals
For insufficient information of imaging spectrum with high spatial resolution, detailed imaging information, reduction of mixed pixels, increase of pure pixels and problems of image characteristic extraction and model classification produced from this, we provide a classifier model of a united spectrum-spatial multi-characteristic based on SVM, and use this model to finish the image classification. The model completely uses the multi-characteristic information, and overcomes the over-fitting problems produced by accumulating high-dimensional characteristics. The model includes three classifications of spectrum-spatial characteristics, namely spectral characteristics-spectral characteristic of multi-scale morphology, spectral characteristics-physical characteristics of underlaying surfaces of multi-scale morphology and spectral characteristics-features spatial extension characteristics of multi-scale morphology. Firstly the three classifications of spectrum-spatial characteristics are classified through SVM, then carries out the probability fusion for the classification results based on the pixels to obtain the final image classification results. This article respectively uses WorldView-2 image and ROSIS image to experiment, and the results show that the model has better classification effect compared with VS-SVM algorithm.
Since the skeleton represents the topology structure of the query sketch and 2D views of 3D model, this paper proposes a novel sketch-based 3D model retrieval algorithm which utilizes skeleton characteristics as the features to describe the object shape. Firstly, we propose advanced skeleton strength map (ASSM) algorithm to create the skeleton which computes the skeleton strength map by isotropic diffusion on the gradient vector field, selects critical points from the skeleton strength map and connects them by Kruskal's algorithm. Then, we propose histogram feature comparison algorithm which adopts the radii of the disks at skeleton points and the lengths of skeleton branches to extract the histogram feature, and compare the similarity between two skeletons using the histogram feature matrix of skeleton endpoints. Experiment results demonstrate that our approach which combines these two algorithms significantly outperforms several leading sketch-based retrieval approaches.
The document presents a novel set of Multiscale Periodic Boundary Conditions (MPBCs) that enable two-scale (solid-to-shell) numerical homogenization of periodic structures using reduced Unit Cells (rUCs), including their bending and twisting response. The MPBCs are formulated and their derivation is provided in an appendix. Details on their implementation in finite element analysis and application to the homogenization of a periodic pin-reinforced sandwich structure are discussed. The MPBCs allow accurate determination of the fully-populated shell constitutive matrix using rUCs, providing significant reductions in modeling and computation times compared to full Unit Cells.
Similar to Study on Reconstruction Accuracy using shapiness index of morphological transformations (20)
Generative AI Use cases applications solutions and implementation.pdfmahaffeycheryld
Generative AI solutions encompass a range of capabilities from content creation to complex problem-solving across industries. Implementing generative AI involves identifying specific business needs, developing tailored AI models using techniques like GANs and VAEs, and integrating these models into existing workflows. Data quality and continuous model refinement are crucial for effective implementation. Businesses must also consider ethical implications and ensure transparency in AI decision-making. Generative AI's implementation aims to enhance efficiency, creativity, and innovation by leveraging autonomous generation and sophisticated learning algorithms to meet diverse business challenges.
https://www.leewayhertz.com/generative-ai-use-cases-and-applications/
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELijaia
As digital technology becomes more deeply embedded in power systems, protecting the communication
networks of Smart Grids (SG) has emerged as a critical concern. Distributed Network Protocol 3 (DNP3)
represents a multi-tiered application layer protocol extensively utilized in Supervisory Control and Data
Acquisition (SCADA)-based smart grids to facilitate real-time data gathering and control functionalities.
Robust Intrusion Detection Systems (IDS) are necessary for early threat detection and mitigation because
of the interconnection of these networks, which makes them vulnerable to a variety of cyberattacks. To
solve this issue, this paper develops a hybrid Deep Learning (DL) model specifically designed for intrusion
detection in smart grids. The proposed approach is a combination of the Convolutional Neural Network
(CNN) and the Long-Short-Term Memory algorithms (LSTM). We employed a recent intrusion detection
dataset (DNP3), which focuses on unauthorized commands and Denial of Service (DoS) cyberattacks, to
train and test our model. The results of our experiments show that our CNN-LSTM method is much better
at finding smart grid intrusions than other deep learning algorithms used for classification. In addition,
our proposed approach improves accuracy, precision, recall, and F1 score, achieving a high detection
accuracy rate of 99.50%.
Accident detection system project report.pdfKamal Acharya
The Rapid growth of technology and infrastructure has made our lives easier. The
advent of technology has also increased the traffic hazards and the road accidents take place
frequently which causes huge loss of life and property because of the poor emergency facilities.
Many lives could have been saved if emergency service could get accident information and
reach in time. Our project will provide an optimum solution to this draw back. A piezo electric
sensor can be used as a crash or rollover detector of the vehicle during and after a crash. With
signals from a piezo electric sensor, a severe accident can be recognized. According to this
project when a vehicle meets with an accident immediately piezo electric sensor will detect the
signal or if a car rolls over. Then with the help of GSM module and GPS module, the location
will be sent to the emergency contact. Then after conforming the location necessary action will
be taken. If the person meets with a small accident or if there is no serious threat to anyone’s
life, then the alert message can be terminated by the driver by a switch provided in order to
avoid wasting the valuable time of the medical rescue team.
Discover the latest insights on Data Driven Maintenance with our comprehensive webinar presentation. Learn about traditional maintenance challenges, the right approach to utilizing data, and the benefits of adopting a Data Driven Maintenance strategy. Explore real-world examples, industry best practices, and innovative solutions like FMECA and the D3M model. This presentation, led by expert Jules Oudmans, is essential for asset owners looking to optimize their maintenance processes and leverage digital technologies for improved efficiency and performance. Download now to stay ahead in the evolving maintenance landscape.
Software Engineering and Project Management - Software Testing + Agile Method...Prakhyath Rai
Software Testing: A Strategic Approach to Software Testing, Strategic Issues, Test Strategies for Conventional Software, Test Strategies for Object -Oriented Software, Validation Testing, System Testing, The Art of Debugging.
Agile Methodology: Before Agile – Waterfall, Agile Development.
Software Engineering and Project Management - Introduction, Modeling Concepts...Prakhyath Rai
Introduction, Modeling Concepts and Class Modeling: What is Object orientation? What is OO development? OO Themes; Evidence for usefulness of OO development; OO modeling history. Modeling
as Design technique: Modeling, abstraction, The Three models. Class Modeling: Object and Class Concept, Link and associations concepts, Generalization and Inheritance, A sample class model, Navigation of class models, and UML diagrams
Building the Analysis Models: Requirement Analysis, Analysis Model Approaches, Data modeling Concepts, Object Oriented Analysis, Scenario-Based Modeling, Flow-Oriented Modeling, class Based Modeling, Creating a Behavioral Model.
Tools & Techniques for Commissioning and Maintaining PV Systems W-Animations ...Transcat
Join us for this solutions-based webinar on the tools and techniques for commissioning and maintaining PV Systems. In this session, we'll review the process of building and maintaining a solar array, starting with installation and commissioning, then reviewing operations and maintenance of the system. This course will review insulation resistance testing, I-V curve testing, earth-bond continuity, ground resistance testing, performance tests, visual inspections, ground and arc fault testing procedures, and power quality analysis.
Fluke Solar Application Specialist Will White is presenting on this engaging topic:
Will has worked in the renewable energy industry since 2005, first as an installer for a small east coast solar integrator before adding sales, design, and project management to his skillset. In 2022, Will joined Fluke as a solar application specialist, where he supports their renewable energy testing equipment like IV-curve tracers, electrical meters, and thermal imaging cameras. Experienced in wind power, solar thermal, energy storage, and all scales of PV, Will has primarily focused on residential and small commercial systems. He is passionate about implementing high-quality, code-compliant installation techniques.
Null Bangalore | Pentesters Approach to AWS IAMDivyanshu
#Abstract:
- Learn more about the real-world methods for auditing AWS IAM (Identity and Access Management) as a pentester. So let us proceed with a brief discussion of IAM as well as some typical misconfigurations and their potential exploits in order to reinforce the understanding of IAM security best practices.
- Gain actionable insights into AWS IAM policies and roles, using hands on approach.
#Prerequisites:
- Basic understanding of AWS services and architecture
- Familiarity with cloud security concepts
- Experience using the AWS Management Console or AWS CLI.
- For hands on lab create account on [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
# Scenario Covered:
- Basics of IAM in AWS
- Implementing IAM Policies with Least Privilege to Manage S3 Bucket
- Objective: Create an S3 bucket with least privilege IAM policy and validate access.
- Steps:
- Create S3 bucket.
- Attach least privilege policy to IAM user.
- Validate access.
- Exploiting IAM PassRole Misconfiguration
-Allows a user to pass a specific IAM role to an AWS service (ec2), typically used for service access delegation. Then exploit PassRole Misconfiguration granting unauthorized access to sensitive resources.
- Objective: Demonstrate how a PassRole misconfiguration can grant unauthorized access.
- Steps:
- Allow user to pass IAM role to EC2.
- Exploit misconfiguration for unauthorized access.
- Access sensitive resources.
- Exploiting IAM AssumeRole Misconfiguration with Overly Permissive Role
- An overly permissive IAM role configuration can lead to privilege escalation by creating a role with administrative privileges and allow a user to assume this role.
- Objective: Show how overly permissive IAM roles can lead to privilege escalation.
- Steps:
- Create role with administrative privileges.
- Allow user to assume the role.
- Perform administrative actions.
- Differentiation between PassRole vs AssumeRole
Try at [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
Study on Reconstruction Accuracy using shapiness index of morphological transformations
1. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.6, December 2012
DOI : 10.5121/ijcseit.2012.2601 1
Study on Reconstruction Accuracy using shapiness
index of morphological transformations
P.Radhakrishnan
Department of Computer Science
College of Computer Science, King Khalid University, Abha, P.O.Box: 394
Kingdom of Saudi Arabia, Phone: 00966-7-2417019
http://radhakrishnan.info
Email: radha.krish5@gmail.com, krish_res@yahoo.com
Abstract
Basin, lakes, and pore-grain space are important geophysical shapes, which can fit with the several
classical and fractal binary shapes, are processed by employing morphological transformations, and
methods. The decomposition of skeleton network (minimum morphological information) using various
classical structures like square, octagon and rhombus. Then derive the dilated subsets respective degree by
the structures for reconstruct the original image. Through shapiness index of pattern spectrum procedure,
we try test the reconstruction accuracy in a quantitative manner. It gives some general procedure to
characterise the shape-size complexity of surface water body. The reconstruction accuracy is against the
size of water bodies with which we produce the some example of different shapiness index for different
structuring element of shapes. In which quantitative manner approach yields better reconstruction level.
The complexity of water bodies are compared with the surfaces.
Keywords
Reconstruction, Skeleton network, Mathematical morphology, Pattern spectrum, Shape-size complexity.
1. Introduction
Geophysical process may understand through Shape description. The geophysical basins,
elevation regions, lakes, rock pore-grain space are closely identified through the simplified
shapes. This investigation includes shapes for importance from the point of geophysical studies.
Using certain indicators of geophysical science can be determined from the overall shape. The
channel network or pore-grain connectivity network can be treated as minimum information
employing which one can make an attempt to reproduce the original shapes. For example the
basin processes can be used for the spatial organization of the channel network patterns. This
minimum information has highly significant, morphological information, where we can rebuild
the basin. Using morphological transformations and rules we can identify minimum information.
To check the correctness of the constructing basin by analysing with original information in
spatial domain, pattern spectrum procedure is of immense use. These study considering various
binary synthetic images, which is from threshold of elevation regions (DEM) [Sagar, 2000]. The
connectivity network patterns converted from binary shapes, which have minimum morphological
information in the basin, i. e., channel network patterns. To reconstruct the original shapes we use
these connectivity network subsets. We will analysis the reconstructing importance through
various predefined morphological rules and pattern spectrum procedures. Several studies have
been carried out of which the procedure based on mathematical morphology, though
2. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.6, December 2012
2
computationally expensive, proved to be robust. So in a way there is a link between minimum
morphological information and reconstruction rules. This study emphasized to explore the
potentiality of several existing procedures, which are essentially based on morphological
transformations. Present investigation deals with a treatise on the applications of morphological
transformations to investigate shapes from geophysical aspect. Various procedures are adapted to
achieve an aim include superficially simple but elegant mathematical morphology
transformations such as erosion, dilation, opening and closing. These transformations are
systematically used associated with different logical operations. In whole of the study, the reader
realizes the importance of the rules, which we term as structuring element.
In this paper geostatistical tools have been employed to quantify the degree of accuracy in the
reconstructed basins, and to compute shapiness indices of several geophysical phenomena.
Several synthetic shapes and connectivity networks, which are termed as geophysical basins and
networks, are considered in this chapter. The organisation of the connectivity network pattern
determines the basin processes. In order to verify the accuracy in such a reconstructed basin by
comparing with original basin’s organisation in spatial domain, pattern spectrum procedure is
adopted. However, in this chapter, various synthetic basins in binary form, which are akin to
thresholded elevation regions of DEM [Sagar, 2000] and surface water bodies are considered.
These synthetic elevation regions are converted into possible connectivity networks, which are
akin to the minimum morphological information in the basin, (e.g. channel network pattern). The
subsets of connectivity network are the main focus from which the original synthetic thresholded
elevation regions are constructed. Generation of connectivity networks, their reduced versions,
and reconstruction of basins from these two types of networks are targeted in this chapter. The
terms such as image, shape which are often used are the shapes of geophysical interest,
structuring element term is the probing rule with which the shapes of geophysical interest will be
reconstructed, and the terms “connectivity network or the skeleton network are akin to the unique
networks such as channel, flow direction and pore-grain connectivity networks.
2. Morphological Transformations
Mathematical morphology [P.Maragos, 1987, P.Radhakrishnan 2005] is a set algebra used to
process and analyze data based on geometric shapes. Structuring element which is small pattern is
used to examine the geometrical structure of an image. The X is defined as finite Euclidean two-
dimensional space Z2
. Let B denote a structuring element, which is a subset in Z2
with a simple
geometrical shape and certain characteristic information. The base image and structuring element
are used for morphological operations. This operation will process the images and produce the
resultant image by specifying the size of structuring element. Figure 1shows the structuring
template of different shape like octagon, square, and rhombus which are used for reconstruction
accuracy for any image. The four basic morphological transformations are erosion, dilation,
cascade of erosion-dilation and dilation-erosion. The mathematical representation of these four
fundamental morphological transformations is given in equation (1), the diagrammatic
representation can be seen from the literature.
Erosion:
Dilation:
Opening:
Closing: (1)
( ) { }X B x B x X⊕ − = + ∩⊂ ≠∅:
( )[ ]X B X B Bo = − ⊕Θ
( )[ ]X B X B B• = ⊕ − Θ
( ) { }X B x B x XΘ − = + ⊂:
3. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.6, December 2012
3
The opening and closing nonlinear transformations can be implemented iteratively by following
multi-scale approaches, in which the size of the SE will be incremented from iteration to iteration.
In the multi-scale approach, the size of the B will be increased form iteration to iteration
[P.A.Maragos 1987].
n times (2)
where n is the discrete size parameter. Using nonlinear transformations, we can compute the
shapes on various aspects. To characterize the normal shapes we apply the reconstruction
procedure and pattern spectrum procedure. Utilize the standard four fundamental transformations
which can decompose a binary shape, akin to geophysical shape, and a skeleton to reconstruct the
shape from the skeleton. Also these application are also applied in pattern spectrum procedure for
verify the standard of reconstructions. One pixel size channel we can derive by applying the
various structuring element in morphology. These thinner lines are of special interest because
they explain the structure of the original basins and vertices. The distance of skeleton is the line
made up of those points to the boundary which includes the beginning and end of thinner line.
Highly symmetrical objects have the skeletons with symmetry. The more irregular is the object,
the more irregular is its skeleton. Morphologically the skeleton extraction phase can be achieved
by connectivity the basic morphological transformation as shown in equation (3,4)
n = 0, 1, 2, ..., N (3)
where Skn(X) denotes the nth skeletal subset of shape (X). Morphological erosion is used for X
and structuring element for n times which will be followed by opening by B, finally subtracting
from the eroded versions of X their opening by B. The morphological skeletal network will be
produced from the union of all such possible points. The given shape will be decomposed as
skeletal network by using reconstruction with same structuring element which is used in
computation of skeleton.
1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1
(a) (b) (c)
Figure 1. Binary patterns in Z2
(SE), (a) octagon, (b) square, and (c) rhombus
2.1 Reconstruction of binary image
Reconstruction is one classical way in mathematical morphology to achieve robustness by
conditioning transformations to a reference set or image, and therefore controlling the spatial
extensions of the morphological transformations. Morphological reconstruction is a process of
taking a partial connected component and recreating the entire connected component, based on
the intensities in the input image X. Successive dilations are preformed on the image with
markers, each dilation being followed by an intersection with the original image until
nB B B B B= ⊕ ⊕ ⊕ ⊕...
Sk X Sk Xn
n
N
( ) ( )=
=0
U
Sk X X nB X nB B B( ) ( ) {[( ) ] }= ⊕Θ Θ Θ
4. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.6, December 2012
4
convergence or idempotence. Reconstruction retrieves the original shape of the retained particles
after erosion, which eliminates small objects. Skeleton is precisely decomposed from its shape by
the morphological operations that is designed precisely. In the next phase, these skeletal subsets,
decomposed [Tun-Wen Pai, 1994] from the shape are dilated by an explicit number of iterations
by way of trying to reconstruct the shape outline by means of certain predefined morphological
rule. Through pattern spectrum procedure [8], we derive shapeiness index (I) for the binary
images. The morphological analog of frequency in conventional signal processing, is size. Hence
any geometric spectrum, obtained morphologically [P.A.Maragos 1987], is a measure of size-
content (of the structuring element) in the given image. Thus such a geometric spectrum of an
image can be plotted against the size (of the structuring element) axis. The nth
entry in the pattern
spectrum [Eqn.5] is defined as:
(5)
where X is the image and B is the structuring element, S Q ={x∈S: x∉Q}, Nmax is the minimum
size of the B, such that the erosion of image X with Nmax B results in the null set. Thus the nth
entry
in the pattern spectrum is the cardinality of the set difference between the opening of the image X
by the structuring element B of size n and (n+1).It is a shape-size descriptor, which can detect
critical scales in an image object and quantify various aspects of its shape-size content. Since
opening removes the portion smaller than the SE, the difference of the images opened by the SE
of size n and size n+1 contains the portion whose size is exactly n. The number of pixels in the
set obtained by subtracting the opened objects from the original one gives the area of those
objects that cannot contain the SE. Thus, iterative application of the morphological opening and
the measurement of the residues, while increasing the size of the SE gives the size distribution of
the objects contained in the given image.
2.2 Study of reconstruction accuracy
Mathematical morphological transformations are employed [BSD Sagar,1998] to decompose a
binary shape by means of various SE. To study the aspects of binary image the morphological
procedures are applied in integrated process, which includes derivation of morphological rules for
topological structure. To derive these rules several binary shapes are simulated and the procedure
based on mathematical morphology has been systematically implemented to verify the accuracy
of morphological rules and in the reconstructed shapes [Eq. 6].
(6)
Pattern spectrum PSx(r,B) is given by (7), where A(X) means that the area of X and r is the scale.
(7)
A(X ο rB) is a measure of the pattern content of X relative to the pattern rB[P.A.Maragos, 1986].
By varying both r (scale) and the shape of B (structuring element) we obtain a shape-size
spectrum of X, which is the full pattern spectrum of X relative to all the patterns that can fit
inside X. The higher a spectrum at the maximum r, the more alike an area X is as a structuring
element B. Shapeiness is a likeness between X and B. B-shapeiness Sx(B) [Eq. 8] is as follows,
where rmax means that maximum of scale r.
( )[ ]
( ) ( )( )
X U S X nB
where s x X nB X nB B
n
N
n
n
= ⊕
=
=1
( ) Θ Θ o
( ) ( ) ( )( )rBXBXABrPSx oo , =
( ){ }
max
1max
,0)(
,...,1,0,1)(
NnnPS
NnBnXnBXAreanPS
≥=
=+= −oo
5. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.6, December 2012
5
(8)
The above calculation yields 1 if the image and structuring element are same. When rmax-1is not
maximum, the SX(B) is calculated by applying the rmax-1 for pattern spectrum . The procedure is
explained in flowchart [Figure 2].
3. Case Study and Results
Various planner shapes [Figure. 5] that include both classical and irregular shape have been
investigated in discrete space with an aim to estimate the shape-size complexity measure. The
different rules applied in discrete space to investigate the shape sixe complexity through the
shapiness index. The structuring elements like octagon, square, rhombus and irregular shapes are
studied to analysis the reconstruct accuracy [Figure 3]. We plotted all these shapes in one image
and carried out the reconstruction procedures. For each shape there is a different pattern spectrum
value through different SE like square, octagon, Rhombus [Figures. 4, 6, 7, 8]. These values are
given (Table 1-3). Flowchart [Fig. 2] shows various steps involved in the adopted procedure
[Figures. 4, 6, 7, 8]. Fractal shape is considered with different SE. It gives 80 to 90% accuracy of
reconstruction. Square shape with square SE gives 100% accuracy. The reconstruction accuracy
varies to 40 % from 10 %, which is a lowest level. Similarly the rectangle shape with square SE
gives 100% accuracy but with other SE it gives 10 to 30% of accuracy.
Figure.2 Sequential steps involved in the study of accuracy
( ) ( )
( ) ( )( )
S B PS r B A x
S B PS r B PS r B A X
X
X X X
=
= +
−
−
max
max max
, / ( )
( ) , , / ( )
1
1
6. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.6, December 2012
6
The reconstruction accuracy of the binary shapes have been studied by calculating shapiness
index. The range of this index is 0 to 1. If the shapeiness index is 1, then the two images are in the
same pattern with exact geometric similarity. The dissimilar images yield 0 for shapiness index.
Binary image reconstruction includes various recurrences of steps of morphological rules. The
first step is to isolate of skeletal subset by means of a specific structuring element (e.g. rhombus).
In this step, the skeletal subsets up to nth order will be extracted by simply subtracting the opened
version of the eroded image from the eroded image. The erosion degree will be varied. This step
is better explained through mathematical morphological representation (Eq.4). If each skeletal
subset of each degree is dilated to the same degree by the same structuring element, which is used
to extract the skeletal subsets, the union of all the dilated skeletal subsets to the specific degree
will produce exactly the original binary shape. Obviously, this produced a shape, which is not
similar to that of the original shape. This phenomenon is said to be that the reconstruction
accuracy is imperfect.
Figure 3 Reconstruction fractal (a simulated TER of DEM) using rhombus as structuring element
. a1-a22: different scale subsets of dilation of original image. a23: union of a1-a22. (a22 = ∅)
7. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.6, December 2012
7
Figure 4 Pattern Spectrum of fractal image with rhombus as structuring element.
Figure 5. Comparison table of the original basin with n-1 opening of the same basin with different
discrete rules.
8. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.6, December 2012
8
Fig 6 :Pattern spectrum of square with square as structuring element. a1: image with one
openings, a2: image with n-1 openings.
Figure 7 Pattern spectrum of square with octagon as structuring element. a1: image with one
openings, a2-a15 different scale openings, a16: image with n-1 openings,
Figure 8: Pattern spectrum of square with rhombus as structuring element. a1: image with one
openings, a2-a22 different scale openings, a23: image with n-1 openings.
9. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.6, December 2012
9
3.1 Small water bodies
Analysis the shape size complexity we considered the 35 number of small water bodies (Figure 9)
situated randomly over a 10 sq. km landscape , which produces general trend to derive a shape-
size complexity relationships. We computed the shapiness index for all water bodies by
implementing multiscale morphological opening (Table 5). It ranges from 0.2 to 0.83, which
shows that the smaller topological water bodies yields higher shapiness index, so reconstruction
accuracy is more on small water bodies. But the higher geometrically water bodies may have
some low level accuracy through morphological transformations rules. A simple graph between
logarithm of areas of water bodies and their shapiness indices (Figure. 10) are plotted. A general
trend indicating the relationship between shape and size is observed, which further can be used to
make firm shape-size complexity relationship. However, it is worth considering a large number of
water bodies, for instance 300 and over, that may provide a single power-law based on fractal-
length-area-perimeter-volume dimensional analysis.
Figure 9: Small water bodies, traced from IRS 1D remotely sensed data, situated in the flood
plain region of Gosthani river (A.P) India.
Figure 10: shape–size complexity of small water bodies
In this paper we compare size distributions via the concept of a pattern spectrum. It can be
applied through the size distributions of shapiness index in discrete- space binary or gray tone
image. From the experimental results, it was shown that the shapeiness index (I) was available
information for individual recognition and it could be classified with 100% accuracy. To improve
the classification accuracy, we will consider a new structuring element like ellipse or
y = -0.2502x + 0.355
-1
-0.8
-0.6
-0.4
-0.2
0
0 1 2 3 4
Area of lakes
Shapinessindex
10. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.6, December 2012
10
asymmetrical shape. The scale shows the size of structuring element. By statistical bar graph we
derive the graph of water bodies and shapiness index of a shape pattern generated [Figure. 11a ,
11b] by a prototype pattern.
Figure 11a :Pattern spectrum of Fractal
Figure 11b: Pattern Spectrum of Square
Table 1: Pattern spectrum of Fractal
Scale 1 2 3 4 5 6 7 8 9 10 15 20 25 38 n
PS(16,Octagon) 15 20 34 36 40 42 46 49 61 83 85 0
PS(26,Square) 0 14 17 26 33 34 36 37 39 41 60 82 89 0
PS(39,Rhombus) 4 11 17 18 21 24 35 35 36 37 42 49 82 87 0
Table 2: Pattern spectrum of Square
Scale 1 2 3 4 5 6 7 8 9 10 15 16 20 25 30 32 n
PS(17,Octagon) 4 12 24 40 60 84 112 144 180 220 480 544 0
PS(33,Square) 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 4950 0
PS(33,Rhombus) 4 12 24 40 60 84 112 144 180 220 480 544 840 1300 1860 2112 0
Table 3: Shapeiness index I of binary image with different SE.
Structuring
element Shapes
Square Rectangle Triangle Octagon Hexagon Circle Irregular
Shape
Fractal
SE(Square) 1.0 1.0 0.5 0.6 0.6 0.4 0.6 0.9
SE(Octagon) 0.1 0.1 0.4 1.0 0.4 0.9 0.8 0.8
SE(Rhombus) 0.4 0.3 0.5 0.5 0.7 0.4 0.7 0.9
Pattern spectrum
0
50
100
1
3
5
7
9
15
25
n
Scale r
PSx(r,B)
octagon square rhombus
0
2000
4000
6000
8000
10000
1
3
5
7
9
15
21
30
n
Scale r
PSx(r,B)
octagon square ram bus
11. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.6, December 2012
11
Table 4: Pattern spectrum(PS(n)), network transform (Sn),and RST(Rn)of the fractal basin of
Figure.3
N PS(n) Sn Rn N PS(n) Sn Rn
0 47552 47752 47552 10 28159 223 219
1 47552 403 403 11 27005 123 109
2 47552 405 405 12 26406 136 134
3 47028 358 342 13 24972 143 139
4 46329 1066 1006 14 20634 122 121
5 41668 720 642 15 19151 125 125
6 36225 380 346 16 10901 68 69
7 29225 257 255 17 5793 47 47
8 30696 205 199 18 0 0 0
9 29860 248 232
Table 5 Shapiness of indices of randomly situated surface water bodies of various sizes and
shapes
Name Area Shapiness Name Area Shapiness
Lake1 180 0.79 lake18 615 0.32
Lake2 182 0.76 lake19 627 0.44
Lake3 210 0.83 lake20 668 0.17
Lake4 256 0.91 Lake21 697 0.41
Lake5 278 0.41 Lake22 818 0.55
Lake6 304 0.49 lake23 875 0.42
Lake7 340 0.43 Lake24 906 0.72
Lake8 362 0.5 Lake25 1051 0.4
Lake9 413 0.43 Lake26 1215 0.46
lake10 443 0.61 Lake27 1779 0.36
Lake11 454 0.53 Lake28 1792 0.42
Lake12 497 0.33 Lake29 1818 0.37
Lake13 512 0.39 Lake30 1822 0.27
lake14 552 0.31 Lake31 2010 0.32
Lake15 555 0.46 Lake32 2022 0.42
lake16 588 0.51 Lake33 2559 0.33
Lake17 604 0.57 Lake34 3326 0.27
Lake35 4566 0.31
4. Conclusion
Filling any image by using morphological reconstruction approach yields full-length packing, the
efficiency of filling the various shapes including irregular. The higher reconstruction accuracy
gives higher ratio of packing efficiency. In quantitative terms, the fractal structural element yields
best reconstruction accuracy of shapines index, it can be higher in packing or filling the shape
through fractal shapes. The highest reconstruction accuracy value is close to 1 from fractal
structural element of the square and rhombus which are 0.9 and 0.8 respectively. In contrast, the
shapiness index of the same fractal by means of octagon is 0.8 which can consider as a rule that
describes the lower packing efficiency compare to the other two structuring elements. In our
12. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.6, December 2012
12
study, the pattern spectrum procedure is utilized for identifying shapiness index, which starts in
normal shapes like square, rhombus, octagon and finally with irregular shapes of water bodies.
The water bodies are in different size of geometrically structure which is randomly situated
surface water bodies are also considered, and their shapiness indices are computed. The shape
size complexity of various water bodies observed with a general trend.
5. References
[1] B. S. D. Sagar, M. Venu and D. Srinivas, Morphological operators to extract channel networks from
Digital Elevation Models, International Journal of Remote Sensing. 21 (1) (2000) 21-30.
[2] P.Maragos, Pattern spectrum of images and morphological shape-size complexity, Acoustics, Speech,
and Signal Processing, IEEE International Conference on ICASSP '87. Apr 1987, Volume: 12,
Page(s): 241 - 244
[3] P.Radhakrishnan, Characterization of reconstructed basins using pattern spectrum procedure,
American journal of applied sciences vol. 2, issue 4, pp 843 – 846, 2005
[4] P.A. Maragos, Pattern spectrum and multiscale shape representation, IEEE Pattern Analysis and
Machine Intelligence 11 (7) (1989).
[5] B.S.D. Sagar, M.Venu, G.Gandhi, and D.Srinivas, Morphological description and interrelation
between force and structure: a scope to geomorphic evolution process modeling, Int. J. Remote
Sensing 19 (7) (1998) 1341-1358.
[6] Tun-Wen Pai, J.H,L.Hansen, Boundary-Constrained Morphological skeleton minimization and
skeleton reconstruction, IEEE Trans on Pattern Analysis and Machine Intelligence 16 (2) (1994).
[7] P.A.Maragos,, R.W. Schafer, Morphological skeleton representation and coding of binary images,
IEEE Trans on Acoustics, speech and signal processing ASSP-34 (5) (1986)1228-1244.
Author
Dr.Radhakrishnan Palanikumar working as Asst. Prof in King Khalid University Saudi
Arabia for last 7 years and his teaching experience is more than 17 years in various
international universities. His research interest includes image processing and
segmentations.