CVPR 2019 accepted papers on Learning theory and algorithms
28 of the 1,294 papers accepted at CVPR 2019 (2.2%) are on Learning theory and algorithms, compared with 3.7% at CVPR 2018. They fall into 5 topics.
See CVPR 2019 in the interactive map
Submitting to CVPR? 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 · 8 papers
- Non-Local Meets Global: An Integrated Paradigm for Hyperspectral Denoising (194 citations)
- Low-Rank Tensor Completion With a New Tensor Nuclear Norm Induced by Invertible Linear Transforms (187 citations)
- Online High Rank Matrix Completion (41 citations)
- RES-PCA: A Scalable Approach to Recovering Low-Rank Matrices (29 citations)
- Perturbation Analysis of the 8-Point Algorithm: A Case Study for Wide FoV Cameras (17 citations)
- Low-Rank Laplacian-Uniform Mixed Model for Robust Face Recognition (15 citations)
- Guaranteed Matrix Completion Under Multiple Linear Transformations (10 citations)
- A Decomposition Algorithm for the Sparse Generalized Eigenvalue Problem
Combinatorial and search optimization · 7 papers
- ECC: Platform-Independent Energy-Constrained Deep Neural Network Compression via a Bilinear Regression Model (45 citations)
- Robustness Verification of Classification Deep Neural Networks via Linear Programming (42 citations)
- Transferable AutoML by Model Sharing Over Grouped Datasets (27 citations)
- Practical Coding Function Design for Time-Of-Flight Imaging (26 citations)
- Combinatorial Persistency Criteria for Multicut and Max-Cut (12 citations)
- Radial Distortion Triangulation (8 citations)
- A Flexible Convolutional Solver for Fast Style Transfers
Prediction and decision losses · 7 papers
- MAGSAC: Marginalizing Sample Consensus (357 citations)
- A Theoretically Sound Upper Bound on the Triplet Loss for Improving the Efficiency of Deep Distance Metric Learning (62 citations)
- K-Nearest Neighbors Hashing (34 citations)
- Iterative Projection and Matching: Finding Structure-Preserving Representatives and Its Application to Computer Vision (18 citations)
- Polynomial Representation for Persistence Diagram (17 citations)
- Joint Manifold Diffusion for Combining Predictions on Decoupled Observations
- A General and Adaptive Robust Loss Function
Clustering · 5 papers
- Efficient Parameter-Free Clustering Using First Neighbor Relations (255 citations)
- Spectral Metric for Dataset Complexity Assessment (34 citations)
- Double Nuclear Norm Based Low Rank Representation on Grassmann Manifolds for Clustering (26 citations)
- Robust Subspace Clustering With Independent and Piecewise Identically Distributed Noise Modeling (22 citations)
- Topology Reconstruction of Tree-Like Structure in Images via Structural Similarity Measure and Dominant Set Clustering (12 citations)
Optimal transport · 1 paper
- Max-Sliced Wasserstein Distance and Its Use for GANs (148 citations)
