The binary consistency checking scheme and its applications to seismic horizon detection
- 1 April 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 11 (4) , 439-447
- https://doi.org/10.1109/34.19043
Abstract
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.Keywords
This publication has 9 references indexed in Scilit:
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, 1987
- Hierarchical syntactic pattern recognition and Hough transformation for the automatic reconstruction of seismic patternsPublished by Society of Exploration Geophysicists ,1985
- A Tree-Matching Algorithm Based on Node Splitting and MergingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Segmentation of stacked seismic data by the classification of image texturePublished by Society of Exploration Geophysicists ,1984
- On the Foundations of Relaxation Labeling ProcessesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Image analysis techniques for seismic dataPublished by Society of Exploration Geophysicists ,1982
- The Consistent Labeling Problem: Part IIPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- The Consistent Labeling Problem: Part IIEEE Transactions on Pattern Analysis and Machine Intelligence, 1979
- The String-to-String Correction ProblemJournal of the ACM, 1974