Fundamentals of MultimediaPearson Prentice Hall, 2004 - 560 sayfa For one-semester, advanced undergraduate/graduate-level Multimedia courses in departments of Computer Science, Engineering, CIS, and IT. This text fills a gap in the rapidly growing field of multimedia by introducing advanced programming students to the basic concepts of multimedia. Written by experienced teachers, this text evolved from materials used in class and forms the basis for all of the important topics that should be covered in a multimedia course. The material emphasizes concepts over applications and exposes students to real issues that they will encounter in the workplace. |
Kitabın içinden
26 sonuçtan 1-3 arası sonuçlar
Sayfa 53
... nodes must be wrapped around the shape nodes . The Transform node can contain Translation , Scale , and Rotation nodes . Translation simply moves the object a specific distance from its current location , which is by default the center ...
... nodes must be wrapped around the shape nodes . The Transform node can contain Translation , Scale , and Rotation nodes . Translation simply moves the object a specific distance from its current location , which is by default the center ...
Sayfa 55
... nodes . All nodes begin with " { " and end with " } " and most can contain nodes inside nodes . Special nodes , called group nodes , can cluster multiple nodes . The keyword children followed by " [ " begins the list of children nodes ...
... nodes . All nodes begin with " { " and end with " } " and most can contain nodes inside nodes . Special nodes , called group nodes , can cluster multiple nodes . The keyword children followed by " [ " begins the list of children nodes ...
Sayfa 527
... nodes . Let p [ nx / 2 ] [ ny / 2 ] be the 2D array of parent nodes . For each child node c [ i ] [ j ] do Let cn = c [ i ] [ j ] and pn = p [ i / 2 ] [ j / 2 ] . For each node cn , in the feature list of cn do Find node png in the ...
... nodes . Let p [ nx / 2 ] [ ny / 2 ] be the 2D array of parent nodes . For each child node c [ i ] [ j ] do Let cn = c [ i ] [ j ] and pn = p [ i / 2 ] [ j / 2 ] . For each node cn , in the feature list of cn do Find node png in the ...
İçindekiler
MPEG Video Coding II MPEG4 7 and Beyond | 12 |
1 | 18 |
3 | 33 |
Telif Hakkı | |
25 diğer bölüm gösterilmiyor
Diğer baskılar - Tümünü görüntüle
Sık kullanılan terimler ve kelime öbekleri
algorithm applications arithmetic coding audio bandwidth basic bitrate bitstream block byte channel Chapter chrominance coder codeword color image components data compression data rate DCT coefficients decoder defined digital video encoder enhancement layer entropy coding error example Figure filter frame frequency function gamma correction graphics HDTV header histogram Huffman coding IDCT IEEE image compression input JBIG2 JPEG JPEG-LS kbps keyframe lossless lossy macroblock masking Mbps method MIDI mode motion compensation motion vectors movie MPEG multimedia node NTSC number of bits objects output P-frame packet parameters pixels prediction protocol quantization range reconstructed result samples scalability scale scan scheme segment sequence shows signal simple sound spatial specified speech sprite standard subband symbol Table texture tone transmission transmitted types values variable-length coding VRML wavelet transform window zero
Bu kitaba yapılan referanslar
Multimedia Transcoding in Mobile and Wireless Networks Ahmad, Ashraf M.A.,Khalil, Ismail Sınırlı önizleme - 2008 |