Tomographic reconstruction and estimation based on multiscalenatural-pixel bases

We use a natural pixel-type representation of an object, originally developed for incomplete data tomography problems, to construct nearly orthonormal multiscale basis functions. The nearly orthonormal behavior of the multiscale basis functions results in a system matrix, relating the input (the object coefficients) and the output (the projection data), which is extremely sparse. In addition, the coarsest scale elements of this matrix capture any ill conditioning in the system matrix arising from the geometry of the imaging system. We exploit this feature to partition the system matrix by scales and obtain a reconstruction procedure that requires inversion of only a well-conditioned and sparse matrix. This enables us to formulate a tomographic reconstruction technique from incomplete data wherein the object is reconstructed at multiple scales or resolutions. In case of noisy projection data we extend our multiscale reconstruction technique to explicitly account for noise by calculating maximum a posteriori probability (MAP) multiscale reconstruction estimates based on a certain self-similar prior on the multiscale object coefficients. The framework for multiscale reconstruction presented can find application in regularization of imaging problems where the projection data are incomplete, irregular, and noisy, and in object feature recognition directly from projection data.     

Theoretical study of lesion detectability of MAP reconstruction using computer observers

The low signal-to-noise ratio (SNR) in emission data has stimulated the development of statistical image reconstruction methods based on the maximum a posteriori (MAP) principle. Experimental examples have shown that statistical methods improve image quality compared to the conventional filtered backprojection (FBP) method. However, these results depend on isolated data sets. Here we study the lesion detectability of MAP reconstruction theoretically, using computer observers. These theoretical results can be applied to different object structures. They show that for a quadratic smoothing prior, the lesion detectability using the prewhitening observer is independent of the smoothing parameter and the neighborhood of the prior, while the nonprewhitening observer exhibits an optimum smoothing point. We also compare the results to those of FBP reconstruction. The comparison shows that for ideal positron emission tomography (PET) systems (where data are true line integrals of the tracer distribution) the MAP reconstruction has a higher SNR for lesion detection than FBP reconstruction due to the modeling of the Poisson noise. For realistic systems, MAP reconstruction further benefits from accurately modeling the physical photon detection process in PET.     

Multi-Parameter Regularization Methods for High-Resolution Image Reconstruction With Displacement Errors

We propose multi-parameter regularization methods for high-resolution image reconstruction which is described by an ill-posed problem. The regularization operator for the ill-posed problem is decomposed in a multiscale manner by using bi-orthogonal wavelets or tight frames. In the multiscale framework, for different scales of the operator we introduce different regularization parameters. These methods are analyzed under certain reasonable hypotheses. Numerical examples are presented to demonstrate the efficiency and accuracy of these methods.     

Comparison of 3-D maximum a posteriori and filtered backprojection algorithms for high-resolution animal imaging with microPET

We have evaluated the performance of two three-dimensional (3-D) reconstruction algorithms with data acquired from microPET, a high resolution tomograph dedicated to small animal imaging. The first was a linear filtered-backprojection algorithm (FBP) with reprojection of the missing data, and the second was a statistical maximum a posteriori probability algorithm (MAP). The two algorithms were evaluated in terms of their resolution performance, both in phantoms and in vivo. Sixty independent realizations of a phantom simulating the brain of a baby monkey were acquired, each containing three million counts. Each of these realizations was reconstructed independently with both algorithms. The ensemble of the 60 reconstructed realizations was used to estimate the standard deviation as a measure of the noise for each reconstruction algorithm. More detail was recovered in the MAP reconstruction without an increase in noise relative to FBP. Studies in a simple cylindrical compartment phantom demonstrated improved recovery of known activity ratios with MAP. Finally, in vivo studies also demonstrated a clear improvement in spatial resolution using the MAP algorithm. The quantitative accuracy of the MAP reconstruction was also evaluated by comparison with autoradiography and direct well counting of tissue samples and was shown to be superior.     

Modification of the MAP algorithm for memory savings

It is usually assumed that all state metric values are necessary in the maximum a posteriori (MAP) algorithm in order to compute the a posteriori probability (APP) values. This work extends the mathematical derivation of the original MAP algorithm and shows that the log likelihood values can be computed using only partial state metric values. By processing N stages in a trellis concurrently, the proposed algorithm results in savings in the required memory size and leads to a power efficient implementation of the MAP algorithm in channel decoding. The computational complexity analysis for the proposed algorithm is presented. Especially for the N=2 case, we show that the proposed algorithm halves the memory requirement without increasing the computational complexity.     

Simple MAP decoding of first-order Reed-Muller and Hamming codes

