Learning big (image) data via coresets for dictionaries

DOI10.1007/s10851-013-0431-xzbMath1310.68214OpenAlexW2051926224MaRDI QIDQ2513397

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

zbMATH Keywords

sparsitydictionary learningcoresetsK-SVD

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10)

Related Items

Unnamed Item

Uses Software

• KSVD-Box
• StreamKM++

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smaller coresets for \(k\)-median and \(k\)-means clustering
• 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
• Approximating extent measures of points
• On coresets for k-means and k-median clustering
• Adaptive Sampling and Fast Low-Rank Matrix Approximation
• A PTAS for k-means clustering based on weak coresets
• Bi-criteria linear-time approximations for generalized k-mean/median/center
• Decomposable searching problems I. Static-to-dynamic transformation
• Dictionary Learning Algorithms for Sparse Representation
• $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• Structural risk minimization over data-dependent hierarchies
• Private coresets
• StreamKM++
• Improved bounds on the sample complexity of learning