Results 1 - 10 of 42,446

Table 3. The number of blocks encoded in the second pass.

in Images Coding Using Two-Pass Side-Match Finite-State Vector Quantization
by Ruey-feng Chang, Wen-jia Kuo
"... In PAGE 6: ... Table 2 shows the results before and after the second pass. Table3 shows the number of blocks encoded for each image in the second pass. The derailment rate and mean-square error of the blocks in the first pass are shown in Table 4.... ..."

Table 2. Run-time analysis of the first-pass encoding and second-pass transcoding Encoding Time Transcoding Time

in Respect My Authority
by Hung-jyh Chiou, Yuh-ruey Lee, Chia-wen Lin, Prof Chia-wen Lin
"... In PAGE 16: ... The combination of the proposed frame-level and MB- level distribution schemes can achieve the best performance stably. Table2 shows the run-time analysis of the first-pass encoding and second-pass transcoding on an Intel Pentium-III 1-GHz PC. The proposed encoder and transcoder are implemented based on the MPEG-4 public domain software.... ..."
Cited by 1

Table 4: Lossless Compression/Decompression Timing Performance (in seconds) with No Progressive Encoding

in unknown title
by unknown authors
"... In PAGE 11: ... For Barbara and Comet, ERIC achieves a compression ratio 5 to 7 percent higher than that given by the better of the two algorithms; for Gaspra, the increase is 37 percent. Timing To illustrate the particularly low complexity of ERIC, in Table4 we compare the lossless compression and decompression times obtained for the current version of ERIC on a Sun SPARCStation 10/41 for three of the sample images. The numbers given are the compression time (CT) followed by the decompression time (DT): CT/DT in seconds.... ..."

Table 2: Overall encoding processing time (seconds) for the LZ schemes

in Fast Two-Stage Lempel-Ziv Lossless Numeric Telemetry Data Compression Using a Neural Network Predictor
by Rajasvaran Logeswaran

TABLE II SECOND TEST RUN WITH H.264 ENCODER

in Noise Reduction Prefiltering for Video Compression
by I. Introduction

Table 6: Lossless Compression/Decompression Timing Performance (in seconds) With Pro- gressive Encoding

in unknown title
by unknown authors
"... In PAGE 12: ... For Barbara and Comet, ERIC achieves a compression ratio 5 to 10 percent higher than that given by the better of the two algorithms; for Gaspra, the increase is 30 percent. Timing To illustrate the low complexity of ERIC, in Table6 we compare the lossless compression and decompression times obtained for the current version of ERIC, using progressive encod- ing, on a Sun SPARCStation 10/41 for three of the sample images. The numbers given are the compression time (CT) followed by the decompression time (DT): CT/DT in seconds.... ..."

Table 3. Encoding and decoding speed comparisons (frames per second)

in A Layered Compression Scheme for Multicasting Medical Images across Heterogeneous Networks
by Anindo Banerjea, Wai-tian Tan, Avideh Zakhor
"... In PAGE 7: ... Yet, the video quality and bandwidth overhead of MPEG1 and the scalable encoder are comparable at all relevant bit-rates. Table3 shows the encoding and decoding speeds comparisons of MPEG1 (IBPB) and the scalable codec. The results were obtained using a 170 Mhz ultra sparc workstation.... ..."

Table 1 - Storage form length encoding The second and third columns give bit string lengths

in unknown title
by unknown authors

Table 3: Encoding times in seconds. Decoding of the coor- dinate data takes about one to two seconds.

in Compression of Point-Based 3D Models by Shape-Adaptive Wavelet Coding of Multi-Height Fields
by Tilo Ochotta, Dietmar Saupe

Table 2: Truth Table for Second-Order Modified Booth Encoding [35]

in High-Speed VLSI Arithmetic Units: Adders and Multipliers
by Prof Vojin G. Oklobdzija
"... In PAGE 23: ...) A modified equations (b.) obtained from the Table2 . yield simpler Booth Selector implementation than the regular case.... In PAGE 24: ...ig. 19. (a.) Regular Booth Selector (b.) Modified Booth Selector [35] The modified Booth Selector requires 10 transistors per bit as compared to the regular Booth Selector which requires 18 transistors per bit for its implementation. The modification shown in Table2 . yields 44% reduction in the transistor count for the Booth Selector of the 54X54-bit multiplier.... ..."
Results 1 - 10 of 42,446