Sciweavers

1245 search results - page 88 / 249
» Binary Sparse Coding
Sort
View
127
Voted
CORR
2004
Springer
152views Education» more  CORR 2004»
15 years 2 months ago
Non-negative matrix factorization with sparseness constraints
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 a...
Patrik O. Hoyer
127
Voted
VRML
2003
ACM
15 years 7 months ago
Binary compression rates for ASCII formats
Geometry compression for VRML has been an important item on the wish-list of the Web3D Consortium since 1996. It was widely understood that a binary format would be required to al...
Martin Isenburg, Jack Snoeyink
120
Voted
CIARP
2007
Springer
15 years 8 months ago
Multi-class Binary Object Categorization Using Blurred Shape Models
The main difficulty in the binary object classification field lays in dealing with a high variability of symbol appearance. Rotation, partial occlusions, elastic deformations, or...
Sergio Escalera, Alicia Fornés, Oriol Pujol...
105
Voted
ICIP
2000
IEEE
16 years 4 months ago
A Fast Motion Estimation Algorithm for MPEG-4 Shape Coding
This paper proposes a fast motion estimation algorithm for MPEG-4 shape coding. The proposed algorithm is based on inherent properties of shape coding as well as shape information...
Donghoon Yu, Sung Kyu Jang, Jong Beom Ra
112
Voted
ECCC
2007
96views more  ECCC 2007»
15 years 2 months ago
Linear programming bounds for codes via a covering argument
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
Michael Navon, Alex Samorodnitsky