Min-Hung Yeh

National Ilan University

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Soo‐Chang Pei

National Taiwan University

Chien–Cheng Tseng

National Kaohsiung University of Science and Technology

Chien-Cheng Tseng

National Kaohsiung University of Science and Technology

Tzyy-Liang Luo

National Taiwan University

Ding Jian-Jiun

National Taiwan University

Hsuan‐Yi Chou

National Sun Yat-sen University

Ren-You Xiao

National Ilan University

Jong-Jy Shyu

National University of Kaohsiung

Cooperative Institutions

National Taiwan University

National Kaohsiung First University of Science and Technology

National Kaohsiung University of Science and Technology

National University of Kaohsiung

National Ilan University

Jinwen University of Science and Technology

Tatung University

Carnegie Mellon University

Chang Jung Christian University

University of Science and Technology

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

A sharpness measure by GET operator

2022 IEEE International Conference on Consumer Electronics - Taiwan (2015)

Min-Hung Yeh

In this paper, a sharpness measure based upon the GET (Gradient Energy Tensor) operator is proposed. Since the proposed sharpness measure is related to the third-order differentials of images, it can stress upon the sharpness for the focused target for image.

Operator (biology)

Energy operator

10.1109/icce-tw.2015.7216880

Cite

Citations (0)

Fractional Fourier series expansion for finite signals and dual extension to discrete-time fractional Fourier transform

IEEE Transactions on Signal Processing (1999)

Soo‐Chang Pei Min-Hung Yeh Tzyy-Liang Luo

Conventional Fourier analysis has many schemes for different types of signals. They are Fourier transform (FT), Fourier series (FS), discrete-time Fourier transform (DTFT), and discrete Fourier transform (DFT). The goal of this article is to develop two absent schemes of fractional Fourier analysis methods. The proposed methods are fractional Fourier series (FRFS) and discrete-time fractional Fourier transform (DTFRFT), and they are the generalizations of Fourier series (FS) and discrete-time Fourier transform (DTFT), respectively.

Discrete-time Fourier transform

Discrete Fourier series

Fourier inversion theorem

Discrete sine transform

10.1109/78.790671

Cite

Citations (129)

Fractional time-frequency distributions

Soo‐Chang Pei Min-Hung Yeh

Several quadratic signal representation methods have been successfully used in signal processing. Four quadratic signal representations, Wigner distribution, ambiguity function, signal correlation function and spectral correlation function are the traditional ones. In this paper, we propose a generalized distribution of the four quadratic time-frequency representations. The proposed distributions can have partial time/frequency-lag and partial time-lag/frequency characteristics of signals.

Ambiguity function

Wigner distribution function

SIGNAL (programming language)

Discrete-time signal

Instantaneous phase

Representation

10.1109/iscas.1997.612875

Cite

Citations (3)

A new discrete fractional Fourier transform based on constrained eigendecomposition of DFT matrix by Lagrange multiplier method

IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing (1999)

Soo‐Chang Pei Chien-Cheng Tseng Min-Hung Yeh

This paper is concerned with the definition of the discrete fractional Fourier transform (DFRFT). First, an eigendecomposition of the discrete Fourier transform (DFT) matrix is derived by sampling the Hermite Gauss functions, which are eigenfunctions of the continuous Fourier transform and by performing a novel error-removal procedure. Then, the result of the eigendecomposition of the DFT matrix is used to define a new DFRFT. Finally, several numerical examples are illustrated to demonstrate that the proposed DFRFT is a better approximation to the continuous fractional Fourier transform than the conventional defined DFRFT.

Discrete-time Fourier transform

DFT matrix

10.1109/82.793715

Cite

Citations (35)

The discrete fractional cosine and sine transforms

IEEE Transactions on Signal Processing (2001)

Soo‐Chang Pei Min-Hung Yeh

This paper is concerned with the definitions of the discrete fractional cosine transform (DFRCT) and the discrete fractional sine transform (DFRST). The definitions of DFRCT and DFRST are based on the eigen decomposition of DCT and DST kernels. This is the same idea as that of the discrete fractional Fourier transform (DFRFT); the eigenvalue and eigenvector relationships between the DFRCT, DFRST, and DFRFT can be established. The computations of DFRFT for even or odd signals can be planted into the half-size DFRCT and DFRST calculations. This will reduce the computational load of the DFRFT by about one half.

Discrete sine transform

Discrete Hartley transform

Sine

10.1109/78.923302

Cite

Citations (174)

Discrete fractional Fourier transform

Soo‐Chang Pei Min-Hung Yeh

The continuous fractional Fourier transform (FRFT) represents a rotation of signal in time-frequency plane, and it has become an important tool for signal analysis. A discrete version of fractional Fourier transform has been developed but its results do not match those of continuous case. In this paper, we propose a new version of discrete fractional Fourier transform (DFRFT). This new DFRFT will provide similar transforms as those of continuous fractional Fourier transform and also hold the rotation properties.

Discrete-time Fourier transform

Discrete sine transform

Discrete Hartley transform

Harmonic wavelet transform

Hartley transform

10.1109/iscas.1996.541780

Cite

Citations (36)

A new method with saliency detection for image quality assessment

Ren-You Xiao Min-Hung Yeh

In this paper, a new method with visual saliency detection for image quality assessment (IQA) is proposed. Through the experiments in this paper, we have verified the proposed method can be effective than most others.

Quality Assessment

10.1109/icce-china.2017.7991002

Cite

Citations (1)

Discrete fractional Hilbert transform

IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing (2000)

Min-Hung Yeh Soo‐Chang Pei

The Hilbert transform plays an important role in the theory and practice of signal processing. A generalization of the Hilbert transform, the fractional Hilbert transform, was recently proposed, and it presents physical interpretation in the definition. In this paper, we develop the discrete fractional Hilbert transform, and apply the proposed discrete fractional Hilbert transform to the edge detection of digital images.

Hilbert spectral analysis

Hilbert R-tree

Discrete Hartley transform

10.1109/82.885138

Cite

Citations (72)

Discrete fractional Fourier transform based on orthogonal projections

IEEE Transactions on Signal Processing (1999)

Soo‐Chang Pei Min-Hung Yeh Chien–Cheng Tseng

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.

Discrete-time Fourier transform

Discrete sine transform

Hartley transform

Harmonic wavelet transform

10.1109/78.757221

Cite

Citations (286)

A novel method for discrete fractional Fourier transform computation

Soo‐Chang Pei Min-Hung Yeh

A novel method for the discrete fractional Fourier transform (DFRFT) computation is given in this paper. With the help of this novel method, the DFRFT of any angle can be computed by the weighted summation of the DFRFTs with the special angles. Moreover, the proposed algorithm is suitable for chirp signal detection and the VLSI implementations.

Chirp

Discrete sine transform

Discrete-time Fourier transform

10.1109/iscas.2001.921138

Cite

Citations (18)