Dynamic smoothing in crosswell traveltime tomography

Geophysics ◽  
1997 ◽  
Vol 62 (1) ◽  
pp. 168-176 ◽  
Author(s):  
Tamas Nemeth ◽  
Egon Normark ◽  
Fuhao Qin

Variable‐size (dynamic) smoothing operator constraints are applied in crosswell traveltime tomography to reconstruct both the smooth‐ and fine‐scale details of the tomogram. In mixed and underdetermined problems a large number of iterations may be necessary to introduce the slowly varying slowness features into the tomogram. To speed up convergence, the dynamic smoothing operator applies adaptive regularization to the traveltime prediction error function with the help of the model covariance matrix. By so doing, the regularization term has a larger weight at initial iterations and the prediction error term dominates the final iterations with a small regularization term weight. In addition, it is shown that adaptive regularization acts by reweighting the adjoint modeling operator (preconditioning) and by providing additional damping. Comparisons of two dynamic smoothing operators, the low‐pass filter smoothing and the multigrid technique, with the fixed‐size (static) smoothing operators show that the dynamic smoothing operator yields more accurate velocity distributions with greater stability for larger velocity contrasts. Consequently, it is a preferred choice for regularization.

2021 ◽  
Author(s):  
Tahir Jaffer

A new local image processing algorithm, the Tahir algorithm, is an adaptation to the standard low-pass filter. Its design is for images that have the spectrum of pixel intensity concentrated at the lower end of the intensity spectrum. Window memoization is a specialization of memoization. Memoization is a technique to reduce computational redundancy by skipping redundant calculations and storing results in memory. An adaptation for window memozation is developed based on improved symbol generation and a new eviction policy. On implementation, the mean lower-bound speed-up achieved was between 0.32 (slowdown of approximately 3) and 3.70 with a peak of 4.86. Lower-bound speed-up is established by accounting for the time to create and delete the cache. Window memoization was applied to: the convolution technique, Trajkovic corner detection algorithm and the Tahir algorithm. Window memoization can be evaluated by calculating both the speed-up achieved and the error introduced to the output image.


2021 ◽  
Author(s):  
Tahir Jaffer

A new local image processing algorithm, the Tahir algorithm, is an adaptation to the standard low-pass filter. Its design is for images that have the spectrum of pixel intensity concentrated at the lower end of the intensity spectrum. Window memoization is a specialization of memoization. Memoization is a technique to reduce computational redundancy by skipping redundant calculations and storing results in memory. An adaptation for window memozation is developed based on improved symbol generation and a new eviction policy. On implementation, the mean lower-bound speed-up achieved was between 0.32 (slowdown of approximately 3) and 3.70 with a peak of 4.86. Lower-bound speed-up is established by accounting for the time to create and delete the cache. Window memoization was applied to: the convolution technique, Trajkovic corner detection algorithm and the Tahir algorithm. Window memoization can be evaluated by calculating both the speed-up achieved and the error introduced to the output image.


2017 ◽  
Vol E100.C (10) ◽  
pp. 858-865 ◽  
Author(s):  
Yohei MORISHITA ◽  
Koichi MIZUNO ◽  
Junji SATO ◽  
Koji TAKINAMI ◽  
Kazuaki TAKAHASHI

2016 ◽  
Vol 15 (12) ◽  
pp. 2579-2586
Author(s):  
Adina Racasan ◽  
Calin Munteanu ◽  
Vasile Topa ◽  
Claudia Pacurar ◽  
Claudia Hebedean

Author(s):  
Nanan Chomnak ◽  
Siradanai Srisamranrungrueang ◽  
Natapong Wongprommoon
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document