scholarly journals Sparse Signal Reconstruction Based on Multiparameter Approximation Function with Smoothedl0Norm

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Xiao-Feng Fang ◽  
Jiang-She Zhang ◽  
Ying-Qi Li
Keyword(s):  
Optimization Problem ◽  
Null Space ◽  
Signal Reconstruction ◽  
Iteration Process ◽  
Reconstruction Algorithm ◽  
Measurement Matrix ◽  
Hyperbolic Tangent ◽  
Reconstruction Quality ◽  
And Performance ◽  
Quasi Newton

The smoothedl0norm algorithm is a reconstruction algorithm in compressive sensing based on approximate smoothedl0norm. It introduces a sequence of smoothed functions to approximate thel0norm and approaches the solution using the specific iteration process with the steepest method. In order to choose an appropriate sequence of smoothed function and solve the optimization problem effectively, we employ approximate hyperbolic tangent multiparameter function as the approximation to the big “steep nature” inl0norm. Simultaneously, we propose an algorithm based on minimizing a reweighted approximatel0norm in the null space of the measurement matrix. The unconstrained optimization involved is performed by using a modified quasi-Newton algorithm. The numerical simulation results show that the proposed algorithms yield improved signal reconstruction quality and performance.

scholarly journals MIMO Radar Imaging Based on Smoothedl0Norm

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Jun-Jie Feng ◽  
Gong Zhang ◽  
Fang-Qing Wen
Keyword(s):  
Matching Pursuit ◽  
Signal Reconstruction ◽  
Reconstruction Algorithm ◽  
Radar Imaging ◽  
Mimo Radar ◽  
Hyperbolic Tangent ◽  
Imaging Algorithm ◽  
Two Dimensional Image ◽  
Tangent Function

For radar imaging, a target usually has only a few strong scatterers which are sparsely distributed. In this paper, we propose a compressive sensing MIMO radar imaging algorithm based on smoothedl0norm. An approximate hyperbolic tangent function is proposed as the smoothed function to measure the sparsity. A revised Newton method is used to solve the optimization problem by deriving the new revised Newton directions for the sequence of approximate hyperbolic tangent functions. In order to improve robustness of the imaging algorithm, main value weighted method is proposed. Simulation results show that the proposed algorithm is superior to Orthogonal Matching Pursuit (OMP), smoothedl0method (SL0), and Bayesian method with Laplace prior in performance of sparse signal reconstruction. Two-dimensional image quality of MIMO radar using the new method has great improvement comparing with aforementioned reconstruction algorithm.

scholarly journals Robust Estimation of the Unbalance of Rotor Systems Based on Sparsity Control of the Residual Model

2018 ◽  
Vol 2018 ◽  
pp. 1-8
Author(s):  
Tingpeng Zang ◽  
Guangrui Wen ◽  
Zhifen Zhang
Keyword(s):  
Optimization Problem ◽  
Signal Reconstruction ◽  
External Disturbance ◽  
Reconstruction Algorithm ◽  
Working Environment ◽  
External Disturbances ◽  
Convex Optimization Problem ◽  
Rotor Systems ◽  
Vibration Data ◽  
The Impact

The vibration signals of rotating machinery are frequently disturbed by background noise and external disturbances because of the equipment’s particular working environment. Thus, robustness has become one of the most important problems in identifying the unbalance of rotor systems. Based on the observation that external disturbance of the unbalance response often displays sparsity compared with measured vibration data, we present a new robust method for identifying the unbalance of rotor systems based on model residual sparsity control. The residual model is composed of two parts: one part takes regular measurements of noise, while the other part evaluates the impact of external disturbances. With the help of the sparsity of external disturbances, the unbalance identification is converted into a convex optimization problem and solved by a sparse signal reconstruction algorithm. Experiment results have shown that the proposed method is robust and effective in identifying the unbalance of rotor systems in a complex environment, improving the precision of unbalance estimation and simplifying the balancing process.

Image Reconstruction with the Fourier Coefficients for Magnetic Induction Tomography

2020 ◽  
Vol 16 (2) ◽  
pp. 156-163
Author(s):  
Jingwen Wang ◽  
Xu Wang ◽  
Dan Yang ◽  
Kaiyang Wang
Keyword(s):  
Inverse Problem ◽  
Image Reconstruction ◽  
Magnetic Induction ◽  
Fourier Coefficients ◽  
Signal Reconstruction ◽  
Reconstruction Algorithm ◽  
Reconstruction Method ◽  
Measurement Equation ◽  
Image Reconstruction Method ◽  
Magnetic Induction Tomography

