Greater attention has been paid to vintage-merge processing of seismic data and extracting more valuable information by the geophysicist. A match filter is used within many important areas such as splicing seismic dat...Greater attention has been paid to vintage-merge processing of seismic data and extracting more valuable information by the geophysicist. A match filter is used within many important areas such as splicing seismic data, matching seismic data with different ages and sources, 4-D seismic monitoring, and so on. The traditional match filtering method is subject to many restrictions and is usually difficult to overcome the impact of noise. Based on the traditional match filter, we propose the wavelet domain L1 norm optimal matching filter. In this paper, two different types of seismic data are decomposed to the wavelet domain, different detailed effective information is extracted for Ll-norm optimal matching, and ideal results are achieved. Based on the model test, we find that the L1 norm optimal matching filter attenuates the noise and the waveform, amplitude, and phase coherence of result signals are better than the conventional method. The field data test shows that, with our method, the seismic events in the filter results have better continuity which achieves the high precision seismic match requirements.展开更多
This paper focuses on the 2-median location improvement problem on tree networks and the problem is to modify the weights of edges at the minimum cost such that the overall sum of the weighted distance of the vertices...This paper focuses on the 2-median location improvement problem on tree networks and the problem is to modify the weights of edges at the minimum cost such that the overall sum of the weighted distance of the vertices to the respective closest one of two prescribed vertices in the modified network is upper bounded by a given value.l1 norm and l∞norm are used to measure the total modification cost. These two problems have a strong practical application background and important theoretical research value. It is shown that such problems can be transformed into a series of sum-type and bottleneck-type continuous knapsack problems respectively.Based on the property of the optimal solution two O n2 algorithms for solving the two problems are proposed where n is the number of vertices on the tree.展开更多
基金sponsored by the Natural Science Foundation of China(No.41074075)Graduate Innovation Fund by Jilin University(No.20121070)
文摘Greater attention has been paid to vintage-merge processing of seismic data and extracting more valuable information by the geophysicist. A match filter is used within many important areas such as splicing seismic data, matching seismic data with different ages and sources, 4-D seismic monitoring, and so on. The traditional match filtering method is subject to many restrictions and is usually difficult to overcome the impact of noise. Based on the traditional match filter, we propose the wavelet domain L1 norm optimal matching filter. In this paper, two different types of seismic data are decomposed to the wavelet domain, different detailed effective information is extracted for Ll-norm optimal matching, and ideal results are achieved. Based on the model test, we find that the L1 norm optimal matching filter attenuates the noise and the waveform, amplitude, and phase coherence of result signals are better than the conventional method. The field data test shows that, with our method, the seismic events in the filter results have better continuity which achieves the high precision seismic match requirements.
基金The National Natural Science Foundation of China(No.10801031)
文摘This paper focuses on the 2-median location improvement problem on tree networks and the problem is to modify the weights of edges at the minimum cost such that the overall sum of the weighted distance of the vertices to the respective closest one of two prescribed vertices in the modified network is upper bounded by a given value.l1 norm and l∞norm are used to measure the total modification cost. These two problems have a strong practical application background and important theoretical research value. It is shown that such problems can be transformed into a series of sum-type and bottleneck-type continuous knapsack problems respectively.Based on the property of the optimal solution two O n2 algorithms for solving the two problems are proposed where n is the number of vertices on the tree.
