The Community for Technology Leaders
Green Image
<p>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.</p>
binary consistency checking; seismic horizon detection; skeletonization; loop tying; seismic interpretation; computerised pattern recognition; geophysics computing; seismology
"The Binary Consistency Checking Scheme and Its Applications to Seismic Horizon Detection", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 11, no. , pp. 439-447, April 1989, doi:10.1109/34.19043
100 ms
(Ver 3.3 (11022016))