Filters








4,282 Hits in 8.9 sec

Hardware Accelerator for Vector Quantization by Using Pruned Look-Up Table [chapter]

Pi-Chung Wang, Chun-Liang Lee, Hung-Yi Chang, Tung-Shou Chen
2005 Lecture Notes in Computer Science  
Vector quantization (VQ) is an elementary technique for image compression. However, searching for the nearest codeword in a codebook is time-consuming.  ...  In this paper, we propose a hardware-based scheme "Pruned Look-Up Table" (PLUT) which could prune possible codewords.  ...  Conclusion In this study, we present a new novel algorithm "PLUT" for codebook search in VQ.  ... 
doi:10.1007/11424925_105 fatcat:ae2k6m4sy5hdfi4twncq2w3g5y

Novel Video Coder Using Multiwavelets [chapter]

Sudhakar Radhakrishnan
2011 Recent Advances on Video Coding  
used for coding the frames (I-frames)  'SPIHT', 'SPECK', 'Novel scheme' is used for coding of multiwavelet coefficients  In Inter frame coding the following new schemes are introduced.  Fast algorithms  ...  Huffman coding and arithmetic coding are used widely for entropy coding of image and video data. In this chapter Huffman coding is used as the entropy coding.  ...  Novel Video Coder Using Multiwavelets, Recent Advances on Video Coding, Dr.  ... 
doi:10.5772/16787 fatcat:zdo6gmqiwjfjnh2blhmnvnbowy

Novel multivariate vector quantization for effective compression of hyperspectral imagery

Xiaohui Li, Jinchang Ren, Chunhui Zhao, Tong Qiao, Stephen Marshall
2014 Optics Communications  
2014) Novel multivariate vector quantization for effective compression of hyperspectral imagery. Optics Communications, 332. pp. 192-200.  ...  Consequently, coding and compression is needed for effective data reduction whilst maintaining the image integrity.  ...  As the full search is very time-consuming, a constrained search is usually employed to speed up this process to obtain a structured codebook.  ... 
doi:10.1016/j.optcom.2014.07.011 fatcat:dqzbjq23wzck7kikeqnce3cgzi

Finite state vector quantization with multipath tree search strategy for image/video coding

Chen-Yi Lee, Shih-Chou Juan, Yen-Juan Chao
1996 IEEE transactions on circuits and systems for video technology (Print)  
This paper presents a new vector quantization (VQ) algorithm exploiting the features of tree-search as well as finite state VQs for image/video coding.  ...  In the tree-search VQ, multiple candidates are identified for on-going search to optimally determine an index of the minimum distortion.  ...  In this novel approach, instead of waiting for the quantization of previous vectors and then selecting current state codebook to quantize input vector, we first use n e e Search Vector Quantization or  ... 
doi:10.1109/76.499837 fatcat:fgle5564ffccjcxy7nzzra6xqq

Link and Code: Fast Indexing with Graphs and Compact Regression Codes

Matthijs Douze, Alexandre Sablayrolles, Herve Jegou
2018 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition  
We encode the indexed vectors using quantization and exploit the graph structure to refine the similarity estimation.  ...  Similarity search approaches based on graph walks have recently attained outstanding speed-accuracy trade-offs, taking aside the memory requirements.  ...  For this purpose, we represent each indexed vector by i) a compact representation based on the optimized product quantization (OPQ) [17] , and ii) we refine it by a novel quantized regression from neighbors  ... 
doi:10.1109/cvpr.2018.00384 dblp:conf/cvpr/DouzeSJ18 fatcat:mgvs3qqjenbqbnigxn3wat6jnq

Link and code: Fast indexing with graphs and compact regression codes [article]

Matthijs Douze and Alexandre Sablayrolles and Hervé Jégou
2018 arXiv   pre-print
We encode the indexed vectors using quantization and exploit the graph structure to refine the similarity estimation.  ...  Similarity search approaches based on graph walks have recently attained outstanding speed-accuracy trade-offs, taking aside the memory requirements.  ...  For this purpose, we represent each indexed vector by i) a compact representation based on the optimized product quantization (OPQ) [17] , and ii) we refine it by a novel quantized regression from neighbors  ... 
arXiv:1804.09996v2 fatcat:it4fa5sob5a4tfgihaballk5py

A novel method of speech information hiding based on 3D-Magic Matrix [article]

Zhongliang Yang, Xueshun Peng, Yongfeng Huang, Chinchen Chang
2018 arXiv   pre-print
Based on multiple vector quantization characteristics of the Line Spectrum Pair (LSP) of the speech codec, this paper proposes a steganography scheme using a 3D-Magic matrix to enlarge capacity and improve  ...  A cyclically moving algorithm to construct a 3D-Magic matrix for steganography is proposed in this paper, as well as an embedding and an extracting algorithm of steganography based on the 3D-Magic matrix  ...  Moreover, we propose a method of looking up index table to speed up searching of secret.  ... 
arXiv:1809.03010v1 fatcat:stw7ikmiqfh6zbmnmicvzoqu6e

Scalar quantization for large scale image search