Background: Image reconstruction of magnetic induction tomography (MIT) is a typical ill-posed inverse problem, which means that the measurements are always far from enough. Thus, MIT image reconstruction results using conventional algorithms such as linear back projection and Landweber often suffer from limitations such as low resolution and blurred edges. Methods: In this paper, based on the recent finite rate of innovation (FRI) framework, a novel image reconstruction method with MIT system is presented. Results: This is achieved through modeling and sampling the MIT signals in FRI framework, resulting in a few new measurements, namely, fourier coefficients. Because each new measurement contains all the pixel position and conductivity information of the dense phase medium, the illposed inverse problem can be improved, by rebuilding the MIT measurement equation with the measurement voltage and the new measurements. Finally, a sparsity-based signal reconstruction algorithm is presented to reconstruct the original MIT image signal, by solving this new measurement equation. Conclusion: Experiments show that the proposed method has better indicators such as image error and correlation coefficient. Therefore, it is a kind of MIT image reconstruction method with high accuracy.

Adaptive Complex Method for Efficient Design Optimization

2007 ◽  
Author(s):  
Marcus Pettersson ◽  
Johan O¨lvander
Keyword(s):  
Design Optimization ◽  
Optimization Problem ◽  
Global Optimum ◽  
Direct Search ◽  
Complex Method ◽  
Efficient Design ◽  
Direct Search Methods ◽  
Simulation Based ◽  
Set Of Points ◽  
Quasi Newton

Box’s Complex method for direct search has shown promise when applied to simulation based optimization. In direct search methods, like Box’s Complex method, the search starts with a set of points, where each point is a solution to the optimization problem. In the Complex method the number of points must be at least one plus the number of variables. However, in order to avoid premature termination and increase the likelihood of finding the global optimum more points are often used at the expense of the required number of evaluations. The idea in this paper is to gradually remove points during the optimization in order to achieve an adaptive Complex method for more efficient design optimization. The proposed method shows encouraging results when compared to the Complex method with fix number of points and a quasi-Newton method.

scholarly journals An Efficient Signal Reconstruction Algorithm for Stepped Frequency MIMO-SAR in the Spotlight and Sliding Spotlight Modes

2014 ◽  
Vol 2014 ◽  
pp. 1-8
Author(s):  
Jiajia Zhang ◽  
Guangcai Sun ◽  
Mengdao Xing ◽  
Zheng Bao ◽  
Fang Zhou
Keyword(s):  
Efficient Algorithm ◽  
Low Cost ◽  
Signal Reconstruction ◽  
Multiple Input Multiple Output ◽  
Reconstruction Algorithm ◽  
Synthetic Aperture ◽  
Two Dimensional ◽  
Multiple Input ◽  
Input Multiple Output ◽  
Stepped Frequency

Multiple-input multiple-output (MIMO) synthetic aperture radar (SAR) using stepped frequency (SF) waveforms enables a high two-dimensional (2D) resolution with wider imaging swath at relatively low cost. However, only the stripmap mode has been discussed for SF MIMO-SAR. This paper presents an efficient algorithm to reconstruct the signal of SF MIMO-SAR in the spotlight and sliding spotlight modes, which includes Doppler ambiguity resolving algorithm based on subaperture division and an improved frequency-domain bandwidth synthesis (FBS) method. Both simulated and constructed data are used to validate the effectiveness of the proposed algorithm.

Online Assortment Optimization with Reusable Resources

2021 ◽  
Author(s):  
Xiao-Yue Gong ◽  
Vineet Goyal ◽  
Garud N. Iyengar ◽  
David Simchi-Levi ◽  
Rajan Udwani ◽  
...  
Keyword(s):  
Optimization Problem ◽  
Online Algorithm ◽  
Random Number ◽  
Optimal Algorithm ◽  
User Preference ◽  
Substitutable Products ◽  
Assortment Optimization ◽  
Myopic Policy ◽  
Expected Revenue ◽  
And Performance

