scispace - formally typeset
Search or ask a question

Showing papers by "Jeng-Shyang Pan published in 2001"


Journal ArticleDOI
TL;DR: Experimental results show that GVQ and GSAVQ need a little longer CPU time than, the maximum decent (MD) algorithm, but they outperform MD by 0.2–0.5 dB in PSNR.

70 citations


Journal ArticleDOI
TL;DR: A new method for watermarking based on vector quantisation is proposed, efficient for implementation with conventional techniques, and simulation results show its robustness under a variety of attacks.
Abstract: A new method for watermarking based on vector quantisation is proposed. It is efficient for implementation with conventional techniques, and simulation results show its robustness under a variety of attacks. It also represents superiority over existing algorithms.

62 citations


Proceedings ArticleDOI
04 May 2001
TL;DR: Two novel algorithms for speech pitch estimation are presented, one based on the average magnitude difference function (AMDF) and the other based on auto-correlation pitch detection algorithms (PDA).
Abstract: Two novel algorithms for speech pitch estimation are presented. One is based on the average magnitude difference function (AMDF), the other is based on auto-correlation pitch detection algorithms (PDA). Accurate and stable pitch estimation can be obtained by using these fast algorithms. The simulation results prove the effectiveness of these algorithms.

21 citations


Journal Article
TL;DR: Experimental re- sults show that the tabu search based MD algorithm can produce a better codebook than can the conventional MD algorithms.
Abstract: A maximum descent (MD) method has been proposed for vector quantization (VQ) codebook design. Compared with the traditional generalized Lloyd algorithm (GLA), the MD algorithm achieves better codebook performance with far less computation time. However, searching for the optimal partitioning hyperplane of a multidimensional cluster is a difficult problem in the MD algorithm. Three partition techniques have been pro- posed for the MD method in the literature. In this paper, a new partition technique based on the tabu search (TS) approach is presented for the MD algorithm. Experimental re- sults show that the tabu search based MD algorithm can produce a better codebook than can the conventional MD algorithms.

14 citations