There is little low-and-high frequency information on seismic data in seismic exploration,resulting in narrower bandwidth and lower seismic resolution.It considerably restricts the prediction accuracy of thin reservoi...There is little low-and-high frequency information on seismic data in seismic exploration,resulting in narrower bandwidth and lower seismic resolution.It considerably restricts the prediction accuracy of thin reservoirs and thin interbeds.This study proposes a novel method to constrain improving seismic resolution in the time and frequency domain.The expected wavelet spectrum is used in the frequency domain to broaden the seismic spectrum range and increase the octave.In the time domain,the Frobenius vector regularization of the Hessian matrix is used to constrain the horizontal continuity of the seismic data.It eff ectively protects the signal-to-noise ratio of seismic data while the longitudinal seismic resolution is improved.This method is applied to actual post-stack seismic data and pre-stack gathers dividedly.Without abolishing the phase characteristics of the original seismic data,the time resolution is signifi cantly improved,and the structural features are clearer.Compared with the traditional spectral simulation and deconvolution methods,the frequency distribution is more reasonable,and seismic data has higher resolution.展开更多
In[3],Chan and Wong proposed to use total variational regularization for both images and point spread functions in blind deconvolution.Their experimental results show that the detail of the restored images cannot be r...In[3],Chan and Wong proposed to use total variational regularization for both images and point spread functions in blind deconvolution.Their experimental results show that the detail of the restored images cannot be recovered.In this paper,we consider images in Lipschitz spaces,and propose to use Lipschitz regularization for images and total variational regularization for point spread functions in blind deconvolution.Our experimental results show that such combination of Lipschitz and total variational regularization methods can recover both images and point spread functions quite well.展开更多
Analternating direction approximateNewton(ADAN)method is developed for solving inverse problems of the form min{φ(Bu)+(1/2)||Au−f||^(2)_(2)},whereφis convex and possibly nonsmooth,and A and B arematrices.Problems of...Analternating direction approximateNewton(ADAN)method is developed for solving inverse problems of the form min{φ(Bu)+(1/2)||Au−f||^(2)_(2)},whereφis convex and possibly nonsmooth,and A and B arematrices.Problems of this form arise in image reconstruction where A is the matrix describing the imaging device,f is the measured data,φis a regularization term,and B is a derivative operator.The proposed algorithm is designed to handle applications where A is a large dense,ill-conditioned matrix.The algorithm is based on the alternating direction method of multipliers(ADMM)and an approximation to Newton’s method in which a term in Newton’s Hessian is replaced by aBarzilai–Borwein(BB)approximation.It is shown thatADAN converges to a solution of the inverse problem.Numerical results are provided using test problems from parallel magnetic resonance imaging.ADAN was faster than a proximal ADMM scheme that does not employ a BB Hessian approximation,while it was more stable and much simpler than the related Bregman operator splitting algorithm with variable stepsize algorithm which also employs a BB-based Hessian approximation.展开更多
This paper presents an application of the sparse Bayesian learning(SBL)algorithm to linear inverse problems with a high order total variation(HOTV)sparsity prior.For the problem of sparse signal recovery,SBL often pro...This paper presents an application of the sparse Bayesian learning(SBL)algorithm to linear inverse problems with a high order total variation(HOTV)sparsity prior.For the problem of sparse signal recovery,SBL often produces more accurate estimates than maximum a posteriori estimates,including those that useℓ1 regularization.Moreover,rather than a single signal estimate,SBL yields a full posterior density estimate which can be used for uncertainty quantification.However,SBL is only immediately applicable to problems having a direct sparsity prior,or to those that can be formed via synthesis.This paper demonstrates how a problem with an HOTV sparsity prior can be formulated via synthesis,and then utilizes SBL.This expands the class of problems available to Bayesian learning to include,e.g.,inverse problems dealing with the recovery of piecewise smooth functions or signals from data.Numerical examples are provided to demonstrate how this new technique is effectively employed.展开更多
基金supported by the PetroChina Prospective,Basic,and Strategic Technology Research Project(No.2021DJ0606).
文摘There is little low-and-high frequency information on seismic data in seismic exploration,resulting in narrower bandwidth and lower seismic resolution.It considerably restricts the prediction accuracy of thin reservoirs and thin interbeds.This study proposes a novel method to constrain improving seismic resolution in the time and frequency domain.The expected wavelet spectrum is used in the frequency domain to broaden the seismic spectrum range and increase the octave.In the time domain,the Frobenius vector regularization of the Hessian matrix is used to constrain the horizontal continuity of the seismic data.It eff ectively protects the signal-to-noise ratio of seismic data while the longitudinal seismic resolution is improved.This method is applied to actual post-stack seismic data and pre-stack gathers dividedly.Without abolishing the phase characteristics of the original seismic data,the time resolution is signifi cantly improved,and the structural features are clearer.Compared with the traditional spectral simulation and deconvolution methods,the frequency distribution is more reasonable,and seismic data has higher resolution.
基金This research is supported in part by RGC 7046/03P,7035/04P,7035/05P and HKBU FRGs.
文摘In[3],Chan and Wong proposed to use total variational regularization for both images and point spread functions in blind deconvolution.Their experimental results show that the detail of the restored images cannot be recovered.In this paper,we consider images in Lipschitz spaces,and propose to use Lipschitz regularization for images and total variational regularization for point spread functions in blind deconvolution.Our experimental results show that such combination of Lipschitz and total variational regularization methods can recover both images and point spread functions quite well.
基金This research was partly supported by National Science Foundation(Nos.1115568 and 1016204)by Office of Naval Research Grants(Nos.N00014-11-1-0068 and N00014-15-1-2048).
文摘Analternating direction approximateNewton(ADAN)method is developed for solving inverse problems of the form min{φ(Bu)+(1/2)||Au−f||^(2)_(2)},whereφis convex and possibly nonsmooth,and A and B arematrices.Problems of this form arise in image reconstruction where A is the matrix describing the imaging device,f is the measured data,φis a regularization term,and B is a derivative operator.The proposed algorithm is designed to handle applications where A is a large dense,ill-conditioned matrix.The algorithm is based on the alternating direction method of multipliers(ADMM)and an approximation to Newton’s method in which a term in Newton’s Hessian is replaced by aBarzilai–Borwein(BB)approximation.It is shown thatADAN converges to a solution of the inverse problem.Numerical results are provided using test problems from parallel magnetic resonance imaging.ADAN was faster than a proximal ADMM scheme that does not employ a BB Hessian approximation,while it was more stable and much simpler than the related Bregman operator splitting algorithm with variable stepsize algorithm which also employs a BB-based Hessian approximation.
基金supported in part by NSF-DMS 1502640,NSF-DMS 1912685,AFOSR FA9550-18-1-0316Office of Naval Research MURI grant N00014-20-1-2595.
文摘This paper presents an application of the sparse Bayesian learning(SBL)algorithm to linear inverse problems with a high order total variation(HOTV)sparsity prior.For the problem of sparse signal recovery,SBL often produces more accurate estimates than maximum a posteriori estimates,including those that useℓ1 regularization.Moreover,rather than a single signal estimate,SBL yields a full posterior density estimate which can be used for uncertainty quantification.However,SBL is only immediately applicable to problems having a direct sparsity prior,or to those that can be formed via synthesis.This paper demonstrates how a problem with an HOTV sparsity prior can be formulated via synthesis,and then utilizes SBL.This expands the class of problems available to Bayesian learning to include,e.g.,inverse problems dealing with the recovery of piecewise smooth functions or signals from data.Numerical examples are provided to demonstrate how this new technique is effectively employed.
