ICCV 2017 accepted papers on Learning theory and algorithms
22 of the 621 papers accepted at ICCV 2017 (3.5%) are on Learning theory and algorithms. They fall into 5 topics.
See ICCV 2017 in the interactive map
Submitting to ICCV? Checklist →
Working on something in this area? Describe your idea in scime atlas to see the closest papers by meaning and how crowded the spot has become.
Topics and papers
Matrix and tensor methods · 14 papers
- Efficient Low Rank Tensor Ring Completion (194 citations)
- Convolutional Dictionary Learning via Local Processing (141 citations)
- Semi-Global Weighted Least Squares in Image Filtering (56 citations)
- Polynomial Solvers for Saturated Ideals (40 citations)
- High Order Tensor Formulation for Convolutional Sparse Coding (27 citations)
- Non-Convex Rank/Sparsity Regularization and Local Minima (18 citations)
- Robust Kronecker-Decomposable Component Analysis for Low-Rank Modeling (14 citations)
- Side Information in Robust Principal Component Analysis: Algorithms and Applications (11 citations)
- Constrained Convolutional Sparse Coding for Parametric Based Reconstruction of Line Drawings (10 citations)
- Low-Rank Tensor Completion: A Pseudo-Bayesian Learning Approach (8 citations)
- A Geometric Framework for Statistical Analysis of Trajectories With Distinct Temporal Spans (7 citations)
- Sparse Exact PGA on Riemannian Manifolds (6 citations)
and 2 more in the interactive map.
Clustering · 4 papers
- A Self-Balanced Min-Cut Algorithm for Image Clustering (62 citations)
- Practical and Efficient Multi-View Matching (55 citations)
- Fast Multi-Image Matching via Density-Based Clustering (50 citations)
- Efficient Algorithms for Moral Lineage Tracing (12 citations)
