TILT: transform invariant low-rank textures
From MaRDI portal
Publication:1931595
DOI10.1007/s11263-012-0515-xzbMath1254.68290arXiv1012.3216OpenAlexW2906621894MaRDI QIDQ1931595
Zhengdong Zhang, Yi Ma, Xiao Liang, Arvind Ganesh
Publication date: 15 January 2013
Published in: International Journal of Computer Vision (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.3216
symmetryrobust PCArank minimizationimage rectificationshape from texturelow-rank texturesparse errorstransform invariant
Related Items (25)
Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems ⋮ An efficient algorithm for batch images alignment with adaptive rank-correction term ⋮ Scalable Low-Rank Representation ⋮ Low-Rank and Sparse Dictionary Learning ⋮ Estimating shape parameters of piecewise linear-quadratic problems ⋮ Linearized alternating direction method with adaptive penalty and warm starts for fast solving transform invariant low-rank textures ⋮ Robust low transformed multi-rank tensor methods for image alignment ⋮ Reflexive Symmetry Detection in Single Image ⋮ Bayesian rank penalization ⋮ Minimal solvers for rectifying from radially-distorted scales and change of scales ⋮ Weighted nuclear norm minimization and its applications to low level vision ⋮ An image inpainting algorithm using exemplar matching and low-rank sparse prior ⋮ Sparse representation based Fisher discrimination dictionary learning for image classification ⋮ Robust detection and affine rectification of planar homogeneous texture for scene understanding ⋮ Robust Subspace Discovery via Relaxed Rank Minimization ⋮ Relations Among Some Low-Rank Subspace Recovery Models ⋮ Multi-stage convex relaxation method for low-rank and sparse matrix separation problem ⋮ Level-set methods for convex optimization ⋮ Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss ⋮ Recovering low-rank and sparse matrix based on the truncated nuclear norm ⋮ Removing mixed noise in low rank textures by convex optimization ⋮ Robust principal component pursuit via inexact alternating minimization on matrix manifolds ⋮ Symmetric Gauss-Seidel technique-based alternating direction methods of multipliers for transform invariant low-rank textures problem ⋮ Active Subspace: Toward Scalable Low-Rank Learning ⋮ An Overview of Computational Sparse Models and Their Applications in Artificial Intelligence
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Texture synthesis and nonparametric resampling of random fields
- Lucas-Kanade 20 years on: a unifying framework
- Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
- Strong uniqueness and second order convergence in nonlinear discrete approximation
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Templates for convex cone problems with applications to sparse signal recovery
- Exact matrix completion via convex optimization
- Robust principal component analysis?
- A Singular Value Thresholding Algorithm for Matrix Completion
- Computational Symmetry in Computer Vision and Computer Graphics
- Rank-Sparsity Incoherence for Matrix Decomposition
- ASIFT: A New Framework for Fully Affine Invariant Image Comparison
- An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Representing and recognizing the visual appearance of materials using three-dimensional textons
This page was built for publication: TILT: transform invariant low-rank textures
