### Table 4 Lossless compression performance of the prediction- and wavelet-based scalable MVCs when coding motion information generated by mesh-based ME (the average number of bytes per frame is reported)

2004

"... In PAGE 15: ... In the prediction-based scalable MVC the base-layer is restricted to 150 bytes/frame. Table4 shows the lossless compression results, while the lossy compression results are summarized in Fig. 7.... ..."

Cited by 2

### Table 2. Comparison of mean error (angle) of normal estimation. PCA: Principal Components Analysis on 3D sample points, LE: linear extrapo- lation, P: the point-based method for finding consistent neighbors, M: the mesh-based method for finding consistent neighbors.

in Reconstructing Surface Discontinuities by Intersecting Tangent Planes of Advancing Mesh Frontiers

"... In PAGE 14: ...andom points sampled on the surface. (b) Actual normals. (c-g) Normal vectors estimated by (c) PCA, (d) PCA/P, (e) LE/P, (f) PCA/M, and (g) LE/M. Table2 shows the results produced by five methods of normal estimation. The results show that both PCA/P and LE/P can produce more accurate normal estima- tion than PCA.... ..."

### Table 1. The proposed fast motion estimation algorithm.

"... In PAGE 2: ... In the following stages, CX BP C2 are used for computing BW CX . The proposed multiresolution motion estimation method algo- rithm is shown is Table1... In PAGE 4: ...0000 4. EXPERIMENTAL RESULTS The two-dimensional version of algorithm of Table1 was used for finding the best match for each block in each frame of video se- quences, from a search conducted in its neighborhood in the pre- vious frame. For the first 30 frames of the gray-scale, 8 bit-per-pixel, BFBIBCA2 BEBKBK , salesman video sequence, with blocks of size BDBI A2 BDBI,and search area of BFBF A2 BFBF (W=16), and D4 BPBE, the proposed method gives an speed up of more than 36 compared to a full search.... ..."

### Table 2. Fast full search algorithms. Motion estimation algorithm Savings

in A New Algorithm for Fast Full Search Block Motion Estimation Based on Number Theoretic Transforms

"... In PAGE 4: ... In the Table 1 the algorithmic operation counts (indexing is not accounted) and the time used are shown for the estimation of one motion vector. Table2 compares the NTT-based motion estimation algorithm to results reported in the literature for other fast full search algorithms. In the soft- ware implementation, the NTT algorithm do not appear to surpass other fast full search algorithms.... ..."

Cited by 1

### Table 1. Mesh tracking results for Coast-guard (frames 140-141) and Table-tennis (frames 1-2). Each entry gives the PSNR (dB) of a rendered video frame, using different triangle sizes (175 or 70 pixels large). Each row corre- sponds with various approaches pointed out in Fig.1. A maximum of 3 hierarchical levels and 3 resolution levels are used. H0R0 means no hierarchy and full resolution.

2000

"... In PAGE 3: ... Different approaches and results are summarized in Fig.1 and Table1 . First of all, we can notice that multi-resolution improves accuracy in mesh-based motion estimation.... In PAGE 3: ... Figure 3 illustrates this last point of view: for example, only 3 tri- angles are needed to perform the object motion estimation. Whereas most classical methods would use much more tri- angles to stay into the object, Table1 reports good results using only 10 triangles for coast-guard, results that are not really improved (0:24dB) by successive hierarchical lev- els. However, we notice that obtained results with triangles 172 pixels large after 3 successive divisions (thus 43 pixels Coast-guard Table-tennis... ..."

Cited by 1

### Table 1: Computational complexities of the fast motion estimation algorithms described.

"... In PAGE 21: ... To perform a direct comparison among the computational e ciencies of the fast search methods, the computational complexity of each method has been formulated for a motion displacement of size w. Table1 shows the computational complexities of the methods when w is a power of 2. Some logarithmic searches may not be able to search all the positions at the boundaries of the search window.... ..."

### TABLE I OVERHEADS INCURRED WHEN USING ZOLTAN IN A 3D MESH-BASED APPLICATION. OVERHEAD IS REPORTED BOTH IN SECONDS AND AS A PERCENTAGE OF TOTAL PARTITIONING TIME. CALLBACK OVERHEAD IS THE TIME SPENT IN CALLBACK FUNCTIONS; THIS TIME IS UNIQUE TO ZOLTAN. BUILD OVERHEAD INCLUDES TIME SPENT CONSTRUCTING LOAD-BALANCING DATA STRUCTURES; THIS TIME WOULD MOST LIKELY BE INCURRED BY APPLICATIONS USING EMBEDDED LOAD BALANCING.

### Table 12. Fast full search motion estimation algorithms Algorithm Savings NTT Algorithm Savings

2002

"... In PAGE 66: ... The 48-point algorithm minimizes the count of general multiplications, where nei- ther of the multiplicands is a constant, but nonetheless it does not perform well, since the congruent reduction after a multiplication in that case is so slow operation. The approximative comparison between different fast full search algorithms is given in Table12 , where higher percentage means higher computation savings, as compared to ESA, and thus faster algorithm. However, it should be noted that there are much more considerations than just the plain execution speed given in the table: many papers benchmark motion estimation methods with good-quality video sequences with little noise and often with little motion.... In PAGE 69: ... Unlike other fast full search algorithms, or even conventional search strategies such as Three Step Search, correlation-based algorithms (as NTT) have absolutely regular data flow, and they are therefore most suitable for ASIC implementation in this aspect. The rough comparison between different fast full search algorithms is given in Table12 , but in many applications the savings will be less for methods which are not based on corre- lation. Additionally, from many papers it is not clear how the algorithms were implemented.... ..."

Cited by 1

### TABLE VI Estimation results for the sad-array and curr-array of the MPEG-4 motion estimation kernel.

2003

Cited by 14

### Table 3: The experimental result of applying the AEJO technique to several fast motion estimation algorithms.

1997

"... In PAGE 10: ... In all algorithms used here the EJOfactor value is set to 16, and the spiral search order and the random match order are used. Table3 illustrates the experimental results. The video quality degradation due to applying the AEJO technique is usually within 0.... ..."

Cited by 7