### Table 1. a) The sizes of the grid and the number of nodes in the model at the di erent pyramid levels. b) Computing time (seconds) and matching energy for each method.

"... In PAGE 7: ... The results are not very sensitive to -values in the LGD- and LCN-methods: increase by factor 10 produces fairly similar results. The numbers of grid points on each pyramid level are represented in Table1 a. The iteration with each grid size was stopped, when the change in the energy was less than user de ned parameter = 0:02.... In PAGE 7: ... The computing time to segment MR images and the energies at convergence related to the Fig. 5 are represented in Table1 b. The star apos; apos; indicates that the oriented distance maps are not used at the highest resolution level, other parameters being equal.... In PAGE 8: .... Implementation. Several factors a ect to the execution time. If the ori- ented distance maps are used, the running time is higher ( Table1 ) but the robustness of the program is better. However, the results are fairly similar to the results with the oriented distance maps.... In PAGE 8: ... Each grid size a ects the run time cumulatively. For example, if a 11 11 11-grid had not been used in Table1 , the time would have been 10 s lower. The average error of the deformation would have been 0.... ..."

### Table 1: Two examples illustrate the relation between the image size, block size, and search area for a pyramid with four levels. In example 1, the size of image block, B4, at level 4 is 11, search area, S4, is 9. In example 2, B4 is 27 and S4 is 23. Computational time of block matching is signi cantly reduced because of the large decreasing rate.

"... In PAGE 4: ... number for symmetry. Table1 gives two examples which illustrate the decrease of the image size, image block size, and search area for a pyramid with four levels. 3.... In PAGE 5: ... When the size of matching block is smaller than seven, the computation time of the hierarchical algorithm, with or without adaptive EJO, decreases as the size of matching block increases. From Table1 , we can see that when the pyramid level is 3, the most e cienct estimation is achieved when the block size is equal to or larger than 7. When the size of matching block is larger than 7, the computation time increases very slowly, especially when using the hierarchical method together with adaptive EJO algorithm.... ..."

### Table 1. Average retrieval rate (%) in the top 15 matches using pyramid wavelet transform (DWT) and wavelet frames (DWF).

"... In PAGE 3: ... The em- ployed wavelet transforms are the traditional wavelet pyramids (DWT) and the non-subsampled discrete wavelet frames (DWF) using the 8-tap Daubechies orthogonal wavelets. Table1 sum- maries the comparison in performance in average percentages of retrieving relevant images in the top 15 matches.... ..."

### Table 1. Average retrieval rate (%) in the top 15 matches using pyramid wavelet transform (DWT) and wavelet frames (DWF).

"... In PAGE 3: ... The employed wavelet transforms are the traditional wavelet pyramids (DWT) and the non-subsampled discrete wavelet frames (DWF) using the 8-tap Daubechies orthogonal wavelets. Table1 summaries the compar- ison in performance in average percentages of retrieving relevant images in the top 15 matches. The first observation is that the statistical approach (GGD amp; KLD) always outperforms all other tested traditional methods.... ..."

### Table 1. The number of operations needed to ob- tain different pyramid levels. Note for panoramic pyramid, only the requested resolution image needs to be loaded

2000

"... In PAGE 2: ... For example un- compressed HDTV requires a transfer of per second, more than the maximum bandwidth of the PCI bus. Let us now consider the computational complexity of the different pyramid algorithms listed in Table1 . To con- struct traditional pyramid, we need multiplications, addi- tions and loading operations.... ..."

Cited by 4

### Table 1 shows scale levels computed in this way for the examples of pure and over- sampled pyramids defined in figure 7.

2003

"... In PAGE 13: ... Table1 : Scale values for the examples of pure and oversampled pyramids defined in figure 2 (here, without adding an initial pre-smoothing stage as will be described later in figure 7). 4.... ..."

Cited by 10

### Table 7: Computer Match Results

in Abstract

"... In PAGE 14: ... Table7 below shows the results of the computer matching for each sampling stratum. The match rate is the total number of computer matches divided by the number of persons comprising the PES file within each stratum.... ..."

### TABLE III Average retrieval rate (%) in the top 15 matches using pyramid wavelet transform (DWT) and wavelet frames (DWF) with D4 filters.

### Table 2. Success rate finding matches based on two independent teams and known contributor matches. Matches Found Found Found by Total Missed by

1997

"... In PAGE 11: ... The comparison began in April and was completed in November 1996, the supplemental comparison of the photographs from Mexico in 1990 was completed in January 1997. Matching success In the primary comparison, the two independent teams found 1,036 and 1,032 matches, respectively ( Table2 ). The combined matches found by either team was 1,098 with each team finding about 94% of this total.... In PAGE 11: ... The combined matches found by either team was 1,098 with each team finding about 94% of this total. A simple Peterson capture-recapture calculation (using total matches found by each team as n1 and n2 and the number of these found in common by both teams as m12) yielded an estimate that revealed that over 99% of the matches would have been found by at least one team ( Table2 ). This estimate, however, was unrealistically high.... In PAGE 11: ... The contributors generally identify these matches with a high degree of success because of their familiarity with their smaller collections. Of the 563 matches provided to us by the contributors (involving whales in our initial comparison), 546 (97%) were found by one or both teams ( Table2 ). This is a more unbiased assessment of our matching success rate.... ..."

### Table 1. Performance of 3D Pyramid Compressor on 6 data-sets Filename Original data Output data Compression Ave. PSNR 3D Pyramid specifications

2003

"... In PAGE 4: ...1. Rate-distortion performance We tested the rate-distortion (R/D) performance of a 3D pyramid compressor and listed the result in Table1 . The data sets of human resistance arteries have many regions, in which there are very low variations between voxels.... In PAGE 5: ....3. Computational expenses We examined the computational expense of the proposed codec on these data sets. The settings of the coder follow the specifications in Table1 . We list the corresponding CPU times of encoding and decoding in Table 3.... ..."

Cited by 2