For a given set of n tuples, the binary consistency checking scheme generates a subset wherein no two elements intersect. The application of this scheme is illustrated by two problems in seismic horizon detection; seismic skeletonization and loop tying. After a brief introduction to seismic interpretation, these two examples are used to demonstrate how to cast an application problem into the formulism of the scheme. A comparison of this scheme to the dynamic programming approach to string matching due to S.Y. Lu (1982) is included.>

Given a set of n-tuples, the binary consistency checking scheme generates a subset in which no two elements intersect. Its applications are demonstrated by two problems in seismic horizon detection: seismic skeletonization and loop-tying. Previously, the authors had applied a matching scheme using dynamic programming for skeletonization. Comparing the two schemes, the binary consistency checking scheme can be applied to a wider range of problems and provides a user more direct control on the results of correlation than the dynamic programming scheme.>

A waveform correlation scheme is presented. The scheme consists of four parts: 1) the representation of waveforms by trees, 2) the definition of basic operations on tree nodes and tree distance, 3) a tree matching algorithm, and 4) a backtracking procedure to find the best node-to-node correlation. This correlation scheme has been implemented. Results show that the scheme has the capability of handling distortions that result from stretching or shrinking of intervals or from missing intervals.