Learning big (image) data via coresets for dictionaries
From MaRDI portal
Publication:2513397
DOI10.1007/S10851-013-0431-XzbMATH Open1310.68214OpenAlexW2051926224MaRDI QIDQ2513397FDOQ2513397
Authors: Dan Feldman, Micha Feigin, Nir Sochen
Publication date: 28 January 2015
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-013-0431-x
Recommendations
- Optimal discriminative feature and dictionary learning for image set classification
- Learning Binary Hash Codes for Large-Scale Image Search
- Multi-Level Discriminative Dictionary Learning With Application to Large Scale Image Classification
- Learning Short Binary Codes for Large-scale Image Retrieval
- Large-Margin Learning of Compact Binary Image Encodings
Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10)
Cites Work
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- StreamKM++, a clustering algorithm for data streams
- Title not available (Why is that?)
- Algorithms for facility location problems with outliers. (Extended abstract)
- Title not available (Why is that?)
- Structural risk minimization over data-dependent hierarchies
- Approximating extent measures of points.
- Decomposable searching problems I. Static-to-dynamic transformation
- The sample complexity of dictionary learning
- Title not available (Why is that?)
- Dictionary Learning Algorithms for Sparse Representation
- On coresets for k-means and k-median clustering
- A PTAS for k-means clustering based on weak coresets
- Smaller coresets for \(k\)-median and \(k\)-means clustering
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Drag forces and heat transfer coefficients for spherical, cuboidal and ellipsoidal particles in cross flow at sub-critical Reynolds numbers
- Improved bounds on the sample complexity of learning
- Subgradient and sampling algorithms for \(\ell_1\) regression
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- Shape classification and analysis. Theory and practice.
- Title not available (Why is that?)
- Bi-criteria linear-time approximations for generalized k-mean/median/center
- Private coresets
- Title not available (Why is that?)
- Universal \({\epsilon}\)-approximators for integrals
- Title not available (Why is that?)
Cited In (3)
Uses Software
This page was built for publication: Learning big (image) data via coresets for dictionaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2513397)