Sensing and compressing 3-D models
Energy Technology Data Exchange (ETDEWEB)
Krumm, J. [Sandia National Labs., Albuquerque, NM (United States). Intelligent System Sensors and Controls Dept.
1998-02-01
The goal of this research project was to create a passive and robust computer vision system for producing 3-D computer models of arbitrary scenes. Although the authors were unsuccessful in achieving the overall goal, several components of this research have shown significant potential. Of particular interest is the application of parametric eigenspace methods for planar pose measurement of partially occluded objects in gray-level images. The techniques presented provide a simple, accurate, and robust solution to the planar pose measurement problem. In addition, the representational efficiency of eigenspace methods used with gray-level features were successfully extended to binary features, which are less sensitive to illumination changes. The results of this research are presented in two papers that were written during the course of this project. The papers are included in sections 2 and 3. The first section of this report summarizes the 3-D modeling efforts.
Modeling 3D faces from samplings via compressive sensing
Sun, Qi; Tang, Yanlong; Hu, Ping
2013-07-01
3D data is easier to acquire for family entertainment purpose today because of the mass-production, cheapness and portability of domestic RGBD sensors, e.g., Microsoft Kinect. However, the accuracy of facial modeling is affected by the roughness and instability of the raw input data from such sensors. To overcome this problem, we introduce compressive sensing (CS) method to build a novel 3D super-resolution scheme to reconstruct high-resolution facial models from rough samples captured by Kinect. Unlike the simple frame fusion super-resolution method, this approach aims to acquire compressed samples for storage before a high-resolution image is produced. In this scheme, depth frames are firstly captured and then each of them is measured into compressed samples using sparse coding. Next, the samples are fused to produce an optimal one and finally a high-resolution image is recovered from the fused sample. This framework is able to recover 3D facial model of a given user from compressed simples and this can reducing storage space as well as measurement cost in future devices e.g., single-pixel depth cameras. Hence, this work can potentially be applied into future applications, such as access control system using face recognition, and smart phones with depth cameras, which need high resolution and little measure time.
Volumetric (3D) compressive sensing spectral domain optical coherence tomography.
Xu, Daguang; Huang, Yong; Kang, Jin U
2014-11-01
In this work, we proposed a novel three-dimensional compressive sensing (CS) approach for spectral domain optical coherence tomography (SD OCT) volumetric image acquisition and reconstruction. Instead of taking a spectral volume whose size is the same as that of the volumetric image, our method uses a sub set of the original spectral volume that is under-sampled in all three dimensions, which reduces the amount of spectral measurements to less than 20% of that required by the Shan-non/Nyquist theory. The 3D image is recovered from the under-sampled spectral data dimension-by-dimension using the proposed three-step CS reconstruction strategy. Experimental results show that our method can significantly reduce the sampling rate required for a volumetric SD OCT image while preserving the image quality.
A novel 3D Cartesian random sampling strategy for Compressive Sensing Magnetic Resonance Imaging.
Valvano, Giuseppe; Martini, Nicola; Santarelli, Maria Filomena; Chiappino, Dante; Landini, Luigi
2015-01-01
In this work we propose a novel acquisition strategy for accelerated 3D Compressive Sensing Magnetic Resonance Imaging (CS-MRI). This strategy is based on a 3D cartesian sampling with random switching of the frequency encoding direction with other K-space directions. Two 3D sampling strategies are presented. In the first strategy, the frequency encoding direction is randomly switched with one of the two phase encoding directions. In the second strategy, the frequency encoding direction is randomly chosen between all the directions of the K-Space. These strategies can lower the coherence of the acquisition, in order to produce reduced aliasing artifacts and to achieve a better image quality after Compressive Sensing (CS) reconstruction. Furthermore, the proposed strategies can reduce the typical smoothing of CS due to the limited sampling of high frequency locations. We demonstrated by means of simulations that the proposed acquisition strategies outperformed the standard Compressive Sensing acquisition. This results in a better quality of the reconstructed images and in a greater achievable acceleration.
A new combined prior based reconstruction method for compressed sensing in 3D ultrasound imaging
Uddin, Muhammad S.; Islam, Rafiqul; Tahtali, Murat; Lambert, Andrew J.; Pickering, Mark R.
2015-03-01
Ultrasound (US) imaging is one of the most popular medical imaging modalities, with 3D US imaging gaining popularity recently due to its considerable advantages over 2D US imaging. However, as it is limited by long acquisition times and the huge amount of data processing it requires, methods for reducing these factors have attracted considerable research interest. Compressed sensing (CS) is one of the best candidates for accelerating the acquisition rate and reducing the data processing time without degrading image quality. However, CS is prone to introduce noise-like artefacts due to random under-sampling. To address this issue, we propose a combined prior-based reconstruction method for 3D US imaging. A Laplacian mixture model (LMM) constraint in the wavelet domain is combined with a total variation (TV) constraint to create a new regularization regularization prior. An experimental evaluation conducted to validate our method using synthetic 3D US images shows that it performs better than other approaches in terms of both qualitative and quantitative measures.
Fast imaging of laboratory core floods using 3D compressed sensing RARE MRI.
Ramskill, N P; Bush, I; Sederman, A J; Mantle, M D; Benning, M; Anger, B C; Appel, M; Gladden, L F
2016-09-01
Three-dimensional (3D) imaging of the fluid distributions within the rock is essential to enable the unambiguous interpretation of core flooding data. Magnetic resonance imaging (MRI) has been widely used to image fluid saturation in rock cores; however, conventional acquisition strategies are typically too slow to capture the dynamic nature of the displacement processes that are of interest. Using Compressed Sensing (CS), it is possible to reconstruct a near-perfect image from significantly fewer measurements than was previously thought necessary, and this can result in a significant reduction in the image acquisition times. In the present study, a method using the Rapid Acquisition with Relaxation Enhancement (RARE) pulse sequence with CS to provide 3D images of the fluid saturation in rock core samples during laboratory core floods is demonstrated. An objective method using image quality metrics for the determination of the most suitable regularisation functional to be used in the CS reconstructions is reported. It is shown that for the present application, Total Variation outperforms the Haar and Daubechies3 wavelet families in terms of the agreement of their respective CS reconstructions with a fully-sampled reference image. Using the CS-RARE approach, 3D images of the fluid saturation in the rock core have been acquired in 16min. The CS-RARE technique has been applied to image the residual water saturation in the rock during a water-water displacement core flood. With a flow rate corresponding to an interstitial velocity of vi=1.89±0.03ftday(-1), 0.1 pore volumes were injected over the course of each image acquisition, a four-fold reduction when compared to a fully-sampled RARE acquisition. Finally, the 3D CS-RARE technique has been used to image the drainage of dodecane into the water-saturated rock in which the dynamics of the coalescence of discrete clusters of the non-wetting phase are clearly observed. The enhancement in the temporal resolution that has
Fast imaging of laboratory core floods using 3D compressed sensing RARE MRI
Ramskill, N. P.; Bush, I.; Sederman, A. J.; Mantle, M. D.; Benning, M.; Anger, B. C.; Appel, M.; Gladden, L. F.
2016-09-01
Three-dimensional (3D) imaging of the fluid distributions within the rock is essential to enable the unambiguous interpretation of core flooding data. Magnetic resonance imaging (MRI) has been widely used to image fluid saturation in rock cores; however, conventional acquisition strategies are typically too slow to capture the dynamic nature of the displacement processes that are of interest. Using Compressed Sensing (CS), it is possible to reconstruct a near-perfect image from significantly fewer measurements than was previously thought necessary, and this can result in a significant reduction in the image acquisition times. In the present study, a method using the Rapid Acquisition with Relaxation Enhancement (RARE) pulse sequence with CS to provide 3D images of the fluid saturation in rock core samples during laboratory core floods is demonstrated. An objective method using image quality metrics for the determination of the most suitable regularisation functional to be used in the CS reconstructions is reported. It is shown that for the present application, Total Variation outperforms the Haar and Daubechies3 wavelet families in terms of the agreement of their respective CS reconstructions with a fully-sampled reference image. Using the CS-RARE approach, 3D images of the fluid saturation in the rock core have been acquired in 16 min. The CS-RARE technique has been applied to image the residual water saturation in the rock during a water-water displacement core flood. With a flow rate corresponding to an interstitial velocity of vi = 1.89 ± 0.03 ft day-1, 0.1 pore volumes were injected over the course of each image acquisition, a four-fold reduction when compared to a fully-sampled RARE acquisition. Finally, the 3D CS-RARE technique has been used to image the drainage of dodecane into the water-saturated rock in which the dynamics of the coalescence of discrete clusters of the non-wetting phase are clearly observed. The enhancement in the temporal resolution
Lorintiu, Oana; Liebgott, Hervé; Alessandrini, Martino; Bernard, Olivier; Friboulet, Denis
2015-12-01
In this paper we present a compressed sensing (CS) method adapted to 3D ultrasound imaging (US). In contrast to previous work, we propose a new approach based on the use of learned overcomplete dictionaries that allow for much sparser representations of the signals since they are optimized for a particular class of images such as US images. In this study, the dictionary was learned using the K-SVD algorithm and CS reconstruction was performed on the non-log envelope data by removing 20% to 80% of the original data. Using numerically simulated images, we evaluate the influence of the training parameters and of the sampling strategy. The latter is done by comparing the two most common sampling patterns, i.e., point-wise and line-wise random patterns. The results show in particular that line-wise sampling yields an accuracy comparable to the conventional point-wise sampling. This indicates that CS acquisition of 3D data is feasible in a relatively simple setting, and thus offers the perspective of increasing the frame rate by skipping the acquisition of RF lines. Next, we evaluated this approach on US volumes of several ex vivo and in vivo organs. We first show that the learned dictionary approach yields better performances than conventional fixed transforms such as Fourier or discrete cosine. Finally, we investigate the generality of the learned dictionary approach and show that it is possible to build a general dictionary allowing to reliably reconstruct different volumes of different ex vivo or in vivo organs.
Compressive Sensing in High-resolution 3D SAR Tomography of Urban Scenarios
Directory of Open Access Journals (Sweden)
Liao Ming-sheng
2015-04-01
Full Text Available In modern high resolution SAR data, due to the intrinsic side-looking geometry of SAR sensors, layover and foreshortening issues inevitably arise, especially in dense urban areas. SAR tomography provides a new way of overcoming these problems by exploiting the back-scattering property for each pixel. However, traditional non-parametric spectral estimators, e.g. Truncated Singular Value Decomposition (TSVD, are limited by their poor elevation resolution, which is not comparable to the azimuth and slant-range resolution. In this paper, the Compressive Sensing (CS approach using Basis Pursuit (BP and TWo-step Iterative Shrinkage/Thresholding (TWIST are introduced. Experimental studies with real spotlight-mode TerraSAR-X dataset are carried out using both BP and TWIST, to demonstrate the merits of compressive sensing approaches in terms of robustness, computational efficiency, and super-resolution capability.
Nam, Seunghoon; Akçakaya, Mehmet; Basha, Tamer; Stehning, Christian; Manning, Warren J; Tarokh, Vahid; Nezafat, Reza
2013-01-01
A disadvantage of three-dimensional (3D) isotropic acquisition in whole-heart coronary MRI is the prolonged data acquisition time. Isotropic 3D radial trajectories allow undersampling of k-space data in all three spatial dimensions, enabling accelerated acquisition of the volumetric data. Compressed sensing (CS) reconstruction can provide further acceleration in the acquisition by removing the incoherent artifacts due to undersampling and improving the image quality. However, the heavy computational overhead of the CS reconstruction has been a limiting factor for its application. In this article, a parallelized implementation of an iterative CS reconstruction method for 3D radial acquisitions using a commercial graphics processing unit is presented. The execution time of the graphics processing unit-implemented CS reconstruction was compared with that of the C++ implementation, and the efficacy of the undersampled 3D radial acquisition with CS reconstruction was investigated in both phantom and whole-heart coronary data sets. Subsequently, the efficacy of CS in suppressing streaking artifacts in 3D whole-heart coronary MRI with 3D radial imaging and its convergence properties were studied. The CS reconstruction provides improved image quality (in terms of vessel sharpness and suppression of noise-like artifacts) compared with the conventional 3D gridding algorithm, and the graphics processing unit implementation greatly reduces the execution time of CS reconstruction yielding 34-54 times speed-up compared with C++ implementation. PMID:22392604
Bevacqua, Martina T; Scapaticci, Rosa
2016-02-01
In microwave breast cancer imaging magnetic nanoparticles have been recently proposed as contrast agent. Due to the non-magnetic nature of human tissues, magnetic nanoparticles make possible the overcoming of some limitations of conventional microwave imaging techniques, thus providing reliable and specific diagnosis of breast cancer. In this paper, a Compressive Sensing inspired inversion technique is introduced for the reconstruction of the magnetic contrast induced within the tumor. The applicability of Compressive Sensing theory is guaranteed by the fact that the underlying inverse scattering problem is linear and the searched magnetic perturbation is sparse. From the numerical analysis, performed in realistic conditions in 3D geometry, it has been pointed out that the adoption of this new tool allows improving resolution and accuracy of the reconstructions, as well as reducing the number of required measurements.
Larson, Peder E Z; Hu, Simon; Lustig, Michael; Kerr, Adam B; Nelson, Sarah J; Kurhanewicz, John; Pauly, John M; Vigneron, Daniel B
2011-03-01
Hyperpolarized 13C MR spectroscopic imaging can detect not only the uptake of the pre-polarized molecule but also its metabolic products in vivo, thus providing a powerful new method to study cellular metabolism. Imaging the dynamic perfusion and conversion of these metabolites provides additional tissue information but requires methods for efficient hyperpolarization usage and rapid acquisitions. In this work, we have developed a time-resolved 3D MR spectroscopic imaging method for acquiring hyperpolarized 13C data by combining compressed sensing methods for acceleration and multiband excitation pulses to efficiently use the magnetization. This method achieved a 2 sec temporal resolution with full volumetric coverage of a mouse, and metabolites were observed for up to 60 sec following injection of hyperpolarized [1-(13)C]-pyruvate. The compressed sensing acquisition used random phase encode gradient blips to create a novel random undersampling pattern tailored to dynamic MR spectroscopic imaging with sampling incoherency in four (time, frequency, and two spatial) dimensions. The reconstruction was also tailored to dynamic MR spectroscopic imaging by applying a temporal wavelet sparsifying transform to exploit the inherent temporal sparsity. Customized multiband excitation pulses were designed with a lower flip angle for the [1-(13)C]-pyruvate substrate given its higher concentration than its metabolic products ([1-(13)C]-lactate and [1-(13)C]-alanine), thus using less hyperpolarization per excitation. This approach has enabled the monitoring of perfusion and uptake of the pyruvate, and the conversion dynamics to lactate and alanine throughout a volume with high spatial and temporal resolution. PMID:20939089
International Nuclear Information System (INIS)
Purpose: The aim of this study was to perform functional MR imaging of the whole heart in a single breath-hold using an undersampled 3 D trajectory for data acquisition in combination with compressed sensing for image reconstruction. Materials and Methods: Measurements were performed using an SSFP sequence on a 3 T whole-body system equipped with a 32-channel body array coil. A 3 D radial stack-of-stars sampling scheme was utilized enabling efficient undersampling of the k-space and thereby accelerating data acquisition. Compressed sensing was applied for the reconstruction of the missing data. A validation study was performed based on a fully sampled dataset acquired by standard Cartesian cine imaging of 2 D slices on a healthy volunteer. The results were investigated with regard to systematic errors and resolution losses possibly introduced by the developed reconstruction. Subsequently, the proposed technique was applied for in-vivo functional cardiac imaging of the whole heart in a single breath-hold of 27 s. The developed technique was tested on three healthy volunteers to examine its reproducibility. Results: By means of the results of the simulation (temporal resolution: 47 ms, spatial resolution: 1.4 x 1.4 x 8 mm, 3 D image matrix: 208 x 208 x 10), an overall acceleration factor of 10 has been found where the compressed sensing reconstructed image series shows only very low systematic errors and a slight in-plane resolution loss of 15 %. The results of the in-vivo study (temporal resolution: 40.5 ms, spatial resolution: 2.1 x 2.1 x 8 mm, 3 D image matrix: 224 x 224 x 12) performed with an acceleration factor of 10.7 confirm the overall good image quality of the presented technique for undersampled acquisitions. Conclusion: The combination of 3 D radial data acquisition and model-based compressed sensing reconstruction allows high acceleration factors enabling cardiac functional imaging of the whole heart within only one breath-hold. The image quality in the
3D Video Compression and Transmission
DEFF Research Database (Denmark)
Zamarin, Marco; Forchhammer, Søren
In this short paper we provide a brief introduction to 3D and multi-view video technologies - like three-dimensional television and free-viewpoint video - focusing on the aspects related to data compression and transmission. Geometric information represented by depth maps is introduced as well...
Compression of 3D models with NURBS
Santa Cruz Ducci, Diego; Ebrahimi, Touradj
2005-01-01
With recent progress in computing, algorithmics and telecommunications, 3D models are increasingly used in various multimedia applications. Examples include visualization, gaming, entertainment and virtual reality. In the multimedia domain 3D models have been traditionally represented as polygonal meshes. This piecewise planar representation can be thought of as the analogy of bitmap images for 3D surfaces. As bitmap images, they enjoy great flexibility and are particularly well suited to des...
Compressed sensing electron tomography
Energy Technology Data Exchange (ETDEWEB)
Leary, Rowan, E-mail: rkl26@cam.ac.uk [Department of Materials Science and Metallurgy, University of Cambridge, Pembroke Street, Cambridge CB2 3QZ (United Kingdom); Saghi, Zineb; Midgley, Paul A. [Department of Materials Science and Metallurgy, University of Cambridge, Pembroke Street, Cambridge CB2 3QZ (United Kingdom); Holland, Daniel J. [Department of Chemical Engineering and Biotechnology, University of Cambridge, New Museums Site, Pembroke Street, Cambridge CB2 3RA (United Kingdom)
2013-08-15
The recent mathematical concept of compressed sensing (CS) asserts that a small number of well-chosen measurements can suffice to reconstruct signals that are amenable to sparse or compressible representation. In addition to powerful theoretical results, the principles of CS are being exploited increasingly across a range of experiments to yield substantial performance gains relative to conventional approaches. In this work we describe the application of CS to electron tomography (ET) reconstruction and demonstrate the efficacy of CS–ET with several example studies. Artefacts present in conventional ET reconstructions such as streaking, blurring of object boundaries and elongation are markedly reduced, and robust reconstruction is shown to be possible from far fewer projections than are normally used. The CS–ET approach enables more reliable quantitative analysis of the reconstructions as well as novel 3D studies from extremely limited data. - Highlights: • Compressed sensing (CS) theory and its application to electron tomography (ET) is described. • The practical implementation of CS–ET is outlined and its efficacy demonstrated with examples. • High fidelity tomographic reconstruction is possible from a small number of images. • The CS–ET reconstructions can be more reliably segmented and analysed quantitatively. • CS–ET is applicable to different image content by choice of an appropriate sparsifying transform.
3D MHD Simulations of Spheromak Compression
Stuber, James E.; Woodruff, Simon; O'Bryan, John; Romero-Talamas, Carlos A.; Darpa Spheromak Team
2015-11-01
The adiabatic compression of compact tori could lead to a compact and hence low cost fusion energy system. The critical scientific issues in spheromak compression relate both to confinement properties and to the stability of the configuration undergoing compression. We present results from the NIMROD code modified with the addition of magnetic field coils that allow us to examine the role of rotation on the stability and confinement of the spheromak (extending prior work for the FRC). We present results from a scan in initial rotation, from 0 to 100km/s. We show that strong rotational shear (10km/s over 1cm) occurs. We compare the simulation results with analytic scaling relations for adiabatic compression. Work performed under DARPA grant N66001-14-1-4044.
Lee, M. S.; Kim, H. J.; Cho, H. S.; Hong, D. K.; Je, U. K.; Oh, J. E.; Park, Y. O.; Lee, S. H.; Cho, H. M.; Choi, S. I.; Koo, Y. S.
2013-09-01
The most popular reconstruction algorithm for cone-beam computed tomography (CBCT) is based on the computationally-inexpensive filtered-backprojection (FBP) method. However, that method usually requires dense projections over the Nyquist samplings, which imposes severe restrictions on the imaging doses. Moreover, the algorithm tends to produce cone-beam artifacts as the cone angle is increased. Several variants of the FBP-based algorithm have been developed to overcome these difficulties, but problems with the cone-beam reconstruction still remain. In this study, we considered a compressed-sensing (CS)-based reconstruction algorithm for low-dose, high-quality dental CBCT images that exploited the sparsity of images with substantially high accuracy. We implemented the algorithm and performed systematic simulation works to investigate the imaging characteristics. CBCT images of high quality were successfully reconstructed by using the built-in CS-based algorithm, and the image qualities were evaluated quantitatively in terms of the universal-quality index (UQI) and the slice-profile quality index (SPQI).We expect the reconstruction algorithm developed in the work to be applicable to current dental CBCT systems, to reduce imaging doses, and to improve the image quality further.
Compressed sensing & sparse filtering
Carmi, Avishy Y; Godsill, Simon J
2013-01-01
This book is aimed at presenting concepts, methods and algorithms ableto cope with undersampled and limited data. One such trend that recently gained popularity and to some extent revolutionised signal processing is compressed sensing. Compressed sensing builds upon the observation that many signals in nature are nearly sparse (or compressible, as they are normally referred to) in some domain, and consequently they can be reconstructed to within high accuracy from far fewer observations than traditionally held to be necessary.Â Apart from compressed sensing this book contains other related app
Compressed Sensing in Astronomy
Bobin, J; Ottensamer, R
2008-01-01
Recent advances in signal processing have focused on the use of sparse representations in various applications. A new field of interest based on sparsity has recently emerged: compressed sensing. This theory is a new sampling framework that provides an alternative to the well-known Shannon sampling theory. In this paper we investigate how compressed sensing (CS) can provide new insights into astronomical data compression and more generally how it paves the way for new conceptions in astronomical remote sensing. We first give a brief overview of the compressed sensing theory which provides very simple coding process with low computational cost, thus favoring its use for real-time applications often found on board space mission. We introduce a practical and effective recovery algorithm for decoding compressed data. In astronomy, physical prior information is often crucial for devising effective signal processing methods. We particularly point out that a CS-based compression scheme is flexible enough to account ...
Efficient traveltime compression for 3D prestack Kirchhoff migration
Alkhalifah, Tariq
2010-12-13
Kirchhoff 3D prestack migration, as part of its execution, usually requires repeated access to a large traveltime table data base. Access to this data base implies either a memory intensive or I/O bounded solution to the storage problem. Proper compression of the traveltime table allows efficient 3D prestack migration without relying on the usually slow access to the computer hard drive. Such compression also allows for faster access to desirable parts of the traveltime table. Compression is applied to the traveltime field for each source location on the surface on a regular grid using 3D Chebyshev polynomial or cosine transforms of the traveltime field represented in the spherical coordinates or the Celerity domain. We obtain practical compression levels up to and exceeding 20 to 1. In fact, because of the smaller size traveltime table, we obtain exceptional traveltime extraction speed during migration that exceeds conventional methods. Additional features of the compression include better interpolation of traveltime tables and more stable estimates of amplitudes from traveltime curvatures. Further compression is achieved using bit encoding, by representing compression parameters values with fewer bits. © 2010 European Association of Geoscientists & Engineers.
Novel 3D Compression Methods for Geometry, Connectivity and Texture
Siddeq, M. M.; Rodrigues, M. A.
2016-06-01
A large number of applications in medical visualization, games, engineering design, entertainment, heritage, e-commerce and so on require the transmission of 3D models over the Internet or over local networks. 3D data compression is an important requirement for fast data storage, access and transmission within bandwidth limitations. The Wavefront OBJ (object) file format is commonly used to share models due to its clear simple design. Normally each OBJ file contains a large amount of data (e.g. vertices and triangulated faces, normals, texture coordinates and other parameters) describing the mesh surface. In this paper we introduce a new method to compress geometry, connectivity and texture coordinates by a novel Geometry Minimization Algorithm (GM-Algorithm) in connection with arithmetic coding. First, each vertex ( x, y, z) coordinates are encoded to a single value by the GM-Algorithm. Second, triangle faces are encoded by computing the differences between two adjacent vertex locations, which are compressed by arithmetic coding together with texture coordinates. We demonstrate the method on large data sets achieving compression ratios between 87 and 99 % without reduction in the number of reconstructed vertices and triangle faces. The decompression step is based on a Parallel Fast Matching Search Algorithm (Parallel-FMS) to recover the structure of the 3D mesh. A comparative analysis of compression ratios is provided with a number of commonly used 3D file formats such as VRML, OpenCTM and STL highlighting the performance and effectiveness of the proposed method.
Highly compressible 3D periodic graphene aerogel microlattices.
Zhu, Cheng; Han, T Yong-Jin; Duoss, Eric B; Golobic, Alexandra M; Kuntz, Joshua D; Spadaccini, Christopher M; Worsley, Marcus A
2015-04-22
Graphene is a two-dimensional material that offers a unique combination of low density, exceptional mechanical properties, large surface area and excellent electrical conductivity. Recent progress has produced bulk 3D assemblies of graphene, such as graphene aerogels, but they possess purely stochastic porous networks, which limit their performance compared with the potential of an engineered architecture. Here we report the fabrication of periodic graphene aerogel microlattices, possessing an engineered architecture via a 3D printing technique known as direct ink writing. The 3D printed graphene aerogels are lightweight, highly conductive and exhibit supercompressibility (up to 90% compressive strain). Moreover, the Young's moduli of the 3D printed graphene aerogels show an order of magnitude improvement over bulk graphene materials with comparable geometric density and possess large surface areas. Adapting the 3D printing technique to graphene aerogels realizes the possibility of fabricating a myriad of complex aerogel architectures for a broad range of applications.
Highly compressible 3D periodic graphene aerogel microlattices
Zhu, Cheng; Han, T. Yong-Jin; Duoss, Eric B.; Golobic, Alexandra M.; Kuntz, Joshua D.; Spadaccini, Christopher M.; Worsley, Marcus A.
2015-01-01
Graphene is a two-dimensional material that offers a unique combination of low density, exceptional mechanical properties, large surface area and excellent electrical conductivity. Recent progress has produced bulk 3D assemblies of graphene, such as graphene aerogels, but they possess purely stochastic porous networks, which limit their performance compared with the potential of an engineered architecture. Here we report the fabrication of periodic graphene aerogel microlattices, possessing an engineered architecture via a 3D printing technique known as direct ink writing. The 3D printed graphene aerogels are lightweight, highly conductive and exhibit supercompressibility (up to 90% compressive strain). Moreover, the Young's moduli of the 3D printed graphene aerogels show an order of magnitude improvement over bulk graphene materials with comparable geometric density and possess large surface areas. Adapting the 3D printing technique to graphene aerogels realizes the possibility of fabricating a myriad of complex aerogel architectures for a broad range of applications. PMID:25902277
Controllability of the 3D compressible Euler system
Nersisyan, Hayk
2009-01-01
The paper is devoted to the controllability problem for 3D compressible Euler system. The control is a finite-dimensional external force acting only on the velocity equation. We show that the velocity and density of the fluid are simultaneously controllable. In particular, the system is approximately controllable and exactly controllable in projections
3D Mesh Compression and Transmission for Mobile Robotic Applications
Directory of Open Access Journals (Sweden)
Bailin Yang
2016-01-01
Full Text Available Mobile robots are useful for environment exploration and rescue operations. In such applications, it is crucial to accurately analyse and represent an environment, providing appropriate inputs for motion planning in order to support robot navigation and operations. 2D mapping methods are simple but cannot handle multilevel or multistory environments. To address this problem, 3D mapping methods generate structural 3D representations of the robot operating environment and its objects by 3D mesh reconstruction. However, they face the challenge of efficiently transmitting those 3D representations to system modules for 3D mapping, motion planning, and robot operation visualization. This paper proposes a quality-driven mesh compression and transmission method to address this. Our method is efficient, as it compresses a mesh by quantizing its transformed vertices without the need to spend time constructing an a-priori structure over the mesh. A visual distortion function is developed to govern the level of quantization, allowing mesh transmission to be controlled under different network conditions or time constraints. Our experiments demonstrate how the visual quality of a mesh can be manipulated by the visual distortion function.
3D Face Compression and Recognition using Spherical Wavelet Parametrization
Directory of Open Access Journals (Sweden)
Rabab M. Ramadan
2012-09-01
Full Text Available In this research an innovative fully automated 3D face compression and recognition system is presented. Several novelties are introduced to make the system performance robust and efficient. These novelties include: First, an automatic pose correction and normalization process by using curvature analysis for nose tip detection and iterative closest point (ICP image registration. Second, the use of spherical based wavelet coefficients for efficient representation of the 3D face. The spherical wavelet transformation is used to decompose the face image into multi-resolution sub images characterizing the underlying functions in a local fashion in both spacial and frequency domains. Two representation features based on spherical wavelet parameterization of the face image were proposed for the 3D face compression and recognition. Principle component analysis (PCA is used to project to a low resolution sub-band. To evaluate the performance of the proposed approach, experiments were performed on the GAVAB face database. Experimental results show that the spherical wavelet coefficients yield excellent compression capabilities with minimal set of features. Haar wavelet coefficients extracted from the face geometry image was found to generate good recognition results that outperform other methods working on the GAVAB database.
Je, U. K.; Lee, M. S.; Cho, H. S.; Hong, D. K.; Park, Y. O.; Park, C. K.; Cho, H. M.; Choi, S. I.; Woo, T. H.
2015-06-01
In practical applications of three-dimensional (3D) tomographic imaging, there are often challenges for image reconstruction from insufficient sampling data. In computed tomography (CT), for example, image reconstruction from sparse views and/or limited-angle (imaging doses to the patient. In this study, we investigated and implemented a reconstruction algorithm based on the compressed-sensing (CS) theory, which exploits the sparseness of the gradient image with substantially high accuracy, for potential applications to low-dose, high-accurate dental cone-beam CT (CBCT). We performed systematic simulation works to investigate the image characteristics and also performed experimental works by applying the algorithm to a commercially-available dental CBCT system to demonstrate its effectiveness for image reconstruction in insufficient sampling problems. We successfully reconstructed CBCT images of superior accuracy from insufficient sampling data and evaluated the reconstruction quality quantitatively. Both simulation and experimental demonstrations of the CS-based reconstruction from insufficient data indicate that the CS-based algorithm can be applied directly to current dental CBCT systems for reducing the imaging doses and further improving the image quality.
Improving 3D Wavelet-Based Compression of Hyperspectral Images
Klimesh, Matthew; Kiely, Aaron; Xie, Hua; Aranki, Nazeeh
2009-01-01
Two methods of increasing the effectiveness of three-dimensional (3D) wavelet-based compression of hyperspectral images have been developed. (As used here, images signifies both images and digital data representing images.) The methods are oriented toward reducing or eliminating detrimental effects of a phenomenon, referred to as spectral ringing, that is described below. In 3D wavelet-based compression, an image is represented by a multiresolution wavelet decomposition consisting of several subbands obtained by applying wavelet transforms in the two spatial dimensions corresponding to the two spatial coordinate axes of the image plane, and by applying wavelet transforms in the spectral dimension. Spectral ringing is named after the more familiar spatial ringing (spurious spatial oscillations) that can be seen parallel to and near edges in ordinary images reconstructed from compressed data. These ringing phenomena are attributable to effects of quantization. In hyperspectral data, the individual spectral bands play the role of edges, causing spurious oscillations to occur in the spectral dimension. In the absence of such corrective measures as the present two methods, spectral ringing can manifest itself as systematic biases in some reconstructed spectral bands and can reduce the effectiveness of compression of spatially-low-pass subbands. One of the two methods is denoted mean subtraction. The basic idea of this method is to subtract mean values from spatial planes of spatially low-pass subbands prior to encoding, because (a) such spatial planes often have mean values that are far from zero and (b) zero-mean data are better suited for compression by methods that are effective for subbands of two-dimensional (2D) images. In this method, after the 3D wavelet decomposition is performed, mean values are computed for and subtracted from each spatial plane of each spatially-low-pass subband. The resulting data are converted to sign-magnitude form and compressed in a
Energy Technology Data Exchange (ETDEWEB)
Stevens, Andrew J.; Kovarik, Libor; Abellan, Patricia; Yuan, Xin; Carin, Lawrence; Browning, Nigel D.
2015-08-02
One of the main limitations of imaging at high spatial and temporal resolution during in-situ TEM experiments is the frame rate of the camera being used to image the dynamic process. While the recent development of direct detectors has provided the hardware to achieve frame rates approaching 0.1ms, the cameras are expensive and must replace existing detectors. In this paper, we examine the use of coded aperture compressive sensing methods [1, 2, 3, 4] to increase the framerate of any camera with simple, low-cost hardware modifications. The coded aperture approach allows multiple sub-frames to be coded and integrated into a single camera frame during the acquisition process, and then extracted upon readout using statistical compressive sensing inversion. Our simulations show that it should be possible to increase the speed of any camera by at least an order of magnitude. Compressive Sensing (CS) combines sensing and compression in one operation, and thus provides an approach that could further improve the temporal resolution while correspondingly reducing the electron dose rate. Because the signal is measured in a compressive manner, fewer total measurements are required. When applied to TEM video capture, compressive imaging couled improve acquisition speed and reduce the electron dose rate. CS is a recent concept, and has come to the forefront due the seminal work of Candès [5]. Since the publication of Candès, there has been enormous growth in the application of CS and development of CS variants. For electron microscopy applications, the concept of CS has also been recently applied to electron tomography [6], and reduction of electron dose in scanning transmission electron microscopy (STEM) imaging [7]. To demonstrate the applicability of coded aperture CS video reconstruction for atomic level imaging, we simulate compressive sensing on observations of Pd nanoparticles and Ag nanoparticles during exposure to high temperatures and other environmental
Directory of Open Access Journals (Sweden)
S. Abhishek
2016-07-01
Full Text Available It is well understood that in any data acquisition system reduction in the amount of data reduces the time and energy, but the major trade-off here is the quality of outcome normally, lesser the amount of data sensed, lower the quality. Compressed Sensing (CS allows a solution, for sampling below the Nyquist rate. The challenging problem of increasing the reconstruction quality with less number of samples from an unprocessed data set is addressed here by the use of representative coordinate selected from different orders of splines. We have made a detailed comparison with 10 orthogonal and 6 biorthogonal wavelets with two sets of data from MIT Arrhythmia database and our results prove that the Spline coordinates work better than the wavelets. The generation of two new types of splines such as exponential and double exponential are also briefed here .We believe that this is one of the very first attempts made in Compressed Sensing based ECG reconstruction problems using raw data.
Mekuria, R.N.; Cesar Garcia, P.S.; Frisiello, A.; Doumanis, I.
2015-01-01
Compression of 3D object based video is relevant for 3D Immersive applications. Nevertheless, the perceptual aspects of the degradation introduced by codecs for meshes and point clouds are not well understood. In this paper we evaluate the subjective and objective degradations introduced by such cod
Compressive Sensing DNA Microarrays
Directory of Open Access Journals (Sweden)
Richard G. Baraniuk
2009-01-01
Full Text Available Compressive sensing microarrays (CSMs are DNA-based sensors that operate using group testing and compressive sensing (CS principles. In contrast to conventional DNA microarrays, in which each genetic sensor is designed to respond to a single target, in a CSM, each sensor responds to a set of targets. We study the problem of designing CSMs that simultaneously account for both the constraints from CS theory and the biochemistry of probe-target DNA hybridization. An appropriate cross-hybridization model is proposed for CSMs, and several methods are developed for probe design and CS signal recovery based on the new model. Lab experiments suggest that in order to achieve accurate hybridization profiling, consensus probe sequences are required to have sequence homology of at least 80% with all targets to be detected. Furthermore, out-of-equilibrium datasets are usually as accurate as those obtained from equilibrium conditions. Consequently, one can use CSMs in applications in which only short hybridization times are allowed.
MSV3d: database of human MisSense Variants mapped to 3D protein structure.
Luu, Tien-Dao; Rusu, Alin-Mihai; Walter, Vincent; Ripp, Raymond; Moulinier, Luc; Muller, Jean; Toursel, Thierry; Thompson, Julie D; Poch, Olivier; Nguyen, Hoan
2012-01-01
The elucidation of the complex relationships linking genotypic and phenotypic variations to protein structure is a major challenge in the post-genomic era. We present MSV3d (Database of human MisSense Variants mapped to 3D protein structure), a new database that contains detailed annotation of missense variants of all human proteins (20 199 proteins). The multi-level characterization includes details of the physico-chemical changes induced by amino acid modification, as well as information related to the conservation of the mutated residue and its position relative to functional features in the available or predicted 3D model. Major releases of the database are automatically generated and updated regularly in line with the dbSNP (database of Single Nucleotide Polymorphism) and SwissVar releases, by exploiting the extensive Décrypthon computational grid resources. The database (http://decrypthon.igbmc.fr/msv3d) is easily accessible through a simple web interface coupled to a powerful query engine and a standard web service. The content is completely or partially downloadable in XML or flat file formats. Database URL: http://decrypthon.igbmc.fr/msv3d.
Advanced 3D Sensing and Visualization System for Unattended Monitoring
Energy Technology Data Exchange (ETDEWEB)
Carlson, J.J.; Little, C.Q.; Nelson, C.L.
1999-01-01
The purpose of this project was to create a reliable, 3D sensing and visualization system for unattended monitoring. The system provides benefits for several of Sandia's initiatives including nonproliferation, treaty verification, national security and critical infrastructure surety. The robust qualities of the system make it suitable for both interior and exterior monitoring applications. The 3D sensing system combines two existing sensor technologies in a new way to continuously maintain accurate 3D models of both static and dynamic components of monitored areas (e.g., portions of buildings, roads, and secured perimeters in addition to real-time estimates of the shape, location, and motion of humans and moving objects). A key strength of this system is the ability to monitor simultaneous activities on a continuous basis, such as several humans working independently within a controlled workspace, while also detecting unauthorized entry into the workspace. Data from the sensing system is used to identi~ activities or conditions that can signi~ potential surety (safety, security, and reliability) threats. The system could alert a security operator of potential threats or could be used to cue other detection, inspection or warning systems. An interactive, Web-based, 3D visualization capability was also developed using the Virtual Reality Modeling Language (VRML). The intex%ace allows remote, interactive inspection of a monitored area (via the Internet or Satellite Links) using a 3D computer model of the area that is rendered from actual sensor data.
Compressive sensing in medical imaging.
Graff, Christian G; Sidky, Emil Y
2015-03-10
The promise of compressive sensing, exploitation of compressibility to achieve high quality image reconstructions with less data, has attracted a great deal of attention in the medical imaging community. At the Compressed Sensing Incubator meeting held in April 2014 at OSA Headquarters in Washington, DC, presentations were given summarizing some of the research efforts ongoing in compressive sensing for x-ray computed tomography and magnetic resonance imaging systems. This article provides an expanded version of these presentations. Sparsity-exploiting reconstruction algorithms that have gained popularity in the medical imaging community are studied, and examples of clinical applications that could benefit from compressive sensing ideas are provided. The current and potential future impact of compressive sensing on the medical imaging field is discussed.
3-D Adaptive Sparsity Based Image Compression With Applications to Optical Coherence Tomography.
Fang, Leyuan; Li, Shutao; Kang, Xudong; Izatt, Joseph A; Farsiu, Sina
2015-06-01
We present a novel general-purpose compression method for tomographic images, termed 3D adaptive sparse representation based compression (3D-ASRC). In this paper, we focus on applications of 3D-ASRC for the compression of ophthalmic 3D optical coherence tomography (OCT) images. The 3D-ASRC algorithm exploits correlations among adjacent OCT images to improve compression performance, yet is sensitive to preserving their differences. Due to the inherent denoising mechanism of the sparsity based 3D-ASRC, the quality of the compressed images are often better than the raw images they are based on. Experiments on clinical-grade retinal OCT images demonstrate the superiority of the proposed 3D-ASRC over other well-known compression methods. PMID:25561591
Compressive sensing for urban radar
Amin, Moeness
2014-01-01
With the emergence of compressive sensing and sparse signal reconstruction, approaches to urban radar have shifted toward relaxed constraints on signal sampling schemes in time and space, and to effectively address logistic difficulties in data acquisition. Traditionally, these challenges have hindered high resolution imaging by restricting both bandwidth and aperture, and by imposing uniformity and bounds on sampling rates.Compressive Sensing for Urban Radar is the first book to focus on a hybrid of two key areas: compressive sensing and urban sensing. It explains how reliable imaging, tracki
Adaptive compressive sensing camera
Hsu, Charles; Hsu, Ming K.; Cha, Jae; Iwamura, Tomo; Landa, Joseph; Nguyen, Charles; Szu, Harold
2013-05-01
We have embedded Adaptive Compressive Sensing (ACS) algorithm on Charge-Coupled-Device (CCD) camera based on the simplest concept that each pixel is a charge bucket, and the charges comes from Einstein photoelectric conversion effect. Applying the manufactory design principle, we only allow altering each working component at a minimum one step. We then simulated what would be such a camera can do for real world persistent surveillance taking into account of diurnal, all weather, and seasonal variations. The data storage has saved immensely, and the order of magnitude of saving is inversely proportional to target angular speed. We did design two new components of CCD camera. Due to the matured CMOS (Complementary metal-oxide-semiconductor) technology, the on-chip Sample and Hold (SAH) circuitry can be designed for a dual Photon Detector (PD) analog circuitry for changedetection that predicts skipping or going forward at a sufficient sampling frame rate. For an admitted frame, there is a purely random sparse matrix [Φ] which is implemented at each bucket pixel level the charge transport bias voltage toward its neighborhood buckets or not, and if not, it goes to the ground drainage. Since the snapshot image is not a video, we could not apply the usual MPEG video compression and Hoffman entropy codec as well as powerful WaveNet Wrapper on sensor level. We shall compare (i) Pre-Processing FFT and a threshold of significant Fourier mode components and inverse FFT to check PSNR; (ii) Post-Processing image recovery will be selectively done by CDT&D adaptive version of linear programming at L1 minimization and L2 similarity. For (ii) we need to determine in new frames selection by SAH circuitry (i) the degree of information (d.o.i) K(t) dictates the purely random linear sparse combination of measurement data a la [Φ]M,N M(t) = K(t) Log N(t).
Forest mapping and monitoring using active 3D remote sensing
VASTARANTA Mikko
2012-01-01
The main aim in forest mapping and monitoring is to produce accurate information for forest managers with the use of efficient methodologies. For example, it is important to locate harvesting sites and stands where forest operations should be carried out as well as to provide updates regarding forest growth, among other changes in forest structure. In recent years, remote sensing (RS) has taken a significant technological leap forward. It has become possible to acquire three-dimensional (3D),...
Mekuria, Rufael; Cesar, Pablo; Doumanis, Ioannis; Frisiello, Antonella
2015-09-01
Compression of 3D object based video is relevant for 3D Immersive applications. Nevertheless, the perceptual aspects of the degradation introduced by codecs for meshes and point clouds are not well understood. In this paper we evaluate the subjective and objective degradations introduced by such codecs in a state of art 3D immersive virtual room. In the 3D immersive virtual room, users are captured with multiple cameras, and their surfaces are reconstructed as photorealistic colored/textured 3D meshes or point clouds. To test the perceptual effect of compression and transmission, we render degraded versions with different frame rates in different contexts (near/far) in the scene. A quantitative subjective study with 16 users shows that negligible distortion of decoded surfaces compared to the original reconstructions can be achieved in the 3D virtual room. In addition, a qualitative task based analysis in a full prototype field trial shows increased presence, emotion, user and state recognition of the reconstructed 3D Human representation compared to animated computer avatars.
3D temperature field reconstruction using ultrasound sensing system
Liu, Yuqian; Ma, Tong; Cao, Chengyu; Wang, Xingwei
2016-04-01
3D temperature field reconstruction is of practical interest to the power, transportation and aviation industries and it also opens up opportunities for real time control or optimization of high temperature fluid or combustion process. In our paper, a new distributed optical fiber sensing system consisting of a series of elements will be used to generate and receive acoustic signals. This system is the first active temperature field sensing system that features the advantages of the optical fiber sensors (distributed sensing capability) and the acoustic sensors (non-contact measurement). Signals along multiple paths will be measured simultaneously enabled by a code division multiple access (CDMA) technique. Then a proposed Gaussian Radial Basis Functions (GRBF)-based approach can approximate the temperature field as a finite summation of space-dependent basis functions and time-dependent coefficients. The travel time of the acoustic signals depends on the temperature of the media. On this basis, the Gaussian functions are integrated along a number of paths which are determined by the number and distribution of sensors. The inversion problem to estimate the unknown parameters of the Gaussian functions can be solved with the measured times-of-flight (ToF) of acoustic waves and the length of propagation paths using the recursive least square method (RLS). The simulation results show an approximation error less than 2% in 2D and 5% in 3D respectively. It demonstrates the availability and efficiency of our proposed 3D temperature field reconstruction mechanism.
Designing experiments through compressed sensing.
Energy Technology Data Exchange (ETDEWEB)
Young, Joseph G.; Ridzal, Denis
2013-06-01
In the following paper, we discuss how to design an ensemble of experiments through the use of compressed sensing. Specifically, we show how to conduct a small number of physical experiments and then use compressed sensing to reconstruct a larger set of data. In order to accomplish this, we organize our results into four sections. We begin by extending the theory of compressed sensing to a finite product of Hilbert spaces. Then, we show how these results apply to experiment design. Next, we develop an efficient reconstruction algorithm that allows us to reconstruct experimental data projected onto a finite element basis. Finally, we verify our approach with two computational experiments.
Compressive Sensing for Quantum Imaging
Howland, Gregory A.
This thesis describes the application of compressive sensing to several challenging problems in quantum imaging with practical and fundamental implications. Compressive sensing is a measurement technique that compresses a signal during measurement such that it can be dramatically undersampled. Compressive sensing has been shown to be an extremely efficient measurement technique for imaging, particularly when detector arrays are not available. The thesis first reviews compressive sensing through the lens of quantum imaging and quantum measurement. Four important applications and their corresponding experiments are then described in detail. The first application is a compressive sensing, photon-counting lidar system. A novel depth mapping technique that uses standard, linear compressive sensing is described. Depth maps up to 256 x 256 pixel transverse resolution are recovered with depth resolution less than 2.54 cm. The first three-dimensional, photon counting video is recorded at 32 x 32 pixel resolution and 14 frames-per-second. The second application is the use of compressive sensing for complementary imaging---simultaneously imaging the transverse-position and transverse-momentum distributions of optical photons. This is accomplished by taking random, partial projections of position followed by imaging the momentum distribution on a cooled CCD camera. The projections are shown to not significantly perturb the photons' momenta while allowing high resolution position images to be reconstructed using compressive sensing. A variety of objects and their diffraction patterns are imaged including the double slit, triple slit, alphanumeric characters, and the University of Rochester logo. The third application is the use of compressive sensing to characterize spatial entanglement of photon pairs produced by spontaneous parametric downconversion. The technique gives a theoretical speedup N2/log N for N-dimensional entanglement over the standard raster scanning technique
Compressive sensing of sparse tensors.
Friedland, Shmuel; Li, Qun; Schonfeld, Dan
2014-10-01
Compressive sensing (CS) has triggered an enormous research activity since its first appearance. CS exploits the signal's sparsity or compressibility in a particular domain and integrates data compression and acquisition, thus allowing exact reconstruction through relatively few nonadaptive linear measurements. While conventional CS theory relies on data representation in the form of vectors, many data types in various applications, such as color imaging, video sequences, and multisensor networks, are intrinsically represented by higher order tensors. Application of CS to higher order data representation is typically performed by conversion of the data to very long vectors that must be measured using very large sampling matrices, thus imposing a huge computational and memory burden. In this paper, we propose generalized tensor compressive sensing (GTCS)-a unified framework for CS of higher order tensors, which preserves the intrinsic structure of tensor data with reduced computational complexity at reconstruction. GTCS offers an efficient means for representation of multidimensional data by providing simultaneous acquisition and compression from all tensor modes. In addition, we propound two reconstruction procedures, a serial method and a parallelizable method. We then compare the performance of the proposed method with Kronecker compressive sensing (KCS) and multiway compressive sensing (MWCS). We demonstrate experimentally that GTCS outperforms KCS and MWCS in terms of both reconstruction accuracy (within a range of compression ratios) and processing speed. The major disadvantage of our methods (and of MWCS as well) is that the compression ratios may be worse than that offered by KCS.
Compressed sensing for distributed systems
Coluccia, Giulio; Magli, Enrico
2015-01-01
This book presents a survey of the state-of-the art in the exciting and timely topic of compressed sensing for distributed systems. It has to be noted that, while compressed sensing has been studied for some time now, its distributed applications are relatively new. Remarkably, such applications are ideally suited to exploit all the benefits that compressed sensing can provide. The objective of this book is to provide the reader with a comprehensive survey of this topic, from the basic concepts to different classes of centralized and distributed reconstruction algorithms, as well as a comparison of these techniques. This book collects different contributions on these aspects. It presents the underlying theory in a complete and unified way for the first time, presenting various signal models and their use cases. It contains a theoretical part collecting latest results in rate-distortion analysis of distributed compressed sensing, as well as practical implementations of algorithms obtaining performance close to...
Single-shot 3D sensing with improved data density
Willomitzer, Florian; Faber, Christian; Häusler, Gerd
2014-01-01
We introduce a novel concept for motion robust optical 3D-sensing. The concept is based on multi-line triangulation. The aim is to evaluate a large number of projected lines (high data density) in a large measurement volume with high precision. Implementing all those three attributes at the same time allows for the "perfect" real-time 3D movie camera (our long term goal). The key problem towards this goal is ambiguous line indexing: we will demonstrate that the necessary information for unique line indexing can be acquired by two synchronized cameras and a back projection scheme. The introduced concept preserves high lateral resolution, since the lines are as narrow as the sampling theorem allows, no spatial bandwidth is consumed by encoding of the lines. In principle, the distance uncertainty is only limited by shot noise and coherent noise. The concept can be also advantageously implemented with a hand-guided sensor and real-time registration, for a complete and dense 3D-acquisition of complicated scenes.
Efficient reconfigurable architectures for 3D medical image compression
Afandi, Ahmad
2010-01-01
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University. Recently, the more widespread use of three-dimensional (3-D) imaging modalities, such as magnetic resonance imaging (MRI), computed tomography (CT), positron emission tomography (PET), and ultrasound (US) have generated a massive amount of volumetric data. These have provided an impetus to the development of other applications, in particular telemedicine and teleradiology. In thes...
压缩感知在城区高分辨率SAR层析成像中的应用%Compressive Sensing in High-resolution 3D SAR Tomography of Urban Scenarios
Institute of Scientific and Technical Information of China (English)
廖明生; 魏恋欢; 汪紫芸; Timo Balz; 张路
2015-01-01
在建筑密集的城区复杂场景中，高分辨率SAR影像中存在严重的叠掩效应，影像解译的难度加大。SAR层析成像可以分离单个分辨单元内混叠的散射体目标，并且获取各个散射体的3维位置和后向散射强度。该文首先论述了3维SAR层析成像的基本原理，针对传统谱估计法获得的高程向分辨率较低的问题，综述了压缩感知方法在城区3维SAR层析成像中的应用，以基追踪和双步迭代收缩阈值法为例，开展了TerraSAR-X聚束模式数据实验，并与传统的奇异值阈值法进行了对比分析。研究结果表明压缩感知方法的高程向超分辨率、旁瓣抑制优势明显，在城区SAR层析成像中具有广阔的应用前景。%In modern high resolution SAR data, due to the intrinsic side-looking geometry of SAR sensors, layover and foreshortening issues inevitably arise, especially in dense urban areas. SAR tomography provides a new way of overcoming these problems by exploiting the back-scattering property for each pixel. However, traditional non-parametric spectral estimators, e.g. Truncated Singular Value Decomposition (TSVD), are limited by their poor elevation resolution, which is not comparable to the azimuth and slant-range resolution. In this paper, the Compressive Sensing (CS) approach using Basis Pursuit (BP) and TWo-step Iterative Shrinkage/Thresholding (TWIST) are introduced. Experimental studies with real spotlight-mode TerraSAR-X dataset are carried out using both BP and TWIST, to demonstrate the merits of compressive sensing approaches in terms of robustness, computational efficiency, and super-resolution capability.
3D Compressible Melt Transport with Mesh Adaptivity
Dannberg, J.; Heister, T.
2015-12-01
Melt generation and migration have been the subject of numerous investigations. However, their typical time and length scales are vastly different from mantle convection, and the material properties are highly spatially variable and make the problem strongly non-linear. These challenges make it difficult to study these processes in a unified framework and in three dimensions. We present our extension of the mantle convection code ASPECT that allows for solving additional equations describing the behavior of melt percolating through and interacting with a viscously deforming host rock. One particular advantage is ASPECT's adaptive mesh refinement, as the resolution can be increased in areas where melt is present and viscosity gradients are steep, whereas a lower resolution is sufficient in regions without melt. Our approach includes both melt migration and melt generation, allowing for different melting parametrizations. In contrast to previous formulations, we consider the individual compressibilities of the solid and fluid phases in addition to compaction flow. This ensures self-consistency when linking melt generation to processes in the deeper mantle, where the compressibility of the solid phase becomes more important. We evaluate the functionality and potential of this method using a series of benchmarks and applications, including solitary waves, magmatic shear bands and melt generation and transport in a rising mantle plume. We compare results of the compressible and incompressible formulation and find melt volume differences of up to 15%. Moreover, we demonstrate that adaptive mesh refinement has the potential to reduce the runtime of a computation by more than one order of magnitude. Our model of magma dynamics provides a framework for investigating links between the deep mantle and melt generation and migration. This approach could prove particularly useful applied to modeling the generation of komatiites or other melts originating in greater depths.
3D Compressible Melt Transport with Adaptive Mesh Refinement
Dannberg, Juliane; Heister, Timo
2015-04-01
Melt generation and migration have been the subject of numerous investigations, but their typical time and length-scales are vastly different from mantle convection, which makes it difficult to study these processes in a unified framework. The equations that describe coupled Stokes-Darcy flow have been derived a long time ago and they have been successfully implemented and applied in numerical models (Keller et al., 2013). However, modelling magma dynamics poses the challenge of highly non-linear and spatially variable material properties, in particular the viscosity. Applying adaptive mesh refinement to this type of problems is particularly advantageous, as the resolution can be increased in mesh cells where melt is present and viscosity gradients are high, whereas a lower resolution is sufficient in regions without melt. In addition, previous models neglect the compressibility of both the solid and the fluid phase. However, experiments have shown that the melt density change from the depth of melt generation to the surface leads to a volume increase of up to 20%. Considering these volume changes in both phases also ensures self-consistency of models that strive to link melt generation to processes in the deeper mantle, where the compressibility of the solid phase becomes more important. We describe our extension of the finite-element mantle convection code ASPECT (Kronbichler et al., 2012) that allows for solving additional equations describing the behaviour of silicate melt percolating through and interacting with a viscously deforming host rock. We use the original compressible formulation of the McKenzie equations, augmented by an equation for the conservation of energy. This approach includes both melt migration and melt generation with the accompanying latent heat effects. We evaluate the functionality and potential of this method using a series of simple model setups and benchmarks, comparing results of the compressible and incompressible formulation and
Compressive Sensing in Communication Systems
DEFF Research Database (Denmark)
Fyhn, Karsten
2013-01-01
Wireless communication is omnipresent today, but this development has led to frequency spectrum becoming a limited resource. Furthermore, wireless devices become more and more energy-limited, due to the demand for continual wireless communication of higher and higher amounts of information....... The need for cheaper, smarter and more energy efficient wireless devices is greater now than ever. This thesis addresses this problem and concerns the application of the recently developed sampling theory of compressive sensing in communication systems. Compressive sensing is the merging of signal...... acquisition and compression. It allows for sampling a signal with a rate below the bound dictated by the celebrated Shannon-Nyquist sampling theorem. In some communication systems this necessary minimum sample rate, dictated by the Shannon-Nyquist sampling theorem, is so high it is at the limit of what...
Low Complexity Connectivity Driven Dynamic Geometry Compression for 3D Tele-Immersion
Mekuria, R.N.; Bulterman, D.C.A.; Cesar Garcia, P.S.
2014-01-01
Geometry based 3D Tele-Immersion is a novel emerging media application that involves on the fly reconstructed 3D mesh geometry. To enable real-time communication of such live reconstructed mesh geometry over a bandwidth limited link, fast dynamic geometry compression is needed. However, most tools a
International Nuclear Information System (INIS)
Neurovascular compressive sites at the root entry zone of the trigeminal nerve were investigated in 25 patients with trigeminal neuralgia by using the fine three-dimensional (3D) magnetic resonance (MR) angiogram, obtained by a 3D time-of-flight, spoiled gradient-recalled sequence. The characteristic 3D MR angiographic findings of the offending vessels were obtained at the neurovascular compressive sites 19/23 (83%), including intermittent MR signal intensity within the vessels in 14/23 (61%), and unclear margin of the vessels in 5/23 (22%). Those abnormal 3D MR angiographic findings were commonly observed at the site of neurovascular compression in conjunction with moderate degree (grade II) and severe degree (grade III) in 19/20 (95%) of the actual nerve compression by the offending vessels. Abnormal findings with 3D MR angiograms may provide flow-related information to suggest a certain neurovascular compression upon the trigeminal nerve by the offending vessels. Those novel 3D MR angiographic findings may be useful for the diagnosis and decision-making process to execute the microvascular decompression surgery in patients with trigeminal neuralgia. (author)
Compression of 3D meshes based on a decomposition into singular vectors
Directory of Open Access Journals (Sweden)
El Mostafa RAJAALLAH
2016-06-01
Full Text Available Compression of 3D meshes is an important operation for many applications involving transfer and storage of 3D objects data in their process, such as research by content and navigation in 3D objects databases. Compression is to reduce the space needed to store and/or display the 3D mesh. To do that, we usually try to project it in a frequency space where information is less correlated. The approach suggested in this work is based on a decomposition into singular vectors of the laplacian transform of the adjacency matrix of the vertices of the 3D mesh. The obtained results show the invariance of this approach to a normalization and very encouraging performance semantically.
On Finite Alphabet Compressive Sensing
Das, Abhik Kumar; Vishwanath, Sriram
2013-01-01
This paper considers the problem of compressive sensing over a finite alphabet, where the finite alphabet may be inherent to the nature of the data or a result of quantization. There are multiple examples of finite alphabet based static as well as time-series data with inherent sparse structure; and quantizing real values is an essential step while handling real data in practice. We show that there are significant benefits to analyzing the problem while incorporating its finite alphabet natur...
3D Vegetation Structure Extraction from Lidar Remote Sensing
Ni-Meister, W.
2006-05-01
Vegetation structure data are critical not only for biomass estimation and global carbon cycle studies, but also for ecosystem disturbance, species habitat and ecosystem biodiversity studies. However those data are rarely available at the global scale. Multispectral passive remote sensing has shown little success on this direction. The upcoming lidar remote sensing technology shows a great potential to measure vegetation vertical structure data globally. In this study, we present and test a Bayesian Stochastic Inversion (BSI) approach to invert a full canopy Geometric Optical and Radiative Transfer (GORT) model to retrieve 3-D vegetation structure parameters from large footprint (15m-25m diameter) vegetation lidar data. BSI approach allows us to take into account lidar-directly derived structure parameters, such as tree height and the upper and lower bounds of crown height and their uncertainties as the prior knowledge in the inversion. It provides not only the optimal estimates of model parameters, but also their uncertainties. We first assess the accuracy of vegetation structure parameter retrievals from vegetation lidar data through a comprehensive GORT input parameter sensitivity analysis. We calculated the singular value decomposition (SVD) of Jacobian matrix, which contains the partial derivatives of the combined model with respect to all relevant model input parameters and. Our analysis shows that with the prior knowledge of tree height, crown depth and crown shape, lidar waveforms is most sensitive to the tree density, then to the tree size and the least to the foliage area volume density. It indicates that tree density can be retrieved with the most accuracy and then the tree size, the least is the foliage area volume density. We also test the simplified BSI approach through a synthetic experiment. The synthetic lidar waveforms were generated based the vegetation structure data obtained from the Boreal Ecosystem Atmosphere Study (BOREAS). With the exact
Immersive 3D Visualization of Remote Sensing Data
Directory of Open Access Journals (Sweden)
Surbhi Rautji
2013-10-01
Full Text Available Immersive 3D Visualization is a java based Engine f or viewing the Data of aerial images in the Three Dimensional with provision for simulation and fly t hrough. This application is based on java Technolog y and works as standalone application, applet or in t he browser. Immersive 3D Visualization is a good application to use where the area of interest is to view the interested regions rather than the big im ages. The Immersive 3D Visualization is a application tha t is designed on Java 3D Technology and Open Graphics Libraries. The Java3D Technology of envisa ges the three Dimensional view of the picture and Open Graphics Libraries allows one to view the rend ered data on to the screen. This visualization application is java based hence no portability issu es. The Data for this work is collected from the va rious sites like Google earth, USGS web site for the data viewing . This work takes an advantage of modelling the 3D DEM data on the visualized portion of the screen , and thus this approach is optimized. We are assumed that the DEM is coming from the other sourc e or it is simulated Data in order to view the thre e- dimensional pictures. The Process of Collecting the Data and projecting on to the screen is done by collectively Open Graphics Libraries and Java 3D Te chnology. In this work any image can be viewed as 3D with the use of DEM data, which can be created w ith use of certain selected values, where as in the case of Google Earth it is not possible to see your own image in 3D. The work done here can be used fo r selected region of interest, unlike Google Earth, w hich is used for continuous streaming of data. Our work on 3D immersive visualisation can be useful to GIS analyst to view their own images in 3D
Investigation of out of plane compressive strength of 3D printed sandwich composites
Dikshit, V.; Yap, Y. L.; Goh, G. D.; Yang, H.; Lim, J. C.; Qi, X.; Yeong, W. Y.; Wei, J.
2016-07-01
In this study, the 3D printing technique was utilized to manufacture the sandwich composites. Composite filament fabrication based 3D printer was used to print the face-sheet, and inkjet 3D printer was used to print the sandwich core structure. This work aims to study the compressive failure of the sandwich structure manufactured by using these two manufacturing techniques. Two different types of core structures were investigated with the same type of face-sheet configuration. The core structures were printed using photopolymer, while the face-sheet was made using nylon/glass. The out-of-plane compressive strength of the 3D printed sandwich composite structure has been examined in accordance with ASTM standards C365/C365-M and presented in this paper.
Deterministic sensing matrices in compressive sensing: a survey.
Nguyen, Thu L N; Shin, Yoan
2013-01-01
Compressive sensing is a sampling method which provides a new approach to efficient signal compression and recovery by exploiting the fact that a sparse signal can be suitably reconstructed from very few measurements. One of the most concerns in compressive sensing is the construction of the sensing matrices. While random sensing matrices have been widely studied, only a few deterministic sensing matrices have been considered. These matrices are highly desirable on structure which allows fast implementation with reduced storage requirements. In this paper, a survey of deterministic sensing matrices for compressive sensing is presented. We introduce a basic problem in compressive sensing and some disadvantage of the random sensing matrices. Some recent results on construction of the deterministic sensing matrices are discussed.
Athena3D: Flux-conservative Godunov-type algorithm for compressible magnetohydrodynamics
Hawley, John; Simon, Jake; Stone, James; Gardiner, Thomas; Teuben, Peter
2015-05-01
Written in FORTRAN, Athena3D, based on Athena (ascl:1010.014), is an implementation of a flux-conservative Godunov-type algorithm for compressible magnetohydrodynamics. Features of the Athena3D code include compressible hydrodynamics and ideal MHD in one, two or three spatial dimensions in Cartesian coordinates; adiabatic and isothermal equations of state; 1st, 2nd or 3rd order reconstruction using the characteristic variables; and numerical fluxes computed using the Roe scheme. In addition, it offers the ability to add source terms to the equations and is parallelized based on MPI.
Quality assessment of stereoscopic 3D image compression by binocular integration behaviors.
Lin, Yu-Hsun; Wu, Ja-Ling
2014-04-01
The objective approaches of 3D image quality assessment play a key role for the development of compression standards and various 3D multimedia applications. The quality assessment of 3D images faces more new challenges, such as asymmetric stereo compression, depth perception, and virtual view synthesis, than its 2D counterparts. In addition, the widely used 2D image quality metrics (e.g., PSNR and SSIM) cannot be directly applied to deal with these newly introduced challenges. This statement can be verified by the low correlation between the computed objective measures and the subjectively measured mean opinion scores (MOSs), when 3D images are the tested targets. In order to meet these newly introduced challenges, in this paper, besides traditional 2D image metrics, the binocular integration behaviors-the binocular combination and the binocular frequency integration, are utilized as the bases for measuring the quality of stereoscopic 3D images. The effectiveness of the proposed metrics is verified by conducting subjective evaluations on publicly available stereoscopic image databases. Experimental results show that significant consistency could be reached between the measured MOS and the proposed metrics, in which the correlation coefficient between them can go up to 0.88. Furthermore, we found that the proposed metrics can also address the quality assessment of the synthesized color-plus-depth 3D images well. Therefore, it is our belief that the binocular integration behaviors are important factors in the development of objective quality assessment for 3D images.
3D hydrodynamic focusing microfluidics for emerging sensing technologies.
Daniele, Michael A; Boyd, Darryl A; Mott, David R; Ligler, Frances S
2015-05-15
While the physics behind laminar flows has been studied for 200 years, understanding of how to use parallel flows to augment the capabilities of microfluidic systems has been a subject of study primarily over the last decade. The use of one flow to focus another within a microfluidic channel has graduated from a two-dimensional to a three-dimensional process and the design principles are only now becoming established. This review explores the underlying principles for hydrodynamic focusing in three dimensions (3D) using miscible fluids and the application of these principles for creation of biosensors, separation of cells and particles for sample manipulation, and fabrication of materials that could be used for biosensors. Where sufficient information is available, the practicality of devices implementing fluid flows directed in 3D is evaluated and the advantages and limitations of 3D hydrodynamic focusing for the particular application are highlighted.
Fast spectrophotometry with compressive sensing
Starling, David; Storer, Ian
2015-03-01
Spectrophotometers and spectrometers have numerous applications in the physical sciences and engineering, resulting in a plethora of designs and requirements. A good spectrophotometer balances the need for high photometric precision, high spectral resolution, high durability and low cost. One way to address these design objectives is to take advantage of modern scanning and detection techniques. A common imaging method that has improved signal acquisition speed and sensitivity in limited signal scenarios is the single pixel camera. Such cameras utilize the sparsity of a signal to sample below the Nyquist rate via a process known as compressive sensing. Here, we show that a single pixel camera using compressive sensing algorithms and a digital micromirror device can replace the common scanning mechanisms found in virtually all spectrophotometers, providing a very low cost solution and improving data acquisition time. We evaluate this single pixel spectrophotometer by studying a variety of samples tested against commercial products. We conclude with an analysis of flame spectra and possible improvements for future designs.
Contributions in compression of 3D medical images and 2D images
International Nuclear Information System (INIS)
The huge amounts of volumetric data generated by current medical imaging techniques in the context of an increasing demand for long term archiving solutions, as well as the rapid development of distant radiology make the use of compression inevitable. Indeed, if the medical community has sided until now with compression without losses, most of applications suffer from compression ratios which are too low with this kind of compression. In this context, compression with acceptable losses could be the most appropriate answer. So, we propose a new loss coding scheme based on 3D (3 dimensional) Wavelet Transform and Dead Zone Lattice Vector Quantization 3D (DZLVQ) for medical images. Our algorithm has been evaluated on several computerized tomography (CT) and magnetic resonance image volumes. The main contribution of this work is the design of a multidimensional dead zone which enables to take into account correlations between neighbouring elementary volumes. At high compression ratios, we show that it can out-perform visually and numerically the best existing methods. These promising results are confirmed on head CT by two medical patricians. The second contribution of this document assesses the effect with-loss image compression on CAD (Computer-Aided Decision) detection performance of solid lung nodules. This work on 120 significant lungs images shows that detection did not suffer until 48:1 compression and still was robust at 96:1. The last contribution consists in the complexity reduction of our compression scheme. The first allocation dedicated to 2D DZLVQ uses an exponential of the rate-distortion (R-D) functions. The second allocation for 2D and 3D medical images is based on block statistical model to estimate the R-D curves. These R-D models are based on the joint distribution of wavelet vectors using a multidimensional mixture of generalized Gaussian (MMGG) densities. (author)
A New Method for EEG Compressive Sensing
FIRA, M.; GORAS, L.
2012-01-01
The paper investigates the possibility of using compressive sensing techniques for the acquisition and reconstruction of EEG signals containing the evoked potential P300. A method of EEG compressive sensing based on the physiological correlation of EEG channels is proposed. The reconstruction of 55 EEG channels signals acquired by compressive sensing uses a dictionary consisting of EEG signals from other nine channels with normal acquisition.
Failure wave motion of 3D-C/SiC composites subjected to shock compression
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
The response and failure behavior of 3D-C/SiC composites subjected to shock compression have been experimentally studied.With the help of a one-stage light gas gun,the 3D-C/SiC composite samples,which are subjected to the plane shock compression by LY-12 aluminum flyer sheets with different speeds become available.Based on the analysis of observation for the curve of pressure vs time,which has been measured from the tests as well as from the samples,it is found that when the shock speed is larger than a critical value,the material of 3D-C/SiC will be comminuted and the failure surface will move from the shock plane to its inward direction in the waveform.
Accurate compressed look up table method for CGH in 3D holographic display.
Gao, Chuan; Liu, Juan; Li, Xin; Xue, Gaolei; Jia, Jia; Wang, Yongtian
2015-12-28
Computer generated hologram (CGH) should be obtained with high accuracy and high speed in 3D holographic display, and most researches focus on the high speed. In this paper, a simple and effective computation method for CGH is proposed based on Fresnel diffraction theory and look up table. Numerical simulations and optical experiments are performed to demonstrate its feasibility. The proposed method can obtain more accurate reconstructed images with lower memory usage compared with split look up table method and compressed look up table method without sacrificing the computational speed in holograms generation, so it is called accurate compressed look up table method (AC-LUT). It is believed that AC-LUT method is an effective method to calculate the CGH of 3D objects for real-time 3D holographic display where the huge information data is required, and it could provide fast and accurate digital transmission in various dynamic optical fields in the future. PMID:26831987
Directory of Open Access Journals (Sweden)
Xiangwei Li
2014-12-01
Full Text Available Compressive Sensing Imaging (CSI is a new framework for image acquisition, which enables the simultaneous acquisition and compression of a scene. Since the characteristics of Compressive Sensing (CS acquisition are very different from traditional image acquisition, the general image compression solution may not work well. In this paper, we propose an efficient lossy compression solution for CS acquisition of images by considering the distinctive features of the CSI. First, we design an adaptive compressive sensing acquisition method for images according to the sampling rate, which could achieve better CS reconstruction quality for the acquired image. Second, we develop a universal quantization for the obtained CS measurements from CS acquisition without knowing any a priori information about the captured image. Finally, we apply these two methods in the CSI system for efficient lossy compression of CS acquisition. Simulation results demonstrate that the proposed solution improves the rate-distortion performance by 0.4~2 dB comparing with current state-of-the-art, while maintaining a low computational complexity.
Li, Xiangwei; Lan, Xuguang; Yang, Meng; Xue, Jianru; Zheng, Nanning
2014-12-05
Compressive Sensing Imaging (CSI) is a new framework for image acquisition, which enables the simultaneous acquisition and compression of a scene. Since the characteristics of Compressive Sensing (CS) acquisition are very different from traditional image acquisition, the general image compression solution may not work well. In this paper, we propose an efficient lossy compression solution for CS acquisition of images by considering the distinctive features of the CSI. First, we design an adaptive compressive sensing acquisition method for images according to the sampling rate, which could achieve better CS reconstruction quality for the acquired image. Second, we develop a universal quantization for the obtained CS measurements from CS acquisition without knowing any a priori information about the captured image. Finally, we apply these two methods in the CSI system for efficient lossy compression of CS acquisition. Simulation results demonstrate that the proposed solution improves the rate-distortion performance by 0.4~2 dB comparing with current state-of-the-art, while maintaining a low computational complexity.
Restricted isometry properties and nonconvex compressive sensing
Chartrand, Rick; Staneva, Valentina
2008-06-01
The recently emerged field known as compressive sensing has produced powerful results showing the ability to recover sparse signals from surprisingly few linear measurements, using ell1 minimization. In previous work, numerical experiments showed that ellp minimization with 0 CT scans with a small number of x-rays and reducing MRI scanning time. The potential benefits extend to any application of compressive sensing.
A hyperspectral images compression algorithm based on 3D bit plane transform
Zhang, Lei; Xiang, Libin; Zhang, Sam; Quan, Shengxue
2010-10-01
According the analyses of the hyper-spectral images, a new compression algorithm based on 3-D bit plane transform is proposed. The spectral coefficient is higher than the spatial. The algorithm is proposed to overcome the shortcoming of 1-D bit plane transform for it can only reduce the correlation when the neighboring pixels have similar values. The algorithm calculates the horizontal, vertical and spectral bit plane transform sequentially. As the spectral bit plane transform, the algorithm can be easily realized by hardware. In addition, because the calculation and encoding of the transform matrix of each bit are independent, the algorithm can be realized by parallel computing model, which can improve the calculation efficiency and save the processing time greatly. The experimental results show that the proposed algorithm achieves improved compression performance. With a certain compression ratios, the algorithm satisfies requirements of hyper-spectral images compression system, by efficiently reducing the cost of computation and memory usage.
First application of the 3D-MHB on dynamic compressive behavior of UHPC
Directory of Open Access Journals (Sweden)
Cadoni Ezio
2015-01-01
Full Text Available In order to study the dynamic behaviour of material in confined conditions a new machine was conceived and called 3D-Modified Hopkinson Bar (3D-MHB. It is a Modified Hopkinson Bar apparatus designed to apply dynamic loading in materials having a tri-axial stress state. It consists of a pulse generator system (with pre-tensioned bar and brittle joint, 1 input bar, and 5 output bars. The first results obtained on Ultra High Performance Concrete in compression with three different mono-axial compression states are presented. The results show how the pre-stress states minimize the boundary condition and a more uniform response is obtained.
Huimin Yu
2012-01-01
The asymptotic behavior (as well as the global existence) of classical solutions to the 3D compressible Euler equations are considered. For polytropic perfect gas $(P(\\rho )={P}_{0}{\\rho }^{\\gamma })$ , time asymptotically, it has been proved by Pan and Zhao (2009) that linear damping and slip boundary effect make the density satisfying the porous medium equation and the momentum obeying the classical Darcy's law. In this paper, we use a more general method and extend this resu...
Statistical Mechanical Analysis of Compressed Sensing Utilizing Correlated Compression Matrix
Takeda, Koujin
2010-01-01
We investigate a reconstruction limit of compressed sensing for a reconstruction scheme based on the L1-norm minimization utilizing a correlated compression matrix with a statistical mechanics method. We focus on the compression matrix modeled as the Kronecker-type random matrix studied in research on multi-input multi-output wireless communication systems. We found that strong one-dimensional correlations between expansion bases of original information slightly degrade reconstruction performance.
Yang, L. M.; Shu, C.; Wang, Y.; Sun, Y.
2016-08-01
The sphere function-based gas kinetic scheme (GKS), which was presented by Shu and his coworkers [23] for simulation of inviscid compressible flows, is extended to simulate 3D viscous incompressible and compressible flows in this work. Firstly, we use certain discrete points to represent the spherical surface in the phase velocity space. Then, integrals along the spherical surface for conservation forms of moments, which are needed to recover 3D Navier-Stokes equations, are approximated by integral quadrature. The basic requirement is that these conservation forms of moments can be exactly satisfied by weighted summation of distribution functions at discrete points. It was found that the integral quadrature by eight discrete points on the spherical surface, which forms the D3Q8 discrete velocity model, can exactly match the integral. In this way, the conservative variables and numerical fluxes can be computed by weighted summation of distribution functions at eight discrete points. That is, the application of complicated formulations resultant from integrals can be replaced by a simple solution process. Several numerical examples including laminar flat plate boundary layer, 3D lid-driven cavity flow, steady flow through a 90° bending square duct, transonic flow around DPW-W1 wing and supersonic flow around NACA0012 airfoil are chosen to validate the proposed scheme. Numerical results demonstrate that the present scheme can provide reasonable numerical results for 3D viscous flows.
Accelerated fluorine-19 MRI cell tracking using compressed sensing
Zhong, Jia; Mills, Parker H.; Hitchens, T. Kevin; Ahrens, Eric T.
2012-01-01
Cell tracking using perfluorocarbon (PFC) labels and fluorine-19 (19F) MRI is a noninvasive approach to visualize and quantify cell populations in vivo. In this study, we investigated three-dimensional (3D) compressed sensing (CS) methods to accelerate 19F MRI data acquisition for cell tracking and evaluate the impact of acceleration on 19F signal quantification. We show that a greater than eight-fold reduction in imaging time was feasible without pronounced image degradation and with minimal...
Compressive sensing for nuclear security.
Energy Technology Data Exchange (ETDEWEB)
Gestner, Brian Joseph
2013-12-01
Special nuclear material (SNM) detection has applications in nuclear material control, treaty verification, and national security. The neutron and gamma-ray radiation signature of SNMs can be indirectly observed in scintillator materials, which fluoresce when exposed to this radiation. A photomultiplier tube (PMT) coupled to the scintillator material is often used to convert this weak fluorescence to an electrical output signal. The fluorescence produced by a neutron interaction event differs from that of a gamma-ray interaction event, leading to a slightly different pulse in the PMT output signal. The ability to distinguish between these pulse types, i.e., pulse shape discrimination (PSD), has enabled applications such as neutron spectroscopy, neutron scatter cameras, and dual-mode neutron/gamma-ray imagers. In this research, we explore the use of compressive sensing to guide the development of novel mixed-signal hardware for PMT output signal acquisition. Effectively, we explore smart digitizers that extract sufficient information for PSD while requiring a considerably lower sample rate than conventional digitizers. Given that we determine the feasibility of realizing these designs in custom low-power analog integrated circuits, this research enables the incorporation of SNM detection into wireless sensor networks.
Compressed Sensing with Rank Deficient Dictionaries
DEFF Research Database (Denmark)
Hansen, Thomas Lundgaard; Johansen, Daniel Højrup; Jørgensen, Peter Bjørn;
2012-01-01
In compressed sensing it is generally assumed that the dictionary matrix constitutes a (possibly overcomplete) basis of the signal space. In this paper we consider dictionaries that do not span the signal space, i.e. rank deficient dictionaries. We show that in this case the signal-to-noise ratio...... (SNR) in the compressed samples can be increased by selecting the rows of the measurement matrix from the column space of the dictionary. As an example application of compressed sensing with a rank deficient dictionary, we present a case study of compressed sensing applied to the Coarse Acquisition (C....../A) step in a GPS receiver. Simulations show that for this application the proposed choice of measurement matrix yields an increase in SNR performance of up to 5 − 10 dB, compared to the conventional choice of a fully random measurement matrix. Furthermore, the compressed sensing based C/A step is compared...
Embedding silica and polymer fibre Bragg gratings (FBG) in plastic 3D-printed sensing patches
DEFF Research Database (Denmark)
Zubel, Michal G.; Sugden, Kate; Webb, David J.;
2016-01-01
This paper reports the first demonstration of a silica fibre Bragg grating (SOFBG) embedded in an FDM 3-D printed housing to yield a dual grating temperature-compensated strain sensor. We also report the first ever integration of polymer fibre Bragg grating (POFBG) within a 3-D printed sensing...
Compressed sensing and sparsity in photoacoustic tomography
Haltmeier, Markus; Moon, Sunghwan; Burgholzer, Peter
2016-01-01
Increasing the imaging speed is a central aim in photoacoustic tomography. In this work we address this issue using techniques of compressed sensing. We demonstrate that the number of measurements can significantly be reduced by allowing general linear measurements instead of point wise pressure values. A main requirement in compressed sensing is the sparsity of the unknowns to be recovered. For that purpose we develop the concept of sparsifying temporal transforms for three dimensional photoacoustic tomography. Reconstruction results for simulated and for experimental data verify that the proposed compressed sensing scheme allows to significantly reducing the number of spatial measurements without reducing the spatial resolution.
Video compressive sensing using Gaussian mixture models.
Yang, Jianbo; Yuan, Xin; Liao, Xuejun; Llull, Patrick; Brady, David J; Sapiro, Guillermo; Carin, Lawrence
2014-11-01
A Gaussian mixture model (GMM)-based algorithm is proposed for video reconstruction from temporally compressed video measurements. The GMM is used to model spatio-temporal video patches, and the reconstruction can be efficiently computed based on analytic expressions. The GMM-based inversion method benefits from online adaptive learning and parallel computation. We demonstrate the efficacy of the proposed inversion method with videos reconstructed from simulated compressive video measurements, and from a real compressive video camera. We also use the GMM as a tool to investigate adaptive video compressive sensing, i.e., adaptive rate of temporal compression.
Inductively Driven, 3D Liner Compression of a Magnetized Plasma to Megabar Energy Densities
Energy Technology Data Exchange (ETDEWEB)
Slough, John [MSNW LLC, Redmond, WA (United States)
2015-02-01
modules. The additional energy and switching capability proposed will thus provide for optimal utilization of the liner energy. The following tasks were outlined for the three year effort: (1) Design and assemble the foil liner compression test structure and chamber including the compression bank and test foils [Year 1]. (2) Perform foil liner compression experiments and obtain performance data over a range on liner dimensions and bank parameters [Year 2]. (3) Carry out compression experiments of the FRC plasma to Megagauss fields and measure key fusion parameters [Year 3]. (4) Develop numerical codes and analyze experimental results, and determine the physics and scaling for future work [Year 1-3]. The principle task of the project was to design and assemble the foil liner FRC formation chamber, the full compression test structure and chamber including the compression bank. This task was completed successfully. The second task was to test foils in the test facility constructed in year one and characterize the performance obtained from liner compression. These experimental measurements were then compared with analytical predictions, and numerical code results. The liner testing was completed and compared with both the analytical results as well as the code work performed with the 3D structural dynamics package of ANSYS Metaphysics®. This code is capable of modeling the dynamic behavior of materials well into the non-linear regime (e.g. a bullet hit plate glass). The liner dynamic behavior was found to be remarkably close to that predicted by the 3D structural dynamics results. Incorporating a code that can also include the magnetics and plasma physics has also made significant progress at the UW. The remaining test bed construction and assembly task is was completed, and the FRC formation and merging experiments were carried out as planned. The liner compression of the FRC to Megagauss fields was not performed due to not obtaining a sufficiently long lived FRC during the
Compressed Sensing-Based Multiuser Cooperative Networks
Institute of Scientific and Technical Information of China (English)
付晓梅; 崔阳然
2016-01-01
To avoid interference, compressed sensing is introduced into multiuser cooperative network. A coopera-tive compressed sensing and amplify-and-forward(CCS-AF)scheme is proposed, and it is proved that the channel capacity increases compared with the traditional cooperative scheme by considering the CCS-AF transmission ma-trix as the measurement matrix. Moreover, a new power allocation algorithm among the relays is proposed to im-prove the channel capacity. Numerical results validate the effectiveness of the proposed scheme.
Compressive Sensing Image Sensors-Hardware Implementation
Shahram Shirani; M. Jamal Deen; Mohammadreza Dadkhah
2013-01-01
The compressive sensing (CS) paradigm uses simultaneous sensing and compression to provide an efficient image acquisition technique. The main advantages of the CS method include high resolution imaging using low resolution sensor arrays and faster image acquisition. Since the imaging philosophy in CS imagers is different from conventional imaging systems, new physical structures have been developed for cameras that use the CS technique. In this paper, a review of different hardware implementa...
Compressive Sensing Using the Entropy Functional
Kose, Kivanc
2011-01-01
In most compressive sensing problems l1 norm is used during the signal reconstruction process. In this article the use of entropy functional is proposed to approximate the l1 norm. A modified version of the entropy functional is continuous, differentiable and convex. Therefore, it is possible to construct globally convergent iterative algorithms using Bregman's row action D-projection method for compressive sensing applications. Simulation examples are presented.
MRI Sequence Images Compression Method Based on Improved 3D SPIHT%基于改进3D SPIHT的MRI序列图像压缩方法
Institute of Scientific and Technical Information of China (English)
蒋行国; 李丹; 陈真诚
2013-01-01
目的 研究一种有效的MRI序列图像压缩方法.方法 以2组不同数量、不同层厚的MRI序列图像为例,针对3D SPIHT算法运算复杂度,在对D型、L型表项重复判断的不足上,提出了一种改进的3DSPIHT方法;同时,根据MRI序列图像的相关性特点,提出了分组编/解码的方法,结合3D小波变换和应用改进的3D SPIHT方法,实现了MRI序列图像压缩.结果 分组结合改进3D SPIHT方法与2DSPIHT,3D SPIHT相比,能够得到较好重构图像,同时,峰值信噪比(PSNR)提高了1～8 dB左右.结论 在相同码率下,分组结合改进3D SPIHT的方法提高了PSNR和图像恢复质量,可以更好地解决大量MRI序列图像存储与传输问题.%Objective To propose an effective MRI sequence image compression method for solving the storage and transmission problem of large amounts of MRI sequence images. Methods Aimed at alleviating the complexity of computation of 3D Set Partitioning in Hierarchical Trees( SPIHT) algorithm and the deficiency that D or L type table were judged repeatedly, an improved 3 D SPIHT method was presented and two groups of MRI sequence images with different numbers and slice thickness were taken as examples. At the same time, according to the correlation characteristics of MRI sequence images, a method that images were divided into groups and then coded/decoded was put forward in this paper. It combined with 3D wavelet transform and the improved 3D SPIHT method, the MRI sequence image compression was achieved. Results Comparing with the 2D SPIHT and 3D SPIHT methods, the grouping combined with the improved 3D SPIHT method could obtain better reconstructed images and Peak Signal Noise Ratio (PSNR) could be improved by 1 ～ 8 dB as well. Conclusion At the same bit rate, PSNR and image quality of recovery can be improved by the grouping combined with the improved 3D SPIHT method and the storage and transmission problem of large amounts of MRI sequence images can be solved.
Spectral Compressive Sensing with Polar Interpolation
DEFF Research Database (Denmark)
Fyhn, Karsten; Dadkhahi, Hamid; F. Duarte, Marco
2013-01-01
Existing approaches to compressive sensing of frequency-sparse signals focuses on signal recovery rather than spectral estimation. Furthermore, the recovery performance is limited by the coherence of the required sparsity dictionaries and by the discretization of the frequency parameter space....... In this paper, we introduce a greedy recovery algorithm that leverages a band-exclusion function and a polar interpolation function to address these two issues in spectral compressive sensing. Our algorithm is geared towards line spectral estimation from compressive measurements and outperforms most existing...
Compressive sensing exploiting wavelet-domain dependencies for ECG compression
Polania, Luisa F.; Carrillo, Rafael E.; Blanco-Velasco, Manuel; Barner, Kenneth E.
2012-06-01
Compressive sensing (CS) is an emerging signal processing paradigm that enables sub-Nyquist sampling of sparse signals. Extensive previous work has exploited the sparse representation of ECG signals in compression applications. In this paper, we propose the use of wavelet domain dependencies to further reduce the number of samples in compressive sensing-based ECG compression while decreasing the computational complexity. R wave events manifest themselves as chains of large coefficients propagating across scales to form a connected subtree of the wavelet coefficient tree. We show that the incorporation of this connectedness as additional prior information into a modified version of the CoSaMP algorithm can significantly reduce the required number of samples to achieve good quality in the reconstruction. This approach also allows more control over the ECG signal reconstruction, in particular, the QRS complex, which is typically distorted when prior information is not included in the recovery. The compression algorithm was tested upon records selected from the MIT-BIH arrhythmia database. Simulation results show that the proposed algorithm leads to high compression ratios associated with low distortion levels relative to state-of-the-art compression algorithms.
DART : a 3D model for remote sensing images and radiative budget of earth surfaces
Gastellu-Etchegorry, J.P.; Grau, E.; Lauret, N.
2012-01-01
Modeling the radiative behavior and the energy budget of land surfaces is relevant for many scientific domains such as the study of vegetation functioning with remotely acquired information. DART model (Discrete Anisotropic Radiative Transfer) is developed since 1992. It is one of the most complete 3D models in this domain. It simulates radiative transfer (R.T.) in the optical domain: 3D radiative budget and remote sensing images (i.e., radiance, reflectance, brightness temperature) of vegeta...
Xu, Xiang; Li, Hui; Zhang, Qiangqiang; Hu, Han; Zhao, Zongbin; Li, Jihao; Li, Jingye; Qiao, Yu; Gogotsi, Yury
2015-04-28
Three-dimensional (3D) graphene aerogels (GA) show promise for applications in supercapacitors, electrode materials, gas sensors, and oil absorption due to their high porosity, mechanical strength, and electrical conductivity. However, the control, actuation, and response properties of graphene aerogels have not been well studied. In this paper, we synthesized 3D graphene aerogels decorated with Fe3O4 nanoparticles (Fe3O4/GA) by self-assembly of graphene with simultaneous decoration by Fe3O4 nanoparticles using a modified hydrothermal reduction process. The aerogels exhibit up to 52% reversible magnetic field-induced strain and strain-dependent electrical resistance that can be used to monitor the degree of compression/stretching of the material. The density of Fe3O4/GA is only about 5.8 mg cm(-3), making it an ultralight magnetic elastomer with potential applications in self-sensing soft actuators, microsensors, microswitches, and environmental remediation. PMID:25792130
Compressive Sensing for MIMO Radar
Yu, Yao; Poor, H Vincent
2009-01-01
Multiple-input multiple-output (MIMO) radar systems have been shown to achieve superior resolution as compared to traditional radar systems with the same number of transmit and receive antennas. This paper considers a distributed MIMO radar scenario, in which each transmit element is a node in a wireless network, and investigates the use of compressive sampling for direction-of-arrival (DOA) estimation. According to the theory of compressive sampling, a signal that is sparse in some domain can be recovered based on far fewer samples than required by the Nyquist sampling theorem. The DOA of targets form a sparse vector in the angle space, and therefore, compressive sampling can be applied for DOA estimation. The proposed approach achieves the superior resolution of MIMO radar with far fewer samples than other approaches. This is particularly useful in a distributed scenario, in which the results at each receive node need to be transmitted to a fusion center for further processing.
DETERMINING OPTIMAL CUBE FOR 3D-DCT BASED VIDEO COMPRESSION FOR DIFFERENT MOTION LEVELS
Directory of Open Access Journals (Sweden)
J. Augustin Jacob
2012-11-01
Full Text Available This paper proposes new three dimensional discrete cosine transform (3D-DCT based video compression algorithm that will select the optimal cube size based on the motion content of the video sequence. It is determined by finding normalized pixel difference (NPD values, and by categorizing the cubes as “low” or “high” motion cube suitable cube size of dimension either [16×16×8] or[8×8×8] is chosen instead of fixed cube algorithm. To evaluate the performance of the proposed algorithm test sequence with different motion levels are chosen. By doing rate vs. distortion analysis the level of compression that can be achieved and the quality of reconstructed video sequence are determined and compared against fixed cube size algorithm. Peak signal to noise ratio (PSNR is taken to measure the video quality. Experimental result shows that varying the cube size with reference to the motion content of video frames gives better performance in terms of compression ratio and video quality.
Mechano-sensing and cell migration: a 3D model approach
International Nuclear Information System (INIS)
Cell migration is essential for tissue development in different physiological and pathological conditions. It is a complex process orchestrated by chemistry, biological factors, microstructure and surrounding mechanical properties. Focusing on the mechanical interactions, cells do not only exert forces on the matrix that surrounds them, but they also sense and react to mechanical cues in a process called mechano-sensing. Here, we hypothesize the involvement of mechano-sensing in the regulation of directional cell migration through a three-dimensional (3D) matrix. For this purpose, we develop a 3D numerical model of individual cell migration, which incorporates the mechano-sensing process of the cell as the main mechanism regulating its movement. Consistent with this hypothesis, we found that factors, such as substrate stiffness, boundary conditions and external forces, regulate specific and distinct cell movements
The possibilities of compressed sensing based migration
Aldawood, Ali
2013-09-22
Linearized waveform inversion or Least-square migration helps reduce migration artifacts caused by limited acquisition aperture, coarse sampling of sources and receivers, and low subsurface illumination. However, leastsquare migration, based on L2-norm minimization of the misfit function, tends to produce a smeared (smoothed) depiction of the true subsurface reflectivity. Assuming that the subsurface reflectivity distribution is a sparse signal, we use a compressed-sensing (Basis Pursuit) algorithm to retrieve this sparse distribution from a small number of linear measurements. We applied a compressed-sensing algorithm to image a synthetic fault model using dense and sparse acquisition geometries. Tests on synthetic data demonstrate the ability of compressed-sensing to produce highly resolved migrated images. We, also, studied the robustness of the Basis Pursuit algorithm in the presence of Gaussian random noise.
Institute of Scientific and Technical Information of China (English)
Xu Xinying
2012-01-01
In this paper; we prove a blow-up criterion of strong solutions to the 3-D viscous and non-resistive magnetohydrodynamic equations for compressible heat-conducting flows with initial vacuum.This blow-up criterion depends only on the gradient of velocity and the temperature,which is similar to the one for compressible Navier-Stokes equations.
Xampling: Compressed Sensing of Analog Signals
Mishali, Moshe; Eldar, Yonina C.
2011-01-01
Xampling generalizes compressed sensing (CS) to reduced-rate sampling of analog signals. A unified framework is introduced for low rate sampling and processing of signals lying in a union of subspaces. Xampling consists of two main blocks: Analog compression that narrows down the input bandwidth prior to sampling with commercial devices followed by a nonlinear algorithm that detects the input subspace prior to conventional signal processing. A variety of analog CS applications are reviewed wi...
Institute of Scientific and Technical Information of China (English)
Zi-Yi Guo; Jing Chen; Guang Yang; Qian-Yu Tang; Cai-Xiang Chen; Shui-Xi Fu; Dan Yu
2012-01-01
Objective: To evaluate the anatomical characteristics and patterns of neurovascular compression in patients suffering trigeminal neuralgia, using 3D high-resolution magnetic resonance imaging methods and fusion technologies. Methods: The analysis of the anatomy of the facial nerve, brain stem and the vascular structures related to this nerve was made in 100 consecutive patients for TN. 3D high resolution MRI studies (3D SPGR, T1 enhanced 3D MP-RAGE and T2/T1 3D FIESTA) simultaneous visualization were used to assessed using the software 3D DOCTOR. Results: In 93 patients (93%), there were one or several locals of neurovascular compression (NVC). The superior cerebellar artery was involved in 71 cases (76%), the other vessels including the antero-inferior cerebellar artery, the basilar artery, the vertebral artery, and some venous structures. The mean distance between NVC and nerve origin site in the brainstem was (3.76 ± 2.90) mm). In 39 patients (42%), the vascular compression was located proximally and in 42 (45%) the compression was located distally. Nerve dislocation or distortion by the vessel was observed in 30 cases (32%). Conclusions: This 3D high resolution MRI and image fusion technology could be useful for diagnostic and therapeutic decisions in TN.
Pitfalls and possibilities of radar compressive sensing.
Goodman, Nathan A; Potter, Lee C
2015-03-10
In this paper, we consider the application of compressive sensing (CS) to radar remote sensing applications. We survey a suite of practical system-level issues related to the compression of radar measurements, and we advocate the consideration of these issues by researchers exploring potential gains of CS in radar applications. We also give abbreviated examples of decades-old radio-frequency (RF) practices that already embody elements of CS for relevant applications. In addition to the cautionary implications of system-level issues and historical precedents, we identify several promising results that RF practitioners may gain from the recent explosion of CS literature.
Fast electron microscopy via compressive sensing
Energy Technology Data Exchange (ETDEWEB)
Larson, Kurt W; Anderson, Hyrum S; Wheeler, Jason W
2014-12-09
Various technologies described herein pertain to compressive sensing electron microscopy. A compressive sensing electron microscope includes a multi-beam generator and a detector. The multi-beam generator emits a sequence of electron patterns over time. Each of the electron patterns can include a plurality of electron beams, where the plurality of electron beams is configured to impart a spatially varying electron density on a sample. Further, the spatially varying electron density varies between each of the electron patterns in the sequence. Moreover, the detector collects signals respectively corresponding to interactions between the sample and each of the electron patterns in the sequence.
Compressive wavefront sensing with weak values.
Howland, Gregory A; Lum, Daniel J; Howell, John C
2014-08-11
We demonstrate a wavefront sensor that unites weak measurement and the compressive-sensing, single-pixel camera. Using a high-resolution spatial light modulator (SLM) as a variable waveplate, we weakly couple an optical field's transverse-position and polarization degrees of freedom. By placing random, binary patterns on the SLM, polarization serves as a meter for directly measuring random projections of the wavefront's real and imaginary components. Compressive-sensing optimization techniques can then recover the wavefront. We acquire high quality, 256 × 256 pixel images of the wavefront from only 10,000 projections. Photon-counting detectors give sub-picowatt sensitivity.
Compressive sensing for neutrospheric water vapor tomography using GNSS and InSAR observations
Heublein, Marion; Zhu, Xiao Xiang; Alshawaf, Fadwa; Mayer, Michael; Bamler, Richard; Hinz, Stefan
2015-01-01
This paper presents the innovative Compressive Sensing (CS) concept for tomographic reconstruction of 3D neutrospheric water vapor fields using data from Global Navigation Satellite Systems (GNSS) and Interferometric Synthetic Aperture Radar (InSAR). The Precipitable Water Vapor (PWV) input data are derived from simulations of the Weather Research and Forecasting modeling system. We apply a Compressive Sensing based approach for tomographic inversion. Using the Cosine transform, a sparse repr...
Adaptive Remote Sensing Texture Compression on GPU
Directory of Open Access Journals (Sweden)
Xiao-Xia Lu
2010-11-01
Full Text Available Considering the properties of remote sensing texture such as strong randomness and weak local correlation, a novel adaptive compression method based on vector quantizer is presented and implemented on GPU. Utilizing the property of Human Visual System (HVS, a new similarity measurement function is designed instead of using Euclid distance. Correlated threshold between blocks can be obtained adaptively according to the property of different images without artificial auxiliary. Furthermore, a self-adaptive threshold adjustment during the compression is designed to improve the reconstruct quality. Experiments show that the method can handle various resolution images adaptively. It can achieve satisfied compression rate and reconstruct quality at the same time. Index is coded to further increase the compression rate. The coding way is designed to guarantee accessing the index randomly too. Furthermore, the compression and decompression process is speed up with the usage of GPU, on account of their parallelism.
Inductively Driven, 3D Liner Compression of a Magnetized Plasma to Megabar Energy Densities
Energy Technology Data Exchange (ETDEWEB)
Slough, John [MSNW LLC, Redmond, WA (United States)
2015-02-01
modules. The additional energy and switching capability proposed will thus provide for optimal utilization of the liner energy. The following tasks were outlined for the three year effort: (1) Design and assemble the foil liner compression test structure and chamber including the compression bank and test foils [Year 1]. (2) Perform foil liner compression experiments and obtain performance data over a range on liner dimensions and bank parameters [Year 2]. (3) Carry out compression experiments of the FRC plasma to Megagauss fields and measure key fusion parameters [Year 3]. (4) Develop numerical codes and analyze experimental results, and determine the physics and scaling for future work [Year 1-3]. The principle task of the project was to design and assemble the foil liner FRC formation chamber, the full compression test structure and chamber including the compression bank. This task was completed successfully. The second task was to test foils in the test facility constructed in year one and characterize the performance obtained from liner compression. These experimental measurements were then compared with analytical predictions, and numerical code results. The liner testing was completed and compared with both the analytical results as well as the code work performed with the 3D structural dynamics package of ANSYS Metaphysics®. This code is capable of modeling the dynamic behavior of materials well into the non-linear regime (e.g. a bullet hit plate glass). The liner dynamic behavior was found to be remarkably close to that predicted by the 3D structural dynamics results. Incorporating a code that can also include the magnetics and plasma physics has also made significant progress at the UW. The remaining test bed construction and assembly task is was completed, and the FRC formation and merging experiments were carried out as planned. The liner compression of the FRC to Megagauss fields was not performed due to not obtaining a sufficiently long lived FRC during the
Compressed Sensing Applied to Weather Radar
Mishra, Kumar Vijay; Kruger, Anton; Krajewski, Witold F.
2014-01-01
We propose an innovative meteorological radar, which uses reduced number of spatiotemporal samples without compromising the accuracy of target information. Our approach extends recent research on compressed sensing (CS) for radar remote sensing of hard point scatterers to volumetric targets. The previously published CS-based radar techniques are not applicable for sampling weather since the precipitation echoes lack sparsity in both range-time and Doppler domains. We propose an alternative ap...
Spectral analysis based on compressive sensing in nanophotonic structures.
Wang, Zhu; Yu, Zongfu
2014-10-20
A method of spectral sensing based on compressive sensing is shown to have the potential to achieve high resolution in a compact device size. The random bases used in compressive sensing are created by the optical response of a set of different nanophotonic structures, such as photonic crystal slabs. The complex interferences in these nanostructures offer diverse spectral features suitable for compressive sensing.
Directory of Open Access Journals (Sweden)
L. Zhang
2015-01-01
Full Text Available In solar wind, dissipation of slow-mode magnetosonic waves may play a significant role in heating the solar wind, and these modes contribute essentially to the solar wind compressible turbulence. Most previous identifications of slow waves utilized the characteristic negative correlation between δ|B| and δρ. However, that criterion does not well identify quasi-parallel slow waves, for which δ|B| is negligible compared to δρ. Here we present a new method of identification, which will be used in 3-D compressible simulation. It is based on two criteria: (1 that VpB0 (phase speed projected along B0 is around ± cs, and that (2 there exists a clear correlation of δv|| and δρ. Our research demonstrates that if vA > cs, slow waves possess correlation between δv|| and δρ, with δρ / δv|| ≈ ± ρ0 / cs. This method helps us to distinguish slow-mode waves from fast and Alfvén waves, both of which do not have this polarity relation. The criteria are insensitive to the propagation angle θk B, defined as the angle between wave vector k and B0; they can be applied with a wide range of β if only vA > cs. In our numerical simulation, we have identified four cases of slow wave trains with this method. The slow wave trains seem to deform, probably caused by interaction with other waves; as a result, fast or Alfvén waves may be produced during the interaction and seem to propagate bidirectionally away. Our identification and analysis of the wave trains provide useful methods for investigations of compressible turbulence in the solar wind or in similar environments, and will thus deepen understandings of slow waves in the turbulence.
Compressive sensing for high resolution radar imaging
Anitori, L.; Otten, M.P.G.; Hoogeboom, P.
2010-01-01
In this paper we present some preliminary results on the application of Compressive Sensing (CS) to high resolution radar imaging. CS is a recently developed theory which allows reconstruction of sparse signals with a number of measurements much lower than what is required by the Shannon sampling th
Compressive sensing with a spherical microphone array
DEFF Research Database (Denmark)
Fernandez Grande, Efren; Xenaki, Angeliki
2016-01-01
A wave expansion method is proposed in this work, based on measurements with a spherical microphone array, and formulated in the framework provided by Compressive Sensing. The method promotes sparse solutions via ‘1-norm minimization, so that the measured data are represented by few basis functions...
Compressed Sensing-Based Direct Conversion Receiver
DEFF Research Database (Denmark)
Pierzchlewski, Jacek; Arildsen, Thomas; Larsen, Torben
2012-01-01
Due to the continuously increasing computational power of modern data receivers it is possible to move more and more processing from the analog to the digital domain. This paper presents a compressed sensing approach to relaxing the analog filtering requirements prior to the ADCs in a direct...
Compressive sensing with a microwave photonic filter
DEFF Research Database (Denmark)
Chen, Ying; Yu, Xianbin; Chi, Hao;
2015-01-01
In this letter, we present a novel approach to realizing photonics-assisted compressive sensing (CS) with the technique of microwave photonic fi ltering. In the proposed system, an input spectrally sparse signal to be captured and a random sequence are modulated on an optical carrier via two Mach...
3D-Web-GIS RFID location sensing system for construction objects.
Ko, Chien-Ho
2013-01-01
Construction site managers could benefit from being able to visualize on-site construction objects. Radio frequency identification (RFID) technology has been shown to improve the efficiency of construction object management. The objective of this study is to develop a 3D-Web-GIS RFID location sensing system for construction objects. An RFID 3D location sensing algorithm combining Simulated Annealing (SA) and a gradient descent method is proposed to determine target object location. In the algorithm, SA is used to stabilize the search process and the gradient descent method is used to reduce errors. The locations of the analyzed objects are visualized using the 3D-Web-GIS system. A real construction site is used to validate the applicability of the proposed method, with results indicating that the proposed approach can provide faster, more accurate, and more stable 3D positioning results than other location sensing algorithms. The proposed system allows construction managers to better understand worksite status, thus enhancing managerial efficiency.
Compressive Sensing for Spread Spectrum Receivers
DEFF Research Database (Denmark)
Fyhn, Karsten; Jensen, Tobias Lindstrøm; Larsen, Torben;
2013-01-01
to a decrease in the two design parameters. This paper investigates the use of Compressive Sensing (CS) in a general Code Division Multiple Access (CDMA) receiver. We show that when using spread spectrum codes in the signal domain, the CS measurement matrix may be simplified. This measurement scheme, named...... Compressive Spread Spectrum (CSS), allows for a simple, effective receiver design. Furthermore, we numerically evaluate the proposed receiver in terms of bit error rate under different signal to noise ratio conditions and compare it with other receiver structures. These numerical experiments show that though......With the advent of ubiquitous computing there are two design parameters of wireless communication devices that become very important: power efficiency and production cost. Compressive sensing enables the receiver in such devices to sample below the Shannon-Nyquist sampling rate, which may lead...
Compressive Sensing for Spectroscopy and Polarimetry
Ramos, A Asensio
2009-01-01
We demonstrate through numerical simulations with real data the feasibility of using compressive sensing techniques for the acquisition of spectro-polarimetric data. This allows us to combine the measurement and the compression process into one consistent framework. Signals are recovered thanks to a sparse reconstruction scheme from projections of the signal of interest onto appropriately chosen vectors, typically noise-like vectors. The compressibility properties of spectral lines are analyzed in detail. The results shown in this paper demonstrate that, thanks to the compressibility properties of spectral lines, it is feasible to reconstruct the signals using only a small fraction of the information that is measured nowadays. We investigate in depth the quality of the reconstruction as a function of the amount of data measured and the influence of noise. This change of paradigm also allows us to define new instrumental strategies and to propose modifications to existing instruments in order to take advantage...
Coding Strategies and Implementations of Compressive Sensing
Tsai, Tsung-Han
This dissertation studies the coding strategies of computational imaging to overcome the limitation of conventional sensing techniques. The information capacity of conventional sensing is limited by the physical properties of optics, such as aperture size, detector pixels, quantum efficiency, and sampling rate. These parameters determine the spatial, depth, spectral, temporal, and polarization sensitivity of each imager. To increase sensitivity in any dimension can significantly compromise the others. This research implements various coding strategies subject to optical multidimensional imaging and acoustic sensing in order to extend their sensing abilities. The proposed coding strategies combine hardware modification and signal processing to exploiting bandwidth and sensitivity from conventional sensors. We discuss the hardware architecture, compression strategies, sensing process modeling, and reconstruction algorithm of each sensing system. Optical multidimensional imaging measures three or more dimensional information of the optical signal. Traditional multidimensional imagers acquire extra dimensional information at the cost of degrading temporal or spatial resolution. Compressive multidimensional imaging multiplexes the transverse spatial, spectral, temporal, and polarization information on a two-dimensional (2D) detector. The corresponding spectral, temporal and polarization coding strategies adapt optics, electronic devices, and designed modulation techniques for multiplex measurement. This computational imaging technique provides multispectral, temporal super-resolution, and polarization imaging abilities with minimal loss in spatial resolution and noise level while maintaining or gaining higher temporal resolution. The experimental results prove that the appropriate coding strategies may improve hundreds times more sensing capacity. Human auditory system has the astonishing ability in localizing, tracking, and filtering the selected sound sources or
A Camera Nodes Correlation Model Based on 3D Sensing in Wireless Multimedia Sensor Networks
Chong Han; Lijuan Sun; Fu Xiao; Jian Guo; Ruchuan Wang
2012-01-01
In wireless multimedia sensor networks, multiple camera sensor nodes generally are used for gaining enhanced observations of a certain area of interest. This brings on the visual information retrieved from adjacent camera nodes usually exhibits high levels of correlation. In this paper, first, based on the analysis of 3D directional sensing model of camera sensor nodes, a correlation model is proposed by measuring the intersection area of multiple camera nodes’ field of views. In this model, ...
3D printed sensing patches with embedded polymer optical fibre Bragg gratings
Zubel, Michal G.; Sugden, Kate; Saez-Rodriguez, D.; Nielsen, K.; Bang, O.
2016-05-01
The first demonstration of a polymer optical fibre Bragg grating (POFBG) embedded in a 3-D printed structure is reported. Its cyclic strain performance and temperature characteristics are examined and discussed. The sensing patch has a repeatable strain sensitivity of 0.38 pm/μepsilon. Its temperature behaviour is unstable, with temperature sensitivity values varying between 30-40 pm/°C.
Energy Technology Data Exchange (ETDEWEB)
Gaudeau, Y
2006-12-15
The huge amounts of volumetric data generated by current medical imaging techniques in the context of an increasing demand for long term archiving solutions, as well as the rapid development of distant radiology make the use of compression inevitable. Indeed, if the medical community has sided until now with compression without losses, most of applications suffer from compression ratios which are too low with this kind of compression. In this context, compression with acceptable losses could be the most appropriate answer. So, we propose a new loss coding scheme based on 3D (3 dimensional) Wavelet Transform and Dead Zone Lattice Vector Quantization 3D (DZLVQ) for medical images. Our algorithm has been evaluated on several computerized tomography (CT) and magnetic resonance image volumes. The main contribution of this work is the design of a multidimensional dead zone which enables to take into account correlations between neighbouring elementary volumes. At high compression ratios, we show that it can out-perform visually and numerically the best existing methods. These promising results are confirmed on head CT by two medical patricians. The second contribution of this document assesses the effect with-loss image compression on CAD (Computer-Aided Decision) detection performance of solid lung nodules. This work on 120 significant lungs images shows that detection did not suffer until 48:1 compression and still was robust at 96:1. The last contribution consists in the complexity reduction of our compression scheme. The first allocation dedicated to 2D DZLVQ uses an exponential of the rate-distortion (R-D) functions. The second allocation for 2D and 3D medical images is based on block statistical model to estimate the R-D curves. These R-D models are based on the joint distribution of wavelet vectors using a multidimensional mixture of generalized Gaussian (MMGG) densities. (author)
Fusing Multiscale Charts into 3D ENC Systems Based on Underwater Topography and Remote Sensing Image
Directory of Open Access Journals (Sweden)
Tao Liu
2015-01-01
Full Text Available The purpose of this study is to propose an approach to fuse multiscale charts into three-dimensional (3D electronic navigational chart (ENC systems based on underwater topography and remote sensing image. This is the first time that the fusion of multiscale standard ENCs in the 3D ENC system has been studied. First, a view-dependent visualization technology is presented for the determination of the display condition of a chart. Second, a map sheet processing method is described for dealing with the map sheet splice problem. A process order called “3D order” is designed to adapt to the characteristics of the chart. A map sheet clipping process is described to deal with the overlap between the adjacent map sheets. And our strategy for map sheet splice is proposed. Third, the rendering method for ENC objects in the 3D ENC system is introduced. Fourth, our picking-up method for ENC objects is proposed. Finally, we implement the above methods in our system: automotive intelligent chart (AIC 3D electronic chart display and information systems (ECDIS. And our method can handle the fusion problem well.
Compressive sensing in the EO/IR.
Gehm, M E; Brady, D J
2015-03-10
We investigate the utility of compressive sensing (CS) to electro-optic and infrared (EO/IR) applications. We introduce the field through a discussion of historical antecedents and the development of the modern CS framework. Basic economic arguments (in the broadest sense) are presented regarding the applicability of CS to the EO/IR and used to draw conclusions regarding application areas where CS would be most viable. A number of experimental success stories are presented to demonstrate the overall feasibility of the approaches, and we conclude with a discussion of open challenges to practical adoption of CS methods.
Compressive Sensing Image Sensors-Hardware Implementation
Directory of Open Access Journals (Sweden)
Shahram Shirani
2013-04-01
Full Text Available The compressive sensing (CS paradigm uses simultaneous sensing and compression to provide an efficient image acquisition technique. The main advantages of the CS method include high resolution imaging using low resolution sensor arrays and faster image acquisition. Since the imaging philosophy in CS imagers is different from conventional imaging systems, new physical structures have been developed for cameras that use the CS technique. In this paper, a review of different hardware implementations of CS encoding in optical and electrical domains is presented. Considering the recent advances in CMOS (complementary metal–oxide–semiconductor technologies and the feasibility of performing on-chip signal processing, important practical issues in the implementation of CS in CMOS sensors are emphasized. In addition, the CS coding for video capture is discussed.
Multichannel Compressive Sensing MRI Using Noiselet Encoding
Pawar, Kamlesh; Zhang, Jingxin
2014-01-01
The incoherence between measurement and sparsifying transform matrices and the restricted isometry property (RIP) of measurement matrix are two of the key factors in determining the performance of compressive sensing (CS). In CS-MRI, the randomly under-sampled Fourier matrix is used as the measurement matrix and the wavelet transform is usually used as sparsifying transform matrix. However, the incoherence between the randomly under-sampled Fourier matrix and the wavelet matrix is not optimal, which can deteriorate the performance of CS-MRI. Using the mathematical result that noiselets are maximally incoherent with wavelets, this paper introduces the noiselet unitary bases as the measurement matrix to improve the incoherence and RIP in CS-MRI, and presents a method to design the pulse sequence for the noiselet encoding. This novel encoding scheme is combined with the multichannel compressive sensing (MCS) framework to take the advantage of multichannel data acquisition used in MRI scanners. An empirical RIP a...
Dynamic Spectrum Detection Via Compressive Sensing
Directory of Open Access Journals (Sweden)
Michael Odeyomi
2012-04-01
Full Text Available Spectrum congestion is a major concern in both military and commercial wireless networks. To support growing demand for ubiquitous spectrum usage, Cognitive Radio is a new paradigm in wireless communication that can be used to exploit unused part of the spectrum by dynamically adjusting its operating parameters. While cognitive radio technology is a promising solution to the spectral congestion problem, efficient methods for detecting white spaces in wideband radio spectrum remain a challenge. Conventional methods of detection are forced to use the high sampling rate requirement of Nyquist criterion. In this paper, the feasibility and efficacy of using compressive sensing (CS algorithms inconjunction with Haar wavelet for identifying spectrum holes in the wideband spectrum is explored. Compressive sensing is an emerging theory that shows that it’s possible to achieve good reconstruction, at sampling rates lower than that specified by Nyquist. CS approach is robust in AWGN and fading channel.
Compressive sensing image sensors-hardware implementation.
Dadkhah, Mohammadreza; Deen, M Jamal; Shirani, Shahram
2013-01-01
The compressive sensing (CS) paradigm uses simultaneous sensing and compression to provide an efficient image acquisition technique. The main advantages of the CS method include high resolution imaging using low resolution sensor arrays and faster image acquisition. Since the imaging philosophy in CS imagers is different from conventional imaging systems, new physical structures have been developed for cameras that use the CS technique. In this paper, a review of different hardware implementations of CS encoding in optical and electrical domains is presented. Considering the recent advances in CMOS (complementary metal-oxide-semiconductor) technologies and the feasibility of performing on-chip signal processing, important practical issues in the implementation of CS in CMOS sensors are emphasized. In addition, the CS coding for video capture is discussed. PMID:23584123
A Compressed Sensing Wire-Tap Channel
Reeves, Galen; Milosavljevic, Nebojsa; Gastpar, Michael
2011-01-01
A multiplicative Gaussian wire-tap channel inspired by compressed sensing is studied. Lower and upper bounds on the secrecy capacity are derived, and shown to be relatively tight in the large system limit for a large class of compressed sensing matrices. Surprisingly, it is shown that the secrecy capacity of this channel is nearly equal to the capacity without any secrecy constraint provided that the channel of the eavesdropper is strictly worse than the channel of the intended receiver. In other words, the eavesdropper can see almost everything and yet learn almost nothing. This behavior, which contrasts sharply with that of many commonly studied wiretap channels, is made possible by the fact that a small number of linear projections can make a crucial difference in the ability to estimate sparse vectors.
Compressed Sensing-Based Direct Conversion Receiver
Pierzchlewski, Jacek; Arildsen, Thomas; Larsen, Torben
2012-01-01
Due to the continuously increasing computational power of modern data receivers it is possible to move more and more processing from the analog to the digital domain. This paper presents a compressed sensing approach to relaxing the analog filtering requirements prior to the ADCs in a direct conversion receiver. In the presented solution, the filtered down-convertedradio signals are randomly sampled with an average sampling frequency lower than its Nyquist rate, and then reconstructed in a DS...
Robust Facial Expression Recognition via Compressive Sensing
Shiqing Zhang; Xiaoming Zhao; Bicheng Lei
2012-01-01
Recently, compressive sensing (CS) has attracted increasing attention in the areas of signal processing, computer vision and pattern recognition. In this paper, a new method based on the CS theory is presented for robust facial expression recognition. The CS theory is used to construct a sparse representation classifier (SRC). The effectiveness and robustness of the SRC method is investigated on clean and occluded facial expression images. Three typical facial features, i.e., the raw pixels, ...
Restricted Conformal Property of Compressive Sensing
Cheng, Tao
2014-01-01
Energy and direction are tow basic properties of a vector. A discrete signal is a vector in nature. RIP of compressive sensing can not show the direction information of a signal but show the energy information of a signal. Hence, RIP is not complete. Orthogonal matrices can preserve angles and lengths. Preservation of length can show energies of signals like RIP do; and preservation of angle can show directions of signals. Therefore, Restricted Conformal Property (RCP) is proposed according t...
3D nitrogen-doped graphene/β-cyclodextrin: host-guest interactions for electrochemical sensing
Liu, Jilun; Leng, Xuanye; Xiao, Yao; Hu, Chengguo; Fu, Lei
2015-07-01
Host-guest interactions, especially those between cyclodextrins (CDs, including α-, β- and γ-CD) and various guest molecules, exhibit a very high supramolecular recognition ability. Thus, they have received considerable attention in different fields. These specific interactions between host and guest molecules are promising for biosensing and clinical detection. However, there is a lack of an ideal electrode substrate for CDs to increase their performance in electrochemical sensing. Herein, we propose a new 3D nitrogen-doped graphene (3D-NG) based electrochemical sensor, taking advantage of the superior sensitivity of host-guest interactions. Our 3D-NG was fabricated by a template-directed chemical vapour deposition (CVD) method, and it showed a large specific surface area, a high capacity for biomolecules and a high electron transfer efficiency. Thus, for the first time, we took 3D-NG as an electrode substrate for β-CD to establish a new type of biosensor. Using dopamine (DA) and acetaminophen (APAP) as representative guest molecules, our 3D-NG/β-CD biosensor shows extremely high sensitivities (5468.6 μA mM-1 cm-2 and 2419.2 μA mM-1 cm-2, respectively), which are significantly higher than those reported in most previous studies. The stable adsorption of β-CD on 3D-NG indicates potential applications in clinical detection and medical testing.Host-guest interactions, especially those between cyclodextrins (CDs, including α-, β- and γ-CD) and various guest molecules, exhibit a very high supramolecular recognition ability. Thus, they have received considerable attention in different fields. These specific interactions between host and guest molecules are promising for biosensing and clinical detection. However, there is a lack of an ideal electrode substrate for CDs to increase their performance in electrochemical sensing. Herein, we propose a new 3D nitrogen-doped graphene (3D-NG) based electrochemical sensor, taking advantage of the superior sensitivity
Institute of Scientific and Technical Information of China (English)
张映辉; 吴国春
2014-01-01
We investigate the global existence and asymptotic behavior of classical solutions for the 3D compressible non-isentropic damped Euler equations on a periodic domain. The global existence and uniqueness of classical solutions are obtained when the initial data is near an equilibrium. Furthermore, the exponential convergence rates of the pressure and velocity are also proved by delicate energy methods.
Enablement of scientific remote sensing missions with in-space 3D printing
Hirsch, Michael; McGuire, Thomas; Parsons, Michael; Leake, Skye; Straub, Jeremy
2016-05-01
This paper provides an overview of the capability of a 3D printer to successfully operate in-space to create structures and equipment useful in the field of scientific remote sensing. Applications of this printer involve oceanography, weather tracking, as well as space exploration sensing. The design for the 3D printer includes a parabolic array to collect and focus thermal energy. This thermal energy then be used to heat the extrusion head, allowing for the successful extrusion of the print material. Print material can range from plastics to metals, with the hope of being able to extrude aluminum for its low-mass structural integrity and its conductive properties. The printer will be able to print structures as well as electrical components. The current process of creating and launching a remote sensor into space is constrained by many factors such as gravity on earth, the forces of launch, the size of the launch vehicle, and the number of available launches. The design intent of the in-space 3D printer is to ease or eliminate these constraints, making space-based scientific remote sensors a more readily available resource.
Speech Enhancement based on Compressive Sensing Algorithm
Sulong, Amart; Gunawan, Teddy S.; Khalifa, Othman O.; Chebil, Jalel
2013-12-01
There are various methods, in performance of speech enhancement, have been proposed over the years. The accurate method for the speech enhancement design mainly focuses on quality and intelligibility. The method proposed with high performance level. A novel speech enhancement by using compressive sensing (CS) is a new paradigm of acquiring signals, fundamentally different from uniform rate digitization followed by compression, often used for transmission or storage. Using CS can reduce the number of degrees of freedom of a sparse/compressible signal by permitting only certain configurations of the large and zero/small coefficients, and structured sparsity models. Therefore, CS is significantly provides a way of reconstructing a compressed version of the speech in the original signal by taking only a small amount of linear and non-adaptive measurement. The performance of overall algorithms will be evaluated based on the speech quality by optimise using informal listening test and Perceptual Evaluation of Speech Quality (PESQ). Experimental results show that the CS algorithm perform very well in a wide range of speech test and being significantly given good performance for speech enhancement method with better noise suppression ability over conventional approaches without obvious degradation of speech quality.
Compressive sensing with a spherical microphone array.
Fernandez-Grande, Efren; Xenaki, Angeliki
2016-02-01
A wave expansion method is proposed in this work, based on measurements with a spherical microphone array, and formulated in the framework provided by Compressive Sensing. The method promotes sparse solutions via ℓ1-norm minimization, so that the measured data are represented by few basis functions. This results in fine spatial resolution and accuracy. This publication covers the theoretical background of the method, including experimental results that illustrate some of the fundamental differences with the "conventional" least-squares approach. The proposed methodology is relevant for source localization, sound field reconstruction, and sound field analysis.
Compressive Sensing via Nonlocal Smoothed Rank Function.
Fan, Ya-Ru; Huang, Ting-Zhu; Liu, Jun; Zhao, Xi-Le
2016-01-01
Compressive sensing (CS) theory asserts that we can reconstruct signals and images with only a small number of samples or measurements. Recent works exploiting the nonlocal similarity have led to better results in various CS studies. To better exploit the nonlocal similarity, in this paper, we propose a non-convex smoothed rank function based model for CS image reconstruction. We also propose an efficient alternating minimization method to solve the proposed model, which reduces a difficult and coupled problem to two tractable subproblems. Experimental results have shown that the proposed method performs better than several existing state-of-the-art CS methods for image reconstruction.
Compressive Sensing via Nonlocal Smoothed Rank Function
Fan, Ya-Ru; Liu, Jun; Zhao, Xi-Le
2016-01-01
Compressive sensing (CS) theory asserts that we can reconstruct signals and images with only a small number of samples or measurements. Recent works exploiting the nonlocal similarity have led to better results in various CS studies. To better exploit the nonlocal similarity, in this paper, we propose a non-convex smoothed rank function based model for CS image reconstruction. We also propose an efficient alternating minimization method to solve the proposed model, which reduces a difficult and coupled problem to two tractable subproblems. Experimental results have shown that the proposed method performs better than several existing state-of-the-art CS methods for image reconstruction. PMID:27583683
Li, Li; Xiao, Wei; Jian, Weijian
2014-11-20
Three-dimensional (3D) laser imaging combining compressive sensing (CS) has an advantage in lower power consumption and less imaging sensors; however, it brings enormous stress to subsequent calculation devices. In this paper we proposed a fast 3D imaging reconstruction algorithm to deal with time-slice images sampled by single-pixel detectors. The algorithm implements 3D imaging reconstruction before CS recovery, thus it saves plenty of runtime of CS recovery. Several experiments are conducted to verify the performance of the algorithm. Simulation results demonstrated that the proposed algorithm has better performance in terms of efficiency compared to an existing algorithm.
International Nuclear Information System (INIS)
In this paper we combine a stochastic 3D microstructure model of a fiber based gas diffusion layer of polymer electrolyte fuel cells with a Lattice Boltzmann model for fluid transport. We focus on a simple approach of compressing the planar oriented virtual geometry of paper-type gas diffusion layer from Toray. Material parameters – permeability and tortuosity – are calculated from simulation of one phase, one component gas flow in stochastic geometries. We analyze the statistical spread of simulation results on ensembles of the virtual geometry, both uncompressed and compressed. The influence of the compression is discussed with regard to the Kozeny–Carman equation. The effective transport properties calculated from transport simulations in compressed gas diffusion layers agree well with a trend based on the Kozeny–Carman equation
Information optimal compressive sensing: static measurement design.
Ashok, Amit; Huang, Liang-Chih; Neifeld, Mark A
2013-05-01
The compressive sensing paradigm exploits the inherent sparsity/compressibility of signals to reduce the number of measurements required for reliable reconstruction/recovery. In many applications additional prior information beyond signal sparsity, such as structure in sparsity, is available, and current efforts are mainly limited to exploiting that information exclusively in the signal reconstruction problem. In this work, we describe an information-theoretic framework that incorporates the additional prior information as well as appropriate measurement constraints in the design of compressive measurements. Using a Gaussian binomial mixture prior we design and analyze the performance of optimized projections relative to random projections under two specific design constraints and different operating measurement signal-to-noise ratio (SNR) regimes. We find that the information-optimized designs yield significant, in some cases nearly an order of magnitude, improvements in the reconstruction performance with respect to the random projections. These improvements are especially notable in the low measurement SNR regime where the energy-efficient design of optimized projections is most advantageous. In such cases, the optimized projection design departs significantly from random projections in terms of their incoherence with the representation basis. In fact, we find that the maximizing incoherence of projections with the representation basis is not necessarily optimal in the presence of additional prior information and finite measurement noise/error. We also apply the information-optimized projections to the compressive image formation problem for natural scenes, and the improved visual quality of reconstructed images with respect to random projections and other compressive measurement design affirms the overall effectiveness of the information-theoretic design framework.
Lithographic VCSEL array multimode and single mode sources for sensing and 3D imaging
Leshin, J.; Li, M.; Beadsworth, J.; Yang, X.; Zhang, Y.; Tucker, F.; Eifert, L.; Deppe, D. G.
2016-05-01
Sensing applications along with free space data links can benefit from advanced laser sources that produce novel radiation patterns and tight spectral control for optical filtering. Vertical-cavity surface-emitting lasers (VCSELs) are being developed for these applications. While oxide VCSELs are being produced by most companies, a new type of oxide-free VCSEL is demonstrating many advantages in beam pattern, spectral control, and reliability. These lithographic VCSELs offer increased power density from a given aperture size, and enable dense integration of high efficiency and single mode elements that improve beam pattern. In this paper we present results for lithographic VCSELs and describes integration into military systems for very low cost pulsed applications, as well as continuouswave applications in novel sensing applications. The VCSELs are being developed for U.S. Army for soldier weapon engagement simulation training to improve beam pattern and spectral control. Wavelengths in the 904 nm to 990 nm ranges are being developed with the spectral control designed to eliminate unwanted water absorption bands from the data links. Multiple beams and radiation patterns based on highly compact packages are being investigated for improved target sensing and transmission fidelity in free space data links. These novel features based on the new VCSEL sources are also expected to find applications in 3-D imaging, proximity sensing and motion control, as well as single mode sensors such as atomic clocks and high speed data transmission.
Distributed Compressive Sensing: A Deep Learning Approach
Palangi, Hamid; Ward, Rabab; Deng, Li
2016-09-01
Various studies that address the compressed sensing problem with Multiple Measurement Vectors (MMVs) have been recently carried. These studies assume the vectors of the different channels to be jointly sparse. In this paper, we relax this condition. Instead we assume that these sparse vectors depend on each other but that this dependency is unknown. We capture this dependency by computing the conditional probability of each entry in each vector being non-zero, given the "residuals" of all previous vectors. To estimate these probabilities, we propose the use of the Long Short-Term Memory (LSTM)[1], a data driven model for sequence modelling that is deep in time. To calculate the model parameters, we minimize a cross entropy cost function. To reconstruct the sparse vectors at the decoder, we propose a greedy solver that uses the above model to estimate the conditional probabilities. By performing extensive experiments on two real world datasets, we show that the proposed method significantly outperforms the general MMV solver (the Simultaneous Orthogonal Matching Pursuit (SOMP)) and a number of the model-based Bayesian methods. The proposed method does not add any complexity to the general compressive sensing encoder. The trained model is used just at the decoder. As the proposed method is a data driven method, it is only applicable when training data is available. In many applications however, training data is indeed available, e.g. in recorded images and videos.
Compressive sensing with a microwave photonic filter
Chen, Ying; Yu, Xianbin; Chi, Hao; Zheng, Shilie; Zhang, Xianmin; Jin, Xiaofeng; Galili, Michael
2015-03-01
In this letter, we present a novel approach to realizing photonics-assisted compressive sensing (CS) with the technique of microwave photonic filtering. In the proposed system, an input spectrally sparse signal to be captured and a random sequence are modulated on an optical carrier via two Mach-Zehnder modulators (MZMs). Therefore, the mixing process (the signal to be captured mixing with the random sequence) is realized in the optical domain. The mixed optical signal then propagates through a length of dispersive fiber. As the double-sideband modulation in a dispersive optical link leads to a frequency-dependent power fading, low-pass filtering required in the CS is then realized. A proof-of-concept experiment for compressive sampling and recovery of a signal containing three tones at 310 MHz, 1 GHz and 2 GHz with a compression factor up to 10 is successfully demonstrated. More simulation results are also presented to recover signals within wider bandwidth and with more frequency components.
Munoz, H.; Taheri, A.; Chanda, E. K.
2016-07-01
A non-contact optical method for strain measurement applying three-dimensional digital image correlation (3D DIC) in uniaxial compression is presented. A series of monotonic uniaxial compression tests under quasi-static loading conditions on Hawkesbury sandstone specimens were conducted. A prescribed constant lateral-strain rate to control the applied axial load in a closed-loop system allowed capturing the complete stress-strain behaviour of the rock, i.e. the pre-peak and post-peak stress-strain regimes. 3D DIC uses two digital cameras to acquire images of the undeformed and deformed shape of an object to perform image analysis and provides deformation and motion measurements. Observations showed that 3D DIC provides strains free from bedding error in contrast to strains from LVDT. Erroneous measurements due to the compliance of the compressive machine are also eliminated. Furthermore, by 3D DIC technique relatively large strains developed in the post-peak regime, in particular within localised zones, difficult to capture by bonded strain gauges, can be measured in a straight forward manner. Field of strains and eventual strain localisation in the rock surface were analysed by 3D DIC method, coupled with the respective stress levels in the rock. Field strain development in the rock samples, both in axial and shear strain domains suggested that strain localisation takes place progressively and develops at a lower rate in pre-peak regime. It is accelerated, otherwise, in post-peak regime associated with the increasing rate of strength degradation. The results show that a major failure plane, due to strain localisation, becomes noticeable only long after the peak stress took place. In addition, post-peak stress-strain behaviour was observed to be either in a form of localised strain in a shearing zone or inelastic unloading outside of the shearing zone.
Breaking the coherence barrier: A new theory for compressed sensing
Adcock, Ben; Hansen, Anders C.; Poon, Clarice; Roman, Bogdan
2013-01-01
This paper provides an extension of compressed sensing which bridges a substantial gap between existing theory and its current use in real-world applications. It introduces a mathematical framework that generalizes the three standard pillars of compressed sensing - namely, sparsity, incoherence and uniform random subsampling - to three new concepts: asymptotic sparsity, asymptotic incoherence and multilevel random sampling. The new theorems show that compressed sensing is also possible, and r...
FPGA Implementation of Optimal 3D-Integer DCT Structure for Video Compression
Directory of Open Access Journals (Sweden)
J. Augustin Jacob
2015-01-01
Full Text Available A novel optimal structure for implementing 3D-integer discrete cosine transform (DCT is presented by analyzing various integer approximation methods. The integer set with reduced mean squared error (MSE and high coding efficiency are considered for implementation in FPGA. The proposed method proves that the least resources are utilized for the integer set that has shorter bit values. Optimal 3D-integer DCT structure is determined by analyzing the MSE, power dissipation, coding efficiency, and hardware complexity of different integer sets. The experimental results reveal that direct method of computing the 3D-integer DCT using the integer set [10, 9, 6, 2, 3, 1, 1] performs better when compared to other integer sets in terms of resource utilization and power dissipation.
FPGA Implementation of Optimal 3D-Integer DCT Structure for Video Compression.
Jacob, J Augustin; Kumar, N Senthil
2015-01-01
A novel optimal structure for implementing 3D-integer discrete cosine transform (DCT) is presented by analyzing various integer approximation methods. The integer set with reduced mean squared error (MSE) and high coding efficiency are considered for implementation in FPGA. The proposed method proves that the least resources are utilized for the integer set that has shorter bit values. Optimal 3D-integer DCT structure is determined by analyzing the MSE, power dissipation, coding efficiency, and hardware complexity of different integer sets. The experimental results reveal that direct method of computing the 3D-integer DCT using the integer set [10, 9, 6, 2, 3, 1, 1] performs better when compared to other integer sets in terms of resource utilization and power dissipation.
Novel entropy coding and its application of the compression of 3D image and video signals
Amal, Mehanna
2013-01-01
This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University London The broadcast industry is moving future Digital Television towards Super high resolution TV (4k or 8k) and/or 3D TV. This ultimately will increase the demand on data rate and subsequently the demand for highly efficient codecs. One of the techniques that researchers found it one of the promising technologies in the industry in the next few years is 3D Integral Image and Video due to ...
Sayed, Ahmed; Layne, Ginger; Abraham, Jame; Mukdadi, Osama
2013-01-01
The main objective of this article is to introduce a new nonlinear elastography based classification method for human breast masses. Multi-compression elastography imaging is elucidated in this study to differentiate malignant from benign lesions, based on their nonlinear mechanical behavior under compression. Three classification parameters were used and compared in this work: a new nonlinear parameter based on a power-law behavior of the strain difference between breast masses and healthy t...
Optimized Projection Matrix for Compressive Sensing
Directory of Open Access Journals (Sweden)
Jianping Xu
2010-01-01
Full Text Available Compressive sensing (CS is mainly concerned with low-coherence pairs, since the number of samples needed to recover the signal is proportional to the mutual coherence between projection matrix and sparsifying matrix. Until now, papers on CS always assume the projection matrix to be a random matrix. In this paper, aiming at minimizing the mutual coherence, a method is proposed to optimize the projection matrix. This method is based on equiangular tight frame (ETF design because an ETF has minimum coherence. It is impossible to solve the problem exactly because of the complexity. Therefore, an alternating minimization type method is used to find a feasible solution. The optimally designed projection matrix can further reduce the necessary number of samples for recovery or improve the recovery accuracy. The proposed method demonstrates better performance than conventional optimization methods, which brings benefits to both basis pursuit and orthogonal matching pursuit.
Compressed sensing recovery via nonconvex shrinkage penalties
Woodworth, Joseph; Chartrand, Rick
2016-07-01
The {{\\ell }}0 minimization of compressed sensing is often relaxed to {{\\ell }}1, which yields easy computation using the shrinkage mapping known as soft thresholding, and can be shown to recover the original solution under certain hypotheses. Recent work has derived a general class of shrinkages and associated nonconvex penalties that better approximate the original {{\\ell }}0 penalty and empirically can recover the original solution from fewer measurements. We specifically examine p-shrinkage and firm thresholding. In this work, we prove that given data and a measurement matrix from a broad class of matrices, one can choose parameters for these classes of shrinkages to guarantee exact recovery of the sparsest solution. We further prove convergence of the algorithm iterative p-shrinkage (IPS) for solving one such relaxed problem.
Robust Facial Expression Recognition via Compressive Sensing
Directory of Open Access Journals (Sweden)
Shiqing Zhang
2012-03-01
Full Text Available Recently, compressive sensing (CS has attracted increasing attention in the areas of signal processing, computer vision and pattern recognition. In this paper, a new method based on the CS theory is presented for robust facial expression recognition. The CS theory is used to construct a sparse representation classifier (SRC. The effectiveness and robustness of the SRC method is investigated on clean and occluded facial expression images. Three typical facial features, i.e., the raw pixels, Gabor wavelets representation and local binary patterns (LBP, are extracted to evaluate the performance of the SRC method. Compared with the nearest neighbor (NN, linear support vector machines (SVM and the nearest subspace (NS, experimental results on the popular Cohn-Kanade facial expression database demonstrate that the SRC method obtains better performance and stronger robustness to corruption and occlusion on robust facial expression recognition tasks.
A Compressed Sensing Perspective of Hippocampal Function
Directory of Open Access Journals (Sweden)
Panagiotis ePetrantonakis
2014-08-01
Full Text Available Hippocampus is one of the most important information processing units in the brain. Input from the cortex passes through convergent axon pathways to the downstream hippocampal subregions and, after being appropriately processed, is fanned out back to the cortex. Here, we review evidence of the hypothesis that information flow and processing in the hippocampus complies with the principles of Compressed Sensing (CS. The CS theory comprises a mathematical framework that describes how and under which conditions, restricted sampling of information (data set can lead to condensed, yet concise, forms of the initial, subsampled information entity (i.e. of the original data set. In this work, hippocampus related regions and their respective circuitry are presented as a CS-based system whose different components collaborate to realize efficient memory encoding and decoding processes. This proposition introduces a unifying mathematical framework for hippocampal function and opens new avenues for exploring coding and decoding strategies in the brain.
Multichannel compressive sensing MRI using noiselet encoding.
Directory of Open Access Journals (Sweden)
Kamlesh Pawar
Full Text Available The incoherence between measurement and sparsifying transform matrices and the restricted isometry property (RIP of measurement matrix are two of the key factors in determining the performance of compressive sensing (CS. In CS-MRI, the randomly under-sampled Fourier matrix is used as the measurement matrix and the wavelet transform is usually used as sparsifying transform matrix. However, the incoherence between the randomly under-sampled Fourier matrix and the wavelet matrix is not optimal, which can deteriorate the performance of CS-MRI. Using the mathematical result that noiselets are maximally incoherent with wavelets, this paper introduces the noiselet unitary bases as the measurement matrix to improve the incoherence and RIP in CS-MRI. Based on an empirical RIP analysis that compares the multichannel noiselet and multichannel Fourier measurement matrices in CS-MRI, we propose a multichannel compressive sensing (MCS framework to take the advantage of multichannel data acquisition used in MRI scanners. Simulations are presented in the MCS framework to compare the performance of noiselet encoding reconstructions and Fourier encoding reconstructions at different acceleration factors. The comparisons indicate that multichannel noiselet measurement matrix has better RIP than that of its Fourier counterpart, and that noiselet encoded MCS-MRI outperforms Fourier encoded MCS-MRI in preserving image resolution and can achieve higher acceleration factors. To demonstrate the feasibility of the proposed noiselet encoding scheme, a pulse sequences with tailored spatially selective RF excitation pulses was designed and implemented on a 3T scanner to acquire the data in the noiselet domain from a phantom and a human brain. The results indicate that noislet encoding preserves image resolution better than Fouirer encoding.
Multichannel compressive sensing MRI using noiselet encoding.
Pawar, Kamlesh; Egan, Gary; Zhang, Jingxin
2015-01-01
The incoherence between measurement and sparsifying transform matrices and the restricted isometry property (RIP) of measurement matrix are two of the key factors in determining the performance of compressive sensing (CS). In CS-MRI, the randomly under-sampled Fourier matrix is used as the measurement matrix and the wavelet transform is usually used as sparsifying transform matrix. However, the incoherence between the randomly under-sampled Fourier matrix and the wavelet matrix is not optimal, which can deteriorate the performance of CS-MRI. Using the mathematical result that noiselets are maximally incoherent with wavelets, this paper introduces the noiselet unitary bases as the measurement matrix to improve the incoherence and RIP in CS-MRI. Based on an empirical RIP analysis that compares the multichannel noiselet and multichannel Fourier measurement matrices in CS-MRI, we propose a multichannel compressive sensing (MCS) framework to take the advantage of multichannel data acquisition used in MRI scanners. Simulations are presented in the MCS framework to compare the performance of noiselet encoding reconstructions and Fourier encoding reconstructions at different acceleration factors. The comparisons indicate that multichannel noiselet measurement matrix has better RIP than that of its Fourier counterpart, and that noiselet encoded MCS-MRI outperforms Fourier encoded MCS-MRI in preserving image resolution and can achieve higher acceleration factors. To demonstrate the feasibility of the proposed noiselet encoding scheme, a pulse sequences with tailored spatially selective RF excitation pulses was designed and implemented on a 3T scanner to acquire the data in the noiselet domain from a phantom and a human brain. The results indicate that noislet encoding preserves image resolution better than Fouirer encoding.
Multichannel compressive sensing MRI using noiselet encoding.
Pawar, Kamlesh; Egan, Gary; Zhang, Jingxin
2015-01-01
The incoherence between measurement and sparsifying transform matrices and the restricted isometry property (RIP) of measurement matrix are two of the key factors in determining the performance of compressive sensing (CS). In CS-MRI, the randomly under-sampled Fourier matrix is used as the measurement matrix and the wavelet transform is usually used as sparsifying transform matrix. However, the incoherence between the randomly under-sampled Fourier matrix and the wavelet matrix is not optimal, which can deteriorate the performance of CS-MRI. Using the mathematical result that noiselets are maximally incoherent with wavelets, this paper introduces the noiselet unitary bases as the measurement matrix to improve the incoherence and RIP in CS-MRI. Based on an empirical RIP analysis that compares the multichannel noiselet and multichannel Fourier measurement matrices in CS-MRI, we propose a multichannel compressive sensing (MCS) framework to take the advantage of multichannel data acquisition used in MRI scanners. Simulations are presented in the MCS framework to compare the performance of noiselet encoding reconstructions and Fourier encoding reconstructions at different acceleration factors. The comparisons indicate that multichannel noiselet measurement matrix has better RIP than that of its Fourier counterpart, and that noiselet encoded MCS-MRI outperforms Fourier encoded MCS-MRI in preserving image resolution and can achieve higher acceleration factors. To demonstrate the feasibility of the proposed noiselet encoding scheme, a pulse sequences with tailored spatially selective RF excitation pulses was designed and implemented on a 3T scanner to acquire the data in the noiselet domain from a phantom and a human brain. The results indicate that noislet encoding preserves image resolution better than Fouirer encoding. PMID:25965548
Compressed Sensing Electron Tomography for Determining Biological Structure
Guay, Matthew D.; Czaja, Wojciech; Aronova, Maria A.; Leapman, Richard D.
2016-06-01
There has been growing interest in applying compressed sensing (CS) theory and practice to reconstruct 3D volumes at the nanoscale from electron tomography datasets of inorganic materials, based on known sparsity in the structure of interest. Here we explore the application of CS for visualizing the 3D structure of biological specimens from tomographic tilt series acquired in the scanning transmission electron microscope (STEM). CS-ET reconstructions match or outperform commonly used alternative methods in full and undersampled tomogram recovery, but with less significant performance gains than observed for the imaging of inorganic materials. We propose that this disparity stems from the increased structural complexity of biological systems, as supported by theoretical CS sampling considerations and numerical results in simulated phantom datasets. A detailed analysis of the efficacy of CS-ET for undersampled recovery is therefore complicated by the structure of the object being imaged. The numerical nonlinear decoding process of CS shares strong connections with popular regularized least-squares methods, and the use of such numerical recovery techniques for mitigating artifacts and denoising in reconstructions of fully sampled datasets remains advantageous. This article provides a link to the software that has been developed for CS-ET reconstruction of electron tomographic data sets.
Compressed Sensing via Iterative Support Detection
Wang, Yilun
2009-01-01
We present a new compressive sensing reconstruction method "ISD". ISD addresses failed cases of L1-based construction due to insufficient measurements. ISD will learn from wrong solutions and come up with new minimization problems that return signals that are either correct or better. Specifically, from an incorrect signal ISD detects an index set I that includes components most likely to be true nonzeros, obtains a new signal x by solving min{sum_{i not in I} |x_i| : Ax = b}, and repeats such support detection and minimization using latest x and I from one another until convergence. We introduce an efficient implementation of ISD, called threshold-ISD, for recovering signals with fast decaying distributions of nonzeros from compressive measurements. Numerical experiments show that threshold-ISD has significant overall advantages over the classical L1 minimization approach, as well as two other state-of-the-art algorithms such as the iterative reweighted L1 minimization algorithm (IRL1) and the iterative rewe...
Harmony of Senses – 3D Documentaries of Herzog and Wenders
Directory of Open Access Journals (Sweden)
Turnacker Katalin
2014-09-01
Full Text Available The two still active great artists of the new German cinema, Werner Herzog and Wim Wenders, presented their 3D documentaries on the 2011 Berlinale. This coincidence, not to be neglected in itself, is more than a mere experimentation with the new technology. Indeed, it much rather reveals the complexity of perceptions coming into action during the film experience and their relationship with the onlooker. It highlights the process in which the viewer involuntarily, thoughtlessly relates to their own sensory experience. Following their feature films grounded on the visuality of the cinema experience indicative of the German New Wave, the two directors now created a documentary which draws on the synthesis of various senses and a viewer’s position focusing on perception and interpretation. This paper proposes to analyze how the harmony of senses happens on various levels, from the application of visible, audible, tangible subject motifs and modes of expression asking for various forms of perception, and all the way to the directorial perspective focusing on the viewer’s engagement.
Determining building interior structures using compressive sensing
Lagunas, Eva; Amin, Moeness G.; Ahmad, Fauzia; Nájar, Montse
2013-04-01
We consider imaging of the building interior structures using compressive sensing (CS) with applications to through-the-wall imaging and urban sensing. We consider a monostatic synthetic aperture radar imaging system employing stepped frequency waveform. The proposed approach exploits prior information of building construction practices to form an appropriate sparse representation of the building interior layout. We devise a dictionary of possible wall locations, which is consistent with the fact that interior walls are typically parallel or perpendicular to the front wall. The dictionary accounts for the dominant normal angle reflections from exterior and interior walls for the monostatic imaging system. CS is applied to a reduced set of observations to recover the true positions of the walls. Additional information about interior walls can be obtained using a dictionary of possible corner reflectors, which is the response of the junction of two walls. Supporting results based on simulation and laboratory experiments are provided. It is shown that the proposed sparsifying basis outperforms the conventional through-the-wall CS model, the wavelet sparsifying basis, and the block sparse model for building interior layout detection.
Detection Performance of Compressive Sensing Applied to Radar
Anitori, L.; Otten, M.P.G.; Hoogeboom, P.
2011-01-01
In this paper some results are presented on detection performance of radar using Compressive Sensing. Compressive sensing is a recently developed theory which allows reconstruction of sparse signals with a number of measurements much lower than implied by the Nyquist rate. In this work the behavior
Structure Assisted Compressed Sensing Reconstruction of Undersampled AFM Images
DEFF Research Database (Denmark)
Oxvig, Christian Schou; Arildsen, Thomas; Larsen, Torben
2017-01-01
The use of compressed sensing in atomic force microscopy (AFM) can potentially speed-up image acquisition, lower probe-specimen interaction, or enable super resolution imaging. The idea in compressed sensing for AFM is to spatially undersample the specimen, i.e. only acquire a small fraction...
False Alarm Probability Estimation for Compressive Sensing Radar
Anitori, L.; Otten, M.P.G.; Hoogeboom, P.
2011-01-01
In this paper false alarm probability (FAP) estimation of a radar using Compressive Sensing (CS) in the frequency domain is investigated. Compressive Sensing is a recently proposed technique which allows reconstruction of sparse signal from sub-Nyquist rate measurements. The estimation of the FAP is
3D organization of high-speed compressible jets by tomographic PIV
Violato, D.; Ceglia, G.; Tuinstra, M.; Scarano, F.
2013-01-01
This work investigates the three dimensional organization of compressible jets at high-speed regime by tomographic particle image velocimetry (TOMO PIV). Experiments are conducted at Mach numbers 0.3, 0.9 and 1.1 (underexpanded regime) across the end of the potential core within a large cylindrica
Global Solutions of the Equations of 3D Compressible Magnetohydrodynamics with Zero Resistivity
Suen, Anthony
2012-01-01
We prove the global-in-time existence of H^2 solutions of the equations of compressible magnetohydrodynamics with zero magnetic resistivity in three space dimensions. Initial data are taken to be small in H^2 modulo a constant state and initial densities are positive and essentially bounded. The present work generalizes the results obtained by Kawashima.
Compressed Sensing: How Sharp Is the Restricted Isometry Property?
Blanchard, Jeffrey D.; Cartis, Coralia; Tanner, Jared
2011-01-01
Compressed Sensing (CS) seeks to recover an unknown vector with $N$ entries by making far fewer than $N$ measurements; it posits that the number of compressed sensing measurements should be comparable to the information content of the vector, not simply $N$. CS combines the important task of compression directly with the measurement task. Since its introduction in 2004 there have been hundreds of manuscripts on CS, a large fraction of which develop algorithms to recover a signal from its comp...
Directory of Open Access Journals (Sweden)
Hong-De Li
2015-01-01
Full Text Available Background: Percutaneous vertebroplasty (PVP has been gradually used for osteoporotic vertebral compression fracture (OVCF treatment, but severe osteoporotic vertebral body compression fractures (sOVCFs due to the difficulty in performing a puncture and the characteristics of the fractured vertebrae, it has been considered as a contraindication to PVP. The aim of the following study was to evaluate the feasibility of a unilateral, three-dimensional (3D, accurate puncture in percutaneous vertebroplasty (PVP for a single, severely osteoporotic vertebral body compression fracture (ssOVCFs. Materials and Methods: 57 patients received PVP in the current study. Feasibility of a unilateral approach was judged before surgery using the 64-slice helical computed tomography (CT multiplanar reconstruction technique, a 3D accurate puncture plan was then determined. The skin bone distance, puncture angle and needle insertion depth were recorded during surgery. 2D CT rechecking was performed for any complication at day 1 after operation. Preoperative and postoperative numerical data were compared. Results: The procedure was completed smoothly in all patients. 2D CT scanning at day 1 after operation did not show any puncture related complications. Visual analog scoring (VAS showed that the score at day 3 after surgery was reduced to 1.7 ± 0.4 (0-2.9 scale from the preoperative 7.9 ± 2.1 (6.1-9.5 scale. No significant differences in measure numerical data were found before and after the surgery. At 12 months followup three patients presented with nonadjacent level fractures, VAS for other patients were 1.2 ± 0.3 (0-2.1 scale. Conclusions: Application of CT scanning for a unilateral 3D puncture design helps realize an accurate puncture in PVP. It is a safe and effective method for ssOVCFs treatment.
Plasmonic 3D-structures based on silver decorated nanotips for biological sensing
Coluccio, M. L.; Francardi, M.; Gentile, F.; Candeloro, P.; Ferrara, L.; Perozziello, G.; Di Fabrizio, E.
2016-01-01
Recent progresses in nanotechnology fabrication gives the opportunity to build highly functional nano-devices. 3D structures based on noble metals or covered by them can be realized down to the nano-scales, obtaining different devices with the functionalities of plasmonic nano-lenses or nano-probes. Here, nano-cones decorated with silver nano-grains were fabricated using advanced nano-fabrication techniques. In fabricating the cones, the angle of the apex was varied over a significant range and, in doing so, different geometries were realized. In depositing the silver nano-particles, the concentration of solution was varied, whereby different growth conditions were realized. The combined effect of tip geometry and growth conditions influences the size and distribution of the silver nano grains. The tips have the ability to guide or control the growth of the grains, in the sense that the nano-particles would preferentially distribute along the cone, and especially at the apex of the cone, with no o minor concentration effects on the substrate. The arrangement of metallic nano-particles into three-dimensional (3D) structures results in a Surface Enhanced Raman Spectroscopy (SERS) device with improved interface with analytes compared to bi-dimensional arrays of metallic nanoparticles. In the future, similar devices may find application in microfluidic devices, and in general in flow chambers, where the system can be inserted as to mimic a a nano-bait, for the recognition of specific biomarkers, or the manipulation and chemical investigation of single cells directly in native environments with good sensitivity, repeatability and selectivity.
Plasmonic 3D-structures based on silver decorated nanotips for biological sensing
Coluccio, M. L.
2015-05-01
Recent progresses in nanotechnology fabrication gives the opportunity to build highly functional nano-devices. 3D structures based on noble metals or covered by them can be realized down to the nano-scales, obtaining different devices with the functionalities of plasmonic nano-lenses or nano-probes. Here, nano-cones decorated with silver nano-grains were fabricated using advanced nano-fabrication techniques. In fabricating the cones, the angle of the apex was varied over a significant range and, in doing so, different geometries were realized. In depositing the silver nano-particles, the concentration of solution was varied, whereby different growth conditions were realized. The combined effect of tip geometry and growth conditions influences the size and distribution of the silver nano grains. The tips have the ability to guide or control the growth of the grains, in the sense that the nano-particles would preferentially distribute along the cone, and especially at the apex of the cone, with no o minor concentration effects on the substrate. The arrangement of metallic nano-particles into three-dimensional (3D) structures results in a Surface Enhanced Raman Spectroscopy (SERS) device with improved interface with analytes compared to bi-dimensional arrays of metallic nanoparticles. In the future, similar devices may find application in microfluidic devices, and in general in flow chambers, where the system can be inserted as to mimic a a nano-bait, for the recognition of specific biomarkers, or the manipulation and chemical investigation of single cells directly in native environments with good sensitivity, repeatability and selectivity. © 2015 Elsevier Ltd.
Institute of Scientific and Technical Information of China (English)
朱敏; 周小飞; 李平
2015-01-01
目的：探讨MRI 3D循环相位稳态采集快速成像（FIESTA）序列联合3D TOF MRA序列对三叉神经血管压迫的诊断价值。方法：选取以原发性三叉神经痛就诊的患者25例，均行3D FIESTA和3D TOF MRA。由2名有经验的影像诊断医师在不知道临床症状的情况下对图像进行观察，分析2种序列中三叉神经和邻近血管的走行关系，以评价2种序列联合显示神经血管压迫与临床症状的相关性。结果：20例行手术治疗，与手术结果对照，MRI对血管压迫诊断的阳性符合率为78.9%（15/19），另4例为假阳性（21.1%，4/19）；1例术前MRI诊断未见明确神经血管压迫者术中得到证实。5例术前MRI诊断无神经血管压迫的患者未行手术治疗。结论：MRI 3D FIESTA联合3D TOF MRA可清晰显示三叉神经的血管压迫情况，且与临床症状具较好相关性，可帮助临床医师进行术前评估。%Objective:To investigate the value of MRI 3D fast imaging employing steady-state (3D FIESTA) sequence combined with 3D time of flight magnetic resonance angiography (3D TOF MRA) in diagnosis of trigeminal neurovascular compression. Methods:25 cases of primary trigeminal neuralgia patients were examined by MRI (including 3D FIESTA and 3D TOF MRA). The images were reviewed by two experienced radiologists. The spatial relationships between the trigeminal nerve and adjacent vessels were overviewed,in order to evaluate the relevance between neurovascular compression and clinical symptoms. Results:20 cases were received microvacular decompression surgery. The presence of vascular compression were confirmed in 15 cases , with the positive coincidence rate of 78.9% (15/19),another 4 cases of false positive (21.1%,4/19). While the remain 1 case with diagnosis of no neurovascular compression was proved by surgery. 5 cases with preoperative MRI diagnosis of no neu-rovascular compression did not receive operation treatment. Conclusions
Numerical simulation of complex 3D compressible viscous flows through rotating blade passage
Despotović M.; Babić Milun; Milovanović D.; Šušteršič Vanja
2003-01-01
This paper describes a three-dimensional compressible Navier-Stokes code, which has been developed for analysis of turbocompressor blade rows and other internal flows. Despite numerous numerical techniques and statement that Computational Fluid Dynamics has reached state of the art, issues related to successful simulations represent valuable database of how particular technique behave for a specifie problem. This paper deals with rapid numerical method accurate enough to be used as a design ...
3D-IN LOOP FILTER FOR VIDEO COMPRESSION BASED ON MOTION COMPENSATED TEMPORAL PIXEL TRAJECTORIES
E. A. Ayele*, S. B. Dhok
2016-01-01
For H.264 standardization, the use of a deblocking filter was introduced in order to improve the quality of video compression through blocking artifacts reduction. Subsequently, the in-loop filters such as deblocking filter, sample adaptive offset, and adaptive loop filter are launched for the present HEVC standardization. However, both filters use spatial data from a frame of the video sequence only despite the fact of temporal correlation within frames. Hence, the quality of filtering proce...
Castruccio, Stefano
2015-04-02
One of the main challenges when working with modern climate model ensembles is the increasingly larger size of the data produced, and the consequent difficulty in storing large amounts of spatio-temporally resolved information. Many compression algorithms can be used to mitigate this problem, but since they are designed to compress generic scientific data sets, they do not account for the nature of climate model output and they compress only individual simulations. In this work, we propose a different, statistics-based approach that explicitly accounts for the space-time dependence of the data for annual global three-dimensional temperature fields in an initial condition ensemble. The set of estimated parameters is small (compared to the data size) and can be regarded as a summary of the essential structure of the ensemble output; therefore, it can be used to instantaneously reproduce the temperature fields in an ensemble with a substantial saving in storage and time. The statistical model exploits the gridded geometry of the data and parallelization across processors. It is therefore computationally convenient and allows to fit a non-trivial model to a data set of one billion data points with a covariance matrix comprising of 10^18 entries.
Compressed Measurements Based Spectrum Sensing for Wideband Cognitive Radio Systems
Directory of Open Access Journals (Sweden)
Taha A. Khalaf
2015-01-01
Full Text Available Spectrum sensing is the most important component in the cognitive radio (CR technology. Spectrum sensing has considerable technical challenges, especially in wideband systems where higher sampling rates are required which increases the complexity and the power consumption of the hardware circuits. Compressive sensing (CS is successfully deployed to solve this problem. Although CS solves the higher sampling rate problem, it does not reduce complexity to a large extent. Spectrum sensing via CS technique is performed in three steps: sensing compressed measurements, reconstructing the Nyquist rate signal, and performing spectrum sensing on the reconstructed signal. Compressed detectors perform spectrum sensing from the compressed measurements skipping the reconstruction step which is the most complex step in CS. In this paper, we propose a novel compressed detector using energy detection technique on compressed measurements sensed by the discrete cosine transform (DCT matrix. The proposed algorithm not only reduces the computational complexity but also provides a better performance than the traditional energy detector and the traditional compressed detector in terms of the receiver operating characteristics. We also derive closed form expressions for the false alarm and detection probabilities. Numerical results show that the analytical expressions coincide with the exact probabilities obtained from simulations.
Bar-Kochba, Eyal; Scimone, Mark T.; Estrada, Jonathan B.; Franck, Christian
2016-08-01
In the United States over 1.7 million cases of traumatic brain injury are reported yearly, but predictive correlation of cellular injury to impact tissue strain is still lacking, particularly for neuronal injury resulting from compression. Given the prevalence of compressive deformations in most blunt head trauma, this information is critically important for the development of future mitigation and diagnosis strategies. Using a 3D in vitro neuronal compression model, we investigated the role of impact strain and strain rate on neuronal lifetime, viability, and pathomorphology. We find that strain magnitude and rate have profound, yet distinctively different effects on the injury pathology. While strain magnitude affects the time of neuronal death, strain rate influences the pathomorphology and extent of population injury. Cellular injury is not initiated through localized deformation of the cytoskeleton but rather driven by excess strain on the entire cell. Furthermore we find that, mechanoporation, one of the key pathological trigger mechanisms in stretch and shear neuronal injuries, was not observed under compression.
Is "Compressed Sensing" compressive? Can it beat the Nyquist Sampling Approach?
Yaroslavsky, L
2015-01-01
Measurement redundancy required for sampling and restoration of signals/images using "Compressed sensing (sampling)" techniques is compared with that of their more traditional alternatives. It is shown that "Compressed sensing" is not more compressive than the conventional sampling and that it is inferior in this respect to other available methods of sampling with reduced redundancy such as DPCM coding or random sparse sampling and restoration of image band-limited approximations. It is also shown that assertions that "Compressed sensing" can beat the Nyquist sampling approach are rooted in misinterpretation of the sampling theory.
3D change detection in staggered voxels model for robotic sensing and navigation
Liu, Ruixu; Hampshire, Brandon; Asari, Vijayan K.
2016-05-01
3D scene change detection is a challenging problem in robotic sensing and navigation. There are several unpredictable aspects in performing scene change detection. A change detection method which can support various applications in varying environmental conditions is proposed. Point cloud models are acquired from a RGB-D sensor, which provides the required color and depth information. Change detection is performed on robot view point cloud model. A bilateral filter smooths the surface and fills the holes as well as keeps the edge details on depth image. Registration of the point cloud model is implemented by using Random Sample Consensus (RANSAC) algorithm. It uses surface normal as the previous stage for the ground and wall estimate. After preprocessing the data, we create a point voxel model which defines voxel as surface or free space. Then we create a color model which defines each voxel that has a color by the mean of all points' color value in this voxel. The preliminary change detection is detected by XOR subtract on the point voxel model. Next, the eight neighbors for this center voxel are defined. If they are neither all `changed' voxels nor all `no changed' voxels, a histogram of location and hue channel color is estimated. The experimental evaluations performed to evaluate the capability of our algorithm show promising results for novel change detection that indicate all the changing objects with very limited false alarm rate.
Estimating Unknown Sparsity in Compressed Sensing
Lopes, Miles E
2012-01-01
Within the framework of compressed sensing, many theoretical guarantees for signal reconstruction require that the number of linear measurements $n$ exceed the sparsity ||x||_0 of the unknown signal x\\in\\R^p. However, if the sparsity ||x||_0 is unknown, the choice of $n$ remains problematic. This paper considers the problem of estimating the unknown degree of sparsity of $x$ with only a small number of linear measurements. Although we show that estimation of ||x||_0 is generally intractable in this framework, we consider an alternative measure of sparsity s(x):=\\frac{\\|x\\|_1^2}{\\|x\\|_2^2}, which is a sharp lower bound on ||x||_0, and is more amenable to estimation. When $x$ is a non-negative vector, we propose a computationally efficient estimator \\hat{s}(x), and use non-asymptotic methods to bound the relative error of \\hat{s}(x) in terms of a finite number of measurements. Remarkably, the quality of estimation is \\emph{dimension-free}, which ensures that \\hat{s}(x) is well-suited to the high-dimensional reg...
Inverse lithography source optimization via compressive sensing.
Song, Zhiyang; Ma, Xu; Gao, Jie; Wang, Jie; Li, Yanqiu; Arce, Gonzalo R
2014-06-16
Source optimization (SO) has emerged as a key technique for improving lithographic imaging over a range of process variations. Current SO approaches are pixel-based, where the source pattern is designed by solving a quadratic optimization problem using gradient-based algorithms or solving a linear programming problem. Most of these methods, however, are either computational intensive or result in a process window (PW) that may be further extended. This paper applies the rich theory of compressive sensing (CS) to develop an efficient and robust SO method. In order to accelerate the SO design, the source optimization is formulated as an underdetermined linear problem, where the number of equations can be much less than the source variables. Assuming the source pattern is a sparse pattern on a certain basis, the SO problem is transformed into a l1-norm image reconstruction problem based on CS theory. The linearized Bregman algorithm is applied to synthesize the sparse optimal source pattern on a representation basis, which effectively improves the source manufacturability. It is shown that the proposed linear SO formulation is more effective for improving the contrast of the aerial image than the traditional quadratic formulation. The proposed SO method shows that sparse-regularization in inverse lithography can indeed extend the PW of lithography systems. A set of simulations and analysis demonstrate the superiority of the proposed SO method over the traditional approaches.
Compressed Sensing, Pseudodictionary-Based, Superresolution Reconstruction
Directory of Open Access Journals (Sweden)
Chun-mei Li
2016-01-01
Full Text Available The spatial resolution of digital images is the critical factor that affects photogrammetry precision. Single-frame, superresolution, image reconstruction is a typical underdetermined, inverse problem. To solve this type of problem, a compressive, sensing, pseudodictionary-based, superresolution reconstruction method is proposed in this study. The proposed method achieves pseudodictionary learning with an available low-resolution image and uses the K-SVD algorithm, which is based on the sparse characteristics of the digital image. Then, the sparse representation coefficient of the low-resolution image is obtained by solving the norm of l0 minimization problem, and the sparse coefficient and high-resolution pseudodictionary are used to reconstruct image tiles with high resolution. Finally, single-frame-image superresolution reconstruction is achieved. The proposed method is applied to photogrammetric images, and the experimental results indicate that the proposed method effectively increase image resolution, increase image information content, and achieve superresolution reconstruction. The reconstructed results are better than those obtained from traditional interpolation methods in aspect of visual effects and quantitative indicators.
Visually weighted reconstruction of compressive sensing MRI.
Oh, Heeseok; Lee, Sanghoon
2014-04-01
Compressive sensing (CS) enables the reconstruction of a magnetic resonance (MR) image from undersampled data in k-space with relatively low-quality distortion when compared to the original image. In addition, CS allows the scan time to be significantly reduced. Along with a reduction in the computational overhead, we investigate an effective way to improve visual quality through the use of a weighted optimization algorithm for reconstruction after variable density random undersampling in the phase encoding direction over k-space. In contrast to conventional magnetic resonance imaging (MRI) reconstruction methods, the visual weight, in particular, the region of interest (ROI), is investigated here for quality improvement. In addition, we employ a wavelet transform to analyze the reconstructed image in the space domain and fully utilize data sparsity over the spatial and frequency domains. The visual weight is constructed by reflecting the perceptual characteristics of the human visual system (HVS), and then applied to ℓ1 norm minimization, which gives priority to each coefficient during the reconstruction process. Using objective quality assessment metrics, it was found that an image reconstructed using the visual weight has higher local and global quality than those processed by conventional methods.
Bacterial community reconstruction using compressed sensing.
Amir, Amnon; Zuk, Or
2011-11-01
Bacteria are the unseen majority on our planet, with millions of species and comprising most of the living protoplasm. We propose a novel approach for reconstruction of the composition of an unknown mixture of bacteria using a single Sanger-sequencing reaction of the mixture. Our method is based on compressive sensing theory, which deals with reconstruction of a sparse signal using a small number of measurements. Utilizing the fact that in many cases each bacterial community is comprised of a small subset of all known bacterial species, we show the feasibility of this approach for determining the composition of a bacterial mixture. Using simulations, we show that sequencing a few hundred base-pairs of the 16S rRNA gene sequence may provide enough information for reconstruction of mixtures containing tens of species, out of tens of thousands, even in the presence of realistic measurement noise. Finally, we show initial promising results when applying our method for the reconstruction of a toy experimental mixture with five species. Our approach may have a potential for a simple and efficient way for identifying bacterial species compositions in biological samples. All supplementary data and the MATLAB code are available at www.broadinstitute.org/?orzuk/publications/BCS/.
Compressed sensing in imaging mass spectrometry
International Nuclear Information System (INIS)
Imaging mass spectrometry (IMS) is a technique of analytical chemistry for spatially resolved, label-free and multipurpose analysis of biological samples that is able to detect the spatial distribution of hundreds of molecules in one experiment. The hyperspectral IMS data is typically generated by a mass spectrometer analyzing the surface of the sample. In this paper, we propose a compressed sensing approach to IMS which potentially allows for faster data acquisition by collecting only a part of the pixels in the hyperspectral image and reconstructing the full image from this data. We present an integrative approach to perform both peak-picking spectra and denoising m/z-images simultaneously, whereas the state of the art data analysis methods solve these problems separately. We provide a proof of the robustness of the recovery of both the spectra and individual channels of the hyperspectral image and propose an algorithm to solve our optimization problem which is based on proximal mappings. The paper concludes with the numerical reconstruction results for an IMS dataset of a rat brain coronal section. (paper)
Informationally complete measurements from compressed sensing methodology
Kalev, Amir; Riofrio, Carlos; Kosut, Robert; Deutsch, Ivan
2015-03-01
Compressed sensing (CS) is a technique to faithfully estimate an unknown signal from relatively few data points when the measurement samples satisfy a restricted isometry property (RIP). Recently this technique has been ported to quantum information science to perform tomography with a substantially reduced number of measurement settings. In this work we show that the constraint that a physical density matrix is positive semidefinite provides a rigorous connection between the RIP and the informational completeness (IC) of a POVM used for state tomography. This enables us to construct IC measurements that are robust to noise using tools provided by the CS methodology. The exact recovery no longer hinges on a particular convex optimization program; solving any optimization, constrained on the cone of positive matrices, effectively results in a CS estimation of the state. From a practical point of view, we can therefore employ fast algorithms developed to handle large dimensional matrices for efficient tomography of quantum states of a large dimensional Hilbert space. Supported by the National Science Foundation.
Energy Preserved Sampling for Compressed Sensing MRI
Directory of Open Access Journals (Sweden)
Yudong Zhang
2014-01-01
Full Text Available The sampling patterns, cost functions, and reconstruction algorithms play important roles in optimizing compressed sensing magnetic resonance imaging (CS-MRI. Simple random sampling patterns did not take into account the energy distribution in k-space and resulted in suboptimal reconstruction of MR images. Therefore, a variety of variable density (VD based samplings patterns had been developed. To further improve it, we propose a novel energy preserving sampling (ePRESS method. Besides, we improve the cost function by introducing phase correction and region of support matrix, and we propose iterative thresholding algorithm (ITA to solve the improved cost function. We evaluate the proposed ePRESS sampling method, improved cost function, and ITA reconstruction algorithm by 2D digital phantom and 2D in vivo MR brains of healthy volunteers. These assessments demonstrate that the proposed ePRESS method performs better than VD, POWER, and BKO; the improved cost function can achieve better reconstruction quality than conventional cost function; and the ITA is faster than SISTA and is competitive with FISTA in terms of computation time.
Numerical Modeling of 2-D and 3-D Flows using Artificial Compressibility Method and Collocated Mesh
Directory of Open Access Journals (Sweden)
Yasin Aghaee-Shalmani
2016-01-01
Full Text Available In this paper, applications of a numerical model on simulation of two and three-dimensional ﬂows are presented. This model solves Navier-Stokes equations using ﬁnite volume method and large eddy simulation (LES in a collocated mesh. Artiﬁcial compressibility method with dual t ime stepping is used to solve the time dependent equations. Also a modiﬁed m omentum i nterpolation method (MIM based on the unsteady ﬂows i s deployed t o overcome t he non-physical pressure oscillation. Capability of the presented numerical code for ﬂow s imulation, i s a ssessed by a pplication f or twodimensional square and three-dimensional lid-driven cavity ﬂows. Numerical r esults of cavity ﬂow presents very good agreement with the numerical and experimental data of other existent researches.
Can compressed sensing beat the Nyquist sampling rate?
Yaroslavsky, L
2015-01-01
Data saving capability of "Compressed sensing (sampling)" in signal discretization is disputed and found to be far below the theoretical upper bound defined by the signal sparsity. On a simple and intuitive example, it is demonstrated that, in a realistic scenario for signals that are believed to be sparse, one can achieve a substantially larger saving than compressing sensing can. It is also shown that frequent assertions in the literature that "Compressed sensing" can beat the Nyquist sampling approach are misleading substitution of terms and are rooted in misinterpretation of the sampling theory.
Reducing disk storage of full-3D seismic waveform tomography (F3DT) through lossy online compression
Lindstrom, Peter; Chen, Po; Lee, En-Jui
2016-08-01
Full-3D seismic waveform tomography (F3DT) is the latest seismic tomography technique that can assimilate broadband, multi-component seismic waveform observations into high-resolution 3D subsurface seismic structure models. The main drawback in the current F3DT implementation, in particular the scattering-integral implementation (F3DT-SI), is the high disk storage cost and the associated I/O overhead of archiving the 4D space-time wavefields of the receiver- or source-side strain tensors. The strain tensor fields are needed for computing the data sensitivity kernels, which are used for constructing the Jacobian matrix in the Gauss-Newton optimization algorithm. In this study, we have successfully integrated a lossy compression algorithm into our F3DT-SI workflow to significantly reduce the disk space for storing the strain tensor fields. The compressor supports a user-specified tolerance for bounding the error, and can be integrated into our finite-difference wave-propagation simulation code used for computing the strain fields. The decompressor can be integrated into the kernel calculation code that reads the strain fields from the disk and compute the data sensitivity kernels. During the wave-propagation simulations, we compress the strain fields before writing them to the disk. To compute the data sensitivity kernels, we read the compressed strain fields from the disk and decompress them before using them in kernel calculations. Experiments using a realistic dataset in our California statewide F3DT project have shown that we can reduce the strain-field disk storage by at least an order of magnitude with acceptable loss, and also improve the overall I/O performance of the entire F3DT-SI workflow significantly. The integration of the lossy online compressor may potentially open up the possibilities of the wide adoption of F3DT-SI in routine seismic tomography practices in the near future.
Numerical simulation of complex 3D compressible viscous flows through rotating blade passage
Directory of Open Access Journals (Sweden)
Despotović M.
2003-01-01
Full Text Available This paper describes a three-dimensional compressible Navier-Stokes code, which has been developed for analysis of turbocompressor blade rows and other internal flows. Despite numerous numerical techniques and statement that Computational Fluid Dynamics has reached state of the art, issues related to successful simulations represent valuable database of how particular technique behave for a specifie problem. This paper deals with rapid numerical method accurate enough to be used as a design tool. The mathematical model is based on System of Favre averaged Navier-Stokes equations that are written in relative frame of reference, which rotates with constant angular velocity around axis of rotation. The governing equations are solved using finite volume method applied on structured grids. The numerical procedure is based on the explicit multistage Runge-Kutta scheme that is coupled with modem numerical procedures for convergence acceleration. To demonstrate the accuracy of the described numerical method developed software is applied to numerical analysis of flow through impeller of axial turbocompressor, and obtained results are compared with available experimental data.
DEFF Research Database (Denmark)
Canali, Chiara; Mazzoni, Chiara; Larsen, Layla Bashir;
2015-01-01
) cells were encapsulated in gelatin to form artificial 3D cell constructs and detected when placed in different positions inside large gelatin scaffolds. Taken together, these results open new perspectives for impedance-based sensing technologies for non-invasive monitoring in tissue engineering...
Joint Sparsity and Frequency Estimation for Spectral Compressive Sensing
DEFF Research Database (Denmark)
Nielsen, Jesper Kjær; Christensen, Mads Græsbøll; Jensen, Søren Holdt
2014-01-01
Parameter estimation from compressively sensed signals has recently received some attention. We here also consider this problem in the context of frequency sparse signals which are encountered in many application. Existing methods perform the estimation using finite dictionaries or incorporate...
Ideas for underwater 3D sonar range sensing and environmental modeling
Directory of Open Access Journals (Sweden)
Per G. Auran
1996-01-01
Full Text Available A 3D spatial grid for exploiting the range and direction information inherent in sonar range data is presented. Special attention is given to the realtime performance of this representation, i.e. it should be a feasible way of representing the 3D range data acquired by an operating AUV.
Jinesh, Mathew; MacPherson, William N.; Hand, Duncan P.; Maier, Robert R. J.
2016-05-01
A smart metal component having the potential for high temperature strain sensing capability is reported. The stainless steel (SS316) structure is made by selective laser melting (SLM). A fiber Bragg grating (FBG) is embedded in to a 3D printed U-groove by high temperature brazing using a silver based alloy, achieving an axial FBG compression of 13 millistrain at room temperature. Initial results shows that the test component can be used for up to 700°C for sensing applications.
Adaptive Compressive Spectrum Sensing for Wideband Cognitive Radios
Sun, Hongjian; Chiu, Wei-Yu; Nallanathan, A.
2013-01-01
This letter presents an adaptive spectrum sensing algorithm that detects wideband spectrum using sub-Nyquist sampling rates. By taking advantage of compressed sensing (CS), the proposed algorithm reconstructs the wideband spectrum from compressed samples. Furthermore, an l2 norm validation approach is proposed that enables cognitive radios (CRs) to automatically terminate the signal acquisition once the current spectral recovery is satisfactory, leading to enhanced CR throughput. Numerical re...
Encryption of Messages and Images Using Compressed Sensing
Daňková, M.
2015-01-01
The article deals with compressed sensing used to encrypt data. It allows performing signal capturing, its compression and encryption at the same time. The measurement matrix is generated using a secret key and is exploited for encryption. The article shows an example of its utilization at text and image message, moreover the Arnold transform is used in colour images for increasing security.
Characterization of 3D printing output using an optical sensing system
Straub, Jeremy
2015-05-01
This paper presents the experimental design and initial testing of a system to characterize the progress and performance of a 3D printer. The system is based on five Raspberry Pi single-board computers. It collects images of the 3D printed object, which are compared to an ideal model. The system, while suitable for printers of all sizes, can potentially be produced at a sufficiently low cost to allow its incorporation into consumer-grade printers. The efficacy and accuracy of this system is presented and discussed. The paper concludes with a discussion of the benefits of being able to characterize 3D printer performance.
National Aeronautics and Space Administration — Eye safe 3D Imaging LIDARS when combined with advanced very high sensitivity, large format receivers can provide a robust wide area search capability in a very...
Li-bo Zhang; Zhi-liang Zhu; Ben-qiang Yang; Wen-yuan Liu; Hong-feng Zhu; Ming-yu Zou
2015-01-01
This paper presents a solution to satisfy the increasing requirements for secure medical image transmission and storage over public networks. The proposed scheme can simultaneously encrypt and compress the medical image using compressive sensing (CS) and pixel swapping based permutation approach. In the CS phase, the plain image is compressed and encrypted by chaos-based Bernoulli measurement matrix, which is generated under the control of the introduced Chebyshev map. The quantized measureme...
Compression and Encryption of Search Survey Gamma Spectra using Compressive Sensing
Heifetz, Alexander
2014-01-01
We have investigated the application of Compressive Sensing (CS) computational method to simultaneous compression and encryption of gamma spectra measured with NaI(Tl) detector during wide area search survey applications. Our numerical experiments have demonstrated secure encryption and nearly lossless recovery of gamma spectra coded and decoded with CS routines.
Spread spectrum compressed sensing MRI using chirp radio frequency pulses
Qu, Xiaobo; Zhuang, Xiaoxing; Yan, Zhiyu; Guo, Di; Chen, Zhong
2013-01-01
Compressed sensing has shown great potential in reducing data acquisition time in magnetic resonance imaging (MRI). Recently, a spread spectrum compressed sensing MRI method modulates an image with a quadratic phase. It performs better than the conventional compressed sensing MRI with variable density sampling, since the coherence between the sensing and sparsity bases are reduced. However, spread spectrum in that method is implemented via a shim coil which limits its modulation intensity and is not convenient to operate. In this letter, we propose to apply chirp (linear frequency-swept) radio frequency pulses to easily control the spread spectrum. To accelerate the image reconstruction, an alternating direction algorithm is modified by exploiting the complex orthogonality of the quadratic phase encoding. Reconstruction on the acquired data demonstrates that more image features are preserved using the proposed approach than those of conventional CS-MRI.
Tu, Jihui; Sui, Haigang; Feng, Wenqing; Song, Zhina
2016-06-01
In this paper, a novel approach of building damaged detection is proposed using high resolution remote sensing images and 3D GIS-Model data. Traditional building damage detection method considers to detect damaged building due to earthquake, but little attention has been paid to analyze various building damaged types(e.g., trivial damaged, severely damaged and totally collapsed.) Therefore, we want to detect the different building damaged type using 2D and 3D feature of scenes because the real world we live in is a 3D space. The proposed method generalizes that the image geometric correction method firstly corrects the post-disasters remote sensing image using the 3D GIS model or RPC parameters, then detects the different building damaged types using the change of the height and area between the pre- and post-disasters and the texture feature of post-disasters. The results, evaluated on a selected study site of the Beichuan earthquake ruins, Sichuan, show that this method is feasible and effective in building damage detection. It has also shown that the proposed method is easily applicable and well suited for rapid damage assessment after natural disasters.
Conroy, Parker; Bareiss, Daman; Beall, Matt; Berg, Jur van den
2014-01-01
In this paper, we present an implementation of 3-D reciprocal collision avoidance on real quadrotor helicopters where each quadrotor senses the relative position and velocity of other quadrotors using an on-board camera. We show that using our approach, quadrotors are able to successfully avoid pairwise collisions in GPS and motion-capture denied environments, without communication between the quadrotors, and even when human operators deliberately attempt to induce collisions. To our knowledg...
基于3D-DCT视频压缩编码的算法改进%Improvement of 3D-DCT Video Compression Algorithm
Institute of Scientific and Technical Information of China (English)
龙志方; 都思丹
2003-01-01
基于3D-DCT的视频压缩方法具有计算简单并且编解码结构对称的优点,对实现移动条件下的实时视频通信具有极大的潜力.文中给出一种简单有效的由JPEG推荐量化表生成三维量化矩阵的方法,并通过分类处理和直流帧差分的办法在降低运算量的同时提高了压缩比.
Compressive sensing by learning a Gaussian mixture model from measurements.
Yang, Jianbo; Liao, Xuejun; Yuan, Xin; Llull, Patrick; Brady, David J; Sapiro, Guillermo; Carin, Lawrence
2015-01-01
Compressive sensing of signals drawn from a Gaussian mixture model (GMM) admits closed-form minimum mean squared error reconstruction from incomplete linear measurements. An accurate GMM signal model is usually not available a priori, because it is difficult to obtain training signals that match the statistics of the signals being sensed. We propose to solve that problem by learning the signal model in situ, based directly on the compressive measurements of the signals, without resorting to other signals to train a model. A key feature of our method is that the signals being sensed are treated as random variables and are integrated out in the likelihood. We derive a maximum marginal likelihood estimator (MMLE) that maximizes the likelihood of the GMM of the underlying signals given only their linear compressive measurements. We extend the MMLE to a GMM with dominantly low-rank covariance matrices, to gain computational speedup. We report extensive experimental results on image inpainting, compressive sensing of high-speed video, and compressive hyperspectral imaging (the latter two based on real compressive cameras). The results demonstrate that the proposed methods outperform state-of-the-art methods by significant margins.
DEFF Research Database (Denmark)
Muhammad, Haseena Bashir; Canali, Chiara; Heiskanen, Arto;
2014-01-01
We present an 8-channel bioreactor array with integrated bioimpedance sensors, which enables perfusion culture of cells seeded onto porous 3D scaffolds. Results show the capability of the system for monitoring cell proliferation within the scaffolds through a culture period of 19 days....
Discovery of a quorum sensing modulator pharmacophore by 3D small-molecule microarray screening
DEFF Research Database (Denmark)
Marsden, David M; Nicholson, Rebecca L; Skindersoe, Mette E;
2010-01-01
ligand-binding domains of the LuxR homolog CarR from Erwinia carotovora subsp. carotovora. The 3D microarray platform was used to discover the biologically active chloro-pyridine pharmacophore, which was validated using a fluorometric ligand binding assay and ITC. Analogs containing the chloro...
Muhammad, Haseena Bashir; Canali, Chiara; Heiskanen, Arto; Hemmingsen, Mette; Wolff, Anders; Dufva, Martin; Emnéus, Jenny
2014-01-01
We present an 8-channel bioreactor array with integrated bioimpedance sensors, which enables perfusion culture of cells seeded onto porous 3D scaffolds. Results show the capability of the system for monitoring cell proliferation within the scaffolds through a culture period of 19 days.
Parallel computing of patch-based nonlocal operator and its application in compressed sensing MRI.
Li, Qiyue; Qu, Xiaobo; Liu, Yunsong; Guo, Di; Ye, Jing; Zhan, Zhifang; Chen, Zhong
2014-01-01
Magnetic resonance imaging has been benefited from compressed sensing in improving imaging speed. But the computation time of compressed sensing magnetic resonance imaging (CS-MRI) is relatively long due to its iterative reconstruction process. Recently, a patch-based nonlocal operator (PANO) has been applied in CS-MRI to significantly reduce the reconstruction error by making use of self-similarity in images. But the two major steps in PANO, learning similarities and performing 3D wavelet transform, require extensive computations. In this paper, a parallel architecture based on multicore processors is proposed to accelerate computations of PANO. Simulation results demonstrate that the acceleration factor approaches the number of CPU cores and overall PANO-based CS-MRI reconstruction can be accomplished in several seconds. PMID:24963335
Parallel Computing of Patch-Based Nonlocal Operator and Its Application in Compressed Sensing MRI
Directory of Open Access Journals (Sweden)
Qiyue Li
2014-01-01
Full Text Available Magnetic resonance imaging has been benefited from compressed sensing in improving imaging speed. But the computation time of compressed sensing magnetic resonance imaging (CS-MRI is relatively long due to its iterative reconstruction process. Recently, a patch-based nonlocal operator (PANO has been applied in CS-MRI to significantly reduce the reconstruction error by making use of self-similarity in images. But the two major steps in PANO, learning similarities and performing 3D wavelet transform, require extensive computations. In this paper, a parallel architecture based on multicore processors is proposed to accelerate computations of PANO. Simulation results demonstrate that the acceleration factor approaches the number of CPU cores and overall PANO-based CS-MRI reconstruction can be accomplished in several seconds.
Parallel computing of patch-based nonlocal operator and its application in compressed sensing MRI.
Li, Qiyue; Qu, Xiaobo; Liu, Yunsong; Guo, Di; Ye, Jing; Zhan, Zhifang; Chen, Zhong
2014-01-01
Magnetic resonance imaging has been benefited from compressed sensing in improving imaging speed. But the computation time of compressed sensing magnetic resonance imaging (CS-MRI) is relatively long due to its iterative reconstruction process. Recently, a patch-based nonlocal operator (PANO) has been applied in CS-MRI to significantly reduce the reconstruction error by making use of self-similarity in images. But the two major steps in PANO, learning similarities and performing 3D wavelet transform, require extensive computations. In this paper, a parallel architecture based on multicore processors is proposed to accelerate computations of PANO. Simulation results demonstrate that the acceleration factor approaches the number of CPU cores and overall PANO-based CS-MRI reconstruction can be accomplished in several seconds.
Implementation of compressed sensing in telecardiology sensor networks.
Correia Pinheiro, Eduardo; Postolache, Octavian Adrian; Silva Girão, Pedro
2010-01-01
Mobile solutions for patient cardiac monitoring are viewed with growing interest, and improvements on current implementations are frequently reported, with wireless, and in particular, wearable devices promising to achieve ubiquity. However, due to unavoidable power consumption limitations, the amount of data acquired, processed, and transmitted needs to be diminished, which is counterproductive, regarding the quality of the information produced. Compressed sensing implementation in wireless sensor networks (WSNs) promises to bring gains not only in power savings to the devices, but also with minor impact in signal quality. Several cardiac signals have a sparse representation in some wavelet transformations. The compressed sensing paradigm states that signals can be recovered from a few projections into another basis, incoherent with the first. This paper evaluates the compressed sensing paradigm impact in a cardiac monitoring WSN, discussing the implications in data reliability, energy management, and the improvements accomplished by in-network processing. PMID:20885973
Compressed Sensing for Moving Imagery in Medical Imaging
Bilen, Cagdas; Selesnick, Ivan
2012-01-01
Numerous applications in signal processing have benefited from the theory of compressed sensing which shows that it is possible to reconstruct signals sampled below the Nyquist rate when certain conditions are satisfied. One of these conditions is that there exists a known transform that represents the signal with a sufficiently small number of non-zero coefficients. However when the signal to be reconstructed is composed of moving images or volumes, it is challenging to form such regularization constraints with traditional transforms such as wavelets. In this paper, we present a motion compensating prior for such signals that is derived directly from the optical flow constraint and can utilize the motion information during compressed sensing reconstruction. Proposed regularization method can be used in a wide variety of applications involving compressed sensing and images or volumes of moving and deforming objects. It is also shown that it is possible to estimate the signal and the motion jointly or separate...
Imaging industry expectations for compressed sensing in MRI
King, Kevin F.; Kanwischer, Adriana; Peters, Rob
2015-09-01
Compressed sensing requires compressible data, incoherent acquisition and a nonlinear reconstruction algorithm to force creation of a compressible image consistent with the acquired data. MRI images are compressible using various transforms (commonly total variation or wavelets). Incoherent acquisition of MRI data by appropriate selection of pseudo-random or non-Cartesian locations in k-space is straightforward. Increasingly, commercial scanners are sold with enough computing power to enable iterative reconstruction in reasonable times. Therefore integration of compressed sensing into commercial MRI products and clinical practice is beginning. MRI frequently requires the tradeoff of spatial resolution, temporal resolution and volume of spatial coverage to obtain reasonable scan times. Compressed sensing improves scan efficiency and reduces the need for this tradeoff. Benefits to the user will include shorter scans, greater patient comfort, better image quality, more contrast types per patient slot, the enabling of previously impractical applications, and higher throughput. Challenges to vendors include deciding which applications to prioritize, guaranteeing diagnostic image quality, maintaining acceptable usability and workflow, and acquisition and reconstruction algorithm details. Application choice depends on which customer needs the vendor wants to address. The changing healthcare environment is putting cost and productivity pressure on healthcare providers. The improved scan efficiency of compressed sensing can help alleviate some of this pressure. Image quality is strongly influenced by image compressibility and acceleration factor, which must be appropriately limited. Usability and workflow concerns include reconstruction time and user interface friendliness and response. Reconstruction times are limited to about one minute for acceptable workflow. The user interface should be designed to optimize workflow and minimize additional customer training. Algorithm
Polymer optical fibers integrated directly into 3D orthogonal woven composites for sensing
Hamouda, Tamer; Seyam, Abdel-Fattah M.; Peters, Kara
2015-02-01
This study demonstrates that standard polymer optical fibers (POF) can be directly integrated into composites from 3D orthogonal woven preforms during the weaving process and then serve as in-situ sensors to detect damage due to bending or impact loads. Different composite samples with embedded POF were fabricated of 3D orthogonal woven composites with different parameters namely number of y-/x-layers and x-yarn density. The signal of POF was not affected significantly by the preform structure. During application of resin using VARTM technique, significant drop in backscattering level was observed due to pressure caused by vacuum on the embedded POF. Measurements of POF signal while in the final composites after resin cure indicated that the backscattering level almost returned to the original level of un-embedded POF. The POF responded to application of bending and impact loads to the composite with a reduction in the backscattering level. The backscattering level almost returned back to its original level after removing the bending load until damage was present in the composite. Similar behavior occurred due to impact events. As the POF itself is used as the sensor and can be integrated throughout the composite, large sections of future 3D woven composite structures could be monitored without the need for specialized sensors or complex instrumentation.
3D Analysis of Remote-Sensed Heliospheric Data for Space Weather Forecasting
Yu, H. S.; Jackson, B. V.; Hick, P. P.; Buffington, A.; Bisi, M. M.; Odstrcil, D.; Hong, S.; Kim, J.; Yi, J.; Tokumaru, M.; Gonzalez-Esparza, A.
2015-12-01
The University of California, San Diego (UCSD) time-dependent iterative kinematic reconstruction technique has been used and expanded upon for over two decades. It currently provides some of the most accurate predictions and three-dimensional (3D) analyses of heliospheric solar-wind parameters now available using interplanetary scintillation (IPS) data. The parameters provided include reconstructions of velocity, density, and magnetic fields. Precise time-dependent results are obtained at any solar distance in the inner heliosphere using current Solar-Terrestrial Environment Laboratory (STELab), Nagoya University, Japan IPS data sets, but the reconstruction technique can also incorporate data from other IPS systems from around the world. With access using world IPS data systems, not only can predictions using the reconstruction technique be made without observation dead times due to poor longitude coverage or system outages, but the program can itself be used to standardize observations of IPS. Additionally, these analyses are now being exploited as inner-boundary values to drive an ENLIL 3D-MHD heliospheric model in real time. A major potential of this is that it will use the more realistic physics of 3D-MHD modeling to provide an automatic forecast of CMEs and corotating structures up to several days in advance of the event/features arriving at Earth, with or without involving coronagraph imagery or the necessity of magnetic fields being used to provide the background solar wind speeds.
Optical frequency comb interference profilometry using compressive sensing.
Pham, Quang Duc; Hayasaki, Yoshio
2013-08-12
We describe a new optical system using an ultra-stable mode-locked frequency comb femtosecond laser and compressive sensing to measure an object's surface profile. The ultra-stable frequency comb laser was used to precisely measure an object with a large depth, over a wide dynamic range. The compressive sensing technique was able to obtain the spatial information of the object with two single-pixel fast photo-receivers, with no mechanical scanning and fewer measurements than the number of sampling points. An optical experiment was performed to verify the advantages of the proposed method.
The Application of Compressive Sensing on Spectra De-noising
Directory of Open Access Journals (Sweden)
Mingxia Xiao
2013-10-01
Full Text Available Through the analyzing of limitations on wavelet threshold filter de-noising, this paper applies wavelet filter based on compressed sensing to reduce the signal noise of spectral signals, and compares the two methods through experiments. The results of experiments shown that the wavelet filter based on compressed sensing can effectively reduce the signal noise of spectral signal. The de-noising effect of the method is better than that of wavelet filter. The method provides a new approach for reducing the signal noise of spectral signals.
Compressed wideband spectrum sensing based on discrete cosine transform.
Wang, Yulin; Zhang, Gengxin
2014-01-01
Discrete cosine transform (DCT) is a special type of transform which is widely used for compression of speech and image. However, its use for spectrum sensing has not yet received widespread attention. This paper aims to alleviate the sampling requirements of wideband spectrum sensing by utilizing the compressive sampling (CS) principle and exploiting the unique sparsity structure in the DCT domain. Compared with discrete Fourier transform (DFT), wideband communication signal has much sparser representation and easier implementation in DCT domain. Simulation result shows that the proposed DCT-CSS scheme outperforms the conventional DFT-CSS scheme in terms of MSE of reconstruction signal, detection probability, and computational complexity.
Compressed Wideband Spectrum Sensing Based on Discrete Cosine Transform
Directory of Open Access Journals (Sweden)
Yulin Wang
2014-01-01
Full Text Available Discrete cosine transform (DCT is a special type of transform which is widely used for compression of speech and image. However, its use for spectrum sensing has not yet received widespread attention. This paper aims to alleviate the sampling requirements of wideband spectrum sensing by utilizing the compressive sampling (CS principle and exploiting the unique sparsity structure in the DCT domain. Compared with discrete Fourier transform (DFT, wideband communication signal has much sparser representation and easier implementation in DCT domain. Simulation result shows that the proposed DCT-CSS scheme outperforms the conventional DFT-CSS scheme in terms of MSE of reconstruction signal, detection probability, and computational complexity.
Ring artifacts correction in compressed sensing tomographic reconstruction
Paleo, Pierre
2015-01-01
We present a novel approach to handle ring artifacts correction in compressed sensing tomographic reconstruction. The correction is part of the reconstruction process, which differs from classical sinogram pre-processing and image post-processing techniques. The principle of compressed sensing tomographic reconstruction is presented. Then, we show that the ring artifacts correction can be integrated in the reconstruction problem formalism. We provide numerical results for both simulated and real data. This technique is included in the PyHST2 code which is used at the European Synchrotron Radiation Facility for tomographic reconstruction.
Compressive sensing of frequency-hopping spread spectrum signals
Liu, Feng; Kim, Yookyung; Goodman, Nathan A.; Ashok, Amit; Bilgin, Ali
2012-06-01
In this paper, compressive sensing strategies for interception of Frequency-Hopping Spread Spectrum (FHSS) signals are introduced. Rapid switching of the carrier among many frequency channels using a pseudorandom sequence (unknown to the eavesdropper) makes FHSS signals dicult to intercept. The conventional approach to intercept FHSS signals necessitates capturing of all frequency channels and, thus, requires the Analog-to-Digital Converters (ADCs) to sample at very high rates. Using the fact that the FHSS signals have sparse instanta- neous spectra, we propose compressive sensing strategies for their interception. The proposed techniques are validated using Gaussian Frequency-Shift Keying (GFSK) modulated FHSS signals as dened by the Bluetooth specication.
Benchmarking Compressed Sensing, Super-Resolution, and Filter Diagonalization
Markovich, Thomas; Sanders, Jacob N; Aspuru-Guzik, Alan
2015-01-01
Signal processing techniques have been developed that use different strategies to bypass the Nyquist sampling theorem in order to recover more information than a traditional discrete Fourier transform. Here we examine three such methods: filter diagonalization, compressed sensing, and super-resolution. We apply them to a broad range of signal forms commonly found in science and engineering in order to discover when and how each method can be used most profitably. We find that filter diagonalization provides the best results for Lorentzian signals, while compressed sensing and super-resolution perform better for arbitrary signals.
Compressed Sensing for Thoracic MRI with Partial Random Circulant Matrices
Directory of Open Access Journals (Sweden)
Hideaki Haneishi
2012-03-01
Full Text Available The use of Circulant matrix as the sensing matrix in compressed sensing (CS scheme has recently been proposed to overcome the limitation of random or partial Fourier matrices. Aside from reducing computational complexity, the use of circulant matrix for MR image offers the feasibility in hardware implementations. This paper presents the simulation of compressed sensing for thoracic MR imaging with circulant matrix as the sensing matrix. The comparisons of reconstruction of three different type MR images using circulant matrix are investigated in term of number of samples, number of iteration and signal to noise ratio (SNR. The simulation results showed that Circulant Matrix works efficiently for encoding the MR image of respiratory organ, especially for smooth and sparse image in spatial domain.
When 'exact recovery' is exact recovery in compressed sensing simulation
DEFF Research Database (Denmark)
Sturm, Bob L.
2012-01-01
In a simulation of compressed sensing (CS), one must test whether the recovered solution \\(\\vax\\) is the true solution \\(\\vx\\), i.e., ``exact recovery.'' Most CS simulations employ one of two criteria: 1) the recovered support is the true support; or 2) the normalized squared error is less than...... for a given distribution of \\(\\vx\\)? We show that, in a best case scenario, \\(\\epsilon^2\\) sets a maximum allowed missed detection rate in a majority sense....
Parallel Implementation of Compressed Sensing Algorithm on CUDA- GPU
Directory of Open Access Journals (Sweden)
Kuldeep Yadav
2011-03-01
Full Text Available In the field of biomedical imaging, compressed sensing (CS plays an important role because compressed sensing, a joint compression and sensing process, is an emerging field of activity in which the signal is sampled and simultaneously compressed at a greatly reduced rate. Compressed sensing is a new paradigm for signal, image and function acquisition. In this paper we have worked on Basis Pursuit Algorithm for compressed sensing. We have computed time for running this algorithm on CPU with Intel® Core™2Duo T8100 @ 2.1GHz and 3.0 GB of main memory which run on Windows XP. The next step was to convert this code in GPU format i.e. to run this program on GPU NVIDIA GeForce series 8400m GS model having 256 MB of video memory of DDR2 type and bus width of 64bit. The graphic driver we used is of 197.15 series of NVIDIA. Both the CPU and GPU version of algorithm is being implemented on the Matlab R2008b. The CPU version of the algorithm is being analyzed in simple Matlab but the GPU version is being implemented with the help of intermediate software JACKET V1.3. For using Jacket, we have to make some changes in our source code so to make the CPU and GPU to work simultaneously and thus reducing the overall computational acceleration of the algorithm. Graphic Processing Units (GPUs are emerging as powerful parallel systems at a cheap cost of a few thousand rupees. We got the speed up around 8X, for most of the Biomedical images and six of them have been included in this paper, which can be analyzed via the profiler.
Baumberger, Roland; Wehrens, Philip; Herwegh, Marco
2013-04-01
Geological 3D models are always just an approximation of a complex natural situation. This is especially true in regions, where hard underground data (e.g. bore holes, tunnel mappings and seismic data) is lacking. One of the key problems while developing valid geological 3D models is the three-dimensional spatial distribution of geological structures, particularly with increasing distance from the surface. In our study, we investigate the Alpine 3D Deformation of the crystalline rocks of the Aar massif (Haslital valley, Central Switzerland). Deformation in this area is dominated by different sets of large-scale shear zones, which acted under both ductile and brittle deformation conditions. The goal of our study is the prediction of the geometry and the evolution of the structures in 3D space and time. A key point in our project is the generation of a reliable 3D model of today's structures. In this sense, estimation of the reliability of the surface information for the extrapolation to depth is mandatory. Based on our data, a method will be presented that contributes to a possible solution of the questions addressed above. The basic idea consists of the fact that (i) mechanical anisotropies as shear zones and faults show prominent three-dimensional information in the landscape, (ii) these geometries can be used as input data for a geological 3D model and (iii) that the 3D information mentioned allows a projection to depth. As a great advantage of the study area, a large number of underground tunnels exist, which allow to evaluate the quality of the aforementioned extrapolations. The method is based on a combined remote-sensing and field work approach: morphological incisions recognized on digital elevation models as well as on aerial photos on the computer screen were evaluated, described and attributed in detail in the field. Our approach is based on a six step workflow: (1) Elaboration of a large-scale structural map of geological structures by means of remote-sensing
McIDAS-V: Advanced Visualization for 3D Remote Sensing Data
Rink, T.; Achtor, T. H.
2010-12-01
McIDAS-V is a Java-based, open-source, freely available software package for analysis and visualization of geophysical data. Its advanced capabilities provide very interactive 4-D displays, including 3D volumetric rendering and fast sub-manifold slicing, linked to an abstract mathematical data model with built-in metadata for units, coordinate system transforms and sampling topology. A Jython interface provides user defined analysis and computation in terms of the internal data model. These powerful capabilities to integrate data, analysis and visualization are being applied to hyper-spectral sounding retrievals, eg. AIRS and IASI, of moisture and cloud density to interrogate and analyze their 3D structure, as well as, validate with instruments such as CALIPSO, CloudSat and MODIS. The object oriented framework design allows for specialized extensions for novel displays and new sources of data. Community defined CF-conventions for gridded data are understood by the software, and can be immediately imported into the application. This presentation will show examples how McIDAS-V is used in 3-dimensional data analysis, display and evaluation.
Effects of 3D geometries on cellular gradient sensing and polarization
Spill, Fabian; Andasari, Vivi; Mak, Michael; Kamm, Roger D.; Zaman, Muhammad H.
2016-06-01
During cell migration, cells become polarized, change their shape, and move in response to various internal and external cues. Cell polarization is defined through the spatio-temporal organization of molecules such as PI3K or small GTPases, and is determined by intracellular signaling networks. It results in directional forces through actin polymerization and myosin contractions. Many existing mathematical models of cell polarization are formulated in terms of reaction–diffusion systems of interacting molecules, and are often defined in one or two spatial dimensions. In this paper, we introduce a 3D reaction–diffusion model of interacting molecules in a single cell, and find that cell geometry has an important role affecting the capability of a cell to polarize, or change polarization when an external signal changes direction. Our results suggest a geometrical argument why more roundish cells can repolarize more effectively than cells which are elongated along the direction of the original stimulus, and thus enable roundish cells to turn faster, as has been observed in experiments. On the other hand, elongated cells preferentially polarize along their main axis even when a gradient stimulus appears from another direction. Furthermore, our 3D model can accurately capture the effect of binding and unbinding of important regulators of cell polarization to and from the cell membrane. This spatial separation of membrane and cytosol, not possible to capture in 1D or 2D models, leads to marked differences of our model from comparable lower-dimensional models.
Effects of 3D geometries on cellular gradient sensing and polarization
Spill, Fabian; Andasari, Vivi; Mak, Michael; Kamm, Roger D.; Zaman, Muhammad H.
2016-06-01
During cell migration, cells become polarized, change their shape, and move in response to various internal and external cues. Cell polarization is defined through the spatio-temporal organization of molecules such as PI3K or small GTPases, and is determined by intracellular signaling networks. It results in directional forces through actin polymerization and myosin contractions. Many existing mathematical models of cell polarization are formulated in terms of reaction-diffusion systems of interacting molecules, and are often defined in one or two spatial dimensions. In this paper, we introduce a 3D reaction-diffusion model of interacting molecules in a single cell, and find that cell geometry has an important role affecting the capability of a cell to polarize, or change polarization when an external signal changes direction. Our results suggest a geometrical argument why more roundish cells can repolarize more effectively than cells which are elongated along the direction of the original stimulus, and thus enable roundish cells to turn faster, as has been observed in experiments. On the other hand, elongated cells preferentially polarize along their main axis even when a gradient stimulus appears from another direction. Furthermore, our 3D model can accurately capture the effect of binding and unbinding of important regulators of cell polarization to and from the cell membrane. This spatial separation of membrane and cytosol, not possible to capture in 1D or 2D models, leads to marked differences of our model from comparable lower-dimensional models.
Kamesh Iyer, Srikant; Tasdizen, Tolga; Burgon, Nathan; Kholmovski, Eugene; Marrouche, Nassir; Adluru, Ganesh; DiBella, Edward
2016-09-01
Current late gadolinium enhancement (LGE) imaging of left atrial (LA) scar or fibrosis is relatively slow and requires 5-15min to acquire an undersampled (R=1.7) 3D navigated dataset. The GeneRalized Autocalibrating Partially Parallel Acquisitions (GRAPPA) based parallel imaging method is the current clinical standard for accelerating 3D LGE imaging of the LA and permits an acceleration factor ~R=1.7. Two compressed sensing (CS) methods have been developed to achieve higher acceleration factors: a patch based collaborative filtering technique tested with acceleration factor R~3, and a technique that uses a 3D radial stack-of-stars acquisition pattern (R~1.8) with a 3D total variation constraint. The long reconstruction time of these CS methods makes them unwieldy to use, especially the patch based collaborative filtering technique. In addition, the effect of CS techniques on the quantification of percentage of scar/fibrosis is not known. We sought to develop a practical compressed sensing method for imaging the LA at high acceleration factors. In order to develop a clinically viable method with short reconstruction time, a Split Bregman (SB) reconstruction method with 3D total variation (TV) constraints was developed and implemented. The method was tested on 8 atrial fibrillation patients (4 pre-ablation and 4 post-ablation datasets). Blur metric, normalized mean squared error and peak signal to noise ratio were used as metrics to analyze the quality of the reconstructed images, Quantification of the extent of LGE was performed on the undersampled images and compared with the fully sampled images. Quantification of scar from post-ablation datasets and quantification of fibrosis from pre-ablation datasets showed that acceleration factors up to R~3.5 gave good 3D LGE images of the LA wall, using a 3D TV constraint and constrained SB methods. This corresponds to reducing the scan time by half, compared to currently used GRAPPA methods. Reconstruction of 3D LGE images
Compressive Sensing Radar: Simulation and Experiments for Target Detection
Anitori, L.; Rossum, W.L. van; Otten, M.P.G.; Maleki, A.; Baraniuk, R.
2013-01-01
In this paper the performance of a combined Constant False Alarm Rate (CFAR) Compressive Sensing (CS) radar detector is investigated Using the properties of the Complex Approximate Message Passing (CAMP) algorithm, it is demonstratedthat the behavior of the CFAR processor can be separated from that
OPTIMAL WAVELET FILTER DESIGN FOR REMOTE SENSING IMAGE COMPRESSION
Institute of Scientific and Technical Information of China (English)
Yang Guoan; Zheng Nanning; Guo Shugang
2007-01-01
A new approach for designing the Biorthogonal Wavelet Filter Bank (BWFB) for the purpose of image compression is presented in this letter. The approach is decomposed into two steps.First, an optimal filter bank is designed in theoretical sense based on Vaidyanathan's coding gain criterion in SubBand Coding (SBC) system. Then the above filter bank is optimized based on the criterion of Peak Signal-to-Noise Ratio (PSNR) in JPEG2000 image compression system, resulting in a BWFB in practical application sense. With the approach, a series of BWFB for a specific class of applications related to image compression, such as remote sensing images, can be fast designed. Here,new 5/3 BWFB and 9/7 BWFB are presented based on the above approach for the remote sensing image compression applications. Experiments show that the two filter banks are equally performed with respect to CDF 9/7 and LT 5/3 filter in JPEG2000 standard; at the same time, the coefficients and the lifting parameters of the lifting scheme are all rational, which bring the computational advantage, and the ease for VLSI implementation.
Compressive sensing for high resolution profiles with enhanced Doppler performance
Anitori, L.; Hoogeboom, P.; Chevalier, F. Le; Otten, M.P.G.
2012-01-01
In this paper we demonstrate how Compressive Sensing (CS) can be used in pulse-Doppler radars to improve the Doppler performance while preserving range resolution. We investigate here two types of stepped frequency waveforms, the coherent frequency bursts and successive frequency ramps, which can be
Compressive sensing for spatial and spectral flame diagnostics
Starling, David; Ranalli, Joseph
2014-03-01
Compressive sensing has been a valuable resource for use in quantum imaging, low light level depth mapping of natural scenes, object tracking and even for the improvement of miniature spectrometers via post processing. Experimentally, many optical compressive sensing techniques utilize a single pixel camera composed of a digital micromirror device or spatial light modulator coupled to one shot-noise limited detector. This method has the advantages of fast acquisition time and high signal to noise ratio. One currently unexplored area of study is the use of these techniques in the context of flame diagnostics. Optical diagnostics are employed for a variety of purposes in flames, including imaging of the heat release region (via chemiluminescence) and spatially resolved species and temperature measurement (via spontaneous Raman scattering). Compressive sensing has a dual role in this field, where the signals of interest are generally sparse and the mean photon flux is very low at the appropriate wavelengths. We show here that compressive sensing is beneficial in particular for the study of laminar, steady flames using Raman spectroscopy and flame chemiluminescence imaging, without the use of intensified CCDs, commercial spectrometers or high intensity pulse lasers. We present results from a theoretical study with experimental data to follow.
Photoacoustic image reconstruction based on Bayesian compressive sensing algorithm
Institute of Scientific and Technical Information of China (English)
Mingjian Sun; Naizhang Feng; Yi Shen; Jiangang Li; Liyong Ma; Zhenghua Wu
2011-01-01
The photoacoustic tomography (PAT) method, based on compressive sensing (CS) theory, requires that,for the CS reconstruction, the desired image should have a sparse representation in a known transform domain. However, the sparsity of photoacoustic signals is destroyed because noises always exist. Therefore,the original sparse signal cannot be effectively recovered using the general reconstruction algorithm. In this study, Bayesian compressive sensing (BCS) is employed to obtain highly sparse representations of photoacoustic images based on a set of noisy CS measurements. Results of simulation demonstrate that the BCS-reconstructed image can achieve superior performance than other state-of-the-art CS-reconstruction algorithms.%@@ The photoacoustic tomography (PAT) method, based on compressive sensing (CS) theory, requires that,for the CS reconstruction, the desired image should have a sparse representation in a known transform domain.However, the sparsity of photoacoustic signals is destroyed because noises always exist.Therefore,the original sparse signal cannot be effectively recovered using the general reconstruction algorithm.In this study, Bayesian compressive sensing (BCS) is employed to obtain highly sparse representations of photoacoustic inages based on a set of noisy CS measurements.Results of simulation demonstrate that the BCS-reconstructed image can achieve superior performance than other state-of-the-art CS-reconstruction algorithms.
Compressive sensing spectrometry based on liquid crystal devices.
August, Yitzhak; Stern, Adrian
2013-12-01
We present a new type of compressive spectroscopy technique employing a liquid crystal (LC) phase retarder. A tunable LC cell is used in a manner compliant with the compressive sensing (CS) framework to significantly reduce the spectral scanning effort. The presented optical spectrometer consists of a single LC phase retarder combined with a single photo detector, where the LC phase retarder is used to modulate the input spectrum and the photodiode is used to measure the transmitted spectral signal. Sequences of measurements are taken, where each measurement is done with a different state of the retarder. Then, the set of photodiode measurements is used as input data to a CS solver algorithm. We demonstrate numerally compressive spectral sensing with approximately ten times fewer measurements than with an equivalent conventional spectrometer.
Compressed Sensing with Linear Correlation Between Signal and Measurement Noise
DEFF Research Database (Denmark)
Arildsen, Thomas; Larsen, Torben
2014-01-01
Existing convex relaxation-based approaches to reconstruction in compressed sensing assume that noise in the measurements is independent of the signal of interest. We consider the case of noise being linearly correlated with the signal and introduce a simple technique for improving compressed...... sensing reconstruction from such measurements. The technique is based on a linear model of the correlation of additive noise with the signal. The modification of the reconstruction algorithm based on this model is very simple and has negligible additional computational cost compared to standard......-rate quantization of compressed measurements, which is known to introduce correlated noise, and improvements in reconstruction error compared to ordinary Basis Pursuit De-Noising of up to approximately 7 dB are observed for 1 bit/sample quantization. Furthermore, the proposed method is compared to Binary Iterative...
Spatial Sense and Perspective: A 3-D Model of the Orion Constellation
Heyer, I.; Slater, T. F.; Slater, S. J.
2012-08-01
Building a scale model of the Orion constellation provides spatial perspective for students studying astronomy. For this activity, students read a passage from literature that refers to stars being strange when seen from a different point of view. From a data set of the seven major stars of Orion they construct a 3-D distance scale model. This involves the subject areas of astronomy, mathematics, literature and art, as well as the skill areas of perspective, relative distances, line-of-sight, and basic algebra. This model will appear from one side exactly the way we see it from Earth. But when looking at it from any other angle the familiar constellation will look very alien. Students are encouraged to come up with their own names and stories to go with these new constellations. This activity has been used for K-12 teacher professional development classes, and would be most suitable for grades 6-12.
Yu, H.-S.; Jackson, B. V.; Hick, P. P.; Buffington, A.; Odstrcil, D.; Wu, C.-C.; Davies, J. A.; Bisi, M. M.; Tokumaru, M.
2015-09-01
The University of California, San Diego, time-dependent analyses of the heliosphere provide three-dimensional (3D) reconstructions of solar wind velocities and densities from observations of interplanetary scintillation (IPS). Using data from the Solar-Terrestrial Environment Laboratory, Japan, these reconstructions provide a real-time prediction of the global solar-wind density and velocity throughout the whole heliosphere with a temporal cadence of about one day (ips.ucsd.edu). Updates to this modeling effort continue: in the present article, near-Sun results extracted from the time-dependent 3D reconstruction are used as inner boundary conditions to drive 3D-MHD models ( e.g. ENLIL and H3D-MHD). This allows us to explore the differences between the IPS kinematic-model data-fitting procedure and current 3D-MHD modeling techniques. The differences in these techniques provide interesting insights into the physical principles governing the expulsion of coronal mass ejections (CMEs). Here we detail for the first time several specific CMEs and an induced shock that occurred in September 2011 that demonstrate some of the issues resulting from these analyses.
Force sensing using 3D displacement measurements in linear elastic bodies
Feng, Xinzeng; Hui, Chung-Yuen
2016-07-01
In cell traction microscopy, the mechanical forces exerted by a cell on its environment is usually determined from experimentally measured displacement by solving an inverse problem in elasticity. In this paper, an innovative numerical method is proposed which finds the "optimal" traction to the inverse problem. When sufficient regularization is applied, we demonstrate that the proposed method significantly improves the widely used approach using Green's functions. Motivated by real cell experiments, the equilibrium condition of a slowly migrating cell is imposed as a set of equality constraints on the unknown traction. Our validation benchmarks demonstrate that the numeric solution to the constrained inverse problem well recovers the actual traction when the optimal regularization parameter is used. The proposed method can thus be applied to study general force sensing problems, which utilize displacement measurements to sense inaccessible forces in linear elastic bodies with a priori constraints.
Wu, Jin; Tao, Kai; Miao, Jianmin; Norford, Leslie K
2015-12-16
Low-cost, one-step, and hydrothermal synthesized 3D reduced graphene oxide hydrogel (RGOH) is exploited to fabricate a high performance NO2 and NH3 sensor with an integrated microheater. The sensor can experimentally detect NO2 and NH3 at low concentrations of 200 ppb and 20 ppm, respectively, at room temperature. In addition to accelerating the signal recovery rate by elevating the local silicon substrate temperature, the microheater is exploited for the first time to improve the selectivity of NO2 sensing. Specifically, the sensor response from NH3 can be effectively suppressed by a locally increased temperature, while the sensitivity of detecting NO2 is not significantly affected. This leads to good discrimination between NO2 and NH3. This strategy paves a new avenue to improve the selectivity of gas sensing by using the microheater to raise substrate temperature. PMID:26630364
A mobile sensing system for real-time 3D weld pool surface measurement in manual GTAW
International Nuclear Information System (INIS)
An innovative mobile sensing system has been developed to non-intrusively monitor the manual pipe gas tungsten arc welding (GTAW) process. The system consists of a projective torch held by a welder, and a sensory helmet on the welder’s head. The three-dimensional (3D) weld pool surface is effectively measured in real-time as the welder performs the weld despite the movements of the torch and the helmet. In this study, the sensing system is first analyzed by numerical simulations in which the adjustment boundaries of the torch and helmet, i.e. their translation and orientation ranges, for effective sensing have been determined. Then, the sensing system is further evaluated using a simulation platform in which the movements of the helmet/welder’s head is mimicked by a tripod head with 6 degree-of-freedom (DOF), and a convex spherical mirror with a comparable size of a typical weld pool in a GTAW process is applied as a weld pool substitute. The effectiveness of the proposed system is validated by successfully capturing laser reflections from the mirror without great constraints on the welder’s movements of the torch and the helmet. Based on the analysis of the spatial relations among the torch, the helmet and the weld pool, an innovative real-time algorithm is proposed to reconstruct the 3D weld pool surface. The effectiveness and robustness of the algorithm have been verified by accurately reconstructing the convex spherical mirror surface despite the movements of the torch and the helmet in the simulation platform. (paper)
3D subsurface geological modeling using GIS, remote sensing, and boreholes data
Kavoura, Katerina; Konstantopoulou, Maria; Kyriou, Aggeliki; Nikolakopoulos, Konstantinos G.; Sabatakakis, Nikolaos; Depountis, Nikolaos
2016-08-01
The current paper presents the combined use of geological-geotechnical insitu data, remote sensing data and GIS techniques for the evaluation of a subsurface geological model. High accuracy Digital Surface Model (DSM), airphotos mosaic and satellite data, with a spatial resolution of 0.5m were used for an othophoto base map compilation of the study area. Geological - geotechnical data obtained from exploratory boreholes and the 1:5000 engineering geological maps were digitized and implemented in a GIS platform for a three - dimensional subsurface model evaluation. The study is located at the North part of Peloponnese along the new national road.
Cooperative Spectrum Sensing and Localization in Cognitive Radio Systems Using Compressed Sensing
Directory of Open Access Journals (Sweden)
Wael Guibène
2013-01-01
Full Text Available We propose to fuse two main enabling features in cognitive radio systems (CRS: spectrum sensing and location awareness in a single compressed sensing based formalism. In this way, we exploit sparse characteristics of primary units to be detected, both in terms of spectrum used and location occupied. The compressed sensing approach also allows to overcome hardware limitations, in terms of the incapacity to acquire measurements and signals at the Nyquist rate when the spectrum to be scanned is large. Simulation results for realistic network topologies and different compressed sensing reconstruction algorithms testify to the performance and the feasibility of the proposed technique to enable in a single formalism the two main features of cognitive sensor networks.
A DISTRIBUTED COMPRESSED SENSING APPROACH FOR SPEECH SIGNAL DENOISING
Institute of Scientific and Technical Information of China (English)
Ji Yunyun; Yang Zhen
2011-01-01
Compressed sensing,a new area of signal processing rising in recent years,seeks to minimize the number of samples that is necessary to be taken from a signal for precise reconstruction.The precondition of compressed sensing theory is the sparsity of signals.In this paper,two methods to estimate the sparsity level of the signal are formulated.And then an approach to estimate the sparsity level directly from the noisy signal is presented.Moreover,a scheme based on distributed compressed sensing for speech signal denoising is described in this work which exploits multiple measurements of the noisy speech signal to construct the block-sparse data and then reconstruct the original speech signal using block-sparse model-based Compressive Sampling Matching Pursuit (CoSaMP) algorithm.Several simulation results demonstrate the accuracy of the estimated sparsity level and that this denoising system for noisy speech signals can achieve favorable performance especially when speech signals suffer severe noise.
Chen, Tinghuan; Zhang, Meng; Wu, Jianhui; Yuen, Chau; Tong, You
2016-10-01
Because of simple encryption and compression procedure in single step, compressed sensing (CS) is utilized to encrypt and compress an image. Difference of sparsity levels among blocks of the sparsely transformed image degrades compression performance. In this paper, motivated by this difference of sparsity levels, we propose an encryption and compression approach combining Kronecker CS (KCS) with elementary cellular automata (ECA). In the first stage of encryption, ECA is adopted to scramble the sparsely transformed image in order to uniformize sparsity levels. A simple approximate evaluation method is introduced to test the sparsity uniformity. Due to low computational complexity and storage, in the second stage of encryption, KCS is adopted to encrypt and compress the scrambled and sparsely transformed image, where the measurement matrix with a small size is constructed from the piece-wise linear chaotic map. Theoretical analysis and experimental results show that our proposed scrambling method based on ECA has great performance in terms of scrambling and uniformity of sparsity levels. And the proposed encryption and compression method can achieve better secrecy, compression performance and flexibility.
Compressive MUSIC: A Missing Link Between Compressive Sensing and Array Signal Processing
Kim, Jong Min; Ye, Jong Chul
2010-01-01
Multiple measurement vector (MMV) problem addresses identification of unknown input vectors that share common sparse support sets, and has many practical applications. Even though MMV problems had been traditionally addressed within the context of sensory array signal processing, recent research trend is to apply compressive sensing (CS) theory due to its capability to estimate sparse support even with insufficient number of snapshots, in which cases classical array signal processing approaches fail. However, CS approaches guarantees the accurate recovery of support in a probabilistic manner, which often shows inferior performance in the regime where the traditional array signal processing approaches succeed. The main contribution of the present article is, therefore, a unified approach that unveils a {missing link} between compressive sensing and array signal processing approaches for the multiple measurement vector problem. The new algorithm, which we call {\\em compressive MUSIC}, identifies the parts of su...
On ECG Compressed Sensing using Specific Overcomplete Dictionaries
Directory of Open Access Journals (Sweden)
CLEJU, N.
2010-11-01
Full Text Available The paper presents a number of results regarding the construction of specific overcomplete dictionaries for ECG compressed sensing (CS. The dictionaries were built using normal and patological cardiac patterns extracted from 24 recordings of the MIT-BIH Arrhythmia Database. It has been shown that the compression results obtained using the CS concept based on specific dictionaries are better that those using the wavelet overcomplete dictionaries. Starting from the concept of sparse signal with respect to a given overcomplete dictionary the paper present several results regarding the possibility of simple pattern classification as well.
Compressive sensing in a photonic link with optical integration
DEFF Research Database (Denmark)
Chen, Ying; Yu, Xianbin; Chi, Hao;
2014-01-01
In this Letter, we present a novel structure to realize photonics-assisted compressive sensing (CS) with optical integration. In the system, a spectrally sparse signal modulates a multiwavelength continuous-wave light and then is mixed with a random sequence in optical domain. The optical signal......, which is equivalent to the function of integration required in CS. A proof-of-concept experiment with four wavelengths, corresponding to a compression factor of 4, is demonstrated. More simulation results are also given to show the potential of the technique....
Image compression-encryption scheme based on hyper-chaotic system and 2D compressive sensing
Zhou, Nanrun; Pan, Shumin; Cheng, Shan; Zhou, Zhihong
2016-08-01
Most image encryption algorithms based on low-dimensional chaos systems bear security risks and suffer encryption data expansion when adopting nonlinear transformation directly. To overcome these weaknesses and reduce the possible transmission burden, an efficient image compression-encryption scheme based on hyper-chaotic system and 2D compressive sensing is proposed. The original image is measured by the measurement matrices in two directions to achieve compression and encryption simultaneously, and then the resulting image is re-encrypted by the cycle shift operation controlled by a hyper-chaotic system. Cycle shift operation can change the values of the pixels efficiently. The proposed cryptosystem decreases the volume of data to be transmitted and simplifies the keys distribution simultaneously as a nonlinear encryption system. Simulation results verify the validity and the reliability of the proposed algorithm with acceptable compression and security performance.
Directory of Open Access Journals (Sweden)
Li-bo Zhang
2015-01-01
Full Text Available This paper presents a solution to satisfy the increasing requirements for secure medical image transmission and storage over public networks. The proposed scheme can simultaneously encrypt and compress the medical image using compressive sensing (CS and pixel swapping based permutation approach. In the CS phase, the plain image is compressed and encrypted by chaos-based Bernoulli measurement matrix, which is generated under the control of the introduced Chebyshev map. The quantized measurements are then encrypted by permutation-diffusion type chaotic cipher for the second level protection. Simulations and extensive security analyses have been performed. The results demonstrate that at a large scale of compression ratio the proposed cryptosystem can provide satisfactory security level and reconstruction quality.
3D Sensing Algorithms Towards Building an Intelligent Intensive Care Unit.
Lea, Colin; Facker, James; Hager, Gregory; Taylor, Russell; Saria, Suchi
2013-01-01
Intensive Care Units (ICUs) are chaotic places where hundreds of tasks are carried out by many different people. Timely and coordinated execution of these tasks are directly related to quality of patient outcomes. An improved understanding of the current care process can aid in improving quality. Our goal is to build towards a system that automatically catalogs various tasks being performed by the bedside. We propose a set of techniques using computer vision and machine learning to develop a system that passively senses the environment and identifies seven common actions such as documenting, checking up on a patient, and performing a procedure. Preliminary evaluation of our system on 5.5 hours of data from the Pediatric ICU obtains overall task recognition accuracy of 70%. Furthermore, we show how it can be used to summarize and visualize tasks. Our system provides a significant departure from current approaches used for quality improvement. With further improvement, we think that such a system could realistically be deployed in the ICU. PMID:24303253
Directory of Open Access Journals (Sweden)
A. Labibzadeh
2008-01-01
Full Text Available In recent years, the material behavior dependence of laboratory concrete specimens built with the same concrete mixture under the same load conditions to their geometrical sizes is well established. This phenomenon which is observed not only in concrete but also in most quasi-brittle materials such as rock, ceramic or composite materials is now called as size effect. Many of the existing structural analyzing codes are not able to consider this important feature of concrete structures especially under compressive loadings. However we know that the main purpose of concrete application in structural members is to resist compression. The aim of this study is to show the ability of author's recently developed 3D finite elements code equipped with the proposed author's newly micro-planes damage based model for considering of compressive size effect of plane concrete. To do so, two different sizes of cubic concrete specimens are modeled with mentioned code under the uniaxial compressive test and their fracture mechanisms, pre-peak and post-peak strain-stress paths are investigated. Obtained results reveal the good coincidence with experimental evidences. In fact, the combination of proposed micro-planes damage based model and developed presented 3D finite elements technique creates a powerful numerical tool to capture and predict precisely strain localization and fracture mechanism in the specimens and consequently to assess properly the compressive size effect of plane concrete in analysis and design.
Statistical mechanics analysis of thresholding 1-bit compressed sensing
Xu, Yingying
2016-01-01
The one-bit compressed sensing framework aims to reconstruct a sparse signal by only using the sign information of its linear measurements. To compensate for the loss of scale information, past studies in the area have proposed recovering the signal by imposing an additional constraint on the L2-norm of the signal. Recently, an alternative strategy that captures scale information by introducing a threshold parameter to the quantization process was advanced. In this paper, we analyze the typical behavior of the thresholding 1-bit compressed sensing utilizing the replica method of statistical mechanics, so as to gain an insight for properly setting the threshold value. Our result shows that, fixing the threshold at a constant value yields better performance than varying it randomly when the constant is optimally tuned, statistically. Unfortunately, the optimal threshold value depends on the statistical properties of the target signal, which may not be known in advance. In order to handle this inconvenience, we ...
On ECG reconstruction using weighted-compressive sensing.
Zonoobi, Dornoosh; Kassim, Ashraf A
2014-06-01
The potential of the new weighted-compressive sensing approach for efficient reconstruction of electrocardiograph (ECG) signals is investigated. This is motivated by the observation that ECG signals are hugely sparse in the frequency domain and the sparsity changes slowly over time. The underlying idea of this approach is to extract an estimated probability model for the signal of interest, and then use this model to guide the reconstruction process. The authors show that the weighted-compressive sensing approach is able to achieve reconstruction performance comparable with the current state-of-the-art discrete wavelet transform-based method, but with substantially less computational cost to enable it to be considered for use in the next generation of miniaturised wearable ECG monitoring devices.
Cognitive Radios Exploiting Gray Spaces via Compressed Sensing
Wieruch, Dennis; Jung, Peter; Wirth, Thomas; Dekorsy, Armin; Haustein, Thomas
2016-07-01
We suggest an interweave cognitive radio system with a gray space detector, which is properly identifying a small fraction of unused resources within an active band of a primary user system like 3GPP LTE. Therefore, the gray space detector can cope with frequency fading holes and distinguish them from inactive resources. Different approaches of the gray space detector are investigated, the conventional reduced-rank least squares method as well as the compressed sensing-based orthogonal matching pursuit and basis pursuit denoising algorithm. In addition, the gray space detector is compared with the classical energy detector. Simulation results present the receiver operating characteristic at several SNRs and the detection performance over further aspects like base station system load for practical false alarm rates. The results show, that especially for practical false alarm rates the compressed sensing algorithm are more suitable than the classical energy detector and reduced-rank least squares approach.
Blind Source Separation with Compressively Sensed Linear Mixtures
Kleinsteuber, Martin
2011-01-01
This work studies the problem of simultaneously separating and reconstructing signals from compressively sensed linear mixtures. We assume that all source signals share a common sparse representation basis. The approach combines classical Compressive Sensing (CS) theory with a linear mixing model. It allows the mixtures to be sampled independently of each other. If samples are acquired in the time domain, this means that the sensors need not be synchronized. Since Blind Source Separation (BSS) from a linear mixture is only possible up to permutation and scaling, factoring out these ambiguities leads to a minimization problem on the so-called oblique manifold. We develop a geometric conjugate subgradient method that scales to large systems for solving the problem. Numerical results demonstrate the promising performance of the proposed algorithm compared to several state of the art methods.
Sampling theory, a renaissance compressive sensing and other developments
2015-01-01
Reconstructing or approximating objects from seemingly incomplete information is a frequent challenge in mathematics, science, and engineering. A multitude of tools designed to recover hidden information are based on Shannon’s classical sampling theorem, a central pillar of Sampling Theory. The growing need to efficiently obtain precise and tailored digital representations of complex objects and phenomena requires the maturation of available tools in Sampling Theory as well as the development of complementary, novel mathematical theories. Today, research themes such as Compressed Sensing and Frame Theory re-energize the broad area of Sampling Theory. This volume illustrates the renaissance that the area of Sampling Theory is currently experiencing. It touches upon trendsetting areas such as Compressed Sensing, Finite Frames, Parametric Partial Differential Equations, Quantization, Finite Rate of Innovation, System Theory, as well as sampling in Geometry and Algebraic Topology.
Prior image constrained compressed sensing: a quantitative performance evaluation
Thériault Lauzier, Pascal; Tang, Jie; Chen, Guang-Hong
2012-03-01
The appeal of compressed sensing (CS) in the context of medical imaging is undeniable. In MRI, it could enable shorter acquisition times while in CT, it has the potential to reduce the ionizing radiation dose imparted to patients. However, images reconstructed using a CS-based approach often show an unusual texture and a potential loss in spatial resolution. The prior image constrained compressed sensing (PICCS) algorithm has been shown to enable accurate image reconstruction at lower levels of sampling. This study systematically evaluates an implementation of PICCS applied to myocardial perfusion imaging with respect to two parameters of its objective function. The prior image parameter α was shown here to yield an optimal image quality in the range 0.4 to 0.5. A quantitative evaluation in terms of temporal resolution, spatial resolution, noise level, noise texture, and reconstruction accuracy was performed.
Compressed sensing for wide-field radio interferometric imaging
McEwen, J D
2010-01-01
For the next generation of radio interferometric telescopes it is of paramount importance to incorporate wide field-of-view (WFOV) considerations in interferometric imaging, otherwise the fidelity of reconstructed images will suffer greatly. We extend compressed sensing techniques for interferometric imaging to a WFOV and recover images in the spherical coordinate space in which they naturally live, eliminating any distorting projection. The effectiveness of the spread spectrum phenomenon, highlighted recently by one of the authors, is enhanced when going to a WFOV, while sparsity is promoted by recovering images directly on the sphere. Both of these properties act to improve the quality of reconstructed interferometric images. We quantify the performance of compressed sensing reconstruction techniques through simulations, highlighting the superior reconstruction quality achieved by recovering interferometric images directly on the sphere rather than the plane.
Fast Adaptive Wavelet for Remote Sensing Image Compression
Institute of Scientific and Technical Information of China (English)
Bo Li; Run-Hai Jiao; Yuan-Cheng Li
2007-01-01
Remote sensing images are hard to achieve high compression ratio because of their rich texture. By analyzing the influence of wavelet properties on image compression, this paper proposes wavelet construction rules and builds a new biorthogonal wavelet construction model with parameters. The model parameters are optimized by using genetic algorithm and adopting energy compaction as the optimization object function. In addition, in order to resolve the computation complexity problem of online construction, according to the image classification rule proposed in this paper we construct wavelets for different classes of images and implement the fast adaptive wavelet selection algorithm (FAWS). Experimental results show wavelet bases of FAWS gain better compression performance than Daubechies9/7.
Sparse Vector Distributions and Recovery from Compressed Sensing
DEFF Research Database (Denmark)
Sturm, Bob L.
It is well known that the performance of sparse vector recovery algorithms from compressive measurements can depend on the distribution underlying the non-zero elements of a sparse vector. However, the extent of these effects has yet to be explored, and formally presented. In this paper, I...... distributions, and the criterion for exact recovery; and 2) a recovery algorithm must be selected carefully based on what distribution one expects to underlie the sensed sparse signal....
Compressed Sensing for Time-Frequency Gravitational Wave Data Analysis
Addesso, Paolo; Marano, Stefano; Matta, Vincenzo; Principe, Maria; Pinto, Innocenzo M
2016-01-01
The potential of compressed sensing for obtaining sparse time-frequency representations for gravitational wave data analysis is illustrated by comparison with existing methods, as regards i) shedding light on the fine structure of noise transients (glitches) in preparation of their classification, and ii) boosting the performance of waveform consistency tests in the detection of unmodeled transient gravitational wave signals using a network of detectors affected by unmodeled noise transient
Development of a Neutron Spectroscopic System Utilizing Compressed Sensing Measurements
Vargas Danilo; Kurwitz R. Cable; Carron Igor; DePriest K. Russell
2016-01-01
A new approach to neutron detection capable of gathering spectroscopic information has been demonstrated. The approach relies on an asymmetrical arrangement of materials, geometry, and an ability to change the orientation of the detector with respect to the neutron field. Measurements are used to unfold the energy characteristics of the neutron field using a new theoretical framework of compressed sensing. Recent theoretical results show that the number of multiplexed samples can be lower tha...
Frame-Based Compressed Sensing Of Speech Signal
B Chaitanya
2014-01-01
In this paper, compressed sensing (CS) of speech signal using Frame-based adaptive technique has been proposed. we propose 3 sampling strategies in a frame-based adaptive CS framework. The first stage is frame based adaptive CS framework. In this stage, each speech sequence is divided into non-overlapping frames and all frames in a speech sequence are processed independently. Second stage is Partial Sampling and Frame Analysis. This stage can estimate the amount of intensity c...
Compressed Sensing MR Image Reconstruction Exploiting TGV and Wavelet Sparsity
Di Zhao; Huiqian Du; Yu Han; Wenbo Mei
2014-01-01
Compressed sensing (CS) based methods make it possible to reconstruct magnetic resonance (MR) images from undersampled measurements, which is known as CS-MRI. The reference-driven CS-MRI reconstruction schemes can further decrease the sampling ratio by exploiting the sparsity of the difference image between the target and the reference MR images in pixel domain. Unfortunately existing methods do not work well given that contrast changes are incorrectly estimated or motion compensation is inac...
Compressive Sensing for Feedback Reduction in MIMO Broadcast Channels
Qaseem, Syed T.; Al-Naffouri, Tareq Y.
2009-01-01
We propose a generalized feedback model and compressive sensing based opportunistic feedback schemes for feedback resource reduction in MIMO Broadcast Channels under the assumption that both uplink and downlink channels undergo block Rayleigh fading. Feedback resources are shared and are opportunistically accessed by users who are strong, i.e. users whose channel quality information is above a certain fixed threshold. Strong users send same feedback information on all shared channels. They ar...
Optimizing measurements for feature-specific compressive sensing.
Mahalanobis, Abhijit; Neifeld, Mark
2014-09-10
While the theory of compressive sensing has been very well investigated in the literature, comparatively little attention has been given to the issues that arise when compressive measurements are made in hardware. For instance, compressive measurements are always corrupted by detector noise. Further, the number of photons available is the same whether a conventional image is sensed or multiple coded measurements are made in the same interval of time. Thus it is essential that the effects of noise and the constraint on the number of photons must be taken into account in the analysis, design, and implementation of a compressive imager. In this paper, we present a methodology for designing a set of measurement kernels (or masks) that satisfy the photon constraint and are optimum for making measurements that minimize the reconstruction error in the presence of noise. Our approach finds the masks one at a time, by determining the vector that yields the best possible measurement for reducing the reconstruction error. The subspace represented by the optimized mask is removed from the signal space, and the process is repeated to find the next best measurement. Results of simulations are presented that show that the optimum masks always outperform reconstructions based on traditional feature measurements (such as principle components), and are also better than the conventional images in high noise conditions.
Early Detection of Rogue Waves Using Compressive Sensing
Bayindir, Cihan
2016-01-01
We discuss the possible usage of the compressive sampling for the early detection of rogue waves in a chaotic sea state. One of the promising techniques for the early detection of the oceanic rogue waves is to measure the triangular Fourier spectra which begin to appear at the early stages of their development. For the early detection of the rogue waves it is possible to treat such a spectrum as a sparse signal since we would mainly be interested in the high amplitude triangular region located at the central wavenumber. Therefore compressive sampling can be a very efficient tool for the rogue wave early warning systems. Compressed measurements can be acquired by remote sensing techniques such as coherent SAR which measure the ocean surface fluctuation or by insitu techniques such as spectra measuring tools mounted on a ship hull or bottom mounted pressure gauges. By employing a numerical approach we show that triangular Fourier spectra can be sensed by compressed measurements at the early stages of the develo...
Study on adaptive compressed sensing & reconstruction of quantized speech signals
Yunyun, Ji; Zhen, Yang
2012-12-01
Compressed sensing (CS) is a rising focus in recent years for its simultaneous sampling and compression of sparse signals. Speech signals can be considered approximately sparse or compressible in some domains for natural characteristics. Thus, it has great prospect to apply compressed sensing to speech signals. This paper is involved in three aspects. Firstly, the sparsity and sparsifying matrix for speech signals are analyzed. Simultaneously, a kind of adaptive sparsifying matrix based on the long-term prediction of voiced speech signals is constructed. Secondly, a CS matrix called two-block diagonal (TBD) matrix is constructed for speech signals based on the existing block diagonal matrix theory to find out that its performance is empirically superior to that of the dense Gaussian random matrix when the sparsifying matrix is the DCT basis. Finally, we consider the quantization effect on the projections. Two corollaries about the impact of the adaptive quantization and nonadaptive quantization on reconstruction performance with two different matrices, the TBD matrix and the dense Gaussian random matrix, are derived. We find that the adaptive quantization and the TBD matrix are two effective ways to mitigate the quantization effect on reconstruction of speech signals in the framework of CS.
Residual Distributed Compressive Video Sensing Based on Double Side Information
Institute of Scientific and Technical Information of China (English)
CHEN Jian; SU Kai-Xiong; WANG Wei-Xing; LAN Cheng-Dong
2014-01-01
Compressed sensing (CS) is a novel technology to acquire and reconstruct sparse signals below the Nyquist rate. It has great potential in image and video acquisition and processing. To effectively improve the sparsity of signal being measured and reconstructing efficiency, an encoding and decoding model of residual distributed compressive video sensing based on double side information (RDCVS-DSI) is proposed in this paper. Exploiting the characteristics of image itself in the frequency domain and the correlation between successive frames, the model regards the video frame in low quality as the first side information in the process of coding, and generates the second side information for the non-key frames using motion estimation and compensation technology at its decoding end. Performance analysis and simulation experiments show that the RDCVS-DSI model can rebuild the video sequence with high fidelity in the consumption of quite low complexity. About 1∼5 dB gain in the average peak signal-to-noise ratio of the reconstructed frames is observed, and the speed is close to the least complex DCVS, when compared with prior works on compressive video sensing.
Statistical mechanics approach to 1-bit compressed sensing
Xu, Yingying; Kabashima, Yoshiyuki
2013-02-01
Compressed sensing is a framework that makes it possible to recover an N-dimensional sparse vector x∈RN from its linear transformation y∈RM of lower dimensionality M entry of y to recover x was recently proposed. This is often termed 1-bit compressed sensing. Here, we analyze the typical performance of an l1-norm-based signal recovery scheme for 1-bit compressed sensing using statistical mechanics methods. We show that the signal recovery performance predicted by the replica method under the replica symmetric ansatz, which turns out to be locally unstable for modes breaking the replica symmetry, is in good consistency with experimental results of an approximate recovery algorithm developed earlier. This suggests that the l1-based recovery problem typically has many local optima of a similar recovery accuracy, which can be achieved by the approximate algorithm. We also develop another approximate recovery algorithm inspired by the cavity method. Numerical experiments show that when the density of nonzero entries in the original signal is relatively large the new algorithm offers better performance than the abovementioned scheme and does so with a lower computational cost.
Hybrid tenso-vectorial compressive sensing for hyperspectral imaging
Li, Qun; Bernal, Edgar A.
2016-05-01
Hyperspectral imaging has a wide range of applications relying on remote material identification, including astronomy, mineralogy, and agriculture; however, due to the large volume of data involved, the complexity and cost of hyperspectral imagers can be prohibitive. The exploitation of redundancies along the spatial and spectral dimensions of a hyperspectral image of a scene has created new paradigms that overcome the limitations of traditional imaging systems. While compressive sensing (CS) approaches have been proposed and simulated with success on already acquired hyperspectral imagery, most of the existing work relies on the capability to simultaneously measure the spatial and spectral dimensions of the hyperspectral cube. Most real-life devices, however, are limited to sampling one or two dimensions at a time, which renders a significant portion of the existing work unfeasible. We propose a new variant of the recently proposed serial hybrid vectorial and tensorial compressive sensing (HCS-S) algorithm that, like its predecessor, is compatible with real-life devices both in terms of the acquisition and reconstruction requirements. The newly introduced approach is parallelizable, and we abbreviate it as HCS-P. Together, HCS-S and HCS-P comprise a generalized framework for hybrid tenso-vectorial compressive sensing, or HCS for short. We perform a detailed analysis that demonstrates the uniqueness of the signal reconstructed by both the original HCS-S and the proposed HCS-P algorithms. Last, we analyze the behavior of the HCS reconstruction algorithms in the presence of measurement noise, both theoretically and experimentally.
Geenen, T.; Heister, T.; Van Den Berg, A. P.; Jacobs, M.; Bangerth, W.
2011-12-01
We present high resolution 3D results of the complex mineral phase distribution in the transition zone obtained by numerical modelling of mantle convection. We extend the work by [Jacobs and van den Berg, 2011] to 3D and illustrate the efficiency of adaptive mesh refinement for capturing the complex spatial distribution and sharp phase transitions as predicted by their model. The underlying thermodynamical model is based on lattice dynamics which allows to predict thermophysical properties and seismic wave speeds for the applied magnesium-endmember olivine-pyroxene mineralogical model. The use of 3D geometry allows more realistic prediction of phase distribution and seismic wave speeds resulting from 3D flow processes involving the Earth's transition zone and more significant comparisons with interpretations from seismic tomography and seismic reflectivity studies aimed at the transition zone. Model results are generated with a recently developed geodynamics modeling application based on dealII (www.dealii.org). We extended this model to incorporate both a general thermodynamic model, represented by P,T space tabulated thermophysical properties, and a solution strategy that allows for compressible flow. When modeling compressible flow in the so called truncated anelastic approximation framework we have to adapt the solver strategy that has been proven by several authors to be highly efficient for incompressible flow to incorporate an extra term in the continuity equation. We present several possible solution strategies and discuss their implication in terms of robustness and computational efficiency.
Huang, Jianfei; Zhu, Yihua; Yang, Xiaoling; Chen, Wei; Zhou, Ying; Li, Chunzhong
2014-12-01
Convenient determination of glucose in a sensitive, reliable and cost-effective way has aroused sustained research passion, bringing along assiduous investigation of high-performance electroactive nanomaterials to build enzymeless sensors. In addition to the intrinsic electrocatalytic capability of the sensing materials, electrode architecture at the microscale is also crucial for fully enhancing the performance. In this work, free-standing porous CuO nanowire (NW) was taken as a model sensing material to illustrate this point, where an in situ formed 3D CuO nanowire array (NWA) and CuO nanowires pile (NWP) immobilized with polymer binder by conventional drop-casting technique were both studied for enzymeless glucose sensing. The NWA electrode exhibited greatly promoted electrochemistry characterized by decreased overpotential for electro-oxidation of glucose and over 5-fold higher sensitivity compared to the NWP counterpart, benefiting from the binder-free nanoarray structure. Besides, its sensing performance was also satisfying in terms of rapidness, selectivity and durability. Further, the CuO NWA was utilized to fabricate a flexible sensor which showed excellent performance stability against mechanical bending. Thanks to its favorable electrode architecture, the CuO NWA is believed to offer opportunities for building high-efficiency flexible electrochemical devices.Convenient determination of glucose in a sensitive, reliable and cost-effective way has aroused sustained research passion, bringing along assiduous investigation of high-performance electroactive nanomaterials to build enzymeless sensors. In addition to the intrinsic electrocatalytic capability of the sensing materials, electrode architecture at the microscale is also crucial for fully enhancing the performance. In this work, free-standing porous CuO nanowire (NW) was taken as a model sensing material to illustrate this point, where an in situ formed 3D CuO nanowire array (NWA) and CuO nanowires
A CLASS OF DETERMINISTIC CONSTRUCTION OF BINARY COMPRESSED SENSING MATRICES
Institute of Scientific and Technical Information of China (English)
Li Dandan; Liu Xinji; Xia Shutao; Jiang Yong
2012-01-01
Compressed Sensing (CS) is an emerging technology in the field of signal processing,which can recover a sparse signal by taking very few samples and solving a linear programming problem.In this paper,we study the application of Low-Density Parity-Check (LDPC) Codes in CS.Firstly,we find a sufficient condition for a binary matrix to satisfy the Restricted Isometric Property (RIP).Then,by employing the LDPC codes based on Berlekamp-Justesen (B-J) codes,we construct two classes of binary structured matrices and show that these matrices satisfy RIP.Thus,the proposed matrices could be used as sensing matrices for CS.Finally,simulation results show that the performance of the Droposed matrices can be comparable with the widely used random sensing matrices.
Basha, Tamer A; Akçakaya, Mehmet; Goddu, Beth; Berg, Sophie; Nezafat, Reza
2015-01-01
The aim of this study was to implement and evaluate an accelerated three-dimensional (3D) cine phase contrast MRI sequence by combining a randomly sampled 3D k-space acquisition sequence with an echo planar imaging (EPI) readout. An accelerated 3D cine phase contrast MRI sequence was implemented by combining EPI readout with randomly undersampled 3D k-space data suitable for compressed sensing (CS) reconstruction. The undersampled data were then reconstructed using low-dimensional structural self-learning and thresholding (LOST). 3D phase contrast MRI was acquired in 11 healthy adults using an overall acceleration of 7 (EPI factor of 3 and CS rate of 3). For comparison, a single two-dimensional (2D) cine phase contrast scan was also performed with sensitivity encoding (SENSE) rate 2 and approximately at the level of the pulmonary artery bifurcation. The stroke volume and mean velocity in both the ascending and descending aorta were measured and compared between two sequences using Bland-Altman plots. An average scan time of 3 min and 30 s, corresponding to an acceleration rate of 7, was achieved for 3D cine phase contrast scan with one direction flow encoding, voxel size of 2 × 2 × 3 mm(3) , foot-head coverage of 6 cm and temporal resolution of 30 ms. The mean velocity and stroke volume in both the ascending and descending aorta were statistically equivalent between the proposed 3D sequence and the standard 2D cine phase contrast sequence. The combination of EPI with a randomly undersampled 3D k-space sampling sequence using LOST reconstruction allows a seven-fold reduction in scan time of 3D cine phase contrast MRI without compromising blood flow quantification.
Texture-based medical image retrieval in compressed domain using compressive sensing.
Yadav, Kuldeep; Srivastava, Avi; Mittal, Ankush; Ansari, M A
2014-01-01
Content-based image retrieval has gained considerable attention in today's scenario as a useful tool in many applications; texture is one of them. In this paper, we focus on texture-based image retrieval in compressed domain using compressive sensing with the help of DC coefficients. Medical imaging is one of the fields which have been affected most, as there had been huge size of image database and getting out the concerned image had been a daunting task. Considering this, in this paper we propose a new model of image retrieval process using compressive sampling, since it allows accurate recovery of image from far fewer samples of unknowns and it does not require a close relation of matching between sampling pattern and characteristic image structure with increase acquisition speed and enhanced image quality.
Texture-based medical image retrieval in compressed domain using compressive sensing.
Yadav, Kuldeep; Srivastava, Avi; Mittal, Ankush; Ansari, M A
2014-01-01
Content-based image retrieval has gained considerable attention in today's scenario as a useful tool in many applications; texture is one of them. In this paper, we focus on texture-based image retrieval in compressed domain using compressive sensing with the help of DC coefficients. Medical imaging is one of the fields which have been affected most, as there had been huge size of image database and getting out the concerned image had been a daunting task. Considering this, in this paper we propose a new model of image retrieval process using compressive sampling, since it allows accurate recovery of image from far fewer samples of unknowns and it does not require a close relation of matching between sampling pattern and characteristic image structure with increase acquisition speed and enhanced image quality. PMID:24589833
Hyperspectral data compression
Motta, Giovanni; Storer, James A
2006-01-01
Provides a survey of results in the field of compression of remote sensed 3D data, with a particular interest in hyperspectral imagery. This work covers topics such as compression architecture, lossless compression, lossy techniques, and more. It also describes a lossless algorithm based on vector quantization.
Compressive sensing in a photonic link with optical integration.
Chen, Ying; Yu, Xianbin; Chi, Hao; Jin, Xiaofeng; Zhang, Xianmin; Zheng, Shilie; Galili, Michael
2014-04-15
In this Letter, we present a novel structure to realize photonics-assisted compressive sensing (CS) with optical integration. In the system, a spectrally sparse signal modulates a multiwavelength continuous-wave light and then is mixed with a random sequence in optical domain. The optical signal passes through a length of dispersive fiber, the dispersion amount of which is set to ensure that the group delay between the adjacent wavelength channels is equal to the bit duration of the applied random sequence. As a result, the detected signal is a delay-and-sum version of the randomly mixed signal, which is equivalent to the function of integration required in CS. A proof-of-concept experiment with four wavelengths, corresponding to a compression factor of 4, is demonstrated. More simulation results are also given to show the potential of the technique.
K-cluster-valued compressive sensing for imaging
Directory of Open Access Journals (Sweden)
Xu Mai
2011-01-01
Full Text Available Abstract The success of compressive sensing (CS implies that an image can be compressed directly into acquisition with the measurement number over the whole image less than pixel number of the image. In this paper, we extend the existing CS by including the prior knowledge of K-cluster values available for the pixels or wavelet coefficients of an image. In order to model such prior knowledge, we propose in this paper K-cluster-valued CS approach for imaging, by incorporating the K-means algorithm in CoSaMP recovery algorithm. One significant advantage of the proposed approach, rather than the conventional CS, is the capability of reducing measurement numbers required for the accurate image reconstruction. Finally, the performance of conventional CS and K-cluster-valued CS is evaluated using some natural images and background subtraction images.
Compressed Sensing for Denoising in Adaptive System Identification
Hosseini, Seyed Hossein
2012-01-01
We propose a new technique for adaptive identification of sparse systems based on the compressed sensing (CS) theory. We manipulate the transmitted pilot (input signal) and the received signal such that the weights of adaptive filter approach the compressed version of the sparse system instead of the original system. To this end, we use random filter structure at the transmitter to form the measurement matrix according to the CS framework. The original sparse system can be reconstructed by the conventional recovery algorithms. As a result, the denoising property of CS can be deployed in the proposed method at the recovery stage. The experiments indicate significant performance improvement of proposed method compared to the conventional LMS method which directly identifies the sparse system. Furthermore, at low levels of sparsity, our method outperforms a specialized identification algorithm that promotes sparsity.
Li, P.; Turk, J.; Vu, Q.; Knosp, B.; Hristova-Veleva, S. M.; Lambrigtsen, B.; Poulsen, W. L.; Licata, S.
2009-12-01
NASA is planning a new field experiment, the Genesis and Rapid Intensification Processes (GRIP), in the summer of 2010 to better understand how tropical storms form and develop into major hurricanes. The DC-8 aircraft and the Global Hawk Unmanned Airborne System (UAS) will be deployed loaded with instruments for measurements including lightning, temperature, 3D wind, precipitation, liquid and ice water contents, aerosol and cloud profiles. During the field campaign, both the spaceborne and the airborne observations will be collected in real-time and integrated with the hurricane forecast models. This observation-model integration will help the campaign achieve its science goals by allowing team members to effectively plan the mission with current forecasts. To support the GRIP experiment, JPL developed a website for interactive visualization of all related remote-sensing observations in the GRIP’s geographical domain using the new Google Earth API. All the observations are collected in near real-time (NRT) with 2 to 5 hour latency. The observations include a 1KM blended Sea Surface Temperature (SST) map from GHRSST L2P products; 6-hour composite images of GOES IR; stability indices, temperature and vapor profiles from AIRS and AMSU-B; microwave brightness temperature and rain index maps from AMSR-E, SSMI and TRMM-TMI; ocean surface wind vectors, vorticity and divergence of the wind from QuikSCAT; the 3D precipitation structure from TRMM-PR and vertical profiles of cloud and precipitation from CloudSAT. All the NRT observations are collected from the data centers and science facilities at NASA and NOAA, subsetted, re-projected, and composited into hourly or daily data products depending on the frequency of the observation. The data products are then displayed on the 3D Google Earth plug-in at the JPL Tropical Cyclone Information System (TCIS) website. The data products offered by the TCIS in the Google Earth display include image overlays, wind vectors, clickable
A distributed compressive sensing technique for data gathering in Wireless Sensor Networks
Masoum, Alireza; Meratnia, Nirvana; Havinga, Paul J.M.
2013-01-01
Compressive sensing is a new technique utilized for energy efficient data gathering in wireless sensor networks. It is characterized by its simple encoding and complex decoding. The strength of compressive sensing is its ability to reconstruct sparse or compressible signals from small number of meas
Saghi, Zineb; Divitini, Giorgio; Winter, Benjamin; Leary, Rowan; Spiecker, Erdmann; Ducati, Caterina; Midgley, Paul A
2016-01-01
Electron tomography is an invaluable method for 3D cellular imaging. The technique is, however, limited by the specimen geometry, with a loss of resolution due to a restricted tilt range, an increase in specimen thickness with tilt, and a resultant need for subjective and time-consuming manual segmentation. Here we show that 3D reconstructions of needle-shaped biological samples exhibit isotropic resolution, facilitating improved automated segmentation and feature detection. By using scanning transmission electron tomography, with small probe convergence angles, high spatial resolution is maintained over large depths of field and across the tilt range. Moreover, the application of compressed sensing methods to the needle data demonstrates how high fidelity reconstructions may be achieved with far fewer images (and thus greatly reduced dose) than needed by conventional methods. These findings open the door to high fidelity electron tomography over critically relevant length-scales, filling an important gap between existing 3D cellular imaging techniques.
Multifrequency Bayesian compressive sensing methods for microwave imaging.
Poli, Lorenzo; Oliveri, Giacomo; Ding, Ping Ping; Moriyama, Toshifumi; Massa, Andrea
2014-11-01
The Bayesian retrieval of sparse scatterers under multifrequency transverse magnetic illuminations is addressed. Two innovative imaging strategies are formulated to process the spectral content of microwave scattering data according to either a frequency-hopping multistep scheme or a multifrequency one-shot scheme. To solve the associated inverse problems, customized implementations of single-task and multitask Bayesian compressive sensing are introduced. A set of representative numerical results is discussed to assess the effectiveness and the robustness against the noise of the proposed techniques also in comparison with some state-of-the-art deterministic strategies.
Scrambling-based speech encryption via compressed sensing
Zeng, Li; Zhang, Xiongwei; Chen, Liang; Fan, Zhangjun; Wang, Yonggang
2012-12-01
Conventional speech scramblers have three disadvantages, including heavy communication overhead, signal features underexploitation, and low attack resistance. In this study, we propose a scrambling-based speech encryption scheme via compressed sensing (CS). Distinguished from conventional scramblers, the above problems are solved in a unified framework by utilizing the advantages of CS. The presented encryption idea is general and easily applies to speech communication systems. Compared with the state-of-the-art methods, the proposed scheme provides lower residual intelligibility and greater cryptanalytic efforts. Meanwhile, it ensures desirable channel usage and notable resistibility to hostile attack. Extensive experimental results also confirm the effectiveness of the proposed scheme.
OTHR Spectrum Reconstruction of Maneuvering Target with Compressive Sensing
Directory of Open Access Journals (Sweden)
Yinghui Quan
2014-01-01
Full Text Available High-frequency (HF over-the-horizon radar (OTHR works in a very complicated electromagnetic environment. It usually suffers performance degradation caused by transient interference. In this paper, we study the transient interference excision and full spectrum reconstruction of maneuvering targets. The segmental subspace projection (SP approach is applied to suppress the clutter and locate the transient interference. After interference excision, the spectrum is reconstructed from incomplete measurements via compressive sensing (CS by using a redundant Fourier-chirp dictionary. An improved orthogonal matching pursuit (IOMP algorithm is developed to solve the sparse decomposition optimization. Experimental results demonstrate the effectiveness of the proposed methods.
On Phase Transition of Compressed Sensing in the Complex Domain
Yang, Zai; Xie, Lihua
2011-01-01
The phase transition is a performance measure of the sparsity-undersampling tradeoff in compressed sensing (CS). This letter reports, for the first time, the existence of an exact phase transition for the $\\ell_1$ minimization approach to the complex valued CS problem. This discovery is not only a complementary result to the known phase transition of the real valued CS but also shows considerable superiority of the phase transition of complex valued CS over that of the real valued CS. The results are obtained by extending the recently developed ONE-L1 algorithms to complex valued CS and applying their optimal and iterative solutions to empirically evaluate the phase transition.
Image Deblurring Using Derivative Compressed Sensing for Optical Imaging Application
Rostami, Mohammad; Wang, Zhou
2011-01-01
Reconstruction of multidimensional signals from the samples of their partial derivatives is known to be a standard problem in inverse theory. Such and similar problems routinely arise in numerous areas of applied sciences, including optical imaging, laser interferometry, computer vision, remote sensing and control. Though being ill-posed in nature, the above problem can be solved in a unique and stable manner, provided proper regularization and relevant boundary conditions. In this paper, however, a more challenging setup is addressed, in which one has to recover an image of interest from its noisy and blurry version, while the only information available about the imaging system at hand is the amplitude of the generalized pupil function (GPF) along with partial observations of the gradient of GPF's phase. In this case, the phase-related information is collected using a simplified version of the Shack-Hartmann interferometer, followed by recovering the entire phase by means of derivative compressed sensing. Su...
Energy-efficient Compressed Sensing for ambulatory ECG monitoring.
Craven, Darren; McGinley, Brian; Kilmartin, Liam; Glavin, Martin; Jones, Edward
2016-04-01
Advances in Compressed Sensing (CS) are enabling promising low-energy implementation solutions for wireless Body Area Networks (BAN). While studies demonstrate the potential of CS in terms of overall energy efficiency compared to state-of-the-art lossy compression techniques, the performance of CS remains limited. The aim of this study is to improve the performance of CS-based compression for electrocardiogram (ECG) signals. This paper proposes a CS architecture that combines a novel redundancy removal scheme with quantization and Huffman entropy coding to effectively extend the Compression Ratio (CR). Reconstruction is performed using overcomplete sparse dictionaries created with Dictionary Learning (DL) techniques to exploit the highly structured nature of ECG signals. Performance of the proposed CS implementation is evaluated by analyzing energy-based distortion metrics and diagnostic metrics including QRS beat-detection accuracy across a range of CRs. The proposed CS approach offers superior performance to the most recent state-of-the-art CS implementations in terms of signal reconstruction quality across all CRs tested. Furthermore, QRS detection accuracy of the technique is compared with the well-known lossy Set Partitioning in Hierarchical Trees (SPIHT) compression technique. The proposed CS approach outperforms SPIHT in terms of achievable CR, using the area under the receiver operator characteristic (ROC) curve (AUC). For an application where a minimum AUC performance threshold of 0.9 is required, the proposed technique extends the CR from 64.6 to 90.45 compared with SPIHT, ensuring a 40% saving on wireless transmission costs. Therefore, the results highlight the potential of the proposed technique for ECG computer-aided diagnostic systems. PMID:26854730
On exploiting interbeat correlation in compressive sensing-based ECG compression
Polania, Luisa F.; Carrillo, Rafael E.; Blanco-Velasco, Manuel; Barner, Kenneth E.
2012-06-01
Compressive Sensing (CS) is an emerging data acquisition scheme with the potential to reduce the number of measurements required by the Nyquist sampling theorem to acquire sparse signals. We recently used the interbeat correlation to find the common support between jointly sparse adjacent heartbeats. In this paper, we fully exploit this correlation to find the magnitude, in addition to the support of the significant coefficients in the sparse domain. The approach used for this purpose is based on sparse Bayesian learning algorithms due to its superior performance compared to other reconstruction algorithms and the fact that being a probabilistic approach facilitates the incorporation of correlation information. The reconstruction includes, in the first place, the detection of the R peaks and the length normalization of ECG cycles to take advantage of the quasi-periodic structure. Since the common support reduces as the number of heartbeats increases, we propose the use of a sliding window where the support maintains approximately constant across cycles. The sparse Bayesian algorithm adaptively learns and exploits the high correlation between the heartbeats in the constructed window. Experimental results show that the proposed method reduces significantly the number of measurements required to achieve good reconstruction quality, validating the potential of using correlation information in compressed sensing-based ECG compression.
High-resolution mesoscopic fluorescence molecular tomography based on compressive sensing.
Yang, Fugang; Ozturk, Mehmet S; Zhao, Lingling; Cong, Wenxiang; Wang, Ge; Intes, Xavier
2015-01-01
Mesoscopic fluorescence molecular tomography (MFMT) is new imaging modality aiming at 3-D imaging of molecular probes in a few millimeter thick biological samples with high-spatial resolution. In this paper, we develop a compressive sensing-based reconstruction method with l1-norm regularization for MFMT with the goal of improving spatial resolution and stability of the optical inverse problem. Three-dimensional numerical simulations of anatomically accurate microvasculature and real data obtained from phantom experiments are employed to evaluate the merits of the proposed method. Experimental results show that the proposed method can achieve 80 μm spatial resolution for a biological sample of 3 mm thickness and more accurate quantifications of concentrations and locations for the fluorophore distribution than those of the conventional methods.
Compressed sensing sodium MRI of cartilage at 7T: Preliminary study
Madelin, Guillaume; Chang, Gregory; Otazo, Ricardo; Jerschow, Alexej; Regatte, Ravinder R.
2012-01-01
Sodium MRI has been shown to be highly specific for glycosaminoglycan (GAG) content in articular cartilage, the loss of which is an early sign of osteoarthritis (OA). Quantitative sodium MRI techniques are therefore under development in order to detect and assess early biochemical degradation of cartilage, but due to low sodium NMR sensitivity and its low concentration, sodium images need long acquisition times (15-25 min) even at high magnetic fields and are typically of low resolution. In this preliminary study, we show that compressed sensing can be applied to reduce the acquisition time by a factor of 2 at 7T without losing sodium quantification accuracy. Alternatively, the nonlinear reconstruction technique can be used to denoise fully-sampled images. We expect to even further reduce this acquisition time by using parallel imaging techniques combined with SNR-improved 3D sequences at 3T and 7T.
Statistical mechanics analysis of thresholding 1-bit compressed sensing
Xu, Yingying; Kabashima, Yoshiyuki
2016-08-01
The one-bit compressed sensing framework aims to reconstruct a sparse signal by only using the sign information of its linear measurements. To compensate for the loss of scale information, past studies in the area have proposed recovering the signal by imposing an additional constraint on the l 2-norm of the signal. Recently, an alternative strategy that captures scale information by introducing a threshold parameter to the quantization process was advanced. In this paper, we analyze the typical behavior of thresholding 1-bit compressed sensing utilizing the replica method of statistical mechanics, so as to gain an insight for properly setting the threshold value. Our result shows that fixing the threshold at a constant value yields better performance than varying it randomly when the constant is optimally tuned, statistically. Unfortunately, the optimal threshold value depends on the statistical properties of the target signal, which may not be known in advance. In order to handle this inconvenience, we develop a heuristic that adaptively tunes the threshold parameter based on the frequency of positive (or negative) values in the binary outputs. Numerical experiments show that the heuristic exhibits satisfactory performance while incurring low computational cost.
Compressed-sensing application - Pre-stack kirchhoff migration
Aldawood, Ali
2013-01-01
Least-squares migration is a linearized form of waveform inversion that aims to enhance the spatial resolution of the subsurface reflectivity distribution and reduce the migration artifacts due to limited recording aperture, coarse sampling of sources and receivers, and low subsurface illumination. Least-squares migration, however, due to the nature of its minimization process, tends to produce smoothed and dispersed versions of the reflectivity of the subsurface. Assuming that the subsurface reflectivity distribution is sparse, we propose the addition of a non-quadratic L1-norm penalty term on the model space in the objective function. This aims to preserve the sparse nature of the subsurface reflectivity series and enhance resolution. We further use a compressed-sensing algorithm to solve the linear system, which utilizes the sparsity assumption to produce highly resolved migrated images. Thus, the Kirchhoff migration implementation is formulated as a Basis Pursuit denoise (BPDN) problem to obtain the sparse reflectivity model. Applications on synthetic data show that reflectivity models obtained using this compressed-sensing algorithm are highly accurate with optimal resolution.
Measurement Matrix Design for Compressive Sensing Based MIMO Radar
Yu, Y; Poor, H V
2011-01-01
In colocated multiple-input multiple-output (MIMO) radar using compressive sensing (CS), a receive node compresses its received signal via a linear transformation, referred to as measurement matrix. The samples are subsequently forwarded to a fusion center, where an L1-optimization problem is formulated and solved for target information. CS-based MIMO radar exploits the target sparsity in the angle-Doppler-range space and thus achieves the high localization performance of traditional MIMO radar but with many fewer measurements. The measurement matrix is vital for CS recovery performance. This paper considers the design of measurement matrices that achieve an optimality criterion that depends on the coherence of the sensing matrix (CSM) and/or signal-to-interference ratio (SIR). The first approach minimizes a performance penalty that is a linear combination of CSM and the inverse SIR. The second one imposes a structure on the measurement matrix and determines the parameters involved so that the SIR is enhanced...
Hierarchical Compressed Sensing for Cluster Based Wireless Sensor Networks
Directory of Open Access Journals (Sweden)
Vishal Krishna Singh
2016-02-01
Full Text Available Data transmission consumes significant amount of energy in large scale wireless sensor networks (WSNs. In such an environment, reducing the in-network communication and distributing the load evenly over the network can reduce the overall energy consumption and maximize the network lifetime significantly. In this work, the aforementioned problem of network lifetime and uneven energy consumption in large scale wireless sensor networks is addressed. This work proposes a hierarchical compressed sensing (HCS scheme to reduce the in-network communication during the data gathering process. Co-related sensor readings are collected via a hierarchical clustering scheme. A compressed sensing (CS based data processing scheme is devised to transmit the data from the source to the sink. The proposed HCS is able to identify the optimal position for the application of CS to achieve reduced and similar number of transmissions on all the nodes in the network. An activity map is generated to validate the reduced and uniformly distributed communication load of the WSN. Based on the number of transmissions per data gathering round, the bit-hop metric model is used to analyse the overall energy consumption. Simulation results validate the efficiency of the proposed method over the existing CS based approaches.
A novel image fusion approach based on compressive sensing
Yin, Hongpeng; Liu, Zhaodong; Fang, Bin; Li, Yanxia
2015-11-01
Image fusion can integrate complementary and relevant information of source images captured by multiple sensors into a unitary synthetic image. The compressive sensing-based (CS) fusion approach can greatly reduce the processing speed and guarantee the quality of the fused image by integrating fewer non-zero coefficients. However, there are two main limitations in the conventional CS-based fusion approach. Firstly, directly fusing sensing measurements may bring greater uncertain results with high reconstruction error. Secondly, using single fusion rule may result in the problems of blocking artifacts and poor fidelity. In this paper, a novel image fusion approach based on CS is proposed to solve those problems. The non-subsampled contourlet transform (NSCT) method is utilized to decompose the source images. The dual-layer Pulse Coupled Neural Network (PCNN) model is used to integrate low-pass subbands; while an edge-retention based fusion rule is proposed to fuse high-pass subbands. The sparse coefficients are fused before being measured by Gaussian matrix. The fused image is accurately reconstructed by Compressive Sampling Matched Pursuit algorithm (CoSaMP). Experimental results demonstrate that the fused image contains abundant detailed contents and preserves the saliency structure. These also indicate that our proposed method achieves better visual quality than the current state-of-the-art methods.
High dynamic range coherent imaging using compressed sensing.
He, Kuan; Sharma, Manoj Kumar; Cossairt, Oliver
2015-11-30
In both lensless Fourier transform holography (FTH) and coherent diffraction imaging (CDI), a beamstop is used to block strong intensities which exceed the limited dynamic range of the sensor, causing a loss in low-frequency information, making high quality reconstructions difficult or even impossible. In this paper, we show that an image can be recovered from high-frequencies alone, thereby overcoming the beamstop problem in both FTH and CDI. The only requirement is that the object is sparse in a known basis, a common property of most natural and manmade signals. The reconstruction method relies on compressed sensing (CS) techniques, which ensure signal recovery from incomplete measurements. Specifically, in FTH, we perform compressed sensing (CS) reconstruction of captured holograms and show that this method is applicable not only to standard FTH, but also multiple or extended reference FTH. For CDI, we propose a new phase retrieval procedure, which combines Fienup's hybrid input-output (HIO) method and CS. Both numerical simulations and proof-of-principle experiments are shown to demonstrate the effectiveness and robustness of the proposed CS-based reconstructions in dealing with missing data in both FTH and CDI. PMID:26698723
Liu, Xingbin; Mei, Wenbo; Du, Huiqian
2016-05-01
In this paper, a novel approach based on compressive sensing and chaos is proposed for simultaneously compressing, fusing and encrypting multi-modal images. The sparsely represented source images are firstly measured with the key-controlled pseudo-random measurement matrix constructed using logistic map, which reduces the data to be processed and realizes the initial encryption. Then the obtained measurements are fused by the proposed adaptive weighted fusion rule. The fused measurement is further encrypted into the ciphertext through an iterative procedure including improved random pixel exchanging technique and fractional Fourier transform. The fused image can be reconstructed by decrypting the ciphertext and using a recovery algorithm. The proposed algorithm not only reduces data volume but also simplifies keys, which improves the efficiency of transmitting data and distributing keys. Numerical results demonstrate the feasibility and security of the proposed scheme.
DEFF Research Database (Denmark)
Bø Fløystad, Jostein; Skjønsfjell, Eirik Torbjørn Bakken; Guizar-Sicairos, Manuel;
2015-01-01
spherical polymer bead coated with a nominally 210 nm metal shell. The beginning delamination of the shell from the core can be directly observed at an engineering strain of a few percent. Pre-existing defects are shown to dictate the deformation behavior of both core and shell. The strain state of the...... increasingly compressed polymer core is assessed quantitatively through the local densification at sub-micron resolution, supported by finite element analysis. Nanoscale mechanics is of rapidly growing importance in materials science, biotechnology and medicine, and this study demonstrates the use of coherent...
Institute of Scientific and Technical Information of China (English)
Zhensheng GAO; Zhong TAN; Guochun WU
2014-01-01
In this paper, we are concerned with the global existence and convergence rates of the smooth solutions for the compressible magnetohydrodynamic equations without heat conductivity, which is a hyperbolic-parabolic system. The global solutions are obtained by combining the local existence and a priori estimates if H3-norm of the initial perturbation around a constant states is small enough and its L1-norm is bounded. A priori decay-in-time estimates on the pressure, velocity and magnetic field are used to get the uniform bound of entropy. Moreover, the optimal convergence rates are also obtained.
Bø Fløystad, Jostein; Skjønsfjell, Eirik Torbjørn Bakken; Guizar-Sicairos, Manuel; Høydalsvik, Kristin; He, Jianying; Andreasen, Jens Wenzel; Zhang, Zhiliang; Breiby, Dag Werner
2015-01-01
Phase-contrast three-dimensional tomograms showing in unprecedented detail the mechanical response of a micro-composite subjected to a mechanical compression test are reported. The X-ray ptychography images reveal the deformation and fracture processes of a 10 μm diameter composite, consisting of a spherical polymer bead coated with a nominally 210 nm metal shell. The beginning delamination of the shell from the core can be directly observed at an engineering strain of a few percent. Pre-exis...
Zhou, Nanrun; Yang, Jianping; Tan, Changfa; Pan, Shumin; Zhou, Zhihong
2015-11-01
A new discrete fractional random transform based on two circular matrices is designed and a novel double-image encryption-compression scheme is proposed by combining compressive sensing with discrete fractional random transform. The two random circular matrices and the measurement matrix utilized in compressive sensing are constructed by using a two-dimensional sine Logistic modulation map. Two original images can be compressed, encrypted with compressive sensing and connected into one image. The resulting image is re-encrypted by Arnold transform and the discrete fractional random transform. Simulation results and security analysis demonstrate the validity and security of the scheme.
Straub, Jeremy; Kerlin, Scott
2016-05-01
The illicit creation of 3D printed keys is problematic as it can allow intruders nearly undetectable access to secure facilities. Prior work has discussed how keys can be created using visible light sensing. This paper builds on this work by evaluating the utility of keys produced with laser scanning. The quality of the model produced using a structured laser scanning approach is compared to the quality of a model produced using a similarly robust visible light sensing approach.
Robust Compressive Wideband Spectrum Sensing with Sampling Distortion
Liu, Yipeng
2010-01-01
Too high sampling rate is the bottleneck to wideband spectrum sensing for cognitive radio (CR). As the survey shows that the sensed signal has a sparse representation in frequency domain, compressed sensing (CS) can be used to transfer the sampling burden to the digital signal processor. But the standard sparse signal recovery ways do not consider the distortion in the analogue to information converter (AIC) which randomly samples the received signal with sub-Nyquist rate. In practice various non-ideal physical effects would lead to distortion in AIC. Here we model the sampling distortion as a bounded additive noise. An anti-sampling-distortion constraint (ASDC) in the form of a mixed \\ell 2 and \\ell 1 norm is deduced from the sparse signal model with bounded sampling error. And the sparse constraint is in the form of minimization of the \\ell 1 norm of the estimated signal. Then we combine the sparse constraint with the ASDC to get a novel robust sparse signal recovery operator with sampling distortion. Numer...
Learning-based compressed sensing for infrared image super resolution
Zhao, Yao; Sui, Xiubao; Chen, Qian; Wu, Shaochi
2016-05-01
This paper presents an infrared image super-resolution method based on compressed sensing (CS). First, the reconstruction model under the CS framework is established and a Toeplitz matrix is selected as the sensing matrix. Compared with traditional learning-based methods, the proposed method uses a set of sub-dictionaries instead of two coupled dictionaries to recover high resolution (HR) images. And Toeplitz sensing matrix allows the proposed method time-efficient. Second, all training samples are divided into several feature spaces by using the proposed adaptive k-means classification method, which is more accurate than the standard k-means method. On the basis of this approach, a complex nonlinear mapping from the HR space to low resolution (LR) space can be converted into several compact linear mappings. Finally, the relationships between HR and LR image patches can be obtained by multi-sub-dictionaries and HR infrared images are reconstructed by the input LR images and multi-sub-dictionaries. The experimental results show that the proposed method is quantitatively and qualitatively more effective than other state-of-the-art methods.
Compressive Wideband Spectrum Sensing for Fixed Frequency Spectrum Allocation
Liu, Yipeng
2010-01-01
Too high sampling rate is the bottleneck to wideband spectrum sensing for cognitive radio (CR). As the survey shows that the sensed signal has a sparse representation in frequency domain in the mass, compressed sensing (CS) can be used to transfer the sampling burden to the digital signal processor. An analog to information converter (AIC) can randomly sample the received signal with sub-Nyquist rate to obtained the random measurements. Considering that the static frequency spectrum allocation of primary radios means the bounds between different primary radios is known in advance, here we incorporate information of the spectrum boundaries between different primary user as a priori information to obtain a mixed l2/l1 norm denoising operator (MNDO). In the MNDO, the estimated power spectrum density (PSD) vector is divided into block sections with bounds corresponding different allocated primary radios. Different from previous standard l1-norm constraint on the whole PSD vector, a sum of the l2 norm of each sect...
Directory of Open Access Journals (Sweden)
Vibha Tiwari
2015-12-01
Full Text Available Compressive sensing theory enables faithful reconstruction of signals, sparse in domain $ \\Psi $, at sampling rate lesser than Nyquist criterion, while using sampling or sensing matrix $ \\Phi $ which satisfies restricted isometric property. The role played by sensing matrix $ \\Phi $ and sparsity matrix $ \\Psi $ is vital in faithful reconstruction. If the sensing matrix is dense then it takes large storage space and leads to high computational cost. In this paper, effort is made to design sparse sensing matrix with least incurred computational cost while maintaining quality of reconstructed image. The design approach followed is based on sparse block circulant matrix (SBCM with few modifications. The other used sparse sensing matrix consists of 15 ones in each column. The medical images used are acquired from US, MRI and CT modalities. The image quality measurement parameters are used to compare the performance of reconstructed medical images using various sensing matrices. It is observed that, since Gram matrix of dictionary matrix ($ \\Phi \\Psi \\mathrm{} $ is closed to identity matrix in case of proposed modified SBCM, therefore, it helps to reconstruct the medical images of very good quality.
Design and realization of random measurement scheme for compressed sensing
Institute of Scientific and Technical Information of China (English)
XIE Cheng-jun; XU Lin
2012-01-01
Design and realization of random measurement scheme for compressed sensing (CS) are presented in this paper,and lower limits of the measurement number are achieved when the precise reconstruction is realized.Four kinds of random measurement matrices are designed according to the constraint conditions of random measurement.The performance is tested employing the algorithm of stagewise orthogonal matching pursuit (StOMP).Results of the experiment show that lower limits of the measurement number are much better than the results described in Refs.[ 13-15].When the ratios of measurement to sparsity are 3.8 and 4.0,the mean relative errors of the reconstructed signals are 8.57 × 10-13 and 2.43 × 10-14,respectively,which confirms that the random measurement scheme of this paper is very effective.
Simultaneous Measurement of Complementary Observables with Compressive Sensing
Howland, Gregory A; Lum, Daniel J; Howell, John C
2016-01-01
The more information a measurement provides about a quantum system's position statistics, the less information a subsequent measurement can provide about the system's momentum statistics. This information trade-off is embodied in the entropic formulation of the uncertainty principle. Traditionally, uncertainty relations correspond to resolution limits; increasing a detector's position sensitivity decreases its momentum sensitivity and vice-versa. However, this is not required in general; for example, position information can instead be extracted at the cost of noise in momentum. Using random, partial projections in position followed by strong measurements in momentum, we efficiently determine the transverse-position and transverse-momentum distributions of an unknown optical field with a single set of measurements. The momentum distribution is directly imaged, while the position distribution is recovered using compressive sensing. At no point do we violate uncertainty relations; rather, we economize the use o...
Recovering network topologies via Taylor expansion and compressive sensing.
Li, Guangjun; Wu, Xiaoqun; Liu, Juan; Lu, Jun-an; Guo, Chi
2015-04-01
Gaining knowledge of the intrinsic topology of a complex dynamical network is the precondition to understand its evolutionary mechanisms and to control its dynamical and functional behaviors. In this article, a general framework is developed to recover topologies of complex networks with completely unknown node dynamics based on Taylor expansion and compressive sensing. Numerical simulations illustrate the feasibility and effectiveness of the proposed method. Moreover, this method is found to have good robustness to weak stochastic perturbations. Finally, the impact of two major factors on the topology identification performance is evaluated. This method provides a natural and direct point to reconstruct network topologies from measurable data, which is likely to have potential applicability in a wide range of fields.
Radial Velocity Data Analysis with Compressed Sensing Techniques
Hara, Nathan C.; Boué, G.; Laskar, J.; Correia, A. C. M.
2016-09-01
We present a novel approach for analysing radial velocity data that combines two features: all the planets are searched at once and the algorithm is fast. This is achieved by utilizing compressed sensing techniques, which are modified to be compatible with the Gaussian processes framework. The resulting tool can be used like a Lomb-Scargle periodogram and has the same aspect but with much fewer peaks due to aliasing. The method is applied to five systems with published radial velocity data sets: HD 69830, HD 10180, 55 Cnc, GJ 876 and a simulated very active star. The results are fully compatible with previous analysis, though obtained more straightforwardly. We further show that 55 Cnc e and f could have been respectively detected and suspected in early measurements from the Lick observatory and Hobby-Eberly Telescope available in 2004, and that frequencies due to dynamical interactions in GJ 876 can be seen.
Radial Velocity Data Analysis with Compressed Sensing Techniques
Hara, Nathan C; Laskar, Jacques; Correia, Alexandre C M
2016-01-01
We present a novel approach for analysing radial velocity data that combines two features: all the planets are searched at once and the algorithm is fast. This is achieved by utilizing compressed sensing techniques, which are modified to be compatible with the Gaussian processes framework. The resulting tool can be used like a Lomb-Scargle periodogram and has the same aspect but with much fewer peaks due to aliasing. The method is applied to five systems with published radial velocity data sets: HD 69830, HD 10180, 55 Cnc, GJ 876 and a simulated very active star. The results are fully compatible with previous analysis, though obtained more straightforwardly. We further show that 55 Cnc e and f could have been respectively detected and suspected in early measurements from the Lick observatory and Hobby-Eberly Telescope available in 2004, and that frequencies due to dynamical interactions in GJ 876 can be seen.
Fast Second Degree Total Variation Method for Image Compressive Sensing.
Liu, Pengfei; Xiao, Liang; Zhang, Jun
2015-01-01
This paper presents a computationally efficient algorithm for image compressive sensing reconstruction using a second degree total variation (HDTV2) regularization. Firstly, a preferably equivalent formulation of the HDTV2 functional is derived, which can be formulated as a weighted L1-L2 mixed norm of second degree image derivatives under the spectral decomposition framework. Secondly, using the equivalent formulation of HDTV2, we introduce an efficient forward-backward splitting (FBS) scheme to solve the HDTV2-based image reconstruction model. Furthermore, from the averaged non-expansive operator point of view, we make a detailed analysis on the convergence of the proposed FBS algorithm. Experiments on medical images demonstrate that the proposed method outperforms several fast algorithms of the TV and HDTV2 reconstruction models in terms of peak signal to noise ratio (PSNR), structural similarity index (SSIM) and convergence speed.
Adaptive-Rate Compressive Sensing Using Side Information.
Warnell, Garrett; Bhattacharya, Sourabh; Chellappa, Rama; Başar, Tamer
2015-11-01
We provide two novel adaptive-rate compressive sensing (CS) strategies for sparse, time-varying signals using side information. The first method uses extra cross-validation measurements, and the second one exploits extra low-resolution measurements. Unlike the majority of current CS techniques, we do not assume that we know an upper bound on the number of significant coefficients that comprises the images in the video sequence. Instead, we use the side information to predict the number of significant coefficients in the signal at the next time instant. We develop our techniques in the specific context of background subtraction using a spatially multiplexing CS camera such as the single-pixel camera. For each image in the video sequence, the proposed techniques specify a fixed number of CS measurements to acquire and adjust this quantity from image to image. We experimentally validate the proposed methods on real surveillance video sequences.
Recoverability analysis for modified compressive sensing with partially known support.
Directory of Open Access Journals (Sweden)
Jun Zhang
Full Text Available The recently proposed modified-compressive sensing (modified-CS, which utilizes the partially known support as prior knowledge, significantly improves the performance of recovering sparse signals. However, modified-CS depends heavily on the reliability of the known support. An important problem, which must be studied further, is the recoverability of modified-CS when the known support contains a number of errors. In this letter, we analyze the recoverability of modified-CS in a stochastic framework. A sufficient and necessary condition is established for exact recovery of a sparse signal. Utilizing this condition, the recovery probability that reflects the recoverability of modified-CS can be computed explicitly for a sparse signal with [Formula: see text] nonzero entries. Simulation experiments have been carried out to validate our theoretical results.
Compressive sensing via nonlocal low-rank regularization.
Dong, Weisheng; Shi, Guangming; Li, Xin; Ma, Yi; Huang, Feng
2014-08-01
Sparsity has been widely exploited for exact reconstruction of a signal from a small number of random measurements. Recent advances have suggested that structured or group sparsity often leads to more powerful signal reconstruction techniques in various compressed sensing (CS) studies. In this paper, we propose a nonlocal low-rank regularization (NLR) approach toward exploiting structured sparsity and explore its application into CS of both photographic and MRI images. We also propose the use of a nonconvex log det ( X) as a smooth surrogate function for the rank instead of the convex nuclear norm and justify the benefit of such a strategy using extensive experiments. To further improve the computational efficiency of the proposed algorithm, we have developed a fast implementation using the alternative direction multiplier method technique. Experimental results have shown that the proposed NLR-CS algorithm can significantly outperform existing state-of-the-art CS techniques for image recovery.
Simultaneous measurement of complementary observables with compressive sensing.
Howland, Gregory A; Schneeloch, James; Lum, Daniel J; Howell, John C
2014-06-27
The more information a measurement provides about a quantum system's position statistics, the less information a subsequent measurement can provide about the system's momentum statistics. This information trade-off is embodied in the entropic formulation of the uncertainty principle. Traditionally, uncertainly relations correspond to resolution limits; increasing a detector's position sensitivity decreases its momentum sensitivity and vice versa. However, this is not required in general; for example, position information can instead be extracted at the cost of noise in momentum. Using random, partial projections in position followed by strong measurements in momentum, we efficiently determine the transverse-position and transverse-momentum distributions of an unknown optical field with a single set of measurements. The momentum distribution is directly imaged, while the position distribution is recovered using compressive sensing. At no point do we violate uncertainty relations; rather, we economize the use of information we obtain.
Recovering network topologies via Taylor expansion and compressive sensing
Energy Technology Data Exchange (ETDEWEB)
Li, Guangjun; Liu, Juan, E-mail: xqwu@whu.edu.cn, E-mail: liujuanjp@163.com [Computer School, Wuhan University, Hubei 430072 (China); Wu, Xiaoqun, E-mail: xqwu@whu.edu.cn, E-mail: liujuanjp@163.com; Lu, Jun-an [School of Mathematics and Statistics, Wuhan University, Hubei 430072 (China); Guo, Chi [Global Navigation Satellite System Research Center, Wuhan University, Hubei 430072 (China)
2015-04-15
Gaining knowledge of the intrinsic topology of a complex dynamical network is the precondition to understand its evolutionary mechanisms and to control its dynamical and functional behaviors. In this article, a general framework is developed to recover topologies of complex networks with completely unknown node dynamics based on Taylor expansion and compressive sensing. Numerical simulations illustrate the feasibility and effectiveness of the proposed method. Moreover, this method is found to have good robustness to weak stochastic perturbations. Finally, the impact of two major factors on the topology identification performance is evaluated. This method provides a natural and direct point to reconstruct network topologies from measurable data, which is likely to have potential applicability in a wide range of fields.
Compressed Sensing Inspired Image Reconstruction from Overlapped Projections
Directory of Open Access Journals (Sweden)
Lin Yang
2010-01-01
Full Text Available The key idea discussed in this paper is to reconstruct an image from overlapped projections so that the data acquisition process can be shortened while the image quality remains essentially uncompromised. To perform image reconstruction from overlapped projections, the conventional reconstruction approach (e.g., filtered backprojection (FBP algorithms cannot be directly used because of two problems. First, overlapped projections represent an imaging system in terms of summed exponentials, which cannot be transformed into a linear form. Second, the overlapped measurement carries less information than the traditional line integrals. To meet these challenges, we propose a compressive sensing-(CS- based iterative algorithm for reconstruction from overlapped data. This algorithm starts with a good initial guess, relies on adaptive linearization, and minimizes the total variation (TV. Then, we demonstrated the feasibility of this algorithm in numerical tests.
Compressive sensing for feedback reduction in MIMO broadcast channels
Eltayeb, Mohammed E.
2014-09-01
In multi-antenna broadcast networks, the base stations (BSs) rely on the channel state information (CSI) of the users to perform user scheduling and downlink transmission. However, in networks with large number of users, obtaining CSI from all users is arduous, if not impossible, in practice. This paper proposes channel feedback reduction techniques based on the theory of compressive sensing (CS), which permits the BS to obtain CSI with acceptable recovery guarantees under substantially reduced feedback overhead. Additionally, assuming noisy CS measurements at the BS, inexpensive ways for improving post-CS detection are explored. The proposed techniques are shown to reduce the feedback overhead, improve CS detection at the BS, and achieve a sum-rate close to that obtained by noiseless dedicated feedback channels.
Robust signal recovery algorithm for structured perturbation compressive sensing
Institute of Scientific and Technical Information of China (English)
Youhua Wang; Jianqiu Zhang
2016-01-01
It is understood that the sparse signal recovery with a standard compressive sensing (CS) strategy requires the measurement matrix known as a priori. The measurement matrix is, however, often perturbed in a practical application. In order to handle such a case, an optimization problem by exploiting the sparsity characteristics of both the perturbations and signals is formulated. An algorithm named as the sparse perturbation signal recovery algorithm (SPSRA) is then pro-posed to solve the formulated optimization problem. The analytical results show that our SPSRA can simultaneously recover the signal and perturbation vectors by an alternative iteration way, while the convergence of the SPSRA is also analyticaly given and guaranteed. Moreover, the support patterns of the sparse signal and structured perturbation shown are the same and can be exploited to improve the estimation accuracy and reduce the computation complexity of the algorithm. The numerical simulation results verify the effectiveness of analytical ones.
The MUSIC Algorithm for Sparse Objects: A Compressed Sensing Analysis
Fannjiang, Albert C
2010-01-01
The MUSIC algorithm, with its extension for imaging sparse {\\em extended} objects, is analyzed by compressed sensing (CS) techniques. The notion of restricted isometry property (RIP) and an upper bound on the restricted isometry constant (RIC) are employed to establish sufficient conditions for the exact localization by MUSIC with or without the presence of noise. In the noiseless case, the sufficient condition gives an upper bound on the numbers of random sampling and incident directions necessary for exact localization. In the noisy case, the sufficient condition assumes additionally an upper bound for the noise-to-object ratio (NOR) in terms of the RIC. Rigorous comparison of performance between MUSIC and the CS minimization principle, Lasso, is given. In general, the MUSIC algorithm guarantees to recover, with high probability, $s$ scatterers with $n=\\cO(s^2)$ random sampling and incident directions and sufficiently high frequency. For the favorable imaging geometry where the scatterers are distributed on...
Single image non-uniformity correction using compressive sensing
Jian, Xian-zhong; Lu, Rui-zhi; Guo, Qiang; Wang, Gui-pu
2016-05-01
A non-uniformity correction (NUC) method for an infrared focal plane array imaging system was proposed. The algorithm, based on compressive sensing (CS) of single image, overcame the disadvantages of "ghost artifacts" and bulk calculating costs in traditional NUC algorithms. A point-sampling matrix was designed to validate the measurements of CS on the time domain. The measurements were corrected using the midway infrared equalization algorithm, and the missing pixels were solved with the regularized orthogonal matching pursuit algorithm. Experimental results showed that the proposed method can reconstruct the entire image with only 25% pixels. A small difference was found between the correction results using 100% pixels and the reconstruction results using 40% pixels. Evaluation of the proposed method on the basis of the root-mean-square error, peak signal-to-noise ratio, and roughness index (ρ) proved the method to be robust and highly applicable.
Multi-Sparse Signal Recovery for Compressive Sensing
Liu, Yipeng; Matic, Vladimir; De Vos, Maarten; Van Huffel, Sabine
2012-01-01
Signal recovery is one of the key techniques of Compressive sensing (CS). It reconstructs the original signal from the linear sub-Nyquist measurements. Classical methods exploit the sparsity in one domain to formulate the L0 norm optimization. Recent investigation shows that some signals are sparse in multiple domains. To further improve the signal reconstruction performance, we can exploit this multi-sparsity to generate a new convex programming model. The latter is formulated with multiple sparsity constraints in multiple domains and the linear measurement fitting constraint. It improves signal recovery performance by additional a priori information. Since some EMG signals exhibit sparsity both in time and frequency domains, we take them as example in numerical experiments. Results show that the newly proposed method achieves better performance for multi-sparse signals.
Compressed sensing in MRI – mathematical preliminaries and basic examples
Directory of Open Access Journals (Sweden)
Błaszczyk Łukasz
2016-03-01
Full Text Available In magnetic resonance imaging (MRI, k-space sampling, due to physical restrictions, is very time-consuming. It cannot be much improved using classical Nyquist-based sampling theory. Recent developments utilize the fact that MR images are sparse in some representations (i.e. wavelet coefficients. This new theory, created by Candès and Romberg, called compressed sensing (CS, shows that images with sparse representations can be recovered from randomly undersampled k-space data, by using nonlinear reconstruction algorithms (i.e. l1-norm minimization. Throughout this paper, mathematical preliminaries of CS are outlined, in the form introduced by Candès. We describe the main conditions for measurement matrices and recovery algorithms and present a basic example, showing that while the method really works (reducing the time of MR examination, there are some major problems that need to be taken into consideration.
Efficient variational inference in large-scale Bayesian compressed sensing
Papandreou, George
2011-01-01
We study linear models under heavy-tailed priors from a probabilistic viewpoint. Instead of computing a single sparse most probable (MAP) solution as in standard compressed sensing, the focus in the Bayesian framework shifts towards capturing the full posterior distribution on the latent variables, which allows quantifying the estimation uncertainty and learning model parameters using maximum likelihood. The exact posterior distribution under the sparse linear model is intractable and we concentrate on a number of alternative variational Bayesian techniques to approximate it. Repeatedly computing Gaussian variances turns out to be a key requisite for all these approximations and constitutes the main computational bottleneck in applying variational techniques in large-scale problems. We leverage on the recently proposed Perturb-and-MAP algorithm for drawing exact samples from Gaussian Markov random fields (GMRF). The main technical contribution of our paper is to show that estimating Gaussian variances using a...
Sampling theorems and compressive sensing on the sphere
McEwen, J D; Thiran, J -Ph; Vandergheynst, P; Van De Ville, D; Wiaux, Y
2011-01-01
We discuss a novel sampling theorem on the sphere developed by McEwen & Wiaux recently through an association between the sphere and the torus. To represent a band-limited signal exactly, this new sampling theorem requires less than half the number of samples of other equiangular sampling theorems on the sphere, such as the canonical Driscoll & Healy sampling theorem. A reduction in the number of samples required to represent a band-limited signal on the sphere has important implications for compressive sensing, both in terms of the dimensionality and sparsity of signals. We illustrate the impact of this property with an inpainting problem on the sphere, where we show superior reconstruction performance when adopting the new sampling theorem.
Compressed sensing for radio interferometric imaging: review and future direction
McEwen, J D
2011-01-01
Radio interferometry is a powerful technique for astronomical imaging. The theory of Compressed Sensing (CS) has been applied recently to the ill-posed inverse problem of recovering images from the measurements taken by radio interferometric telescopes. We review novel CS radio interferometric imaging techniques, both at the level of acquisition and reconstruction, and discuss their superior performance relative to traditional approaches. In order to remain as close to the theory of CS as possible, these techniques necessarily consider idealised interferometric configurations. To realise the enhancement in quality provided by these novel techniques on real radio interferometric observations, their extension to realistic interferometric configurations is now of considerable importance. We also chart the future direction of research required to achieve this goal.
Bayesian compressive sensing for ultrawideband inverse scattering in random media
Fouda, A E
2014-01-01
We develop an ultrawideband (UWB) inverse scattering technique for reconstructing continuous random media based on Bayesian compressive sensing. In addition to providing maximum a posteriori estimates of the unknown weights, Bayesian inversion provides estimate of the confidence level of the solution, as well as a systematic approach for optimizing subsequent measurement(s) to maximize information gain. We impose sparsity priors directly on spatial harmonics to exploit the spatial correlation exhibited by continuous media, and solve for their posterior probability density functions efficiently using a fast relevance vector machine. We linearize the problem using the first-order Born approximation which enables us to combine, in a single inversion, measurements from multiple transmitters and ultrawideband frequencies. We extend the method to high-contrast media using the distorted-Born iterative method. We apply time-reversal strategies to adaptively focus the inversion effort onto subdomains of interest, and ...
Performance Bounds for Grouped Incoherent Measurements in Compressive Sensing
Polak, Adam C; Goeckel, Dennis L
2012-01-01
Compressive sensing (CS) allows for acquisition of sparse signals at sampling rates significantly lower than the Nyquist rate required for bandlimited signals. Recovery guarantees for CS are generally derived based on the assumption that measurement projections are selected independently at random. However, for many practical signal acquisition applications, this assumption is violated as the projections must be taken in groups. In this paper, we consider such applications and derive requirements on the number of measurements needed for successful recovery of signals when groups of dependent projections are taken at random. We find a penalty factor on the number of required measurements with respect to the standard CS scheme that employs conventional independent measurement selection and verify the predicted penalty through simulations.
Compressive sensing as a paradigm for building physics models
Nelson, Lance J.; Hart, Gus L. W.; Zhou, Fei; Ozoliņš, Vidvuds
2013-01-01
The widely accepted intuition that the important properties of solids are determined by a few key variables underpins many methods in physics. Though this reductionist paradigm is applicable in many physical problems, its utility can be limited because the intuition for identifying the key variables often does not exist or is difficult to develop. Machine learning algorithms (genetic programming, neural networks, Bayesian methods, etc.) attempt to eliminate the a priori need for such intuition but often do so with increased computational burden and human time. A recently developed technique in the field of signal processing, compressive sensing (CS), provides a simple, general, and efficient way of finding the key descriptive variables. CS is a powerful paradigm for model building; we show that its models are more physical and predict more accurately than current state-of-the-art approaches and can be constructed at a fraction of the computational cost and user effort.
Compressive Sensing for Feedback Reduction in Wireless Multiuser Networks
Elkhalil, Khalil
2015-05-01
User/relay selection is a simple technique that achieves spatial diversity in multiuser networks. However, for user/relay selection algorithms to make a selection decision, channel state information (CSI) from all cooperating users/relays is usually required at a central node. This requirement poses two important challenges. Firstly, CSI acquisition generates a great deal of feedback overhead (air-time) that could result in significant transmission delays. Secondly, the fed-back channel information is usually corrupted by additive noise. This could lead to transmission outages if the central node selects the set of cooperating relays based on inaccurate feedback information. Motivated by the aforementioned challenges, we propose a limited feedback user/relay selection scheme that is based on the theory of compressed sensing. Firstly, we introduce a limited feedback relay selection algorithm for a multicast relay network. The proposed algorithm exploits the theory of compressive sensing to first obtain the identity of the “strong” relays with limited feedback air-time. Following that, the CSI of the selected relays is estimated using minimum mean square error estimation without any additional feedback. To minimize the effect of noise on the fed-back CSI, we introduce a back-off strategy that optimally backs-off on the noisy received CSI. In the second part of the thesis, we propose a feedback reduction scheme for full-duplex relay-aided multiuser networks. The proposed scheme permits the base station (BS) to obtain channel state information (CSI) from a subset of strong users under substantially reduced feedback overhead. More specifically, we cast the problem of user identification and CSI estimation as a block sparse signal recovery problem in compressive sensing (CS). Using existing CS block recovery algorithms, we first obtain the identity of the strong users and then estimate their CSI using the best linear unbiased estimator (BLUE). Moreover, we derive the
Underwater Acoustic Matched Field Imaging Based on Compressed Sensing
Directory of Open Access Journals (Sweden)
Huichen Yan
2015-10-01
Full Text Available Matched field processing (MFP is an effective method for underwater target imaging and localizing, but its performance is not guaranteed due to the nonuniqueness and instability problems caused by the underdetermined essence of MFP. By exploiting the sparsity of the targets in an imaging area, this paper proposes a compressive sensing MFP (CS-MFP model from wave propagation theory by using randomly deployed sensors. In addition, the model’s recovery performance is investigated by exploring the lower bounds of the coherence parameter of the CS dictionary. Furthermore, this paper analyzes the robustness of CS-MFP with respect to the displacement of the sensors. Subsequently, a coherence-excluding coherence optimized orthogonal matching pursuit (CCOOMP algorithm is proposed to overcome the high coherent dictionary problem in special cases. Finally, some numerical experiments are provided to demonstrate the effectiveness of the proposed CS-MFP method.
Development of a Neutron Spectroscopic System Utilizing Compressed Sensing Measurements
Directory of Open Access Journals (Sweden)
Vargas Danilo
2016-01-01
Full Text Available A new approach to neutron detection capable of gathering spectroscopic information has been demonstrated. The approach relies on an asymmetrical arrangement of materials, geometry, and an ability to change the orientation of the detector with respect to the neutron field. Measurements are used to unfold the energy characteristics of the neutron field using a new theoretical framework of compressed sensing. Recent theoretical results show that the number of multiplexed samples can be lower than the full number of traditional samples while providing the ability to have some super-resolution. Furthermore, the solution approach does not require a priori information or inclusion of physics models. Utilizing the MCNP code, a number of candidate detector geometries and materials were modeled. Simulations were carried out for a number of neutron energies and distributions with preselected orientations for the detector. The resulting matrix (A consists of n rows associated with orientation and m columns associated with energy and distribution where n < m. The library of known responses is used for new measurements Y (n × 1 and the solver is able to determine the system, Y = Ax where x is a sparse vector. Therefore, energy spectrum measurements are a combination of the energy distribution information of the identified elements of A. This approach allows for determination of neutron spectroscopic information using a single detector system with analog multiplexing. The analog multiplexing allows the use of a compressed sensing solution similar to approaches used in other areas of imaging. A single detector assembly provides improved flexibility and is expected to reduce uncertainty associated with current neutron spectroscopy measurement.
Development of a Neutron Spectroscopic System Utilizing Compressed Sensing Measurements
Vargas, Danilo; Cable Kurwitz, R.; Carron, Igor; DePriest, K. Russell
2016-02-01
A new approach to neutron detection capable of gathering spectroscopic information has been demonstrated. The approach relies on an asymmetrical arrangement of materials, geometry, and an ability to change the orientation of the detector with respect to the neutron field. Measurements are used to unfold the energy characteristics of the neutron field using a new theoretical framework of compressed sensing. Recent theoretical results show that the number of multiplexed samples can be lower than the full number of traditional samples while providing the ability to have some super-resolution. Furthermore, the solution approach does not require a priori information or inclusion of physics models. Utilizing the MCNP code, a number of candidate detector geometries and materials were modeled. Simulations were carried out for a number of neutron energies and distributions with preselected orientations for the detector. The resulting matrix (A) consists of n rows associated with orientation and m columns associated with energy and distribution where n library of known responses is used for new measurements Y (n × 1) and the solver is able to determine the system, Y = Ax where x is a sparse vector. Therefore, energy spectrum measurements are a combination of the energy distribution information of the identified elements of A. This approach allows for determination of neutron spectroscopic information using a single detector system with analog multiplexing. The analog multiplexing allows the use of a compressed sensing solution similar to approaches used in other areas of imaging. A single detector assembly provides improved flexibility and is expected to reduce uncertainty associated with current neutron spectroscopy measurement.
Compressive sensing based wireless sensor for structural health monitoring
Bao, Yuequan; Zou, Zilong; Li, Hui
2014-03-01
Data loss is a common problem for monitoring systems based on wireless sensors. Reliable communication protocols, which enhance communication reliability by repetitively transmitting unreceived packets, is one approach to tackle the problem of data loss. An alternative approach allows data loss to some extent and seeks to recover the lost data from an algorithmic point of view. Compressive sensing (CS) provides such a data loss recovery technique. This technique can be embedded into smart wireless sensors and effectively increases wireless communication reliability without retransmitting the data. The basic idea of CS-based approach is that, instead of transmitting the raw signal acquired by the sensor, a transformed signal that is generated by projecting the raw signal onto a random matrix, is transmitted. Some data loss may occur during the transmission of this transformed signal. However, according to the theory of CS, the raw signal can be effectively reconstructed from the received incomplete transformed signal given that the raw signal is compressible in some basis and the data loss ratio is low. This CS-based technique is implemented into the Imote2 smart sensor platform using the foundation of Illinois Structural Health Monitoring Project (ISHMP) Service Tool-suite. To overcome the constraints of limited onboard resources of wireless sensor nodes, a method called random demodulator (RD) is employed to provide memory and power efficient construction of the random sampling matrix. Adaptation of RD sampling matrix is made to accommodate data loss in wireless transmission and meet the objectives of the data recovery. The embedded program is tested in a series of sensing and communication experiments. Examples and parametric study are presented to demonstrate the applicability of the embedded program as well as to show the efficacy of CS-based data loss recovery for real wireless SHM systems.
Castaldo, Raffaele; De Novellis, Vincenzo; Lollino, Piernicola; Manunta, Michele; Tizzani, Pietro
2015-04-01
The new challenge that the research in slopes instabilities phenomena is going to tackle is the effective integration and joint exploitation of remote sensing measurements with in situ data and observations to study and understand the sub-surface interactions, the triggering causes, and, in general, the long term behaviour of the investigated landslide phenomenon. In this context, a very promising approach is represented by Finite Element (FE) techniques, which allow us to consider the intrinsic complexity of the mass movement phenomena and to effectively benefit from multi source observations and data. In this context, we perform a three dimensional (3D) numerical model of the Ivancich (Assisi, Central Italy) instability phenomenon. In particular, we apply an inverse FE method based on a Genetic Algorithm optimization procedure, benefitting from advanced DInSAR measurements, retrieved through the full resolution Small Baseline Subset (SBAS) technique, and an inclinometric array distribution. To this purpose we consider the SAR images acquired from descending orbit by the COSMO-SkyMed (CSK) X-band radar constellation, from December 2009 to February 2012. Moreover the optimization input dataset is completed by an array of eleven inclinometer measurements, from 1999 to 2006, distributed along the unstable mass. The landslide body is formed of debris material sliding on a arenaceous marl substratum, with a thin shear band detected using borehole and inclinometric data, at depth ranging from 20 to 60 m. Specifically, we consider the active role of this shear band in the control of the landslide evolution process. A large field monitoring dataset of the landslide process, including at-depth piezometric and geological borehole observations, were available. The integration of these datasets allows us to develop a 3D structural geological model of the considered slope. To investigate the dynamic evolution of a landslide, various physical approaches can be considered
Institute of Scientific and Technical Information of China (English)
周新军; 郭佑民; 陈利军
2016-01-01
患侧三叉神经脑池段与周围血管的空间关系，以术中镜下所见为金标准，对比分析3D‐TOF‐MRA和3D‐FIESTA‐C序列预判接触血管的效能。结果判定是否存在责任血管，3D‐TOF‐MRA和3D‐FIESTA‐C序列灵敏度分别为85．7％、89．3％，特异度为75．0％、100％，准确率为85．0％、90．0％（P＝1．000）。在责任血管中，3D‐TOF‐MRA和3D‐FIESTA‐C序列判定责任动脉灵敏度分别为94．1％、88．2％（P＝0．244），而责任静脉灵敏度为0．00％、88．2％（P＝0．009）。结论3D‐FIESTA‐C与3D‐TOF‐MRA序列均能有效显示责任血管，3D‐FIESTA‐C对责任静脉的显示优于3D‐TOF‐MRA ，可作为术前病因诊断的有力补充。
Two-Dimensional DOA Estimation in Compressed Sensing with Compressive-Reduced Dimension-lp-MUSIC
Directory of Open Access Journals (Sweden)
Weijian Si
2015-01-01
Full Text Available This paper presents a novel two-dimensional (2D direction of arrival (DOA estimation method in compressed sensing (CS to remove the estimation failure problem and achieve superior performance. The proposed method separates the steering vector into two parts to construct two corresponding noise subspaces by introducing electric angles. Then, electric angles are estimated based on the constructed noise subspaces. In order to estimate the azimuth and elevation angles in terms of estimates of electric angles, arc-tangent operations are exploited. The arc-tangent is a one-to-one function and allows the value of the argument to be larger than unity so that the proposed method never fails. The proposed method can avoid pair matching to reduce the computational complexity and extend the number of snapshots to improve performance. Simulation results show that the proposed method can avoid estimation failure occurrence and has superior performance as compared to existing methods.
Active remote sensing of snow using NMM3D/DMRT and comparison with CLPX II airborne data
Xu, X.; Liang, D.; Tsang, L.; Andreadis, K.M.; Josberger, E.G.; Lettenmaier, D.P.; Cline, D.W.; Yueh, S.H.
2010-01-01
We applied the Numerical Maxwell Model of three-dimensional simulations (NMM3D) in the Dense Media Radiative Theory (DMRT) to calculate backscattering coefficients. The particles' positions are computer-generated and the subsequent Foldy-Lax equations solved numerically. The phase matrix in NMM3D has significant cross-polarization, particularly when the particles are densely packed. The NMM3D model is combined with DMRT in calculating the microwave scattering by dry snow. The NMM3D/DMRT equations are solved by an iterative solution up to the second order in the case of small to moderate optical thickness. The numerical results of NMM3D/DMRT are illustrated and compared with QCA/DMRT. The QCA/DMRT and NMM3D/DMRT results are also applied to compare with data from two specific datasets from the second Cold Land Processes Experiment (CLPX II) in Alaska and Colorado. The data are obtained at the Ku-band (13.95 GHz) observations using airborne imaging polarimetric scatterometer (POLSCAT). It is shown that the model predictions agree with the field measurements for both co-polarization and cross-polarization. For the Alaska region, the average snow depth and snow density are used as the inputs for DMRT. The grain size, selected from within the range of the ground measurements, is used as a best-fit parameter within the range. For the Colorado region, we use the Variable Infiltration Capacity Model (VIC) to obtain the input snow profiles for NMM3D/DMRT. ?? 2010 IEEE.
Recent results of medium wave infrared compressive sensing.
Mahalanobis, A; Shilling, R; Murphy, R; Muise, R
2014-12-01
The application of compressive sensing (CS) for imaging has been extensively investigated and the underlying mathematical principles are well understood. The theory of CS is motivated by the sparse nature of real-world signals and images, and provides a framework in which high-resolution information can be recovered from low-resolution measurements. This, in turn, enables hardware concepts that require much fewer detectors than a conventional sensor. For infrared imagers there is a significant potential impact on the cost and footprint of the sensor. When smaller focal plane arrays (FPAs) to obtain large images are allowed, large formats FPAs are unnecessary. From a hardware standpoint, this benefit is independent of the actual level of compression and effective data rate reduction, which depend on the choice of codes and information recovery algorithm. Toward this end, we used a CS testbed for mid-wave infrared (MWIR) to experimentally show that information at high spatial resolution can be successfully recovered from measurements made with a small FPA. We describe the highly parallel and scalable CS architecture of the testbed, and its implementation using a reflective spatial light modulator and a focal plane array with variable pixel sizes. We also discuss the impact of real-world devices and the effect of sensor calibration that must be addressed in practice. Finally, we present preliminary results of image reconstruction, which demonstrate the testbed operation. These results experimentally confirm that high-resolution spatial information (for tasks such as imaging and target detection) can be successfully recovered from low-resolution measurements. We also discuss the potential system-level benefits of CS for infrared imaging, and some of the challenges that must be addressed in future infrared CS imagers designs.
A Computational model for compressed sensing RNAi cellular screening
Directory of Open Access Journals (Sweden)
Tan Hua
2012-12-01
Full Text Available Abstract Background RNA interference (RNAi becomes an increasingly important and effective genetic tool to study the function of target genes by suppressing specific genes of interest. This system approach helps identify signaling pathways and cellular phase types by tracking intensity and/or morphological changes of cells. The traditional RNAi screening scheme, in which one siRNA is designed to knockdown one specific mRNA target, needs a large library of siRNAs and turns out to be time-consuming and expensive. Results In this paper, we propose a conceptual model, called compressed sensing RNAi (csRNAi, which employs a unique combination of group of small interfering RNAs (siRNAs to knockdown a much larger size of genes. This strategy is based on the fact that one gene can be partially bound with several small interfering RNAs (siRNAs and conversely, one siRNA can bind to a few genes with distinct binding affinity. This model constructs a multi-to-multi correspondence between siRNAs and their targets, with siRNAs much fewer than mRNA targets, compared with the conventional scheme. Mathematically this problem involves an underdetermined system of equations (linear or nonlinear, which is ill-posed in general. However, the recently developed compressed sensing (CS theory can solve this problem. We present a mathematical model to describe the csRNAi system based on both CS theory and biological concerns. To build this model, we first search nucleotide motifs in a target gene set. Then we propose a machine learning based method to find the effective siRNAs with novel features, such as image features and speech features to describe an siRNA sequence. Numerical simulations show that we can reduce the siRNA library to one third of that in the conventional scheme. In addition, the features to describe siRNAs outperform the existing ones substantially. Conclusions This csRNAi system is very promising in saving both time and cost for large-scale RNAi
A Computational model for compressed sensing RNAi cellular screening
2012-01-01
Background RNA interference (RNAi) becomes an increasingly important and effective genetic tool to study the function of target genes by suppressing specific genes of interest. This system approach helps identify signaling pathways and cellular phase types by tracking intensity and/or morphological changes of cells. The traditional RNAi screening scheme, in which one siRNA is designed to knockdown one specific mRNA target, needs a large library of siRNAs and turns out to be time-consuming and expensive. Results In this paper, we propose a conceptual model, called compressed sensing RNAi (csRNAi), which employs a unique combination of group of small interfering RNAs (siRNAs) to knockdown a much larger size of genes. This strategy is based on the fact that one gene can be partially bound with several small interfering RNAs (siRNAs) and conversely, one siRNA can bind to a few genes with distinct binding affinity. This model constructs a multi-to-multi correspondence between siRNAs and their targets, with siRNAs much fewer than mRNA targets, compared with the conventional scheme. Mathematically this problem involves an underdetermined system of equations (linear or nonlinear), which is ill-posed in general. However, the recently developed compressed sensing (CS) theory can solve this problem. We present a mathematical model to describe the csRNAi system based on both CS theory and biological concerns. To build this model, we first search nucleotide motifs in a target gene set. Then we propose a machine learning based method to find the effective siRNAs with novel features, such as image features and speech features to describe an siRNA sequence. Numerical simulations show that we can reduce the siRNA library to one third of that in the conventional scheme. In addition, the features to describe siRNAs outperform the existing ones substantially. Conclusions This csRNAi system is very promising in saving both time and cost for large-scale RNAi screening experiments which
Accelerated radial Fourier-velocity encoding using compressed sensing
Energy Technology Data Exchange (ETDEWEB)
Hilbert, Fabian; Han, Dietbert [Wuerzburg Univ. (Germany). Inst. of Radiology; Wech, Tobias; Koestler, Herbert [Wuerzburg Univ. (Germany). Inst. of Radiology; Wuerzburg Univ. (Germany). Comprehensive Heart Failure Center (CHFC)
2014-10-01
Purpose:Phase Contrast Magnetic Resonance Imaging (MRI) is a tool for non-invasive determination of flow velocities inside blood vessels. Because Phase Contrast MRI only measures a single mean velocity per voxel, it is only applicable to vessels significantly larger than the voxel size. In contrast, Fourier Velocity Encoding measures the entire velocity distribution inside a voxel, but requires a much longer acquisition time. For accurate diagnosis of stenosis in vessels on the scale of spatial resolution, it is important to know the velocity distribution of a voxel. Our aim was to determine velocity distributions with accelerated Fourier Velocity Encoding in an acquisition time required for a conventional Phase Contrast image. Materials and Methods:We imaged the femoral artery of healthy volunteers with ECG - triggered, radial CINE acquisition. Data acquisition was accelerated by undersampling, while missing data were reconstructed by Compressed Sensing. Velocity spectra of the vessel were evaluated by high resolution Phase Contrast images and compared to spectra from fully sampled and undersampled Fourier Velocity Encoding. By means of undersampling, it was possible to reduce the scan time for Fourier Velocity Encoding to the duration required for a conventional Phase Contrast image. Results:Acquisition time for a fully sampled data set with 12 different Velocity Encodings was 40 min. By applying a 12.6 - fold retrospective undersampling, a data set was generated equal to 3:10 min acquisition time, which is similar to a conventional Phase Contrast measurement. Velocity spectra from fully sampled and undersampled Fourier Velocity Encoded images are in good agreement and show the same maximum velocities as compared to velocity maps from Phase Contrast measurements. Conclusion: Compressed Sensing proved to reliably reconstruct Fourier Velocity Encoded data. Our results indicate that Fourier Velocity Encoding allows an accurate determination of the velocity
Shihua Cao; Qihui Wang; Yaping Yuan; Junyang Yu
2014-01-01
Anomaly event detection is one of the research hotspots in wireless sensor networks. Aiming at the disadvantages of current detection solutions, a novel anomaly event detection algorithm based on compressed sensing and iteration is proposed. Firstly, a measured value can be sensed in each node, based on the compressed sensing. Then the problem of anomaly event detection is modeled as the minimization problem of weighted l1 norm, and OMP algorithm is adopted for solving the problem iteratively...
International Nuclear Information System (INIS)
Purpose: To develop and validate an innovative method of using depth sensing cameras and 3D printing techniques for Total Body Irradiation (TBI) treatment planning and compensator fabrication. Methods: A tablet with motion tracking cameras and integrated depth sensing was used to scan a RANDOTM phantom arranged in a TBI treatment booth to detect and store the 3D surface in a point cloud (PC) format. The accuracy of the detected surface was evaluated by comparison to extracted measurements from CT scan images. The thickness, source to surface distance and off-axis distance of the phantom at different body section was measured for TBI treatment planning. A 2D map containing a detailed compensator design was calculated to achieve uniform dose distribution throughout the phantom. The compensator was fabricated using a 3D printer, silicone molding and tungsten powder. In vivo dosimetry measurements were performed using optically stimulated luminescent detectors (OSLDs). Results: The whole scan of the anthropomorphic phantom took approximately 30 seconds. The mean error for thickness measurements at each section of phantom compare to CT was 0.44 ± 0.268 cm. These errors resulted in approximately 2% dose error calculation and 0.4 mm tungsten thickness deviation for the compensator design. The accuracy of 3D compensator printing was within 0.2 mm. In vivo measurements for an end-to-end test showed the overall dose difference was within 3%. Conclusion: Motion cameras and depth sensing techniques proved to be an accurate and efficient tool for TBI patient measurement and treatment planning. 3D printing technique improved the efficiency and accuracy of the compensator production and ensured a more accurate treatment delivery
Energy Technology Data Exchange (ETDEWEB)
Lee, M; Suh, T [Department of Biomedical Engineering, College of Medicine, The Catholic University of Korea, Seoul (Korea, Republic of); Research Institute of Biomedical Engineering, College of Medicine, The Catholic University of Korea, Seoul (Korea, Republic of); Han, B; Xing, L [Department of Radiation Oncology, Stanford University School of Medicine, Palo Alto, CA (United States); Jenkins, C [Department of Radiation Oncology, Stanford University School of Medicine, Palo Alto, CA (United States); Department of Mechanical Engineering, Stanford University, Palo Alto, CA (United States)
2015-06-15
Purpose: To develop and validate an innovative method of using depth sensing cameras and 3D printing techniques for Total Body Irradiation (TBI) treatment planning and compensator fabrication. Methods: A tablet with motion tracking cameras and integrated depth sensing was used to scan a RANDOTM phantom arranged in a TBI treatment booth to detect and store the 3D surface in a point cloud (PC) format. The accuracy of the detected surface was evaluated by comparison to extracted measurements from CT scan images. The thickness, source to surface distance and off-axis distance of the phantom at different body section was measured for TBI treatment planning. A 2D map containing a detailed compensator design was calculated to achieve uniform dose distribution throughout the phantom. The compensator was fabricated using a 3D printer, silicone molding and tungsten powder. In vivo dosimetry measurements were performed using optically stimulated luminescent detectors (OSLDs). Results: The whole scan of the anthropomorphic phantom took approximately 30 seconds. The mean error for thickness measurements at each section of phantom compare to CT was 0.44 ± 0.268 cm. These errors resulted in approximately 2% dose error calculation and 0.4 mm tungsten thickness deviation for the compensator design. The accuracy of 3D compensator printing was within 0.2 mm. In vivo measurements for an end-to-end test showed the overall dose difference was within 3%. Conclusion: Motion cameras and depth sensing techniques proved to be an accurate and efficient tool for TBI patient measurement and treatment planning. 3D printing technique improved the efficiency and accuracy of the compensator production and ensured a more accurate treatment delivery.
DEFF Research Database (Denmark)
2014-01-01
MATLAB simulation software used for the PhD thesis "Acquisition of Multi-Band Signals via Compressed Sensing......MATLAB simulation software used for the PhD thesis "Acquisition of Multi-Band Signals via Compressed Sensing...
The application of Compressed Sensing for Longitudinal MRI
Weizman, Lior; Bashat, Dafna Ben
2014-01-01
Purpose: The mutual similarity of the follow-up scans in longitudinal studies is exploited on top of the well known sparse transform domains for rapid MRI by reducing the number of k-space measurements. Theory and Methods: A framework for adaptive Compressed Sensing (CS) MRI that exploits the redundancy of the acquired data in longitudinal studies is proposed. The baseline MR scan is utilized both in the sampling stage, with adaptive CS, and in the reconstruction stage, with weighted CS. In adaptive CS, k-space sampling locations are optimized such that the acquired data is focused on the change between the follow-up MRI and the former one. Weighted CS uses the locations of the nonzero coefficients in the sparse domains as a prior in the recovery process. Results: Experiments demonstrate that our longitudinal adaptive CS MRI (LACS-MRI) scheme provides reconstruction quality which outperforms traditional CS MRI for rapid MRI. Examples are shown on patients with brain tumors and demonstrate improved spatial res...
Interferometric radio transient reconstruction in compressed sensing framework
Jiang, M; Starck, J -L; Corbel, S; Tasse, C
2015-01-01
Imaging by aperture synthesis from interferometric data is a well-known, but is a strong ill-posed inverse problem. Strong and faint radio sources can be imaged unambiguously using time and frequency integration to gather more Fourier samples of the sky. However, these imagers assumes a steady sky and the complexity of the problem increases when transients radio sources are also present in the data. Hopefully, in the context of transient imaging, the spatial and temporal information are separable which enable extension of an imager fit for a steady sky. We introduce independent spatial and temporal wavelet dictionaries to sparsely represent the transient in both spatial domain and temporal domain. These dictionaries intervenes in a new reconstruction method developed in the Compressed Sensing (CS) framework and using a primal-dual splitting algorithm. According to the preliminary tests in different noise regimes, this new "Time-agile" (or 2D-1D) method seems to be efficient in detecting and reconstructing the...
Compressive Sensing Based Design of Sparse Tripole Arrays.
Hawes, Matthew; Liu, Wei; Mihaylova, Lyudmila
2015-12-10
This paper considers the problem of designing sparse linear tripole arrays. In such arrays at each antenna location there are three orthogonal dipoles, allowing full measurement of both the horizontal and vertical components of the received waveform. We formulate this problem from the viewpoint of Compressive Sensing (CS). However, unlike for isotropic array elements (single antenna), we now have three complex valued weight coefficients associated with each potential location (due to the three dipoles), which have to be simultaneously minimised. If this is not done, we may only set the weight coefficients of individual dipoles to be zero valued, rather than complete tripoles, meaning some dipoles may remain at each location. Therefore, the contributions of this paper are to formulate the design of sparse tripole arrays as an optimisation problem, and then we obtain a solution based on the minimisation of a modified l1 norm or a series of iteratively solved reweighted minimisations, which ensure a truly sparse solution. Design examples are provided to verify the effectiveness of the proposed methods and show that a good approximation of a reference pattern can be achieved using fewer tripoles than a Uniform Linear Array (ULA) of equivalent length.
Genetic optical design for a compressive sensing task
Horisaki, Ryoichi; Niihara, Takahiro; Tanida, Jun
2016-07-01
We present a sophisticated optical design method for reducing the number of photodetectors for a specific sensing task. The chosen design parameter is the point spread function, and the selected task is object recognition. The point spread function is optimized iteratively with a genetic algorithm for object recognition based on a neural network. In the experimental demonstration, binary classification of face and non-face datasets was performed with a single measurement using two photodetectors. A spatial light modulator operating in the amplitude modulation mode was provided in the imaging optics and was used to modulate the point spread function. In each generation of the genetic algorithm, the classification accuracy with a pattern displayed on the spatial light modulator was fed-back to the next generation to find better patterns. The proposed method increased the accuracy by about 30 % compared with a conventional imaging system in which the point spread function was the delta function. This approach is practically useful for compressing the cost, size, and observation time of optical sensors in specific applications, and robust for imperfections in optical elements.
Identifying Chaotic FitzHugh–Nagumo Neurons Using Compressive Sensing
Directory of Open Access Journals (Sweden)
Ri-Qi Su
2014-07-01
Full Text Available We develop a completely data-driven approach to reconstructing coupled neuronal networks that contain a small subset of chaotic neurons. Such chaotic elements can be the result of parameter shift in their individual dynamical systems and may lead to abnormal functions of the network. To accurately identify the chaotic neurons may thus be necessary and important, for example, applying appropriate controls to bring the network to a normal state. However, due to couplings among the nodes, the measured time series, even from non-chaotic neurons, would appear random, rendering inapplicable traditional nonlinear time-series analysis, such as the delay-coordinate embedding method, which yields information about the global dynamics of the entire network. Our method is based on compressive sensing. In particular, we demonstrate that identifying chaotic elements can be formulated as a general problem of reconstructing the nodal dynamical systems, network connections and all coupling functions, as well as their weights. The working and efficiency of the method are illustrated by using networks of non-identical FitzHugh–Nagumo neurons with randomly-distributed coupling weights.
Compressive sensing for direct millimeter-wave holographic imaging.
Qiao, Lingbo; Wang, Yingxin; Shen, Zongjun; Zhao, Ziran; Chen, Zhiqiang
2015-04-10
Direct millimeter-wave (MMW) holographic imaging, which provides both the amplitude and phase information by using the heterodyne mixing technique, is considered a powerful tool for personnel security surveillance. However, MWW imaging systems usually suffer from the problem of high cost or relatively long data acquisition periods for array or single-pixel systems. In this paper, compressive sensing (CS), which aims at sparse sampling, is extended to direct MMW holographic imaging for reducing the number of antenna units or the data acquisition time. First, following the scalar diffraction theory, an exact derivation of the direct MMW holographic reconstruction is presented. Then, CS reconstruction strategies for complex-valued MMW images are introduced based on the derived reconstruction formula. To pursue the applicability for near-field MMW imaging and more complicated imaging targets, three sparsity bases, including total variance, wavelet, and curvelet, are evaluated for the CS reconstruction of MMW images. We also discuss different sampling patterns for single-pixel, linear array and two-dimensional array MMW imaging systems. Both simulations and experiments demonstrate the feasibility of recovering MMW images from measurements at 1/2 or even 1/4 of the Nyquist rate.
Improved Compressive Sensing of Natural Scenes Using Localized Random Sampling
Barranca, Victor J.; Kovačič, Gregor; Zhou, Douglas; Cai, David
2016-08-01
Compressive sensing (CS) theory demonstrates that by using uniformly-random sampling, rather than uniformly-spaced sampling, higher quality image reconstructions are often achievable. Considering that the structure of sampling protocols has such a profound impact on the quality of image reconstructions, we formulate a new sampling scheme motivated by physiological receptive field structure, localized random sampling, which yields significantly improved CS image reconstructions. For each set of localized image measurements, our sampling method first randomly selects an image pixel and then measures its nearby pixels with probability depending on their distance from the initially selected pixel. We compare the uniformly-random and localized random sampling methods over a large space of sampling parameters, and show that, for the optimal parameter choices, higher quality image reconstructions can be consistently obtained by using localized random sampling. In addition, we argue that the localized random CS optimal parameter choice is stable with respect to diverse natural images, and scales with the number of samples used for reconstruction. We expect that the localized random sampling protocol helps to explain the evolutionarily advantageous nature of receptive field structure in visual systems and suggests several future research areas in CS theory and its application to brain imaging.
Passive Source Localization Using Compressively Sensed Towed Array
Directory of Open Access Journals (Sweden)
N. Suresh Kumar
2013-12-01
Full Text Available The objective of this work is to estimate the sparse angular power spectrum using a towed acoustic pressure sensor (APS array. In a passive towed array sonar, any reduction in the analog sensor signal conditioning receiver hardware housed inside the array tube, significantly improves the signal integrity and hence the localization performance. In this paper, a novel sparse acoustic pressure sensor (SAPS array architecture is proposed to estimate the direction of arrival (DOA of multiple acoustic sources. Bearing localization is effectively achieved by customizing the Capons spatial filter algorithm to suit the SAPS array architecture. Apart from the Monte Carlo simulations, the acoustic performance of the SAPS array with compressively sensed minimum variance distortionless response (CS-MVDR filter is demonstrated using a real passive towed array data. The proposed sparse towed array architecture promises a significant reduction in the analog signal acquisition receiver hardware, transmission data rate, number of snapshots and software complexity.Defence Science Journal, 2013, 63(6, pp.630-635, DOI:http://dx.doi.org/10.14429/dsj.63.5765
Improved Compressive Sensing of Natural Scenes Using Localized Random Sampling.
Barranca, Victor J; Kovačič, Gregor; Zhou, Douglas; Cai, David
2016-01-01
Compressive sensing (CS) theory demonstrates that by using uniformly-random sampling, rather than uniformly-spaced sampling, higher quality image reconstructions are often achievable. Considering that the structure of sampling protocols has such a profound impact on the quality of image reconstructions, we formulate a new sampling scheme motivated by physiological receptive field structure, localized random sampling, which yields significantly improved CS image reconstructions. For each set of localized image measurements, our sampling method first randomly selects an image pixel and then measures its nearby pixels with probability depending on their distance from the initially selected pixel. We compare the uniformly-random and localized random sampling methods over a large space of sampling parameters, and show that, for the optimal parameter choices, higher quality image reconstructions can be consistently obtained by using localized random sampling. In addition, we argue that the localized random CS optimal parameter choice is stable with respect to diverse natural images, and scales with the number of samples used for reconstruction. We expect that the localized random sampling protocol helps to explain the evolutionarily advantageous nature of receptive field structure in visual systems and suggests several future research areas in CS theory and its application to brain imaging. PMID:27555464
Opportunistic Relay Selection in Multicast Relay Networks using Compressive Sensing
Elkhalil, Khalil
2014-12-01
Relay selection is a simple technique that achieves spatial diversity in cooperative relay networks. However, for relay selection algorithms to make a selection decision, channel state information (CSI) from all cooperating relays is usually required at a central node. This requirement poses two important challenges. Firstly, CSI acquisition generates a great deal of feedback overhead (air-time) that could result in significant transmission delays. Secondly, the fed back channel information is usually corrupted by additive noise. This could lead to transmission outages if the central node selects the set of cooperating relays based on inaccurate feedback information. In this paper, we introduce a limited feedback relay selection algorithm for a multicast relay network. The proposed algorithm exploits the theory of compressive sensing to first obtain the identity of the “strong” relays with limited feedback. Following that, the CSI of the selected relays is estimated using linear minimum mean square error estimation. To minimize the effect of noise on the fed back CSI, we introduce a back-off strategy that optimally backs-off on the noisy estimated CSI. For a fixed group size, we provide closed form expressions for the scaling law of the maximum equivalent SNR for both Decode and Forward (DF) and Amplify and Forward (AF) cases. Numerical results show that the proposed algorithm drastically reduces the feedback air-time and achieves a rate close to that obtained by selection algorithms with dedicated error-free feedback channels.
Compressive Sensing Based Design of Sparse Tripole Arrays
Directory of Open Access Journals (Sweden)
Matthew Hawes
2015-12-01
Full Text Available This paper considers the problem of designing sparse linear tripole arrays. In such arrays at each antenna location there are three orthogonal dipoles, allowing full measurement of both the horizontal and vertical components of the received waveform. We formulate this problem from the viewpoint of Compressive Sensing (CS. However, unlike for isotropic array elements (single antenna, we now have three complex valued weight coefficients associated with each potential location (due to the three dipoles, which have to be simultaneously minimised. If this is not done, we may only set the weight coefficients of individual dipoles to be zero valued, rather than complete tripoles, meaning some dipoles may remain at each location. Therefore, the contributions of this paper are to formulate the design of sparse tripole arrays as an optimisation problem, and then we obtain a solution based on the minimisation of a modified l 1 norm or a series of iteratively solved reweighted minimisations, which ensure a truly sparse solution. Design examples are provided to verify the effectiveness of the proposed methods and show that a good approximation of a reference pattern can be achieved using fewer tripoles than a Uniform Linear Array (ULA of equivalent length.
Single-snapshot DOA estimation by using Compressed Sensing
Fortunati, Stefano; Grasso, Raffaele; Gini, Fulvio; Greco, Maria S.; LePage, Kevin
2014-12-01
This paper deals with the problem of estimating the directions of arrival (DOA) of multiple source signals from a single observation vector of an array data. In particular, four estimation algorithms based on the theory of compressed sensing (CS), i.e., the classical ℓ 1 minimization (or Least Absolute Shrinkage and Selection Operator, LASSO), the fast smooth ℓ 0 minimization, and the Sparse Iterative Covariance-Based Estimator, SPICE and the Iterative Adaptive Approach for Amplitude and Phase Estimation, IAA-APES algorithms, are analyzed, and their statistical properties are investigated and compared with the classical Fourier beamformer (FB) in different simulated scenarios. We show that unlike the classical FB, a CS-based beamformer (CSB) has some desirable properties typical of the adaptive algorithms (e.g., Capon and MUSIC) even in the single snapshot case. Particular attention is devoted to the super-resolution property. Theoretical arguments and simulation analysis provide evidence that a CS-based beamformer can achieve resolution beyond the classical Rayleigh limit. Finally, the theoretical findings are validated by processing a real sonar dataset.
Genetic optical design for a compressive sensing task
Horisaki, Ryoichi; Niihara, Takahiro; Tanida, Jun
2016-10-01
We present a sophisticated optical design method for reducing the number of photodetectors for a specific sensing task. The chosen design parameter is the point spread function, and the selected task is object recognition. The point spread function is optimized iteratively with a genetic algorithm for object recognition based on a neural network. In the experimental demonstration, binary classification of face and non-face datasets was performed with a single measurement using two photodetectors. A spatial light modulator operating in the amplitude modulation mode was provided in the imaging optics and was used to modulate the point spread function. In each generation of the genetic algorithm, the classification accuracy with a pattern displayed on the spatial light modulator was fed-back to the next generation to find better patterns. The proposed method increased the accuracy by about 30 % compared with a conventional imaging system in which the point spread function was the delta function. This approach is practically useful for compressing the cost, size, and observation time of optical sensors in specific applications, and robust for imperfections in optical elements.
Compressed sensing MR image reconstruction exploiting TGV and wavelet sparsity.
Zhao, Di; Du, Huiqian; Han, Yu; Mei, Wenbo
2014-01-01
Compressed sensing (CS) based methods make it possible to reconstruct magnetic resonance (MR) images from undersampled measurements, which is known as CS-MRI. The reference-driven CS-MRI reconstruction schemes can further decrease the sampling ratio by exploiting the sparsity of the difference image between the target and the reference MR images in pixel domain. Unfortunately existing methods do not work well given that contrast changes are incorrectly estimated or motion compensation is inaccurate. In this paper, we propose to reconstruct MR images by utilizing the sparsity of the difference image between the target and the motion-compensated reference images in wavelet transform and gradient domains. The idea is attractive because it requires neither the estimation of the contrast changes nor multiple times motion compensations. In addition, we apply total generalized variation (TGV) regularization to eliminate the staircasing artifacts caused by conventional total variation (TV). Fast composite splitting algorithm (FCSA) is used to solve the proposed reconstruction problem in order to improve computational efficiency. Experimental results demonstrate that the proposed method can not only reduce the computational cost but also decrease sampling ratio or improve the reconstruction quality alternatively. PMID:25371704
Compressed Sensing MR Image Reconstruction Exploiting TGV and Wavelet Sparsity
Directory of Open Access Journals (Sweden)
Di Zhao
2014-01-01
Full Text Available Compressed sensing (CS based methods make it possible to reconstruct magnetic resonance (MR images from undersampled measurements, which is known as CS-MRI. The reference-driven CS-MRI reconstruction schemes can further decrease the sampling ratio by exploiting the sparsity of the difference image between the target and the reference MR images in pixel domain. Unfortunately existing methods do not work well given that contrast changes are incorrectly estimated or motion compensation is inaccurate. In this paper, we propose to reconstruct MR images by utilizing the sparsity of the difference image between the target and the motion-compensated reference images in wavelet transform and gradient domains. The idea is attractive because it requires neither the estimation of the contrast changes nor multiple times motion compensations. In addition, we apply total generalized variation (TGV regularization to eliminate the staircasing artifacts caused by conventional total variation (TV. Fast composite splitting algorithm (FCSA is used to solve the proposed reconstruction problem in order to improve computational efficiency. Experimental results demonstrate that the proposed method can not only reduce the computational cost but also decrease sampling ratio or improve the reconstruction quality alternatively.
Peak Reduction and Clipping Mitigation by Compressive Sensing
Al-Safadi, Ebrahim B
2011-01-01
This work establishes the design, analysis, and fine-tuning of a Peak-to-Average-Power-Ratio (PAPR) reducing system, based on compressed sensing at the receiver of a peak-reducing sparse clipper applied to an OFDM signal at the transmitter. By exploiting the sparsity of the OFDM signal in the time domain relative to a pre-defined clipping threshold, the method depends on partially observing the frequency content of extremely simple sparse clippers to recover the locations, magnitudes, and phases of the clipped coefficients of the peak-reduced signal. We claim that in the absence of optimization algorithms at the transmitter that confine the frequency support of clippers to a predefined set of reserved-tones, no other tone-reservation method can reliably recover the original OFDM signal with such low complexity. Afterwards we focus on designing different clipping signals that can embed a priori information regarding the support and phase of the peak-reducing signal to the receiver, followed by modified compres...
Fast Linearized Bregman Iteration for Compressive Sensing and Sparse Denoising
Osher, Stanley; Dong, Bin; Yin, Wotao
2011-01-01
We propose and analyze an extremely fast, efficient, and simple method for solving the problem:min{parallel to u parallel to(1) : Au = f, u is an element of R-n}.This method was first described in [J. Darbon and S. Osher, preprint, 2007], with more details in [W. Yin, S. Osher, D. Goldfarb and J. Darbon, SIAM J. Imaging Sciences, 1(1), 143-168, 2008] and rigorous theory given in [J. Cai, S. Osher and Z. Shen, Math. Comp., to appear, 2008, see also UCLA CAM Report 08-06] and [J. Cai, S. Osher and Z. Shen, UCLA CAM Report, 08-52, 2008]. The motivation was compressive sensing, which now has a vast and exciting history, which seems to have started with Candes, et. al. [E. Candes, J. Romberg and T. Tao, 52(2), 489-509, 2006] and Donoho, [D. L. Donoho, IEEE Trans. Inform. Theory, 52, 1289-1306, 2006]. See [W. Yin, S. Osher, D. Goldfarb and J. Darbon, SIAM J. Imaging Sciences 1(1), 143-168, 2008] and [J. Cai, S. Osher and Z. Shen, Math. Comp., to appear, 2008, see also UCLA CAM Report, 08-06] and [J. Cai, S. Osher a...
The possibilities of compressed-sensing-based Kirchhoff prestack migration
Aldawood, Ali
2014-05-08
An approximate subsurface reflectivity distribution of the earth is usually obtained through the migration process. However, conventional migration algorithms, including those based on the least-squares approach, yield structure descriptions that are slightly smeared and of low resolution caused by the common migration artifacts due to limited aperture, coarse sampling, band-limited source, and low subsurface illumination. To alleviate this problem, we use the fact that minimizing the L1-norm of a signal promotes its sparsity. Thus, we formulated the Kirchhoff migration problem as a compressed-sensing (CS) basis pursuit denoise problem to solve for highly focused migrated images compared with those obtained by standard and least-squares migration algorithms. The results of various subsurface reflectivity models revealed that solutions computed using the CS based migration provide a more accurate subsurface reflectivity location and amplitude. We applied the CS algorithm to image synthetic data from a fault model using dense and sparse acquisition geometries. Our results suggest that the proposed approach may still provide highly resolved images with a relatively small number of measurements. We also evaluated the robustness of the basis pursuit denoise algorithm in the presence of Gaussian random observational noise and in the case of imaging the recorded data with inaccurate migration velocities.
Compressed sensing methods for DNA microarrays, RNA interference, and metagenomics.
Rao, Aditya; P, Deepthi; Renumadhavi, C H; Chandra, M Girish; Srinivasan, Rajgopal
2015-02-01
Compressed sensing (CS) is a sparse signal sampling methodology for efficiently acquiring and reconstructing a signal from relatively few measurements. Recent work shows that CS is well-suited to be applied to problems in genomics, including probe design in microarrays, RNA interference (RNAi), and taxonomic assignment in metagenomics. The principle of using different CS recovery methods in these applications has thus been established, but a comprehensive study of using a wide range of CS methods has not been done. For each of these applications, we apply three hitherto unused CS methods, namely, l1-magic, CoSaMP, and l1-homotopy, in conjunction with CS measurement matrices such as randomly generated CS m matrix, Hamming matrix, and projective geometry-based matrix. We find that, in RNAi, the l1-magic (the standard package for l1 minimization) and l1-homotopy methods show significant reduction in reconstruction error compared to the baseline. In metagenomics, we find that l1-homotopy as well as CoSaMP estimate concentration with significantly reduced time when compared to the GPSR and WGSQuikr methods.
A high-resolution SWIR camera via compressed sensing
McMackin, Lenore; Herman, Matthew A.; Chatterjee, Bill; Weldon, Matt
2012-06-01
Images from a novel shortwave infrared (SWIR, 900 nm to 1.7 μm) camera system are presented. Custom electronics and software are combined with a digital micromirror device (DMD) and a single-element sensor; the latter are commercial off-the-shelf devices, which together create a lower-cost imaging system than is otherwise available in this wavelength regime. A compressive sensing (CS) encoding schema is applied to the DMD to modulate the light that has entered the camera. This modulated light is directed to a single-element sensor and an ensemble of measurements is collected. With the data ensemble and knowledge of the CS encoding, images are computationally reconstructed. The hardware and software combination makes it possible to create images with the resolution of the DMD while employing a substantially lower-cost sensor subsystem than would otherwise be required by the use of traditional focal plane arrays (FPAs). In addition to the basic camera architecture, we also discuss a technique that uses the adaptive functionality of the DMD to search and identify regions of interest. We demonstrate adaptive CS in solar exclusion experiments where bright pixels, which would otherwise reduce dynamic range in the images, are automatically removed.
Compressive sensing of sparse radio frequency signals using optical mixing.
Valley, George C; Sefler, George A; Shaw, T Justin
2012-11-15
We demonstrate an optical mixing system for measuring properties of sparse radio frequency (RF) signals using compressive sensing (CS). Two types of sparse RF signals are investigated: (1) a signal that consists of a few 0.4 ns pulses in a 26.8 ns window and (2) a signal that consists of a few sinusoids at different frequencies. The RF is modulated onto the intensity of a repetitively pulsed, wavelength-chirped optical field, and time-wavelength-space mapping is used to map the optical field onto a 118-pixel, one-dimensional spatial light modulator (SLM). The SLM pixels are programmed with a pseudo-random bit sequence (PRBS) to form one row of the CS measurement matrix, and the optical throughput is integrated with a photodiode to obtain one value of the CS measurement vector. Then the PRBS is changed to form the second row of the mixing matrix and a second value of the measurement vector is obtained. This process is performed 118 times so that we can vary the dimensions of the CS measurement matrix from 1×118 to 118×118 (square). We use the penalized ℓ(1) norm method with stopping parameter λ (also called basis pursuit denoising) to recover pulsed or sinusoidal RF signals as a function of the small dimension of the measurement matrix and stopping parameter. For a square matrix, we also find that penalized ℓ(1) norm recovery performs better than conventional recovery using matrix inversion. PMID:23164876
Siddeq, M. M.; Rodrigues, M. A.
2015-09-01
Image compression techniques are widely used on 2D image 2D video 3D images and 3D video. There are many types of compression techniques and among the most popular are JPEG and JPEG2000. In this research, we introduce a new compression method based on applying a two level discrete cosine transform (DCT) and a two level discrete wavelet transform (DWT) in connection with novel compression steps for high-resolution images. The proposed image compression algorithm consists of four steps. (1) Transform an image by a two level DWT followed by a DCT to produce two matrices: DC- and AC-Matrix, or low and high frequency matrix, respectively, (2) apply a second level DCT on the DC-Matrix to generate two arrays, namely nonzero-array and zero-array, (3) apply the Minimize-Matrix-Size algorithm to the AC-Matrix and to the other high-frequencies generated by the second level DWT, (4) apply arithmetic coding to the output of previous steps. A novel decompression algorithm, Fast-Match-Search algorithm (FMS), is used to reconstruct all high-frequency matrices. The FMS-algorithm computes all compressed data probabilities by using a table of data, and then using a binary search algorithm for finding decompressed data inside the table. Thereafter, all decoded DC-values with the decoded AC-coefficients are combined in one matrix followed by inverse two levels DCT with two levels DWT. The technique is tested by compression and reconstruction of 3D surface patches. Additionally, this technique is compared with JPEG and JPEG2000 algorithm through 2D and 3D root-mean-square-error following reconstruction. The results demonstrate that the proposed compression method has better visual properties than JPEG and JPEG2000 and is able to more accurately reconstruct surface patches in 3D.
Directory of Open Access Journals (Sweden)
Mahboubeh Pishbin
2014-06-01
Full Text Available The uniaxial compressive strength (UCS of intact rocks is an important geotechnical parameter required for designing geotechnical and mining engineering projects. Obtaining accurate estimates of the rock mass UCS parameter throughout a 3D geological model of the deposit is vital for determining optimum rock slope stability, designing new exploratory and blast boreholes, mine planning, optimizing the production schedule and even designing the crusher’s feed size. The main objective of this paper is to select the preferred estimator of the UCS parameter based on accuracy performance using all the available geological-geotechnical data at the Sarcheshmeh copper deposit, located 160 km southwest of Kerman City, in south-eastern Iran. In this paper, an attempt is made to estimate the spatial distribution of the UCS parameter using commonly-used statistical-structural and geostatistical methods. In order to achieve the aim of the current study, the UCS parameter was measured along with other qualitative geological properties, including the rock type, weathering, alteration type and intensity of core samples taken from 647 boreholes. The 3D distribution of the UCS parameter is obtained using different algorithms including statistical-structural (the nearest-neighbour technique, linear (ordinary Kriging and nonlinear (indicator Kriging geostatistical methods. After estimating the UCS parameter at block centres using the above-mentioned methods, the performance of each method is compared and validated through 21 set aside borehole data. The assessment of selecting best estimator of UCS parameter is based on scatter plots of the observed versus estimated data plus the root mean square error (RMSE statistics of the differences between observed and estimated values for 21 set aside borehole data. Finally, due to the special characteristics of the UCS spatial variability, it is concluded that the nearest-neighbour method is the most appropriate method for
Choi, Jonghoon; Lee, Eun Kyu; Choo, Jaebum; Yuh, Junhan; Hong, Jong Wook
2015-09-01
Microfabricated systems equipped with 3D cell culture devices and in-situ cellular biosensing tools can be a powerful bionanotechnology platform to investigate a variety of biomedical applications. Various construction substrates such as plastics, glass, and paper are used for microstructures. When selecting a construction substrate, a key consideration is a porous microenvironment that allows for spheroid growth and mimics the extracellular matrix (ECM) of cell aggregates. Various bio-functionalized hydrogels are ideal candidates that mimic the natural ECM for 3D cell culture. When selecting an optimal and appropriate microfabrication method, both the intended use of the system and the characteristics and restrictions of the target cells should be carefully considered. For highly sensitive and near-cell surface detection of excreted cellular compounds, SERS-based microsystems capable of dual modal imaging have the potential to be powerful tools; however, the development of optical reporters and nanoprobes remains a key challenge. We expect that the microsystems capable of both 3D cell culture and cellular response monitoring would serve as excellent tools to provide fundamental cellular behavior information for various biomedical applications such as metastasis, wound healing, high throughput screening, tissue engineering, regenerative medicine, and drug discovery and development. PMID:26358782
Oiknine, Yaniv; August, Isaac Y.; Revah, Liat; Stern, Adrian
2016-05-01
Recently we introduced a Compressive Sensing Miniature Ultra-Spectral Imaging (CS-MUSI) system. The system is based on a single Liquid Crystal (LC) cell and a parallel sensor array where the liquid crystal cell performs spectral encoding. Within the framework of compressive sensing, the CS-MUSI system is able to reconstruct ultra-spectral cubes captured with only an amount of ~10% samples compared to a conventional system. Despite the compression, the technique is extremely complex computationally, because reconstruction of ultra-spectral images requires processing huge data cubes of Gigavoxel size. Fortunately, the computational effort can be alleviated by using separable operation. An additional way to reduce the reconstruction effort is to perform the reconstructions on patches. In this work, we consider processing on various patch shapes. We present an experimental comparison between various patch shapes chosen to process the ultra-spectral data captured with CS-MUSI system. The patches may be one dimensional (1D) for which the reconstruction is carried out spatially pixel-wise, or two dimensional (2D) - working on spatial rows/columns of the ultra-spectral cube, as well as three dimensional (3D).
On the Projection Matrices Influence in the Classification of Compressed Sensed ECG Signals
Directory of Open Access Journals (Sweden)
Monica Fira
2012-08-01
Full Text Available In this paper the classification results of compressed sensed ECG signals based on various types of projection matrices is investigated. The compressed signals are classified using the KNN (K-Nearest Neighbour algorithm. A comparative analysis is made with respect to the projection matrices used, as well as of the results obtained in the case of the original (uncompressed signals for various compression ratios. For Bernoulli projection matrices it has been observed that the classification results for compressed cardiac cycles are comparable to those obtained for uncompressed cardiac cycles. Thus, for normal uncompressed cardiac cycles a classification ratio of 91.33% was obtained, while for the signals compressed with a Bernoulli matrix, up to a compression ratio of 15:1 classification rates of approximately 93% were obtained. Significant improvements of classification in the compressed space take place up to a compression ratio of 30:1.
On Compressed Sensing and the Estimation of Continuous Parameters From Noisy Observations
DEFF Research Database (Denmark)
Nielsen, Jesper Kjær; Christensen, Mads Græsbøll; Jensen, Søren Holdt
2012-01-01
Compressed sensing (CS) has in recent years become a very popular way of sampling sparse signals. This sparsity is measured with respect to some known dictionary consisting of a finite number of atoms. Most models for real world signals, however, are parametrised by continuous parameters......-Rao lower bound (CRLB) which is frequently used for benchmarking the estimation accuracy of unbiased estimators. For the popular sensing matrices such as the Gaussian sensing matrix, our analysis shows that compressed sensing on average degrades the estimation accuracy by at least the down-sample factor....
Bilen, Cagdas; Selesnick, Ivan
2012-01-01
Magnetic Resonance Imaging (MRI) is one of the fields that the compressed sensing theory is well utilized to reduce the scan time significantly leading to faster imaging or higher resolution images. It has been shown that a small fraction of the overall measurements are sufficient to reconstruct images with the combination of compressed sensing and parallel imaging. Various reconstruction algorithms has been proposed for compressed sensing, among which Augmented Lagrangian based methods have been shown to often perform better than others for many different applications. In this paper, we propose new Augmented Lagrangian based solutions to the compressed sensing reconstruction problem with analysis and synthesis prior formulations. We also propose a computational method which makes use of properties of the sampling pattern to significantly improve the speed of the reconstruction for the proposed algorithms in Cartesian sampled MRI. The proposed algorithms are shown to outperform earlier methods especially for ...
Schneiderwind, Sascha; Mason, Jack; Wiatr, Thomas; Papanikolaou, Ioannis; Reicherter, Klaus
2016-03-01
Two normal faults on the island of Crete and mainland Greece were studied to test an innovative workflow with the goal of obtaining a more objective palaeoseismic trench log, and a 3-D view of the sedimentary architecture within the trench walls. Sedimentary feature geometries in palaeoseismic trenches are related to palaeoearthquake magnitudes which are used in seismic hazard assessments. If the geometry of these sedimentary features can be more representatively measured, seismic hazard assessments can be improved. In this study more representative measurements of sedimentary features are achieved by combining classical palaeoseismic trenching techniques with multispectral approaches. A conventional trench log was firstly compared to results of ISO (iterative self-organising) cluster analysis of a true colour photomosaic representing the spectrum of visible light. Photomosaic acquisition disadvantages (e.g. illumination) were addressed by complementing the data set with active near-infrared backscatter signal image from t-LiDAR measurements. The multispectral analysis shows that distinct layers can be identified and it compares well with the conventional trench log. According to this, a distinction of adjacent stratigraphic units was enabled by their particular multispectral composition signature. Based on the trench log, a 3-D interpretation of attached 2-D ground-penetrating radar (GPR) profiles collected on the vertical trench wall was then possible. This is highly beneficial for measuring representative layer thicknesses, displacements, and geometries at depth within the trench wall. Thus, misinterpretation due to cutting effects is minimised. This manuscript combines multiparametric approaches and shows (i) how a 3-D visualisation of palaeoseismic trench stratigraphy and logging can be accomplished by combining t-LiDAR and GPR techniques, and (ii) how a multispectral digital analysis can offer additional advantages to interpret palaeoseismic and stratigraphic
International Nuclear Information System (INIS)
Various surface treatments are applied for surface oxide removal prior to wafer-level Cu-to-Cu thermo-compression bonding and the bonding quality is systematically analyzed in this work. Three methods are investigated: self-assembled monolayer (SAM) passivation, forming gas annealing and acetic acid wet cleaning. The surface conditions are carefully examined including roughness, contact angle and x-ray photoelectron spectroscopy (XPS) scan. The wafer pairs are bonded at 250 °C under a bonding force of 5500 N for a duration of 1 h in a vacuum environment. The bonding medium consists of a Cu (300 nm) bonding layer and a Ti (50 nm) barrier layer. The bonding quality investigation consists of two parts: hermeticity based on helium leak test and mechanical strength using four-point bending method. Although all samples under test with different surface treatment methods present an excellent hermetic seal and a robust mechanical support, the measurement results show that samples bonded after SAM passivation exhibit the best hermeticity and bonding strength for 3D integration application. (paper)
DeJong, Andrew
Numerical models of fluid-structure interaction have grown in importance due to increasing interest in environmental energy harvesting, airfoil-gust interactions, and bio-inspired formation flying. Powered by increasingly powerful parallel computers, such models seek to explain the fundamental physics behind the complex, unsteady fluid-structure phenomena. To this end, a high-fidelity computational model based on the high-order spectral difference method on 3D unstructured, dynamic meshes has been developed. The spectral difference method constructs continuous solution fields within each element with a Riemann solver to compute the inviscid fluxes at the element interfaces and an averaging mechanism to compute the viscous fluxes. This method has shown promise in the past as a highly accurate, yet sufficiently fast method for solving unsteady viscous compressible flows. The solver is monolithically coupled to the equations of motion of an elastically mounted 3-degree of freedom rigid bluff body undergoing flow-induced lift, drag, and torque. The mesh is deformed using 4 methods: an analytic function, Laplace equation, biharmonic equation, and a bi-elliptic equation with variable diffusivity. This single system of equations -- fluid and structure -- is advanced through time using a 5-stage, 4th-order Runge-Kutta scheme. Message Passing Interface is used to run the coupled system in parallel on up to 240 processors. The solver is validated against previously published numerical and experimental data for an elastically mounted cylinder. The effect of adding an upstream body and inducing wake galloping is observed.
Elastic-Waveform Inversion with Compressive Sensing for Sparse Seismic Data
Energy Technology Data Exchange (ETDEWEB)
Lin, Youzuo [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Huang, Lianjie [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-01-26
Accurate velocity models of compressional- and shear-waves are essential for geothermal reservoir characterization and microseismic imaging. Elastic-waveform inversion of multi-component seismic data can provide high-resolution inversion results of subsurface geophysical properties. However, the method requires seismic data acquired using dense source and receiver arrays. In practice, seismic sources and/or geophones are often sparsely distributed on the surface and/or in a borehole, such as 3D vertical seismic profiling (VSP) surveys. We develop a novel elastic-waveform inversion method with compressive sensing for inversion of sparse seismic data. We employ an alternating-minimization algorithm to solve the optimization problem of our new waveform inversion method. We validate our new method using synthetic VSP data for a geophysical model built using geologic features found at the Raft River enhanced-geothermal-system (EGS) field. We apply our method to synthetic VSP data with a sparse source array and compare the results with those obtained with a dense source array. Our numerical results demonstrate that the velocity mode ls produced with our new method using a sparse source array are almost as accurate as those obtained using a dense source array.
Nakanishi-Ohno, Yoshinori; Haze, Masahiro; Yoshida, Yasuo; Hukushima, Koji; Hasegawa, Yukio; Okada, Masato
2016-01-01
We applied a method of compressed sensing to the observation of quasi-particle interference (QPI) by scanning tunneling microscopy/spectroscopy to improve efficiency and save measurement time. To solve an ill-posed problem owing to the scarcity of data, the compressed sensing utilizes the sparseness of QPI patterns in momentum space. We examined the performance of a sparsity-inducing algorithm called least absolute shrinkage and selection operator (LASSO), and demonstrated that LASSO enables ...
Localization with a Mobile Beacon Based on Compressive Sensing in Wireless Sensor Networks
Bing Cui; Hui Huang; Yunlong Xu; Chunhui Zhao
2013-01-01
Node localization technology is especially important to most applications of wireless sensor network. However, each mobile beacon needs to broadcast its current position many times, and locating all the nodes must take a long time in most of the localization algorithms. In order to solve these problems, we propose a novel range-free localization algorithm—localization with a mobile beacon based on compressive sensing (LMCS). LMCS makes use of compressive sensing (CS) to get the related degree...
Snidero, M.; Amilibia, A.; Gratacos, O.; Muñoz, J. A.
2009-04-01
This work presents a methodological workflow for the 3D reconstruction of geological surfaces at regional scale, based on remote sensing data and geological maps. This workflow has been tested on the reconstruction of the Anaran anticline, located in the Zagros Fold and Thrust belt mountain front. The used remote sensing data-set is a combination of Aster and Spot images as well as a high resolution digital elevation model. A consistent spatial positioning of the complete data-set in a 3D environment is necessary to obtain satisfactory results during the reconstruction. The Aster images have been processed by the Optimum Index Factor (OIF) technique, in order to facilitate the geological mapping. By pansharpening of the resulting Aster image with the SPOT panchromatic one we obtain the final high-resolution image used during the 3D mapping. Structural data (dip data) has been acquired through the analysis of the 3D mapped geological traces. Structural analysis of the resulting data-set allows us to divide the structure in different cylindrical domains. Related plunge lines orientation has been used to project data along the structure, covering areas with little or no information. Once a satisfactory dataset has been acquired, we reconstruct a selected horizon following the dip-domain concept. By manual editing, the obtained surfaces have been adjusted to the mapped geological limits as well as to the modeled faults. With the implementation of the Discrete Smooth Interpolation (DSI) algorithm, the final surfaces have been reconstructed along the anticline. Up to date the results demonstrate that the proposed methodology is a powerful tool for 3D reconstruction of geological surfaces when working with remote sensing data, in very inaccessible areas (eg. Iran, China, Africa). It is especially useful in semiarid regions where the structure strongly controls the topography. The reconstructed surfaces clearly show the geometry in the different sectors of the structure
The MUSIC algorithm for sparse objects: a compressed sensing analysis
Fannjiang, Albert C.
2011-03-01
The multiple signal classification (MUSIC) algorithm, and its extension for imaging sparse extended objects, with noisy data is analyzed by compressed sensing (CS) techniques. A thresholding rule is developed to augment the standard MUSIC algorithm. The notion of restricted isometry property (RIP) and an upper bound on the restricted isometry constant (RIC) are employed to establish sufficient conditions for the exact localization by MUSIC with or without noise. In the noiseless case, the sufficient condition gives an upper bound on the numbers of random sampling and incident directions necessary for exact localization. In the noisy case, the sufficient condition assumes additionally an upper bound for the noise-to-object ratio in terms of the RIC and the dynamic range of objects. This bound points to the super-resolution capability of the MUSIC algorithm. Rigorous comparison of performance between MUSIC and the CS minimization principle, basis pursuit denoising (BPDN), is given. In general, the MUSIC algorithm guarantees to recover, with high probability, s scatterers with n= {O}(s^2) random sampling and incident directions and sufficiently high frequency. For the favorable imaging geometry where the scatterers are distributed on a transverse plane MUSIC guarantees to recover, with high probability, s scatterers with a median frequency and n= {O}(s) random sampling/incident directions. Moreover, for the problems of spectral estimation and source localizations both BPDN and MUSIC guarantee, with high probability, to identify exactly the frequencies of random signals with the number n= {O}(s) of sampling times. However, in the absence of abundant realizations of signals, BPDN is the preferred method for spectral estimation. Indeed, BPDN can identify the frequencies approximately with just one realization of signals with the recovery error at worst linearly proportional to the noise level. Numerical results confirm that BPDN outperforms MUSIC in the well
The MUSIC algorithm for sparse objects: a compressed sensing analysis
International Nuclear Information System (INIS)
The multiple signal classification (MUSIC) algorithm, and its extension for imaging sparse extended objects, with noisy data is analyzed by compressed sensing (CS) techniques. A thresholding rule is developed to augment the standard MUSIC algorithm. The notion of restricted isometry property (RIP) and an upper bound on the restricted isometry constant (RIC) are employed to establish sufficient conditions for the exact localization by MUSIC with or without noise. In the noiseless case, the sufficient condition gives an upper bound on the numbers of random sampling and incident directions necessary for exact localization. In the noisy case, the sufficient condition assumes additionally an upper bound for the noise-to-object ratio in terms of the RIC and the dynamic range of objects. This bound points to the super-resolution capability of the MUSIC algorithm. Rigorous comparison of performance between MUSIC and the CS minimization principle, basis pursuit denoising (BPDN), is given. In general, the MUSIC algorithm guarantees to recover, with high probability, s scatterers with n=O(s2) random sampling and incident directions and sufficiently high frequency. For the favorable imaging geometry where the scatterers are distributed on a transverse plane MUSIC guarantees to recover, with high probability, s scatterers with a median frequency and n=O(s) random sampling/incident directions. Moreover, for the problems of spectral estimation and source localizations both BPDN and MUSIC guarantee, with high probability, to identify exactly the frequencies of random signals with the number n=O(s) of sampling times. However, in the absence of abundant realizations of signals, BPDN is the preferred method for spectral estimation. Indeed, BPDN can identify the frequencies approximately with just one realization of signals with the recovery error at worst linearly proportional to the noise level. Numerical results confirm that BPDN outperforms MUSIC in the well-resolved case while
Compressed Sensing Quantum Process Tomography for Superconducting Quantum Gates
Rodionov, Andrey
An important challenge in quantum information science and quantum computing is the experimental realization of high-fidelity quantum operations on multi-qubit systems. Quantum process tomography (QPT) is a procedure devised to fully characterize a quantum operation. We first present the results of the estimation of the process matrix for superconducting multi-qubit quantum gates using the full data set employing various methods: linear inversion, maximum likelihood, and least-squares. To alleviate the problem of exponential resource scaling needed to characterize a multi-qubit system, we next investigate a compressed sensing (CS) method for QPT of two-qubit and three-qubit quantum gates. Using experimental data for two-qubit controlled-Z gates, taken with both Xmon and superconducting phase qubits, we obtain estimates for the process matrices with reasonably high fidelities compared to full QPT, despite using significantly reduced sets of initial states and measurement configurations. We show that the CS method still works when the amount of data is so small that the standard QPT would have an underdetermined system of equations. We also apply the CS method to the analysis of the three-qubit Toffoli gate with simulated noise, and similarly show that the method works well for a substantially reduced set of data. For the CS calculations we use two different bases in which the process matrix is approximately sparse (the Pauli-error basis and the singular value decomposition basis), and show that the resulting estimates of the process matrices match with reasonably high fidelity. For both two-qubit and three-qubit gates, we characterize the quantum process by its process matrix and average state fidelity, as well as by the corresponding standard deviation defined via the variation of the state fidelity for different initial states. We calculate the standard deviation of the average state fidelity both analytically and numerically, using a Monte Carlo method. Overall
Compressed Sensing and Low-Rank Matrix Decomposition in Multisource Images Fusion
Directory of Open Access Journals (Sweden)
Kan Ren
2014-01-01
Full Text Available We propose a novel super-resolution multisource images fusion scheme via compressive sensing and dictionary learning theory. Under the sparsity prior of images patches and the framework of the compressive sensing theory, the multisource images fusion is reduced to a signal recovery problem from the compressive measurements. Then, a set of multiscale dictionaries are learned from several groups of high-resolution sample image’s patches via a nonlinear optimization algorithm. Moreover, a new linear weights fusion rule is proposed to obtain the high-resolution image. Some experiments are taken to investigate the performance of our proposed method, and the results prove its superiority to its counterparts.
International Nuclear Information System (INIS)
In this manuscript we have successfully synthesized a large scale 3D dendritic α-Fe2O3 hierarchical structure via a hydrothermal reaction. The crystallinity, composition, purity, morphology of the synthesized α-Fe2O3 are characterized by powder X-ray diffraction (PXRD), field emission scanning electron microscopic (FESEM), energy dispersive X-ray spectroscopic (EDS). FESEM image reveals that the individual α-Fe2O3 dendrite consists of a long central trunk with secondary and tertiary branches. For electrochemical H2O2 sensing we have carried out cyclic voltammetry (CV), amperometric i-t measurement. It has been found that the current density vs. H2O2 concentration calibration curve is linear in nature. The present study reveals that the dendritic α-Fe2O3 hierarchical structure exhibits very sensitive electrochemical sensing capability towards H2O2 reduction
三维有限元刚度矩阵的压缩存储算法%Compressed storage algorithm of 3D-FEM stiffness matrix
Institute of Scientific and Technical Information of China (English)
王忠雷; 赵国群; 马新武
2012-01-01
为提高有限元分析效率、减少存储空间消耗,对刚度矩阵的压缩存储算法进行了研究.研究了＂广义相邻节点对＂与刚度矩阵中非零子矩阵的关系,确定了刚度矩阵中非零子矩阵的分布规律;提出了一种新的刚度矩阵压缩存储方法—＂改进的CSR存储方法＂,给出了基于压缩存储的刚度矩阵的生成过程以及线性方程组迭代解法方法,并将提出的算法应用于三维体积成形有限元分析软件.有限元分析实例表明,该算法可以有效地减少存储空间,提高计算效率.%To improve the efficiency and reduce the storage space of finite element analysis,compression and storage algorithm of 3D-FEM stiffness matrix is studied.The relationship between ＂generalized adjacent double nodes＂ and the non-zero sub-matrix in stiffness matrix is researched for getting distribution of non-zero sub-matrix in stiffness matrix.A new algorithm of stiffness matrix of compressed storage-＂improved CSR storage method＂ is proposed.Based on the algorithm,the generation process of stiffness matrix is given and iterative solution of linear equations method is proposed to improve the efficiency of solving linear equations.The algorithm is applied to the three-dimensional bulk forming finite element analysis software and the numerical results show that the algorithm can effectively decrease the storage space and improve the computation efficiency.
Task-Driven Adaptive Statistical Compressive Sensing of Gaussian Mixture Models
Duarte-Carvajalino, Julio M; Carin, Lawrence; Sapiro, Guillermo
2012-01-01
A framework for adaptive and non-adaptive statistical compressive sensing is developed, where a statistical model replaces the standard sparsity model of classical compressive sensing. We propose within this framework optimal task-specific sensing protocols specifically and jointly designed for classification and reconstruction. A two-step adaptive sensing paradigm is developed, where online sensing is applied to detect the signal class in the first step, followed by a reconstruction step adapted to the detected class and the observed samples. The approach is based on information theory, here tailored for Gaussian mixture models (GMMs), where an information-theoretic objective relationship between the sensed signals and a representation of the specific task of interest is maximized. Experimental results using synthetic signals, Landsat satellite attributes, and natural images of different sizes and with different noise levels show the improvements achieved using the proposed framework when compared to more st...
Compressive sensing beamforming based on covariance for acoustic imaging with noisy measurements.
Zhong, Siyang; Wei, Qingkai; Huang, Xun
2013-11-01
Compressive sensing, a newly emerging method from information technology, is applied to array beamforming and associated acoustic applications. A compressive sensing beamforming method (CSB-II) is developed based on sampling covariance matrix, assuming spatially sparse and incoherent signals, and then examined using both simulations and aeroacoustic measurements. The simulation results clearly show that the proposed CSB-II method is robust to sensing noise. In addition, aeroacoustic tests of a landing gear model demonstrate the good performance in terms of resolution and sidelobe rejection.
Preparation of Au-sensitized 3D hollow SnO2 microspheres with an enhanced sensing performance
International Nuclear Information System (INIS)
Highlights: • A hollow microsphere was synthesized. • The microsphere has a size of 600–900 nm. • The microsphere exhibits excellent sensing performances. -- Abstract: A controlled synthesis of three-dimensional Au-sensitized SnO2 hollow microspheres that composed of numerous nanorod subunits has been realized via a facile one-pot hydrothermal method without employing any templates or capping agents. The structural and morphological characteristics of the pure and Au-loaded SnO2 microspheres are revealed by X-ray diffraction, field-emission scanning electron microscope, and high resolution transmission electron microscope, respectively. The characterized results reveal that SnO2 hollow microspheres have the diameter of 600–900 nm with a rutile structure, which are composed of high densities of secondary SnO2 nanorods with the size of 20–50 nm. Furthermore, the gas sensors based on the pure and Au-loaded SnO2 have been fabricated, and the Au-loaded hierarchical SnO2 hollow microspheres exhibit more excellent sensing performances than that of pure SnO2 to acetone. The response and recovery times of the Au-loaded SnO2 microspheres are 0.9 s and 21 s when the sensor is exposed to 5 ppm acetone at the optimal operating temperature of 220 °C. These improved acetone-sensing performances are attributed to the catalytic effect of Au and the enhanced electron depletion at the surface of SnO2 hollow microspheres
A SPARSITY AND COMPRESSION RATIO JOINT ADJUSTMENT METHOD FOR COLLABORATIVE SPECTRUM SENSING
Institute of Scientific and Technical Information of China (English)
Chi Jingxiu; Zhang Jianwu; Xu Xiaorong
2012-01-01
Spectrum sensing is the fundamental task for Cognitive Radio (CR).To overcome the challenge of high sampling rate in traditional spectral estimation methods,Compressed Sensing (CS) theory is developed.A sparsity and compression ratio joint adjustment algorithm for compressed spectrum sensing in CR network is investigated,with the hypothesis that the sparsity level is unknown as priori knowledge at CR terminals.As perfect spectrum reconstruction is not necessarily required during spectrum detection process,the proposed algorithm only performs a rough estimate of sparsity level.Meanwhile,in order to further reduce the sensing measurement,different compression ratios for CR terminals with varying Signal-to-Noise Ratio (SNR) are considered.The proposed algorithm,which optimizes the compression ratio as well as the estimated sparsity level,can greatly reduce the sensing measurement without degrading the detection performance.It also requires less steps of iteration for convergence.Corroborating simulation results are presented to testify the effectiveness of the proposed algorithm for collaborative spectrum sensing.
Bruno, Oscar
2015-01-01
This paper introduces alternating-direction implicit (ADI) solvers of higher order of time-accuracy (orders two to six) for the compressible Navier-Stokes equations in two- and three-dimensional curvilinear domains. The higher-order accuracy in time results from 1) An application of the backward differentiation formulae time-stepping algorithm (BDF) in conjunction with 2) A BDF-like extrapolation technique for certain components of the nonlinear terms (which makes use of nonlinear solves unnecessary), as well as 3) A novel application of the Douglas-Gunn splitting (which greatly facilitates handling of boundary conditions while preserving higher-order accuracy in time). As suggested by our theoretical analysis of the algorithms for a variety of special cases, an extensive set of numerical experiments clearly indicate that all of the BDF-based ADI algorithms proposed in this paper are "quasi-unconditionally stable" in the following sense: each algorithm is stable for all couples $(h,\\Delta t)$ of spatial and t...
Directory of Open Access Journals (Sweden)
Yolanda Rodriguez-Vaqueiro
2014-01-01
Full Text Available This work presents a new radar system concept, capable of detecting explosive related threats at standoff distances. The system consists of a two-dimensional aperture of randomly distributed transmitting/receiving antenna elements and a set of passive reflecting surfaces (PRS positioned in the vicinity of the target. The PRS act as a mirror that enhances the field of view of the radar system, thus increasing its resolution. A 3D imaging algorithm, based on novel compressive sensing techniques, is used in this work. This system configuration provides a resolution of 7.1 mm in cross-range and 25 mm in range, when the target is at 10 m range, and the radar works at 60 GHz center frequency and has 6 GHz bandwidth.
Directory of Open Access Journals (Sweden)
Antonio Miguel Martínez-Graña
2016-01-01
Full Text Available The key focus of this paper is to establish a procedure that combines the use of Geographical Information Systems (GIS and remote sensing in order to achieve simulation and modeling of the landscape impact caused by construction. The procedure should be easily and inexpensively developed. With the aid of 3D virtual reconstruction and visualization, this paper proposes that the technologies of remote sensing and GIS can be applied to the landscape for post-urbanization environmental restoration. The goal is to create a rural zone in an urban development sector that integrates the residential areas and local infrastructure into the surrounding natural environment in order to measure the changes to the preliminary urban design. The units of the landscape are determined by means of two cartographic methods: (1 indirect, using the components of the landscape; and (2 direct methods, using the landscape’s elements. The visual basins are calculated for the most transited by the population points, while establishing the zones that present major impacts for the urbanization of their landscape. Based on this, the different construction types are distributed (one-family houses, blocks of houses, etc., selecting the types of plant masses either with ornamentals or integration depending on the zone; integrating water channels, creating a water channel in recirculation and green spaces and leisure time facilities. The techniques of remote sensing and GIS allow for the visualization and modeling of the urbanization in 3D, simulating the virtual reality of the infrastructure as well as the actions that need to be taken for restoration, thereby providing at a low cost an understanding of landscape integration before it takes place.
Ke, Jun; Lam, Edmund Y
2016-05-01
Compressive measurements benefit low-light-level imaging (L3-imaging) due to the significantly improved measurement signal-to-noise ratio (SNR). However, as with other compressive imaging (CI) systems, compressive L3-imaging is slow. To accelerate the data acquisition, we develop an algorithm to compute the optimal binary sensing matrix that can minimize the image reconstruction error. First, we make use of the measurement SNR and the reconstruction mean square error (MSE) to define the optimal gray-value sensing matrix. Then, we construct an equality-constrained optimization problem to solve for a binary sensing matrix. From several experimental results, we show that the latter delivers a similar reconstruction performance as the former, while having a smaller dynamic range requirement to system sensors.
Compressive Sensing in Speech from LPC using Gradient Projection for Sparse Reconstruction
Directory of Open Access Journals (Sweden)
Viral Modha
2015-02-01
Full Text Available This paper presents compressive sensing technique used for speech reconstruction using linear predictive coding because the speech is more sparse in LPC. DCT of a speech is taken and the DCT points of sparse speech are thrown away arbitrarily. This is achieved by making some point in DCT domain to be zero by multiplying with mask functions. From the incomplete points in DCT domain, the original speech is reconstructed using compressive sensing and the tool used is Gradient Projection for Sparse Reconstruction. The performance of the result is compared with direct IDCT subjectively. The experiment is done and it is observed that the performance is better for compressive sensing than the DCT.
Wavelet Transform-Based Distributed Compressed Sensing in Wireless Sensor Networks
Institute of Scientific and Technical Information of China (English)
Hu Haifeng; Yang Zhen; Bao Jianmin
2012-01-01
Wireless Sensor Networks （WSN） are mainly characterized by a potentially large number of distributed sensor nodes which collectively transmit information about sensed events to the sink. In this paper, we present a Distributed Wavelet Basis Gener- ation （DWBG） algorithm performing at the sink to obtain the distributed wavelet basis in WSN. And on this basis, a Wavelet Transform-based Distributed Compressed Sensing （WTDCS） algorithm is proposed to compress and reconstruct the sensed data with spatial correlation. Finally, we make a detailed analysis of relationship between reconstruction performance and WTDCS algorithm parameters such as the compression ratio, the channel Signal-to-Noise Ratio （SNR）, the observation noise power and the correlation decay parameter by simulation. The simulation results show that WTDCS can achieve high performance in terms of energy and reconstruction accuracy, as compared to the conventional distributed wavelet transform algorithm.
Li, Edward; Shafiee, Mohammad Javad; Haider, Masoom A; Wong, Alexander
2015-01-01
Magnetic Resonance Imaging (MRI) is a crucial medical imaging technology for the screening and diagnosis of frequently occurring cancers. However image quality may suffer by long acquisition times for MRIs due to patient motion, as well as result in great patient discomfort. Reducing MRI acquisition time can reduce patient discomfort and as a result reduces motion artifacts from the acquisition process. Compressive sensing strategies, when applied to MRI, have been demonstrated to be effective at decreasing acquisition times significantly by sparsely sampling the \\emph{k}-space during the acquisition process. However, such a strategy requires advanced reconstruction algorithms to produce high quality and reliable images from compressive sensing MRI. This paper proposes a new reconstruction approach based on cross-domain stochastically fully connected conditional random fields (CD-SFCRF) for compressive sensing MRI. The CD-SFCRF introduces constraints in both \\emph{k}-space and spatial domains within a stochas...
Compressed Sensing-Based MRI Reconstruction Using Complex Double-Density Dual-Tree DWT
Directory of Open Access Journals (Sweden)
Zangen Zhu
2013-01-01
Full Text Available Undersampling k-space data is an efficient way to speed up the magnetic resonance imaging (MRI process. As a newly developed mathematical framework of signal sampling and recovery, compressed sensing (CS allows signal acquisition using fewer samples than what is specified by Nyquist-Shannon sampling theorem whenever the signal is sparse. As a result, CS has great potential in reducing data acquisition time in MRI. In traditional compressed sensing MRI methods, an image is reconstructed by enforcing its sparse representation with respect to a basis, usually wavelet transform or total variation. In this paper, we propose an improved compressed sensing-based reconstruction method using the complex double-density dual-tree discrete wavelet transform. Our experiments demonstrate that this method can reduce aliasing artifacts and achieve higher peak signal-to-noise ratio (PSNR and structural similarity (SSIM index.
Non-convex prior image constrained compressed sensing (NC-PICCS)
Ramírez Giraldo, Juan Carlos; Trzasko, Joshua D.; Leng, Shuai; McCollough, Cynthia H.; Manduca, Armando
2010-04-01
The purpose of this paper is to present a new image reconstruction algorithm for dynamic data, termed non-convex prior image constrained compressed sensing (NC-PICCS). It generalizes the prior image constrained compressed sensing (PICCS) algorithm with the use of non-convex priors. Here, we concentrate on perfusion studies using computed tomography examples in simulated phantoms (with and without added noise) and in vivo data, to show how the NC-PICCS method holds potential for dramatic reductions in radiation dose for time-resolved CT imaging. We show that NC-PICCS can provide additional undersampling compared to conventional convex compressed sensing and PICCS, as well as, faster convergence under a quasi-Newton numerical solver.
A novel Spectrum Estimation Algorithm Based on Compressed Sensing and Multi-taper Method
Directory of Open Access Journals (Sweden)
Wang Keqing
2013-04-01
Full Text Available To estimate the wideband or multi-channel signals’ spectrum swiftly and exactly is a key technology to improve the performance of wideband spectrum sensing. The paper was proposed a novel spectrum estimation algorithm based on compressed sensing (CS and multi-taper method (MTM, which is called CS-MTM. The new algorithm was validated by single-tone, multi-tone and QPSK signals. Meanwhile, the paper has validated six common random meaurement matrixes which can be used in compressed spectrum estimation algorithm successfully. Simulation results show that the proposed approach can potentially achieve better performance than multi-taper method combined with singular-value decomposition based on compressed sensing(CS-MTM-SVD in complexity, accuracy and real-time property.
压缩传感技术及其应用%Compressive Sensing and its Applications
Institute of Scientific and Technical Information of China (English)
2013-01-01
This paper introduced a new signal processing method —Compressive Sensing (CS ) . Recently , an emerging theory of signal acquirement named Compressive Sensing become one of the hottest topics of signal sampling and image processing .It is a novel signal sampling theory under the condition that the signal is sparse or compressible .It has the ability of compressing a signal during the process of sampling .It consists of three main areas :sparse representation matrix , measurement matrix and reconstruction algorithm . This paper mainly introduces the model of Compressive Sensing ,and the main reconstruction algorithms ,then analyses and compares the algorithms .Finally ,the paper lists the main applications of Compressive Sensing .% 本文综述了一种新的信号处理方法—压缩传感（Compressive Sensing ，CS），它是针对稀疏或者可压缩信号，在采样的同时即可对信号数据进行适当压缩的新理论。近年来，压缩传感理论成为信号采样及图像处理领域最新、最热点的问题之一。它主要包括三个方面：稀疏表示矩阵，非相干测量矩阵以及重建算法。本文介绍了压缩传感理论的模型，以及压缩传感的主要重建算法，并将实现方法进行了分析与比较。文章最后列举出了压缩传感的主要应用领域。
Design and Exploration of Low-Power Analog to Information Conversion Based on Compressed Sensing
Mamaghanian, Hossein; Khaled, Nadia; Atienza Alonso, David; Vandergheynst, Pierre
2012-01-01
The long-standing analog-to-digital conversion paradigm based on Shannon/Nyquist sampling has been challenged lately, mostly in situations such as radar and communication signal processing where signal bandwidth is so large that sampling architectures constraints are simply not manageable. Compressed Sensing (CS) [1], [2], [3] is a new emerging signal acquisition/compression paradigm that offers a striking alternative to traditional signal acquisition. CS states that a signal having a sparse ...
Efficient Sparse Signal Transmission over a Lossy Link Using Compressive Sensing
Liantao Wu; Kai Yu; Dongyu Cao; Yuhen Hu; Zhi Wang
2015-01-01
Reliable data transmission over lossy communication link is expensive due to overheads for error protection. For signals that have inherent sparse structures, compressive sensing (CS) is applied to facilitate efficient sparse signal transmissions over lossy communication links without data compression or error protection. The natural packet loss in the lossy link is modeled as a random sampling process of the transmitted data, and the original signal will be reconstructed from the lossy trans...
Jie TANG; Nett, Brian E; Chen, Guang-Hong
2009-01-01
Of all available reconstruction methods, statistical iterative reconstruction algorithms appear particularly promising since they enable accurate physical noise modeling. The newly developed compressive sampling/compressed sensing (CS) algorithm has shown the potential to accurately reconstruct images from highly undersampled data. The CS algorithm can be implemented in the statistical reconstruction framework as well. In this study, we compared the performance of two standard statistical rec...
Constructing Maximum-Lifetime Data-Gathering Tree in WSNs Based on Compressed Sensing
Chen, Zhengyu; Yang, Geng; Chen, Lei; Xu, Jian
2016-01-01
Data gathering is one of the most important operations in many wireless sensor networks (WSNs) applications. In order to implement data gathering, a tree structure rooted at the sink is usually defined. In most wireless sensor networks, nodes are powered by batteries with limited energy. Prolonging network lifetime is a critical issue for WSNs. As a technique for signal processing, compressed sensing (CS) is being increasingly applied to wireless sensor networks for saving energy. Compressive...
Compressive spectrum sensing of radar pulses based on photonic techniques.
Guo, Qiang; Liang, Yunhua; Chen, Minghua; Chen, Hongwei; Xie, Shizhong
2015-02-23
We present a photonic-assisted compressive sampling (CS) system which can acquire about 10(6) radar pulses per second spanning from 500 MHz to 5 GHz with a 520-MHz analog-to-digital converter (ADC). A rectangular pulse, a linear frequency modulated (LFM) pulse and a pulse stream is respectively reconstructed faithfully through this system with a sliding window-based recovery algorithm, demonstrating the feasibility of the proposed photonic-assisted CS system in spectral estimation for radar pulses.
Zhao, Anshun; Zhang, Zhaowei; Zhang, Penghui; Xiao, Shuang; Wang, Lu; Dong, Yue; Yuan, Hao; Li, Peiwu; Sun, Yimin; Jiang, Xueliang; Xiao, Fei
2016-09-28
Recent advances in on-body wearable medical apparatus and implantable devices drive the development of light-weight and bendable electrochemical sensors, which require the design of high-performance flexible electrode system. In this work, we reported a new type of freestanding and flexible electrode based on graphene paper (GP) supported 3D monolithic nanoporous gold (NPG) scaffold (NPG/GP), which was further modified by a layer of highly dense, well dispersed and ultrafine binary PtCo alloy nanoparticles via a facile and effective ultrasonic electrodeposition method. Our results demonstrated that benefited from the synergistic effect of the electrocatalytically active PtCo alloy nanoparticles, the large-active-area and highly conductive 3D NPG scaffold, and the mechanically strong and stable GP electrode substrate, the resultant PtCo alloy nanoparticles modified NPG/GP (PtCo/NPG/GP) exhibited high mechanical strength and good electrochemical sensing performances toward nonenzymatic detection of glucose, including a wide linear range from 35 μM- to 30 mM, a low detection limit of 5 μM (S/N = 3) and a high sensitivity of 7.84 μA cm(-2) mM(-1) as well as good selectivity, long-term stability and reproducibility. The practical application of the proposed PtCo/NPG/GP has also been demonstrated in in vitro detection of blood glucose in real clinic samples. PMID:27619087
Esfandyarpour, Rahim; Yang, Lu; Koochak, Zahra; Harris, James S; Davis, Ronald W
2016-02-01
The improvements in our ability to sequence and genotype DNA have opened up numerous avenues in the understanding of human biology and medicine with various applications, especially in medical diagnostics. But the realization of a label free, real time, high-throughput and low cost biosensing platforms to detect molecular interactions with a high level of sensitivity has been yet stunted due to two factors: one, slow binding kinetics caused by the lack of probe molecules on the sensors and two, limited mass transport due to the planar structure (two-dimensional) of the current biosensors. Here we present a novel three-dimensional (3D), highly sensitive, real-time, inexpensive and label-free nanotip array as a rapid and direct platform to sequence-specific DNA screening. Our nanotip sensors are designed to have a nano sized thin film as their sensing area (~ 20 nm), sandwiched between two sensing electrodes. The tip is then conjugated to a DNA oligonucleotide complementary to the sequence of interest, which is electrochemically detected in real-time via impedance changes upon the formation of a double-stranded helix at the sensor interface. This 3D configuration is specifically designed to improve the biomolecular hit rate and the detection speed. We demonstrate that our nanotip array effectively detects oligonucleotides in a sequence-specific and highly sensitive manner, yielding concentration-dependent impedance change measurements with a target concentration as low as 10 pM and discrimination against even a single mismatch. Notably, our nanotip sensors achieve this accurate, sensitive detection without relying on signal indicators or enhancing molecules like fluorophores. It can also easily be scaled for highly multiplxed detection with up to 5000 sensors/square centimeter, and integrated into microfluidic devices. The versatile, rapid, and sensitive performance of the nanotip array makes it an excellent candidate for point-of-care diagnostics, and high
High capacity image steganography method based on framelet and compressive sensing
Xiao, Moyan; He, Zhibiao
2015-12-01
To improve the capacity and imperceptibility of image steganography, a novel high capacity and imperceptibility image steganography method based on a combination of framelet and compressive sensing (CS) is put forward. Firstly, SVD (Singular Value Decomposition) transform to measurement values obtained by compressive sensing technique to the secret data. Then the singular values in turn embed into the low frequency coarse subbands of framelet transform to the blocks of the cover image which is divided into non-overlapping blocks. Finally, use inverse framelet transforms and combine to obtain the stego image. The experimental results show that the proposed steganography method has a good performance in hiding capacity, security and imperceptibility.
Béché, Armand; Freitag, Bert; Verbeeck, Jo
2015-01-01
The concept of compressive sensing was recently proposed to significantly reduce the electron dose in scanning transmission electron microscopy (STEM) while still maintaining the main features in the image. Here, an experimental setup based on an electromagnetic shutter placed in the condenser plane of a STEM is proposed. The shutter blanks the beam following a random pattern while the scanning coils are moving the beam in the usual scan pattern. Experimental images at both medium scale and high resolution are acquired and then reconstructed based on a discrete cosine algorithm. The obtained results confirm the predicted usefulness of compressive sensing in experimental STEM even though some remaining artifacts need to be resolved.
Linear Program Relaxation of Sparse Nonnegative Recovery in Compressive Sensing Microarrays
Directory of Open Access Journals (Sweden)
Linxia Qin
2012-01-01
Full Text Available Compressive sensing microarrays (CSM are DNA-based sensors that operate using group testing and compressive sensing principles. Mathematically, one can cast the CSM as sparse nonnegative recovery (SNR which is to find the sparsest solutions subjected to an underdetermined system of linear equations and nonnegative restriction. In this paper, we discuss the l1 relaxation of the SNR. By defining nonnegative restricted isometry/orthogonality constants, we give a nonnegative restricted property condition which guarantees that the SNR and the l1 relaxation share the common unique solution. Besides, we show that any solution to the SNR must be one of the extreme points of the underlying feasible set.
Pilotless recovery of clipped OFDM signals by compressive sensing over reliable data carriers
Al-Safadi, Ebrahim B.
2012-06-01
In this paper we propose a novel method of clipping mitigation in OFDM using compressive sensing that completely avoids using reserved tones or channel-estimation pilots. The method builds on selecting the most reliable perturbations from the constellation lattice upon decoding at the receiver (in the frequency domain), and performs compressive sensing over these observations in order to completely recover the sparse nonlinear distortion in the time domain. As such, the method provides a practical solution to the problem of initial erroneous decoding decisions in iterative ML methods, and the ability to recover the distorted signal in one shot. © 2012 IEEE.
Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays.
Qin, Linxia; Xiu, Naihua; Kong, Lingchen; Li, Yu
2012-01-01
Compressive sensing microarrays (CSM) are DNA-based sensors that operate using group testing and compressive sensing principles. Mathematically, one can cast the CSM as sparse nonnegative recovery (SNR) which is to find the sparsest solutions subjected to an underdetermined system of linear equations and nonnegative restriction. In this paper, we discuss the l₁ relaxation of the SNR. By defining nonnegative restricted isometry/orthogonality constants, we give a nonnegative restricted property condition which guarantees that the SNR and the l₁ relaxation share the common unique solution. Besides, we show that any solution to the SNR must be one of the extreme points of the underlying feasible set.
Pilotless Recovery of Clipped OFDM Signals by Compressive Sensing over Reliable Data Carriers
Safadi, Ebrahim B Al
2011-01-01
In this paper we propose a novel form of clipping mitigation in OFDM using compressive sensing that completely avoids tone reservation and hence rate loss for this purpose. The method builds on selecting the most reliable perturbations from the constellation lattice upon decoding at the receiver, and performs compressive sensing over these observations in order to completely recover the temporally sparse nonlinear distortion. As such, the method provides a unique practical solution to the problem of initial erroneous decoding decisions in iterative ML methods, offering both the ability to augment these techniques and to solely recover the distorted signal in one shot.
Compressive sensing reconstruction of feed-forward connectivity in pulse-coupled nonlinear networks
Barranca, Victor J.; Zhou, Douglas; Cai, David
2016-06-01
Utilizing the sparsity ubiquitous in real-world network connectivity, we develop a theoretical framework for efficiently reconstructing sparse feed-forward connections in a pulse-coupled nonlinear network through its output activities. Using only a small ensemble of random inputs, we solve this inverse problem through the compressive sensing theory based on a hidden linear structure intrinsic to the nonlinear network dynamics. The accuracy of the reconstruction is further verified by the fact that complex inputs can be well recovered using the reconstructed connectivity. We expect this Rapid Communication provides a new perspective for understanding the structure-function relationship as well as compressive sensing principle in nonlinear network dynamics.
Using computer vision and compressed sensing for wood plate surface detection
Zhang, Yizhuo; Liu, Sijia; Tu, Wenjun; Yu, Huiling; Li, Chao
2015-10-01
Aiming at detecting the random and complicated characteristic of wood surface, we proposed a comprehensive detection algorithm based on computer vision and compressed sensing. First, integral projection method was used to trace and locate the position of a wood plate; then surface images were obtained by blocks. Second, multiscaled features were extracted from image to express the surface characteristic. Third, particle swarm optimization algorithm was used for multiscaled features selection. Finally, the defects and textures were detected by compressed sensing classifier. Five types of wood samples, including radial texture, tangential texture, wormhole, live knot, and dead knot, were used for tests, and the average classification accuracy was 94.7%.
A compressive sensing approach to the calculation of the inverse data space
Khan, B. H.
2012-01-01
Seismic processing in the Inverse Data Space (IDS) has its advantages like the task of removing the multiples simply becomes muting the zero offset and zero time data in the inverse domain. Calculation of the Inverse Data Space by sparse inversion techniques has seen mitigation of some artifacts. We reformulate the problem by taking advantage of some of the developments from the field of Compressive Sensing. The seismic data is compressed at the sensor level by recording projections of the traces. We then process this compressed data directly to estimate the inverse data space. Due to the smaller number of data set we also gain in terms of computational complexity.
An ECG Compressed Sensing Method of Low Power Body Area Network
Directory of Open Access Journals (Sweden)
Jizhong Liu
2013-07-01
Full Text Available Aimed at low power problem in body area network, an ECG compressed sensing method of low power body area network based on the compressed sensing theory was proposed. Random binary matrices were used as the sensing matrix to measure ECG signals on the sensor nodes. After measured value is transmitted to remote monitoring center, ECG signal sparse representation under the discrete cosine transform and block sparse Bayesian learning reconstruction algorithm is used to reconstruct the ECG signals. The simulation results show that the 30% of overall signal can get reconstruction signal which’s SNR is more than 60dB, each numbers in each rank of sensing matrix can be controlled below 5, which reduces the power of sensor node sampling, calculation and transmission. The method has the advantages of low power, high accuracy of signal reconstruction and easy to hardware implementation.
Accelerated High-Resolution Photoacoustic Tomography via Compressed Sensing
Arridge, Simon; Betcke, Marta; Cox, Ben; Huynh, Nam; Lucka, Felix; Ogunlade, Olumide; Zhang, Edward
2016-01-01
Current 3D photoacoustic tomography (PAT) systems offer either high image quality or high frame rates but are not able to deliver high spatial and temporal resolution simultaneously, which limits their ability to image dynamic processes in living tissue. A particular example is the planar Fabry-Perot (FP) scanner, which yields high-resolution images but takes several minutes to sequentially map the photoacoustic field on the sensor plane, point-by-point. However, as the spatio-temporal complexity of many absorbing tissue structures is rather low, the data recorded in such a conventional, regularly sampled fashion is often highly redundant. We demonstrate that combining variational image reconstruction methods using spatial sparsity constraints with the development of novel PAT acquisition systems capable of sub-sampling the acoustic wave field can dramatically increase the acquisition speed while maintaining a good spatial resolution: First, we describe and model two general spatial sub-sampling schemes. Then...
Compressed Sensing over $\\ell_p$-balls: Minimax Mean Square Error
Donoho, David; Maleki, Arian; Montanari, Andrea
2011-01-01
We consider the compressed sensing problem, where the object $x_0 \\in \\bR^N$ is to be recovered from incomplete measurements $y = Ax_0 + z$; here the sensing matrix $A$ is an $n \\times N$ random matrix with iid Gaussian entries and $n 0$. We study an asymptotic regime in which $n$ and $N$ both tend to infinity with limiting ratio $n/N = \\delta \\in (0,1)$, both in the noisy ($z \
Application of Compressed Sensing to 2-D Ultrasonic Propagation Imaging System data
Energy Technology Data Exchange (ETDEWEB)
Mascarenas, David D. [Los Alamos National Laboratory; Farrar, Charles R. [Los Alamos National Laboratory; Chong, See Yenn [Engineering Institute-Korea; Lee, J.R. [Engineering Institute-Korea; Park, Gyu Hae [Los Alamos National Laboratory; Flynn, Eric B. [Los Alamos National Laboratory
2012-06-29
The Ultrasonic Propagation Imaging (UPI) System is a unique, non-contact, laser-based ultrasonic excitation and measurement system developed for structural health monitoring applications. The UPI system imparts laser-induced ultrasonic excitations at user-defined locations on a structure of interest. The response of these excitations is then measured by piezoelectric transducers. By using appropriate data reconstruction techniques, a time-evolving image of the response can be generated. A representative measurement of a plate might contain 800x800 spatial data measurement locations and each measurement location might be sampled at 500 instances in time. The result is a total of 640,000 measurement locations and 320,000,000 unique measurements. This is clearly a very large set of data to collect, store in memory and process. The value of these ultrasonic response images for structural health monitoring applications makes tackling these challenges worthwhile. Recently compressed sensing has presented itself as a candidate solution for directly collecting relevant information from sparse, high-dimensional measurements. The main idea behind compressed sensing is that by directly collecting a relatively small number of coefficients it is possible to reconstruct the original measurement. The coefficients are obtained from linear combinations of (what would have been the original direct) measurements. Often compressed sensing research is simulated by generating compressed coefficients from conventionally collected measurements. The simulation approach is necessary because the direct collection of compressed coefficients often requires compressed sensing analog front-ends that are currently not commercially available. The ability of the UPI system to make measurements at user-defined locations presents a unique capability on which compressed measurement techniques may be directly applied. The application of compressed sensing techniques on this data holds the potential to
Puy, Gilles; Gribonval, Rémi; Wiaux, Yves
2011-01-01
We advocate a compressed sensing strategy that consists of multiplying the signal of interest by a wide bandwidth modulation before projection onto randomly selected vectors of an orthonormal basis. Firstly, in a digital setting with random modulation, considering a whole class of sensing bases including the Fourier basis, we prove that the technique is universal in the sense that the required number of measurements for accurate recovery is optimal and independent of the sparsity basis. This universality stems from a drastic decrease of coherence between the sparsity and the sensing bases, which for a Fourier sensing basis relates to a spread of the original signal spectrum by the modulation (hence the name "spread spectrum"). The approach is also efficient as sensing matrices with fast matrix multiplication algorithms can be used, in particular in the case of Fourier measurements. Secondly, these results are confirmed by a numerical analysis of the phase transition of the l1- minimization problem. Finally, w...
Split Bregman's optimization method for image construction in compressive sensing
Skinner, D.; Foo, S.; Meyer-Bäse, A.
2014-05-01
The theory of compressive sampling (CS) was reintroduced by Candes, Romberg and Tao, and D. Donoho in 2006. Using a priori knowledge that a signal is sparse, it has been mathematically proven that CS can defY Nyquist sampling theorem. Theoretically, reconstruction of a CS image relies on the minimization and optimization techniques to solve this complex almost NP-complete problem. There are many paths to consider when compressing and reconstructing an image but these methods have remained untested and unclear on natural images, such as underwater sonar images. The goal of this research is to perfectly reconstruct the original sonar image from a sparse signal while maintaining pertinent information, such as mine-like object, in Side-scan sonar (SSS) images. Goldstein and Osher have shown how to use an iterative method to reconstruct the original image through a method called Split Bregman's iteration. This method "decouples" the energies using portions of the energy from both the !1 and !2 norm. Once the energies are split, Bregman iteration is used to solve the unconstrained optimization problem by recursively solving the problems simultaneously. The faster these two steps or energies can be solved then the faster the overall method becomes. While the majority of CS research is still focused on the medical field, this paper will demonstrate the effectiveness of the Split Bregman's methods on sonar images.
Spotlight SAR sparse sampling and imaging method based on compressive sensing
Institute of Scientific and Technical Information of China (English)
XU HuaPing; YOU YaNan; LI ChunSheng; ZHANG LvQian
2012-01-01
Spotlight synthetic aperture radar (SAR) emits a chirp signal and the echo bandwidth can be reduced through dechirp processing,where the A/D sampling rate decreases accordingly at the receiver.Compressive sensing allows the compressible signal to be reconstructed with a high probability using only a few samples by solving a linear program problem.This paper presents a novel signal sampling and imaging method for application to spotlight SAR based on compressive sensing.The signal is randomly sampled after dechirp processing to form a low-dimensional sample set,and the dechirp basis is imported to reconstruct the dechirp signal.Matching pursuit (MP) is used as a reconstruction algorithm.The reconstructed signal uses polar format algorithm (PFA) for imaging.Although our novel mechanism increases the system complexity to an extent,the data storage requirements can be compressed considerably. Several simulations verify the feasibility and accuracy of spotlight SAR signal processing via compressive sensing,and the method still obtains acceptable imaging results with 10％ of the original echo data.
A joint image encryption and watermarking algorithm based on compressive sensing and chaotic map
Xiao, Di; Cai, Hong-Kun; Zheng, Hong-Ying
2015-06-01
In this paper, a compressive sensing (CS) and chaotic map-based joint image encryption and watermarking algorithm is proposed. The transform domain coefficients of the original image are scrambled by Arnold map firstly. Then the watermark is adhered to the scrambled data. By compressive sensing, a set of watermarked measurements is obtained as the watermarked cipher image. In this algorithm, watermark embedding and data compression can be performed without knowing the original image; similarly, watermark extraction will not interfere with decryption. Due to the characteristics of CS, this algorithm features compressible cipher image size, flexible watermark capacity, and lossless watermark extraction from the compressed cipher image as well as robustness against packet loss. Simulation results and analyses show that the algorithm achieves good performance in the sense of security, watermark capacity, extraction accuracy, reconstruction, robustness, etc. Project supported by the Open Research Fund of Chongqing Key Laboratory of Emergency Communications, China (Grant No. CQKLEC, 20140504), the National Natural Science Foundation of China (Grant Nos. 61173178, 61302161, and 61472464), and the Fundamental Research Funds for the Central Universities, China (Grant Nos. 106112013CDJZR180005 and 106112014CDJZR185501).
Characterization of coded random access with compressive sensing based multi user detection
DEFF Research Database (Denmark)
Ji, Yalei; Stefanovic, Cedomir; Bockelmann, Carsten;
2014-01-01
and is inherently capable to take advantage of the capture effect from the PHY layer. Furthermore, at the PHY layer, compressive sensing based multi-user detection (CS-MUD) is a novel technique that exploits sparsity in multi-user detection to achieve a joint activity and data detection. In this paper, we combine...
Back to the sampling theory: a practical and less redundant alternative to Compressed sensing
Yaroslavsky, Leonid
2016-01-01
A method is suggested for restoration of images of N samples from their M
Owodunni, Damilola S.
2014-04-01
In this paper, compressed sensing techniques are proposed to linearize commercial power amplifiers driven by orthogonal frequency division multiplexing signals. The nonlinear distortion is considered as a sparse phenomenon in the time-domain, and three compressed sensing based algorithms are presented to estimate and compensate for these distortions at the receiver using a few and, at times, even no frequency-domain free carriers (i.e. pilot carriers). The first technique is a conventional compressed sensing approach, while the second incorporates a priori information about the distortions to enhance the estimation. Finally, the third technique involves an iterative data-aided algorithm that does not require any pilot carriers and hence allows the system to work at maximum bandwidth efficiency. The performances of all the proposed techniques are evaluated on a commercial power amplifier and compared. The error vector magnitude and symbol error rate results show the ability of compressed sensing to compensate for the amplifier\\'s nonlinear distortions. © 2013 Elsevier B.V.
Three-Dimensional Inverse Transport Solver Based on Compressive Sensing Technique
Cheng, Yuxiong; Wu, Hongchun; Cao, Liangzhi; Zheng, Youqi
2013-09-01
According to the direct exposure measurements from flash radiographic image, a compressive sensing-based method for three-dimensional inverse transport problem is presented. The linear absorption coefficients and interface locations of objects are reconstructed directly at the same time. It is always very expensive to obtain enough measurements. With limited measurements, compressive sensing sparse reconstruction technique orthogonal matching pursuit is applied to obtain the sparse coefficients by solving an optimization problem. A three-dimensional inverse transport solver is developed based on a compressive sensing-based technique. There are three features in this solver: (1) AutoCAD is employed as a geometry preprocessor due to its powerful capacity in graphic. (2) The forward projection matrix rather than Gauss matrix is constructed by the visualization tool generator. (3) Fourier transform and Daubechies wavelet transform are adopted to convert an underdetermined system to a well-posed system in the algorithm. Simulations are performed and numerical results in pseudo-sine absorption problem, two-cube problem and two-cylinder problem when using compressive sensing-based solver agree well with the reference value.
Photonic compressive sensing with a micro-ring-resonator-based microwave photonic filter
DEFF Research Database (Denmark)
Chen, Ying; Ding, Yunhong; Zhu, Zhijing;
2015-01-01
A novel approach to realize photonic compressive sensing (CS) with a multi-tap microwave photonic filter is proposed and demonstrated. The system takes both advantages of CS and photonics to capture wideband sparse signals with sub-Nyquist sampling rate. The low-pass filtering function required...
Compressed Sensing Methods in Radio Receivers Exposed to Noise and Interference
DEFF Research Database (Denmark)
Pierzchlewski, Jacek
is a mathematical tool which allows for sub-Nyquist signal sampling. In this thesis the author opens a new possibility of relaxing requirements for analog signal ltering in a direct conversion receiver by applying compressed sensing. In the proposed solution,high-order low-pass lters which separate...
Foot and ankle compression improves joint position sense but not bipedal stance in older people
Hijmans, J.M.; Zijlstra, W.; Geertzen, J.H.; Hof, A.L.; Postema, K.
2009-01-01
This study investigates the effects of foot and ankle compression on joint position sense (JPS) and balance in older people and young adults. 12 independently living healthy older persons (77-93 years) were recruited from a senior accommodation facility. 15 young adults (19-24 years) also participat
A LOSSLESS COMPRESSION ALGORITHM OF REMOTE SENSING IMAGE FOR SPACE APPLICATIONS
Institute of Scientific and Technical Information of China (English)
Sui Yuping; Yang Chengyu; Liu Yanjun; Wang Jun; Wei Zhonghui; He Xin
2008-01-01
A simple and adaptive lossless compression algorithm is proposed for remote sensing image compression,which includes integer wavelet transform and the Rice entropy coder. By analyzing the probability distribution of integer wavelet transform coefficients and the characteristics of Rice entropy coder,the divide and rule method is used for high-frequency sub-bands and low-frequency one.High-frequency sub-bands are coded by the Rice entropy coder,and low-frequency coefficients are predicted before coding. The role of predictor is to map the low-frequency coefficients into symbols suitable for the entropy coding. Experimental results show that the average Compression Ratio (CR) of our approach is about two,which is close to that of JPEG 2000. The algorithm is simple and easy to be implemented in hardware. Moreover,it has the merits of adaptability,and independent data packet. So the algorithm can adapt to space lossless compression applications.
Block-Based Compressed Sensing for Neutron Radiation Image Using WDFB
Directory of Open Access Journals (Sweden)
Wei Jin
2015-01-01
Full Text Available An ideal compression method for neutron radiation image should have high compression ratio while keeping more details of the original image. Compressed sensing (CS, which can break through the restrictions of sampling theorem, is likely to offer an efficient compression scheme for the neutron radiation image. Combining wavelet transform with directional filter banks, a novel nonredundant multiscale geometry analysis transform named Wavelet Directional Filter Banks (WDFB is constructed and applied to represent neutron radiation image sparsely. Then, the block-based CS technique is introduced and a high performance CS scheme for neutron radiation image is proposed. By performing two-step iterative shrinkage algorithm the problem of L1 norm minimization is solved to reconstruct neutron radiation image from random measurements. The experiment results demonstrate that the scheme not only improves the quality of reconstructed image obviously but also retains more details of original image.
Akoguz, A.; Bozkurt, S.; Gozutok, A. A.; Alp, G.; Turan, E. G.; Bogaz, M.; Kent, S.
2016-06-01
High resolution level in satellite imagery came with its fundamental problem as big amount of telemetry data which is to be stored after the downlink operation. Moreover, later the post-processing and image enhancement steps after the image is acquired, the file sizes increase even more and then it gets a lot harder to store and consume much more time to transmit the data from one source to another; hence, it should be taken into account that to save even more space with file compression of the raw and various levels of processed data is a necessity for archiving stations to save more space. Lossless data compression algorithms that will be examined in this study aim to provide compression without any loss of data holding spectral information. Within this objective, well-known open source programs supporting related compression algorithms have been implemented on processed GeoTIFF images of Airbus Defence & Spaces SPOT 6 & 7 satellites having 1.5 m. of GSD, which were acquired and stored by ITU Center for Satellite Communications and Remote Sensing (ITU CSCRS), with the algorithms Lempel-Ziv-Welch (LZW), Lempel-Ziv-Markov chain Algorithm (LZMA & LZMA2), Lempel-Ziv-Oberhumer (LZO), Deflate & Deflate 64, Prediction by Partial Matching (PPMd or PPM2), Burrows-Wheeler Transform (BWT) in order to observe compression performances of these algorithms over sample datasets in terms of how much of the image data can be compressed by ensuring lossless compression.
Dynamic compression of carbon/epoxy quasi-isotropic in-plane 3D composites%碳/环氧面内准各向三维复合材料的动态压缩性能
Institute of Scientific and Technical Information of China (English)
孙颖; 张鹤江; 郝露; 陈利
2015-01-01
利用置换法三维织物非织造技术结合树脂传递模塑（RTM）工艺，制备了碳/环氧面内准各向三维复合材料和三维正交复合材料。采用岛津万能材料试验机和分离式霍普金森压杆（SHPB）测试系统，对复合材料进行了面内和厚度方向的准静态及动态压缩性能试验，研究了碳/环氧面内准各向三维复合材料不同应变率下的压缩应力-应变关系以及破坏模式。对比分析结果表明：无论面内还是厚度方向，碳/环氧面内准各向三维复合材料的压缩性能都是应变率敏感的，并且其破坏应力和应变的应变率敏感程度大于三维正交复合材料；在面内和厚度方向准静态压缩载荷作用下，面内±45°纱线有效地抑制了面内准各向三维复合材料剪切带的形成和扩展，使得脆性破坏形貌更加均匀；随着应变率增加，面内准各向三维复合材料面内方向以剪切破坏为主，断口比三维正交复合材料粗糙，厚度方向二者破坏模式相同。%Carbon/epoxy quasi-isotropic in-plane 3D composites and 3D orthogonal composites were made by non-woven manufacture technique for 3D fabric and resin transfer molding (RTM)process. The in-plane and through-thickness compression properties at different strain rates of carbon/epoxy quasi-isotropic in-plane 3D composites and 3D orthogonal composites were tested using SHIMADZU universal material testing machine and SHPB measurement system. The compression stress-strain relationships, failure modes under quasi-static and high strain rates were investigated. The results show that the compression performance of carbon/epoxy quasi-isotropic in-plane 3D composites is strain rate dependent in the directions of in-plane and through-thickness. The compression properties of the composites are more strain-rate sensitive than those of 3D orthogonal composites. Under quasi-static loading, the production and spread of shear bonds are
WSNs data acquisition by combining hierarchical routing method and compressive sensing.
Zou, Zhiqiang; Hu, Cunchen; Zhang, Fei; Zhao, Hao; Shen, Shu
2014-09-09
We address the problem of data acquisition in large distributed wireless sensor networks (WSNs). We propose a method for data acquisition using the hierarchical routing method and compressive sensing for WSNs. Only a few samples are needed to recover the original signal with high probability since sparse representation technology is exploited to capture the similarities and differences of the original signal. To collect samples effectively in WSNs, a framework for the use of the hierarchical routing method and compressive sensing is proposed, using a randomized rotation of cluster-heads to evenly distribute the energy load among the sensors in the network. Furthermore, L1-minimization and Bayesian compressed sensing are used to approximate the recovery of the original signal from the smaller number of samples with a lower signal reconstruction error. We also give an extensive validation regarding coherence, compression rate, and lifetime, based on an analysis of the theory and experiments in the environment with real world signals. The results show that our solution is effective in a large distributed network, especially for energy constrained WSNs.
Inverse filtering of radar signals using compressed sensing with application to meteors
Volz, Ryan; Close, Sigrid
2012-10-01
Compressed sensing, a method which relies on sparsity to reconstruct signals with relatively few measurements, provides a new approach to processing radar signals that is ideally suited to detailed imaging and identification of multiple targets. In this paper, we extend previously published theoretical work by investigating the practical problems associated with this approach. In deriving a discrete linear radar model that is suitable for compressed sensing, we discuss what the discrete model can tell us about continuously defined targets and show how sparsity in the latter translates to sparsity in the former. We provide details about how this problem can be solved when using large data sets. Through comparisons with matched filter processing, we validate our compressed sensing technique and demonstrate its application to meteors, where it has the potential to answer open questions about processes like fragmentation and flares. At the cost of computational complexity and an assumption of target sparsity, the benefits over pulse compression using a matched filter include no filtering sidelobes, noise removal, and higher possible range and Doppler frequency resolution.
Tang, Gang; Hou, Wei; Wang, Huaqing; Luo, Ganggang; Ma, Jianwei
2015-10-09
The Shannon sampling principle requires substantial amounts of data to ensure the accuracy of on-line monitoring of roller bearing fault signals. Challenges are often encountered as a result of the cumbersome data monitoring, thus a novel method focused on compressed vibration signals for detecting roller bearing faults is developed in this study. Considering that harmonics often represent the fault characteristic frequencies in vibration signals, a compressive sensing frame of characteristic harmonics is proposed to detect bearing faults. A compressed vibration signal is first acquired from a sensing matrix with information preserved through a well-designed sampling strategy. A reconstruction process of the under-sampled vibration signal is then pursued as attempts are conducted to detect the characteristic harmonics from sparse measurements through a compressive matching pursuit strategy. In the proposed method bearing fault features depend on the existence of characteristic harmonics, as typically detected directly from compressed data far before reconstruction completion. The process of sampling and detection may then be performed simultaneously without complete recovery of the under-sampled signals. The effectiveness of the proposed method is validated by simulations and experiments.
A new backtracking-based sparsity adaptive algorithm for distributed compressed sensing
Institute of Scientific and Technical Information of China (English)
徐勇; 张玉洁; 邢婧; 李宏伟
2015-01-01
A new iterative greedy algorithm based on the backtracking technique was proposed for distributed compressed sensing (DCS) problem. The algorithm applies two mechanisms for precise recovery soft thresholding and cutting. It can reconstruct several compressed signals simultaneously even without any prior information of the sparsity, which makes it a potential candidate for many practical applications, but the numbers of non-zero (significant) coefficients of signals are not available. Numerical experiments are conducted to demonstrate the validity and high performance of the proposed algorithm, as compared to other existing strong DCS algorithms.
Detection of Modified Matrix Encoding Using Machine Learning and Compressed Sensing
Energy Technology Data Exchange (ETDEWEB)
Allen, Josef D [ORNL
2011-01-01
In recent years, driven by the development of steganalysis methods, steganographic algorithms have been evolved rapidly with the ultimate goal of an unbreakable embedding procedure, resulting in recent steganographic algorithms with minimum distortions, exemplified by the recent family of Modified Matrix Encoding (MME) algorithms, which has shown to be most difficult to be detected. In this paper we propose a compressed sensing based on approach for intrinsic steganalysis to detect MME stego messages. Compressed sensing is a recently proposed mathematical framework to represent an image (in general, a signal) using a sparse representation relative to an overcomplete dictionary by minimizing the l1-norm of resulting coefficients. Here we first learn a dictionary from a training set so that the performance will be optimized using the KSVD algorithm; since JPEG images are processed by 8x8 blocks, the training examples are 8x8 patches, rather than the entire images and this increases the generalization of compressed sensing. For each 8x8 block, we compute its sparse representation using OMP (orthogonal matching pursuit) algorithm. Using computed sparse representations, we train a support vector machine (SVM) to classify 8x8 blocks into stego and non-stego classes. Then given an input image, we first divide it into 8x8 blocks. For each 8x8 block, we compute its sparse representation and classify it using the trained SVM. After all the 8x8 blocks are classified, the entire image is classified based on the majority rule of 8x8 block classification results. This allows us to achieve a robust decision even when 8x8 blocks can be classified only with relatively low accuracy. We have tested the proposed algorithm on two datasets (Corel-1000 dataset and a remote sensing image dataset) and have achieved 100% accuracy on classifying images, even though the accuracy of classifying 8x8 blocks is only 80.89%. Key Words Compressed Sensing, Sparcity, Data Dictionary, Steganography
Directory of Open Access Journals (Sweden)
Toofanny Rudesh D
2011-08-01
Full Text Available Abstract Background Molecular dynamics (MD simulations offer the ability to observe the dynamics and interactions of both whole macromolecules and individual atoms as a function of time. Taken in context with experimental data, atomic interactions from simulation provide insight into the mechanics of protein folding, dynamics, and function. The calculation of atomic interactions or contacts from an MD trajectory is computationally demanding and the work required grows exponentially with the size of the simulation system. We describe the implementation of a spatial indexing algorithm in our multi-terabyte MD simulation database that significantly reduces the run-time required for discovery of contacts. The approach is applied to the Dynameomics project data. Spatial indexing, also known as spatial hashing, is a method that divides the simulation space into regular sized bins and attributes an index to each bin. Since, the calculation of contacts is widely employed in the simulation field, we also use this as the basis for testing compression of data tables. We investigate the effects of compression of the trajectory coordinate tables with different options of data and index compression within MS SQL SERVER 2008. Results Our implementation of spatial indexing speeds up the calculation of contacts over a 1 nanosecond (ns simulation window by between 14% and 90% (i.e., 1.2 and 10.3 times faster. For a 'full' simulation trajectory (51 ns spatial indexing reduces the calculation run-time between 31 and 81% (between 1.4 and 5.3 times faster. Compression resulted in reduced table sizes but resulted in no significant difference in the total execution time for neighbour discovery. The greatest compression (~36% was achieved using page level compression on both the data and indexes. Conclusions The spatial indexing scheme significantly decreases the time taken to calculate atomic contacts and could be applied to other multidimensional neighbor discovery
International Nuclear Information System (INIS)
The authors present the results of three electromagnetic field problems for compressed magnetic field generators and their associated power flow channels. The first problem is the computation of the transient magnetic field in a two-dimensional model of a helical generator during loading. The second problem is the three-dimensional eddy current patterns in a section of an armature beneath a bifurcation point of a helical winding. The authors' third problem is the calculation of the three-dimensional electrostatic fields in a region known as the post-hole convolute in which a rod connects the inner and outer walls of a system of three concentric cylinders through a hole in the middle cylinder. While analytic solutions exist for many electromagnetic filed problems in cases of special and ideal geometries, the solution of these and similar problems for the proper analysis and design of compressed magnetic field generators and their related hardware require computer simulations
Zhou, Fei; Nielson, Weston; Xia, Yi; Ozoliņš, Vidvuds
2014-10-31
First-principles prediction of lattice thermal conductivity κ(L) of strongly anharmonic crystals is a long-standing challenge in solid-state physics. Making use of recent advances in information science, we propose a systematic and rigorous approach to this problem, compressive sensing lattice dynamics. Compressive sensing is used to select the physically important terms in the lattice dynamics model and determine their values in one shot. Nonintuitively, high accuracy is achieved when the model is trained on first-principles forces in quasirandom atomic configurations. The method is demonstrated for Si, NaCl, and Cu(12)Sb(4)S(13), an earth-abundant thermoelectric with strong phonon-phonon interactions that limit the room-temperature κ(L) to values near the amorphous limit.
Effect of downsampling and compressive sensing on audio-based continuous cough monitoring.
Casaseca-de-la-Higuera, Pablo; Lesso, Paul; McKinstry, Brian; Pinnock, Hilary; Rabinovich, Roberto; McCloughan, Lucy; Monge-Álvarez, Jesús
2015-01-01
This paper presents an efficient cough detection system based on simple decision-tree classification of spectral features from a smartphone audio signal. Preliminary evaluation on voluntary coughs shows that the system can achieve 98% sensitivity and 97.13% specificity when the audio signal is sampled at full rate. With this baseline system, we study possible efficiency optimisations by evaluating the effect of downsampling below the Nyquist rate and how the system performance at low sampling frequencies can be improved by incorporating compressive sensing reconstruction schemes. Our results show that undersampling down to 400 Hz can still keep sensitivity and specificity values above 90% despite of aliasing. Furthermore, the sparsity of cough signals in the time domain allows keeping performance figures close to 90% when sampling at 100 Hz using compressive sensing schemes.
Simultaneous Greedy Analysis Pursuit for compressive sensing of multi-channel ECG signals.
Avonds, Yurrit; Liu, Yipeng; Van Huffel, Sabine
2014-01-01
This paper addresses compressive sensing for multi-channel ECG. Compared to the traditional sparse signal recovery approach which decomposes the signal into the product of a dictionary and a sparse vector, the recently developed cosparse approach exploits sparsity of the product of an analysis matrix and the original signal. We apply the cosparse Greedy Analysis Pursuit (GAP) algorithm for compressive sensing of ECG signals. Moreover, to reduce processing time, classical signal-channel GAP is generalized to the multi-channel GAP algorithm, which simultaneously reconstructs multiple signals with similar support. Numerical experiments show that the proposed method outperforms the classical sparse multi-channel greedy algorithms in terms of accuracy and the single-channel cosparse approach in terms of processing speed.
A Compressive Sensing SAR Imaging Approach Based on Wavelet Package Algorithm
Directory of Open Access Journals (Sweden)
Shi Yan
2013-06-01
Full Text Available Compressive sensing SAR imaging can significantly reduce the sampling rate and the amount of data,but it is essential only in the case where the reflection coefficients of SAR scene are sparse. This paper proposed a compressive sensing SAR imaging method based on wavelet packet sparse representation. The wavelet packet algorithm is used to choose the most sparse representation of the SAR scene by training the same type of SAR images. By solving for the minimum 1 l norm optimization, the SAR scene reflection coefficients can be reconstructed. Unambiguous SAR image can be produced with the proposed method even with fewer samples. SAR data simulation experiments demonstrate the efficiency of the proposed method.
An algorithm for 252Cf-Source-Driven neutron signal denoising based on Compressive Sensing
Institute of Scientific and Technical Information of China (English)
李鹏程; 魏彪; 冯鹏; 何鹏; 米德伶
2015-01-01
As photoelectrically detected 252Cf-source-driven neutron signals always contain noise, a denoising algorithm is proposed based on compressive sensing for the noised neutron signal. In the algorithm, Empirical Mode Decomposition (EMD) is applied to decompose the noised neutron signal and then find out the noised Intrinsic Mode Function (IMF) automatically. Thus, we only need to use the basis pursuit denoising (BPDN) algorithm to denoise these IMFs. For this reason, the proposed algorithm can be called EMDCSDN (Empirical Mode Decomposition Compressive Sensing Denoising). In addition, five indicators are employed to evaluate the denoising effect. The results show that the EMDCSDN algorithm is more effective than the other denoising algorithms including BPDN. This study provides a new approach for signal denoising at the front-end.
Geethanath, Sairam; Gulaka, Praveen K; Kodibagkar, Vikram D
2014-01-01
Dynamic contrast-enhanced (DCE) magnetic resonance imaging (MRI) has become a valuable clinical tool for cancer diagnosis and prognosis. DCE MRI provides pharmacokinetic parameters dependent on the extravasation of small molecular contrast agents, and thus high temporal resolution and/or spatial resolution is required for accurate estimation of parameters. In this article we investigate the efficacy of 2 undersampling approaches to speed up DCE MRI: a conventional keyhole approach and compressed sensing-based imaging. Data reconstructed from variants of these methods has been compared with the full k-space reconstruction with respect to data quality and pharmacokinetic parameters Ktrans and ve. Overall, compressive sensing provides better data quality and reproducible parametric maps than key-hole methods with higher acceleration factors. In particular, an undersampling mask based on a priori precontrast data showed high fidelity of reconstructed data and parametric maps up to 5× acceleration.
Channel estimation based on distributed compressed sensing in amplify-and-forward relay networks
Institute of Scientific and Technical Information of China (English)
WANG Dong-hao; NIU Kai; HE Zhi-qiang; TIAN Bao-yu
2010-01-01
In orthogonal frequency-division multiplexing(OFDM)amplify-and-forward(AF)relay networks,in order to exploit diversity gains over frequency-selective fading channels,the receiver needs to acquire the knowledge of channel state information(CSI).In this article,based on the recent methodology of distributed compressed sensing(DCS),a novel channel estimation scheme is proposed.The joint sparsity model 2(JSM-2)in DCS theory and simultaneous orthogonal matching pursuit(SOMP)are both introduced to improve the estimation performance and increase the spectral efficiency.Simulation results show that compared with current compressed sensing(CS)methods,the estimation error of our scheme is reduced dramatically in high SNR region while the pilot number is still kept small.
Ali, Anum Z.
2013-12-01
Linearization of user equipment power amplifiers driven by orthogonal frequency division multiplexing signals is addressed in this paper. Particular attention is paid to the power efficient operation of an orthogonal frequency division multiple access cognitive radio system and realization of such a system using compressed sensing. Specifically, precompensated overdriven amplifiers are employed at the mobile terminal. Over-driven amplifiers result in in-band distortions and out of band interference. Out of band interference mostly occupies the spectrum of inactive users, whereas the in-band distortions are mitigated using compressed sensing at the receiver. It is also shown that the performance of the proposed scheme can be further enhanced using multiple measurements of the distortion signal in single-input multi-output systems. Numerical results verify the ability of the proposed setup to improve error vector magnitude, bit error rate, outage capacity and mean squared error. © 2011 IEEE.
Cabrelli, Carlos; Jaffard, Stephane; Molter, Ursula
2016-01-01
This volume is a selection of written notes corresponding to courses taught at the CIMPA School: "New Trends in Applied Harmonic Analysis: Sparse Representations, Compressed Sensing and Multifractal Analysis". New interactions between harmonic analysis and signal and image processing have seen striking development in the last 10 years, and several technological deadlocks have been solved through the resolution of deep theoretical problems in harmonic analysis. New Trends in Applied Harmonic Analysis focuses on two particularly active areas that are representative of such advances: multifractal analysis, and sparse representation and compressed sensing. The contributions are written by leaders in these areas, and covers both theoretical aspects and applications. This work should prove useful not only to PhD students and postdocs in mathematics and signal and image processing, but also to researchers working in related topics.
A compressed sensing based method with support refinement for impulse noise cancelation in DSL
Quadeer, Ahmed Abdul
2013-06-01
This paper presents a compressed sensing based method to suppress impulse noise in digital subscriber line (DSL). The proposed algorithm exploits the sparse nature of the impulse noise and utilizes the carriers, already available in all practical DSL systems, for its estimation and cancelation. Specifically, compressed sensing is used for a coarse estimate of the impulse position, an a priori information based maximum aposteriori probability (MAP) metric for its refinement, followed by least squares (LS) or minimum mean square error (MMSE) estimation for estimating the impulse amplitudes. Simulation results show that the proposed scheme achieves higher rate as compared to other known sparse estimation algorithms in literature. The paper also demonstrates the superior performance of the proposed scheme compared to the ITU-T G992.3 standard that utilizes RS-coding for impulse noise refinement in DSL signals. © 2013 IEEE.
Li, Qiyue; Qu, Xiaobo; Liu, Yunsong; Guo, Di; Lai, Zongying; Ye, Jing; Chen, Zhong
2015-06-01
Compressed sensing MRI (CS-MRI) is a promising technology to accelerate magnetic resonance imaging. Both improving the image quality and reducing the computation time are important for this technology. Recently, a patch-based directional wavelet (PBDW) has been applied in CS-MRI to improve edge reconstruction. However, this method is time consuming since it involves extensive computations, including geometric direction estimation and numerous iterations of wavelet transform. To accelerate computations of PBDW, we propose a general parallelization of patch-based processing by taking the advantage of multicore processors. Additionally, two pertinent optimizations, excluding smooth patches and pre-arranged insertion sort, that make use of sparsity in MR images are also proposed. Simulation results demonstrate that the acceleration factor with the parallel architecture of PBDW approaches the number of central processing unit cores, and that pertinent optimizations are also effective to make further accelerations. The proposed approaches allow compressed sensing MRI reconstruction to be accomplished within several seconds.
Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising
Donoho, David; Montanari, Andrea
2011-01-01
Compressed sensing posits that, within limits, one can undersample a sparse signal and yet reconstruct it accurately. Knowing the precise limits to such undersampling is important both for theory and practice. We present a formula precisely delineating the allowable degree of of undersampling of generalized sparse objects. The formula applies to Approximate Message Passing (AMP) algorithms for compressed sensing, which are here generalized to employ denoising operators besides the traditional scalar shrinkers (soft thresholding, positive soft thresholding and capping). This paper gives several examples including scalar shrinkers not derivable from convex optimization -- the firm shrinkage nonlinearity and the minimax} nonlinearity -- and also nonscalar denoisers -- block thresholding (both block soft and block James-Stein), monotone regression, and total variation minimization. Let the variables \\epsilon = k/N and \\delta = n/N denote the generalized sparsity and undersampling fractions for sampling the k-gene...
Energy Technology Data Exchange (ETDEWEB)
Zhou, Fei [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Nielson, Weston [Univ. of California, Los Angeles, CA (United States); Xia, Yi [Univ. of California, Los Angeles, CA (United States); Ozoliņš, Vidvuds [Univ. of California, Los Angeles, CA (United States)
2014-10-01
First-principles prediction of lattice thermal conductivity κ_{L} of strongly anharmonic crystals is a long-standing challenge in solid-state physics. Making use of recent advances in information science, we propose a systematic and rigorous approach to this problem, compressive sensing lattice dynamics. Compressive sensing is used to select the physically important terms in the lattice dynamics model and determine their values in one shot. Nonintuitively, high accuracy is achieved when the model is trained on first-principles forces in quasirandom atomic configurations. The method is demonstrated for Si, NaCl, and Cu_{12}Sb_{4}S_{13}, an earth-abundant thermoelectric with strong phonon-phonon interactions that limit the room-temperature κ_{L} to values near the amorphous limit.
Primary User Localization Algorithm Based on Compressive Sensing in Cognitive Radio Networks
Directory of Open Access Journals (Sweden)
Fang Ye
2016-04-01
Full Text Available In order to locate source signal more accurately in authorized frequency bands, a novel primary user localization algorithm based on compressive sensing (PU-CSL in cognitive radio networks (CRNs is proposed in this paper. In comparison to existing centroid locating algorithms, PU-CSL shows higher locating accuracy for integrally exploring correlation between source signal and secondary users (SUs. Energy detection is first adopted for collecting the energy fingerprint of source signal at each SU, then degree of correlation between source signal and SUs is reconstructed based on compressive sensing (CS, which determines weights of centroid coordinates. A weighted centroid scheme is finally utilized to estimate source position. Simulation results show that PU-CSL has smaller maximum error of positioning and root-mean-square error. Moreover, the proposed PU-CSL algorithm possess excellent location accuracy and strong anti-noise performance.
Nakanishi-Ohno, Yoshinori; Haze, Masahiro; Yoshida, Yasuo; Hukushima, Koji; Hasegawa, Yukio; Okada, Masato
2016-09-01
We applied a method of compressed sensing to the observation of quasi-particle interference (QPI) by scanning tunneling microscopy/spectroscopy to improve efficiency and save measurement time. To solve an ill-posed problem owing to the scarcity of data, the compressed sensing utilizes the sparseness of QPI patterns in momentum space. We examined the performance of a sparsity-inducing algorithm called least absolute shrinkage and selection operator (LASSO), and demonstrated that LASSO enables us to recover a double-circle QPI pattern of the Ag(111) surface from a dataset whose size is less than that necessary for the conventional Fourier transformation method. In addition, the smallest number of data required for the recovery is discussed on the basis of cross validation.
Sejdić, Ervin; Movahedi, Faezeh; Zhang, Zhenwei; Kurosu, Atsuko; Coyle, James L.
2016-05-01
Acquiring swallowing accelerometry signals using a comprehensive sensing scheme may be a desirable approach for monitoring swallowing safety for longer periods of time. However, it needs to be insured that signal characteristics can be recovered accurately from compressed samples. In this paper, we considered this issue by examining the effects of the number of acquired compressed samples on the calculated swallowing accelerometry signal features. We used tri-axial swallowing accelerometry signals acquired from seventeen stroke patients (106 swallows in total). From acquired signals, we extracted typically considered signal features from time, frequency and time-frequency domains. Next, we compared these features from the original signals (sampled using traditional sampling schemes) and compressively sampled signals. Our results have shown we can obtain accurate estimates of signal features even by using only a third of original samples.
International Nuclear Information System (INIS)
MRI is often the most sensitive or appropriate technique for important measurements in clinical diagnosis and research, but lengthy acquisition times limit its use due to cost and considerations of patient comfort and compliance. Once an image field of view and resolution is chosen, the minimum scan acquisition time is normally fixed by the amount of raw data that must be acquired to meet the Nyquist criteria. Recently, there has been research interest in using the theory of compressed sensing (CS) in MR imaging to reduce scan acquisition times. The theory argues that if our target MR image is sparse, having signal information in only a small proportion of pixels (like an angiogram), or if the image can be mathematically transformed to be sparse then it is possible to use that sparsity to recover a high definition image from substantially less acquired data. This review starts by considering methods of k-space undersampling which have already been incorporated into routine clinical imaging (partial Fourier imaging and parallel imaging), and then explains the basis of using compressed sensing in MRI. The practical considerations of applying CS to MRI acquisitions are discussed, such as designing k-space undersampling schemes, optimizing adjustable parameters in reconstructions and exploiting the power of combined compressed sensing and parallel imaging (CS-PI). A selection of clinical applications that have used CS and CS-PI prospectively are considered. The review concludes by signposting other imaging acceleration techniques under present development before concluding with a consideration of the potential impact and obstacles to bringing compressed sensing into routine use in clinical MRI. (topical review)
Interpolated Compressed Sensing for 2D Multiple Slice Fast MR Imaging
Yong Pang; Xiaoliang Zhang
2013-01-01
Sparse MRI has been introduced to reduce the acquisition time and raw data size by undersampling the k-space data. However, the image quality, particularly the contrast to noise ratio (CNR), decreases with the undersampling rate. In this work, we proposed an interpolated Compressed Sensing (iCS) method to further enhance the imaging speed or reduce data size without significant sacrifice of image quality and CNR for multi-slice two-dimensional sparse MR imaging in humans. This method utilizes...
Hollingsworth, Kieren Grant
2015-11-01
MRI is often the most sensitive or appropriate technique for important measurements in clinical diagnosis and research, but lengthy acquisition times limit its use due to cost and considerations of patient comfort and compliance. Once an image field of view and resolution is chosen, the minimum scan acquisition time is normally fixed by the amount of raw data that must be acquired to meet the Nyquist criteria. Recently, there has been research interest in using the theory of compressed sensing (CS) in MR imaging to reduce scan acquisition times. The theory argues that if our target MR image is sparse, having signal information in only a small proportion of pixels (like an angiogram), or if the image can be mathematically transformed to be sparse then it is possible to use that sparsity to recover a high definition image from substantially less acquired data. This review starts by considering methods of k-space undersampling which have already been incorporated into routine clinical imaging (partial Fourier imaging and parallel imaging), and then explains the basis of using compressed sensing in MRI. The practical considerations of applying CS to MRI acquisitions are discussed, such as designing k-space undersampling schemes, optimizing adjustable parameters in reconstructions and exploiting the power of combined compressed sensing and parallel imaging (CS-PI). A selection of clinical applications that have used CS and CS-PI prospectively are considered. The review concludes by signposting other imaging acceleration techniques under present development before concluding with a consideration of the potential impact and obstacles to bringing compressed sensing into routine use in clinical MRI.
Deformation corrected compressed sensing (DC-CS): a novel framework for accelerated dynamic MRI
Lingala, Sajan Goud; DiBella, Edward; Jacob, Mathews
2014-01-01
We propose a novel deformation corrected compressed sensing (DC-CS) framework to recover dynamic magnetic resonance images from undersampled measurements. We introduce a generalized formulation that is capable of handling a wide class of sparsity/compactness priors on the deformation corrected dynamic signal. In this work, we consider example compactness priors such as sparsity in temporal Fourier domain, sparsity in temporal finite difference domain, and nuclear norm penalty to exploit low r...
Mejia, Yuri H.; Arguello, Henry
2016-05-01
Compressive sensing state-of-the-art proposes random Gaussian and Bernoulli as measurement matrices. Nev- ertheless, often the design of the measurement matrix is subject to physical constraints, and therefore it is frequently not possible that the matrix follows a Gaussian or Bernoulli distribution. Examples of these lim- itations are the structured and sparse matrices of the compressive X-Ray, and compressive spectral imaging systems. A standard algorithm for recovering sparse signals consists in minimizing an objective function that includes a quadratic error term combined with a sparsity-inducing regularization term. This problem can be solved using the iterative algorithms for solving linear inverse problems. This class of methods, which can be viewed as an extension of the classical gradient algorithm, is attractive due to its simplicity. However, current algorithms are slow for getting a high quality image reconstruction because they do not exploit the structured and sparsity characteristics of the compressive measurement matrices. This paper proposes the development of a gradient-based algorithm for compressive sensing reconstruction by including a filtering step that yields improved quality using less iterations. This algorithm modifies the iterative solution such that it forces to converge to a filtered version of the residual AT y, where y is the measurement vector and A is the compressive measurement matrix. We show that the algorithm including the filtering step converges faster than the unfiltered version. We design various filters that are motivated by the structure of AT y. Extensive simulation results using various sparse and structured matrices highlight the relative performance gain over the existing iterative process.
Wood defect detection method with PCA feature fusion and compressed sensing
Institute of Scientific and Technical Information of China (English)
Yizhuo Zhang; Chao Xu; Chao Li; Huiling Yu; Jun Cao
2015-01-01
We used principal component analysis (PCA) and compressed sensing to detect wood defects from wood plate images. PCA makes it possible to reduce data redundancy and feature dimensions and compressed sensing, used as a clas-sifier, improves identification accuracy. We extracted 25 features, including geometry and regional features, gray-scale texture features, and invariant moment features, from wood board images and then integrated them using PCA, and se-lected eight principal components to express defects. After the fusion process, we used the features to construct a data dic-tionary, and realized the classification of defects by computing the optimal solution of the data dictionary in l1 norm using the least square method. We tested 50 Xylosma samples of live knots, dead knots, and cracks. The average detection time with PCA feature fusion and without were 0.2015 and 0.7125 ms, respectively. The original detection accuracy by SOM neural network was 87%, but after compressed sensing, it was 92%.
Reconstructing high-dimensional two-photon entangled states via compressive sensing.
Tonolini, Francesco; Chan, Susan; Agnew, Megan; Lindsay, Alan; Leach, Jonathan
2014-10-13
Accurately establishing the state of large-scale quantum systems is an important tool in quantum information science; however, the large number of unknown parameters hinders the rapid characterisation of such states, and reconstruction procedures can become prohibitively time-consuming. Compressive sensing, a procedure for solving inverse problems by incorporating prior knowledge about the form of the solution, provides an attractive alternative to the problem of high-dimensional quantum state characterisation. Using a modified version of compressive sensing that incorporates the principles of singular value thresholding, we reconstruct the density matrix of a high-dimensional two-photon entangled system. The dimension of each photon is equal to d = 17, corresponding to a system of 83521 unknown real parameters. Accurate reconstruction is achieved with approximately 2500 measurements, only 3% of the total number of unknown parameters in the state. The algorithm we develop is fast, computationally inexpensive, and applicable to a wide range of quantum states, thus demonstrating compressive sensing as an effective technique for measuring the state of large-scale quantum systems.
Accelerated high-frame-rate mouse heart cine-MRI using compressed sensing reconstruction.
Motaal, Abdallah G; Coolen, Bram F; Abdurrachim, Desiree; Castro, Rui M; Prompers, Jeanine J; Florack, Luc M J; Nicolay, Klaas; Strijkers, Gustav J
2013-04-01
We introduce a new protocol to obtain very high-frame-rate cinematographic (Cine) MRI movies of the beating mouse heart within a reasonable measurement time. The method is based on a self-gated accelerated fast low-angle shot (FLASH) acquisition and compressed sensing reconstruction. Key to our approach is that we exploit the stochastic nature of the retrospective triggering acquisition scheme to produce an undersampled and random k-t space filling that allows for compressed sensing reconstruction and acceleration. As a standard, a self-gated FLASH sequence with a total acquisition time of 10 min was used to produce single-slice Cine movies of seven mouse hearts with 90 frames per cardiac cycle. Two times (2×) and three times (3×) k-t space undersampled Cine movies were produced from 2.5- and 1.5-min data acquisitions, respectively. The accelerated 90-frame Cine movies of mouse hearts were successfully reconstructed with a compressed sensing algorithm. The movies had high image quality and the undersampling artifacts were effectively removed. Left ventricular functional parameters, i.e. end-systolic and end-diastolic lumen surface areas and early-to-late filling rate ratio as a parameter to evaluate diastolic function, derived from the standard and accelerated Cine movies, were nearly identical.
Topologic compression for 3D mesh model based on Face Fixer method%基于边扩张算法和熵编码的3D网格模型的拓扑信息压缩
Institute of Scientific and Technical Information of China (English)
许敏; 李钢; 吴石虎; 刘宁
2011-01-01
Firstly, three categorizes methods of compressing polygon mesh topologic information without triangulations were summarized in the paper. Then, the Face Fixer algorithm based on edge conquering was studied. Finally, several 3D mesh models were compressed after topologic encoding when using the same order adaptive arithmetic coder and range coder. The experiments results showed that range coder is superior to arithmetic coder in compression ratio and velocity with the increasing model size. Thus, for larger model, the adaptive range coder is preferred to compress.%本文总结了三类不经三角剖分直接编码多边形网格模型拓扑信息的单分辨率压缩法,对其中基于边区域扩张的Face Fixer算法进行了研究,并分别应用同阶自适应区间编码法和算术编码法对三角形网格模型和多边形网格模型进行了压缩.实验结果表明:随着模型数据量的增大,区间编码的压缩率和压缩速度反而高于算术编码,因而对于大数据量的网格模型,更适直采用区间编码来压缩.
基于压缩感知理论的图像压缩技术研究%Study on Image Compressed Technology Based on Compressed Sensing
Institute of Scientific and Technical Information of China (English)
王辛悦; 周德全
2013-01-01
压缩感知理论是近年来信号处理领域诞生的一种新的信号处理理论.相较于传统的奈奎斯特采样定率,压缩感知理论采样数据量少,节省了后续处理时间和存储空间,这使其在信号处理领域有着广阔的应用前景.首先讨论了应用压缩感知理论的三个关键问题:信号稀疏表示、随机测量矩阵设计、信号重构算法,初步研究了压缩感知理论在图像压缩技术中的应用,给出了在不同压缩率下的重构图像和PSNR.计算机模拟结果表明了理论的可行性.%Compressed sensing theory,as a new signal processing theory appearing in recent years,can capture and represent compressible signals at a rate significantly below the Nyquist sampling rate.Compressed sensing theory provides outstanding advantages,such as less sampled data,shorter processing time and smaller storage space,which shows a good prospect of application in signal processing.During application of compressed sensing theory,three key points are discussed firstly.Secondly,the application of compressed sensing in the field of image compression technology is studied,the reconstructed images and PSNR at different compress rates are given.The computer simulation proves the feasibility of compressed sensing theory.
3D-DCT based volumetric three-dimensional video data compression method%基于三维离散余弦变换的体三维视频数据压缩
Institute of Scientific and Technical Information of China (English)
张申; 王维东; 赵亚飞; 吴祖成; 王曰海; 张明
2012-01-01
针对体三维视频数据量巨大的问题,提出基于三维离散余弦变换(3D-DCT)的体三维视频数据压缩方法.该方法结合3D-DCT和三维运动估计,利用3D-DCT消除体帧内部的空间冗余.提出快速三维块匹配算法实现运动估计消除相邻体帧之间的时间冗余,利用半体素搜索算法提高块匹配精度.提出帧内体块和帧间体块的量化方法,对量化后的DCT系数采用三维之字形扫描方式组织,应用游程/自适应算术编码系统实现对DCT系数的编码.实验结果表明,对于运动较平缓的序列,该方法的性能优于JPEG2000方法；对于运动剧烈的序列,在高比特率情况下性能不如JPEG2000.该方法的平均峰值信噪比相对于3D-DCT静态体图像压缩方法提高2 dB左右.%A three-dimensional discrete cosine transform (3D-DCT) based volumetric three-dimensional video data compression method was proposed in order to solve the problem of huge volumetric three-dimensional video data. The method combines 3D-DCT and three-dimensional motion estimation. The 3D-DCT was adopted to exploit spacial redundancies in a volumetric frame. A fast three-dimensional cube matching algorithm was proposed in motion estimation in order to reduce temporal redundancies between adjacent volumetric frames. A half voxel search algorithm was employed in order to improve the precision of cube matching. A quantitative method for intra-frame and inter-frame cube was proposed, and the quantified DCT coefficients were organized by a three-dimensional zigzag scan. The 3D-DCT coefficients were coded by a run-length/adaptive arithmetic encoding system. Experimental results showed that the method outperformed JPEG2000 for sequences with slow motion, while the performance of the method was worse than JPEG2000 at high bitrates for sequences with drastic motion. The method gained 2 dB in average peak signal-to-noise ratio compared with the 3D-DCT based static volumetric image compression method
Institute of Scientific and Technical Information of China (English)
Xu Xiaorong; Zhang Jianwu; Huang Aiping; Jiang Bin
2012-01-01
An Adaptive Measurement Scheme (AMS) is investigated with Compressed Sensing (CS)theory in Cognitive Wireless Sensor Network (C-WSN).Local sensing information is collected via energy detection with Analog-to-Information Converter (AIC) at massive cognitive sensors,and sparse representation is considered with the exploration of spatial temporal correlation structure of detected signals.Adaptive measurement matrix is designed in AMS,which is based on maximum energy subset selection.Energy subset is calculated with sparse transformation of sensing information,and maximum energy subset is selected as the row vector of adaptive measurement matrix.In addition,the measurement matrix is constructed by orthogonalization of those selected row vectors,which also satisfies the Restricted Isometry Property (RIP) in CS theory.Orthogonal Matching Pursuit (OMP) reconstruction algorithm is implemented at sink node to recover original information.Simulation results are performed with the comparison of Random Measurement Scheme (RMS).It is revealed that,signal reconstruction effect based on AMS is superior to conventional RMS Gaussian measurement.Moreover,AMS has better detection performance than RMS at lower compression rate region,and it is suitable for large-scale C-WSN wideband spectrum sensing.
Directory of Open Access Journals (Sweden)
Song Zha
2014-04-01
Full Text Available This paper considers the problem of compressed wideband spectrum sensing in wideband cognitive radio when partial occupancy status is known. While performing wideband spectrum sensing, incomplete prior information on the occupancy status may be obtained from coexisting narrowband detectors, collaborative sensing nodes or remote database. In this paper, we present a new optimization model in order to incorporate this prior information and then propose a particular weighting strategy in the reconstruction algorithm based on weighted l1 minimization to solve it. Numerical simulation results demonstrate that the use of partially known occupancy status leads to an improvement in detection performance and the proposed approach exploits such prior information effectively. As incorrect prior information is unavoidable in practical situation, cases in which the prior information is non-ideal are also investigated via simulations
Kim, Kyuseok; Park, Yeonok; Cho, Heemoon; Cho, Hyosung; Je, Uikyu; Park, Chulkyu; Lim, Hyunwoo; Park, Soyoung; Woo, Taeho; Choi, Sungil
2016-10-01
In this work, we investigated a compressed-sensing (CS)-based deblurring scheme incorporated with the total-variation (TV) regularization penalty for image deblurring of high accuracy and adopted it into the image reconstruction in conventional digital breast tomosynthesis (DBT). We implemented the proposed algorithm and performed a systematic simulation to demonstrate its viability for improving the image performance in DBT as well as two-dimensional (2D) mammography. In the simulation, blurred noisy projection images of a 3D numerical breast phantom were generated by convolving their original (or exact) version by a designed 2D Gaussian filter kernel (standard deviation=2 in pixel unit, kernel size=11×11), followed by adding Gaussian noise (mean=0, variance=0.05), and deblurred by using the algorithm before performing the DBT reconstruction procedure. Here the projection images were taken with a half tomographic angle of θ=20° and an angle step of Δθ=2°. We investigated the image performance of the reconstructed DBT images quantitatively in terms of the modulation and the slice-sensitive profile (SSP).
Beane, Andy
2012-01-01
The essential fundamentals of 3D animation for aspiring 3D artists 3D is everywhere--video games, movie and television special effects, mobile devices, etc. Many aspiring artists and animators have grown up with 3D and computers, and naturally gravitate to this field as their area of interest. Bringing a blend of studio and classroom experience to offer you thorough coverage of the 3D animation industry, this must-have book shows you what it takes to create compelling and realistic 3D imagery. Serves as the first step to understanding the language of 3D and computer graphics (CG)Covers 3D anim
Lucas, Laurent; Loscos, Céline
2013-01-01
While 3D vision has existed for many years, the use of 3D cameras and video-based modeling by the film industry has induced an explosion of interest for 3D acquisition technology, 3D content and 3D displays. As such, 3D video has become one of the new technology trends of this century.The chapters in this book cover a large spectrum of areas connected to 3D video, which are presented both theoretically and technologically, while taking into account both physiological and perceptual aspects. Stepping away from traditional 3D vision, the authors, all currently involved in these areas, provide th
Dagiuklas, Tasos
2015-01-01
This book describes recent innovations in 3D media and technologies, with coverage of 3D media capturing, processing, encoding, and adaptation, networking aspects for 3D Media, and quality of user experience (QoE). The contributions are based on the results of the FP7 European Project ROMEO, which focuses on new methods for the compression and delivery of 3D multi-view video and spatial audio, as well as the optimization of networking and compression jointly across the future Internet. The delivery of 3D media to individual users remains a highly challenging problem due to the large amount of data involved, diverse network characteristics and user terminal requirements, as well as the user’s context such as their preferences and location. As the number of visual views increases, current systems will struggle to meet the demanding requirements in terms of delivery of consistent video quality to fixed and mobile users. ROMEO will present hybrid networking solutions that combine the DVB-T2 and DVB-NGH broadcas...
Dagiuklas, Tasos
2014-01-01
This book describes recent innovations in 3D media and technologies, with coverage of 3D media capturing, processing, encoding, and adaptation, networking aspects for 3D Media, and quality of user experience (QoE). The main contributions are based on the results of the FP7 European Projects ROMEO, which focus on new methods for the compression and delivery of 3D multi-view video and spatial audio, as well as the optimization of networking and compression jointly across the Future Internet (www.ict-romeo.eu). The delivery of 3D media to individual users remains a highly challenging problem due to the large amount of data involved, diverse network characteristics and user terminal requirements, as well as the user’s context such as their preferences and location. As the number of visual views increases, current systems will struggle to meet the demanding requirements in terms of delivery of constant video quality to both fixed and mobile users. ROMEO will design and develop hybrid-networking solutions that co...
International Nuclear Information System (INIS)
Novel additive manufacturing processes are increasingly recognized as ideal techniques to produce 3D biodegradable structures with optimal pore size and spatial distribution, providing an adequate mechanical support for tissue regeneration while shaping in-growing tissues. With regard to the mechanical and biological performances of 3D scaffolds, pore size and geometry play a crucial role. In this study, a novel integrated automated system for the production and in vitro culture of 3D constructs, known as BioCell Printing, was used only to manufacture poly(ε-caprolactone) scaffolds for tissue engineering; the influence of pore size and shape on their mechanical and biological performances was investigated. Imposing a single lay-down pattern of 0°/90° and varying the filament distance, it was possible to produce scaffolds with square interconnected pores with channel sizes falling in the range of 245–433 µm, porosity 49–57% and a constant road width. Three different lay-down patterns were also adopted (0°/90°, 0°/60/120° and 0°/45°/90°/135°), thus resulting in scaffolds with quadrangular, triangular and complex internal geometries, respectively. Mechanical compression tests revealed a decrease of scaffold stiffness with the increasing porosity and number of deposition angles (from 0°/90° to 0°/45°/90°/135°). Results from biological analysis, carried out using human mesenchymal stem cells, suggest a strong influence of pore size and geometry on cell viability. On the other hand, after 21 days of in vitro static culture, it was not possible to detect any significant variation in terms of cell morphology promoted by scaffold topology. As a first systematic analysis, the obtained results clearly demonstrate the potential of the BioCell Printing process to produce 3D scaffolds with reproducible well organized architectures and tailored mechanical properties. (paper)
Efficient Sparse Signal Transmission over a Lossy Link Using Compressive Sensing.
Wu, Liantao; Yu, Kai; Cao, Dongyu; Hu, Yuhen; Wang, Zhi
2015-08-13
Reliable data transmission over lossy communication link is expensive due to overheads for error protection. For signals that have inherent sparse structures, compressive sensing (CS) is applied to facilitate efficient sparse signal transmissions over lossy communication links without data compression or error protection. The natural packet loss in the lossy link is modeled as a random sampling process of the transmitted data, and the original signal will be reconstructed from the lossy transmission results using the CS-based reconstruction method at the receiving end. The impacts of packet lengths on transmission efficiency under different channel conditions have been discussed, and interleaving is incorporated to mitigate the impact of burst data loss. Extensive simulations and experiments have been conducted and compared to the traditional automatic repeat request (ARQ) interpolation technique, and very favorable results have been observed in terms of both accuracy of the reconstructed signals and the transmission energy consumption. Furthermore, the packet length effect provides useful insights for using compressed sensing for efficient sparse signal transmission via lossy links.
Efficient Sparse Signal Transmission over a Lossy Link Using Compressive Sensing
Directory of Open Access Journals (Sweden)
Liantao Wu
2015-08-01
Full Text Available Reliable data transmission over lossy communication link is expensive due to overheads for error protection. For signals that have inherent sparse structures, compressive sensing (CS is applied to facilitate efficient sparse signal transmissions over lossy communication links without data compression or error protection. The natural packet loss in the lossy link is modeled as a random sampling process of the transmitted data, and the original signal will be reconstructed from the lossy transmission results using the CS-based reconstruction method at the receiving end. The impacts of packet lengths on transmission efficiency under different channel conditions have been discussed, and interleaving is incorporated to mitigate the impact of burst data loss. Extensive simulations and experiments have been conducted and compared to the traditional automatic repeat request (ARQ interpolation technique, and very favorable results have been observed in terms of both accuracy of the reconstructed signals and the transmission energy consumption. Furthermore, the packet length effect provides useful insights for using compressed sensing for efficient sparse signal transmission via lossy links.
Ouyang, Bing; Hou, Weilin; Gong, Cuiling; Caimi, Frank M.; Dalgleish, Fraser R.; Vuorenkoski, Anni K.; Xiao, Xifeng; Voelz, David G.
2016-02-01
The Compressive Line Sensing (CLS) active imaging system has been demonstrated to be effective in scattering mediums, such as coastal turbid water, fog and mist, through simulations and test tank experiments. The CLS prototype hardware consists of a CW laser, a DMD, a photomultiplier tube, and a data acquisition instrument. CLS employs whiskbroom imaging formation that is compatible with traditional survey platforms. The sensing model adopts the distributed compressive sensing theoretical framework that exploits both intra-signal sparsity and highly correlated nature of adjacent areas in a natural scene. During sensing operation, the laser illuminates the spatial light modulator DMD to generate a series of 1D binary sensing pattern from a codebook to "encode" current target line segment. A single element detector PMT acquires target reflections as encoder output. The target can then be recovered using the encoder output and a predicted on-target codebook that reflects the environmental interference of original codebook entries. In this work, we investigated the effectiveness of the CLS imaging system in a turbulence environment. Turbulence poses challenges in many atmospheric and underwater surveillance applications. A series of experiments were conducted in the Naval Research Lab's optical turbulence test facility with the imaging path subjected to various turbulence intensities. The total-variation minimization sparsifying basis was used in imaging reconstruction. The preliminary experimental results showed that the current imaging system was able to recover target information under various turbulence strengths. The challenges of acquiring data through strong turbulence environment and future enhancements of the system will be discussed.
Directory of Open Access Journals (Sweden)
Shihua Cao
2014-03-01
Full Text Available Anomaly event detection is one of the research hotspots in wireless sensor networks. Aiming at the disadvantages of current detection solutions, a novel anomaly event detection algorithm based on compressed sensing and iteration is proposed. Firstly, a measured value can be sensed in each node, based on the compressed sensing. Then the problem of anomaly event detection is modeled as the minimization problem of weighted l1 norm, and OMP algorithm is adopted for solving the problem iteratively. And then the result of problem solving is judged according to detection functions. Finally, in the light of the judgment results, the weight value is updated for beginning a new round iteration. The loop won't stop until all the anomaly events are detected in wireless sensor networks. Simulation experimental results show the proposed algorithm has a better omission detection rate and false alarm rate in different noisy environments. In addition, the detection quality of this algorithm is higher than those of the traditional ones.
IDMA-Based Compressed Sensing for Ocean Monitoring Information Acquisition with Sensor Networks
Directory of Open Access Journals (Sweden)
Gongliang Liu
2014-01-01
Full Text Available The ocean monitoring sensor network is a typically energy-limited and bandwidth-limited system, and the technical bottleneck of which is the asymmetry between the demand for large-scale and high-resolution information acquisition and the limited network resources. The newly arising compressed sensing theory provides a chance for breaking through the bottleneck. In view of this and considering the potential advantages of the emerging interleave-division multiple access (IDMA technology in underwater channels, this paper proposes an IDMA-based compressed sensing scheme in underwater sensor networks with applications to environmental monitoring information acquisition. Exploiting the sparse property of the monitored objects, only a subset of sensors is required to measure and transmit the measurements to the monitoring center for accurate information reconstruction, reducing the requirements for channel bandwidth and energy consumption significantly. Furthermore, with the aid of the semianalytical technique of IDMA, the optimal sensing probability of each sensor is determined to minimize the reconstruction error of the information map. Simulation results with real oceanic monitoring data validate the efficiency of the proposed scheme.
Efficient adaptation of complex-valued noiselet sensing matrices for compressed single-pixel imaging
Pastuszczak, Anna; Szczygieł, Bartłomiej; Mikołajczyk, Michał; Kotyński, Rafał
2016-07-01
Minimal mutual coherence of discrete noiselets and Haar wavelets makes this pair of bases an essential choice for the measurement and compression matrices in compressed-sensing-based single-pixel detectors. In this paper we propose an efficient way of using complex-valued and non-binary noiselet functions for object sampling in single-pixel cameras with binary spatial light modulators and incoherent illumination. The proposed method allows to determine m complex noiselet coefficients from m+1 binary sampling measurements. Further, we introduce a modification to the complex fast noiselet transform, which enables computationally-efficient real-time generation of the binary noiselet-based patterns using efficient integer calculations on bundled patterns. The proposed method is verified experimentally with a single-pixel camera system using a binary spatial light modulator.
Spencer, Austin P; Spokoyny, Boris; Ray, Supratim; Sarvari, Fahad; Harel, Elad
2016-01-25
Compressive sensing allows signals to be efficiently captured by exploiting their inherent sparsity. Here we implement sparse sampling to capture the electronic structure and ultrafast dynamics of molecular systems using phase-resolved 2D coherent spectroscopy. Until now, 2D spectroscopy has been hampered by its reliance on array detectors that operate in limited spectral regions. Combining spatial encoding of the nonlinear optical response and rapid signal modulation allows retrieval of state-resolved correlation maps in a photosynthetic protein and carbocyanine dye. We report complete Hadamard reconstruction of the signals and compression factors as high as 10, in good agreement with array-detected spectra. Single-point array reconstruction by spatial encoding (SPARSE) Spectroscopy reduces acquisition times by about an order of magnitude, with further speed improvements enabled by fast scanning of a digital micromirror device. We envision unprecedented applications for coherent spectroscopy using frequency combs and super-continua in diverse spectral regions.
Spatio-temporal Compressed Sensing with Coded Apertures and Keyed Exposures
Harmany, Zachary T; Willett, Rebecca M
2011-01-01
Optical systems which measure independent random projections of a scene according to compressed sensing (CS) theory face a myriad of practical challenges related to the size of the physical platform, photon efficiency, the need for high temporal resolution, and fast reconstruction in video settings. This paper describes a coded aperture and keyed exposure approach to compressive measurement in optical systems. The proposed projections satisfy the Restricted Isometry Property for sufficiently sparse scenes, and hence are compatible with theoretical guarantees on the video reconstruction quality. These concepts can be implemented in both space and time via either amplitude modulation or phase shifting, and this paper describes the relative merits of the two approaches in terms of theoretical performance, noise and hardware considerations, and experimental results. Fast numerical algorithms which account for the nonnegativity of the projections and temporal correlations in a video sequence are developed and appl...
Compressed sensing SAR imaging based on sparse representation in fractional Fourier domain
Institute of Scientific and Technical Information of China (English)
BU HongXia; BAI Xia; TAO Ran
2012-01-01
Compressed sensing (CS) is a new technique of utilizing a priori knowledge on sparsity of data in a certain domain for minimizing necessary number of measurements.Based on this idea,this paper proposes a novel synthetic aperture radar (SAR) imaging approach by exploiting sparseness of echo data in the fractional Fourier domain.The effectiveness and robustness of the approach are assessed by some numerical experiments under various noisy conditions and different measurement matrices.Experimental results have shown that,the obtained images by using the CS technique depend on measurement matrix and have higher output signal to noise ratio than traditional pulse compression technique. Finally simulated and real data are also processed and the achieved results show that the proposed approach is capable of reconstructing the image of targets and effectively suppressing noise.
Efficient adaptation of complex-valued noiselet sensing matrices for compressed single-pixel imaging
Pastuszczak, Anna; Mikołajczyk, Michał; Kotyński, Rafał
2016-01-01
Minimal mutual coherence of discrete noiselets and Haar wavelets makes this pair of bases an essential choice for the measurement and compression matrices in compressed-sensing-based single-pixel detectors. In this paper we propose an efficient way of using complex-valued and non-binary noiselet functions for object sampling in single-pixel cameras with binary spatial light modulators and incoherent illumination. The proposed method allows to determine m complex noiselet coefficients from m+1 binary sampling measurements. Further, we introduce a modification to the complex fast noiselet transform, which enables computationally-efficient real-time generation of the binary noiselet-based patterns using efficient integer calculations on bundled patterns. The proposed method is verified experimentally with a single-pixel camera system using a binary spatial light modulator.
Photonic compressive sensing with a micro-ring-resonator-based microwave photonic filter
Chen, Ying; Ding, Yunhong; Zhu, Zhijing; Chi, Hao; Zheng, Shilie; Zhang, Xianmin; Jin, Xiaofeng; Galili, Michael; Yu, Xianbin
2016-08-01
A novel approach to realize photonic compressive sensing (CS) with a multi-tap microwave photonic filter is proposed and demonstrated. The system takes both advantages of CS and photonics to capture wideband sparse signals with sub-Nyquist sampling rate. The low-pass filtering function required in the CS is realized in a photonic way by using a frequency comb and a dispersive element. The frequency comb is realized by shaping an amplified spontaneous emission (ASE) source with an on-chip micro-ring resonator, which is beneficial to the integration of photonic CS. A proof-of-concept experiment for a two-tone signal acquisition with frequencies of 350 MHz and 1.25 GHz is experimentally demonstrated with a compression factor up to 16.
Arias, Fernando X.; Sierra, Heidy; Rajadhyaksha, Milind; Arzuaga, Emmanuel
2016-03-01
Compressive Sensing (CS)-based technologies have shown potential to improve the efficiency of acquisition, manipulation, analysis and storage processes on signals and imagery with slight discernible loss in data performance. The CS framework relies on the reconstruction of signals that are presumed sparse in some domain, from a significantly small data collection of linear projections of the signal of interest. As a result, a solution to the underdetermined linear system resulting from this paradigm makes it possible to estimate the original signal with high accuracy. One common approach to solve the linear system is based on methods that minimize the L1-norm. Several fast algorithms have been developed for this purpose. This paper presents a study on the use of CS in high-resolution reflectance confocal microscopy (RCM) images of the skin. RCM offers a cell resolution level similar to that used in histology to identify cellular patterns for diagnosis of skin diseases. However, imaging of large areas (required for effective clinical evaluation) at such high-resolution can turn image capturing, processing and storage processes into a time consuming procedure, which may pose a limitation for use in clinical settings. We present an analysis on the compression ratio that may allow for a simpler capturing approach while reconstructing the required cellular resolution for clinical use. We provide a comparative study in compressive sensing and estimate its effectiveness in terms of compression ratio vs. image reconstruction accuracy. Preliminary results show that by using as little as 25% of the original number of samples, cellular resolution may be reconstructed with high accuracy.
LP Decoding meets LP Decoding: A Connection between Channel Coding and Compressed Sensing
Dimakis, Alexandros G
2009-01-01
This is a tale of two linear programming decoders, namely channel coding linear programming decoding (CC-LPD) and compressed sensing linear programming decoding (CS-LPD). So far, they have evolved quite independently. The aim of the present paper is to show that there is a tight connection between, on the one hand, CS-LPD based on a zero-one measurement matrix over the reals and, on the other hand, CC-LPD of the binary linear code that is obtained by viewing this measurement matrix as a binary parity-check matrix. This connection allows one to translate performance guarantees from one setup to the other.
Compact all-CMOS spatiotemporal compressive sensing video camera with pixel-wise coded exposure.
Zhang, Jie; Xiong, Tao; Tran, Trac; Chin, Sang; Etienne-Cummings, Ralph
2016-04-18
We present a low power all-CMOS implementation of temporal compressive sensing with pixel-wise coded exposure. This image sensor can increase video pixel resolution and frame rate simultaneously while reducing data readout speed. Compared to previous architectures, this system modulates pixel exposure at the individual photo-diode electronically without external optical components. Thus, the system provides reduction in size and power compare to previous optics based implementations. The prototype image sensor (127 × 90 pixels) can reconstruct 100 fps videos from coded images sampled at 5 fps. With 20× reduction in readout speed, our CMOS image sensor only consumes 14μW to provide 100 fps videos.
Xu, Daguang; Huang, Yong; Kang, Jin U
2014-09-01
In this work, we propose a novel dispersion compensation method that enables real-time compressive sensing (CS) spectral domain optical coherence tomography (SD OCT) image reconstruction. We show that dispersion compensation can be incorporated into CS SD OCT by multiplying the dispersion-correcting terms by the undersampled spectral data before CS reconstruction. High-quality SD OCT imaging with dispersion compensation was demonstrated at a speed in excess of 70 frames per s using 40% of the spectral measurements required by the well-known Shannon/Nyquist theory. The data processing and image display were performed on a conventional workstation having three graphics processing units.
Institute of Scientific and Technical Information of China (English)
Zhao Ruizhen; Ren Xiaoxin; Han Xuelian; Hu Shaohai
2012-01-01
Sparsity Adaptive Matching Pursuit (SAMP) algorithm is a widely used reconstruction algorithm for compressive sensing in the case that the sparsity is unknown.In order to match the sparsity more accurately,we presented an improved SAMP algorithm based on Regularized Backtracking (SAMP-RB).By adapting a regularized backtracking step to SAMP algorithm in each iteration stage,the proposed algorithm can flexibly remove the inappropriate atoms.The experimental results show that SAMP-RB reconstruction algorithm greatly improves SAMP algorithm both in reconstruction quality and computational time.It has better reconstruction efficiency than most of the available matching pursuit algorithms.
Directory of Open Access Journals (Sweden)
Ling Yongfa
2016-01-01
Full Text Available The paper proposes a mobile control sink node data collection method in the wireless sensor network based on compressive sensing. This method, with regular track, selects the optimal data collection points in the monitoring area via the disc method, calcu-lates the shortest path by using the quantum genetic algorithm, and hence determines the data collection route. Simulation results show that this method has higher network throughput and better energy efficiency, capable of collecting a huge amount of data with balanced energy consumption in the network.