Yang, T.-J.T.-J.YangTsai, Y.-M.Y.-M.TsaiLi, C.-T.C.-T.LiLIANG-GEE CHEN2018-09-102018-09-102012https://www.scopus.com/inward/record.uri?eid=2-s2.0-84867503975&doi=10.1109%2fISIT.2012.6283849&partnerID=40&md5=0d405a4da45b95b46370eca0c44b92e8http://scholars.lib.ntu.edu.tw/handle/123456789/369675A sparse signal can be reconstructed from a small amount of random and linear measurements by solving a system of underdetermined equations. In this paper, we study the reconstruction problem while the system undergoes dynamic modifications. Resolving this problem from scratch requires high computational efforts. Therefore, we propose an efficient homotopy-based reconstruction algorithm with warmstart, named WarmL1. WarmL1 quickly updates the previous solution to the desired one. Based on the concept of homotopy, WarmL1 breaks the reconstruction procedure into simple steps, and solves the problem iteratively. Four possible applications are presented and discussed to demonstrate the usage of WarmL1 for different warm-start situations. Experiments on these applications are performed. The results show that WarmL1 achieves 3.2x to 37.5x speeding up or up to 1/5100 l2-error at the same computational cost compared to related works. © 2012 IEEE.Computational costs; Computational effort; Dynamic modifications; Homotopies; Linear measurements; Reconstruction algorithms; Reconstruction problems; Reconstruction procedure; Sparse signals; Algorithms; Information theory; Iterative methodsconference paper10.1109/ISIT.2012.62838492-s2.0-84867503975