13 citations found. Retrieving documents...
K. Gong and L. Rowe. Parallel mpeg-1 video encoding. In Proc. Picture Coding Symposium, Sacramento, CA., September 1994. 172

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Scheduling with Dynamic Voltage/Speed Adjustment Using.. - Zhu, Melhem, Childers (2001)   (7 citations)  (Correct)

....battery operated, their power consumption needs to be managed to achieve maximum duration for minimal energy. For the applications of cable television and video conferencing, real time performance of MPEG encoding is necessary and many processing units may be used to achieve real time performance [12]. For such systems, power management can reduce energy consumption and associated costs. In multi processor real time systems, power management that adjusts processor voltage speed changes task execution time, which affects the scheduling of tasks on processors. This change may cause a violation ....

....3 467 504 a. Dependence Graph of ATR b. Execution Time for Tasks in ATR Figure 12: The Dependence Graph of ATR to Process One Frame and The Execution Time for The Tasks of ATR. Assuming up to 4 detections in one frames and 3 templates. Second, we consider the Berkeley real time MPEG 1 encoder [12]. By setting the group of pictures (GOP) as 15 with the pattern of IBBPBBPBBPBBPBB and forcing it to encode the last frame, the dependence graph to process the frames in one GOP using decoded frame as reference is shown in Figure 13a. There are three different frames in the dependence graph. The I ....

[Article contains additional citation context not shown here]

K. L. Gong and L. A. Rowe. Parallel mpeg-1 video encoding. In Proc. of 1994.


Empirical Study of Opportunities for Bit-Level Specialization in.. - Caspi   (Correct)

....access to blocks of memory, where array indexes or pointers are range limited (zero high order bits) and or strided (constant low order bits) Initial exploration with the profiling system was done with GNU s gzip 1.2. 4 [21] an LZW based compressor decompressor) and Berkeley s mpegencode suite [17] (a video compressor for the MPEG 1 standard) The bulk of experimentation was done with UCLA s MediaBench suite [29] a collection of 11 multimedia processing benchmarks including signal processing, encryption, and image manipulation tasks. The MediaBench components which were profiled include: ....

K.L. Gong and L.A. Rowe. Parallel MPEG-1 video encoding. In


A Data Flow Pattern Language - Dragos-Anton Manoles Cu (1997)   (Correct)

....from the user interface. Variants 1. This pattern is also present in [Wal94] Improvisor objects (out of band) coordinate different Composer and Transformer objects (in band) In this case, the out of band partition does not handle user interfaces. 2. The Berkeley parallel MPEG 1 encoder [GR94] is partitioned in a similar way. The outof band partition consists of master server (which schedules slave processes) decode server (which directs the transfer of encoded frames between slave processes if decoded frames are used as reference frames) and combine server (which ....

Kevin L. Gong and Lawrence A. Rowe. Parallel MPEG--1 video encoding. In Proc. Picture Coding Symposium, Sacramento, CA, September 1994.


A scalable off-line MPEG-2 video encoding scheme.. - Ahmad, Akramullah.. (2000)   (Correct)

.... is required in applications like digital library or production systems which require encoding a video sequence and storing it on a CD ROM or DVD (Digital Versatile Disk) There are two approaches to performing video compression: hardware based [1] 23] and software based [2] 3] 4] [7], 10] 11] 19] 20] 22] 24] Both approaches have their own advantages and disadvantages. A hardware approach uses a special purpose architecture, and its advantages include the ease of use and high compression speed. However, dedicated hardware is less flexible and can become obsolete. ....

K. L. Gong and L. A. Rowe, Parallel MPEG-1 Video Encoding, in Proc. of 1994 Picture Coding Symp., Sacramento, CA, Sept. 1994.


MPEG Video Encryption in Real-time Using Secret Key.. - Shi, Wang, Bhargava (1999)   (4 citations)  (Correct)

....motion vectors only. blurred picture. Anyone who found the picture interesting would rather buy the video than attack the ciphered video because the cost of buying the program is actually cheaper. 6 Experiments To test RVEA encryption results, we embedded RVEA into the Berkeley mpeg encode [3] program. We used IDEA in our RVEA implementation because IDEA is faster than DES. IDEA uses a key of 128 bits to encrypt a plaintext block of 64 bits. IDEA is generally considered to be very secure. No practical attack on it has been published. The input data is the table tennis MPEG 1 video ....

Kevin L. Gong and Lawrence A. Rowe. Parallel MPEG-1 Video Encoding. In Proceedings of the 1994 Picture Coding Symposium, September 1994.


A Scalable Approach to Continuous-Media Processing - Manolescu, Nahrstedt   (Correct)

....with different priorities. For instances where the processing partition performs heavyweight, time consuming computations, the application arranges to use the control wait states to perform computations for the processing partition. vE x a m p l e s The Berkeley parallel MPEG 1 encoder [6] is partitioned in a similar way. The control partition is I O intensive and consists of master server (which schedules slave processes) decode server (which directs the transfer of encoded frames between slave processes if decoded frames are used as reference frames) and combine server ....

K. L. Gong and L. A. Rowe. Parallel MPEG--1 video encoding. In Proc. Picture Coding Symposium, Sacramento, CA, September 1994.


Methods for Encrypting and Decrypting MPEG Video Data Efficiently - Tang (1996)   (22 citations)  (Correct)