We consider an online assortment optimization problem where we have n substitutable products with fixed reusable capacities [Formula: see text]. In each period t, a user with some preferences (potentially adversarially chosen) who offers a subset of products, St, from the set of available products arrives at the seller’s platform. The user selects product [Formula: see text] with probability given by the preference model and uses it for a random number of periods, [Formula: see text], that is distributed i.i.d. according to some distribution that depends only on j generating a revenue [Formula: see text] for the seller. The goal of the seller is to find a policy that maximizes the expected cumulative revenue over a finite horizon T. Our main contribution is to show that a simple myopic policy (where we offer the myopically optimal assortment from the available products to each user) provides a good approximation for the problem. In particular, we show that the myopic policy is 1/2-competitive, that is, the expected cumulative revenue of the myopic policy is at least half the expected revenue of the optimal policy with full information about the sequence of user preference models and the distribution of random usage times of all the products. In contrast, the myopic policy does not require any information about future arrivals or the distribution of random usage times. The analysis is based on a coupling argument that allows us to bound the expected revenue of the optimal algorithm in terms of the expected revenue of the myopic policy. We also consider the setting where usage time distributions can depend on the type of each user and show that in this more general case there is no online algorithm with a nontrivial competitive ratio guarantee. Finally, we perform numerical experiments to compare the robustness and performance of myopic policy with other natural policies. This paper was accepted by Gabriel Weintraub, revenue management and analytics.

Gravity anomaly reconstruction based on nonequispaced Fourier transform

Geophysics ◽  
2019 ◽  
Vol 84 (6) ◽  
pp. G83-G92
Author(s):  
Ya Xu ◽  
Fangzhou Nan ◽  
Weiping Cao ◽  
Song Huang ◽  
Tianyao Hao
Keyword(s):  
Fourier Transform ◽  
Compressed Sensing ◽  
Gravity Data ◽  
Signal Reconstruction ◽  
Gaussian Function ◽  
Reconstruction Algorithm ◽  
Data Reconstruction ◽  
Reconstruction Method ◽  
Grid Data ◽  
2D Data

Irregular sampled gravity data are often interpolated into regular grid data for convenience of data processing and interpretation. The compressed sensing theory provides a signal reconstruction method that can recover a sparse signal from far fewer samples. We have introduced a gravity data reconstruction method based on the nonequispaced Fourier transform (NFT) in the framework of compressed sensing theory. We have developed a sparsity analysis and a reconstruction algorithm with an iterative cooling thresholding method and applied to the gravity data of the Bishop model. For 2D data reconstruction, we use two methods to build the weighting factors: the Gaussian function and the Voronoi method. Both have good reconstruction results from the 2D data tests. The 2D reconstruction tests from different sampling rates and comparison with the minimum curvature and the kriging methods indicate that the reconstruction method based on the NFT has a good reconstruction result even with few sampling data.

scholarly journals WSNs Compressed Sensing Signal Reconstruction Based on Improved Kernel Fuzzy Clustering and Discrete Differential Evolution Algorithm

2019 ◽  
Vol 2019 ◽  
pp. 1-9
Author(s):  
Zhou-zhou Liu ◽  
Shi-ning Li
Keyword(s):  
Compressed Sensing ◽  
Differential Evolution ◽  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Signal Reconstruction ◽  
Differential Evolution Algorithm ◽  
Reconstruction Algorithm ◽  
Reconstruction Algorithms ◽  
Evolution Algorithm ◽  
Discrete Differential Evolution

To reconstruct compressed sensing (CS) signal fast and accurately, this paper proposes an improved discrete differential evolution (IDDE) algorithm based on fuzzy clustering for CS reconstruction. Aiming to overcome the shortcomings of traditional CS reconstruction algorithm, such as heavy dependence on sparsity and low precision of reconstruction, a discrete differential evolution (DDE) algorithm based on improved kernel fuzzy clustering is designed. In this algorithm, fuzzy clustering algorithm is used to analyze the evolutionary population, which improves the pertinence and scientificity of population learning evolution while realizing effective clustering. The differential evolutionary particle coding method and evolutionary mechanism are redefined. And the improved fuzzy clustering discrete differential evolution algorithm is applied to CS reconstruction algorithm, in which signal with unknown sparsity is considered as particle coding. Then the wireless sensor networks (WSNs) sparse signal is accurately reconstructed through the iterative evolution of population. Finally, simulations are carried out in the WSNs data acquisition environment. Results show that compared with traditional reconstruction algorithms such as StOMP, the reconstruction accuracy of the algorithm proposed in this paper is improved by 36.4-51.9%, and the reconstruction time is reduced by 15.1-31.3%.

Sign in / Sign up

Export Citation Format

Share Document