Premium
SUPERSTACK—AN ITERATIVE STACKING ALGORITHM *
Author(s) -
NÆSS O. E.
Publication year - 1979
Publication title -
geophysical prospecting
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.735
H-Index - 79
eISSN - 1365-2478
pISSN - 0016-8025
DOI - 10.1111/j.1365-2478.1979.tb00956.x
Subject(s) - stack (abstract data type) , stacking , normal moveout , consistency (knowledge bases) , algorithm , noise (video) , computer science , regional geology , iterative method , point (geometry) , basis (linear algebra) , geology , mathematics , telmatology , artificial intelligence , hydrogeology , image (mathematics) , physics , geometry , geotechnical engineering , nuclear magnetic resonance , programming language , offset (computer science)
A bstract An algorithm for separation of signals according to their coherency is proposed. The algorithm, called Superstack, is used on common depth point data after normal moveout corrections have been applied. The algorithm can be regarded as an iterative stacking procedure. After each stack, input values are changed depending on the consistency of the output of the previous stack. The Superstack algorithm is able to provide better separation of signals showing a different degree of horizontal consistency (coherency) than the normal horizontal stack. All noise signals in a CDP‐gather may be assumed to show less horizontal consistency than the primary reflections. On this basis the algorithm will give an improved primary/multiple and an improved primary/noise ratio. The Superstack is very general, should not be especially expensive in terms of computer time, and can easily be implemented in routine processing.