Results 1 - 10
of
2,148
Learning to detect objects in images via a sparse, part-based representation
- IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2004
"... We study the problem of detecting objects in still, grayscale images. Our primary focus is development of a learning-based approach to the problem, that makes use of a sparse, part-based representation. A vocabulary of distinctive object parts is automatically constructed from a set of sample image ..."
Abstract
-
Cited by 378 (1 self)
- Add to MetaCart
We study the problem of detecting objects in still, grayscale images. Our primary focus is development of a learning-based approach to the problem, that makes use of a sparse, part-based representation. A vocabulary of distinctive object parts is automatically constructed from a set of sample
Non-negative matrix factorization with sparseness constraints,”
- Journal of Machine Learning Research,
, 2004
"... Abstract Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been applied in several applications, it does not always result in parts-based representations. In this paper, we sho ..."
Abstract
-
Cited by 498 (0 self)
- Add to MetaCart
Abstract Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been applied in several applications, it does not always result in parts-based representations. In this paper, we
Probabilistic Part-of-Speech Tagging Using Decision Trees
, 1994
"... In this paper, a new probabilistic tagging method is presented which avoids problems that Markov Model based taggers face, when they have to estimate transition probabilities from sparse data. In this tagging method, transition probabilities are estimated using a decision tree. Based on this method, ..."
Abstract
-
Cited by 1058 (9 self)
- Add to MetaCart
In this paper, a new probabilistic tagging method is presented which avoids problems that Markov Model based taggers face, when they have to estimate transition probabilities from sparse data. In this tagging method, transition probabilities are estimated using a decision tree. Based on this method
Algorithms for simultaneous sparse approximation. Part II: Convex relaxation
, 2004
"... Abstract. A simultaneous sparse approximation problem requests a good approximation of several input signals at once using different linear combinations of the same elementary signals. At the same time, the problem balances the error in approximation against the total number of elementary signals th ..."
Abstract
-
Cited by 366 (5 self)
- Add to MetaCart
that participate. These elementary signals typically model coherent structures in the input signals, and they are chosen from a large, linearly dependent collection. The first part of this paper proposes a greedy pursuit algorithm, called Simultaneous Orthogonal Matching Pursuit, for simultaneous sparse
Increasing Returns and Economic Geography
- Journal of Political Economy
, 1991
"... This paper develops a simple model that shows how a country can endogenously become differentiated into an industrialized "core" and an agricultural "periphery. " In order to realize scale economies while minimizing transport costs, manufacturing firms tend to locate in the regio ..."
Abstract
-
Cited by 1811 (7 self)
- Add to MetaCart
of factors of production in space-occupies a relatively small part of standard economic analysis. International trade theory, in particular, conventionally treats nations as dimensionless points (and frequently assumes zero transportation costs between countries as well). Admittedly, models descended from
Learning a Sparse Representation for Object Detection
- PRESENTED IN ECCV’02
, 2002
"... We present an approach for learning to detect objects in still gray images, that is based on a sparse, part-based representation of objects. A vocabulary of information-rich object parts is automatically constructed from a set of sample images of the object class of interest. Images are then repre ..."
Abstract
-
Cited by 293 (3 self)
- Add to MetaCart
We present an approach for learning to detect objects in still gray images, that is based on a sparse, part-based representation of objects. A vocabulary of information-rich object parts is automatically constructed from a set of sample images of the object class of interest. Images
Sparse signal reconstruction from limited data using FOCUSS: A re-weighted minimum norm algorithm
- IEEE TRANS. SIGNAL PROCESSING
, 1997
"... We present a nonparametric algorithm for finding localized energy solutions from limited data. The problem we address is underdetermined, and no prior knowledge of the shape of the region on which the solution is nonzero is assumed. Termed the FOcal Underdetermined System Solver (FOCUSS), the algor ..."
Abstract
-
Cited by 368 (22 self)
- Add to MetaCart
), the algorithm has two integral parts: a low-resolution initial estimate of the real signal and the iteration process that refines the initial estimate to the final localized energy solution. The iterations are based on weighted norm minimization of the dependent variable with the weights being a function
Sparse matrix solvers on the GPU: conjugate gradients and multigrid
- ACM Trans. Graph
, 2003
"... Permission to make digital/hard copy of part of all of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given ..."
Abstract
-
Cited by 297 (3 self)
- Add to MetaCart
Permission to make digital/hard copy of part of all of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given
SPARSKIT: a basic tool kit for sparse matrix computations - Version 2
, 1994
"... . This paper presents the main features of a tool package for manipulating and working with sparse matrices. One of the goals of the package is to provide basic tools to facilitate exchange of software and data between researchers in sparse matrix computations. Our starting point is the Harwell/Boei ..."
Abstract
-
Cited by 314 (22 self)
- Add to MetaCart
/Boeing collection of matrices for which we provide a number of tools. Among other things the package provides programs for converting data structures, printing simple statistics on a matrix, plotting a matrix profile, performing basic linear algebra operations with sparse matrices and so on. Work done partly
Users' Guide for the Harwell-Boeing Sparse Matrix Collection (Release I)
, 1992
"... We describe the complete set of matrices in the Harwell-Boeing sparse matrix collection, a set of standard test matrices for sparse matrix problems. This description includes some documentation for each matrix (or set of matrices) in the collection. We also describe how a copy of the collection may ..."
Abstract
-
Cited by 265 (23 self)
- Add to MetaCart
We describe the complete set of matrices in the Harwell-Boeing sparse matrix collection, a set of standard test matrices for sparse matrix problems. This description includes some documentation for each matrix (or set of matrices) in the collection. We also describe how a copy of the collection may
Results 1 - 10
of
2,148