Paper Info
Title
A shortest path algorithm for 2D seismic horizon tracking
Abstract
Seismic horizon mapping is an important step in seismic interpretation. Automatic tracking algorithms are valuable tools since manual mapping can be an extremely tiring and time consuming task. In the present work, we propose a new tracking algorithm for 2D seismic horizons based on shortest paths in Directed Acyclic Graphs. Our approach was designed to balance global and local information of seismic data in order to correctly track horizons at complicated geological scenarios. The main contributions of this work include: a new tracking algorithm for 2D horizons; the definition of a graph dynamically built which models the structure of the seismic horizon; an energy function that balances between local and global properties of the seismic data; and, a new method for building subtraces to improve correlation measurements. The proposed method yielded very satisfactory results when compared to a ground truth horizon provided by an interpreter. Additionally, we compared our results with a similar greedy algorithm, which uses only local information to map horizons. The results illustrated the strength of our design.
Year
DOI
Venue
2015
10.1145/2695664.2695859
SAC 2015: Symposium on Applied Computing Salamanca Spain April, 2015
Keywords
Field
DocType
horizon tracking, correlation measurements, directed acyclic
Graph,Mathematical optimization,Shortest path problem,Computer science,Horizon,Algorithm,Greedy algorithm,Directed acyclic graph,Seismic interpretation,Ground truth,Dijkstra's algorithm
Conference
ISBN
Citations 
PageRank 
978-1-4503-3196-8
0
0.34
References 
Authors
3
4
Name
Order
Citations
PageRank
Eliana L. Goldner100.34
Cristina Nader Vasconcelos27612.15
Pedro Mario Silva321.39
Marcelo Gattass438248.43