A LOSSLESS INDEX CODING ALGORITHM AND VLSI DESIGN FOR VECTOR QUANTIZATION
|
|
- Dwight Porter
- 5 years ago
- Views:
Transcription
1 A LOSSLESS INDEX CODING ALGORITHM AND VLSI DESIGN FOR VECTOR QUANTIZATION Ming-Hwa Sheu, Sh-Chi Tsai and Ming-Der Shieh Dept. of Electronic Eng., National Yunlin Univ. of Science and Technology, Yunlin, Taiwan, R.O.C. Abstract This paper presents a switching-tree coding (STC) algorithm to re-encode the output codevector indexes after vector quantization. Based on the connections in index neighborhood, we construct three binary trees to allocate the optimal variable-length noiseless code for each index. Simulation results indicate that this algorithm can improve coding efficiency without introducing any extra coding distortion, as compared to conventional memoryless VQ. Besides, according the new algorithm, an efficient VLSI architecture is also derived under the requirements of low cost and high performance. The gate counts of encoder and decoder are about 5000 and 4800 respectively. After Verilog simulation, the clock rate of the whole architecture is 50MHZ by using 0.6um CMOS 1P3M technology
2 I. Introduction Vector quantization (VQ) is one of important techniques for image compression. Due to high compression ratio, VQ is widely used in various applications such as multimedia, high definition television, teleconferencing systems, and image data based management [1, 2]. Basically, VQ is one of source coding methods that maps each image block of pixels into the corresponding index based on the codebook. The transmitting index has much fewer bits than the transmitting image block. Therefore, there are various schemes have been proposed to improve the VQ performance which includes computation complexity, compression ratio and picture quality. Almost of the researchers focus on the studies of the codebook generation and vector encoding search. The LBG algorithm [3] and Kohonen Self-Organizing Maps [4] are two common schemes for codebook generation. They preprocess and classify many training image to form a set of k-dimensional codewords. For vector encoding search, the input image is first divided into a set of k-dimensional vectors (or blocks). Next, the vector is used to find the best match codeword in the existing codebook based on the minimum Euclidean distance criteria. Then, the index (address) of the best match codeword is transmitted instead of the input vector. However, it always has enormous mathematical computations when finding the best match codeword from a given codebook. To speedup the search procedure, the algorithms such as TIE [5] and DTPC [6] etc. presented the fast methods for vector encoding search based on extra precalculated data. Besides, MPS [7], ENNS [8], and DAM [9] etc proposed the efficient algorithms to improve both codebook generation and vector encoding search. In VQ system, the high quality picture will depend very strongly on the large codebook demanded. On the other hand, the larger codebook would get lower compression ratio and expand the more encoding operations. In order to improve coding efficiency, a lossless re-encoding process can be added in traditional VQ system as shown in Fig. 1. IGA [10] considered the high correlation between neighboring codevector indexes, and first proposed an effective group-search scheme to re-encode the same index. However, IGA is not suitable for VLSI implementation, since the operation of group-search is not very regular. Also, it requires extra huge memory space in both encoding or decoding operations. For instance, if the codebook size is 256 and an image is 512*512, then IGA requires 4M-bit (128*128*256) memory space to save the status map. In this paper, we propose a STC algorithm which can immediately re-encode/decode the sequencing input index with only using 1.5K-bit memory space. Then, based on the developed algorithm, a low cost VLSI architecture is deduced and implemented
3 Fig. 1 Lossless coding process II. The Switching Tree Coding Algorithm In memoryless VQ, each index is sequentially and independently mapped from the small block (4*4 pixels) which is divided form an input image. The neighbor indexes still inherit the same correlation property that exists in the corresponding adjacent blocks. As a result, many neighbor blocks may be quantized into the same index. So, four relations can be found in a tow-dimensional index map. 1. Upper-connection: the current input index is the same as the upper index. 2. Left-connection: the current input index and the left index are identical. 3. Around-connection: the current index is identical to the around index except the upper and left indexes. 4. Disconnection: the current index are fully different to all indexes in the neighbor area. Fig. 2 (a) is shown an index map where CI represents the current input index, and Fig. 2 (b) is displayed the four connections for different values of CI. Fig. 2 The correlation for the current input index - 3 -
4 Basically, the bit-width of the index depends on the codebook size. For a codebook with size of 256, the bit-width of the index is 8 (log 2 256). To compact the index data, we propose a switching-tree coding based on the above connections. First, let us introduce three connection trees as shown in Figs. 3 (a), (b), and (c). These trees have different coding results according to 4 types of connection. In Fig. 3 (a), if CI=UI (or LI), then the current input index has up(or left)-connection and is encoded as 11 (or 10). If CI belongs to around connection, the combination of the prefix code 01 and the around-search code (about 5-bit) is used to stand for the CI. The neighbor-search code will be stated in following section. For the disconnection, the prefix code 00 is added to the code of CI. The other trees also have the similar coding operations. In around connection, the current input index has to compare the previous indexes in nearby area as shown in Fig. 4. These previous indexes can be stored in the memory buffer with 32 location according to the arrow order. In order to extend the search area, all content in memory are unlike. Consequently, only one of the same indexes can be saved in the shift-register. When the CI finds the match index in the memory buffer, the CI would be encoded in the corresponding address code and plus prefix code in connection tree. While CI is to be coded, we need to check two neighbor flags, called U-flag and L-flag to decide the proper coding tree. Both L-flag and U-flag represent encoding length for the left index and up index respectively. The flag is shown in Table 1. Therefore, we should use a flag buffer to keep the flags for previous encoded indexes. The size of flag buffer is only M (where M*M is the size of the index map). Then, comparing two neighbor flags results in three cases. Case 1: U-flag = L-flag =3, Tree A is selected. Case 2: U-flag > L-flag, or U-flag = L-flag =2, Tree B is selected. Case 3: U-flag < L-flag, or U-flag = L-flag =1, Tree C is selected Based on the above mention, the whole switching tree coding algorithm is depicted in Fig. 5. Using this algorithm, Table 2 is shown the compression bit rate in different search memory size based on a 512*512 image and a coodebook of 256 codevectors
5 - 5 -
6 Fig. 3 Three switching binary trees Fig.4 The encoding of search memory - 6 -
7 III. The VLSI Architecture Design Based on our STC algorithm, the VLSI architecture for index encoding and decoding is designed and shown in Fig. 6. Next, in Fig. 7, we exhibit the simulation for indexes transmitted from the encoder to the decoder. The result shows that our proposed architecture works at clock rate of 50MHz and is enough to handle a real-time image sequence with the frame size of pixels, 30 fram/sec. The physical layout of our prototype VLSI chip has been implementing. Below is the summary of our VLSI hardware. ㆍFlag latch size: 128*2bits; ㆍShift register: 128*8 bits ㆍSearch memory size: 32 correlated indexes; ㆍGate count: about 9,800 (encoder + decoder); ㆍDesign by cell-based approach. IV. Conclusion In this paper, we present a STC algorithm that can compacts the VQ index to achieve 0.32 bit/pixel in average. In this algorithm, four types of index connections are considered, and then three binary trees are used to re-encode data alternatively. This algorithm possesses regular operation and low memory space such that it is very suitable for VLSI implementation in costless. After hardware simulation, our hardware architecture can support real time application for 1024*1024 image frame. Because the VLSI architecture has low cost and high performance, it can be embedded in traditional VQ hardware system. References [1] Y. Linde, A. Buzo, and R. M. Gray, "An algorithm for vector quantizer design," IEEE Trans. Commun., vol. COM-28, pp. 84, [2] N. M. Nasrabadi and R. B. King, "Image Coding Using Vector Quantization: A Review", IEEE Trans. Commun., vol. 36, no. 8, pp , Aug [3] A. Gersho and R. M. Gray, Vector Quantization and Signal Compression, New York: Kluwer Academic, [4] N.M. Nasrabadi and Y. Feng, "Vector quantization of images based upon the Kohonen self-organizing feature maps,: IEEE 1st Int. Conf. Neural Net.,
8 [5] C. M. Huang, Q. Bi, G. S. Stiles, and R. W. Harris, Fast full-search equivalent encoding algorithms for image compression using vector quantization," IEEE Trans. Image Processing, vol.1, no. 3, pp , [6] C. C. Chang, D. C. Lin, and T. S. Chen, "An improved VQ codebook search algorithm using principal component analysis, J. Visual Commun. Image [7] V. Ramasubramanian and K. Paliwal, "Fast K-dimensional tree algorithms for nearest neighbor search with application to vector quantization encoding," IEEE Trans. Signal Processing, vol. 40, no. 3, pp , [8] S. W. Ra and J. K. Kim, A fast mean-distance-ordered partial codebook search algorithm for image vector quantization," IEEE Trans. Circuits Syst. 1, vol. 40, no. 9, pp , [9] L. Guan and M. Kamel, "Equal-average Hyperplane partitioning method for vector quantization of image data," Pattern Recognition Lett., vol. 13, pp , [10] C. H. Hsieh, J. C Tsai, and P. C. Lu, "Moiseless Coding of VQ Index Using Index Grouping Algorithm," IEEE Trans. On Communications, VOL. 44, NO. 12 December Table 1: Coding flag Flag Coding length 1 1-bit 2 2-bit 3 > 2-bit Table. 2 Bit rates for 512*512 images A: search memory size = 8 correlated indexes; B: search memory size = 16 correlated indexes; C: search memory size = 32 correlated indexes; - 8 -
9 Fig. 5. The STC algorithm - 9 -
10 Fig. 6 VLSI architecture for VQ index encoder/decoder Fig. 7 Gate-level simulation result
Feature-Guided K-Means Algorithm for Optimal Image Vector Quantizer Design
Journal of Information Hiding and Multimedia Signal Processing c 2017 ISSN 2073-4212 Ubiquitous International Volume 8, Number 6, November 2017 Feature-Guided K-Means Algorithm for Optimal Image Vector
More informationA Image Comparative Study using DCT, Fast Fourier, Wavelet Transforms and Huffman Algorithm
International Journal of Engineering Research and General Science Volume 3, Issue 4, July-August, 15 ISSN 91-2730 A Image Comparative Study using DCT, Fast Fourier, Wavelet Transforms and Huffman Algorithm
More informationA Very Low Bit Rate Image Compressor Using Transformed Classified Vector Quantization
Informatica 29 (2005) 335 341 335 A Very Low Bit Rate Image Compressor Using Transformed Classified Vector Quantization Hsien-Wen Tseng Department of Information Management Chaoyang University of Technology
More informationKeyWords: Image Compression, LBG, ENN, BPNN, FBP.
Volume 3, Issue 6, June 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Image Compression
More informationDUE to the high computational complexity and real-time
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 15, NO. 3, MARCH 2005 445 A Memory-Efficient Realization of Cyclic Convolution and Its Application to Discrete Cosine Transform Hun-Chen
More informationA Color Image Digital Watermarking Scheme Based on SOFM
302 A Color Image Digital Watermarking Scheme Based on SOFM J. Anitha 1, S. Immanuel Alex Pandian 2 1 Asst.Prof., Dept. of Computer Science and Engineering, Karunya University, Coimbatore, Tamilnadu, India.
More informationMultilevel Compression Scheme using Vector Quantization for Image Compression
Multilevel Compression Scheme using Vector Quantization for Image Compression S.Vimala, B.Abidha, and P.Uma Abstract In this paper, we have proposed a multi level compression scheme, in which the initial
More informationDifferential Compression and Optimal Caching Methods for Content-Based Image Search Systems
Differential Compression and Optimal Caching Methods for Content-Based Image Search Systems Di Zhong a, Shih-Fu Chang a, John R. Smith b a Department of Electrical Engineering, Columbia University, NY,
More informationFace Recognition Using Vector Quantization Histogram and Support Vector Machine Classifier Rong-sheng LI, Fei-fei LEE *, Yan YAN and Qiu CHEN
2016 International Conference on Artificial Intelligence: Techniques and Applications (AITA 2016) ISBN: 978-1-60595-389-2 Face Recognition Using Vector Quantization Histogram and Support Vector Machine
More informationImage Compression with Competitive Networks and Pre-fixed Prototypes*
Image Compression with Competitive Networks and Pre-fixed Prototypes* Enrique Merida-Casermeiro^, Domingo Lopez-Rodriguez^, and Juan M. Ortiz-de-Lazcano-Lobato^ ^ Department of Applied Mathematics, University
More informationDesign of a High Speed CAVLC Encoder and Decoder with Parallel Data Path
Design of a High Speed CAVLC Encoder and Decoder with Parallel Data Path G Abhilash M.Tech Student, CVSR College of Engineering, Department of Electronics and Communication Engineering, Hyderabad, Andhra
More informationA Study on the Effect of Codebook and CodeVector Size on Image Retrieval Using Vector Quantization
Computer Science and Engineering. 0; (): -7 DOI: 0. 593/j.computer.000.0 A Study on the Effect of Codebook and CodeVector Size on Image Retrieval Using Vector Quantization B. Janet *, A. V. Reddy Dept.
More informationAN EFFICIENT CODEBOOK INITIALIZATION APPROACH FOR LBG ALGORITHM
AN EFFICIENT CODEBOOK INITIALIZATION APPROACH FOR ALGORITHM Arup Kumar Pal 1 and Anup Sar 2 1 Department of Computer Science and Engineering, NIT Jamshedpur, India arupkrpal@gmail.com 2 Department of Electronics
More informationOn the Selection of Image Compression Algorithms
On the Selection of Image Compression Algorithms Chaur- Chin Chen Department of Computer Science National Tsing Hua University Hsinchu 300, Taiwan Acknowledgments: The author thanks Professor Anil K. Jain,
More informationCompression of Image Using VHDL Simulation
Compression of Image Using VHDL Simulation 1) Prof. S. S. Mungona (Assistant Professor, Sipna COET, Amravati). 2) Vishal V. Rathi, Abstract : Maintenance of all essential information without any deletion
More informationOn the Selection of Image Compression Algorithms
On the Selection of Image Compression Algorithms Chaur-Chin Chen Department of Computer Science National Tsing Hua University Hsinchu 300, Taiwan e-mail: cchen@cs.nthu.edu.tw Abstract This paper attempts
More informationBinary vector quantizer design using soft centroids
Signal Processing: Image Communication 14 (1999) 677}681 Binary vector quantizer design using soft centroids Pasi FraK nti *, Timo Kaukoranta Department of Computer Science, University of Joensuu, P.O.
More informationA new predictive image compression scheme using histogram analysis and pattern matching
University of Wollongong Research Online University of Wollongong in Dubai - Papers University of Wollongong in Dubai 00 A new predictive image compression scheme using histogram analysis and pattern matching
More informationDigital Signal Processing
Digital Signal Processing 20 (2010) 1494 1501 Contents lists available at ScienceDirect Digital Signal Processing www.elsevier.com/locate/dsp Fast k-nearest neighbors search using modified principal axis
More informationSegmentation using Codebook Index Statistics for Vector Quantized Images
Segmentation using Codebook Index Statistics for Vector Quantized Images Hsuan T. Chang* and Jian-Tein Su Photonics and Information Laboratory Department of Electrical Engineering National Yunlin University
More informationA Review on LBG Algorithm for Image Compression
A Review on LBG Algorithm for Image Compression Ms. Asmita A.Bardekar #1, Mr. P.A.Tijare #2 # CSE Department, SGBA University, Amravati. Sipna s College of Engineering and Technology, In front of Nemani
More informationA Reversible Data Hiding Scheme for BTC- Compressed Images
IJACSA International Journal of Advanced Computer Science and Applications, A Reversible Data Hiding Scheme for BTC- Compressed Images Ching-Chiuan Lin Shih-Chieh Chen Department of Multimedia and Game
More informationFPGA based High Performance CAVLC Implementation for H.264 Video Coding
FPGA based High Performance CAVLC Implementation for H.264 Video Coding Arun Kumar Pradhan Trident Academy of Technology Bhubaneswar,India Lalit Kumar Kanoje Trident Academy of Technology Bhubaneswar,India
More informationUnified VLSI Systolic Array Design for LZ Data Compression
Unified VLSI Systolic Array Design for LZ Data Compression Shih-Arn Hwang, and Cheng-Wen Wu Dept. of EE, NTHU, Taiwan, R.O.C. IEEE Trans. on VLSI Systems Vol. 9, No.4, Aug. 2001 Pages: 489-499 Presenter:
More informationFPGA implementation of a predictive vector quantization image compression algorithm for image sensor applications
University of Wollongong Research Online Faculty of Health and Behavioural Sciences - Papers (Archive) Faculty of Science, Medicine and Health 2008 FPGA implementation of a predictive vector quantization
More informationEfficient VLSI Huffman encoder implementation and its application in high rate serial data encoding
LETTER IEICE Electronics Express, Vol.14, No.21, 1 11 Efficient VLSI Huffman encoder implementation and its application in high rate serial data encoding Rongshan Wei a) and Xingang Zhang College of Physics
More informationLOSSLESS DATA COMPRESSION AND DECOMPRESSION ALGORITHM AND ITS HARDWARE ARCHITECTURE
LOSSLESS DATA COMPRESSION AND DECOMPRESSION ALGORITHM AND ITS HARDWARE ARCHITECTURE V V V SAGAR 1 1JTO MPLS NOC BSNL BANGALORE ---------------------------------------------------------------------***----------------------------------------------------------------------
More informationRECENTLY, researches on gigabit wireless personal area
146 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 55, NO. 2, FEBRUARY 2008 An Indexed-Scaling Pipelined FFT Processor for OFDM-Based WPAN Applications Yuan Chen, Student Member, IEEE,
More informationA 4-way parallel CAVLC design for H.264/AVC 4 Kx2 K 60 fps encoder
A 4-way parallel CAVLC design for H.264/AVC 4 Kx2 K 60 fps encoder Huibo Zhong, Sha Shen, Yibo Fan a), and Xiaoyang Zeng State Key Lab of ASIC and System, Fudan University 825 Zhangheng Road, Shanghai,
More informationImplementation of SCN Based Content Addressable Memory
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 12, Issue 4, Ver. II (Jul.-Aug. 2017), PP 48-52 www.iosrjournals.org Implementation of
More informationEFFICIENT ENCODER DESIGN FOR JPEG2000 EBCOT CONTEXT FORMATION
EFFICIENT ENCODER DESIGN FOR JPEG2000 EBCOT CONTEXT FORMATION Chi-Chin Chang 1, Sau-Gee Chen 2 and Jui-Chiu Chiang 3 1 VIA Technologies, Inc. Tappei, Taiwan DouglasChang@via.com.tw 2 Department of Electronic
More informationMRT based Adaptive Transform Coder with Classified Vector Quantization (MATC-CVQ)
5 MRT based Adaptive Transform Coder with Classified Vector Quantization (MATC-CVQ) Contents 5.1 Introduction.128 5.2 Vector Quantization in MRT Domain Using Isometric Transformations and Scaling.130 5.2.1
More informationDESIGN OF PARAMETER EXTRACTOR IN LOW POWER PRECOMPUTATION BASED CONTENT ADDRESSABLE MEMORY
DESIGN OF PARAMETER EXTRACTOR IN LOW POWER PRECOMPUTATION BASED CONTENT ADDRESSABLE MEMORY Saroja pasumarti, Asst.professor, Department Of Electronics and Communication Engineering, Chaitanya Engineering
More informationCHAPTER 6 INFORMATION HIDING USING VECTOR QUANTIZATION
CHAPTER 6 INFORMATION HIDING USING VECTOR QUANTIZATION In the earlier part of the thesis different methods in the spatial domain and transform domain are studied This chapter deals with the techniques
More informationModule 8: Video Coding Basics Lecture 42: Sub-band coding, Second generation coding, 3D coding. The Lecture Contains: Performance Measures
The Lecture Contains: Performance Measures file:///d /...Ganesh%20Rana)/MY%20COURSE_Ganesh%20Rana/Prof.%20Sumana%20Gupta/FINAL%20DVSP/lecture%2042/42_1.htm[12/31/2015 11:57:52 AM] 3) Subband Coding It
More informationComparative Study on VQ with Simple GA and Ordain GA
Proceedings of the 9th WSEAS International Conference on Automatic Control, Modeling & Simulation, Istanbul, Turkey, May 27-29, 2007 204 Comparative Study on VQ with Simple GA and Ordain GA SADAF SAJJAD
More informationVideo Compression System for Online Usage Using DCT 1 S.B. Midhun Kumar, 2 Mr.A.Jayakumar M.E 1 UG Student, 2 Associate Professor
Video Compression System for Online Usage Using DCT 1 S.B. Midhun Kumar, 2 Mr.A.Jayakumar M.E 1 UG Student, 2 Associate Professor Department Electronics and Communication Engineering IFET College of Engineering
More informationArchitecture of High-throughput Context Adaptive Variable Length Coding Decoder in AVC/H.264
Architecture of High-throughput Context Adaptive Variable Length Coding Decoder in AVC/H.264 Gwo Giun (Chris) Lee, Shu-Ming Xu, Chun-Fu Chen, Ching-Jui Hsiao Department of Electrical Engineering, National
More informationVector Quantization. A Many-Core Approach
Vector Quantization A Many-Core Approach Rita Silva, Telmo Marques, Jorge Désirat, Patrício Domingues Informatics Engineering Department School of Technology and Management, Polytechnic Institute of Leiria
More information/$ IEEE
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 56, NO. 1, JANUARY 2009 81 Bit-Level Extrinsic Information Exchange Method for Double-Binary Turbo Codes Ji-Hoon Kim, Student Member,
More informationChapter 7: Competitive learning, clustering, and self-organizing maps
Chapter 7: Competitive learning, clustering, and self-organizing maps António R. C. Paiva EEL 6814 Spring 2008 Outline Competitive learning Clustering Self-Organizing Maps What is competition in neural
More informationAn Efficient Information Hiding Scheme with High Compression Rate
IJSTE - International Journal of Science Technology & Engineering Volume 3 Issue 04 October 2016 ISSN (online): 2349-784X An Efficient Information Hiding Scheme with High Compression Rate Sarita S. Kamble
More informationFast frame memory access method for H.264/AVC
Fast frame memory access method for H.264/AVC Tian Song 1a), Tomoyuki Kishida 2, and Takashi Shimamoto 1 1 Computer Systems Engineering, Department of Institute of Technology and Science, Graduate School
More informationImage Compression Algorithm and JPEG Standard
International Journal of Scientific and Research Publications, Volume 7, Issue 12, December 2017 150 Image Compression Algorithm and JPEG Standard Suman Kunwar sumn2u@gmail.com Summary. The interest in
More informationImplication of variable code block size in JPEG 2000 and its VLSI implementation
Implication of variable code block size in JPEG 2000 and its VLSI implementation Ping-Sing Tsai a, Tinku Acharya b,c a Dept. of Computer Science, Univ. of Texas Pan American, 1201 W. Univ. Dr., Edinburg,
More informationGated-Demultiplexer Tree Buffer for Low Power Using Clock Tree Based Gated Driver
Gated-Demultiplexer Tree Buffer for Low Power Using Clock Tree Based Gated Driver E.Kanniga 1, N. Imocha Singh 2,K.Selva Rama Rathnam 3 Professor Department of Electronics and Telecommunication, Bharath
More informationCarry Select Adder with High Speed and Power Efficiency
International OPEN ACCESS Journal ISSN: 2249-6645 Of Modern Engineering Research (IJMER) Carry Select Adder with High Speed and Power Efficiency V P C Reddy, Chenchela V K Reddy 2, V Ravindra Reddy 3 (ECE
More informationImage Error Concealment Based on Watermarking
Image Error Concealment Based on Watermarking Shinfeng D. Lin, Shih-Chieh Shie and Jie-Wei Chen Department of Computer Science and Information Engineering,National Dong Hwa Universuty, Hualien, Taiwan,
More informationAdaptive data hiding based on VQ compressed images
Adaptive data hiding based on VQ compressed images W.-C. Du and W.-J. Hsu Vision, Image and Signal Processing, IEE Proceedings 22 Aug. 2003 Volume: 150, Issue: 4 Page(s): 233-238 Presented by Benjamin
More informationA VLSI Architecture for H.264/AVC Variable Block Size Motion Estimation
Journal of Automation and Control Engineering Vol. 3, No. 1, February 20 A VLSI Architecture for H.264/AVC Variable Block Size Motion Estimation Dam. Minh Tung and Tran. Le Thang Dong Center of Electrical
More informationJoint Image Classification and Compression Using Hierarchical Table-Lookup Vector Quantization
Joint Image Classification and Compression Using Hierarchical Table-Lookup Vector Quantization Navin Chadda, Keren Perlmuter and Robert M. Gray Information Systems Laboratory Stanford University CA-934305
More informationVoronoi Region. K-means method for Signal Compression: Vector Quantization. Compression Formula 11/20/2013
Voronoi Region K-means method for Signal Compression: Vector Quantization Blocks of signals: A sequence of audio. A block of image pixels. Formally: vector example: (0.2, 0.3, 0.5, 0.1) A vector quantizer
More informationA reversible data hiding based on adaptive prediction technique and histogram shifting
A reversible data hiding based on adaptive prediction technique and histogram shifting Rui Liu, Rongrong Ni, Yao Zhao Institute of Information Science Beijing Jiaotong University E-mail: rrni@bjtu.edu.cn
More informationAvailable online at ScienceDirect. Procedia Computer Science 89 (2016 )
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 89 (2016 ) 778 784 Twelfth International Multi-Conference on Information Processing-2016 (IMCIP-2016) Color Image Compression
More informationVery Low Bit Rate Color Video
1 Very Low Bit Rate Color Video Coding Using Adaptive Subband Vector Quantization with Dynamic Bit Allocation Stathis P. Voukelatos and John J. Soraghan This work was supported by the GEC-Marconi Hirst
More informationRegion Segmentation for Facial Image Compression
Region Segmentation for Facial Image Compression Alexander Tropf and Douglas Chai Visual Information Processing Research Group School of Engineering and Mathematics, Edith Cowan University Perth, Australia
More informationImage Compression Using SOFM
Image Compression Using SOFM Ankit Aggarwal (03d05009) Anshu Agrawal (03005006) November 12, 2006 Why Image Compression? Application of data compression on digital images. Computer images are extremely
More informationIterative split-and-merge algorithm for VQ codebook generation published in Optical Engineering, 37 (10), pp , October 1998
Iterative split-and-merge algorithm for VQ codebook generation published in Optical Engineering, 37 (10), pp. 2726-2732, October 1998 Timo Kaukoranta 1, Pasi Fränti 2 and Olli Nevalainen 1 1 Turku Centre
More informationHigh Performance VLSI Architecture of Fractional Motion Estimation for H.264/AVC
Journal of Computational Information Systems 7: 8 (2011) 2843-2850 Available at http://www.jofcis.com High Performance VLSI Architecture of Fractional Motion Estimation for H.264/AVC Meihua GU 1,2, Ningmei
More informationImplementation and Analysis of Efficient Lossless Image Compression Algorithm
Implementation and Analysis of Efficient Lossless Image Compression Algorithm Megha S. Chaudhari 1, S.S.Shirgan 2 Department of Electronics & Telecommunication, N.B.Navale college of engineering, Solapur,
More informationLow Power VLSI Implementation of the DCT on Single
VLSI DESIGN 2000, Vol. 11, No. 4, pp. 397-403 Reprints available directly from the publisher Photocopying permitted by license only (C) 2000 OPA (Overseas Publishers Association) N.V. Published by license
More informationVERY large scale integration (VLSI) design for power
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 7, NO. 1, MARCH 1999 25 Short Papers Segmented Bus Design for Low-Power Systems J. Y. Chen, W. B. Jone, Member, IEEE, J. S. Wang,
More informationFigure (5) Kohonen Self-Organized Map
2- KOHONEN SELF-ORGANIZING MAPS (SOM) - The self-organizing neural networks assume a topological structure among the cluster units. - There are m cluster units, arranged in a one- or two-dimensional array;
More informationA Two Dimensional Median Filter Design Using Low Power Filter Architecture
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735 PP 26-31 www.iosrjournals.org A Two Dimensional Median Filter Design Using Low Power Filter Architecture
More informationHierarchical Ordering for Approximate Similarity Ranking
Hierarchical Ordering for Approximate Similarity Ranking Joselíto J. Chua and Peter E. Tischer School of Computer Science and Software Engineering Monash University, Victoria 3800, Australia jjchua@mail.csse.monash.edu.au
More informationDistributed Image compression in wireless sensor networks using intelligent methods
International Research Journal of Applied and Basic Sciences 2013 Available online at www.irjabs.com ISSN 2251-838X / Vol, 4 (7): 2011-2017 Science Explorer Publications Distributed Image compression in
More informationMoment-preserving Based Watermarking for Color Image Authentication and Recovery
2012 IACSIT Hong Kong Conferences IPCSIT vol. 30 (2012) (2012) IACSIT Press, Singapore Moment-preserving Based Watermarking for Color Image Authentication and Recovery Kuo-Cheng Liu + Information Educating
More informationHighly Secure Invertible Data Embedding Scheme Using Histogram Shifting Method
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 3 Issue 8 August, 2014 Page No. 7932-7937 Highly Secure Invertible Data Embedding Scheme Using Histogram Shifting
More informationImage Compression - An Overview Jagroop Singh 1
www.ijecs.in International Journal Of Engineering And Computer Science ISSN: 2319-7242 Volume 5 Issues 8 Aug 2016, Page No. 17535-17539 Image Compression - An Overview Jagroop Singh 1 1 Faculty DAV Institute
More informationData Hiding Scheme For Side Match Vector Quantization and Arnold Decoding
Data Hiding Scheme For Side Match Vector Quantization and Arnold Decoding Gumma Prasad 1, V.Sathya Narayanan 2 1 M.Tech Student, Dept of Electronics & Communication Engineering, Seshachala Institute of
More informationAn Accelerated Nearest Neighbor Search Method for the K-Means Clustering Algorithm
Proceedings of the Twenty-Sixth International Florida Artificial Intelligence Research Society Conference An Accelerated Nearest Neighbor Search Method for the -Means Clustering Algorithm Adam Fausett
More informationMemory-Efficient and High-Speed Line-Based Architecture for 2-D Discrete Wavelet Transform with Lifting Scheme
Proceedings of the 7th WSEAS International Conference on Multimedia Systems & Signal Processing, Hangzhou, China, April 5-7, 007 3 Memory-Efficient and High-Speed Line-Based Architecture for -D Discrete
More informationCar License Plate Detection Based on Line Segments
, pp.99-103 http://dx.doi.org/10.14257/astl.2014.58.21 Car License Plate Detection Based on Line Segments Dongwook Kim 1, Liu Zheng Dept. of Information & Communication Eng., Jeonju Univ. Abstract. In
More informationInterresolution Look-up Table for Improved Spatial Magnification of Image
Journal of Visual Communication and Image Representation 11, 360 373 (2000) doi:10.1006/jvci.1999.0451, available online at http://www.idealibrary.com on Interresolution Look-up Table for Improved Spatial
More informationAn Efficient Algorithm for Fingercode-Based Biometric Identification
An Efficient Algorithm for Fingercode-Based Biometric Identification Hong-Wei Sun, Kwok-Yan Lam, Ming Gu, and Jia-Guang Sun School of Software, Tsinghua University, Beijing 100084, PR China sunhongwei@gmail.com,
More informationSINCE arithmetic coding [1] [12] can approach the entropy
1278 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 47, NO. 9, SEPTEMBER 1999 A Fast and Efficient Lossless Data-Compression Method Jer Min Jou and Pei-Yin Chen, Member, IEEE Abstract This paper describes an
More informationCODING METHOD FOR EMBEDDING AUDIO IN VIDEO STREAM. Harri Sorokin, Jari Koivusaari, Moncef Gabbouj, and Jarmo Takala
CODING METHOD FOR EMBEDDING AUDIO IN VIDEO STREAM Harri Sorokin, Jari Koivusaari, Moncef Gabbouj, and Jarmo Takala Tampere University of Technology Korkeakoulunkatu 1, 720 Tampere, Finland ABSTRACT In
More informationLow-Complexity Block-Based Motion Estimation via One-Bit Transforms
702 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 7, NO. 4, AUGUST 1997 [8] W. Ding and B. Liu, Rate control of MPEG video coding and recording by rate-quantization modeling, IEEE
More informationIMAGE COMPRESSION TECHNIQUES
IMAGE COMPRESSION TECHNIQUES A.VASANTHAKUMARI, M.Sc., M.Phil., ASSISTANT PROFESSOR OF COMPUTER SCIENCE, JOSEPH ARTS AND SCIENCE COLLEGE, TIRUNAVALUR, VILLUPURAM (DT), TAMIL NADU, INDIA ABSTRACT A picture
More informationAn Efficient VLSI Architecture for Full-Search Block Matching Algorithms
Journal of VLSI Signal Processing 15, 275 282 (1997) c 1997 Kluwer Academic Publishers. Manufactured in The Netherlands. An Efficient VLSI Architecture for Full-Search Block Matching Algorithms CHEN-YI
More informationAREA EFFICIENT IMAGE COMPRESSION USING WAVE DECODING at CHIP LEVEL
AREA EFFICIENT IMAGE COMPRESSION USING WAVE DECODING at CHIP LEVEL K.Ambika Assistant Professor Department of Electronics and Comm. & Engg. Mohammad Sathak A.J. College of Engineering B.Thilagavathi Assistant
More informationAn Information Hiding Scheme Based on Pixel- Value-Ordering and Prediction-Error Expansion with Reversibility
An Information Hiding Scheme Based on Pixel- Value-Ordering Prediction-Error Expansion with Reversibility Ching-Chiuan Lin Department of Information Management Overseas Chinese University Taichung, Taiwan
More informationAn Associative Watermarking based Image Authentication Scheme
An Associative Watermarking based Image Authentication Scheme Lamiaa M. El Bakrawy 1, Neveen I. Ghali 1, Aboul Ella Hassanien 2 and Ajith Abraham 3, 1 Faculty of Science, Al-Azhar University, Cairo, Egypt
More informationMultiresolution image VQ compression by color codebook reordering
Multiresolution image VQ compression by color codebook reordering Christophe Charrier Olivier Lezoray Université de Caen-Basse Normandie, GREYC UMR CNRS 6072, Equipe Image 120, rue de l exode, 50000 Saint-Lô,
More informationCodebook generation for Image Compression with Simple and Ordain GA
Codebook generation for Image Compression with Simple and Ordain GA SAJJAD MOHSIN, SADAF SAJJAD COMSATS Institute of Information Technology Department of Computer Science Tobe Camp, Abbotabad PAKISTAN
More informationCarry-Free Radix-2 Subtractive Division Algorithm and Implementation of the Divider
Tamkang Journal of Science and Engineering, Vol. 3, No., pp. 29-255 (2000) 29 Carry-Free Radix-2 Subtractive Division Algorithm and Implementation of the Divider Jen-Shiun Chiang, Hung-Da Chung and Min-Show
More informationReducing/eliminating visual artifacts in HEVC by the deblocking filter.
1 Reducing/eliminating visual artifacts in HEVC by the deblocking filter. EE5359 Multimedia Processing Project Proposal Spring 2014 The University of Texas at Arlington Department of Electrical Engineering
More informationNon-Parametric Vector Quantization Algorithm
Non-Parametric Vector Quantization Algorithm 31 Non-Parametric Vector Quantization Algorithm Haemwaan Sivaraks and Athasit Surarerks, Non-members ABSTRACT Recently researches in vector quantization domain
More informationCode Transformation of DF-Expression between Bintree and Quadtree
Code Transformation of DF-Expression between Bintree and Quadtree Chin-Chen Chang*, Chien-Fa Li*, and Yu-Chen Hu** *Department of Computer Science and Information Engineering, National Chung Cheng University
More informationResearch Article A Hybrid Vector Quantization Combining a Tree Structure and a Voronoi Diagram
Mathematical Problems in Engineering Volume 201, Article ID 75873, 9 pages http://dx.doi.org/.1155/201/75873 Research Article A Hybrid Vector Quantization Combining a Tree Structure and a Voronoi Diagram
More informationCOLOR IMAGE COMPRESSION BY MOMENT-PRESERVING AND BLOCK TRUNCATION CODING TECHNIQUES?
COLOR IMAGE COMPRESSION BY MOMENT-PRESERVING AND BLOCK TRUNCATION CODING TECHNIQUES? Chen-Kuei Yang!Ja-Chen Lin, and Wen-Hsiang Tsai Department of Computer and Information Science, National Chiao Tung
More informationVector quantization based on genetic simulated annealing
Signal Processing 81 (2001) 1513}1523 Vector quantization based on genetic simulated annealing Hsiang-Cheh Huang, Jeng-Shyang Pan*, Zhe-Ming Lu, Sheng-He Sun, Hsueh-Ming Hang Department of Electronic Engineering,
More informationERROR VECTOR ROTATION USING KEKRE TRANSFORM FOR EFFICIENT CLUSTERING IN VECTOR QUANTIZATION
ERROR VECTOR ROTATION USING KEKRE TRANSFORM FOR EFFICIENT CLUSTERING IN VECTOR QUANTIZATION H. B. Kekre, Tanuja K. Sarode 2 and Jagruti K. Save 3 Professor, Mukesh Patel School of Technology Management
More informationFrequency Band Coding Mode Selection for Key Frames of Wyner-Ziv Video Coding
2009 11th IEEE International Symposium on Multimedia Frequency Band Coding Mode Selection for Key Frames of Wyner-Ziv Video Coding Ghazaleh R. Esmaili and Pamela C. Cosman Department of Electrical and
More information4. Cluster Analysis. Francesc J. Ferri. Dept. d Informàtica. Universitat de València. Febrer F.J. Ferri (Univ. València) AIRF 2/ / 1
Anàlisi d Imatges i Reconeixement de Formes Image Analysis and Pattern Recognition:. Cluster Analysis Francesc J. Ferri Dept. d Informàtica. Universitat de València Febrer 8 F.J. Ferri (Univ. València)
More informationOn the splitting method for vector quantization codebook generation
On the splitting method for vector quantization codebook generation Pasi Fränti University of Joensuu Department of Computer Science P.O. Box 111 FIN-80101 Joensuu, Finland E-mail: franti@cs.joensuu.fi
More informationIAVQ Interval-Arithmetic Vector Quantization for Image Compression
1378 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: ANALOG AND DIGITAL SIGNAL PROCESSING, VOL. 47, NO. 12, DECEMBER 2000 IAVQ Interval-Arithmetic Vector Quantization for Image Compression Sandro Ridella,
More informationReal-time and smooth scalable video streaming system with bitstream extractor intellectual property implementation
LETTER IEICE Electronics Express, Vol.11, No.5, 1 6 Real-time and smooth scalable video streaming system with bitstream extractor intellectual property implementation Liang-Hung Wang 1a), Yi-Mao Hsiao
More informationArea-Delay-Power Efficient Carry-Select Adder
Area-Delay-Power Efficient Carry-Select Adder Shruthi Nataraj 1, Karthik.L 2 1 M-Tech Student, Karavali Institute of Technology, Neermarga, Mangalore, Karnataka 2 Assistant professor, Karavali Institute
More informationA Miniature-Based Image Retrieval System
A Miniature-Based Image Retrieval System Md. Saiful Islam 1 and Md. Haider Ali 2 Institute of Information Technology 1, Dept. of Computer Science and Engineering 2, University of Dhaka 1, 2, Dhaka-1000,
More information