This study uses county-level surveillance data to systematically analyze geographic variation and clustering of persons living with diagnosed HIV (PLWH) in the southern United States in 2011. Clusters corresponding to large metropolitan areas – including Miami, Atlanta, and Baltimore – had HIV prevalence rates higher (p < .001) than the regional rate. Regression analysis within the counties included in these clusters determined that race was a significant indicator for PLWH. These results provide a general picture of the distribution of PLWH in the southern United States at the county level and provide insights for identifying local geographic areas with a high number of PLWH, as well as subpopulations that may have an increased risk of infection.
Sparse representation of a single measurement vector (SMV) has been explored in a variety of compressive sensing applications. Recently, SMV models have been extended to solve multiple measurement vectors (MMV) problems, where the underlying signal is assumed to have joint sparse structures. To circumvent the NP-hardness of the $ \ell_0 $ minimization problem, many deterministic MMV algorithms solve the convex relaxed models with limited efficiency. In this paper, we develop stochastic greedy algorithms for solving the joint sparse MMV reconstruction problem. In particular, we propose the MMV Stochastic Iterative Hard Thresholding (MStoIHT) and MMV Stochastic Gradient Matching Pursuit (MStoGradMP) algorithms, and we also utilize the mini-batching technique to further improve their performance. Convergence analysis indicates that the proposed algorithms are able to converge faster than their SMV counterparts, i.e., concatenated StoIHT and StoGradMP, under certain conditions. Numerical experiments have illustrated the superior effectiveness of the proposed algorithms over their SMV counterparts.
Due to the explosive growth of large-scale data sets, tensors have been a vital tool to analyze and process high-dimensional data. Different from the matrix case, tensor decomposition has been defined in various formats, which can be further used to define the best low-rank approximation of a tensor to significantly reduce the dimensionality for signal compression and recovery. In this paper, we consider the low-rank tensor recovery problem when the tubal rank of the underlying tensor is given or estimated a priori. We propose a novel class of iterative singular tube hard thresholding algorithms for tensor recovery based on the low-tubal-rank tensor approximation, including basic, accelerated deterministic and stochastic versions. Convergence guarantees are provided along with the special case when the measurements are linear. Numerical experiments on tensor compressive sensing and color image inpainting are conducted to demonstrate convergence and computational efficiency in practice.
Diffuse optical tomography (DOT) is an important functional imaging modality in clinical diagnosis and treatment. As the number of wavelengths in the acquired DOT data grows, it becomes very challenging to reconstruct diffusion and absorption coefficients of tissue, i.e., a DOT image. In this paper, we consider the hyperspectral DOT (hyDOT) inverse problem as a multiple-measurement vector (MMV) problem by exploiting the joint sparsity of the images to be reconstructed. Then we propose a fast stochastic greedy algorithm based on the MMV stochastic gradient matching pursuit (MStoGradMP) and the mini-batching technique. Numerical results show that the proposed algorithm can achieve higher reconstruction accuracy with significantly reduced running time than the related gradient descent method with sparsity regularization.
We develop a higher-order method for non-paraxial beam propagation based on the wide-angle split-step spectral (WASSS) method previously reported [Clark and Thomas, Opt. Quantum. Electron., 41, 849 (2010)]. The higher-order WASSS (HOWASSS) method approximates the Helmholtz equation by keeping terms up to third-order in the propagation step size, in the Magnus expansion. A symmetric exponential operator splitting technique is used to simplify the resulting exponential operators. The HOWASSS method is applied to the problem of waveguide propagation, where an analytical solution is known, to demonstrate the performance and accuracy of the method. The performance enhancement gained by implementing the HOWASSS method on a graphics processing unit (GPU) is demonstrated. When highly accurate results are required the HOWASSS method is shown to be substantially faster than the WASSS method.