In this paper, using the near orthogonal property, we analyze the performance of greedy block coordinate descent (GBCD) algorithm when both the measurements and the measurement matrix are perturbed by some errors. An improved sufficient condition is presented to guarantee that the support of the sparse matrix is recovered exactly. A counterexample is provided to show that GBCD fails. It improves the existing result. By experiments, we also point out that GBCD is robust under these perturbations.
from #AlexandrosSfakianakis via Alexandros G.Sfakianakis on Inoreader http://ift.tt/2pC3Moz
via IFTTT
Εγγραφή σε:
Σχόλια ανάρτησης (Atom)
Δημοφιλείς αναρτήσεις
-
Publication date: January 2017 Source: International Journal of Biological Macromolecules, Volume 94, Part A Author(s): Vinicius Jose Silv...
-
Background Moyamoya angiopathy (MMA) is characterised by a progressive stenosis of the terminal part of the internal carotid arteries and th...
-
Publication date: October 2017 Source: International Journal of Biological Macromolecules, Volume 103 Author(s): Shehwaz Anwar, Hina Youn...
-
Communicating with patients at the end of life is regarded as a difficult task, and speaking openly about death is often avoided.1,2 Around ...
-
Pyrexia is a physiological response through which the immune system responds to infectious processes. Hyperpyrexia is known to be neurodegen...
-
A. M. Y. Yong, SS Yang, KB Tan, SA Ho Indian Dermatology Online Journal 2017 8(3):192-194 The Trichosporon species are yeast-like opport...
-
Mucoepidermoid carcinoma is the most common malignant, locally invasive tumour of the salivary glands and accounts for approximately 35% of ...
-
Abstract The core mission of the Early Stage Professionals in Molecular Imaging Sciences (ESPMIS) Interest Group is to help young scientist...
-
BACKGROUND AND PURPOSE: Treatment with bevacizumab is standard of care for recurrent high-grade gliomas; however, monitoring response to ...
Δεν υπάρχουν σχόλια:
Δημοσίευση σχολίου