scholarly journals Robust Acoustic Imaging Based on Bregman Iteration and Fast Iterative Shrinkage-Thresholding Algorithm

Sensors ◽  
2020 ◽  
Vol 20 (24) ◽  
pp. 7298
Author(s):  
Linsen Huang ◽  
Shaoyu Song ◽  
Zhongming Xu ◽  
Zhifei Zhang ◽  
Yansong He
Keyword(s):  
Large Scale ◽  
Near Field ◽  
Low Frequency ◽  
Acoustic Imaging ◽  
Far Field ◽  
Frequency Range ◽  
Bregman Iteration ◽  
Iterative Shrinkage ◽  
Thresholding Algorithm ◽  
Iterative Shrinkage Thresholding

The acoustic imaging (AI) technique could map the position and the strength of the sound source via the signal processing of the microphone array. Conventional methods, including far-field beamforming (BF) and near-field acoustic holography (NAH), are limited to the frequency range of measured objects. A method called Bregman iteration based acoustic imaging (BI-AI) is proposed to enhance the performance of the two-dimensional acoustic imaging in the far-field and near-field measurements. For the large-scale ℓ1 norm problem, Bregman iteration (BI) acquires the sparse solution; the fast iterative shrinkage-thresholding algorithm (FISTA) solves each sub-problem. The interpolating wavelet method extracts the information about sources and refines the computational grid to underpin BI-AI in the low-frequency range. The capabilities of the proposed method were validated by the comparison between some tried-and-tested methods processing simulated and experimental data. The results showed that BI-AI separates the coherent sources well in the low-frequency range compared with wideband acoustical holography (WBH); BI-AI estimates better strength and reduces the width of main lobe compared with ℓ1 generalized inverse beamforming (ℓ1-GIB).

Accelerated 3D blind separation of convolved mixtures based on the fast iterative shrinkage thresholding algorithm for adaptive multiple subtraction

Geophysics ◽  
2018 ◽  
Vol 83 (2) ◽  
pp. V99-V113 ◽  
Author(s):  
Zhong-Xiao Li ◽  
Zhen-Chun Li
Keyword(s):  
Field Data ◽  
Optimization Problem ◽  
Computational Cost ◽  
Computation Time ◽  
Blind Separation ◽  
L1 Norm ◽  
Norm Minimization ◽  
Iterative Shrinkage ◽  
Thresholding Algorithm ◽  
Iterative Shrinkage Thresholding

After multiple prediction, adaptive multiple subtraction is essential for the success of multiple removal. The 3D blind separation of convolved mixtures (3D BSCM) method, which is effective in conducting adaptive multiple subtraction, needs to solve an optimization problem containing L1-norm minimization constraints on primaries by the iterative reweighted least-squares (IRLS) algorithm. The 3D BSCM method can better separate primaries and multiples than the 1D/2D BSCM method and the method with energy minimization constraints on primaries. However, the 3D BSCM method has high computational cost because the IRLS algorithm achieves nonquadratic optimization with an LS optimization problem solved in each iteration. In general, it is good to have a faster 3D BSCM method. To improve the adaptability of field data processing, the fast iterative shrinkage thresholding algorithm (FISTA) is introduced into the 3D BSCM method. The proximity operator of FISTA can solve the L1-norm minimization problem efficiently. We demonstrate that our FISTA-based 3D BSCM method achieves similar accuracy of estimating primaries as that of the reference IRLS-based 3D BSCM method. Furthermore, our FISTA-based 3D BSCM method reduces computation time by approximately 60% compared with the reference IRLS-based 3D BSCM method in the synthetic and field data examples.

scholarly journals Fast Algorithms for the Anisotropic LLT Model in Image Denoising

2011 ◽  
Vol 1 (3) ◽  
pp. 264-283 ◽  
Author(s):  
Zhi-Feng Pang ◽  
Li-Lian Wang ◽  
Yu-Fei Yang
Keyword(s):  
Convergence Rate ◽  
Image Denoising ◽  
Projection Method ◽  
Split Bregman Method ◽  
Split Bregman ◽  
Minimization Problems ◽  
Iterative Shrinkage ◽  
Speed Up ◽  
Thresholding Algorithm ◽  
Iterative Shrinkage Thresholding

AbstractIn this paper, we propose a new projection method for solving a general minimization problems with twoL1-regularization terms for image denoising. It is related to the split Bregman method, but it avoids solving PDEs in the iteration. We employ the fast iterative shrinkage-thresholding algorithm (FISTA) to speed up the proposed method to a convergence rateO(k−2). We also show the convergence of the algorithms. Finally, we apply the methods to the anisotropic Lysaker, Lundervold and Tai (LLT) model and demonstrate their efficiency.

scholarly journals A Sparse Spike Deconvolution Algorithm Based on a Recurrent Neural Network and the Iterative Shrinkage-Thresholding Algorithm

Energies ◽  
2020 ◽  
Vol 13 (12) ◽  
pp. 3074 ◽  
Author(s):  
Shulin Pan ◽  
Ke Yan ◽  
Haiqiang Lan ◽  
José Badal ◽  
Ziyu Qin
Keyword(s):  
Neural Network ◽  
Recurrent Neural Network ◽  
Seismic Data ◽  
Real Data ◽  
Training Dataset ◽  
Reflection Coefficients ◽  
Deconvolution Algorithm ◽  
Iterative Shrinkage ◽  
Thresholding Algorithm ◽  
Iterative Shrinkage Thresholding