Wengang Zhou, Yijuan Lu, Houqiang Li, Qi Tian
2012 Proceedings of the 20th ACM international conference on Multimedia - MM '12  
With scalar quantization, a SIFT feature is quantized to a descriptive and discriminative bit-vector, of which the first tens of bits are taken out as code word.  ...  The performance of scalar quantization has been evaluated in partial-duplicate Web image search on a database of one million images.  ...  Li by NSFC general project "Intelligent Video Processing and Coding Based on Cloud Computing", and in part to Dr.  ... 
doi:10.1145/2393347.2393377 dblp:conf/mm/ZhouLLT12 fatcat:7ooq2xwp7rdq3hajjji4b5b4ye

Fractal Image Compression - A Review

Suhel Kaur, Sumeet Kaur.
2016 International Journal of Advanced Research  
Experimental results show that the visual effect is better and the average speed up ratio of proposed method over full search method is good as compare to other.  ...  They introduces an improved model integrating quantized quad trees and entropy coding used for fractal image compression.  ... 
doi:10.21474/ijar01/1128 fatcat:sxwk7qfuejh77od5kp5kiuqyru

Local Stereo Matching Using Combined Matching Cost and Adaptive Cost Aggregation

2015 KSII Transactions on Internet and Information Systems  
In this paper, a novel fractal coding algorithm with motion-vector-field-based motion estimation for depth map sequence is proposed.  ...  The PSNR of synthesized view is increased by 0.56 dB with 36.97% bit rate decrease on average compared with H.264 Full Search. And the depth encoding time is saved by up to 66.47%.  ...  Different from it, fractal image coding method is a novel technique in the image compression field using partial self-similarity of image [9] .  ... 
doi:10.3837/tiis.2015.01.013 fatcat:i6mxkea6szc4rmlbre2rnnur2a

Learning Better Encoding for Approximate Nearest Neighbor Search with Dictionary Annealing [article]

Shicong Liu, Hongtao Lu
2015 arXiv   pre-print
We introduce a novel dictionary optimization method for high-dimensional vector quantization employed in approximate nearest neighbor (ANN) search.  ...  Better codes can be learned by DA for the ANN search tasks.  ...  Product Quantization [21] is a novel vector quantization method for nearest neighbor search.  ... 
arXiv:1507.01442v1 fatcat:64deguaupbh2lci4ppvvdjnqmu

A NOVEL APPROACH OF VECTOR QUANTIZATION USING MODIFIED PARTICLE SWARM OPTIMIZATION ALGORITHM FOR GENERATING EFFICIENT CODEBOOK

M.Mary Shanthi Rani
2017 International Journal of Advanced Research in Computer Science  
This paper presents a novel approach of Modified Particle Swarm Optimization(MPSO) technique using vector quantization technique. The initial swarm is formed out of image blocks with high variance.  ...  Mostly vector quantization designs a local optimal codebook for compressing images effectively. In recent days, several optimization algorithms are used to generate global codebook.  ...  The main advantage of mutation is speed up convergence and escape local minima.  ... 
doi:10.26483/ijarcs.v8i9.5043 fatcat:v73xzvtzdzefdgudxuthdtl4iu

Compressed Histogram of Gradients: A Low-Bitrate Descriptor

Vijay Chandrasekhar, Gabriel Takacs, David M. Chen, Sam S. Tsai, Yuriy Reznik, Radek Grzeszczuk, Bernd Girod
2011 International Journal of Computer Vision  
The framework offers low complexity and has significant speed-up in the matching stage.  ...  We implement the descriptor in a mobile image retrieval system and for a database of 1 million CD, DVD and book covers, we achieve 96% retrieval accuracy using only 4 KB of data per query image.  ...  In this section, we discuss three different schemes for quantization and compression of distributions: Huffman Coding, Type Coding and Entropy Constrained Vector Quantization (ECVQ).  ... 
doi:10.1007/s11263-011-0453-z fatcat:int36ohowvhkdhucbnupw4kjy4

High Bit-Depth Seismic Data Compression: A Novel Codec Under the Framework of HEVC

Milos Radosavljevic, Zixiang Xiong, Ligang Lu, Detlef Hohl, Dejan Vukobratovic
2020 IEEE Access  
To this end, we modify almost all components of the original HEVC codec to cater for high bit-depth coding of seismic data: Lagrange multiplier used in optimization of the coding parameters has been adapted  ...  Depending on a configuration, PSNR gain goes from 3.39 dB up to 9.48 dB.  ...  TZSearch combines diamond search, raster search, and star refinement methods to speed-up encoder with negligible loss in performance by omitting some integer-precision points in the RD optimization.  ... 
doi:10.1109/access.2020.3003682 fatcat:wfnlzgd77fhgdpylfrtepd73mi

FPGA implementation of a novel, fast motion estimation algorithm for real-time video compression

S. Ramachandran, S. Srinivasan
2001 Proceedings of the 2001 ACM/SIGDA ninth international symposium on Field programmable gate arrays - FPGA '01  
The algorithm is up to 40% faster when compared to one of the fastest existing algorithms, viz., one-at-a-time step search algorithm without compromising either in the image quality or in the compression  ...  A novel block matching algorithm for motion estimation in a video frame sequence, well suited for a high performance FPGA implementation is presented in this paper.  ...  Full search algorithm [1] is a straightforward scheme which requires a large number of searches for finding a correct match for the image block being processed.  ... 
doi:10.1145/360276.360358 dblp:conf/fpga/RamachandranS01 fatcat:oowjijj7ergxfabakr2tx3zmoq
« Previous Showing results 1 — 15 out of 4,282 results