Linearized alternating direction method with adaptive penalty and warm starts for fast solving transform invariant low-rank textures

From MaRDI portal
Publication:361272

DOI10.1007/S11263-013-0611-6zbMATH Open1270.68354arXiv1205.5351OpenAlexW2047798849MaRDI QIDQ361272FDOQ361272


Authors: Xiang Ren, Zhouchen Lin Edit this on Wikidata


Publication date: 29 August 2013

Published in: International Journal of Computer Vision (Search for Journal in Brave)

Abstract: Transform Invariant Low-rank Textures (TILT) is a novel and powerful tool that can effectively rectify a rich class of low-rank textures in 3D scenes from 2D images despite significant deformation and corruption. The existing algorithm for solving TILT is based on the alternating direction method (ADM). It suffers from high computational cost and is not theoretically guaranteed to converge to a correct solution. In this paper, we propose a novel algorithm to speed up solving TILT, with guaranteed convergence. Our method is based on the recently proposed linearized alternating direction method with adaptive penalty (LADMAP). To further reduce computation, warm starts are also introduced to initialize the variables better and cut the cost on singular value decomposition. Extensive experimental results on both synthetic and real data demonstrate that this new algorithm works much more efficiently and robustly than the existing algorithm. It could be at least five times faster than the previous method.


Full work available at URL: https://arxiv.org/abs/1205.5351




Recommendations




Cites Work


Cited In (8)

Uses Software





This page was built for publication: Linearized alternating direction method with adaptive penalty and warm starts for fast solving transform invariant low-rank textures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q361272)