1,537 research outputs found
How to find real-world applications for compressive sensing
The potential of compressive sensing (CS) has spurred great interest in the
research community and is a fast growing area of research. However, research
translating CS theory into practical hardware and demonstrating clear and
significant benefits with this hardware over current, conventional imaging
techniques has been limited. This article helps researchers to find those niche
applications where the CS approach provides substantial gain over conventional
approaches by articulating lessons learned in finding one such application; sea
skimming missile detection. As a proof of concept, it is demonstrated that a
simplified CS missile detection architecture and algorithm provides comparable
results to the conventional imaging approach but using a smaller FPA. The
primary message is that all of the excitement surrounding CS is necessary and
appropriate for encouraging our creativity but we all must also take off our
"rose colored glasses" and critically judge our ideas, methods and results
relative to conventional imaging approaches.Comment: 10 page
Optimal Coded Diffraction Patterns for Practical Phase Retrieval
Phase retrieval, a long-established challenge for recovering a complex-valued
signal from its Fourier intensity measurements, has attracted significant
interest because of its far-flung applications in optical imaging. To enhance
accuracy, researchers introduce extra constraints to the measuring procedure by
including a random aperture mask in the optical path that randomly modulates
the light projected on the target object and gives the coded diffraction
patterns (CDP). It is known that random masks are non-bandlimited and can lead
to considerable high-frequency components in the Fourier intensity
measurements. These high-frequency components can be beyond the Nyquist
frequency of the optical system and are thus ignored by the phase retrieval
optimization algorithms, resulting in degraded reconstruction performances.
Recently, our team developed a binary green noise masking scheme that can
significantly reduce the high-frequency components in the measurement. However,
the scheme cannot be extended to generate multiple-level aperture masks. This
paper proposes a two-stage optimization algorithm to generate multi-level
random masks named that can also significantly reduce
high-frequency components in the measurements but achieve higher accuracy than
the binary masking scheme. Extensive experiments on a practical optical
platform were conducted. The results demonstrate the superiority and
practicality of the proposed over the existing masking
schemes for CDP phase retrieval
Design and Analysis of a Spatial Neutron Modulator for Neutron Imaging via Compressive Sensing
The ability to characterize materials is an important aspect when performing any sort of materials science experiment. When performing studies where understanding the molecular-level characteristics are critical such as for molecular bonding in batteries or complex polymers, analysis techniques such as vibrational spectroscopy are often used. At the Spallation Neutron Source at Oak Ridge National Laboratory the VISION instrument performs vibrational spectroscopy using neutrons. The reason for utilizing neutrons includes aspects such as increased penetration depth into the sample and high sensitivity; however, currently it is only possible to perform bulk sample measurements. By utilizing a technique known as compressive sensing it will be made possible to map material properties and characteristics across an entire sample.This thesis discusses the design process for creating a spatial neutron modulator that will allow for compressive sensing to be used within VISION as well as the creation of a testable prototype and analysis of the prototypeโs performance. In order to test the performance of the system as well as the compressive sensing algorithm the prototype is tested using an optical set-up. This approach allows for the concepts to be tested on a cheaper scale to ensure feasibility of the design and compressive sensing algorithm prior to the creation of the final system
๋์ผ๋ฏธ๋ฌ ๋ผ์ด๋ค ์ด๋ฏธ์ง์ ์ํ ํ์ด๋ฐ์ด ๊ณ ๋ ค๋ ์ํ๋ง ์๊ณ ๋ฆฌ์ฆ
ํ์๋
ผ๋ฌธ (๋ฐ์ฌ)-- ์์ธ๋ํ๊ต ๋ํ์ : ๊ณต๊ณผ๋ํ ์ ๊ธฐยท์ ๋ณด๊ณตํ๋ถ, 2019. 2. Lee, Hyuk-Jae.In recent years, active sensor technologies such as light detection and ranging (LIDAR) have been intensively studied in theory and widely adopted in many applications, i.e., self-driving cars, robotics and sensing. Generally, the spatial resolution of a depth-acquisition device, such as a LiDAR sensor, is limited because of a slow acquisition speed. To accurately reconstruct a depth image from a limited spatial resolution, a two-stage sampling process has been widely used. However, two-stage sampling uses an irregular sampling pattern for the sampling operation, which requires a large amount of computation for reconstruction. A mathematical formulation of a LiDAR system demonstrates that the existing two-stage sampling does not satisfy its timing constraint for practical use. Therefore, designing a LiDAR system with an efficient sampling algorithm is a significant technological challenge.
Firstly, this thesis addresses the problem of adopting the state-of-art laser marking system of a dual-mirror deflection scanner when creating a high-definition LIDAR system. Galvanometer scanners are modeled and parameterized based on concepts of their controllers and the well-known raster scanning method. The scanning strategy is then modeled and analyzed considering the physical scanning movement and the minimum spanning tree. From this analysis, the link between the quality of the captured image of a field of view (FOV) and the scanning speed is revealed. Furthermore, sufficient conditions are derived to indicate that the acquired image fully covers the FOV and that the captured objects are well aligned under a specific frame rate. Finally, a sample LIDAR system is developed to illustrate the proposed concepts.
Secondly, to overcome the drawbacks of two-stage sampling, we propose a new sampling method that reduces the computational complexity and memory requirements by generating the optimal representatives of a sampling pattern in down-sample data. A sampling pattern is derived from a k-NN expanding operation from the downsampled representatives. The proposed algorithm is designed to preserve the object boundary by restricting the expansion-operation only to the object boundary or complex texture. In addition, the proposed algorithm runs in linear-time complexity and reduces the memory requirements using a down-sampling ratio. Experimental results with Middlebury datasets and Brown laser-range datasets are presented.
Thirdly, state-of-the-art adaptive methods such as two-step sampling are highly effective while addressing indoor, less complex scenes at a moderately low sampling rate. However, their performance is relatively low in complex on-road environments, particularly when the sampling rate of the measuring equipment is low. To address this problem, this thesis proposes a region-of-interest-(ROI)-based sampling algorithm in on-road environments for autonomous driving. With the aid of fast and accurate road and object detection algorithms, particularly those based on convolutional neural networks (CNNs), the proposed sampling algorithm utilizes the semantic information and effectively distributes samples in road, object, and background areas. Experimental results with KITTI datasets are presented.์ต๊ทผ LIDAR (light detection and ranging)์ ๊ฐ์ ๋ฅ๋์ ์ผ์ ๊ธฐ์ ์ ์ด๋ก ์ ์ผ๋ก๋ ์ง์ค์ ์ผ๋ก ์ฐ๊ตฌ๋์๊ณ , ์์จ์ฃผํ์ฐจ, ๋ก๋ด, ์ผ์ฑ ๋ฑ ๋ค์ํ ์์ฉ ๋ถ์ผ์ ๋๋ฆฌ ์ฌ์ฉ๋๊ณ ์๋ค. ์ผ๋ฐ์ ์ผ๋ก LiDAR ์ผ์์ ๊ฐ์ ์ฌ๋์ธก์ ์ฅ์น๋ ๋๋ฆฐ ์๋ ๋๋ฌธ์ ๊ณต๊ฐ์ ํด์๋๊ฐ ์ ํ๋๋ค. ์ ํ๋ ๊ณต๊ฐ์ ํด์๋๋ก๋ถํฐ ์ฌ๋ ์ด๋ฏธ์ง๋ฅผ ์ ํํ๊ฒ ์ฌ๊ตฌ์ฑํ๊ธฐ ์ํด์ 2๋จ๊ณ ์ํ๋ง ๋ฐฉ๋ฒ์ด ๋๋ฆฌ ์ฌ์ฉ๋๊ณ ์๋ค. ๊ทธ๋ฌ๋ 2๋จ๊ณ ์ํ๋ง์ ๋ถ๊ท์น์ ์ธ ์ํ๋ง ํจํด์ผ๋ก ์ํ๋ง์ ํ๊ธฐ ๋๋ฌธ์, ์ฌ๊ตฌ์ฑ ๊ณผ์ ์ ๋ง์ ์์ ์ฐ์ฐ์ด ํ์ํ๋ค. LiDAR ์์คํ
์ ์ํ์ ์ธ ๋ชจ๋ธ์ ์ฌ์ฉํ์ฌ ๋ถ์ํ์์ ๋, ๊ธฐ์กด์ 2๋จ๊ณ ์ํ๋ง์ ์ค์ฉ์ ์ผ๋ก ์ฌ์ฉ๋๊ธฐ ์ํ ํ์ด๋ฐ ์ ์ฝ ์กฐ๊ฑด์ ๋ง์กฑํ์ง ๋ชปํจ์ ํ์ธํ์๋ค. ๋ฐ๋ผ์ ํจ์จ์ ์ธ ์ํ๋ง ์๊ณ ๋ฆฌ์ฆ์ ์ฌ์ฉํ๋ LiDAR ์์คํ
์ ์ค๊ณํ๋ ๊ฒ์ ์ค์ํ ๊ธฐ์ ์ ๊ณผ์ ์ด๋ค.
์ฒซ์งธ, ๋ณธ ๋
ผ๋ฌธ์ ์ต์ ์ ๋ ์ด์ ๋งํน ์์คํ
์ dual-mirror ์ค์บ๋์ ์ ์ฉํ์ฌ ๊ณ ํด์๋ LiDAR ์์คํ
์ ๋ง๋๋ ๋ฌธ์ ๋ฅผ ๋ค๋ฃฌ๋ค. Galvanometer ์ค์บ๋ ์ปจํธ๋กค๋ฌ์ ์ ์๋ ค์ง ๋์คํฐ ์ค์บ ๋ฐฉ๋ฒ์ ๊ธฐ์ดํ์ฌ Galvanometer ์ค์บ๋๋ฅผ ๋ชจ๋ธ๋ง, ๋งค๊ฐ๋ณ์ํํ๋ค. ๊ทธ๋ฆฌ๊ณ ๋ฌผ๋ฆฌ์ ์ธ ์ค์บ๋ ์์ง์๊ณผ ์ต์ ์ ์ฅ ํธ๋ฆฌ๋ฅผ ๊ณ ๋ คํ์ฌ ์ค์บ๋ ๋ฐฉ๋ฒ์ ๋ชจ๋ธ๋งํ๊ณ ๋ถ์ํ๋ค. ๋ถ์์ผ๋ก๋ถํฐ ์ํ๋ FOV (field of view)๋ก ์บก์ณ๋ ์ด๋ฏธ์ง์ ํ์ง๊ณผ ์ค์บ๋ ์๋ ์ฌ์ด์ ๊ด๊ณ๋ฅผ ๋ฐํ๋ค. ๋ํ ํ๋๋ ์ด๋ฏธ์ง๊ฐ FOV๋ฅผ ์์ ํ ํํํ๋ฉฐ, ์บก์ณ๋ object๋ค์ด ํน์ ํ๋ ์ ๋ ์ดํธ์์ ์ ์ ๋ ฌ๋จ์ ๋ํ๋ด๋ ์ถฉ๋ถ์กฐ๊ฑด์ ์ ๋ํ์๋ค. ๋ง์ง๋ง์ผ๋ก ์ ์๋ ๊ฐ๋
์ ํ์ธํ๊ธฐ ์ํด ์ํ LIDAR ์์คํ
์ ๊ฐ๋ฐํ์๋ค.
๋์งธ, 2๋จ๊ณ ์ํ๋ง์ ๋จ์ ์ ๊ทน๋ณตํ๊ธฐ ์ํด, ๋ค์ด ์ํ ๋ฐ์ดํฐ์์ ์ํ๋ง ํจํด์ ์ต์ ํํ์ ์์ฑํจ์ผ๋ก์จ ์ฐ์ฐ ๋ณต์ก๋์ ๋ฉ๋ชจ๋ฆฌ ์๊ตฌ๋์ ์ค์ผ ์ ์๋ ์๋ก์ด ์ํ๋ง ๋ฐฉ๋ฒ์ ์ ์ํ๋ค. ์ํ๋ง ํจํด์ ๋ค์ด ์ํ๋ ํํ์ k-NN ํ์ฅ ์ฐ์ฐ์ผ๋ก๋ถํฐ ๋์ถ๋๋ค. ์ ์๋ ๋ฐฉ๋ฒ์ ๋ฌผ์ฒด ๊ฒฝ๊ณ ๋๋ ๋ณต์กํ ํ
์ค์ฒ์ ํํด์ ํ์ฅ์ฐ์ฐ์ ์ํํจ์ผ๋ก์จ ๋ฌผ์ฒด ๊ฒฝ๊ณ๋ฅผ ๋ณด์กดํ๋๋ก ์ค๊ณ๋์๋ค. ๋ํ ์ ์ํ๋ ๋ฐฉ๋ฒ์ ์ ํ์ ์ธ ์๊ฐ ๋ณต์ก๋๋ก ๋์ํ๋ฉฐ ๋ค์ด ์ํ๋ง ๋น์จ์ ์ด์ฉํ์ฌ ๋ฉ๋ชจ๋ฆฌ ์๊ตฌ๋์ ์ค์ธ๋ค. Middlebury ๋ฐ์ดํฐ์
๊ณผ Brown laser-range ๋ฐ์ดํฐ์
์ ์ฌ์ฉํ ์คํ ๊ฒฐ๊ณผ๊ฐ ์ ์๋๋ค.
์
์งธ, 2๋จ๊ณ ์ํ๋ง๊ณผ ๊ฐ์ ์ต์ ์ ์ ์์ ๋ฐฉ๋ฒ๋ค์ ๋น๊ต์ ๋ฎ์ ์ํ๋ง ๋ ์ดํธ๋ก ์ค๋ด์ ๋ณต์กํ์ง ์์ ์ฅ๋ฉด๋ค์ ์ฒ๋ฆฌํ๋ ๋ฐ ๋งค์ฐ ํจ๊ณผ์ ์ด๋ค. ๊ทธ๋ฌ๋ ๋ณต์กํ ๋๋ก ํ๊ฒฝ์์๋, ํนํ ์ธก์ ์ฅ๋น์ ์ํ๋ง ๋ ์ดํธ๊ฐ ๋ฎ์ ๊ฒฝ์ฐ์, ํด๋น ๋ฐฉ๋ฒ๋ค์ ์ฑ๋ฅ์ด ์๋์ ์ผ๋ก ๋จ์ด์ง๋ค. ์ด ๋ฌธ์ ๋ฅผ ํด๊ฒฐํ๊ธฐ ์ํด ๋ณธ ๋
ผ๋ฌธ์ ์์จ์ฃผํ์ ์ํ ๋๋ก ํ๊ฒฝ์์์ ROI (region-of-interest) ๊ธฐ๋ฐ ์ํ๋ง ์๊ณ ๋ฆฌ์ฆ์ ์ ์ํ๋ค. ์ ์๋ ์ํ๋ง ์๊ณ ๋ฆฌ์ฆ์ CNN (convolutional neural network) ๊ธฐ๋ฐ์ ๋น ๋ฅด๊ณ ์ ํํ ๋๋ก ๋ฐ ๋ฌผ์ฒด ๊ฐ์ง ์๊ณ ๋ฆฌ์ฆ์ ์ฌ์ฉํ์ฌ, semantic ์ ๋ณด๋ฅผ ํ์ฉํ๊ณ ๋๋ก, ๋ฌผ์ฒด, ๋ฐฐ๊ฒฝ ์์ญ์ ์ํ๋ค์ ํจ๊ณผ์ ์ผ๋ก ๋ถ๋ฐฐํ๋ค. KITTI ๋ฐ์ดํฐ์
์ ์ฌ์ฉํ ์คํ ๊ฒฐ๊ณผ๊ฐ ์ ์๋๋ค.Abstract i
Table of Contents iii
List of Figures vii
List of Tables xi
Chapter 1: Introduction ๏ผ
1.1. Overview ๏ผ
1.2. Scope and contributions ๏ผ
1.3. Thesis Outlines ๏ผ
Chapter 2: Related work ๏ผ
2.1. LiDAR sensors ๏ผ
2.2. Sampling ๏ผ
2.2.1. Sampling problem definition ๏ผ
2.2.2. Sampling model ๏ผ
2.2.3. Oracle Random sampling (Gradient-based sampling) ๏ผ
2.3. Reconstruction ๏ผ
Chapter 3: Dual-Mirror LiDAR ๏ผ๏ผ
3.1. Introduction ๏ผ๏ผ
3.1.1. Related work ๏ผ๏ผ
3.2. Modelling a controller of dual-mirror scanners ๏ผ๏ผ
3.2.1. Dual-mirror scanners ๏ผ๏ผ
3.2.2. Controller Model ๏ผ๏ผ
3.2.2.1. FOV representation ๏ผ๏ผ
3.2.2.2. Timing constraints ๏ผ๏ผ
3.2.2.3. Maximum Speed of LiDAR scanners ๏ผ๏ผ
3.3. LiDAR scanning optimization problem ๏ผ๏ผ
3.3.1. Scanning Problem ๏ผ๏ผ
3.3.2. Optimal scanning pattern ๏ผ๏ผ
3.3.2.1. Grid-graph representation of Field of View ๏ผ๏ผ
3.3.2.2. Optimal scanning pattern ๏ผ๏ผ
3.3.2.3. Combining an optimal sampling pattern with timing constraints ๏ผ4
3.4. LiDAR system Prototype ๏ผ๏ผ
3.4.1. System overview ๏ผ๏ผ
3.4.2. Speed evaluation ๏ผ๏ผ
3.4.3. Subjective Evaluation ๏ผ๏ผ
3.4.4. Accuracy Evaluation ๏ผ๏ผ
Chapter 4: Sampling for Dual-Mirror LiDAR: Sampling Model and Algorithm ๏ผ๏ผ
4.1. Introduction ๏ผ๏ผ
4.2. Sampling Model for Dual-Mirror LiDAR ๏ผ๏ผ
4.2.1. Timing constraint ๏ผ๏ผ
4.2.2. Memory-space constraint ๏ผ๏ผ
4.2.3. New sampling problem with constraints ๏ผ๏ผ
4.3. Proposed sampling Algorithm and Its Properties ๏ผ๏ผ
4.3.1. Downsampling and k-NN expanding operator ๏ผ๏ผ
4.3.2. Proposed Sampling Algorithm with k-NN Expanding ๏ผ๏ผ
4.3.3. Example with Synthetic Data ๏ผ๏ผ
4.3.4. Proposed sampling algorithm with interpolation ๏ผ๏ผ
4.3.5. Timing and memory constraints ๏ผ๏ผ
4.3.5.1. Timing constraint ๏ผ๏ผ
4.3.5.2. Memory constraint ๏ผ๏ผ
4.4. Experimental results ๏ผ๏ผ
4.4.1. Comparison on the conventional sampling problem ๏ผ๏ผ
4.4.1.1. Subjective comparison ๏ผ๏ผ
4.4.1.2. Quantitative comparison ๏ผ๏ผ
4.4.2. Comparison on the new sampling problem for LiDAR ๏ผ๏ผ
4.4.2.1. Compression ratios ๏ผ๏ผ
4.4.2.2. Quantitative evaluation with Peak-signal-to-noise-ratio ๏ผ๏ผ
4.4.2.3. Quantitative evaluation with Percentages of bad pixels ๏ผ๏ผ
4.4.3. Subjective evaluation ๏ผ๏ผ
4.4.4. Proposed grid sampling and grid sampling method ๏ผ๏ผ
4.4.4.1. Middlebury datasets ๏ผ๏ผ
4.4.4.2. Brown Laser range datasets ๏ผ๏ผ
Chapter 5: ROI-based LiDAR Sampling in On-Road Environment for Autonomous Driving ๏ผ๏ผ
5.1. Introduction ๏ผ๏ผ
5.2. Proposed ROI-based sampling algorithm ๏ผ๏ผ
5.2.1. Motivating example ๏ผ๏ผ
5.2.2. ROI-based Sampling Problem ๏ผ๏ผ
5.2.3. Proposed ROI-based sampling algorithm ๏ผ๏ผ
5.2.4. Practical considerations ๏ผ๏ผ
5.2.5. Distortion optimization problem ๏ผ๏ผ
5.3. Experimental results ๏ผ๏ผ
5.3.1. Datasets ๏ผ๏ผ
5.3.2. Evaluation with different parameters ๏ผ๏ผ
5.3.3. Object and quantitative comparisons ๏ผ๏ผ๏ผ
Chapter 6: Implementation Issues ๏ผ๏ผ๏ผ
6.1. Implementation of gradient-based sampling ๏ผ๏ผ๏ผ
6.2. System overview ๏ผ๏ผ๏ผ
Chapter 7: Conclusion ๏ผ๏ผ๏ผ
References ๏ผ๏ผ๏ผ
์ด๋ก ๏ผ๏ผ๏ผDocto
Signal processing for microwave imaging systems with very sparse array
This dissertation investigates image reconstruction algorithms for near-field, two dimensional (2D) synthetic aperture radar (SAR) using compressed sensing (CS) based methods. In conventional SAR imaging systems, acquiring higher-quality images requires longer measuring time and/or more elements in an antenna array. Millimeter wave imaging systems using evenly-spaced antenna arrays also have spatial resolution constraints due to the large size of the antennas. This dissertation applies the CS principle to a bistatic antenna array that consists of separate transmitter and receiver subarrays very sparsely and non-uniformly distributed on a 2D plane. One pair of transmitter and receiver elements is turned on at a time, and different pairs are turned on in series to achieve synthetic aperture and controlled random measurements. This dissertation contributes to CS-hardware co-design by proposing several signal-processing methods, including monostatic approximation, re-gridding, adaptive interpolation, CS-based reconstruction, and image denoising. The proposed algorithms enable the successful implementation of CS-SAR hardware cameras, improve the resolution and image quality, and reduce hardware cost and experiment time. This dissertation also describes and analyzes the results for each independent method. The algorithms proposed in this dissertation break the limitations of hardware configuration. By using 16 x 16 transmit and receive elements with an average space of 16 mm, the sparse-array camera achieves the image resolution of 2 mm. This is equivalent to six percent of the ฮป/4 evenly-spaced array. The reconstructed images achieve similar quality as the fully-sampled array with the structure similarity (SSIM) larger than 0.8 and peak signal-to-noise ratio (PSNR) greater than 25 --Abstract, page iv
- โฆ