International Journal of Image, Graphics and Signal Processing (IJIGSP)

IJIGSP Vol. 10, No. 4, Apr. 2018

Cover page and Table of Contents: PDF (size: 281KB)

Table Of Contents

REGULAR PAPERS

A Novel Method for Crack Detection in Steel Cantilever Beam Using Wavelet Analysis by Combination Mode Shapes

By H. Rouhollah Pour J. Asgari Marnani A. A. Tabatabei

DOI: https://doi.org/10.5815/ijigsp.2018.04.01, Pub. Date: 8 Apr. 2018

The first step in Structures Health Monitoring (SHM), are determining the location, intensity and type of damage in structures. Crack is a damage that often occurs in structural elements and may cause serious ruptures in the structure. One of the important approaches is the wavelet analysis of vibration modes structures. In this study, it has been performed the crack detection method in steel cantilever beam structure, using an optimized wavelet-based model. The wavelet analysis has been performed based on the higher orders of the structure’s mode shapes. The results show that the proposed method is able to accurately detect all kinds of cracks, in which the cracks location are variable. In this study also, cracks with length of 20%, 10%, 5% and 2% of the beam’s depth have been considered and one of the most prominent results is introducing a method for detecting robust and environmental noisy cracks. The proposed method is capable of accurately detecting crack in the cantilever beams in noisy conditions about 20 dB of SNR.

[...] Read more.
Design and Development of Image Security Technique by Using Cryptography and Steganography: A Combine Approach

By Aumreesh Kumar Saxena Sitesh Sinha Piyush Shukla

DOI: https://doi.org/10.5815/ijigsp.2018.04.02, Pub. Date: 8 Apr. 2018

This paper proposes security technique for the confidential data which is the combination of three techniques, first is image compression that is based on wavelet transformation which will compress confidential image and reduce the size of the image, second is cryptography that is based on symmetric key which will encrypt the confidential image, and third is steganography that is based on least significant bit (LSB) which will embedded encrypted information inside a cover image. Therefore the purpose of the proposed technique is the high security and quality of the reconstructed cover image.

[...] Read more.
Hybridized Technique for Copy-Move Forgery Detection Using Discrete Cosine Transform and Speeded-Up Robust Feature Techniques

By Joseph A. Ojeniyi Bolaji O. Adedayo Idris Ismaila Shafii M. Abdulhamid

DOI: https://doi.org/10.5815/ijigsp.2018.04.03, Pub. Date: 8 Apr. 2018

As the world has greatly experienced a serious advancement in the area of technological advancement over the years, the availability of lots of sophisticated and powerful image editing tools has been on the rise. These image editing tools have become easily available on the internet, which has made people who are a novice in the field of image editing, to be capable of tampering with an image easily without leaving any visible clue or trace behind, which has led to increase in digital images losing authenticity. This has led to developing various techniques for tackling authenticity and integrity of forged images. In this paper, a robust and enhanced algorithm is been developed in detecting copy-move forgery, which is done by hybridizing block-based DCT (Discrete Cosine Transform) technique and a keypoint-based SURF (Speeded-Up Robust Feature)technique using the MATLAB platform. The performance of the above technique has been compared with DCT and SURF techniques as well as other hybridized techniques in terms of precision, recall, FPR and accuracy metrics using MICC-F220 dataset. This technique works by applying DCT to the forged image, with the main goal of enhancing the detection rate of such image and then SURF is applied to the resulting image with the main goal of detecting those areas that are been tampered with on the image.  It has been observed that this paper’s technique named HDS has an effective detection rate on the MICC-F220 dataset with multiple cloning attacks and other various attacks such as rotation, scaling, a combination of scaling plus rotation, blur, compression, and noise.

[...] Read more.
A Dataset for Speech Recognition to Support Arabic Phoneme Pronunciation

By Moner N. M. Arafa Reda Elbarougy A. A. Ewees G. M. Behery

DOI: https://doi.org/10.5815/ijigsp.2018.04.04, Pub. Date: 8 Apr. 2018