Conventional sparse spike deconvolution algorithms that are based on the iterative shrinkage-thresholding algorithm (ISTA) are widely used. The aim of this type of algorithm is to obtain accurate seismic wavelets. When this is not fulfilled, the processing stops being optimum. Using a recurrent neural network (RNN) as deep learning method and applying backpropagation to ISTA, we have developed an RNN-like ISTA as an alternative sparse spike deconvolution algorithm. The algorithm is tested with both synthetic and real seismic data. The algorithm first builds a training dataset from existing well-logs seismic data and then extracts wavelets from those seismic data for further processing. Based on the extracted wavelets, the new method uses ISTA to calculate the reflection coefficients. Next, inspired by the backpropagation through time (BPTT) algorithm, backward error correction is performed on the wavelets while using the errors between the calculated reflection coefficients and the reflection coefficients corresponding to the training dataset. Finally, after performing backward correction over multiple iterations, a set of acceptable seismic wavelets is obtained, which is then used to deduce the sequence of reflection coefficients of the real data. The new algorithm improves the accuracy of the deconvolution results by reducing the effect of wrong seismic wavelets that are given by conventional ISTA. In this study, we account for the mechanism and the derivation of the proposed algorithm, and verify its effectiveness through experimentation using theoretical and real data.

scholarly journals Pre-selection of the candidate fields for deep imaging of the epoch of reionization with SKA1-low

2020 ◽  
Vol 499 (3) ◽  
pp. 3434-3444
Author(s):  
Qian Zheng ◽  
Xiang-Ping Wu ◽  
Quan Guo ◽  
Melanie Johnston-Hollitt ◽  
Huanyuan Shan ◽  
...  
Keyword(s):  
Surface Brightness ◽  
Low Frequency ◽  
Far Field ◽  
Frequency Range ◽  
High Quality ◽  
Average Surface ◽  
Square Kilometre Array ◽  
Broad Frequency Range ◽  
Deep Imaging ◽  
Selection Of

ABSTRACT The Square Kilometre Array (SKA) will be the first low-frequency instrument with the capability to directly image the structures of the epoch of reionization (EoR). Indeed, deep imaging of the EoR over five targeted fields of 20 sq deg each has been selected as the highest priority science objective for SKA1. Aiming at preparing for this highly challenging observation, we perform an extensive pre-selection of the ‘quietest’ and ‘cleanest’ candidate fields in the southern sky to be suited for deep imaging of the EoR using existing catalogues and observations over a broad frequency range. The candidate fields should meet a number of strict criteria to avoid contaminations from foreground structures and sources. The candidate fields should also exhibit both the lowest average surface brightness and smallest variance to ensure uniformity and high-quality deep imaging over the fields. Our selection eventually yields a sample of 7 ‘ideal’ fields of 20 sq deg in the southern sky that could be targeted for deep imaging of the EoR. Finally, these selected fields are convolved with the synthesized beam of SKA1-low stations to ensure that the effect of sidelobes from the far-field bright sources is also weak.

WAVELET-BASED POSTPROCESSING OF JET LES DATA FOR ACOUSTIC FAR-FIELD EXTRAPOLATIONS

2013 ◽  
Vol 21 (04) ◽  
pp. 1350017
Author(s):  
RAMIN KAVIANI ◽  
VAHID ESFAHANIAN ◽  
MOHAMMAD EBRAHIMI
Keyword(s):  
Large Scale ◽  
Stokes Equations ◽  
Near Field ◽  
Flow Simulation ◽  
Computational Time ◽  
Jet Flows ◽  
Small Scale ◽  
Frequency Noise ◽  
Far Field ◽  
Noise Sources

The affordable grid resolutions in conventional large-eddy simulations (LESs) of high Reynolds jet flows are unable to capture the sound generated by fluid motions near and beyond the grid cut-off scale. As a result, the frequency spectrum of the extrapolated sound field is artificially truncated at high frequencies. In this paper, a new method is proposed to account for the high frequency noise sources beyond the resolution of a compressible flow simulation. The large-scale turbulent structures as dominant radiators of sound are captured in LES, satisfying filtered Navier–Stokes equations, while for small-scale turbulence, a Kolmogorov's turbulence spectrum is imposed. The latter is performed via a wavelet-based extrapolation to add randomly generated small-scale noise sources to the LES near-field data. Further, the vorticity and instability waves are filtered out via a passive wavelet-based masking and the whole spectrum of filtered data are captured on a Ffowcs-Williams/Hawkings (FW-H) surface surrounding the near-field region and are projected to acoustic far-field. The algorithm can be implemented as a separate postprocessing stage and it is observed that the computational time is considerably reduced utilizing a hybrid of many-core and multi-core framework, i.e. MPI-CUDA programming. The comparison of the results obtained from this procedure and those from experiments for high subsonic and transonic jets, shows that the far-field noise spectrum agree well up to 2 times of the grid cut-off frequency.

Sign in / Sign up

Export Citation Format

Share Document