The accuracy of modal parameter estimation plays a crucial role in flutter boundary prediction. A new wavelet denoising method is introduced for flight flutter testing data, which can improve the estimation of frequen...The accuracy of modal parameter estimation plays a crucial role in flutter boundary prediction. A new wavelet denoising method is introduced for flight flutter testing data, which can improve the estimation of frequency domain identification algorithms. In this method, the testing data is first preprocessed with a gradient inverse weighted filter to initially lower the noise. The redundant wavelet transform is then used to decompose the signal into several levels. A “clean” input is recovered from the noisy data by level dependent thresholding approach, and the noise of output is reduced by a modified spatially selective noise filtration technique. The advantage of the wavelet denoising is illustrated by means of simulated and real data.展开更多
Lifting scheme is a useful and very general technique for constructing wavelet decomposition. The paper adapts the lifting into redundant lifting to obtain shift invariant wavelet transform. ...Lifting scheme is a useful and very general technique for constructing wavelet decomposition. The paper adapts the lifting into redundant lifting to obtain shift invariant wavelet transform. In prediction and update stages of the lifting morphological operator is adopted for preserving local maxima of a signal over several scales, which is particularly useful in wavelet\|based signal detec tion. The new transform presented in the paper is applied in multiresoluti on edge detection of medical image and experim ent results are given to show better performance and applicable potentiali ty.展开更多
Many algorithms have been proposed to find sparse representations over redundant dictionaries or transforms. This paper gives an overview of these algorithms by classifying them into three categories： greedy pursuit ...Many algorithms have been proposed to find sparse representations over redundant dictionaries or transforms. This paper gives an overview of these algorithms by classifying them into three categories： greedy pursuit algorithms, lp norm regularization based algorithms, and iterative shrinkage algorithms. We summarize their pros and cons as well as their connections. Based on recent evidence, we conclude that the algorithms of the three categories share the same root： lp norm regularized inverse problem. Finally, several topics that deserve further investigation are also discussed.展开更多
Many algorithms have been proposed to achieve sparse representation over redundant dictionaries or transforms. A comprehensive understanding of these algorithms is needed when choosing and designing algorithms for par...Many algorithms have been proposed to achieve sparse representation over redundant dictionaries or transforms. A comprehensive understanding of these algorithms is needed when choosing and designing algorithms for particular applications. This research studies a representative algorithm for each category, matching pursuit （MP）, basis pursuit （BP）, and noise shaping （NS）, in terms of their sparsifying capability and computational complexity. Experiments show that NS has the best performance in terms of sparsifying ca- pability with the least computational complexity. BP has good sparsifying capability, but is computationally expensive. MP has relatively poor sparsifying capability and the computations are heavily dependent on the problem scale and signal complexity. Their performance differences are also evaluated for three typical ap- plications of time-frequency analyses, signal denoising, and image coding. NS has good performance for time-frequency analyses and image coding with far fewer computations. However, NS does not perform well for signal denoising. This study provides guidelines for choosing an algorithm for a given problem and for designing or improving algorithms for sparse representation.展开更多
文摘The accuracy of modal parameter estimation plays a crucial role in flutter boundary prediction. A new wavelet denoising method is introduced for flight flutter testing data, which can improve the estimation of frequency domain identification algorithms. In this method, the testing data is first preprocessed with a gradient inverse weighted filter to initially lower the noise. The redundant wavelet transform is then used to decompose the signal into several levels. A “clean” input is recovered from the noisy data by level dependent thresholding approach, and the noise of output is reduced by a modified spatially selective noise filtration technique. The advantage of the wavelet denoising is illustrated by means of simulated and real data.
文摘Lifting scheme is a useful and very general technique for constructing wavelet decomposition. The paper adapts the lifting into redundant lifting to obtain shift invariant wavelet transform. In prediction and update stages of the lifting morphological operator is adopted for preserving local maxima of a signal over several scales, which is particularly useful in wavelet\|based signal detec tion. The new transform presented in the paper is applied in multiresoluti on edge detection of medical image and experim ent results are given to show better performance and applicable potentiali ty.
基金Supported by the Joint Research Fund for Overseas Chinese Young Scholars of the National Natural Science Foundation of China (Grant No.60528004)the Key Project of the National Natural Science Foundation of China (Grant No. 60528004)
文摘Many algorithms have been proposed to find sparse representations over redundant dictionaries or transforms. This paper gives an overview of these algorithms by classifying them into three categories： greedy pursuit algorithms, lp norm regularization based algorithms, and iterative shrinkage algorithms. We summarize their pros and cons as well as their connections. Based on recent evidence, we conclude that the algorithms of the three categories share the same root： lp norm regularized inverse problem. Finally, several topics that deserve further investigation are also discussed.
基金Supported by the Joint Research Fund for Overseas Chinese Young Scholars of the National Natural Science Foundation of China (No.60528004)the Key Project of the National Natural Science Foundation of China (No. 60528004)
文摘Many algorithms have been proposed to achieve sparse representation over redundant dictionaries or transforms. A comprehensive understanding of these algorithms is needed when choosing and designing algorithms for particular applications. This research studies a representative algorithm for each category, matching pursuit （MP）, basis pursuit （BP）, and noise shaping （NS）, in terms of their sparsifying capability and computational complexity. Experiments show that NS has the best performance in terms of sparsifying ca- pability with the least computational complexity. BP has good sparsifying capability, but is computationally expensive. MP has relatively poor sparsifying capability and the computations are heavily dependent on the problem scale and signal complexity. Their performance differences are also evaluated for three typical ap- plications of time-frequency analyses, signal denoising, and image coding. NS has good performance for time-frequency analyses and image coding with far fewer computations. However, NS does not perform well for signal denoising. This study provides guidelines for choosing an algorithm for a given problem and for designing or improving algorithms for sparse representation.
