### Table 2 Single-primitive targets: primitive dimensions.

"... In PAGE 10: ... Trihedrals and tophats have broad angular re- sponses and are easily detected by the algorithm; dihedrals and cylinders have responses largely confined to a single azimuthal plane and are more difficult to detect. The dihe- dral is much shorter than the cylinder ~see Table2 ! and thus has a much broader out-of-plane elevation response,5,6 ac- counting in part for the greater detectability of the dihedral. It is also apparent from Table 3 that the type classification performance of the algorithm is excellent: in almost every trial in which the primitive is detected, its type is correctly identified.... ..."

### TABLE 1 Results of the Subjective Evaluation of Anatomic Details

1998

### Table 3 Comparative results for plane detection methods

"... In PAGE 6: ... The results are summarized in Table 3. The results in Table3 are only indicative of the ability of the methods to converge to correct parameters. The accu- racy of the algorithms, especially of the iterative ones, can, in most cases, be tuned to be more accurate by choosing appropriate thresholds, or just by letting the algorithm perform more iterations.... ..."

### Table 1: Performance measurements for anatomic tree structures

"... In PAGE 9: ... Figure 16: Visualization of cerebral blood vessels derived from a clinical MR angiography with 149 edges. some results in Table1 . The setup time includes the pre- processing step.... In PAGE 9: ... 15-17. The last line in Table1 represents a complex anatomic tree from a corrosion cast. Due to the size of this model, the Open Inventor optimization failed which explains the low frame rate in the last row.... ..."

Cited by 1

### Table 1: Listingoftheproposed robust ltering algorithm in

"... In PAGE 3: ... This problem can be seen to be the robust version of (27) in the same way that (4){(5) is the robust version of (1). Now (31) can be written more com- pactly in the form (4){(5) with the identi cations: x ; colfx i ; ^ x iji ;; u i g;; b ; y i+1 ; H i+1 F i ^ x iji A ; H i+1 M i i E f;;i E g;;i b ; ;H i+1 M i i E f;;i ^ x iji ;; Q ; (P ;1 iji Q ;1 i ) W ; R ;1 i+1 ;; H ; H i+1 M i ;; E a ; E f;;i E g;;i E b ; ;E f;;i ^ x iji ;; ; i ;; A ; H i+1 F i G i This leads, after some algebra, to the equations shown in Table1 where we de ned 2 l;;i = kM T i H T i+1 R ;1 i+1 H i+1 M i k (32) The major step in the algorithm of Table 1 is step 3, which consists of recursions that are very similar in nature to the prediction form of the Kalman lter. The main di erence is that the new recursions operate on modi ed parameters rather than on the given nominal values.... In PAGE 3: ... This problem can be seen to be the robust version of (27) in the same way that (4){(5) is the robust version of (1). Now (31) can be written more com- pactly in the form (4){(5) with the identi cations: x ; colfx i ; ^ x iji ;; u i g;; b ; y i+1 ; H i+1 F i ^ x iji A ; H i+1 M i i E f;;i E g;;i b ; ;H i+1 M i i E f;;i ^ x iji ;; Q ; (P ;1 iji Q ;1 i ) W ; R ;1 i+1 ;; H ; H i+1 M i ;; E a ; E f;;i E g;;i E b ; ;E f;;i ^ x iji ;; ; i ;; A ; H i+1 F i G i This leads, after some algebra, to the equations shown in Table 1 where we de ned 2 l;;i = kM T i H T i+1 R ;1 i+1 H i+1 M i k (32) The major step in the algorithm of Table1 is step 3, which consists of recursions that are very similar in nature to the prediction form of the Kalman lter. The main di erence is that the new recursions operate on modi ed parameters rather than on the given nominal values.... In PAGE 3: ... Likewise, in the case E T f;;i E g;;i =0,we obtain the same sim- pli cations for f b G i ;; b F i g while b Q i becomes b Q i = ; Q ;1 i + ^ i E T g;;i E g;;i ;1 : In both cases, the recursion for P i becomes a standard Riccati recursion. In the work [7], we have further pre- sented alternativeequivalent implementations of the robust lter of Table1 in information form and in time- and... In PAGE 3: ...Table 1: Listingoftheproposed robust ltering algorithm in prediction form. Observe further that the algorithm of Table1 requires, at each iteration i, the minimization of G( )over ( l;;i ;; 1). It turns out that a reasonable approximation that avoids these repeated minimizations is to choose ^ i = (1 + ) l;;i : (33) That is, we set ^ i at a multiple of the lower bound | if the lower bound is zero, we set ^ i to zero and replace ^ ;1... In PAGE 4: ... 4. STEADY-STATE RESULTS Wenow examine the steady-state performance of the lter of Table1 when the model parameters are constant, say fF;;G;;H;;M;;E f ;;E g ;;Q;;Rg: [Only the contraction i is allowed to vary with time.] In particular we shall estab- lish that, under certain detectability and stabilizability assumptions, the steady-state lter is stable and that, in addition, for quadratically-stable models it guarantees a bounded error variance.... ..."

