Post-Reconstruction Deconvolution of PET Images by Total Generalized Variation Regularization

Improving the quality of positron emission tomography (PET) images, affected by low resolution and high level of noise, is a challenging task in nuclear medicine and radiotherapy. This work proposes a restoration method, achieved after tomographic reconstruction of the images and targeting clinical situations where raw data are often not accessible. Based on inverse problem methods, our contribution introduces the recently developed total generalized variation (TGV) norm to regularize PET image deconvolution. Moreover, we stabilize this procedure with additional image constraints such as positivity and photometry invariance. A criterion for updating and adjusting automatically the regularization parameter in case of Poisson noise is also presented. Experiments are conducted on both synthetic data and real patient images.Comment: First published in the Proceedings of the 23rd European Signal Processing Conference (EUSIPCO-2015) in 2015, published by EURASI

One-step deposition of nano-to-micron-scalable, high-quality digital image correlation patterns for high-strain in-situ multi-microscopy testing

Digital Image Correlation (DIC) is of vital importance in the field of experimental mechanics, yet, producing suitable DIC patterns for demanding in-situ mechanical tests remains challenging, especially for ultra-fine patterns, despite the large number of patterning techniques in the literature. Therefore, we propose a simple, flexible, one-step technique (only requiring a conventional deposition machine) to obtain scalable, high-quality, robust DIC patterns, suitable for a range of microscopic techniques, by deposition of a low melting temperature solder alloy in so-called 'island growth' mode, without elevating the substrate temperature. Proof of principle is shown by (near-)room-temperature deposition of InSn patterns, yielding highly dense, homogeneous DIC patterns over large areas with a feature size that can be tuned from as small as 10nm to 2um and with control over the feature shape and density by changing the deposition parameters. Pattern optimization, in terms of feature size, density, and contrast, is demonstrated for imaging with atomic force microscopy, scanning electron microscopy (SEM), optical microscopy and profilometry. Moreover, the performance of the InSn DIC patterns and their robustness to large deformations is validated in two challenging case studies of in-situ micro-mechanical testing: (i) self-adaptive isogeometric digital height correlation of optical surface height profiles of a coarse, bimodal InSn pattern providing microscopic 3D deformation fields (illustrated for delamination of aluminum interconnects on a polyimide substrate) and (ii) DIC on SEM images of a much finer InSn pattern allowing quantification of high strains near fracture locations (illustrated for rupture of a Fe foil). As such, the high controllability, performance and scalability of the DIC patterns offers a promising step towards more routine DIC-based in-situ micro-mechanical testing.Comment: Accepted for publication in Strai

Distributed Unmixing of Hyperspectral Data With Sparsity Constraint

Spectral unmixing (SU) is a data processing problem in hyperspectral remote sensing. The significant challenge in the SU problem is how to identify endmembers and their weights, accurately. For estimation of signature and fractional abundance matrices in a blind problem, nonnegative matrix factorization (NMF) and its developments are used widely in the SU problem. One of the constraints which was added to NMF is sparsity constraint that was regularized by L 1/2 norm. In this paper, a new algorithm based on distributed optimization has been used for spectral unmixing. In the proposed algorithm, a network including single-node clusters has been employed. Each pixel in hyperspectral images considered as a node in this network. The distributed unmixing with sparsity constraint has been optimized with diffusion LMS strategy, and then the update equations for fractional abundance and signature matrices are obtained. Simulation results based on defined performance metrics, illustrate advantage of the proposed algorithm in spectral unmixing of hyperspectral data compared with other methods. The results show that the AAD and SAD of the proposed approach are improved respectively about 6 and 27 percent toward distributed unmixing in SNR=25dB.Comment: 6 pages, conference pape