臺灣博碩士論文加值系統

在匹配式向量量化壓縮上的研究已經發展到參考三邊或甚至四邊匹配來找到更好的選擇。但是在有線經過的區塊仍然是找不到好的選擇或需要浪費較多位元來使解碼器選出區塊。在向量量化壓縮影像上一般都把圖片分成4x4的區塊，使得影像上的連續的線會經過好幾個區塊，而造成這些區塊在匹配式向量量化壓縮上與鄰近的區塊有很高的相關性，所以我們利用這些相似的特性可以由附近區塊猜出即將要編碼的有邊經過的區塊。本篇論文提出進階預測方法：在有限機向量量化壓縮上的改進、最小失真度預測法，並加以討論其結果所代表的意義。
另外，由於匹配式向量量化壓縮受限於區塊邊緣的連續性或相關性，如果區塊間沒有很強的連續性或是有很明顯的邊界存在此區塊中，便會選擇不出好的有限機向量量化壓縮(FSVQ)組合，所以我們將這些猜得不好的區塊另外獨立出來使用原始的向量量化壓縮法來求得其索引值，並使用四元樹編碼法或算術編碼法使得解碼器知道這些特殊的區塊位置，而這些猜的不好的區塊中有變異數很大的會對影像品質有很大的影響，由此我們可以從這些使用有限機向量量化壓縮失敗的區塊中，找尋變異數較大的，這樣可以浪費一些位元換得更高的影像品質。
最後針對有限機向量量化壓縮上的改進預測方法與回歸原始向量量化壓縮編碼法，全面性的改進，並與其他小波轉換的方法比較。

The research on Side-Match Vector Quantization is involved to adapt three sides or even four sides to obtain better case on edge block prediction. The most major improvement is the recent study on TSMVQ. However its finite state coding strategy like side match using equal weight of surrounding block sides. When a clear line goes through the blocks, adapting which two sides could make the side-match state codebook select total different state codebook. This kind of characteristics makes the neighboring blocks which goes through by a line has high correlation. We use such trait to propose an advanced prediction which can use these correlation to predict such edge blocks in less bits.
We also study the limitation of the TSMVQ, which leads us to find out there is certainly blocks is hard to predict by Three-sided side match method if the correlation in between the side is not strong. Hence selecting certain number of blocks and sending their position by quadtree coding and their Vector Quantization indices to obtain better image quality by wasting some bits as tradeof

CHAPTER 1 INTRODUCTION8
CHAPTER 2 THREE-SIDED SIDE MATCH FINITE STATE VQ10
2.1. SIDE MATCH FUNCTIONS10
2.1.1. TWO-SIDED SIDE MATCH FUNCTION11
2.1.2. THREE-SIDED AND FOUR-SIDED SIDE MATCH FUNCTIONS12
1.Four-sided side match:12
2. Three-sided side match:13
2.2. THREE-SIDED SIDE MATCH FSVQ13
2.2.1. THE SIDE MATCH CONTROL FLOW14
2.2.2. THE STATE CODEBOOK SIZES15
2.2.3. THREE-SIDED SIDE-MATCH FSVQ16
2.2.4. ENTROPY CODING OF VQ INDICES17
1. Reducing VQ indices17
2. Reducing FSVQ indices18
2.3. HIERARCHICAL THREE-SIDED SIDE MATCH VQ18
2.4. TSSMFSVQ EXPERIMENTAL SURVEY20
CHAPTER 3 REDUCED TSSM FSVQ TECHNIQUES22
3.1. BLOCK CHARACTERISTIC SURVEY22
3.2. ADVANCED PREDICTION23
3.3. DISCUSSION27
1.Implementation 1: using distortion threshold27
2.Implementation 2: FSVQ index Rearrangement27
3.4. RETURN BACK TO VQ CODING FOR BAD TSM PREDICTION29
3.5. REVISED IMPLEMENTATION #232
3.6. COMPARISON RESULTS35
CHAPTER 4 THE APPLICATION OF THE REDUCED TSSM FSVQ37
CHAP 5 CONCLUSIONS AND FUTURE WORKS38
CHAP 6 REFERENCES39

[1]Hsien-Chung ,Wei, “The dissertation: Two Issues in VQ: Very Low Bit Rate VQ Scheme and Structured Codebook Design”,2000
[2]R. M. Gray, ”Vector quantization,” IEEE ASSP Magazine, pp. 4-29, April 1984.
[3]T. Kim, “Side match and overlap match vector quantizers for images,” IEEE Trans. Image Proc., vol. 1, no. 2, pp. 170-185, April 1992.
[4]P. C. Cosman, R. M. Gray and M. Vetterli, “Vector quantization of image subbands: a review,” IEEE Trans. Image Proc., vol. 5, no. 2, pp. 202-225, Feb. 1996.
[5]Said and W. A. Pearlman, “New, fast, and efficient image codec based set partition in hierarchical trees,” IEEE Trans. Circ. & Syst. Video Tech., vol. 6, no. 3, pp. 243-249, June 1996.
[6]X. Wu and J. H. Chen, “Context modeling and entropy of wavelet coefficients for image compression,” in Proc. IEEE ICASSP, vol. 4, pp. 3097-3101, 1997.
[7]C. H. Hsieh, J. C. Tsai and P. C. Lu, “Noiseless coding of VQ index using index grouping algorithm,” IEEE Trans. Comm., vol. 44, no. 12, pp. 1643-1648, Dec. 1996.
[8]Shih-Ta Hsiang and John W. Woods, “Embedded image coding using zeroblocks of subband/wavelet coefficients and context modeling”, in Proc. IEEE ISCAS, vol. 3, 2000
[9]JPEG 2000 Related Documents in “http://www.jpeg.org/JPEG2000.htm”