# US 2008/0304359 A1 · Processing Seismic Data

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2008/0304359 A1
- Document ID: US20080304359A1
- Status: Published application
- Kind: A1
- Application number: 11/791,802
- Filed: 2005-12-01
- Published: 2008-12-11
- Earliest claimed: 2004-12-01
- Assignees: WesternGeco L.L.C.
- Inventors: Ralf Ferber
- Web page: https://patentgrep.com/patent/US20080304359A1

## CPC

- G01V 1/366: {by correlation of seismic signals}
- G01V 2210/32: Noise reduction
- G01V: GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS (means for indicating the location of accidentally buried, e.g. snow-buried, persons A63B29/02)

## Abstract

A method of processing seismic data including convolving at least first and second seismic data traces or respective portions of at least first and second seismic data traces to forma composite trace. The travel time of an event may then be determined in the composite trace. This provides an improved method compared to the prior art technique of picking the travel time of an event individually in each one of a number of seismic data traces and averaging the individual picked travel times.

## Claims

### Claim 1

A method of processing seismic data comprising convolving at least first and second seismic data traces or respective portions of at least first and second seismic data traces thereby to form a composite trace; and determining the travel time of an event in the composite trace.

### Claim 2 (depends on 1)

A method as claimed as in claim 1 wherein the first and second traces are members of a gather of traces.

### Claim 3 (depends on 2)

A method as claimed as in claim 2 wherein the first and second traces are members of a common source gather of traces.

### Claim 4 (depends on 2)

A method as claimed in claim 2 wherein the first and second traces are adjacent traces in the gather.

### Claim 5 (depends on 2)

A method as claimed in claim 2 and comprising convolving a trace with m traces that are adjacent on one side and with n traces that are adjacent on the other side.

### Claim 6 (depends on 1)

A method as claimed as in claim 1 and comprising multiplying the time axis of each of the data traces by a respective constant before the step of convolving the traces.

### Claim 7 (depends on 6)

A method as claimed in claim 6 comprising determining the composite trace according to Xk′ (t)=*j=−mn Xk+j (αj t), where Xk(t) denotes the kth trace, n is a natural number, aj denotes as constant, * denotes the convolution operation, and Xk′(t) denotes a composite trace.

### Claim 8 (depends on 6)

A method as claimed in claim 6 wherein the constant for a selected one of the traces is less than zero.

### Claim 9 (depends on 6)

A method as claimed in claim 6 wherein the constant for a selected one of the traces has a magnitude of less than one.

### Claim 10 (depends on 6)

A method as claimed in claim 6 wherein the constant for a selected one of the traces has a magnitude greater than one.

### Claim 11 (depends on 6)

A method as claimed in claim 6 wherein ak−1=ak+1=−½ and ak=1, where ak is the coefficient applied to the kth trace.

### Claim 12 (depends on 6)

A method as claimed in claim 6 wherein so ak−2=ak−1=ak=ak+1=ak+2=1, where ak is the coefficient applied to the kth trace.

### Claim 13 (depends on 1)

A method as claimed in claim 1 wherein the convolution is performed in the frequency domain.

### Claim 14

An apparatus for processing seismic data, the apparatus comprising means for convolving at least first and second seismic data traces thereby to form a composite trace; and determining the travel time of an event in the composite trace.

### Claim 15 (depends on 14)

An apparatus as claimed in claim 14 and adapted to multiply the time axis of each of the data traces by a respective constant before the step of convolving the traces.

### Claim 16 (depends on 14)

An apparatus as claimed in claim 14 and adapted to determine the composite trace according to Xk′(t)=*j=31 mn Xk+j (αj t), where Xk(t) denotes the kth trace, n is a natural number, aj denotes a constant, * denotes the convolution operation, and Xk′(t) denotes a composite trace.

### Claim 17 (depends on 14)

An apparatus as claimed in claim 14 and adapted to perform the convolution in the frequency domain.

### Claim 18 (depends on 14)

An apparatus as claimed in claim 14 and comprising a programmable data processor.

### Claim 19 (depends on 18)

A storage medium containing a program for the data processor of an apparatus as defined in claim 18.

### Claim 20 (depends on 1)

A storage medium containing a program for controlling a programmable data processor to carry out a method as defined in claim 1.
