Syntactic simulation of 1-D sedimentary sequences in a coal-bearing succession using a stochastic context-free grammar

被引:0
|
作者
Duan, T. [1 ]
Griffiths, C.M. [1 ]
Johnsen, S.O. [1 ]
机构
[1] National Centre for Petroleum Geology and Geophysics, University of Adelaide, Thebarton Campus, SA 5005, Australia
关键词
Context free grammars - Sedimentology - Syntactics - Formal languages - Coal deposits - Stochastic systems - Stratigraphy - Lime - Pattern recognition;
D O I
10.1306/D42684B4-2B26-11D7-8648000102C1865D
中图分类号
学科分类号
摘要
Syntactic pattern recognition (SPR) provides a new symbolic computing paradigm that has a great potential for application in sedimentologic and stratigraphic theory. In an SPR system, a formal language consists of a set of sentences; each sentence is a string of terminal symbols (or words); a grammar is used to characterize syntactic structures of the language, which tells whether or not a specific sentence belongs to the language. A language represents a class of patterns that are similar to each other in some sense. A sentence from the language then represents an individual pattern of the class. The grammar defines the legality of members of the class in general. There are several key subdomains in this methodology, such as grammar inference, language generation or simulation, and language parsing. The objective of this paper is to show the possibility of using geological knowledge, obtained by domain experts (here sedimentologists), to construct valid grammars characterizing the vertical structure of different orders of sedimentary sequences, by applying the methodology to the analysis of a coal-bearing succession of the upper Limestone Coal Group, Pendleian (E1) in the Kincardine basin, Central Scotland. First, complete successions from two boreholes are encoded into syntactic strings of lithofacies symbols. Five groups of different high-frequency sedimentary sequences have been recognized. These high-frequency sequences combine to form a lower-frequency sequence. This geological knowledge is used in a heuristic sense to manually construct grammars for each of the five groups of sequences and for the whole succession. Finally, the constructed grammars, together with a thickness simulation for each lithofacies, are used to generate similar sedimentary sequences to test the validity of the grammars and therefore their further application to a formal analysis of sedimentary sequences. Comparison of simulated sequences with real sequences indicates that SPR is an encouraging technique in the analysis of sedimentary sequences. Copyright © 1996, SEPM (Society for Sedimentary Geology).
引用
收藏
相关论文
共 14 条
  • [1] Syntactic simulation of 1-D sedimentary sequences in a coal-bearing succession using a stochastic context-free grammar
    Duan, T
    Griffiths, CM
    Johnsen, SO
    JOURNAL OF SEDIMENTARY RESEARCH, 1996, 66 (06) : 1091 - 1101
  • [2] Syntactic simulation of 1-D sedimentary sequences in a coal-bearing succession using a stochastic context-free grammar - Reply
    Duan, T
    Griffiths, CM
    Johnsen, SO
    JOURNAL OF SEDIMENTARY RESEARCH, 1997, 67 (06): : 1098 - 1099
  • [3] Syntactic simulation of 1-D sedimentary sequences in a coal-bearing succession using a stochastic context-free grammar - Discussion
    Read, WA
    JOURNAL OF SEDIMENTARY RESEARCH, 1997, 67 (06): : 1097 - 1098
  • [4] Recognizing multitasked activities from video using stochastic context-free grammar
    Moore, D
    Essa, I
    EIGHTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02)/FOURTEENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-02), PROCEEDINGS, 2002, : 770 - 776
  • [5] RECOGNITION OF EQUATIONS USING A 2-DIMENSIONAL STOCHASTIC CONTEXT-FREE GRAMMAR
    CHOU, PA
    VISUAL COMMUNICATIONS AND IMAGE PROCESSING IV, PTS 1-3, 1989, 1199 : 852 - 863
  • [6] Listening to viral tongues: Comparing viral trees using a stochastic context-free grammar
    Rzhetsky, A
    Fitch, WM
    MOLECULAR BIOLOGY AND EVOLUTION, 2005, 22 (04) : 905 - 913
  • [7] Hand gesture recognition using Haar-like features and a stochastic context-free grammar
    Chen, Qing
    Georganas, Nicolas D.
    Petriu, Emil M.
    IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, 2008, 57 (08) : 1562 - 1571
  • [8] Probabilistic Mathematical Formula Recognition Using a 2D Context-Free Graph Grammar
    Celik, Mehmet
    Yanikoglu, Berrin
    11TH INTERNATIONAL CONFERENCE ON DOCUMENT ANALYSIS AND RECOGNITION (ICDAR 2011), 2011, : 161 - 166
  • [9] Structure detection and segmentation of documents using 2D stochastic context-free grammars
    Alvaro, Francisco
    Cruz, Francisco
    Sanchez, Joan-Andreu
    Terrades, Oriol Ramos
    Benedi, Jose-Miguel
    NEUROCOMPUTING, 2015, 150 : 147 - 154
  • [10] Page Segmentation of Structured Documents Using 2D Stochastic Context-Free Grammars
    Alvaro, Francisco
    Cruz, Francisco
    Sanchez, Joan-Andreu
    Ramos Terrades, Oriol
    Benedi, Jose-Miguel
    PATTERN RECOGNITION AND IMAGE ANALYSIS, IBPRIA 2013, 2013, 7887 : 133 - 140