Premium
STACKING FILTERS AND THEIR CHARACTERIZATION IN THE (f—k) DOMAIN *
Author(s) -
HUBRAL P.
Publication year - 1974
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.1974.tb00113.x
Subject(s) - filter (signal processing) , stacking , hyperbola , normal moveout , computer science , position (finance) , algorithm , mathematics , geometry , physics , computer vision , nuclear magnetic resonance , programming language , offset (computer science) , finance , economics
A bstract The implementation of a stacking filter involves the filtering of each trace with an individual filter and the subsequent summing of all outputs. The actual position of a trace in space as well as certain simultaneous shifts of traces and filter components in time do not influence the process. The resulting output is consequently invariant to various arbitrary coordinate transformations. For a certain useful class of ensembles of non‐linear moveout arrival times for signals a particular transformation can be found which transforms a given ensemble into one consisting only of straight lines. It is thus possible to reduce, for instance, the analysis of a stacking filter designed for hyperbola‐like moveout curves to the analysis of a velocity filter with linear moveout curves. As the ( f—k ) transform is a very useful concept to describe a velocity filter, it can consequently be applied to characterize a stacking filter in regard to its performance on input signals with non‐linear moveout.