Sökning: "L1-minimization"

Hittade 2 uppsatser innehållade ordet L1-minimization.

1. 1. Compressed sensing for error correction on real-valued vectors

   Kandidat-uppsats, Linnéuniversitetet/Institutionen för matematik (MA)

   Författare :Pontus Tordsson; [2019]
   Nyckelord :compressed sensing; error correction; sparse vector; L0-minimization; L1-minimization;

   Sammanfattning : Compressed sensing (CS) is a relatively new branch of mathematics with very interesting applications in signal processing, statistics and computer science. This thesis presents some theory of compressed sensing, which allows us to recover (high-dimensional) sparse vectors from (low-dimensional) compressed measurements by solving the L1-minimization problem. LÄS MER

3. 2. Compressed Sensing for 3D Laser Radar

   Master-uppsats, Linköpings universitet/Datorseende; Linköpings universitet/Tekniska högskolan

   Författare :Erik Fall; [2014]
   Nyckelord :compressed sensing; compressed sampling; TCSPC; TV minimization; l1 minimization; DMD;

   Sammanfattning : High resolution 3D images are of high interest in military operations, where data can be used to classify and identify targets. The Swedish defence research agency (FOI) is interested in the latest research and technologies in this area. A draw- back with normal 3D-laser systems are the lack of high resolution for long range measurements. LÄS MER