2.2: Images and Graphics Digital image representation Image formats and color models JPEG, JPEG2000 Image synthesis and graphics systems


 Molly Harris
 1 years ago
 Views:
Transcription
1 Chapter 2: Representation of Multimedia Data Audio Technology Images and Graphics Video Technology Chapter 3: Multimedia Systems Communication Aspects and Services Chapter 4: Multimedia Systems Storage Aspects 2.2: Images and Graphics Digital image representation Image formats and color models JPEG, JPEG2 Image synthesis and graphics systems Page
2 Digital Image Representation A digital image is a spatial representation of an object (2D, 3D scene or another image  real or virtual) Definition of digital image : Let I, J, K Z be a finite interval. Let G N with G < be the grey scale level / color depth (intensity value of a picture element = a pixel) of the image. () A 2Dimage is a function f: I J G (2) A 3Dimage is a function f: I J K G (3) If G = {,}, the function is a binary (or bit) image, otherwise it is a pixel image The Resolution depends on the size of I and J (and K) and describes the number of pixels per row resp. column. Example To display a 525line television picture (NTSC) without noticeable degradation with a Video Graphics Array (VGA) video controller, 64x48 pixels and 256 discrete grey levels give an array of bit numbers and a total of bit. Page 2
3 Image Representation An Image Capturing Format is specified by: spatial resolution (pixel x pixel) and color encoding (bits per pixel) Example: captured image of a DVD video with 4:3 picture size: spatial resolution: 768 x 576 pixel color encoding: bit (binary image), 8bit (color or grayscale), 24bit (colorrgb) An Image Storing Format is a 2dimensional array of values representing the image in a bitmap or pixmap, respectively. Also called raster graphics. The data of the fields of a bitmap is a binary digit, data in a pixmap may be a collection of: 3 numbers representing the intensities of red, green, and blue components of the color 3 numbers representing indices to tables of red, green and blue intensities Single numbers as index to a table of color triples Single numbers as index to any other data structures that represents a color / color system Further properties can be assigned with the whole image: width, height, depth, version, etc. Page 3
4 Color Models Lehrstuhl für Informatik 4 Why storing values for red, green, blue? Color perception by the human brain is possible through the additive composition of red, green and blue light (RGB system). The relative intensities of RGB values are transmitted to the monitor where they are reproduced at each point in time. On a computer monitor, each pixel is given as an overlay of those three image tones with different intensities by this, any color can be reproduced. But: another possible color model: CYMK When printing an image, other color components are used cyan, yellow, magenta, kontrast which in all can also reproduce all colors. Thus, many image processing software and also some image storing formats also support this model. Page 4
5 Color Models Lehrstuhl für Informatik 4 Another possibility is to use a different representation of color information by means of the YUV system where Y is the brightness (or luminance) information U and V are color difference signals (chrominance) Y, U and V are functions of R, G and B Why? As the human eye is more sensitive to brightness than to chrominance, separate brightness information from the color information and code the more important luminance with more bit than the chrominance this can save bits in the representation format. Page 5
6 Color Models Lehrstuhl für Informatik 4 Usual scheme: Y =.3 R +.59 G +. B (the color sensitivity of the human eye is considered) U = c (BY); V = c 2 (RY) c, c 2 = constants reflecting perception aspects of the human eye and the human brain! Possible Coding: YUV signal Y =.3 R +.59 G +. B U = (BY).493 = .48 R .29 G B V = (RY).877 =.64 R .57 G .96 B This is a system of 3 equations for determining Y, U, V from R, G, B or for recalculating R, G, B from Y, U, V The resolution of Y is more important than the resolution of U and V Spend more bits for Y than for U and V (Y : U : V = 4 : 2 : 2) The weighting factors in the calculation of the Y signal compensate the color perception misbalance of the human eye Page 6
7 Image Formats Lehrstuhl für Informatik 4 Lots of different image formats are in use today, e.g. GIF (Graphics Interchange Format) Compressed with some basic lossless compression techniques to 2 25% of original picture without loss. Supports 24bit colors. BMP (Bitmap) Devideindependent representation of an image: uses RGB color model, without compression. Color depth up to 24bit, additional option of specifying a color table to use. TIFF (Tagged Image File Format) Supports grey levels, RGB, and CYMK color model. Also supports lots of different compression methods. Additionally contains a descriptive part with properties a display should provide to show the image. PostScript Images are described without reference to special properties as e.g. resolution. Nice feature for printers, but hard to include into documents where you have to know the image size... JPEG (Joint Photographics Expert Group) Lots of possible compressions, mostly with loss! Page 7
8 Why Compression? Highresolution image: e.g pixel, 24 bit color depth = bit Image formats like GIF: Lossless compression (entropy encoding) for reducing data amount while keeping image quality JPEG: Lossy compression remove some image details to achieve a higher compression rate by suppressing higher frequencies Combined with lossless techniques TradeOff between file size and quality JPEG is a joint standard of ISO and ITUT In June 987, an adaptive transformation coding technique based on DCT was adopted for JPEG In 992, JPEG became a ISO international standard Page 8
9 JPEG Implementation Independent of image size Applicable to any image and pixel aspect ratio Color representation JPEG applies to color and greyscaled still images Image content Of any complexity, with any statistical characteristics Properties of JPEG Stateoftheart regarding compression factor and image quality Run on as many available standard processors as possible Compression mechanisms are available as softwareonly packages or together with specific hardware support  use of specialized hardware should speed up image decompression Encoded data stream has a fixed interchange format Fast coding is also used for video sequences: Motion JPEG Page 9
10 How could We compress? Entropy encoding Data stream is considered to be a simple digital sequence without semantics Lossless coding, decompression process regenerates the data completely Used regardless of the media s specific characteristics Examples: Runlength encoding, Huffman encoding, Arithmetic encoding Source encoding Semantics of the data are taken into account Lossy coding (encoded data are not identical with original data) Degree of compression depends on the data contents Example: Discrete Cosine Transformation (DCT) as transformation technique of the spatial domain into the twodimensional frequency domain Hybrid encoding Used by most multimedia systems Combination of entropy and source encoding Examples: JPEG, MPEG, H.26 Page
11 Compression Steps in JPEG Uncompressed Image Compressed Image Image Preparation Pixel Block, MCU Image Processing DCT Predictor Quantization (approximation of real numbers by rational numbers) Entropy Encoding Runlength Huffman Arithmetic MCU: Minimum Coded Unit DCT: Discrete Cosine Transform Page
12 Compression Steps in JPEG Image Preparation Analogtodigital conversion Image division into blocks of N N pixels Suitable structuring and ordering of image information Image Processing  Source Encoding Transformation from time to frequency domain using DCT In principle no compression itself but computation of new coefficients as input for compression process Quantization Mapping of real numbers into rational numbers (approximation) A certain loss of precision will in general be unavoidable Entropy Encoding Lossless compression of a sequential digital data stream Page 2
13 The Principle Lehrstuhl für Informatik 4 Original get rid of invisible details Transformation Quantization Encode JPEG Picture The opposite Quantization Table Huffman, Run Length Encoding JPEG Decoder Dequantization Retransformation the details cannot be reconstructed Original Without Quantization : Encoding gain would be very poor (or nonexisting) Transformation and Retransformation must be inverse to each other Task of transformation: produce a picture representation which may be encoded with a high gain of reduction Page 3
14 Variants of Image Compression JPEG is not a single format, but it can be chosen from a number of modes: Lossy sequential DCTbased mode (baseline process) Must be supported by every JPEG implementation Block, MCU, FDCT, Runlength, Huffman Expanded lossy DCTbased mode Enhancement to the baseline process by adding progressive encoding Lossless mode Low compression ratio perfect reconstruction of original image No DCT, but differential encoding by prediction Hierarchical mode Accommodates images of different resolutions Selects its algorithms from the three other modes Page 4
15 First Step: Image Preparation General image model Independence from image parameters like size and pixel ratio Description of most of the wellknown picture representations Source picture consists of to 255 components (planes) C i Components may be assigned to RGB or YUV values For example, C may be assigned to red color information Each component C i can have a different number of superpixels X i, Y i (A superpixel is a rectangle of pixels which all have the same value) Y i C C 2 C 3 C N superpixel X i C i Page 5
16 Picture Preparation  Components Resolution of the components may be different: A A 2 X B X 2 B 2 D X 3 D 2 Y Y 2 Y A N B M D M X = 2 X = 2 X Y = Y = Y 2 3 A greyscale image consists (in most cases) of a single component RGB color representation has three components with equal resolution YUV color image processing uses Y = 4 Y 2 = 4 Y 3 and X = 4 X 2 = 4 X 3 Page 6
17 Image Preparation  Dimensions Dimensions of a compressed image are defined by X (maximum of all X i ), Y (maximum of all Y i ), H i and V i (relative horizontal and vertical sampling ratios for each component i) X i Y i with H = and V = i min X j j i miny j j H i and V i must be integers in the range of to 4. This restriction is needed for the interleaving of components Example: Y = 4 pixels, X = 6 pixels Y C C 2 C 3 X = 6, Y = 4 H = 2 V = 2 X X 2 = 6, Y 2 = 2 H 2 = 2 V 2 = X 3 = 3, Y 3 = 2 H 3 = V 3 = Page 7
18 Image Preparation Data Ordering An image is divided into several components which can be processed one by one. But: how to prepare a component for processing? Observation for most parts of an image: not so much difference between the values in a rectangle of N N pixels For further processing: divide each component of an image into blocks of N N pixels Thus, the image is divided into data units (blocks): Lossless mode uses one pixel as one data unit Lossy mode uses blocks of 8 8 pixels (with 8 or 2 bits per pixel) Page 8
19 Image Preparation  Data Ordering Noninterleaved data ordering: The easiest but not the most convenient sequence of data processing Data units are processed component by component For one component, the processing order is lefttoright and toptobottom With the noninterleaved technique, a RGBencoded image is processed by: First the red component only Then the blue component, followed by the green component This is (for speed reasons) less suitable than data unit interleaving Page 9
20 Interleaved Data Ordering Often more suitable: interleave data units Interleaving means: don t process all blocks component by component, but mix data units from all components Interleaved data units of different components: Combination to Minimum Coded Units (MCUs) If all components have the same resolution MCU consists of one data unit for each component If components have different resolutions. For each component, regions of data units are determined; data units in one region are ordered lefttoright and topto bottom 2. Each component consists of the same number of regions 3. MCU consists of one region in each component Up to 4 components can be encoded in interleaved mode (according to JPEG) Each MCU consists of at most ten data units Page 2
21 Image Preparation  MCUs MCU example: four components C, C 2, C 3, C a a a a b b c c d C : H = 2, V = 2 C 2 : H 2 = 2, V 2 = C 3 : H 3 =, V 3 = 2 C 4 : H 4 =, V 4 = MCUs: 9 data units per MCU MCU = a a a a b b c c d MCU 2 = a 2 a 3 a 2 a 3 b 2 b 3 c c d MCU 3 = a 4 a 5 a 4 a 5 b 4 b 5 c 2 c 2 d 2 MCU 4 = a 2 a 2 a 3 a 3 b b c 2 c 3 d where a ij : data units of C b ij : data units of C 2 c ij : data units of C 3 d ij : data units of C 4 H V i i xi = min x y i = min y j j Page 2
22 Compression Steps in JPEG Uncompressed Image Compressed Image Image Preparation Pixel Block, MCU Image Processing DCT Quantization (approximation of real numbers by rational numbers) Entropy Encoding Runlength Huffman Arithmetic MCU: Minimum Coded Unit DCT: Discrete Cosine Transform Result of image preparation: sequence of 8 8 blocks, the order is defined by MCUs The samples are encoded with 8 bit/pixel Next step: image processing by source encoding Page 22
23 Source Encoding Transformation Encoding by transformation: Data are transformed into another mathematical domain, which is more suitable for compression. The inverse transformation must exist and must be easy to calculate Most widely known example: Fourier transformation uv m n 2 π i 2 i m ux π n vy x = y = xy F f e e = The parameters m and n indicate the granularity Most effective transformation for image compression: Discrete Cosine Transformation (DCT) m n πu(2x+ ) πv(2y+ ) uv δ nm x= y= xy 2m 2n F f cos cos = Fast Fourier Transformation (FFT) Page 23
24 Discrete Cosine Transformation Let f xy be a pixel (x,y) in the original picture. ( x N ; y N ) N N (2x + ) u π (2y + ) vπ F : = γ c c f cos cos, u,v {,...,N }, 2N 2N uv N u v xy x= y= c u u = = 2 u > f xy space domain (i.e. geometric ) F uv frequency domain (indicates how fast the information moves inside the rectangle) F is the lowest frequency in both directions, i.e. a measure of the average pixel value F uv with small total frequency (i.e u+v small) are (in general) larger than F uv with large u+v Page 24
25 Retransformation: Inverse Cosine Transformation N N (2x + ) u π (2y + ) vπ fxy = δ N cu cv Fuv cos cos u = v = 2N 2N Simplest example (just for demonstration): Let f xy = f = constant 2 N F = γ f cos( ) = γ f all other F = N N uv 2 2 x y 2 f = f = δ c c F cos(...) cos(...) N u v uv u v = δ c c F N 2 N γ N f = δ N 2 2! = if δ = γ then γ = N N N 2 N Page 25
26 Example Lehrstuhl für Informatik 4 N=8 (Standard): N=2: Fuv = cu c v (2x + ) u π (2y + ) vπ Fuv = cu cv fxy cos cos 2 x = y = 4 4 uπ vπ uπ 3πv 3π u πv 3π u 3πv = cu cv f cos cos + f cos + f cos + f cos F = [ f + f + f + f ] i.e. 2 f if fxy f 2 Transformed values can be much smaller than original values: π 3π π 3π F = f cos + f cos + f cos + f cos = f f + f f positive + 2 negative terms, i.e. if f xy f F Page 26
27 Baseline Process  Image Processing How can DCT be useful for JPEG?  F uv for larger values of u and v are often very small! First step of image processing: Samples are encoded with 8 bits/pixel; each pixel is an integer in the range [,255] Pixel values are shifted to the range [28, 27] (2complement representation) Data units of 8 x 8 pixel values are defined by f xy [28, 27], where x, y are in the range [, 7] Each value is transformed using the Forward DCT (FDCT): 7 7 (2x+ )u π (2y+ )vπ uv 4 u v xy 6 6 x= y= F = c c f cos cos for u / v = 2 where c u/v = and u,v [,7 ] otherwise Cosine expressions are independent of f xy fast calculation is possible Result: From 64 coefficients f xy we get 64 coefficients F uv in the frequency domain Page 27
28 Meaning of Coefficients Low High Transformation to frequencies Low Low 8 8 block F F + F F 2 F 23 High Low High High... Page 28
29 Baseline Process  Image Processing Coefficient F : DCcoefficient Corresponds to the lowest frequency in both dimensions Determines the fundamental color of the data unit of 64 pixels Normally the values for F are very similar in neighbored blocks Other coefficients (F uv for u+v > ): ACcoefficients Nonzero frequency in one or both dimensions Reconstruction of the image: Inverse DCT (IDCT) If FDCT and IDCT could be calculated with full precision DCT would be lossless In practice: precision is restricted (real numbers!), thus DCT is lossy different implementations of JPEG decoder may produce different images Reason for the transformation: Experience shows that many ACcoefficients have a value of almost zero, i.e. they are zero after quantization entropy encoding may lead to significant data reduction. Page 29
30 Compression Steps in JPEG Uncompressed Image Compressed Image Image Preparation Pixel Block, MCU Image Processing Predictor DCT Quantization (approximation of real numbers by rational numbers) Entropy Encoding Runlength Huffman Arithmetic Result of image processing: 8 8 blocks of DC/AC coefficients MCU: Minimum Coded Unit Till now, no compression is done this task is enabled by DCT: Discrete Cosine Transformquantization Page 3
31 Quantization Lehrstuhl für Informatik 4 Observation: F uv N smaller values N How to enforce that even more values are zero? Answer: by Quantization. Divide F uv by Quantum uv = Q uv and take the nearest integer as the result [ ] F = F / Q Q uv uv uv Dequantization: F Q = F (only an approximation of F uv ) Q * uv uv uv most values are zero Q Example: N=8; quantization step=2, Q uv =2 (u+v)+3 uv = Page 3
32 Baseline Process  Quantization Quantization process: Divide DCTcoefficient value F uv by an integer number Q uv and round the result to the nearest integer Quantization of all DCTcoefficients results in a lossy transformation some image details given by higher frequencies are cut off. JPEG application provides a table with 64 entries, each used for quantization of one DCTcoefficient each coefficient can be adjusted separately A high compression factor is achievable on the expense of image quality large quantization numbers: high data reduction but information loss increases No default values for quantization tables are specified in JPEG Page 32
33 Example Lehrstuhl für Informatik 4 Input values from exemplary greyscale image First: subtract 28 from each element Then: perform FDCT Page 33
34 Example Lehrstuhl für Informatik 4 DC coefficient FDCT Output Values (because of space reasons only the part before the comma ) Quantization Matrix for Quality Level F uv Page 34
35 Example Lehrstuhl für Informatik 4 Effects of Quantization F* uv  reconstruction after dequantization Correct value was instead of Quantized Matrix Indication of quality loss Page 35
36 Example Lehrstuhl für Informatik 4 Reconstructed image after performing the inverse DCT: Error in reconstruction: Page 36
37 Lehrstuhl für Informatik 4 Problem of Quantization Cutting of higher frequencies leads to partly wrong color information the higher the quantization coefficients, the more disturbance is in a 8 8 block Result: edges of blocks can be seen Page 37
38 Compression Steps in JPEG Uncompressed Image Compressed Image Image Preparation Pixel Block, MCU Image Processing Predictor DCT Quantization (approximation of real numbers by rational numbers) Entropy Encoding Runlength Huffman Arithmetic Result of quantization: 8 8 blocks of DC/AC coefficients with lots of zeros MCU: Minimum Coded Unit How to process and encode the data efficiently? DCT: Discrete Cosine Transform Page 38
39 Entropy Encoding Lehrstuhl für Informatik 4 Baseline Process  Entropy Encoding Initial step: map 8 8 block of transformed values F Q uv to a 64 element vector which can be further process by entropy encoding DCcoefficients determine the basic color of the data units in a frame; variation between DCcoefficients of successive frames is typically small The DCcoefficient is encoded as difference between the current coefficient and the previous one ACcoefficients: processing order uses zigzag sequence DCcoefficient ACcoefficients, higher frequencies Coefficients with lower frequencies are encoded first, followed by higher frequencies. Result: sequence of similar data bytes efficient entropy encoding Page 39
40 Example Lehrstuhl für Informatik 4 Zigzag ordering DCcoefficient: code coefficients for one block as difference to the previous one ACcoefficients: consider each block separately, order data using zigzag sequence to achieve long sequences of zerovalues: Entropy encoding: Runlength encoding of zero values of quantized ACcoefficients Huffman encoding on DC and ACcoefficients Page 4
41 Runlength Encoding Runlength encoding is a contentdependent coding technique Sequences of the same bytes are replaced by the number of their occurrences A special flag byte is used which doesn t occur in the byte stream itself Coding procedure: If a byte occurs at least four consecutive times, the number of occurrences 4 (offset = 4) is counted The compression data contain this byte followed by the special flag and the number of occurrences 4 As a consequence: Representation of 4 to 259 bytes with three bytes is possible (with corresponding compression effect) Example with! as special flag: Uncompressed sequence: Runlength coded sequence: ABCCCCCCCCDEFGGG ABC!4DEFGGG Offset of 4, since for smaller blocks there would be no reduction effect; e.g. with offset 3: D! DDD (both strings have same length) Page 4
42 Runlength Encoding Similar it is done in JPEG: The zerovalue is the only one appearing in longer sequences, thus use a more efficient coding by only compressing zero sequences: code nonzero coefficients together with their runlength, i.e. the number of zeros preceding the nonzero value Runlength {,...,5}, i.e. 4 Bit for representing the length of zero sequences Coded sequence: runlength, size, amplitude with runlength number of subsequent zerocoefficients size number of bits used for representing the following coefficient amplitude value of that following coefficient using size bits By adapting the size of representing a coefficient to its value achieves a further compression because most coefficients for higher frequencies have very small values If (runlength, size) = (5, ) then there are more than 5 zeros after each other. (,) = EoB symbol (End of Block) indicates the termination of the actual rectangle (EoB is very frequently used) Page 42
43 Example Lehrstuhl für Informatik 4 Size i Amplitude  23, 2 2,3 37,...,4 4,...,7 45,...,8 8,...,52 i +,...,2 i 2 i,...,2 i  23,...,52 52,...,23 is for instance represented by: size = 4, amplitude = The sequence is encoded by = 8 = 9 = = = 2 = 3 = 4 = 5 = 5 = 4 = 3 = 2 = = = 9 = 8 4 bits complement Representation (other representations are possible) 5,, 5,, 5, 7, zeroes 35 zeros at all, followed by a value represented using 7 bit With 7 bit, 2 is In a second step, the string may be still reduced by Huffman encoding principles Page 43
44 Huffman Encoding The Huffman code is an optimal code using the minimum number of bits for a string of data with given probabilities per character Statistical encoding method: For each character, a probability of occurrence is known by encoder and decoder Frequently occurring characters are coded with shorter strings than seldomly occurring characters Successive characters are coded independent of each other Resulting code is prefix free unique decoding is guaranteed A binary tree is constructed to determine the Huffman codewords of the characters: Leaves represent the characters that are to be encoded Nodes contain the occurrence probability of the characters belonging to the subtree Edges of the tree are assigned with and Page 44
45 Huffman Encoding Algorithm for computing the Huffman code:.) List all characters as well as their frequencies 2.) Select the two list elements with the smallest frequency and remove them from the list 3.) Make them the leafs of a tree, whereby the probabilities for both elements are being added; place the tree into the list 4.) Repeat steps 2 and 3, until the list contains only one element 5.) Mark all edges: Father left son with Father right son with The code words result from the path from the root to the leafs Page 45
46 Huffman Encoding Example Suppose that characters A, B, C, D and E occur with probabilities p(a) =.27, p(b) =.36, p(c) =.6, p(d) =.4, p(e) =.7 p(adceb) =. p(ced) =.37 p(c) =.6 p(ed) =.2 p(a) =.27 p(e) =.7 p(d) =.4 p(ab) =.63 p(b) =.36 Resulting Code: x w(x) A B C D E Page 46
47 Huffman Encoding in JPEG Coding of runlength ( {,, 5}), size ( {,, }) (i,j): i preceding zeroes ( i 5) in front of a nonzero value coded with j bits The table has 6+2 = 62 entries with significantly different occurrence probabilities EoB is relatively frequent ZRL: at least 6 successive zeroes, i.e. ZRL = (5,) Some values such as (5,) are extremely rare: 5 preceding zeros in front of a very large value is practically impossible! The same holds for most of the combinations in the table. Thus: Huffman coding of the table entries will lead to significant further compression! size runlength EoB (impossible) (,3) 2 (impossible).. (i,j).. 4 (impossible) 5 ZRL (5,) Page 47
48 Huffman Encoding in JPEG Different Huffman tables for (runlength, size) are used for different 8x8 blocks, basing on their contents Thus the coding begins with a HTN (Huffmantablenumber) The coding of amplitudes may also change from block to block Amplitude codes are stored in the preceding (runlength, size) coding table A 8 8 block thus is coded as follows: [VLC, DC coefficient, sequence of (runlength, size, amplitude) for the AC coefficients] VLC = variable length code: contains actual HTN + actual VLI (Variable Length Integer), i.e. coding method for next amplitude Page 48
49 Alternative to Huffman: Arithmetic Coding Characteristics: Achieves optimality (coding rate) as the Huffman coding Difference to Huffman: the entire data stream has an assigned probability, which consists of the probabilities of the contained characters. Coding a character takes place with consideration of all previous characters. The data are coded as an interval of real numbers between and. Each value within the interval can be used as code word. The minimum length of the code is determined by the assigned probability. Disadvantage: the data stream can be decoded only as a whole. Page 49
50 Arithmetic Coding: Example Code data ACAB with p A =.5, p B =.2, p C =.3 p A =.5 p B =.2 p C = p AA =.25 p AB =. p AC =.5 p BA p BB p BC p CA p CB p CC p ACA =.75 p ACB =.3 p ACC = p ACAA =.375 p ACAB =.5 p ACAC = ACAB can be coded by each binary number from the interval [.3875,.425), rounded up to log 2 (p ACAB ) = 6.6 i.e. 7 bit, e.g.. Page 5
51 Variants of Image Compression JPEG is not a single format, but it can be chosen from a number of modes: Lossy sequential DCTbased mode (baseline process) Presented before, but not the only method Expanded lossy DCTbased mode Enhancement to the baseline process by adding progressive encoding Lossless mode Low compression ratio perfect reconstruction of original image No DCT, but differential encoding Hierarchical mode Accommodates images of different resolutions Selects its algorithms from the three other modes Page 5
52 Variants: Expanded Lossy DCTbased Mode With sequential encoding as in the baseline process the whole image is coded and decoded in a single run. An alternative to sequential encoding is progressive encoding, done in the entropy encoding step. Two alternatives for progressive encoding are possible: Spectral selection At first, coefficients of low frequencies are passed to entropy encoding, coefficients of higher frequencies are processed in successive runs Successive approximation All coefficients are transferred in one run, but mostsignificant bits are encoded prior to lesssignificant bits. 2 possible coding alternatives in the expanded mode: Using sequential encoding, spectral selection, or successive approximation (3 variants) Using Huffman or Arithmetic encoding (2 variants) Using 8 or 2 bits for representing the samples (2 variants) Most popular mode: sequential display mode with 8 bits/sample and Huffman encoding Page 52
53 Expanded Lossy DCTbased Mode (Example) Sequential encoding: image is coded and decoded in a single run Step Step 2 Step 3 Progressive encoding: image is coded and decoded in refining steps Step Step 2 Step 3 Page 53
54 Variants: Lossless Mode Lossless mode uses differential encoding (Differential encoding is also known as prediction or relative encoding) Sequence of characters whose values are different from zero, but which do not differ much. Calculate only the difference wrt. the previous value (used also for DCcoefficients) Differential encoding for still images: Avoid using DCT/quantization Instead: calculation of differences between nearby pixels or pixel groups Edges are represented by large values Areas with similar luminance and chrominance are represented by small values Homogenous area is represented by a large number of zeros further compression with runlength encoding is possible as for DCT Page 54
55 Variants: Lossless Mode Uses data units of single pixels for image preparation Any precision between 2 and 6 bits/pixel can be used Image processing and quantization use a predictive technique instead of transformation encoding 8 predictors are specified for each pixel X by means of a combination of the already known adjacent samples A, B, and C predictor predicted values X Uncompressed data C A B X The actual predictor should give the best approximation of x by the already known values A,B,C no prediction A 2 B 3 C 4 A+BC 5 A+(BC)/2 6 B+(AC)/2 7 (A+B)/2 Predictor Entropy encoder Compressed data The number of the chosen predictor and the difference of the prediction to the actual value are passed to entropy encoding (Huffman or Arithmetic Encoding) Example: (4,): X is exactly given by A+BC (7,): X is (A+B)/2+ Page 55
56 Variants: Hierarchical Mode The Hierarchical mode uses either the lossy DCTbased algorithms or the lossless compression technique The idea: encoding of an image at different resolutions Algorithm: Image is initially sampled at a low resolution Subsequently, the resolution is raised and the compressed image is subtracted from the previous result The process is repeated until the full resolution of the image is obtained in a compressed form Disadvantage: Requires substantially more storage capacity Advantage: Compressed image is immediately available at different resolutions scaling becomes cheap Page 56
Chapter 3: Multimedia Systems  Communication Aspects and Services Chapter 4: Multimedia Systems Storage Aspects Chapter 5: Multimedia Usage
Chapter : Basics Audio Technology Images and Graphics Video and Animation.: Images and Graphics Digital image representation Image formats and color models JPEG, JPEG Image synthesis and graphics systems
More informationIMAGE COMPRESSION. Image Compression. Why? Reducing transportation times Reducing file size. A two way event  compression and decompression
IMAGE COMPRESSION Image Compression Why? Reducing transportation times Reducing file size A two way event  compression and decompression 1 Compression categories Compression = Image coding Stillimage
More informationIMAGE COMPRESSION. Chapter  5 : (Basic)
Chapter  5 : IMAGE COMPRESSION (Basic) Q() Explain the different types of redundncies that exists in image.? (8M May6 Comp) [8M, MAY 7, ETRX] A common characteristic of most images is that the neighboring
More informationCS 335 Graphics and Multimedia. Image Compression
CS 335 Graphics and Multimedia Image Compression CCITT Image Storage and Compression Group 3: Huffmantype encoding for binary (bilevel) data: FAX Group 4: Entropy encoding without error checks of group
More informationCOMP 249 Advanced Distributed Systems Multimedia Networking. The Video Data Type Coding & Compression Basics
COMP 9 Advanced Distributed Systems Multimedia Networking The Video Data Type Coding & Compression Basics Kevin Jeffay Department of Computer Science University of North Carolina at Chapel Hill jeffay@cs.unc.edu
More informationcompression and coding ii
compression and coding ii OleJohan Skrede 03.05.2017 INF2310  Digital Image Processing Department of Informatics The Faculty of Mathematics and Natural Sciences University of Oslo After original slides
More informationRobert Matthew Buckley. Nova Southeastern University. Dr. Laszlo. MCIS625 On Line. Module 2 Graphics File Format Essay
1 Robert Matthew Buckley Nova Southeastern University Dr. Laszlo MCIS625 On Line Module 2 Graphics File Format Essay 2 JPEG COMPRESSION METHOD Joint Photographic Experts Group (JPEG) is the most commonly
More informationWhat is multimedia? Multimedia. Continuous media. Most common media types. Continuous media processing. Interactivity. What is multimedia?
Multimedia What is multimedia? Media types +Text + Graphics + Audio +Image +Video Interchange formats What is multimedia? Multimedia = many media User interaction = interactivity Script = time 1 2 Most
More informationMultimedia Communications. Transform Coding
Multimedia Communications Transform Coding Transform coding Transform coding: source output is transformed into components that are coded according to their characteristics If a sequence of inputs is transformed
More informationAnatomy of a Video Codec
Anatomy of a Video Codec The inner workings of Ogg Theora Dr. Timothy B. Terriberry Outline Introduction Video Structure Motion Compensation The DCT Transform Quantization and Coding The Loop Filter Conclusion
More informationMultimedia. What is multimedia? Media types. Interchange formats. + Text +Graphics +Audio +Image +Video. Petri Vuorimaa 1
Multimedia What is multimedia? Media types + Text +Graphics +Audio +Image +Video Interchange formats Petri Vuorimaa 1 What is multimedia? Multimedia = many media User interaction = interactivity Script
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, JulyAugust, 15 ISSN 912730 A Image Comparative Study using DCT, Fast Fourier, Wavelet Transforms and Huffman Algorithm
More information15 Data Compression 2014/9/21. Objectives After studying this chapter, the student should be able to: 151 LOSSLESS COMPRESSION
15 Data Compression Data compression implies sending or storing a smaller number of bits. Although many methods are used for this purpose, in general these methods can be divided into two broad categories:
More informationComputer Faults in JPEG Compression and Decompression Systems
Computer Faults in JPEG Compression and Decompression Systems A proposal submitted in partial fulfillment of the requirements for the qualifying exam. Cung Nguyen Electrical and Computer Engineering University
More information06/12/2017. Image compression. Image compression. Image compression. Image compression. Coding redundancy: image 1 has four gray levels
Theoretical size of a file representing a 5k x 4k colour photograph: 5000 x 4000 x 3 = 60 MB 1 min of UHD tv movie: 3840 x 2160 x 3 x 24 x 60 = 36 GB 1. Exploit coding redundancy 2. Exploit spatial and
More informationJPEG. Wikipedia: Felis_silvestris_silvestris.jpg, Michael Gäbler CC BY 3.0
JPEG Wikipedia: Felis_silvestris_silvestris.jpg, Michael Gäbler CC BY 3.0 DFT vs. DCT Image Compression Image compression system Input Image MAPPER QUANTIZER SYMBOL ENCODER Compressed output Image Compression
More information7.5 Dictionarybased Coding
7.5 Dictionarybased Coding LZW uses fixedlength code words to represent variablelength strings of symbols/characters that commonly occur together, e.g., words in English text LZW encoder and decoder
More informationModule 7 VIDEO CODING AND MOTION ESTIMATION
Module 7 VIDEO CODING AND MOTION ESTIMATION Lesson 20 Basic Building Blocks & Temporal Redundancy Instructional Objectives At the end of this lesson, the students should be able to: 1. Name at least five
More informationΝΤUA. Τεχνολογία Πολυμέσων
ΝΤUA Τεχνολογία Πολυμέσων 3. Διάλεξη 3: Transform Coding Rate Distortion Theory D may be the Mean Square Error or some human perceived measure of distortion Types of Lossy Compression VBR Variable Bit
More informationFPGA Implementation of 2D DCT Architecture for JPEG Image Compression
FPGA Implementation of 2D DCT Architecture for JPEG Image Compression Prashant Chaturvedi 1, Tarun Verma 2, Rita Jain 3 1 Department of Electronics & Communication Engineering Lakshmi Narayan College
More informationThe DCT domain and JPEG
The DCT domain and JPEG CSM25 Secure Information Hiding Dr Hans Georg Schaathun University of Surrey Spring 2009 Week 3 Dr Hans Georg Schaathun The DCT domain and JPEG Spring 2009 Week 3 1 / 47 Learning
More informationLossless Image Compression having Compression Ratio Higher than JPEG
Cloud Computing & Big Data 35 Lossless Image Compression having Compression Ratio Higher than JPEG Madan Singh madan.phdce@gmail.com, Vishal Chaudhary Computer Science and Engineering, Jaipur National
More informationA NEW ENTROPY ENCODING ALGORITHM FOR IMAGE COMPRESSION USING DCT
A NEW ENTROPY ENCODING ALGORITHM FOR IMAGE COMPRESSION USING DCT D.Malarvizhi 1 Research Scholar Dept of Computer Science & Eng Alagappa University Karaikudi 630 003. Dr.K.Kuppusamy 2 Associate Professor
More informationA realtime SNR scalable transcoder for MPEG2 video streams
EINDHOVEN UNIVERSITY OF TECHNOLOGY Department of Mathematics and Computer Science A realtime SNR scalable transcoder for MPEG2 video streams by Mohammad Alkhrayshah Supervisors: Prof. J.J. Lukkien Eindhoven
More informationJPEG Syntax and Data Organization
JPEG Syntax and Data Organization Compressed image data SOI Frame EOI Frame [ Tables/ misc. [ Frame header Scan 1 [ DNL segment [ [ Scan 2 [ [Scan last [ Scan [ Tables/ misc. [ Scan header [ECS 0 RST 0
More informationJPEG IMAGE CODING WITH ADAPTIVE QUANTIZATION
JPEG IMAGE CODING WITH ADAPTIVE QUANTIZATION Julio Pons 1, Miguel Mateo 1, Josep Prades 2, Román Garcia 1 Universidad Politécnica de Valencia Spain 1 {jpons,mimateo,roman}@disca.upv.es 2 jprades@dcom.upv.es
More informationDIGITAL IMAGE PROCESSING WRITTEN REPORT ADAPTIVE IMAGE COMPRESSION TECHNIQUES FOR WIRELESS MULTIMEDIA APPLICATIONS
DIGITAL IMAGE PROCESSING WRITTEN REPORT ADAPTIVE IMAGE COMPRESSION TECHNIQUES FOR WIRELESS MULTIMEDIA APPLICATIONS SUBMITTED BY: NAVEEN MATHEW FRANCIS #105249595 INTRODUCTION The advent of new technologies
More informationRedundant Data Elimination for Image Compression and Internet Transmission using MATLAB
Redundant Data Elimination for Image Compression and Internet Transmission using MATLAB R. Challoo, I.P. Thota, and L. Challoo Texas A&M UniversityKingsville Kingsville, Texas 783638202, U.S.A. ABSTRACT
More informationIntroduction to Video Coding
Introduction to Video Coding o Motivation & Fundamentals o Principles of Video Coding o Coding Standards Special Thanks to Hans L. Cycon from FHTW Berlin for providing firsthand knowledge and much of
More informationFrom Wikipedia, the free encyclopedia
JPEG Page 1 of 9 From Wikipedia, the free encyclopedia (Redirected from JPEG file format) In computing, JPEG (pronounced JAYpeg) is a commonly used standard method of compression for photographic images.
More informationCHAPTER 6. 6 Huffman Coding Based Image Compression Using Complex Wavelet Transform. 6.3 Wavelet Transform based compression technique 106
CHAPTER 6 6 Huffman Coding Based Image Compression Using Complex Wavelet Transform Page No 6.1 Introduction 103 6.2 Compression Techniques 104 103 6.2.1 Lossless compression 105 6.2.2 Lossy compression
More informationMegapixel Video for. Part 2 of 4. Brought to You by. Presented by Video Security Consultants
rought to You by 2009 Video Security Consultants Presented by Part 2 of 4 A1 Part 2 of 4 How to Avert a Compression Depression Illustration by Jerry King While bandwidth is widening, larger video systems
More informationHYBRID TRANSFORMATION TECHNIQUE FOR IMAGE COMPRESSION
31 st July 01. Vol. 41 No. 00501 JATIT & LLS. All rights reserved. ISSN: 1998645 www.jatit.org EISSN: 18173195 HYBRID TRANSFORMATION TECHNIQUE FOR IMAGE COMPRESSION 1 SRIRAM.B, THIYAGARAJAN.S 1, Student,
More informationData Storage. Slides derived from those available on the web site of the book: Computer Science: An Overview, 11 th Edition, by J.
Data Storage Slides derived from those available on the web site of the book: Computer Science: An Overview, 11 th Edition, by J. Glenn Brookshear Copyright 2012 Pearson Education, Inc. Data Storage Bits
More informationMultimedia Signals and Systems Motion Picture Compression  MPEG
Multimedia Signals and Systems Motion Picture Compression  MPEG Kunio Takaya Electrical and Computer Engineering University of Saskatchewan March 9, 2008 MPEG video coding A simple introduction Dr. S.R.
More informationCoE4TN4 Image Processing. Chapter 8 Image Compression
CoE4TN4 Image Processing Chapter 8 Image Compression Image Compression Digital images: take huge amount of data Storage, processing and communications requirements might be impractical More efficient representation
More informationIMAGE COMPRESSION I. Week VIII Feb /25/2003 Image CompressionI 1
IMAGE COMPRESSION I Week VIII Feb 25 02/25/2003 Image CompressionI 1 Reading.. Chapter 8 Sections 8.1, 8.2 8.3 (selected topics) 8.4 (Huffman, runlength, lossless predictive) 8.5 (lossy predictive,
More informationImage Compression for Mobile Devices using Prediction and Direct Coding Approach
Image Compression for Mobile Devices using Prediction and Direct Coding Approach Joshua Rajah Devadason M.E. scholar, CIT Coimbatore, India Mr. T. Ramraj Assistant Professor, CIT Coimbatore, India Abstract
More informationVideo Codec Design Developing Image and Video Compression Systems
Video Codec Design Developing Image and Video Compression Systems Iain E. G. Richardson The Robert Gordon University, Aberdeen, UK JOHN WILEY & SONS, LTD Contents 1 Introduction l 1.1 Image and Video Compression
More informationIn the first part of our project report, published
Editor: Harrick Vin University of Texas at Austin Multimedia Broadcasting over the Internet: Part II Video Compression Borko Furht Florida Atlantic University Raymond Westwater Future Ware Jeffrey Ice
More informationCMPT 365 Multimedia Systems. Media Compression  Video
CMPT 365 Multimedia Systems Media Compression  Video Spring 2017 Edited from slides by Dr. Jiangchuan Liu CMPT365 Multimedia Systems 1 Introduction What s video? a timeordered sequence of frames, i.e.,
More informationECE 499/599 Data Compression & Information Theory. Thinh Nguyen Oregon State University
ECE 499/599 Data Compression & Information Theory Thinh Nguyen Oregon State University Adminstrivia Office Hours TTh: 23 PM Kelley Engineering Center 3115 Class homepage http://www.eecs.orst.edu/~thinhq/teaching/ece499/spring06/spring06.html
More informationEfficient design and FPGA implementation of JPEG encoder
IOSR Journal of VLSI and Signal Processing (IOSRJVSP) Volume 6, Issue 5, Ver. II (Sep.  Oct. 2016), PP 4753 eissn: 2319 4200, pissn No. : 2319 4197 www.iosrjournals.org Efficient design and FPGA implementation
More informationImage Compression. CS 6640 School of Computing University of Utah
Image Compression CS 6640 School of Computing University of Utah Compression What Reduce the amount of information (bits) needed to represent image Why Transmission Storage Preprocessing Redundant & Irrelevant
More informationApplication of Huffman Coding in Lossless Video Compression
Application of Huffman Coding in Lossless Video Compression Mahessa Ramadhana  13511077 Program Studi Teknik Informatika Sekolah Teknik Elektro dan Informatika Institut Teknologi Bandung, Jl. Ganesha
More informationImage Processing. Blending. Blending in OpenGL. Image Compositing. Blending Errors. Antialiasing Revisited Computer Graphics I Lecture 15
15462 Computer Graphics I Lecture 15 Image Processing Blending Display Color Models Filters Dithering Image Compression March 18, 23 Frank Pfenning Carnegie Mellon University http://www.cs.cmu.edu/~fp/courses/graphics/
More informationVideo Coding in H.26L
Royal Institute of Technology MASTER OF SCIENCE THESIS Video Coding in H.26L by Kristofer Dovstam April 2000 Work done at Ericsson Radio Systems AB, Kista, Sweden, Ericsson Research, Department of Audio
More informationQuo Vadis JPEG : Future of ISO /T.81
Quo Vadis JPEG : Future of ISO 109181/T.81 10918/T.81 is still the dominant standard for photographic images An entire toolchain exists to record, manipulate and display images encoded in this specification
More informationPipelined Fast 2D DCT Architecture for JPEG Image Compression
Pipelined Fast 2D DCT Architecture for JPEG Image Compression Luciano Volcan Agostini agostini@inf.ufrgs.br Ivan Saraiva Silva* ivan@dimap.ufrn.br *Federal University of Rio Grande do Norte DIMAp  Natal
More informationCompression; Error detection & correction
Compression; Error detection & correction compression: squeeze out redundancy to use less memory or use less network bandwidth encode the same information in fewer bits some bits carry no information some
More informationFRACTAL IMAGE COMPRESSION OF GRAYSCALE AND RGB IMAGES USING DCT WITH QUADTREE DECOMPOSITION AND HUFFMAN CODING. Moheb R. Girgis and Mohammed M.
322 FRACTAL IMAGE COMPRESSION OF GRAYSCALE AND RGB IMAGES USING DCT WITH QUADTREE DECOMPOSITION AND HUFFMAN CODING Moheb R. Girgis and Mohammed M. Talaat Abstract: Fractal image compression (FIC) is a
More informationA QUADTREE DECOMPOSITION APPROACH TO CARTOON IMAGE COMPRESSION. YiChen Tsai, MingSui Lee, Meiyin Shen and C.C. Jay Kuo
A QUADTREE DECOMPOSITION APPROACH TO CARTOON IMAGE COMPRESSION YiChen Tsai, MingSui Lee, Meiyin Shen and C.C. Jay Kuo Integrated Media Systems Center and Department of Electrical Engineering University
More informationDoes everyone have an override code?
Does everyone have an override code? Project 1 due Friday 9pm Review of Filtering Filtering in frequency domain Can be faster than filtering in spatial domain (for large filters) Can help understand effect
More informationLecture 6 Review of Lossless Coding (II)
Shujun LI (李树钧): INF1084520091 Multimedia Coding Lecture 6 Review of Lossless Coding (II) May 28, 2009 Outline Review Manual exercises on arithmetic coding and LZW dictionary coding 1 Review Lossy coding
More informationJPEG Compression Using MATLAB
JPEG Compression Using MATLAB Anurag, Sonia Rani M.Tech Student, HOD CSE CSE Department, ITS Bhiwani India ABSTRACT Creating, editing, and generating s in a very regular system today is a major priority.
More informationData Representation and Networking
Data Representation and Networking Instructor: Dmitri A. Gusev Spring 2007 CSC 120.02: Introduction to Computer Science Lecture 3, January 30, 2007 Data Representation Topics Covered in Lecture 2 (recap+)
More informationJPEG Compression/Decompression using SystemC
JPEG Compression/Decompression using SystemC COE838: SystemsonChip Design http://www.ee.ryerson.ca/~courses/coe838/ Dr. Gul N. Khan http://www.ee.ryerson.ca/~gnkhan Electrical and Computer Engineering
More informationEFFICIENT DEISGN OF LOW AREA BASED H.264 COMPRESSOR AND DECOMPRESSOR WITH H.264 INTEGER TRANSFORM
EFFICIENT DEISGN OF LOW AREA BASED H.264 COMPRESSOR AND DECOMPRESSOR WITH H.264 INTEGER TRANSFORM 1 KALIKI SRI HARSHA REDDY, 2 R.SARAVANAN 1 M.Tech VLSI Design, SASTRA University, Thanjavur, Tamilnadu,
More informationHuffman Code Application. Lecture7: Huffman Code. A simple application of Huffman coding of image compression which would be :
Lecture7: Huffman Code Lossless Image Compression Huffman Code Application A simple application of Huffman coding of image compression which would be : Generation of a Huffman code for the set of values
More informationThe Existing DCTBased JPEG Standard. Bernie Brower
The Existing DCTBased JPEG Standard 1 What Is JPEG? The JPEG (Joint Photographic Experts Group) committee, formed in 1986, has been chartered with the Digital compression and coding of continuoustone
More informationStatistical Image Compression using Fast Fourier Coefficients
Statistical Image Compression using Fast Fourier Coefficients M. Kanaka Reddy Research Scholar Dept.of Statistics Osmania University Hyderabad500007 V. V. Haragopal Professor Dept.of Statistics Osmania
More informationCHAPTER 4 REVERSIBLE IMAGE WATERMARKING USING BIT PLANE CODING AND LIFTING WAVELET TRANSFORM
74 CHAPTER 4 REVERSIBLE IMAGE WATERMARKING USING BIT PLANE CODING AND LIFTING WAVELET TRANSFORM Many data embedding methods use procedures that in which the original image is distorted by quite a small
More informationCS 260: Seminar in Computer Science: Multimedia Networking
CS 260: Seminar in Computer Science: Multimedia Networking Jiasi Chen Lectures: MWF 4:105pm in CHASS http://www.cs.ucr.edu/~jiasi/teaching/cs260_spring17/ Multimedia is User perception Content creation
More informationImage Coding and Data Compression
Image Coding and Data Compression Biomedical Images are of high spatial resolution and fine grayscale quantisiation Digital mammograms: 4,096x4,096 pixels with 12bit/pixel 32MB per image Volume data (CT
More informationLecture 4: Video Compression Standards (Part1) Tutorial 2 : Image/video Coding Techniques. Basic Transform coding Tutorial 2
Lecture 4: Video Compression Standards (Part1) Tutorial 2 : Image/video Coding Techniques Dr. Jian Zhang Conjoint Associate Professor NICTA & CSE UNSW COMP9519 Multimedia Systems S2 2006 jzhang@cse.unsw.edu.au
More informationVIDEO COMPRESSION. Image Compression. Multimedia File Formats. Lossy Compression. Multimedia File Formats. October 8, 2009
File Formats Lossy Compression Image Compression File Formats VIDEO COMPRESSION 121 (Basics) video := time sequence of single images frequent point of view: video compression = image compression with a
More information10.2 Video Compression with Motion Compensation 10.4 H H.263
Chapter 10 Basic Video Compression Techniques 10.11 Introduction to Video Compression 10.2 Video Compression with Motion Compensation 10.3 Search for Motion Vectors 10.4 H.261 10.5 H.263 10.6 Further Exploration
More informationPerceptual Coding. Lossless vs. lossy compression Perceptual models Selecting info to eliminate Quantization and entropy encoding
Perceptual Coding Lossless vs. lossy compression Perceptual models Selecting info to eliminate Quantization and entropy encoding Part II wrap up 6.082 Fall 2006 Perceptual Coding, Slide 1 Lossless vs.
More informationMultimedia Communications Multimedia Technologies & Applications. Prof. Dr. Abdulmotaleb El Saddik
Multimedia Communications Multimedia Technologies & Applications Prof. Dr. Abdulmotaleb El Saddik Multimedia Communications Research Laboratory School of Information Technology and Engineering University
More informationImage Manipulation in MATLAB Due Monday, July 17 at 5:00 PM
Image Manipulation in MATLAB Due Monday, July 17 at 5:00 PM 1 Instructions Labs may be done in groups of 2 or 3 (i.e., not alone). You may use any programming language you wish but MATLAB is highly suggested.
More informationMultimedia Decoder Using the Nios II Processor
Multimedia Decoder Using the Nios II Processor Third Prize Multimedia Decoder Using the Nios II Processor Institution: Participants: Instructor: Indian Institute of Science Mythri Alle, Naresh K. V., Svatantra
More information3D graphics, raster and colors CS312 Fall 2010
Computer Graphics 3D graphics, raster and colors CS312 Fall 2010 Shift in CG Application Markets 19892000 2000 1989 3D Graphics Object description 3D graphics model Visualization 2D projection that simulates
More informationChapter 1. Data Storage Pearson AddisonWesley. All rights reserved
Chapter 1 Data Storage 2007 Pearson AddisonWesley. All rights reserved Chapter 1: Data Storage 1.1 Bits and Their Storage 1.2 Main Memory 1.3 Mass Storage 1.4 Representing Information as Bit Patterns
More informationTheora Specification. Xiph.Org Foundation
Theora Specification Xiph.Org Foundation June 3, 2017 Contents 1 Introduction 1 1.1 VP3 and Theora........................... 1 1.2 Video Formats............................ 1 1.3 Classification.............................
More informationThis is not yellow. Image Files  Center for Graphics and Geometric Computing, Technion 2
1 Image Files This is not yellow Image Files  Center for Graphics and Geometric Computing, Technion 2 Common File Formats Need a standard to store images Raster data Photos Synthetic renderings Vector
More informationJ is for JPEG: Windows bitmap to JPEG baseline compression
J is for JPEG: Windows bitmap to JPEG baseline compression by Richard Dazeley (rdazeley@postoffice.utas.edu.au) Abstract JPEG baseline is one of the world s most used compression algorithms. This is because
More informationThe BestPerformance Digital Video Recorder JPEG2000 DVR V.S MPEG & MPEG4(H.264)
The BestPerformance Digital Video Recorder JPEG2000 DVR V.S MPEG & MPEG4(H.264) Many DVRs in the market But it takes brains to make the best product JPEG2000 The best picture quality in playback. Brief
More informationOperation of machine vision system
ROBOT VISION Introduction The process of extracting, characterizing and interpreting information from images. Potential application in many industrial operation. Selection from a bin or conveyer, parts
More informationData Compression. Guest lecture, SGDS Fall 2011
Data Compression Guest lecture, SGDS Fall 2011 1 Basics Lossy/lossless Alphabet compaction Compression is impossible Compression is possible RLE Variablelength codes Undecidable Pigeonholes Patterns
More informationLecture 5: Video Compression Standards (Part2) Tutorial 3 : Introduction to Histogram
Lecture 5: Video Compression Standards (Part) Tutorial 3 : Dr. Jian Zhang Conjoint Associate Professor NICTA & CSE UNSW COMP9519 Multimedia Systems S 006 jzhang@cse.unsw.edu.au Introduction to Histogram
More informationChapter 7 Multimedia Operating Systems
MODERN OPERATING SYSTEMS Third Edition ANDREW S. TANENBAUM Chapter 7 Multimedia Operating Systems Introduction To Multimedia (1) Figure 71. Video on demand using different local distribution technologies.
More informationRoll No. :... Invigilator's Signature : GRAPHICS AND MULTIMEDIA. Time Allotted : 3 Hours Full Marks : 70
Name : Roll No. :.... Invigilator's Signature :.. CS/MCA/SEM4/MCA402/2011 2011 GRAPHICS AND MULTIMEDIA Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks. Candidates
More informationAudio and video compression
Audio and video compression 4.1 introduction Unlike text and images, both audio and most video signals are continuously varying analog signals. Compression algorithms associated with digitized audio and
More informationChapter 7 Lossless Compression Algorithms
Chapter 7 Lossless Compression Algorithms 7.1 Introduction 7.2 Basics of Information Theory 7.3 RunLength Coding 7.4 VariableLength Coding (VLC) 7.5 Dictionarybased Coding 7.6 Arithmetic Coding 7.7
More informationJpeg Decoder. Baseline Sequential DCTbased
Jpeg Decoder Baseline Sequential DCTbased Baseline Sequential DCTbased Baseline Sequential DCTbased Encoding Process Color Space Conversion Subsampling Partition Encoding Flow Control Discrete Cosine
More informationOverview: motioncompensated coding
Overview: motioncompensated coding Motioncompensated prediction Motioncompensated hybrid coding Motion estimation by blockmatching Motion estimation with subpixel accuracy Power spectral density of
More informationWavelet Transform (WT) & JPEG2000
Chapter 8 Wavelet Transform (WT) & JPEG2000 8.1 A Review of WT 8.1.1 Wave vs. Wavelet [castleman] 1 01 23 45 67 8 0 100 200 300 400 500 600 Figure 8.1 Sinusoidal waves (top two) and wavelets (bottom
More information11. Image Data Analytics. Jacobs University Visualization and Computer Graphics Lab
11. Image Data Analytics Motivation Images (and even videos) have become a popular data format for storing information digitally. Data Analytics 377 Motivation Traditionally, scientific and medical imaging
More informationAbout MPEG Compression. More About LongGOP Video
About MPEG Compression HD video requires significantly more data than SD video. A single HD video frame can require up to six times more data than an SD frame. To record such large images with such a low
More informationFinite Math  Jterm Homework. Section Inverse of a Square Matrix
Section.577, 78, 79, 80 Finite Math  Jterm 017 Lecture Notes  1/19/017 Homework Section.69, 1, 1, 15, 17, 18, 1, 6, 9, 3, 37, 39, 1,, 5, 6, 55 Section 5.19, 11, 1, 13, 1, 17, 9, 30 Section.5  Inverse
More informationMultimedia Technology CHAPTER 4. Video and Animation
CHAPTER 4 Video and Animation  Both video and animation give us a sense of motion. They exploit some properties of human eye s ability of viewing pictures.  Motion video is the element of multimedia
More informationJPEG Joint Photographic Experts Group ISO/IEC JTC1/SC29/WG1 Still image compression standard Features
JPEG2000 Joint Photographic Experts Group ISO/IEC JTC1/SC29/WG1 Still image compression standard Features Improved compression efficiency (vs. JPEG) Highly scalable embedded data streams Progressive lossy
More informationHybrid Image Compression Using DWT, DCT and Huffman Coding. Techniques
Hybrid Image Compression Using DWT, DCT and Huffman Coding Techniques Veerpal kaur, Gurwinder kaur Abstract Here in this hybrid model we are going to proposed a Nobel technique which is the combination
More informationChapter 11.3 MPEG2. MPEG2: For higher quality video at a bitrate of more than 4 Mbps Defined seven profiles aimed at different applications:
Chapter 11.3 MPEG2 MPEG2: For higher quality video at a bitrate of more than 4 Mbps Defined seven profiles aimed at different applications: Simple, Main, SNR scalable, Spatially scalable, High, 4:2:2,
More informationAlgebra 1 Review. Properties of Real Numbers. Algebraic Expressions
Algebra 1 Review Properties of Real Numbers Algebraic Expressions Real Numbers Natural Numbers: 1, 2, 3, 4,.. Numbers used for counting Whole Numbers: 0, 1, 2, 3, 4,.. Natural Numbers and 0 Integers:,
More informationSPIHTBASED IMAGE ARCHIVING UNDER BIT BUDGET CONSTRAINTS
SPIHTBASED IMAGE ARCHIVING UNDER BIT BUDGET CONSTRAINTS by Yifeng He A thesis submitted in conformity with the requirements for the degree of Master of Applied Science, Graduate School of Electrical Engineering
More informationSource Coding Basics and Speech Coding. Yao Wang Polytechnic University, Brooklyn, NY11201
Source Coding Basics and Speech Coding Yao Wang Polytechnic University, Brooklyn, NY1121 http://eeweb.poly.edu/~yao Outline Why do we need to compress speech signals Basic components in a source coding
More informationFormati grafici e Multimediali WWW. Davide Rossi Aprile 2002
Formati grafici e Multimediali Davide Rossi Aprile 2002 Table of contents Part I Colors and Color Systems Still Images: Bitmaps, Vectors & Metafiles Part II Data Compression Pixel Packing, RLE, LZ, Huffman,
More informationData Compression. Media Signal Processing, Presentation 2. Presented By: Jahanzeb Farooq Michael Osadebey
Data Compression Media Signal Processing, Presentation 2 Presented By: Jahanzeb Farooq Michael Osadebey What is Data Compression? Definition Reducing the amount of data required to represent a source
More informationHuffman Coding and Position based Coding Scheme for Image Compression: An Experimental Analysis
Huffman Coding and Position based Coding Scheme for Image Compression: An Experimental Analysis Jayavrinda Vrindavanam Ph D student, Dept of E&C, NIT, Durgapur Saravanan Chandran Asst. Professor Head,
More information