....and MPEG) encoding and decoding procedure while achieving a considerable level of secrecy for the multimedia data being processed. We believe that our algorithms will have wide applications for multimedia commerce on the Internet. Finally, we implement our algorithms into the Berkeley MPEG encoder [5]. We conduct a series of experimental studies to test and evaluate our algorithms based on the Berkeley MPEG decoder [10] Our presentation is organized as follows. Section two 1 In this paper, we use multimedia data to refer to the digital images encoded by the MPEG 1 standard. describes the ....

....scheme by the ad hoc method (the details are given in Section 4.4) There are some special properties unique to the JPEG and MPEG encoding (decoding) process to force us to make adjustments to the permutation list. We also conduct a series of experimental studies on the software based MPEG encoder [5] and MPEG decoder [10] We adjust our algorithm according to our experimental results. After the discrete cosine transform and the quantization procedure, the coefficients of every 8x8 block has the following properties. 1. All coefficients are in the range of [ Gamma255; 255] which can be ....

[Article contains additional citation context not shown here]

K. Gong and L.A. Rowe. Parallel MPEG-1 Video Encoding. In Proceedings of the 1994 Picture Coding Symposium, September 1994.


A Portable Fault-Tolerant Parallel Software MPEG-1 Encoder - Agi, Jagannathan (1995)   (1 citation)  (Correct)

....the best vector in the first search. The logarithmic search extends the concept of the two level search to the 8 entire macroblock, beginning with the largest possible motion first and refining the search to a finer level with each search. For more details on these parameters refer to [2] [3]. 3.4. Output Format The encoder calculates a GOP at a time on a number of machines simultaneously and writes the files to the file system. As the GOPs are written to the files, the master concatenates these GOP bit streams in serial order to form the MPEG bit stream. A decoder that accepts a bit ....

....the read time to a single read per frame. It also reduces the amount of data output by the workers since the GOP is a compressed bit stream. Coding MPEG sequences using frames as their basic unit results in increased bookkeeping and data transferred between processors during interframe compression[3]. Although there is nothing inherent in our implementation that would prevent us from encoding at the picture level, we chose to encode the MPEG bit stream at the GOP level for the sake of simplicity. Currently, we are investigating the implementation of the encoder at a lower level, but the ....

K.L. Gong and L.A. Rowe. Parallel MPEG-1 video encoding. In 1994 Picture Coding Symposium, Sacramento, CA, September 1994.


Feature-Based Algorithms for Detecting and Classifying Scene.. - Zabih, Miller, Mai (1995)   (66 citations)  (Correct)

....many different scene breaks at known locations, but the video itself was shot and compressed by third parties. Finally, we created one movie, called andy, from video which we shot. We inserted several scene breaks during the editing process, and then compressed it using the Berkeley MPEG encoder [6]. The data we used is highly compressed. For example, the following table summarizes the compression parameters of several of the image sequences we used. Sequence Bits per pixel Megabits per second Dimensions clapton 0.91 .562129 160 Theta 120 spacewalk 0.82 .502259 160 Theta 120 andy 0.35 ....

K. Gong and L. A. Rowe. Parallel MPEG-1 video encoding. In Proceedings of the Picture Coding Symposium, 1994.


Study of DCT coefficient distributions - Smoot (1996)   (3 citations)  (Correct)

....active part of the images covers less than the full area, so they were clipped to the active regions for the analysis. Table 1 gives the names, sizes, video lengths, and a brief summary of each sequence. The first ten images of each clip were put through the UC Berkeley MPEG encoder (mpeg encode [11, 2]) which has been instrumented to record the exact output of the DCT algorithm. An IEEE compliant floating point implementation of the DCT was employed for these tests. These data files were analyzed to find the appropriate parameter for each distribution. Fitting the distribution to a particular ....

Kevin L. Gong. Parallel MPEG-1 video encoding. Master's thesis, University of CA at Berkeley, 1993. Substantially reporduced in PCS-94.


Video Compression and Streaming over Packet-switched Networks - Tan (2000)   Self-citation (Rowe)   (Correct)

....by changing QP alone, the input sequences are subsampled to result in lower frame rates. This input subsampling occurs when we try to compress Raider using GOP sizes of 4 and 8 and Mother using GOP size of 4 at a rate below 128 kbps. The MPEG results are generated using the Berkeley MPEG 1 encoder [49] and decoder [96] We used frame and the reconstructed frame: PSNR = 10 log 255 MPEG 4 FGS uses a non scalable MPEG 4 base layer and many fine granularity enhancement layers. The software from the University of British Columbia is used. Further information about the Berkeley MPEG ....

K. Gong and L. Rowe. Parallel mpeg-1 video encoding. In Proc. Picture Coding Symposium, Sacramento, CA., September 1994. 172


SAMPEG, a Scene Adaptive Parallel MPEG-2 Software Encoder - Farin, Mache, de With (2001)   (Correct)

No context found.

K. L. Gong and L. A. Rowe, \Parallel MPEG-1 video encoding," Picture Coding Symposium, Sacramento, CA , Sept. 1994.


Optimal Parallel MPEG Encoding - Jeffrey Moore   (Correct)

No context found.

K. L. Gong, Parallel MPEG-1 Video Encoding, MS Thesis, Department of EECS, University of California at Berkeley, May 1994, Issued as Technical Report 811.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC