Chien-Cheng Tseng

Bio: Chien-Cheng Tseng is an academic researcher from National Kaohsiung First University of Science and Technology. The author has contributed to research in topics: Filter design & Adaptive filter. The author has an hindex of 32, co-authored 188 publications receiving 3664 citations. Previous affiliations of Chien-Cheng Tseng include National Taiwan University.

Discrete fractional Fourier transform based on orthogonal projections

Abstract: The continuous fractional Fourier transform (FRFT) performs a spectrum rotation of signal in the time-frequency plane, and it becomes an important tool for time-varying signal analysis. A discrete fractional Fourier transform has been developed by Santhanam and McClellan (see ibid., vol.42, p.994-98, 1996) but its results do not match those of the corresponding continuous fractional Fourier transforms. We propose a new discrete fractional Fourier transform (DFRFT). The new DFRFT has DFT Hermite eigenvectors and retains the eigenvalue-eigenfunction relation as a continous FRFT. To obtain DFT Hermite eigenvectors, two orthogonal projection methods are introduced. Thus, the new DFRFT will provide similar transform and rotational properties as those of continuous fractional Fourier transforms. Moreover, the relationship between FRFT and the proposed DFRFT has been established in the same way as the conventional DFT-to-continuous-Fourier transform.

Design of fractional order digital FIR differentiators

Abstract: In this paper, the design of a fractional order FIR differentiator is investigated. First, the fractional derivative of the power function is defined. Then, the impulse response of the fractional order differentiator is obtained by solving linear equations of the Vandermonde form. Finally, one example is used to demonstrate that the fractional derivatives of digital signals are easily computed by using the proposed filtering technique.

A weighted least-squares method for the design of stable 1-D and 2-D IIR digital filters

Abstract: We present a new approach to the least-squares design of stable infinite impulse response (IIR) digital filters. The design is accomplished by using an iterative scheme in which the denominator polynomial obtained from the preceding iteration is treated as a part of the weighting function, and each iteration is carried out by solving a standard quadratic programming problem that yields a stable rational function. When the iteration converges, a stable and truly least-squares solution is obtained. The method is then extended to address the least-squares design of stable IIR two-dimensional (2-D) filters. Examples are included to illustrate the proposed design techniques.

Elimination of AC interference in electrocardiogram using IIR notch filter with transient suppression

Abstract: A technique for suppressing the transient states of IIR notch filter is investigated. This technique uses the vector projection to find better initial values for notch filters. When a notch or comb filter is used to eliminate power line (AC) interference in the recording of electrocardiograms (ECG), the performance of the notch filter with transient suppression is better than that of the conventional notch filter with arbitrary initial condition. The improvements with this technique are at the cost of additional computation load at the beginning of filtering. >

Least mean p-power error criterion for adaptive FIR filter

Abstract: An adaptive FIR filter based on the least mean p-power error (MPE) criterion is investigated. First, some useful properties of MPE function are studied. Three main results are as follows: 1) MPE function is a convex function of filter coefficients; so it has no local minima. 2) When input process and desired process are both Gaussian processes, then MPE function has the same optimum solution as the conventional Wiener solution for any p. 3) When input process and desired process are non-Gaussian processes, then MPE function may have better optimum solution than Wiener solution. Next, a least mean p-power (LMP) error adaptive algorithm is derived and some application examples are presented. Consequently, when the signal is corrupted by an impulsive noise, the adaptive algorithm with p=1 is preferred. Furthermore, when the signal is corrupted by noise or interference, the adaptive algorithm with proper choice of p may be preferred. >

The discrete fractional Fourier transform

Abstract: We propose and consolidate a definition of the discrete fractional Fourier transform that generalizes the discrete Fourier transform (DFT) in the same sense that the continuous fractional Fourier transform generalizes the continuous ordinary Fourier transform. This definition is based on a particular set of eigenvectors of the DFT matrix, which constitutes the discrete counterpart of the set of Hermite-Gaussian functions. The definition is exactly unitary, index additive, and reduces to the DFT for unit order. The fact that this definition satisfies all the desirable properties expected of the discrete fractional Fourier transform supports our confidence that it will be accepted as the definitive definition of this transform.

A flexible representation of quantum images for polynomial preparation, image compression, and processing operations

Abstract: A Flexible Representation of Quantum Images (FRQI) is proposed to provide a representation for images on quantum computers in the form of a normalized state which captures information about colors and their corresponding positions in the images. A constructive polynomial preparation for the FRQI state from an initial state, an algorithm for quantum image compression (QIC), and processing operations for quantum images are combined to build the whole process for quantum image processing on FRQI. The simulation experiments on FRQI include storing, retrieving of images and a detection of a line in binary images by applying quantum Fourier transform as a processing operation. The compression ratios of QIC between groups of same color positions range from 68.75 to 90.63% on single digit images and 6.67---31.62% on the Lena image. The FRQI provides a foundation not only to express images but also to explore theoretical and practical aspects of image processing on quantum computers.

Generalized Correntropy for Robust Adaptive Filtering

Abstract: As a robust nonlinear similarity measure in kernel space, correntropy has received increasing attention in domains of machine learning and signal processing. In particular, the maximum correntropy criterion (MCC) has recently been successfully applied in robust regression and filtering. The default kernel function in correntropy is the Gaussian kernel, which is, of course, not always the best choice. In this paper, we propose a generalized correntropy that adopts the generalized Gaussian density (GGD) function as the kernel, and present some important properties. We further propose the generalized maximum correntropy criterion (GMCC) and apply it to adaptive filtering. An adaptive algorithm, called the GMCC algorithm, is derived, and the stability problem and steady-state performance are studied. We show that the proposed algorithm is very stable and can achieve zero probability of divergence (POD). Simulation results confirm the theoretical expectations and demonstrate the desirable performance of the new algorithm.

Fractional Differential Mask: A Fractional Differential-Based Approach for Multiscale Texture Enhancement

Abstract: In this paper, we intend to implement a class of fractional differential masks with high-precision. Thanks to two commonly used definitions of fractional differential for what are known as Grumwald-Letnikov and Riemann-Liouville, we propose six fractional differential masks and present the structures and parameters of each mask respectively on the direction of negative x-coordinate, positive x-coordinate, negative y-coordinate, positive y-coordinate, left downward diagonal, left upward diagonal, right downward diagonal, and right upward diagonal. Moreover, by theoretical and experimental analyzing, we demonstrate the second is the best performance fractional differential mask of the proposed six ones. Finally, we discuss further the capability of multiscale fractional differential masks for texture enhancement. Experiments show that, for rich-grained digital image, the capability of nonlinearly enhancing complex texture details in smooth area by fractional differential-based approach appears obvious better than by traditional integral-based algorithms.