Shortest-path multiple well-log correlation
Hector Corzo-Pola, Sergey B. Fomel · 2022
The task of multiple well-log correlation involves finding optimal correlation sequences since errors add up as we progress along those sequences. We present the results of using an automatic approach for correlating multiple well logs, based on following correlation sequences computed by Dijkstra’s shortest path method and using local similarity scans for shift estimation. First, we compute the shortest path from a source well to every other well in the field. Then, we use local similarity scans to flatten the well-logs along the obtained paths. A test on the Teapot Dome dataset shows that our method can get better results than simple sequential correlations.