Augmented geophysical data interpretation through automated velocity picking in semblance velocity images

Abstract. Velocity picking is the problem of picking velocity–time pairs based on a coherence metric between multiple seismic signals. Coherence as a function of velocity and time can be expressed as a 2D color semblance velocity image. Currently, humans pick velocities by looking at the semblance velocity image; this process can take days or even weeks to complete for a seismic survey. The problem can be posed as a geometric feature-matching problem. A feature extraction algorithm can recognize islands (peaks) of maximum semblance in the semblance velocity image: a heuristic combinatorial matching process can then be used to find a subset of peaks that maximizes the coherence metric. The peaks define a polyline through the image, and coherence is measured in terms of the summed velocity under the polyline and the smoothness of the polyline. Our best algorithm includes a constraint favoring solutions near the median solution for the local area under consideration. First, each image is processed independently. Then, a second pass of optimization includes proximity to the median as an additional optimization criterion. Our results are similar to those produced by human experts.

[1]  L. Darrell Whitley,et al.  Test driving three 1995 genetic algorithms: New test functions and geometric matching , 1995, J. Heuristics.

[2]  Mark R. Stevens,et al.  Optical Linear Feature Detection Based on Model Pose. , 1995 .

[3]  J. Beveridge,et al.  Optimal geometric model matching under full 3D perspective , 1995, Proceedings of 1994 IEEE 2nd CAD-Based Vision Workshop.

[4]  Darrell Whitley,et al.  Testing Driving Three 1995 Genetic Algorithms , 1995 .

[5]  Demetri Terzopoulos,et al.  Snakes: Active contour models , 2004, International Journal of Computer Vision.

[6]  L. D. Whitley,et al.  Automated Velocity Picking : A Computer Vision and Optimization Approach , 2000 .

[7]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[8]  Tony Kusuma,et al.  A Neural Network Approach to Automate Velocity Picking , 1994 .

[9]  R. Weiss,et al.  Combinatorial optimization applied to variable scale 2D model matching , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.

[10]  Edward M. Riseman,et al.  How Easy is Matching 2D Line Models Using Local Search? , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Mark R. Stevens,et al.  Precise matching of 3-D target models to multisensor data , 1997, IEEE Trans. Image Process..

[12]  J. Beveridge Local search algorithms for geometric object recognition: optimal correspondence and pose , 1993 .

[13]  J. Beveridge,et al.  Demonstrating polynomial run-time growth for local search matching , 1995, Proceedings of International Symposium on Computer Vision - ISCV.