Sciweavers

64 search results - page 4 / 13
» Locally Competitive Algorithms for Sparse Approximation
Sort
View
JVCIR
2010
162views more  JVCIR 2010»
13 years 5 months ago
Tetrolet transform: A new adaptive Haar wavelet algorithm for sparse image representation
In order to get an efficient image representation we introduce a new adaptive Haar wavelet transform, called Tetrolet Transform. Tetrolets are Haar-type wavelets whose supports ar...
Jens Krommweh
NIPS
2000
13 years 8 months ago
Learning Winner-take-all Competition Between Groups of Neurons in Lateral Inhibitory Networks
It has long been known that lateral inhibition in neural networks can lead to a winner-take-all competition, so that only a single neuron is active at a steady state. Here we show...
Xiaohui Xie, Richard H. R. Hahnloser, H. Sebastian...
ICRA
2008
IEEE
123views Robotics» more  ICRA 2008»
14 years 1 months ago
Exact state and covariance sub-matrix recovery for submap based sparse EIF SLAM algorithm
— This paper provides a novel state vector and covariance sub-matrix recovery algorithm for a recently developed submap based exactly sparse Extended Information Filter (EIF) SLA...
Shoudong Huang, Zhan Wang, Gamini Dissanayake
FOCS
2009
IEEE
14 years 2 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
ECCV
2008
Springer
14 years 9 months ago
Prior-Based Piecewise-Smooth Segmentation by Template Competitive Deformation Using Partitions of Unity
We propose a new algorithm for two-phase, piecewise-smooth segmentation with shape prior. The image is segmented by a binary template that is deformed by a regular geometric transf...
Benoit Mory, Laurent D. Cohen, Oudom Somphone, Sh&...