Abstract. This document is a preprint of the following publication: Bioinformatics (2011) 27(8): 1166-1167. Algorithms for sparse data require fast search and subset selection capa...
Marc Kirchner, Buote Xu, Hanno Steen, Judith A. J....
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
We propose a new reconstruction scheme for magnetic resonance spectroscopic imaging (MRSI) signal based on minimizing the spatial total variation (TV) integrated with the 1 -norm ...
The structural similarity (SSIM) index has been shown to be an useful tool in a wide variety of applications that involve the assessment of image quality and similarity. However, i...