The Binary Consistency Checking Scheme and Its Applications to Seismic Horizon Detection

Abstract

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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cite

Text

Cheng and Lu. "The Binary Consistency Checking Scheme and Its Applications to Seismic Horizon Detection." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1988. doi:10.1109/CVPR.1988.196276

Markdown

[Cheng and Lu. "The Binary Consistency Checking Scheme and Its Applications to Seismic Horizon Detection." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1988.](https://mlanthology.org/cvpr/1988/cheng1988cvpr-binary/) doi:10.1109/CVPR.1988.196276

BibTeX

@inproceedings{cheng1988cvpr-binary,
  title     = {{The Binary Consistency Checking Scheme and Its Applications to Seismic Horizon Detection}},
  author    = {Cheng, Yao-Chou and Lu, Shin-gee},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1988},
  pages     = {463-468},
  doi       = {10.1109/CVPR.1988.196276},
  url       = {https://mlanthology.org/cvpr/1988/cheng1988cvpr-binary/}
}