TEXTURE CHARACTERIZATION USING WSFS AND WCFS

2009 ◽  
Vol 09 (01) ◽  
pp. 77-100
Author(s):  
S. ARIVAZHAGAN ◽  
L. GANESAN

Texture analysis plays an important role in many tasks, ranging from remote sensing to medical imaging and query by content in large image data bases. The main difficulty of texture analysis in the past was the lack of adequate tools to characterize different scales of textures effectively. The development in multi-resolution analysis such as Gabor and wavelet transform help to overcome this difficulty. This paper describes the texture characterization system using (i) Wavelet Statistical Features (WSF) obtained from 3-level Discrete Wavelet Transformed (DWT) images, (ii) Wavelet Co-occurrence Features (WCF) of one level wavelet transformed images in detail.

2013 ◽  
Vol 291-294 ◽  
pp. 2805-2810
Author(s):  
Yao Qi Wang ◽  
Xiao Peng Wang ◽  
Raji Rafiu King

A new DWT (Discrete Wavelet Transform) algorithm is proposed based on data storage. Since the image data stored in the memory position with the image itself are unrelated. The focus of the research is on the image data in memory, relegating the traditional algorithm which is based on the entire image. The image data is divided into the appropriate data blocks, and DWT is carried out for each block independently. At the same time, taking into account the watermark invisibility and robustness and in order to improve the watermark safety and concealment, watermark is encrypted before embedding. Synthetic application of data segmentation, watermark scrambling and multi-resolution analysis in the algorithm is effected. Not only is watermarking invisible, but also has a better robustness for image processing such as noise, filtering, shearing, and so on.


The most common technique used for image processing applications is ‘The wavelet transformation’. The Discrete Wavelet Transform (DWT) keeps the time as well as frequency information depend on a multi resolution analysis structure, where the other classical transforms like Fast Fourier Transform (FFT), Discrete Cosine Transform (DCT) will not do that. Because of this feature, the quality of the repaired image is improved when comparing to the other transforms. To implement the DWT on a real time codec, a fast device needs to be targeted. While comparing with the other implementation such as PCs, ARM processors, DSPs etc, Field Programmable Gate Array (FPGA) implementation of DWT had better processing speed and costs were vey less. A Fast Architecture based DWT using Kogge Stone Adder is proposed in this paper where the coefficients of lifting scheme are calculated by using Shift adder and Kogge Stone Adder where other techniques used multiplier. The most important intention of the suggested technique is to use minimum calculation and limited memory. The simulation of the suggested design is dole out on the Xilinx 14.1 style tool and also the performance is evaluated and compared with the present architectures.


Author(s):  
Y Srinivasa Rao ◽  
G. Ravi Kumar ◽  
G. Kesava Rao

An appropriate fault detection and classification of power system transmission line using discrete wavelet transform and artificial neural networks is performed in this paper. The analysis is carried out by applying discrete wavelet transform for obtained fault phase currents. The work represented in this paper are mainly concentrated on classification of fault and this classification is done based on the obtained energy values after applying discrete wavelet transform by taking this values as an input for the neural network. The proposed system and analysis is carried out in Matlab Simulink.


Author(s):  
Bao Qin Wang ◽  
Gang Wang ◽  
Xiao Hui Zhou ◽  
Yu Su

In this paper, a simple method is given in order to construct an area preserving mapping from a developable surface M to a plane. Based on the area preserving projection, we give some important formulas on M, and define a multi-resolution analysis on L2(M). We provide the conditions to further discuss the continuous wavelet transform and discrete wavelet transform on developable surface. At the same time, we derived two-scale equations that the scaling function and wavelet function on developable surface satisfied, we also define and discuss the orthogonality, and several important theorems are given. Finally, we construct the numerical examples. The focus of this paper is the area preserving mapping that from developable surface M to a plane, and the discrete wavelet transform on developable surface.


Author(s):  
SHAIKHJI ZAID M ◽  
J B JADHAV ◽  
V N KAPADIA

Textures play important roles in many image processing applications, since images of real objects often do not exhibit regions of uniform and smooth intensities, but variations of intensities with certain repeated structures or patterns, referred to as visual texture. The textural patterns or structures mainly result from the physical surface properties, such as roughness or oriented structured of a tactile quality. It is widely recognized that a visual texture, which can easily perceive, is very difficult to define. The difficulty results mainly from the fact that different people can define textures in applications dependent ways or with different perceptual motivations, and they are not generally agreed upon single definition of texture [1]. The development in multi-resolution analysis such as Gabor and wavelet transform help to overcome this difficulty. In this paper it describes that, texture classification using Wavelet Statistical Features (WSF), Wavelet Co-occurrence Features (WCF) and a combination of wavelet statistical features and co-occurrence features of wavelet transformed images with different feature databases can results better [2]. Several Image degrading parameters are introduced in the image to be classified for verifying the features. Wavelet based decomposing is used to classify the image with code prepared in MATLAB.


Author(s):  
A. Akilandeswari ◽  
◽  
Annie Grace Vimala ◽  
D. Sungeetha ◽  
◽  
...  

The most common technique used for image processing applications is ‘The wavelet transformation’. The Discrete Wavelet Transform (DWT) keeps the time as well as frequency information depend on a multi resolution analysis structure, where the other classical transforms like Fast Fourier Transform (FFT), Discrete Cosine Transform (DCT) will not do that. Because of this feature, the quality of the repaired image is improved when comparing to the other transforms. To implement the DWT on a real time codec, a fast device needs to be targeted. While comparing with the other implementation such as PCs, ARM processors, DSPs etc, Field Programmable Gate Array (FPGA) implementation of DWT had better processing speed and costs were vey less. A Fast Architecture based DWT using Kogge Stone Adder is proposed in this paper where the coefficients of lifting scheme are calculated by using Shift adder and Kogge Stone Adder where other techniques used multiplier. The most important intention of the suggested technique is to use minimum calculation and limited memory. The simulation of the suggested design is dole out on the Xilinx 14.1 style tool and also the performance is evaluated and compared with the present architectures.


2012 ◽  
Vol 580 ◽  
pp. 74-77
Author(s):  
Jiang Tao Xu ◽  
Rui Xia Guo

This paper, based on the discrete wavelet thoughts, using the pressure fluctuations signal of the engine compressor, effectively remove high frequency interference, and keep useful information to signal. According to the different position of different states of the signal pressure pulsation multi-resolution analysis, reconstruction of the relevant frequency band pressure component signals, thus judgment that whether compressor enters a stall, the conventional only through the stall of engine after expressed by changes to the method of performance criterion.


Sign in / Sign up

Export Citation Format

Share Document