Lossy Compression ◮ We do need exact information, in some cases. ◮ But not always. ◮ MP3, JPEG, MPEG, H.264, ... , all lossy ◮ For CAD/CAE/documents, precision does matter ◮ For entertainment, not really . . . . . .
Lossy Compression ◮ We do need exact information, in some cases. ◮ But not always. ◮ MP3, JPEG, MPEG, H.264, ... , all lossy ◮ For CAD/CAE/documents, precision does matter ◮ For entertainment, not really ◮ Just drop not-so-important info . . . . . .
Lossy Compression ◮ We do need exact information, in some cases. ◮ But not always. ◮ MP3, JPEG, MPEG, H.264, ... , all lossy ◮ For CAD/CAE/documents, precision does matter ◮ For entertainment, not really ◮ Just drop not-so-important info ◮ Usually done by quantization – Covered later . . . . . .
Outline Introduction Purpose Animation Sequence Problem Definition Theory about Compression Techniques Techniques in Animation Compression . . . . . .
Techniques in Audio Compression ◮ Basically, audio compression relies on predictor. . . . . . .
Techniques in Audio Compression ◮ Basically, audio compression relies on predictor. ◮ Idea: any magnitude is related to previous magnitude. . . . . . .
Techniques in Audio Compression ◮ Basically, audio compression relies on predictor. ◮ Idea: any magnitude is related to previous magnitude. ◮ Identical predictors work on both ends: Compression and De-compression. . . . . . .
Techniques in Audio Compression ◮ Basically, audio compression relies on predictor. ◮ Idea: any magnitude is related to previous magnitude. ◮ Identical predictors work on both ends: Compression and De-compression. ◮ Only residue is stored/transferred. . . . . . .
Techniques in Audio Compression ◮ Basically, audio compression relies on predictor. ◮ Idea: any magnitude is related to previous magnitude. ◮ Identical predictors work on both ends: Compression and De-compression. ◮ Only residue is stored/transferred. ◮ Residue should be very small. . . . . . .
Techniques in Audio Compression ◮ Basically, audio compression relies on predictor. ◮ Idea: any magnitude is related to previous magnitude. ◮ Identical predictors work on both ends: Compression and De-compression. ◮ Only residue is stored/transferred. ◮ Residue should be very small. ◮ Entropy coding could compress residue easily . . . . . .
Techniques in Audio Compression-cnt ◮ Predictors for non-lossy compression: FLAC etc. . . . . . .
Techniques in Audio Compression-cnt ◮ Predictors for non-lossy compression: FLAC etc. ◮ MP3: Just drop high-frequency signals. . . . . . .
Techniques in Audio Compression-cnt ◮ Predictors for non-lossy compression: FLAC etc. ◮ MP3: Just drop high-frequency signals. ◮ People are not picky on high-frequency sound . . . . . .
Techniques in Audio Compression-cnt ◮ Predictors for non-lossy compression: FLAC etc. ◮ MP3: Just drop high-frequency signals. ◮ People are not picky on high-frequency sound ◮ Fourier Transform . . . . . .
Techniques in JPEG ◮ Employes Discrete Cosine Transform (Specialized Fourier Transform). . . . . . .
Techniques in JPEG ◮ Employes Discrete Cosine Transform (Specialized Fourier Transform). ◮ In JPEG2000, Wavelet Transform is employed. . . . . . .
Techniques in JPEG ◮ Employes Discrete Cosine Transform (Specialized Fourier Transform). ◮ In JPEG2000, Wavelet Transform is employed. ◮ Drop High-Frequency signal (Details). . . . . . .
Techniques in JPEG ◮ Employes Discrete Cosine Transform (Specialized Fourier Transform). ◮ In JPEG2000, Wavelet Transform is employed. ◮ Drop High-Frequency signal (Details). ◮ Run-Length Encoding . . . . . .
Techniques in JPEG ◮ Employes Discrete Cosine Transform (Specialized Fourier Transform). ◮ In JPEG2000, Wavelet Transform is employed. ◮ Drop High-Frequency signal (Details). ◮ Run-Length Encoding ◮ Huffman Coding . . . . . .
Techniques in JPEG ◮ Employes Discrete Cosine Transform (Specialized Fourier Transform). ◮ In JPEG2000, Wavelet Transform is employed. ◮ Drop High-Frequency signal (Details). ◮ Run-Length Encoding ◮ Huffman Coding ◮ Lossy . . . . . .
Techniques in JPEG ◮ Employes Discrete Cosine Transform (Specialized Fourier Transform). ◮ In JPEG2000, Wavelet Transform is employed. ◮ Drop High-Frequency signal (Details). ◮ Run-Length Encoding ◮ Huffman Coding ◮ Lossy ◮ Image may be blurred, with high compression ratio. . . . . . .
Techniques in MPEG ◮ Intuitive way to store/transfer video is to transfer all images one by one (Raw Data). . . . . . .
Techniques in MPEG ◮ Intuitive way to store/transfer video is to transfer all images one by one (Raw Data). ◮ By using similarity between adjacent image, it is possible to remove redundant information, thus compress data. . . . . . .
Techniques in MPEG ◮ Intuitive way to store/transfer video is to transfer all images one by one (Raw Data). ◮ By using similarity between adjacent image, it is possible to remove redundant information, thus compress data. ◮ Another way is to “drop” some not so important information. That is, lossy compression. . . . . . .
Techniques in MPEG ◮ Intuitive way to store/transfer video is to transfer all images one by one (Raw Data). ◮ By using similarity between adjacent image, it is possible to remove redundant information, thus compress data. ◮ Another way is to “drop” some not so important information. That is, lossy compression. ◮ MPEG is based on JPEG. Both of them are lossy to gain more compression ratio. . . . . . .
Techniques in MPEG - cnt ◮ Normally, video contains 24 - 30 frams per second (Film/NTSC) . . . . . .
Techniques in MPEG - cnt ◮ Normally, video contains 24 - 30 frams per second (Film/NTSC) ◮ In-Frame Compression: JPEG . . . . . .
Techniques in MPEG - cnt ◮ Normally, video contains 24 - 30 frams per second (Film/NTSC) ◮ In-Frame Compression: JPEG ◮ I-frame and P-frame . . . . . .
Techniques in MPEG - cnt ◮ Normally, video contains 24 - 30 frams per second (Film/NTSC) ◮ In-Frame Compression: JPEG ◮ I-frame and P-frame ◮ I-frame is stored/transferred completely (high-quality) . . . . . .
Techniques in MPEG - cnt ◮ Normally, video contains 24 - 30 frams per second (Film/NTSC) ◮ In-Frame Compression: JPEG ◮ I-frame and P-frame ◮ I-frame is stored/transferred completely (high-quality) ◮ P-frame is stroed/transferred as residue (low-quality) . . . . . .
Techniques in MPEG - cnt-2 ◮ What the coder do: . . . . . .
Techniques in MPEG - cnt-2 ◮ What the coder do: ◮ Find blocks moving on screen and background . . . . . .
Techniques in MPEG - cnt-2 ◮ What the coder do: ◮ Find blocks moving on screen and background ◮ Compress background and moving objects seperately . . . . . .
Techniques in MPEG - cnt-2 ◮ What the coder do: ◮ Find blocks moving on screen and background ◮ Compress background and moving objects seperately ◮ For I-frame, just store/transfer it. . . . . . .
Techniques in MPEG - cnt-2 ◮ What the coder do: ◮ Find blocks moving on screen and background ◮ Compress background and moving objects seperately ◮ For I-frame, just store/transfer it. ◮ For P-frame, predicts movement of blocks, store/transfer residue . . . . . .
Techniques in MPEG - cnt-2 ◮ What the coder do: ◮ Find blocks moving on screen and background ◮ Compress background and moving objects seperately ◮ For I-frame, just store/transfer it. ◮ For P-frame, predicts movement of blocks, store/transfer residue ◮ For blocks, it may change. Store/transfer the residue of block . . . . . .
Techniques in MPEG - cnt-3 ◮ Finding moving blocks is hard. So encoding takes more time than decoding. . . . . . .
Techniques in MPEG - cnt-3 ◮ Finding moving blocks is hard. So encoding takes more time than decoding. ◮ That’s why different MPEG encoder may produce different compression result . . . . . .
Techniques in MPEG - cnt-3 ◮ Finding moving blocks is hard. So encoding takes more time than decoding. ◮ That’s why different MPEG encoder may produce different compression result ◮ More residue information means better quality and more bits . . . . . .
Techniques in MPEG - cnt-3 ◮ Finding moving blocks is hard. So encoding takes more time than decoding. ◮ That’s why different MPEG encoder may produce different compression result ◮ More residue information means better quality and more bits ◮ Less residue information means lower quality and less bits . . . . . .
Techniques in MPEG - cnt-3 ◮ Finding moving blocks is hard. So encoding takes more time than decoding. ◮ That’s why different MPEG encoder may produce different compression result ◮ More residue information means better quality and more bits ◮ Less residue information means lower quality and less bits ◮ That’s why action movie requires more bits. . . . . . .
Outline Introduction Purpose Animation Sequence Problem Definition Theory about Compression Techniques Techniques in Animation Compression . . . . . .
Animation Compression ◮ Predictor-Based method: . . . . . .
Animation Compression ◮ Predictor-Based method: ◮ In-frame compression: Space-only predictor . . . . . .
Animation Compression ◮ Predictor-Based method: ◮ In-frame compression: Space-only predictor ◮ That is, transfer only part of vertices. . . . . . .
Animation Compression ◮ Predictor-Based method: ◮ In-frame compression: Space-only predictor ◮ That is, transfer only part of vertices. ◮ Inter-frame compression: Time-only predictor and residue for each vertex . . . . . .
Animation Compression ◮ Predictor-Based method: ◮ In-frame compression: Space-only predictor ◮ That is, transfer only part of vertices. ◮ Inter-frame compression: Time-only predictor and residue for each vertex ◮ Combine them together: Space-Time predictor . . . . . .
Animation Compression ◮ Predictor-Based method: ◮ In-frame compression: Space-only predictor ◮ That is, transfer only part of vertices. ◮ Inter-frame compression: Time-only predictor and residue for each vertex ◮ Combine them together: Space-Time predictor ◮ Using quantization, we can compress model with degraded quality. . . . . . .
Animation Compression ◮ Predictor-Based method: ◮ In-frame compression: Space-only predictor ◮ That is, transfer only part of vertices. ◮ Inter-frame compression: Time-only predictor and residue for each vertex ◮ Combine them together: Space-Time predictor ◮ Using quantization, we can compress model with degraded quality. ◮ Assumption: Connectivity never change. . . . . . .
Animation Compression ◮ Predictor-Based method: ◮ In-frame compression: Space-only predictor ◮ That is, transfer only part of vertices. ◮ Inter-frame compression: Time-only predictor and residue for each vertex ◮ Combine them together: Space-Time predictor ◮ Using quantization, we can compress model with degraded quality. ◮ Assumption: Connectivity never change. ◮ Dynapack: Space-Time compression of the 3D animations of triangle meshes with fixed connectivity, Lawrence Ibarria et al. . . . . . .
Animation Compression-cnt ◮ Skeleton-Based method: . . . . . .
Recommend
More recommend