A Novel Undersampling Scheme for Data Acquisition in Non K-Space Domains

Keywords

acceleration accuracy achieved acquisition allocate beyond binary brain captured check chosen coefficients combining compressed computed contained corner cross decomposed decomposing decreases decreasing depending describes detailed determined developments directly domain domains done easily efficient efficiently enable encoding encouraging energy enough equals error evaluation evaluations example exceeds excitation extracted field flash fold fully healthy hence herein heuristic hundred hypothetically idea illustrate illustrated implementation improvement indicate indicated intensity intentionally labeled last least lies localize localizes locate location logarithmic long loss marked materials matrix measures necessarily negative next noise nonzero normalized novel opposed original parallel performance phantom pixel post processing proof proposed randomly real reconstruct reconstructed rectangle rectangles reduction regular representation resolution respectively root rough sample sampling saved scanned scanning scheme schemes search sensing seven simulated since space spaces sparse sparsity stopped structures suboptimal successively sums sure systems table technical theoretically theory threshold toolbox transformation transmit various versus visibly volunteer wavelet wavelets whether white zero