A maximum a posteriori (MAP) probability decoder of a block code minimizes the probability of error for each transmitted symbol separately. The standard way of implementing MAP decoding of a linear code is the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm, which is based on a trellis representation of the code. The complexity of the BCJR algorithm for the first-order Reed-Muller (RM-1) codes and Hamming codes is proportional to n/sup 2/, where n is the code's length. In this correspondence, we present new MAP decoding algorithms for binary and nonbinary RM-1 and Hamming codes. The proposed algorithms have complexities proportional to q/sup 2/n log/sub q/n, where q is the alphabet size. In particular, for the binary codes this yields complexity of order n log n.     

BAD: bidirectional arbitrated decision-feedback equalization

The bidirectional arbitrated decision-feedback equalizer (BAD), which has bit-error rate performance between a decision-feedback equalizer (DFE) and maximum a posteriori (MAP) detection, is presented. The computational complexity of the BAD algorithm is linear in the channel length, which is the same as that of the DFE, and significantly lower than the exponential complexity of the MAP detector. While the relative performance of BAD to those of the DFE and the MAP detector depends on the specific channel model, for an error probability of 10/sup -2/, the performance of BAD is typically 1-2 dB better than that of the DFE, and within 1 dB of the performance of MAP detection.     

双向中继信道中物理层网络编码的检测

对双向中继信道中物理层网络编码的检测进行了研究,最大似然检测性能好但是实现复杂度高。因此,在信源节点未知信道状态信息情况下,提出了2种检测方案:基于似然比函数的似然比检测和基于最大后验概率准则的最大后验概率检测。同时,针对信源节点已知信道状态信息的特殊情形,进行了同样的推导。分析和仿真结果表明,相比于分别检测出2个信源信息的最大似然检测,似然比检测的BER性能更优,但似然比检测需要知道额外的噪声方差信息,最大后验概率检测与最大似然检测等价,而且最大后验概率检测在实现复杂度上相对较低。     

On the partial MAP detection with applications to MIMO channels

We investigate a multidimensional detection problem with a partial information of the a posteriori probability, which is referred to as the partial maximum a posteriori probability (MAP) detection problem. We show that the maximum likelihood (ML) detection of a higher dimension can be reduced to the ML detection of a lower dimension with cancellation under a certain condition through the formulation of the partial MAP detection problem. Using this, we can propose a computationally efficient algorithm to apply to the detection problem for multiple input multiple output (MIMO) channels including multiple transmit and multiple receive antenna (MTMR) channels and intersymbol interference (ISI) channels. It is shown that the proposed method has less error propagation effect, and its performance is close to that of the full ML detection with a lower computational complexity.     

Multiscale hybrid linear models for lossy image representation.

In this paper, we introduce a simple and efficient representation for natural images. We view an image (in either the spatial domain or the wavelet domain) as a collection of vectors in a high-dimensional space. We then fit a piece-wise linear model (i.e., a union of affine subspaces) to the vectors at each downsampling scale. We call this a multiscale hybrid linear model for the image. The model can be effectively estimated via a new algebraic method known as generalized principal component analysis (GPCA). The hybrid and hierarchical structure of this model allows us to effectively extract and exploit multimodal correlations among the imagery data at different scales. It conceptually and computationally remedies limitations of many existing image representation methods that are based on either a fixed linear transformation (e.g., DCT, wavelets), or an adaptive uni-modal linear transformation (e.g., PCA), or a multimodal model that uses only cluster means (e.g., VQ). We will justify both quantitatively and experimentally why and how such a simple multiscale hybrid model is able to reduce simultaneously the model complexity and computational cost. Despite a small overhead of the model, our careful and extensive experimental results show that this new model gives more compact representations for a wide variety of natural images under a wide range of signal-to-noise ratios than many existing methods, including wavelets. We also briefly address how the same (hybrid linear) modeling paradigm can be extended to be potentially useful for other applications, such as image segmentation.     

Performance evaluation of an iterative image reconstruction algorithm for positron emission tomography

An image reconstruction method motivated by positron emission tomography (PET) is discussed. The measurements tend to be noisy and so the reconstruction method should incorporate the statistical nature of the noise. The authors set up a discrete model to represent the physical situation and arrive at a nonlinear maximum a posteriori probability (MAP) formulation of the problem. An iterative approach which requires the solution of simple quadratic equations is proposed. The authors also present a methodology which allows them to experimentally optimize an image reconstruction method for a specific medical task and to evaluate the relative efficacy of two reconstruction methods for a particular task in a manner which meets the high standards set by the methodology of statistical hypothesis testing. The new MAP algorithm is compared to a method which maximizes likelihood and with two variants of the filtered backprojection method.     

Turbo equalization with sequential sequence estimation overmultipath fading channels

