previous up next print clean
Next: KIRCHHOFF ALGORITHM WITH ANTI-ALIASING Up: Bevc & Claerbout: Integration Previous: Bevc & Claerbout: Integration

Introduction

In the last SEP report Bevc and Claerbout (1992), we described a fast anti-aliased Kirchhoff migration and modeling algorithm. The algorithm uses causal and anticausal integration to form triangular weighting functions which depend on operator offset, velocity, and data sampling.

In this paper we examine how the particular implementation of causal and anticausal integration affects the migration and modeling results. The best result is obtained by defining the discrete integration operation in such a way that it can be represented as multiplication by a triangular matrix with 1 on the diagonal rather than 1/2.


previous up next print clean
Next: KIRCHHOFF ALGORITHM WITH ANTI-ALIASING Up: Bevc & Claerbout: Integration Previous: Bevc & Claerbout: Integration
Stanford Exploration Project
11/17/1997