### Table 3 Single-primitive targets: model order and type confusion statistics.

"... In PAGE 10: ...6! Tables 3 and 4 present the performance of the algorithm on these four targets for both the 10- and 20-deg AVSDs. Table3 presents model order and type estimation statistics: Pdet refers to the fraction of runs in which an estimate was produced for the primitive, i.e.... In PAGE 10: ... For each of the eight experiments ~four primitives, two AVSDs!, Monte Carlo runs were continued until we had obtained 500 trials in which the primitive was detected and estimated to be the correct type. Table3 illustrates the relative observability of the primi- tive types. Trihedrals and tophats have broad angular re- sponses and are easily detected by the algorithm; dihedrals and cylinders have responses largely confined to a single azimuthal plane and are more difficult to detect.... In PAGE 10: ... The dihe- dral is much shorter than the cylinder ~see Table 2! and thus has a much broader out-of-plane elevation response,5,6 ac- counting in part for the greater detectability of the dihedral. It is also apparent from Table3 that the type classification performance of the algorithm is excellent: in almost every trial in which the primitive is detected, its type is correctly identified. This suggests that the limited type information provided by the even-bounce/odd-bounce discriminator in Table 2 Single-primitive targets: primitive dimensions.... ..."

### Table 1: Error measures from simulated MR results.

1999

"... In PAGE 5: ... However, the AGEM algorithm provides ad- ditional robustness to noise, as evident from the smoother tissue boundaries in its result. Table1 shows the misclassification rate using the AGEM, EMV, and AFCM methods on the simulated data when vary- ing the amount of noise and inhomogeneity. AFCM was shown to provide lower errors than several competing meth- ods in [6].... ..."

Cited by 3

### Table 1: Watermark algorithms and robustness against mp3

"... In PAGE 4: ...1 Test 1 results: Watermark robustness Here we present the results of our tests regarding the robustness of audio watermarking algorithms against lossy compression. Table1 shows a example of our results of subtest I: The letters A to D represent the watermarking algorithms. A yes means that the watermark was retrieved completely and a no means that no watermark was detected.... ..."

### Table 2. Results of unbiased registration of anatomical slice, CT, MR PD, T1 and T2 images.[Dataset index: VHD #1165.]

in dimensional

"... In PAGE 9: ... Also, from the segmented images in Figure 4, we see that these images are better aligned after registration. From the a ne transformations achieved in the registration as shown in Table2 , we see that the a ne transformations of all three images include a certain amount of shear. This serves as a very preliminary justi cation for using an a ne mapping.... ..."

### Table 5. Robustness of algorithms

"... In PAGE 11: ....3. Sensitivity analysis We present a statistical analysis of many runs of our al- gorithms, each run with a different seed to the random num- ber generator. Table5 summarizes the results of this exper- iment. In row 1, we present the statistics for the Lazarus count of the total order found by Algorithm A1.... ..."