A Randomized Framework for Estimating Image Saliency Through Sparse Signal Reconstruction

Author(s):  
Kui Fu ◽  
Jia Li

This article proposes a randomized framework that estimates image saliency through sparse signal reconstruction. The authors simulate the measuring process of ground-truth saliency and assume that an image is free-viewed by several subjects. In the free-viewing process, each subject attends to a limited number of regions randomly selected, and a mental map of the image is reconstructed by using the subject-specific prior knowledge. By assuming that a region is difficult to be reconstructed will become conspicuous, the authors represent the prior knowledge of a subject by a dictionary of sparse bases pre-trained on random images and estimate the conspicuity score of a region according to the activation costs of sparse bases as well as the sparse reconstruction error. Finally, the saliency map of an image is generated by summing up all conspicuity maps obtained. Experimental results show proposed approach achieves impressive performance in comparisons with 16 state-of-the-art approaches.

2016 ◽  
Vol 2016 ◽  
pp. 1-11
Author(s):  
Chanzi Liu ◽  
Qingchun Chen ◽  
Bingpeng Zhou ◽  
Hengchao Li

Many problems in signal processing and statistical inference involve finding sparse solution to some underdetermined linear system of equations. This is also the application condition of compressive sensing (CS) which can find the sparse solution from the measurements far less than the original signal. In this paper, we proposel1- andl2-norm joint regularization based reconstruction framework to approach the originall0-norm based sparseness-inducing constrained sparse signal reconstruction problem. Firstly, it is shown that, by employing the simple conjugate gradient algorithm, the new formulation provides an effective framework to deduce the solution as the original sparse signal reconstruction problem withl0-norm regularization item. Secondly, the upper reconstruction error limit is presented for the proposed sparse signal reconstruction framework, and it is unveiled that a smaller reconstruction error thanl1-norm relaxation approaches can be realized by using the proposed scheme in most cases. Finally, simulation results are presented to validate the proposed sparse signal reconstruction approach.


2021 ◽  
Vol 140 ◽  
pp. 100-112
Author(s):  
You Zhao ◽  
Xiaofeng Liao ◽  
Xing He ◽  
Rongqiang Tang ◽  
Weiwei Deng

Sensors ◽  
2018 ◽  
Vol 18 (10) ◽  
pp. 3373 ◽  
Author(s):  
Ziran Wei ◽  
Jianlin Zhang ◽  
Zhiyong Xu ◽  
Yongmei Huang ◽  
Yong Liu ◽  
...  

In the reconstruction of sparse signals in compressed sensing, the reconstruction algorithm is required to reconstruct the sparsest form of signal. In order to minimize the objective function, minimal norm algorithm and greedy pursuit algorithm are most commonly used. The minimum L1 norm algorithm has very high reconstruction accuracy, but this convex optimization algorithm cannot get the sparsest signal like the minimum L0 norm algorithm. However, because the L0 norm method is a non-convex problem, it is difficult to get the global optimal solution and the amount of calculation required is huge. In this paper, a new algorithm is proposed to approximate the smooth L0 norm from the approximate L2 norm. First we set up an approximation function model of the sparse term, then the minimum value of the objective function is solved by the gradient projection, and the weight of the function model of the sparse term in the objective function is adjusted adaptively by the reconstruction error value to reconstruct the sparse signal more accurately. Compared with the pseudo inverse of L2 norm and the L1 norm algorithm, this new algorithm has a lower reconstruction error in one-dimensional sparse signal reconstruction. In simulation experiments of two-dimensional image signal reconstruction, the new algorithm has shorter image reconstruction time and higher image reconstruction accuracy compared with the usually used greedy algorithm and the minimum norm algorithm.


2019 ◽  
Vol 26 (10) ◽  
pp. 1541-1545 ◽  
Author(s):  
Yunmei Shi ◽  
Xing-Peng Mao ◽  
Chunlei Zhao ◽  
Yong-Tan Liu

2021 ◽  
Author(s):  
Han Wang ◽  
Xianpeng Wang

Abstract For the sparse correlation between channels in multiple input multiple output filter bank multicarrier with offset quadrature amplitude modulation (MIMO-FBMC/OQAM) systems, the distributed compressed sensing (DCS)-based channel estimation approach is studied. A sparse adaptive distributed sparse channel estimation method based on weak selection threshold is proposed. Firstly, the correlation between MIMO channels is utilized to represent a joint sparse model, and channel estimation is transformed into a joint sparse signal reconstruction problem. Then, the number of correlation atoms for inner product operation is optimized by weak selection threshold, and sparse signal reconstruction is realized by sparse adaptation. The experiment results show that proposed DCS-based method not only estimates the multipath channel components accurately but also achieves higher channel estimation performance than classical orthogonal matching pursuit (OMP) method and other traditional DCS methods in the time-frequency dual selective channels.


Sign in / Sign up

Export Citation Format

Share Document