Sciweavers

6 search results - page 1 / 2
» Efficient Highly Over-Complete Sparse Coding using a Mixture...
Sort
View
ECCV
2010
Springer
13 years 8 months ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
NIPS
1998
13 years 5 months ago
Coding Time-Varying Signals Using Sparse, Shift-Invariant Representations
A common way to represent a time series is to divide it into shortduration blocks, each of which is then represented by a set of basis functions. A limitation of this approach, ho...
Michael S. Lewicki, Terrence J. Sejnowski
NIPS
2004
13 years 5 months ago
Sparse Coding of Natural Images Using an Overcomplete Set of Limited Capacity Units
It has been suggested that the primary goal of the sensory system is to represent input in such a way as to reduce the high degree of redundancy. Given a noisy neural representati...
Eizaburo Doi, Michael S. Lewicki
PAMI
2011
12 years 11 months ago
Approximately Global Optimization for Robust Alignment of Generalized Shapes
—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
Hongsheng Li, Tian Shen, Xiaolei Huang
CIMAGING
2009
184views Hardware» more  CIMAGING 2009»
13 years 5 months ago
Fast space-varying convolution and its application in stray light reduction
Space-varying convolution often arises in the modeling or restoration of images captured by optical imaging systems. For example, in applications such as microscopy or photography...
Jianing Wei, Guangzhi Cao, Charles A. Bouman, Jan ...