Scalability of 2-D wavelet transform algorithms: analytical and experimental results on coarse-grained parallel computers

2002 ◽  
Author(s):  
J.N. Patel ◽  
L.H. Jamieson ◽  
A.A. Khokhar
Keyword(s):  
Wavelet Transform ◽  
Parallel Computers ◽  
Experimental Results ◽  
Coarse Grained

Estimation of Heart Rate Variability Fluctuations by Wavelet Transform

2011 ◽  
Vol 57 (3) ◽  
pp. 395-400 ◽  
Author(s):  
Anton Popov ◽  
Yevgeniy Karplyuk ◽  
Volodymyr Fesechko
Keyword(s):  
Heart Rate ◽  
Heart Rate Variability ◽  
Wavelet Transform ◽  
Experimental Results ◽  
Dyadic Wavelet ◽  
Heart Rate Fluctuations ◽  
Slow Heart Rate ◽  
Dyadic Wavelet Transform

Estimation of Heart Rate Variability Fluctuations by Wavelet TransformTechnique for separate estimation of fast and slow fluctuations in the heart rate signal is developed. The orthogonal dyadic wavelet transform is used to separate the slow heart rate changes in approximation part of decomposition and fast changes in detail parts. Experimental results using the recordings from persons practicing Chi meditation demonstrated the applicability of estimation heart rate fluctuations with the proposed approach.

String Search in Coarse-Grained Parallel Computers

Algorithmica ◽  
1999 ◽  
Vol 24 (3-4) ◽  
pp. 177-194 ◽  
Author(s):  
P. Ferragina ◽  
F. Luccio
Keyword(s):  
Parallel Computers ◽  
Coarse Grained ◽  
String Search

The Application of Wavelet Transform in Image Dispose

2012 ◽  
Vol 239-240 ◽  
pp. 907-910
Author(s):  
Rui Ren ◽  
Xun Zhou ◽  
Ju Han ◽  
Si Ming Xing
Keyword(s):  
Wavelet Transform ◽  
Experimental Results ◽  
Character Identification ◽  
Local Direction ◽  
Image Characteristic ◽  
Good Identification ◽  
Directional Wavelet

The features of wavelet transform is firstly introduced in this paper, then the directional wavelet is introduced to pick up image characteristic, finally, the experimental results of directional wavelet used in characteristic identification of character-figure is given, it proves this characteristics puck-up method has good local direction characteristics, this function make it has good identification capacity for typical noise of character: stroke missed, stroke break, mechanism twitter, stroke conglutination, so it very useful for character identification.

Mammogram Enhancement Using Wavelet Transform and Sigmoid Function

2015 ◽  
Vol 781 ◽  
pp. 632-636
Author(s):  
Varakorn Kidsumran ◽  
Werapon Chiracharit
Keyword(s):  
Breast Cancer ◽  
Wavelet Transform ◽  
Experimental Results ◽  
Sigmoid Function ◽  
Soft Thresholding ◽  
Denoised Image

Mammogram enhancement is important for the radiologist to diagnose and screen breast cancer. This paper proposes a method to improve contrast and denoising in mammogram using wavelet transform and sigmoid function. First, mammogram is decomposed using wavelet transform and detail coefficients are decreased in order to remove noises by soft thresholding. Inverse wavelet transform is then applied to obtain the denoised image. Finally, sigmoid function is applied to the image to enhance mammogram. Experimental results illustrate that the proposed method can improve contrast and denoise mammogram effectively.

Wavelet Transform with a Novel Integration Technique for Image Fusion

2011 ◽  
Vol 204-210 ◽  
pp. 1419-1422 ◽  
Author(s):  
Yong Yang
Keyword(s):  
Wavelet Transform ◽  
Image Fusion ◽  
High Frequency ◽  
Low Frequency ◽  
Experimental Results ◽  
Integration Technique ◽  
Frequency Bands ◽  
Fusion Methods ◽  
Fusion Scheme ◽  
Measures Of Performance

Image fusion is to combine several different source images to form a new image by using a certain method. Recent studies show that among a variety of image fusion algorithms, the wavelet-based method is more effective. In the wavelet-based method, the key technique is the fusion scheme, which can decide the final fused result. This paper presents a novel fusion scheme that integrates the wavelet decomposed coefficients in a quite separate way when fusing images. The method is formed by considering the different physical meanings of the coefficients in both the low frequency and high frequency bands. The fused results were compared with several existing fusion methods and evaluated by three measures of performance. The experimental results can demonstrate that the proposed method can achieve better performance than conventional image fusion methods.

scholarly journals Graph Contraction for Mapping Data on Parallel Computers: A Quality–Cost Tradeoff

