Chapter 6 – Anchored Regression
暂无分享,去创建一个
This chapter first reviews the general framework for anchored regression, based on a relaxation of the sparsity constraint in sparse coding that enables training linear regressors for each atom in the optimized dictionary. Then the chapter proceeds with exploring two extensions toward better quality, based on training with all example patches, rather than using just the optimized dictionary atoms, and improved runtime, for example, through state-of-the-art hashing techniques. The incorporation of the latter further pushes the usability of anchored regression to a broader set of applications with tighter temporal constraints.
[1] Leo Breiman,et al. Random Forests , 2001, Machine Learning.
[2] M. Elad,et al. $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.
[3] Thomas S. Huang,et al. Image Super-Resolution Via Sparse Representation , 2010, IEEE Transactions on Image Processing.
[4] Gabriel Peyré,et al. Manifold models for signals and images , 2009, Comput. Vis. Image Underst..