The binary consistency checking scheme and its applications to seismic horizon detection

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.< >