We investigate the performance of a turbo equalization scheme over frequency-selective fading channels, where a soft-output sequential algorithm is employed as the estimation algorithm. The advantage of this scheme comes from the low computational complexity of the sequential algorithm, which is only linearly dependent on the channel memory length. Simulation results of an 8-PSK trellis-coded modulation (TCM) system show that the performance of this scheme suffers approximately 2-dB loss compared with that of the turbo max-log maximum a posteriori (MAP) probability equalizer after 5 iterations     

Modified maximum a posteriori decoding algorithm

A modified maximum a posteriori (MMAP) decoding algorithm that uses two extrinsic information values as the thresholds to determine the log-likelihood ratio, forward recursion probability and backward recursion probability is proposed. The MMAP requires less decoding time and complexity than an MAP decoder. Each probability of the proposed algorithm is derived and compared to that obtained using the MAP algorithm     

A systematic approach to detecting OFDM signals in a fading channel

We derive the maximum a posteriori probability (MAP) receiver for orthogonal frequency-division multiplexed signals in a fading channel. As the complexity of the MAP receiver is high, we obtain a low-complexity, suboptimal receiver and evaluate its performance     

3-D maximum a posteriori estimation for single photon emission computed tomography on massively-parallel computers

A fully three-dimensional (3-D) implementation of the maximum a posteriori (MAP) method for single photon emission computed tomography (SPECT) is demonstrated. The 3-D reconstruction exhibits a major increase in resolution when compared to the generation of the series of separate 2-D slice reconstructions. As has been noted, the iterative EM algorithm for 2-D reconstruction is highly computational; the 3-D algorithm is far worse. To accommodate the computational complexity, previous work in the 2-D arena is extended, and an implementation on the class of massively parallel processors of the 3-D algorithm is demonstrated. Using a 16000- (4000-) processor MasPar/DECmpp-Sx machine, the algorithm is demonstrated to execute at 2.5 (7.8) s/EM-iteration for the entire 64x64x64 cube of 96 planar measurements obtained from the Siemens Orbiter rotating camera operating in the high-resolution mode.     

Nondata-aided channel estimation for OFDM systems with space-frequency transmit diversity

This paper proposes a computationally efficient nondata-aided maximum a posteriori (MAP) channel-estimation algorithm focusing on the space-frequency (SF) transmit diversity orthogonal frequency division multiplexing (OFDM) transmission through frequency-selective channels. The proposed algorithm properly averages out the data sequence and requires a convenient representation of the discrete multipath fading channel based on the Karhunen-Loeve (KL) orthogonal expansion and estimates the complex channel parameters of each subcarrier iteratively, using the expectation maximization (EM) method. To further reduce the computational complexity of the proposed MAP algorithm, the optimal truncation property of the KL expansion is exploited. The performance of the MAP channel estimator is studied based on the evaluation of the modified Cramer-Rao bound (CRB). Simulation results confirm the proposed theoretical analysis and illustrate that the proposed algorithm is capable of tracking fast fading and improving overall performance.     

Joint decoding and carrier phase recovery algorithm for turbo codes

In this letter, we investigate the sensitivity of the iterative maximum a posteriori probability (MAP) decoder to carrier phase offsets and propose simple carrier phase recovery algorithms operating within the iterative MAP decoding iterations. The algorithms exploit the information contained in the extrinsic values generated within the iterative MAP decoder to perform carrier recovery, thus requiring low hardware complexity     

A statistical multiscale framework for Poisson inverse problems

This paper describes a statistical multiscale modeling and analysis framework for linear inverse problems involving Poisson data. The framework itself is founded upon a multiscale analysis associated with recursive partitioning of the underlying intensity, a corresponding multiscale factorization of the likelihood (induced by this analysis), and a choice of prior probability distribution made to match this factorization by modeling the “splits” in the underlying partition. The class of priors used here has the interesting feature that the “noninformative” member yields the traditional maximum-likelihood solution; other choices are made to reflect prior belief as to the smoothness of the unknown intensity. Adopting the expectation-maximization (EM) algorithm for use in computing the maximum a posteriori (MAP) estimate corresponding to our model, we find that our model permits remarkably simple, closed-form expressions for the EM update equations. The behavior of our EM algorithm is examined, and it is shown that convergence to the global MAP estimate can be guaranteed. Applications in emission computed tomography and astronomical energy spectral analysis demonstrate the potential of the new approach     

Low-complexity iterative channel estimation for serially concatenated systems over frequency-nonselective Rayleigh fading channels

A low-complexity iterative maximum a posteriori (MAP) channel estimator is proposed whose complexity increases linearly with the symbol alphabet size 'M. Prediction-based MAP channel estimation is not appropriate with a high-order prediction filter or a large modulation alphabet size, since the computational complexity increases with M^L , where L is the predictor order. In contrast, the proposed channel estimator has a constant number of trellis states regardless of the prediction filter order, and is shown to provide comparable error performance to the prediction-based MAP estimator