Results 1  10
of
343,815
Sparse Matrix Representations of Linear Mixed Models
, 2004
"... We describe a representation of linear mixedeffects models using a sparse semidefinite matrix. This representation provides for efficient evaluation of the profiled loglikelihood or profiled restricted loglikelihood of the model, given the relative precision parameters for the random effects. The ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We describe a representation of linear mixedeffects models using a sparse semidefinite matrix. This representation provides for efficient evaluation of the profiled loglikelihood or profiled restricted loglikelihood of the model, given the relative precision parameters for the random effects
Abstract ON THE COMPLEXITY OF PARTITIONING SPARSE MATRIX REPRESENTATIONS
"... A standard representation of a sparse matrix is a structure where nonzero elements are linked in rows and columns. A general graph structure corresponding to this representation is defined. The problem of partitioning such a graph into fixed size blocks, so that the number of interblock links is m ..."
Abstract
 Add to MetaCart
A standard representation of a sparse matrix is a structure where nonzero elements are linked in rows and columns. A general graph structure corresponding to this representation is defined. The problem of partitioning such a graph into fixed size blocks, so that the number of interblock links
Noniterative MAP reconstruction using sparse matrix representations
 IEEE TRANS. ON IMAGE PROCESSING
, 2009
"... We present a method for noniterative maximum a posteriori (MAP) tomographic reconstruction which is based on the use of sparse matrix representations. Our approach is to precompute and store the inverse matrix required for MAP reconstruction. This approach has generally not been used in the past be ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present a method for noniterative maximum a posteriori (MAP) tomographic reconstruction which is based on the use of sparse matrix representations. Our approach is to precompute and store the inverse matrix required for MAP reconstruction. This approach has generally not been used in the past
FAST RECONSTRUCTION ALGORITHMS FOR OPTICAL TOMOGRAPHY USING SPARSE MATRIX REPRESENTATIONS
"... This paper introduces a novel method for reconstructing optical tomography images using precomputed transforms. Our approach is to precompute and store the inverse matrix required for MAP reconstruction using lossy source coding techniques. We show how lossy source coding techniques can be used to ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
to store the large and nonsparse matrix by applying a wavelet transform in the image space and appropriate orthonormal transforms in the sensor space. Lossy coding dramatically reduces the the number of nonzero coefficients, thereby proportionately reducing both the required storage and computation time
Nonnegative matrix factorization with sparseness constraints,”
 Journal of Machine Learning Research,
, 2004
"... Abstract Nonnegative matrix factorization (NMF) is a recently developed technique for finding partsbased, linear representations of nonnegative data. Although it has successfully been applied in several applications, it does not always result in partsbased representations. In this paper, we sho ..."
Abstract

Cited by 498 (0 self)
 Add to MetaCart
Abstract Nonnegative matrix factorization (NMF) is a recently developed technique for finding partsbased, linear representations of nonnegative data. Although it has successfully been applied in several applications, it does not always result in partsbased representations. In this paper, we
The University of Florida sparse matrix collection
 NA DIGEST
, 1997
"... The University of Florida Sparse Matrix Collection is a large, widely available, and actively growing set of sparse matrices that arise in real applications. Its matrices cover a wide spectrum of problem domains, both those arising from problems with underlying 2D or 3D geometry (structural enginee ..."
Abstract

Cited by 536 (17 self)
 Add to MetaCart
The University of Florida Sparse Matrix Collection is a large, widely available, and actively growing set of sparse matrices that arise in real applications. Its matrices cover a wide spectrum of problem domains, both those arising from problems with underlying 2D or 3D geometry (structural
Robust face recognition via sparse representation
 IEEE TRANS. PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2008
"... We consider the problem of automatically recognizing human faces from frontal views with varying expression and illumination, as well as occlusion and disguise. We cast the recognition problem as one of classifying among multiple linear regression models, and argue that new theory from sparse signa ..."
Abstract

Cited by 936 (40 self)
 Add to MetaCart
signal representation offers the key to addressing this problem. Based on a sparse representation computed by ℓ 1minimization, we propose a general classification algorithm for (imagebased) object recognition. This new framework provides new insights into two crucial issues in face recognition: feature
KSVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
, 2006
"... In recent years there has been a growing interest in the study of sparse representation of signals. Using an overcomplete dictionary that contains prototype signalatoms, signals are described by sparse linear combinations of these atoms. Applications that use sparse representation are many and inc ..."
Abstract

Cited by 935 (41 self)
 Add to MetaCart
In recent years there has been a growing interest in the study of sparse representation of signals. Using an overcomplete dictionary that contains prototype signalatoms, signals are described by sparse linear combinations of these atoms. Applications that use sparse representation are many
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ¹ minimization
 PROC. NATL ACAD. SCI. USA 100 2197–202
, 2002
"... Given a ‘dictionary’ D = {dk} of vectors dk, we seek to represent a signal S as a linear combination S = ∑ k γ(k)dk, with scalar coefficients γ(k). In particular, we aim for the sparsest representation possible. In general, this requires a combinatorial optimization process. Previous work considered ..."
Abstract

Cited by 633 (38 self)
 Add to MetaCart
considered the special case where D is an overcomplete system consisting of exactly two orthobases, and has shown that, under a condition of mutual incoherence of the two bases, and assuming that S has a sufficiently sparse representation, this representation is unique and can be found by solving a convex
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
 ACM Trans. Math. Software
, 1982
"... An iterative method is given for solving Ax ~ffi b and minU Ax b 112, where the matrix A is large and sparse. The method is based on the bidiagonalization procedure of Golub and Kahan. It is analytically equivalent to the standard method of conjugate gradients, but possesses more favorable numerica ..."
Abstract

Cited by 653 (21 self)
 Add to MetaCart
An iterative method is given for solving Ax ~ffi b and minU Ax b 112, where the matrix A is large and sparse. The method is based on the bidiagonalization procedure of Golub and Kahan. It is analytically equivalent to the standard method of conjugate gradients, but possesses more favorable
Results 1  10
of
343,815