Efficient quantization algorithms for discrete functions
From MaRDI portal
Approximation with constraints (41A29) Multidimensional problems (41A63) Dynamic programming (90C39) Applications of mathematical programming (90C90) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Recommendations
Cites work
- Convex Analysis
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 467196 (Why is no real title available?)
- scientific article; zbMATH DE number 727435 (Why is no real title available?)
- scientific article; zbMATH DE number 837911 (Why is no real title available?)
- scientific article; zbMATH DE number 3258269 (Why is no real title available?)
- Nonparametric image segmentation
- Optimal and near optimal quantization of integrable functions.
- Optimal approximations by piecewise smooth functions and associated variational problems
Cited in
(5)
This page was built for publication: Efficient quantization algorithms for discrete functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4465495)