Quantization. Furht, B., editor In Encyclopedia of Multimedia, pages 753–753. Springer US, 2008. 00000
Quantization [link]Paper  abstract   bibtex   
DefinitionQuantization is a technique used in lossy image and video compression algorithms based on DCT, DFT, or DWT.Quantization can be modeled as [1]:xq=⌊xq+0.5⌋,xq=⌊xq+0.5⌋,x_q = \textbackslashleft\textbackslashlfloor \\x\\q\ + 0.5\ \textbackslashright\textbackslashrfloor , (1)where q is a constant quantization step size, and ⌊x+0.5⌋⌊x+0.5⌋\textbackslashleft\textbackslashlfloor \x + 0.5\ \textbackslashright\textbackslashrfloor rounds x to the nearest integer xq.Dequantization can be modeled as:x′=xq×q,x′=xq×q,x' = x_q \textbackslashtimes q, (2) where x′ is the regenerated integer, which is normally not equal to x. Therefore the quantization process is lossy.Most common lossy compression algorithms first transform the original signals into a different domain such as Discrete Cosine Transform (DCT), Discrete Fourier Transform (DFT), or Discrete Wavelet Transform (DWT) domain. Then, each of the resulting coefficients is independently quantized.Quantization is being used by many robust or semi-fragile watermarking algorithms. A robust watermarking algorithm need survive the quantization process, while an ideal semi-fragile watermark ...
@incollection{furht_quantization_2008,
	title = {Quantization},
	copyright = {©2008 Springer-Verlag},
	isbn = {978-0-387-74724-8 978-0-387-78414-4},
	url = {http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_192},
	abstract = {DefinitionQuantization is a technique used in lossy image and video compression algorithms based on DCT, DFT, or DWT.Quantization can be modeled as [1]:xq=⌊xq+0.5⌋,xq=⌊xq+0.5⌋,x\_q = {\textbackslash}left{\textbackslash}lfloor \{\{x\}\{q\} + 0.5\} {\textbackslash}right{\textbackslash}rfloor , (1)where q is a constant quantization step size, and ⌊x+0.5⌋⌊x+0.5⌋{\textbackslash}left{\textbackslash}lfloor \{x + 0.5\} {\textbackslash}right{\textbackslash}rfloor rounds x to the nearest integer xq.Dequantization can be modeled as:x′=xq×q,x′=xq×q,x' = x\_q {\textbackslash}times q, (2) where x′ is the regenerated integer, which is normally not equal to x. Therefore the quantization process is lossy.Most common lossy compression algorithms first transform the original signals into a different domain such as Discrete Cosine Transform (DCT), Discrete Fourier Transform (DFT), or Discrete Wavelet Transform (DWT) domain. Then, each of the resulting coefficients is independently quantized.Quantization is being used by many robust or semi-fragile watermarking algorithms. A robust watermarking algorithm need survive the quantization process, while an ideal semi-fragile watermark ...},
	language = {en},
	urldate = {2016-05-03},
	booktitle = {Encyclopedia of {Multimedia}},
	publisher = {Springer US},
	editor = {Furht, Borko},
	year = {2008},
	note = {00000},
	pages = {753--753}
}
Downloads: 0