اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدModel-Based Photoacoustic Image Reconstruction using Compressed Sensing and Smoothed L0 Norm
66
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Photoacoustic imaging (PAI) is a novel medical imaging modality that uses the advantages of the spatial resolution of ultrasound imaging and the high contrast of pure optical imaging. Analytical algorithms are usually employed to reconstruct the photoacoustic (PA) images as a result of their simple implementation. However, they provide a low accurate image. Model-based (MB) algorithms are used to improve the image quality and accuracy while a large number of transducers and data acquisition are needed. In this paper, we have combined the theory of compressed sensing (CS) with MB algorithms to reduce the number of transducer. Smoothed version of L0-norm (SL0) was proposed as the reconstruction method, and it was compared with simple iterative reconstruction (IR) and basis pursuit. The results show that S$ell_0$ provides a higher image quality in comparison with other methods while a low number of transducers were. Quantitative comparison demonstrates that, at the same condition, the SL0 leads to a peak-signal-to-noise ratio for about two times of the basis pursuit.
قيم البحث
اقرأ أيضاً
In this paper, we propose a method to address the problem of source estimation for Sparse Component Analysis (SCA) in the presence of additive noise. Our method is a generalization of a recently proposed method (SL0), which has the advantage of direc
tly minimizing the L0-norm instead of L1-norm, while being very fast. SL0 is based on minimization of the smoothed L0-norm subject to As=x. In order to better estimate the source vector for noisy mixtures, we suggest then to remove the constraint As=x, by relaxing exact equality to an approximation (we call our method Smoothed L0-norm Denoising or SL0DN). The final result can then be obtained by minimization of a proper linear combination of the smoothed L0-norm and a cost function for the approximation. Experimental results emphasize on the significant enhancement of the modified method in noisy cases.
In this paper, a fast algorithm for overcomplete sparse decomposition, called SL0, is proposed. The algorithm is essentially a method for obtaining sparse solutions of underdetermined systems of linear equations, and its applications include underdet
ermined Sparse Component Analysis (SCA), atomic decomposition on overcomplete dictionaries, compressed sensing, and decoding real field codes. Contrary to previous methods, which usually solve this problem by minimizing the L1 norm using Linear Programming (LP) techniques, our algorithm tries to directly minimize the L0 norm. It is experimentally shown that the proposed algorithm is about two to three orders of magnitude faster than the state-of-the-art interior-point LP solvers, while providing the same (or better) accuracy.
L0-regularization-based compressed sensing (L0-RBCS) is capable of outperforming L1-RBCS, but it is difficult to solve an optimization problem for L0-RBCS that cannot be formulated as a convex optimization. To achieve the optimization for L0-RBCS, we
propose a quantum-classical hybrid system consisting of a quantum machine and a classical digital processor. Because forming a densely-connected network on a quantum machine is required for solving this problem, the coherent Ising machine (CIM) is one of suitable quantum machines for composing this hybrid system. To evaluate theoretically the performance of the CIM-classical hybrid system, a truncated Wigner stochastic differential equation (W-SDE) is obtained from the master equation for the density operator of the network of degenerate optical parametric oscillators, and macroscopic equations are derived from the W-SDE using statistical mechanics. We show that the system performance in principle approaches the theoretical limit of compressed sensing and in practical situations this hybrid system can exceed L1-RBCSs estimation accuracy.
In a frequency division duplex (FDD) massive multiple input multiple output (MIMO) system, the channel state information (CSI) feedback causes a significant bandwidth resource occupation. In order to save the uplink bandwidth resources, a 1-bit compr
essed sensing (CS)-based CSI feedback method assisted by superimposed coding (SC) is proposed. Using 1-bit CS and SC techniques, the compressed support-set information and downlink CSI (DL-CSI) are superimposed on the uplink user data sequence (UL-US) and fed back to base station (BS). Compared with the SC-based feedback, the analysis and simulation results show that the UL-USs bit error ratio (BER) and the DL-CSIs accuracy can be improved in the proposed method, without using the exclusive uplink bandwidth resources to feed DL-CSI back to BS.
Many interesting problems in fields ranging from telecommunications to computational biology can be formalized in terms of large underdetermined systems of linear equations with additional constraints or regularizers. One of the most studied ones, th
e Compressed Sensing problem (CS), consists in finding the solution with the smallest number of non-zero components of a given system of linear equations $boldsymbol y = mathbf{F} boldsymbol{w}$ for known measurement vector $boldsymbol{y}$ and sensing matrix $mathbf{F}$. Here, we will address the compressed sensing problem within a Bayesian inference framework where the sparsity constraint is remapped into a singular prior distribution (called Spike-and-Slab or Bernoulli-Gauss). Solution to the problem is attempted through the computation of marginal distributions via Expectation Propagation (EP), an iterative computational scheme originally developed in Statistical Physics. We will show that this strategy is comparatively more accurate than the alternatives in solving instances of CS generated from statistically correlated measurement matrices. For computational strategies based on the Bayesian framework such as variants of Belief Propagation, this is to be expected, as they implicitly rely on the hypothesis of statistical independence among the entries of the sensing matrix. Perhaps surprisingly, the method outperforms uniformly also all the other state-of-the-art methods in our tests.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
