Results 1 - 10 of 16,651

Sparse coding with an overcomplete basis set: a strategy employed by V1

by Bruno A. Olshausen, David J. Fieldt - Vision Research , 1997
"... The spatial receptive fields of simple cells in mammalian striate cortex have been reasonably well described physiologically and can be characterized as being localized, oriented, and ban@ass, comparable with the basis functions of wavelet transforms. Previously, we have shown that these receptive f ..."
Abstract - Cited by 958 (9 self) - Add to MetaCart
The spatial receptive fields of simple cells in mammalian striate cortex have been reasonably well described physiologically and can be characterized as being localized, oriented, and ban@ass, comparable with the basis functions of wavelet transforms. Previously, we have shown that these receptive

The "Independent Components" of Natural Scenes are Edge Filters

by Anthony J. Bell, Terrence J. Sejnowski , 1997
"... It has previously been suggested that neurons with line and edge selectivities found in primary visual cortex of cats and monkeys form a sparse, distributed representation of natural scenes, and it has been reasoned that such responses should emerge from an unsupervised learning algorithm that attem ..."
Abstract - Cited by 617 (29 self) - Add to MetaCart
distributions. We compare the resulting ICA filters and their associated basis functions, with other decorrelating filters produced by Principal Components Analysis (PCA) and zero-phase whitening filters (ZCA). The ICA filters have more sparsely distributed (kurtotic) outputs on natural scenes. They also

The Unix Time-Sharing System

by D. M. Ritchie, K. Thompson - Communications of the ACM , 1974
"... Unix is a general-purpose, multi-user, interactive operating system for the larger Digital Equipment Corporation PDP-11 and the Interdata 8/32 computers. It offers a number of features seldom found even in larger operating systems, including i A hierarchical file system incorporating demountable vol ..."
Abstract - Cited by 539 (14 self) - Add to MetaCart
volumes, ii Compatible file, device, and inter-process I/O, iii The ability to initiate asynchronous processes, iv System command language selectable on a per-user basis, v Over 100 subsystems including a dozen languages, vi High degree of portability. This paper discusses the nature and implementation

A Natural Basis for Interoperability

by Nick Rossiter, Michael Heather, David Nelson - I-ESA’06 Preproceedings 12pp pdf (CD, W11, 22 March 2006); proceedings 10pp LNCS , 2006
"... Abstract. Successful interoperability of systems requires a sound basis for activity across levels and up to the highest global level. The interop-erability is non-local and subject to the conditions of naturality found in reality. The axiomatic models over the last two centuries can guarantee no re ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
Abstract. Successful interoperability of systems requires a sound basis for activity across levels and up to the highest global level. The interop-erability is non-local and subject to the conditions of naturality found in reality. The axiomatic models over the last two centuries can guarantee

Manifold regularization: A geometric framework for learning from labeled and unlabeled examples

by Mikhail Belkin, Partha Niyogi, Vikas Sindhwani - JOURNAL OF MACHINE LEARNING RESEARCH , 2006
"... We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semi-supervised framework that incorporates labeled and unlabeled data in a general-purpose learner. Some transductive graph learning al ..."
Abstract - Cited by 578 (16 self) - Add to MetaCart
algorithms and standard methods including Support Vector Machines and Regularized Least Squares can be obtained as special cases. We utilize properties of Reproducing Kernel Hilbert spaces to prove new Representer theorems that provide theoretical basis for the algorithms. As a result (in contrast to purely

Greed is Good: Algorithmic Results for Sparse Approximation

by Joel A. Tropp , 2004
"... This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries. It provides a sufficient condition under which both OMP and Donoho’s basis pursuit (BP) paradigm can recover the optimal representa ..."
Abstract - Cited by 916 (9 self) - Add to MetaCart
This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries. It provides a sufficient condition under which both OMP and Donoho’s basis pursuit (BP) paradigm can recover the optimal

The Symbol Grounding Problem

by Stevan Harnad , 1990
"... There has been much discussion recently about the scope and limits of purely symbolic models of the mind and about the proper role of connectionism in cognitive modeling. This paper describes the "symbol grounding problem": How can the semantic interpretation of a formal symbol system be m ..."
Abstract - Cited by 1084 (20 self) - Add to MetaCart
be made intrinsic to the system, rather than just parasitic on the meanings in our heads? How can the meanings of the meaningless symbol tokens, manipulated solely on the basis of their (arbitrary) shapes, be grounded in anything but other meaningless symbols? The problem is analogous to trying to learn

Visual interpretation of hand gestures for human-computer interaction: A review

by Vladimir I. Pavlovic, Rajeev Sharma, Thomas S. Huang - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1997
"... The use of hand gestures provides an attractive alternative to cumbersome interface devices for human-computer interaction (HCI). In particular, visual interpretation of hand gestures can help in achieving the ease and naturalness desired for HCI. This has motivated a very active research area conc ..."
Abstract - Cited by 489 (17 self) - Add to MetaCart
The use of hand gestures provides an attractive alternative to cumbersome interface devices for human-computer interaction (HCI). In particular, visual interpretation of hand gestures can help in achieving the ease and naturalness desired for HCI. This has motivated a very active research area

Efficient sparse coding algorithms

by Honglak Lee, Alexis Battle, Rajat Raina, Andrew Y. Ng - In NIPS , 2007
"... Sparse coding provides a class of algorithms for finding succinct representations of stimuli; given only unlabeled input data, it discovers basis functions that capture higher-level features in the data. However, finding sparse codes remains a very difficult computational problem. In this paper, we ..."
Abstract - Cited by 445 (14 self) - Add to MetaCart
Sparse coding provides a class of algorithms for finding succinct representations of stimuli; given only unlabeled input data, it discovers basis functions that capture higher-level features in the data. However, finding sparse codes remains a very difficult computational problem. In this paper, we

A Parametric Texture Model based on Joint Statistics of Complex Wavelet Coefficients

by Javier Portilla, Eero P. Simoncelli - INTERNATIONAL JOURNAL OF COMPUTER VISION , 2000
"... We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed on pairs of coefficients corresponding to basis functions at adjacent spatial locations, orientations, and scales. We de ..."
Abstract - Cited by 424 (13 self) - Add to MetaCart
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed on pairs of coefficients corresponding to basis functions at adjacent spatial locations, orientations, and scales. We
Results 1 - 10 of 16,651