{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/compressed-sensing/papers/9","list_of":"/task/compressed-sensing","task":"compressed sensing","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":9,"pages_in_order":10,"rows_per_page":100,"rows":[801,900],"of":992,"counts":{"archive_papers_tagged":992,"with_a_code_link":246,"where_syntology_ran_a_sample":27,"not_listed_spam_title":0,"listed":992,"listed_where_code_ran":27,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":25,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":25,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/compressed-sensing","prev":"/task/compressed-sensing/papers/8","next":"/task/compressed-sensing/papers/10","papers":[{"url":null,"slug":"shearlet-based-compressed-sensing-for-fast-3d","title":"Shearlet-based compressed sensing for fast 3D cardiac MR imaging using iterative reweighting","date":"2017-05-01","arxiv_id":"1705.00463","repositories_listed":0,"syntology":null},{"url":null,"slug":"restricted-isometry-property-of-gaussian","title":"Restricted Isometry Property of Gaussian Random Projection for Finite Set of Subspaces","date":"2017-04-07","arxiv_id":"1704.02109","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-is-network-lasso-accurate","title":"When is Network Lasso Accurate?","date":"2017-04-07","arxiv_id":"1704.02107","repositories_listed":0,"syntology":null},{"url":null,"slug":"multilinear-compressive-sensing-and-an","title":"Multilinear compressive sensing and an application to convolutional linear networks","date":"2017-03-23","arxiv_id":"1703.08044","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-projection-operator-to-a-three-view","title":"On The Projection Operator to A Three-view Cardinality Constrained Set","date":"2017-03-21","arxiv_id":"1703.07345","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-artifact-learning-for-compressed-sensing","title":"Deep artifact learning for compressed sensing and parallel MRI","date":"2017-03-03","arxiv_id":"1703.01120","repositories_listed":0,"syntology":null},{"url":null,"slug":"signal-recovery-from-unlabeled-samples","title":"Signal Recovery from Unlabeled Samples","date":"2017-01-30","arxiv_id":"1701.08701","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-layer-generalized-linear-estimation","title":"Multi-Layer Generalized Linear Estimation","date":"2017-01-24","arxiv_id":"1701.06981","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-asynchronous-parallel-approach-to-sparse","title":"An Asynchronous Parallel Approach to Sparse Recovery","date":"2017-01-12","arxiv_id":"1701.03458","repositories_listed":0,"syntology":null},{"url":null,"slug":"extracting-sub-exposure-images-from-a-single","title":"Extracting Sub-Exposure Images from a Single Capture Through Fourier-based Optical Modulation","date":"2016-12-26","arxiv_id":"1612.08359","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-blind-compressed-sensing","title":"Deep Blind Compressed Sensing","date":"2016-12-22","arxiv_id":"1612.07453","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-spatial-angular-sparse-coding-for-dmri","title":"Joint Spatial-Angular Sparse Coding for dMRI with Separable Dictionaries","date":"2016-12-18","arxiv_id":"1612.05846","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-support-recovery-with-non-smooth-loss","title":"Sparse Support Recovery with Non-smooth Loss Functions","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-residual-learning-for-compressed-sensing","title":"Deep Residual Learning for Compressed Sensing CT Reconstruction via Persistent Homology Analysis","date":"2016-11-19","arxiv_id":"1611.06391","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-and-adaptive-sparse-signal-lassi","title":"Low-rank and Adaptive Sparse Signal (LASSI) Models for Highly Accelerated Dynamic Imaging","date":"2016-11-13","arxiv_id":"1611.04069","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-learning-with-nonconvex-l1-2","title":"Fast Learning with Nonconvex L1-2 Regularization","date":"2016-10-29","arxiv_id":"1610.09461","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-signal-recovery-for-binary-compressed","title":"Sparse Signal Recovery for Binary Compressed Sensing by Majority Voting Neural Networks","date":"2016-10-29","arxiv_id":"1610.09463","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressive-holographic-video","title":"Compressive Holographic Video","date":"2016-10-27","arxiv_id":"1610.09013","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-estimation-of-compressible-state","title":"Efficient Estimation of Compressible State-Space Models with Application to Calcium Signal Deconvolution","date":"2016-10-20","arxiv_id":"1610.06461","repositories_listed":0,"syntology":null},{"url":null,"slug":"message-passing-algorithms-for","title":"Message-passing algorithms for synchronization problems over compact groups","date":"2016-10-14","arxiv_id":"1610.04583","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-bayesian-compressed-sensing","title":"Robust Bayesian Compressed sensing","date":"2016-10-10","arxiv_id":"1610.02807","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-primer-on-coordinate-descent-algorithms","title":"A Primer on Coordinate Descent Algorithms","date":"2016-09-30","arxiv_id":"1610.00040","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-codes-for-source-separation-in","title":"Optimizing Codes for Source Separation in Color Image Demosaicing and Compressive Video Recovery","date":"2016-09-07","arxiv_id":"1609.02135","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-averaging-expectation-propagation","title":"Self-Averaging Expectation Propagation","date":"2016-08-23","arxiv_id":"1608.06602","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-and-arbitrage-free-construction","title":"Nonparametric and arbitrage-free construction of call surfaces using l1-recovery","date":"2016-08-15","arxiv_id":"1506.06997","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-coding-of-multiview-sparse","title":"Distributed Coding of Multiview Sparse Sources with Joint Recovery","date":"2016-07-18","arxiv_id":"1607.04965","repositories_listed":0,"syntology":null},{"url":null,"slug":"double-detector-for-sparse-signal-detection","title":"Double-detector for Sparse Signal Detection from One Bit Compressed Sensing Measurements","date":"2016-07-02","arxiv_id":"1607.00494","repositories_listed":0,"syntology":null},{"url":null,"slug":"small-coherence-implies-the-weak-null-space","title":"Small coherence implies the weak Null Space Property","date":"2016-06-29","arxiv_id":"1606.09193","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-methods-for-recovering-sparse-parameters","title":"Fast Methods for Recovering Sparse Parameters in Linear Low Rank Models","date":"2016-06-26","arxiv_id":"1606.08009","repositories_listed":0,"syntology":null},{"url":null,"slug":"tight-performance-bounds-for-compressed","title":"Tight Performance Bounds for Compressed Sensing With Conventional and Group Sparsity","date":"2016-06-19","arxiv_id":"1606.05889","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-speed-real-time-single-pixel-microscopy","title":"High-speed real-time single-pixel microscopy based on Fourier sampling","date":"2016-06-15","arxiv_id":"1606.05200","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-data-compression-and-mac-protocol","title":"Joint Data Compression and MAC Protocol Design for Smartgrids with Renewable Energy","date":"2016-06-15","arxiv_id":"1606.04995","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-adaptation-of-complex-valued","title":"Efficient adaptation of complex-valued noiselet sensing matrices for compressed single-pixel imaging","date":"2016-06-14","arxiv_id":"1606.04535","repositories_listed":0,"syntology":null},{"url":null,"slug":"inferring-sparsity-compressed-sensing-using","title":"Inferring Sparsity: Compressed Sensing using Generalized Restricted Boltzmann Machines","date":"2016-06-13","arxiv_id":"1606.03956","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparison-of-several-sparse-recovery-methods","title":"Comparison of Several Sparse Recovery Methods for Low Rank Matrices with Random Samples","date":"2016-06-12","arxiv_id":"1606.03672","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-overcomplete-low-coherence","title":"Learning overcomplete, low coherence dictionaries with linear inference","date":"2016-06-10","arxiv_id":"1606.03474","repositories_listed":0,"syntology":null},{"url":null,"slug":"finite-sample-analysis-of-approximate-message","title":"Finite Sample Analysis of Approximate Message Passing Algorithms","date":"2016-06-06","arxiv_id":"1606.01800","repositories_listed":0,"syntology":null},{"url":null,"slug":"average-case-hardness-of-rip-certification","title":"Average-case Hardness of RIP Certification","date":"2016-05-31","arxiv_id":"1605.09646","repositories_listed":0,"syntology":null},{"url":null,"slug":"tradeoffs-between-convergence-speed-and","title":"Tradeoffs between Convergence Speed and Reconstruction Accuracy in Inverse Problems","date":"2016-05-30","arxiv_id":"1605.09232","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-symbolic-interior-point-method","title":"The Symbolic Interior Point Method","date":"2016-05-26","arxiv_id":"1605.08187","repositories_listed":0,"syntology":null},{"url":null,"slug":"compliant-conditions-for-polynomial-time","title":"Compliant Conditions for Polynomial Time Approximation of Operator Counts","date":"2016-05-25","arxiv_id":"1605.07989","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-optimality-conditions-for-auto-encoder","title":"On Optimality Conditions for Auto-Encoder Signal Recovery","date":"2016-05-23","arxiv_id":"1605.07145","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-expressive-dictionary-learning-for","title":"Self-expressive Dictionary Learning for Dynamic 3D Reconstruction","date":"2016-05-22","arxiv_id":"1605.06863","repositories_listed":0,"syntology":null},{"url":null,"slug":"solve-select-scale-a-three-step-process-for","title":"Solve-Select-Scale: A Three Step Process For Sparse Signal Estimation","date":"2016-05-16","arxiv_id":"1605.04657","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-constrained-dantzig-selector-with","title":"The constrained Dantzig selector with enhanced consistency","date":"2016-05-11","arxiv_id":"1605.03311","repositories_listed":0,"syntology":null},{"url":null,"slug":"measurement-bounds-for-sparse-signal","title":"Measurement Bounds for Sparse Signal Reconstruction with Multiple Side Information","date":"2016-05-10","arxiv_id":"1605.03234","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-tight-bound-of-hard-thresholding","title":"A Tight Bound of Hard Thresholding","date":"2016-05-05","arxiv_id":"1605.01656","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithms-for-learning-sparse-additive","title":"Algorithms for Learning Sparse Additive Models with Interactions in High Dimensions","date":"2016-05-02","arxiv_id":"1605.00609","repositories_listed":0,"syntology":null},{"url":null,"slug":"methods-for-sparse-and-low-rank-recovery","title":"Methods for Sparse and Low-Rank Recovery under Simplex Constraints","date":"2016-05-02","arxiv_id":"1605.00507","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-recovery-from-extreme-eigenvalues","title":"Sparse Recovery from Extreme Eigenvalues Deviation Inequalities","date":"2016-04-05","arxiv_id":"1604.01171","repositories_listed":0,"syntology":null},{"url":null,"slug":"image-super-resolution-based-on-sparsity","title":"Image Super-Resolution Based on Sparsity Prior via Smoothed $l_0$ Norm","date":"2016-03-22","arxiv_id":"1603.06680","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-compressed-sensing-based-decomposition-of","title":"A Compressed Sensing Based Decomposition of Electrodermal Activity Signals","date":"2016-02-24","arxiv_id":"1602.07754","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-sensing-of-social-networks","title":"Active Sensing of Social Networks","date":"2016-01-21","arxiv_id":"1601.05834","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-mechanics-of-high-dimensional","title":"Statistical Mechanics of High-Dimensional Inference","date":"2016-01-18","arxiv_id":"1601.04650","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-diffusion-steepest-descent-for-one-bit","title":"Sparse Diffusion Steepest-Descent for One Bit Compressed Sensing in Wireless Sensor Networks","date":"2016-01-03","arxiv_id":"1601.00350","repositories_listed":0,"syntology":null},{"url":null,"slug":"error-bounds-for-compressed-sensing","title":"Error Bounds for Compressed Sensing Algorithms With Group Sparsity: A Unified Approach","date":"2015-12-29","arxiv_id":"1512.08673","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-acquisition-for-quantitative-mri-maps","title":"Fast Acquisition for Quantitative MRI Maps: Sparse Recovery from Non-linear Measurements","date":"2015-12-24","arxiv_id":"1512.07712","repositories_listed":0,"syntology":null},{"url":null,"slug":"reconstruction-of-enhanced-ultrasound-images","title":"Reconstruction of Enhanced Ultrasound Images From Compressed Measurements Using Simultaneous Direction Method of Multipliers","date":"2015-12-17","arxiv_id":"1512.05586","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-dynamic-mode-decomposition-for","title":"Compressed Dynamic Mode Decomposition for Background Modeling","date":"2015-12-14","arxiv_id":"1512.04205","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-dynamic-3d-reconstruction-from","title":"Sparse Dynamic 3D Reconstruction From Unsynchronized Videos","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"universality-laws-for-randomized-dimension","title":"Universality laws for randomized dimension reduction, with applications","date":"2015-11-30","arxiv_id":"1511.09433","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-recovery-via-partial-regularization","title":"Sparse Recovery via Partial Regularization: Models, Theory and Algorithms","date":"2015-11-23","arxiv_id":"1511.07293","repositories_listed":0,"syntology":null},{"url":null,"slug":"frist-flipping-and-rotation-invariant","title":"FRIST - Flipping and Rotation Invariant Sparsifying Transform Learning and Applications","date":"2015-11-19","arxiv_id":"1511.06359","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-hypothesis-testing-for-one-bit","title":"Bayesian hypothesis testing for one bit compressed sensing with sensing matrix perturbation","date":"2015-11-18","arxiv_id":"1511.05660","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-approximation-by-greedy-algorithms","title":"Sparse approximation by greedy algorithms","date":"2015-11-05","arxiv_id":"1511.01846","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-learning-of-a-union-of","title":"Data-Driven Learning of a Union of Sparsifying Transforms Model for Blind Compressed Sensing","date":"2015-11-04","arxiv_id":"1511.01289","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-theory-of-confidence-regions-and","title":"A Unified Theory of Confidence Regions and Testing for High Dimensional Estimating Equations","date":"2015-10-30","arxiv_id":"1510.08986","repositories_listed":0,"syntology":null},{"url":null,"slug":"bregman-iteration-for-correspondence-problems","title":"Bregman Iteration for Correspondence Problems: A Study of Optical Flow","date":"2015-10-05","arxiv_id":"1510.01130","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bayesian-compressed-sensing-kalman-filter","title":"A Bayesian Compressed Sensing Kalman Filter for Direction of Arrival Estimation","date":"2015-09-21","arxiv_id":"1509.06290","repositories_listed":0,"syntology":null},{"url":null,"slug":"precise-phase-transition-of-total-variation","title":"Precise Phase Transition of Total Variation Minimization","date":"2015-09-15","arxiv_id":"1509.04376","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequential-information-guided-sensing","title":"Sequential Information Guided Sensing","date":"2015-09-01","arxiv_id":"1509.00130","repositories_listed":0,"syntology":null},{"url":null,"slug":"dictionary-learning-for-blind-one-bit","title":"Dictionary Learning for Blind One Bit Compressed Sensing","date":"2015-08-30","arxiv_id":"1508.07648","repositories_listed":0,"syntology":null},{"url":null,"slug":"light-efficient-flutter-shutter","title":"Light Efficient Flutter Shutter","date":"2015-08-23","arxiv_id":"1509.01220","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-compressive-sensing-a-deep","title":"Distributed Compressive Sensing: A Deep Learning Approach","date":"2015-08-20","arxiv_id":"1508.04924","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimized-projections-for-compressed-sensing","title":"Optimized Projections for Compressed Sensing via Direct Mutual Coherence Minimization","date":"2015-08-13","arxiv_id":"1508.03117","repositories_listed":0,"syntology":null},{"url":null,"slug":"dictionary-and-image-recovery-from-incomplete","title":"Dictionary and Image Recovery from Incomplete and Random Measurements","date":"2015-08-02","arxiv_id":"1508.00278","repositories_listed":0,"syntology":null},{"url":null,"slug":"making-sense-of-randomness-an-approach-for","title":"Making sense of randomness: an approach for fast recovery of compressively sensed signals","date":"2015-07-25","arxiv_id":"1507.07077","repositories_listed":0,"syntology":null},{"url":null,"slug":"unknown-sparsity-in-compressed-sensing","title":"Unknown sparsity in compressed sensing: Denoising and inference","date":"2015-07-25","arxiv_id":"1507.07094","repositories_listed":0,"syntology":null},{"url":null,"slug":"determination-of-nonlinear-genetic","title":"Determination of Nonlinear Genetic Architecture using Compressed Sensing","date":"2015-07-19","arxiv_id":"1408.6583","repositories_listed":0,"syntology":null},{"url":null,"slug":"recursive-sparse-point-process-regression","title":"Recursive Sparse Point Process Regression with Application to Spectrotemporal Receptive Field Plasticity Analysis","date":"2015-07-16","arxiv_id":"1507.04727","repositories_listed":0,"syntology":null},{"url":null,"slug":"projected-wirtinger-gradient-descent-for-low","title":"Projected Wirtinger Gradient Descent for Low-Rank Hankel Matrix Completion in Spectral Compressed Sensing","date":"2015-07-14","arxiv_id":"1507.03707","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-sensing-of-multi-channel-eeg","title":"Compressed Sensing of Multi-Channel EEG Signals: The Simultaneous Cosparsity and Low Rank Optimization","date":"2015-06-29","arxiv_id":"1506.08499","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhanced-lasso-recovery-on-graph","title":"Enhanced Lasso Recovery on Graph","date":"2015-06-19","arxiv_id":"1506.05985","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-proteomics-analysis-a-compressed","title":"Sparse Proteomics Analysis - A compressed sensing-based approach for feature selection and classification of high-dimensional proteomics mass spectrometry data","date":"2015-06-11","arxiv_id":"1506.03620","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-linear-estimation-under-unknown","title":"Optimal linear estimation under unknown nonlinear transform","date":"2015-05-13","arxiv_id":"1505.03257","repositories_listed":0,"syntology":null},{"url":null,"slug":"blind-compressive-sensing-framework-for","title":"Blind Compressive Sensing Framework for Collaborative Filtering","date":"2015-05-07","arxiv_id":"1505.01621","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-neural-networks-with-random-gaussian","title":"Deep Neural Networks with Random Gaussian Weights: A Universal Classification Strategy?","date":"2015-04-30","arxiv_id":"1504.08291","repositories_listed":0,"syntology":null},{"url":null,"slug":"projected-iterative-soft-thresholding","title":"Projected Iterative Soft-thresholding Algorithm for Tight Frames in Compressed Sensing Magnetic Resonance Imaging","date":"2015-04-29","arxiv_id":"1504.07786","repositories_listed":0,"syntology":null},{"url":null,"slug":"nearly-optimal-deterministic-algorithm-for","title":"Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform","date":"2015-04-28","arxiv_id":"1504.07648","repositories_listed":0,"syntology":null},{"url":null,"slug":"regularization-free-estimation-in-trace","title":"Regularization-free estimation in trace regression with symmetric positive semidefinite matrices","date":"2015-04-23","arxiv_id":"1504.06305","repositories_listed":0,"syntology":null},{"url":null,"slug":"poisson-matrix-recovery-and-completion","title":"Poisson Matrix Recovery and Completion","date":"2015-04-20","arxiv_id":"1504.05229","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-sensing-mri-using-masked-dct-and","title":"Compressed sensing MRI using masked DCT and DFT measurements","date":"2015-03-25","arxiv_id":"1503.07384","repositories_listed":0,"syntology":null},{"url":null,"slug":"real-time-dynamic-mri-reconstruction-using","title":"Real-time Dynamic MRI Reconstruction using Stacked Denoising Autoencoder","date":"2015-03-22","arxiv_id":"1503.06383","repositories_listed":0,"syntology":null},{"url":null,"slug":"l_1-regularized-boltzmann-machine-learning","title":"L_1-regularized Boltzmann machine learning using majorizer minimization","date":"2015-03-11","arxiv_id":"1503.03132","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-recovery-of-complex-exponential","title":"Robust recovery of complex exponential signals from random Gaussian projections via low rank Hankel matrix reconstruction","date":"2015-03-10","arxiv_id":"1503.02893","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-scan-1-bit-compressed-sensing","title":"One Scan 1-Bit Compressed Sensing","date":"2015-03-08","arxiv_id":"1503.02346","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximate-message-passing-with-restricted","title":"Approximate Message Passing with Restricted Boltzmann Machine Priors","date":"2015-02-23","arxiv_id":"1502.06470","repositories_listed":0,"syntology":null},{"url":null,"slug":"projected-nesterovs-proximal-gradient","title":"Projected Nesterov's Proximal-Gradient Algorithm for Sparse Signal Reconstruction with a Convex Constraint","date":"2015-02-09","arxiv_id":"1502.02613","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparison-of-algorithms-for-compressed","title":"Comparison of Algorithms for Compressed Sensing of Magnetic Resonance Images","date":"2015-02-07","arxiv_id":"1502.02182","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-inpainting-method-for","title":"Generalized Inpainting Method for Hyperspectral Image Acquisition","date":"2015-02-06","arxiv_id":"1502.01853","repositories_listed":0,"syntology":null}],"record_sha256":"841344dd8ed122f595c4fd2fca7e2a48082cd3531691e8cbf1d079bedd48b508","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}