It is difficult for some children to pronounce some phonemes such as vowels. In order to improve their pronunciation, this can be done by a human being such as teacher or parents. However, it is difficult to discover the error in the pronunciation without talking with each student individually. With a large number of students in classes nowadays, it is difficult for teachers to communicate with students separately. Therefore, this study proposes an automatic speech recognition system which has the capacity to detect the incorrect phoneme pronunciation. This system can automatically support children to improve their pronunciation by directly asking children to pronounce a phoneme and the system can tell them if it is correct or not. In the future, the system can give them the correct pronunciation and let them practise until they get the correct pronunciation. In order to construct this system, an experiment was done to collect the speech database. In this experiment 89, elementary school children were asked to produce 28 Arabic phonemes 10 times. The collected database contains 890 utterances for each phoneme. For each utterance, fundamental frequency f0, the first 4 formants are extracted and 13 MFCC co-efficients were extracted for each frame of the speech signal. Then 7 statics were applied for each signal. These statics are (max, min, range, mean, mead, variance and standard divination) therefore for each utterance to have 91 features. The second step is to evaluate if the phoneme is correctly pronounced or not using human subjects. In addition, there are six classifiers applied to detect if the phoneme is correctly pronounced or not by using the extracted acoustic features. The experimental results reveal that the proposed method is effective for detecting the miss pronounced phoneme ("أ").

[...] Read more.
Bio-chip Design Using Multi-rate System for EEG Signal on FPGA

By Nazifa Tabassum Sheikh Md. Rabiul Islam Xu Huang

DOI: https://doi.org/10.5815/ijigsp.2018.04.05, Pub. Date: 8 Apr. 2018

Digital Signal Processing (DSP) is one of the fastest growing techniques in the electronics industry. The signal-rate system in digital signal processing has evolved the key of fastest speed in digital signal processor. Field Programmable Gate Array (FPGA) offers good solution for addressing the needs of high performance DSP systems. The focus of this paper is on the basic DSP functions, namely filtering signals to remove unwanted frequency bands. Multi-rate Digital Filters (MDFs) are the main theme to build bio-chip design in this paper. For different purposes DSP systems need to change the sampling rate of the signal to achieve some applications. This can be done using multi-rate system where designers can increase or decrease the operating sampling rate. This bio-chip has attractive features like, low requirement of the coefficient word lengths, significant saving in computation time and storage which results in a reduction in its dynamic power consumption. This paper introduces an efficient FPGA realization of multi-rate digital filter with narrow pass-band and narrow transition band to reduce noises and changing the frequency sampling rate by factor which is required according to application. This bio-chip works on bio-signals like EEG signal.

[...] Read more.
A Heuristic Strategy for Sub-Optimal Thick-Edged Polygonal Approximation of 2-D Planar Shape

By Sourav Saha Saptarsi Goswami Priya Ranjan Sinha Mahapatra

DOI: https://doi.org/10.5815/ijigsp.2018.04.06, Pub. Date: 8 Apr. 2018

This paper presents a heuristic approach to approximate a two-dimensional planar shape using a thick-edged polygonal representation based on some optimal criteria. The optimal criteria primarily focus on derivation of minimal thickness for an edge of the polygonal shape representation to handle noisy contour. Vertices of the shape-approximating polygon are extracted through a heuristic exploration using a digital geometric approach in order to find optimally thick-line to represent a discrete curve. The merit of such strategies depends on how efficiently a polygon having minimal number of vertices can be generated with modest computational complexity as a meaningful representation of a shape without loss of significant visual characteristics. The performance of the proposed frame- work is comparable to the existing schemes based on extensive empirical study with standard data set.

[...] Read more.
Content based Image Retrieval Using Multi Motif Co-Occurrence Matrix

By A.Obulesu V.Vijaya Kumar L. Sumalatha

DOI: https://doi.org/10.5815/ijigsp.2018.04.07, Pub. Date: 8 Apr. 2018

In this paper, two extended versions of motif co-occurrence matrices (MCM) are derived and concatenated for efficient content-based image retrieval (CBIR). This paper divides the image into 2 x 2 grids. Each 2 x 2 grid is replaced with two different Peano scan motif (PSM) indexes, one is initiated from top left most pixel and the other is initiated from bottom right most pixel. This transforms the entire image into two different images and co-occurrence matrices are derived on these two transformed images:  the first one is named as “motif co-occurrence matrix initiated from top left most pixel (MCMTL)” and second one is named as “motif co-occurrence matrix initiated from bottom right most pixel (MCMBR)”. The proposed method concatenates the feature vectors of MCMTL and MCMBR and derives multi motif co-occurrence matrix (MMCM) features. This paper carried out investigation on image databases i.e. Corel-1k, Corel-10k, MIT-VisTex, Brodtaz, and CMU-PIE and the results are compared with other well-known CBIR methods. The results indicate the efficacy of the proposed MMCM than the other methods and especially on MCM [19] method.

[...] Read more.