1994 ◽  
Vol 3 (1) ◽  
pp. 73-82 ◽  
Author(s):  
R. Ponnusamy ◽  
N. Mansour ◽  
A. Choudhary ◽  
G. C. Fox
Keyword(s):  
Execution Time ◽  
Original Problem ◽  
Substantial Reduction ◽  
Optimization Methods ◽  
Parallel Computers ◽  
Experimental Results ◽  
Mapping Data ◽  
Problem Size ◽  
Oriented Parallel ◽  
Graph Contraction

Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the execution time of the application if the size of the problem is large. In this article, first we motivate the case for graph contraction as a means for reducing the problem size. We restrict our discussion to applications where the problem domain can be described using a graph (e.g., computational fluid dynamics applications). Then we present a mapping-oriented parallel graph contraction (PGC) heuristic algorithm that yields a smaller representation of the problem to which mapping is then applied. The mapping solution for the original problem is obtained by a straightforward interpolation. We then present experimental results on using contracted graphs as inputs to two physical optimization methods; namely, genetic algorithm and simulated annealing. The experimental results show that the PGC algorithm still leads to a reasonably good quality mapping solutions to the original problem, while producing a substantial reduction in mapping time. Finally, we discuss the cost-quality tradeoffs in performing graph contraction.

scholarly journals Reconstruction of Vital Blade Signal from Unsteady Casing Vibration

2014 ◽  
Vol 6 ◽  
pp. 146983 ◽  
Author(s):  
Meng Hee Lim ◽  
M. S. Leong
Keyword(s):  
Wavelet Transform ◽  
Fault Diagnosis ◽  
Rotor System ◽  
Experimental Results ◽  
Energy Profile ◽  
Translation Invariant ◽  
Root Cause ◽  
Exact Position ◽  
Cycle Spinning

Some important information pertaining to blade fault is thought to be concealed in highly unsteady casing vibration. This paper explores suitable methods to best reconstruct blade related signals from raw casing vibration, which could be used for diagnosis of blade fault. The feasibility of translation invariant wavelet transform and cycle spinning (TIWT-CS) technique in reconstruction of these signals is investigated in this paper. Subsequently, a new parameter for blade fault diagnosis, namely, the energy profile of blade signal (EPBS), is formulated. Experimental results show that TIWT-CS method effectively retained blade related signals, while other unwanted signals such as system noises and aerodynamic induced vibration are reasonably suppressed. EPBS provides an indication of the condition of blade faults in rotor system, whereby the exact position and the quantity of faulty blades, as well as the root cause of blade fault, can be identified. In comparison, the energy profile plots using unfiltered casing vibration were found to be highly unstable and therefore provides inconsistent results for diagnosis of blade fault.

scholarly journals Digital Watermarking Algorithm Based on Wavelet Analysis

2013 ◽  
Vol 347-350 ◽  
pp. 2214-2217
Author(s):  
Qing Song Xu
Keyword(s):  
Wavelet Transform ◽  
Wavelet Analysis ◽  
Discrete Wavelet Transform ◽  
Digital Watermarking ◽  
Rapid Development ◽  
Experimental Results ◽  
Discrete Wavelet ◽  
A New Technique ◽  
Visual Properties ◽  
Watermarking Scheme

With the rapid development of the network and the multimedia technical , how to protect the security of the multimedia informations becomes the popular topic on studies. As a new technique used to protect the copyright of digital productions , the digital watermark technique has drawn extensive attention . A digital watermarking algorithm based on discrete wavelet transform (DWT) was presented according to human visual properties in the paper . Then some attack analyses were given. Experimental results show that the watermarking scheme proposed in this paper is invisible and robust to cropping, and also has good robustness to compression, filtering, and noise adding.

Image Fusion Algorithm Based on Wavelet Transform and Laplacian Pyramid

2013 ◽  
Vol 860-863 ◽  
pp. 2846-2849
Author(s):  
Ming Jing Li ◽  
Yu Bing Dong ◽  
Xiao Li Wang
Keyword(s):  
Wavelet Transform ◽  
Image Fusion ◽  
Relevant Information ◽  
Experimental Results ◽  
Improve Quality ◽  
Laplacian Pyramid ◽  
Single Image ◽  
Fusion Algorithm ◽  
Fused Image

Image fusion is process which combine relevant information from two or more images into a single image. The aim of fusion is to extract relevant information for research. According to different application and characteristic of algorithm, image fusion algorithm could be used to improve quality of image. This paper complete compare analyze of image fusion algorithm based on wavelet transform and Laplacian pyramid. In this paper, principle, operation, steps and characteristic of fusion algorithm are summarized, advantage and disadvantage of different algorithm are compared. The fusion effects of different fusion algorithm are given by MATLAB. Experimental results shows that quality of fused image would be improve obviously.

scholarly journals Digital Watermarking using Multiscale Ridgelet Transform

2013 ◽  
pp. 162-167
Author(s):  
Manmit Kaur ◽  
H. P. Sinha
Keyword(s):  
Wavelet Transform ◽  
Image Compression ◽  
Edge Detection ◽  
Discrete Cosine Transform ◽  
Digital Watermarking ◽  
High Frequency ◽  
Digital Images ◽  
Experimental Results ◽  
Ridgelet Transform ◽  
Frequency Bands

The multi-resolution watermarking method for digital images proposed in this work. The multiscale ridgelet coefficients of low and high frequency bands of the watermark is embedded to the most significant coefficients at low and high frequency bands of the multiscale ridgelet of an host image, respectively. A multi-resolution nature of multiscale ridgelet transform is exploiting in the process of edge detection. Experimental results of the proposed watermarking method are compared with the previously available watermarking algorithm wavelet transform. Moreover, the proposed watermarking method also tested on images attached by Discrete Cosine Transform (DCT) and wavelet based lossy image compression techniques.

Sign in / Sign up

Export Citation Format

Share Document