MPEG History

Mitchell, Joan L.; Pennebaker, William B.; Fogg, Chad E.; LeGall, Didier J.

doi:10.1007/978-1-4899-4587-7_18

Cited by 4 publications

(7 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similar ideas provide the motivation for the discrete-cosinetransform-based (DCT-based) Joint Photographers Expert Group (JPEG) and Moving Pictures Expert Group (MPEG) standards [316]- [318]. These standards specify the coding to be performed on each image band, and allow for a variety of color spaces to be used.…”

Section: Color Image Codingmentioning

confidence: 99%

Digital color imaging

Sharma

Trussell

1997

IEEE Trans. on Image Process.

367

200

View full text Add to dashboard Cite

Abstract-This paper surveys current technology and research in the area of digital color imaging. In order to establish the background and lay down terminology, fundamental concepts of color perception and measurement are first presented using vector-space notation and terminology. Present-day color recording and reproduction systems are reviewed along with the common mathematical models used for representing these devices. Algorithms for processing color images for display and communication are surveyed, and a forecast of research trends is attempted. An extensive bibliography is provided.

show abstract

Section: Color Image Codingmentioning

confidence: 99%

Digital color imaging

Sharma

Trussell

1997

IEEE Trans. on Image Process.

367

200

View full text Add to dashboard Cite

show abstract

“…c) The low-priority packet arriving at time 0 with size is the only packet in the scheduler at time 0 , and so it will be transmitted before the tagged packet. Thus, the workload to be transmitted before the tagged packet with deadline can be bounded as follows (27) Combining (27) with our assumption in (26), we find that for all , and thus the tagged packet will not be transmitted before its deadline.…”

Section: Usingmentioning

confidence: 87%

“…In this experiment, we use two MPEG video traces as traffic sources: a 30-min segment of the entertainment movie Goldfinger ("bond") and 200 s of a video conference recorded using a set top camera ("settop") [34]. Both traces were encoded in software at 24 frames/s with frame size 384 288 and frame pattern IBBPBBPBBPBB [27].…”

Section: B Mpeg Examplementioning

confidence: 99%

Priority queue schedulers with approximate sorting in output-buffered switches

Liebeherr

Wrege

1999

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

All recently proposed packet-scheduling algorithms for output-buffered switches that support quality-of-service (QoS) transmit packets in some priority order, e.g., according to deadlines, virtual finishing times, eligibility times, or other time stamps that are associated with a packet. Since maintaining a sorted priority queue introduces significant overhead, much emphasis on QoS scheduler design is put on methods to simplify the task of maintaining a priority queue. In this paper, we consider an approach that attempts to approximate a sorted priority queue at an output-buffered switch. The goal is to trade off less accurate sorting for lower computational overhead. Specifically, this paper presents a scheduler that approximates the sorted queue of an earliest-deadline-first (EDF) scheduler. The approximate scheduler is implemented using a set of prioritized first-in/firstout (FIFO) queues that are periodically relabeled. The scheduler can be efficiently implemented with a fixed number of pointer manipulations, thus enabling an implementation in hardware. Necessary and sufficient conditions for the worst-case delays of the scheduler with approximate sorting are presented. Numerical examples, including traces based on MPEG video, demonstrate that in realistic scenarios, scheduling with approximate sorting is a viable option.

show abstract

“…On the left we show an original frame from the sequence, in the middle the same frame decoded after HBC compression, and on the right the visualization of the errors between the original and decompressed frames. In the error image different errors in the range of 0 to 255 are represented different colors: black (0-4), blue (5-9), red (10)(11)(12)(13)(14), and yellow (15 and up). Figure 7 shows the same examples using MPEG-2 compression with high quality settings.…”

Section: Resultsmentioning

confidence: 99%

“…Standard video compression methods, such as MPEG-2 [11] typically designate certain frames in the sequence as reference frames (intra-frames). The intra-frames are compressed and encoded using block-based DCT, similarly to lossy still image compression.…”

Section: Introductionmentioning

confidence: 99%