|
|
|
||
Advanced course of 2D computer graphics. Main topics: 2D image composition
and transformation (including image warping and morphing),
spatial data structures, still image and video compression methods ([D]PCM,
quantization, orthogonal transforms, wavelets, JPEG, MPEG and H.261 standards).
Labs: modules for JaGrLib library in Java language.
Last update: T_KSVI (26.04.2001)
|
|
||
Student must have enough lab assignments finished (at least handed in) before going to an exam.
Lab credit requirements are explained in detail on the page: http://cgg.mff.cuni.cz/~pepca/lectures/cv/npgr007.en.php The same URL explains the grading system of the subject.
Exam can be repeated. Lab credit repetition is irrelevant. Last update: Pelikán Josef, RNDr. (15.10.2017)
|
|
||
Foley, Van Dam, Feiner, Hughes: Computer Graphics, Principles and Practice in C, Addison-Wesley, 1995
Samet H.: The Design and Analysis of Spatial Data Structures, Addison-Wesley, 1989
Bhaskaran, Konstantinides: Image and Video Compression Standards, Kluwer Academic Publishers, 1995
Hang Hseuh-Ming: Handbook of Visual Communications, Academic Press, 1995 Last update: Pelikán Josef, RNDr. (15.10.2017)
|
|
||
Exam is written and oral (basis is written, there is a possibility to call a student for short discussion over the answers).
Every topics presented at lectures can be examined (exceptions are mentioned specifically): http://cgg.mff.cuni.cz/~pepca/lectures/npgr007.current.en.php http://cgg.mff.cuni.cz/~pepca/lectures/npgr007.slides.en.php
Overall grading is based on lab credit (50-80 points) + exam points (0-100 points). Grading table - together with further details - can be found on http://cgg.mff.cuni.cz/~pepca/lectures/cv/npgr007.en.php
Student should earn enough lab credits before going to an exam. Last update: Pelikán Josef, RNDr. (15.10.2017)
|
|
||
1. operations on 2D raster images:
image composition, alpha-blending, warping, morphing, individual warping/morphing methods (triangle and spline nets, feature-based warping), MIP-map technique 2. spatial data structures: quadtree, k-d tree, BSP tree, R tree, strip tree,.. fast searching algorithms, applications (GIS, collision detection, fast ray-scene intersections) 3. still image compression: principles, mathematicak background, predictive compression, vector quantization, orthogonal transforms (Fourier, DST, DCT, ..), Wavelets, fractal compression, JPEG standard 4. video compression: prediction in video - motion estimation, standards: H.261, MPEG, H.264 AVC Last update: Pelikán Josef, RNDr. (29.12.2014)
|