• 沒有找到結果。

A Genetic-Based Adaptive Threshold Selection Method for Dynamic Path Tree Structured Vector Quantization

N/A
N/A
Info
下載
Protected

Academic year: 2022

Share "A Genetic-Based Adaptive Threshold Selection Method for Dynamic Path Tree Structured Vector Quantization"

Copied!
1
0
0

加載中.... (立即查看全文)

立即下載 ( 1 頁 )

全文

(1)

題名: A Genetic-Based Adaptive Threshold Selection Method for Dynamic Path Tree Structured Vector Quantization

作者: Yu, Y. H.;Chang, C. C.;Hu, Y. C

關鍵詞: Image compression;VQ;TSVQ;Multi-path TSVQ 日期: 2005-06

上傳時間: 2009-12-17T06:58:35Z 出版者: Asia University

摘要: This paper presents an improvement method for enhancing the encoding time complexity of the dynamic path tree structured vector quantization (DPTSVQ) based on the same image quality. We call it the genetic-based adaptive threshold selection method (GATSM). DPTSVQ has successfully solved the disadvantage of the multi-path TSVQ. DPTSVQ uses a critical function and a fixed threshold to judge whether the number of search paths can be increased. However, in some cases, the fixed threshold scheme also brings the problem of increasing the encoding time.

We thus propose GATSM to solve this problem by using a set of images to train the thresholds for adapting their real practical need. Our experimental results show that the encoding time complexity of GATSM is superior to DPTSVQ based on the same image quality. In addition, we compare the image quality of GATSM with the encoding algorithm with fast comparison (EAWFC) based on the same encoding time. Comparison results show that GATSM provides better image quality than that of EAWFC.

參考文獻

立即下載 ( DOC - 1 頁 - 33.50 KB )

相關文件

Transmission eigenvalues for the electromagnetic scattering problem in pseudo-chiral media and a practical reconstruction method

In this paper, we propose a practical numerical method based on the LSM and the truncated SVD to reconstruct the support of the inhomogeneity in the acoustic equation with

Journal of Computational and Applied Mathematics

In this paper, we build a new class of neural networks based on the smoothing method for NCP introduced by Haddou and Maheux [18] using some family F of smoothing functions.

A smoothing Newton method based on the generalized Fischer–Burmeister function for MCPs

Specifically, in Section 3, we present a smoothing function of the generalized FB function, and studied some of its favorable properties, including the Jacobian consistency property;

A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs

Specifically, in Section 3, we present a smoothing function of the generalized FB function, and studied some of its favorable properties, including the Jacobian consis- tency

On the uniform edge-partition of a tree

The min-max and the max-min k-split problem are defined similarly except that the objectives are to minimize the maximum subgraph, and to maximize the minimum subgraph respectively..

Image-Based Lighting & Textures

• Li-Yi Wei, Marc Levoy, Fast Texture Synthesis Using Tree-Structured Vector Quantization, SIGGRAPH 2000. Jacobs, Nuria Oliver, Brian Curless,

Compiler I: Syntax Analysis

 The syntax analyzer takes a source text file and attempts to match it on the language grammar.  If successful, it can generate a parse tree in some structured

Principle of Inclusion and Exclusion

For your reference, the following shows an alternative proof that is based on a combinatorial method... For each x ∈ S, we show that x contributes the same count to each side of