previous up next print clean
Next: SYNTHETIC DATA EXAMPLE Up: Bevc & Claerbout: Fast Previous: IMPLEMENTATION

TIMING TESTS

Timing results are provided for two small input data sets. The following tables compare the fast anti-aliasing program kfastaax() to the tutorial program kirchfast() and to trimo().

The following table of cpu times is for a $128 \times 128$ input data set run on the SPARCstation 2 OAS:

  kfastaax() kirchfast() trimo()
conj=0 6.4 1.8 76.8
conj=1 5.1 1.8 77.2

The following table of cpu times is for a $256 \times 64$ input data set run on the SPARCstation IPC ANTARES:

  kfastaax() kirchfast() trimo()
conj=0 7.2 2.3 75.0
conj=1 6.0 2.4 74.6

kirchfast() is about 12 times faster than trimo() and only three times slower than kfastaax(). The speed-up is especially noticeable on very large data sets.


previous up next print clean
Next: SYNTHETIC DATA EXAMPLE Up: Bevc & Claerbout: Fast Previous: IMPLEMENTATION
Stanford Exploration Project
11/17/1997