Low-Complexity Bayesian Estimation of Cluster-Sparse Channels

KAUST Repository

Ballal, Tarig

2015-09-18

This paper addresses the problem of channel impulse response estimation for cluster-sparse channels under the Bayesian estimation framework. We develop a novel low-complexity minimum mean squared error (MMSE) estimator by exploiting the sparsity of the received signal profile and the structure of the measurement matrix. It is shown that due to the banded Toeplitz/circulant structure of the measurement matrix, a channel impulse response, such as underwater acoustic channel impulse responses, can be partitioned into a number of orthogonal or approximately orthogonal clusters. The orthogonal clusters, the sparsity of the channel impulse response and the structure of the measurement matrix, all combined, result in a computationally superior realization of the MMSE channel estimator. The MMSE estimator calculations boil down to simpler in-cluster calculations that can be reused in different clusters. The reduction in computational complexity allows for a more accurate implementation of the MMSE estimator. The proposed approach is tested using synthetic Gaussian channels, as well as simulated underwater acoustic channels. Symbol-error-rate performance and computation time confirm the superiority of the proposed method compared to selected benchmark methods in systems with preamble-based training signals transmitted over clustersparse channels.

Low-Complexity Bayesian Estimation of Cluster-Sparse Channels

KAUST Repository

Ballal, Tarig; Al-Naffouri, Tareq Y.; Ahmed, Syed

2015-01-01

This paper addresses the problem of channel impulse response estimation for cluster-sparse channels under the Bayesian estimation framework. We develop a novel low-complexity minimum mean squared error (MMSE) estimator by exploiting the sparsity of the received signal profile and the structure of the measurement matrix. It is shown that due to the banded Toeplitz/circulant structure of the measurement matrix, a channel impulse response, such as underwater acoustic channel impulse responses, can be partitioned into a number of orthogonal or approximately orthogonal clusters. The orthogonal clusters, the sparsity of the channel impulse response and the structure of the measurement matrix, all combined, result in a computationally superior realization of the MMSE channel estimator. The MMSE estimator calculations boil down to simpler in-cluster calculations that can be reused in different clusters. The reduction in computational complexity allows for a more accurate implementation of the MMSE estimator. The proposed approach is tested using synthetic Gaussian channels, as well as simulated underwater acoustic channels. Symbol-error-rate performance and computation time confirm the superiority of the proposed method compared to selected benchmark methods in systems with preamble-based training signals transmitted over clustersparse channels.

Sparse Channel Estimation Including the Impact of the Transceiver Filters with Application to OFDM

DEFF Research Database (Denmark)

Barbu, Oana-Elena; Pedersen, Niels Lovmand; Manchón, Carles Navarro

2014-01-01

Traditionally, the dictionary matrices used in sparse wireless channel estimation have been based on the discrete Fourier transform, following the assumption that the channel frequency response (CFR) can be approximated as a linear combination of a small number of multipath components, each one......) and receive (demodulation) filters. Hence, the assumption of the CFR being sparse in the canonical Fourier dictionary may no longer hold. In this work, we derive a signal model and subsequently a novel dictionary matrix for sparse estimation that account for the impact of transceiver filters. Numerical...... results obtained in an OFDM transmission scenario demonstrate the superior accuracy of a sparse estimator that uses our proposed dictionary rather than the classical Fourier dictionary, and its robustness against a mismatch in the assumed transmit filter characteristics....

Compressive Sensing Based Bayesian Sparse Channel Estimation for OFDM Communication Systems: High Performance and Low Complexity

Science.gov (United States)

Xu, Li; Shan, Lin; Adachi, Fumiyuki

2014-01-01

In orthogonal frequency division modulation (OFDM) communication systems, channel state information (CSI) is required at receiver due to the fact that frequency-selective fading channel leads to disgusting intersymbol interference (ISI) over data transmission. Broadband channel model is often described by very few dominant channel taps and they can be probed by compressive sensing based sparse channel estimation (SCE) methods, for example, orthogonal matching pursuit algorithm, which can take the advantage of sparse structure effectively in the channel as for prior information. However, these developed methods are vulnerable to both noise interference and column coherence of training signal matrix. In other words, the primary objective of these conventional methods is to catch the dominant channel taps without a report of posterior channel uncertainty. To improve the estimation performance, we proposed a compressive sensing based Bayesian sparse channel estimation (BSCE) method which cannot only exploit the channel sparsity but also mitigate the unexpected channel uncertainty without scarifying any computational complexity. The proposed method can reveal potential ambiguity among multiple channel estimators that are ambiguous due to observation noise or correlation interference among columns in the training matrix. Computer simulations show that proposed method can improve the estimation performance when comparing with conventional SCE methods. PMID:24983012

A Sparse Bayesian Imaging Technique for Efficient Recovery of Reservoir Channels With Time-Lapse Seismic Measurements

KAUST Repository

Sana, Furrukh

2016-06-01

Subsurface reservoir flow channels are characterized by high-permeability values and serve as preferred pathways for fluid propagation. Accurate estimation of their geophysical structures is thus of great importance for the oil industry. The ensemble Kalman filter (EnKF) is a widely used statistical technique for estimating subsurface reservoir model parameters. However, accurate reconstruction of the subsurface geological features with the EnKF is challenging because of the limited measurements available from the wells and the smoothing effects imposed by the \\\\ell _{2} -norm nature of its update step. A new EnKF scheme based on sparse domain representation was introduced by Sana et al. (2015) to incorporate useful prior structural information in the estimation process for efficient recovery of subsurface channels. In this paper, we extend this work in two ways: 1) investigate the effects of incorporating time-lapse seismic data on the channel reconstruction; and 2) explore a Bayesian sparse reconstruction algorithm with the potential ability to reduce the computational requirements. Numerical results suggest that the performance of the new sparse Bayesian based EnKF scheme is enhanced with the availability of seismic measurements, leading to further improvement in the recovery of flow channels structures. The sparse Bayesian approach further provides a computationally efficient framework for enforcing a sparse solution, especially with the possibility of using high sparsity rates through the inclusion of seismic data.

A Sparse Bayesian Imaging Technique for Efficient Recovery of Reservoir Channels With Time-Lapse Seismic Measurements

KAUST Repository

Sana, Furrukh; Ravanelli, Fabio; Al-Naffouri, Tareq Y.; Hoteit, Ibrahim

2016-01-01

Subsurface reservoir flow channels are characterized by high-permeability values and serve as preferred pathways for fluid propagation. Accurate estimation of their geophysical structures is thus of great importance for the oil industry. The ensemble Kalman filter (EnKF) is a widely used statistical technique for estimating subsurface reservoir model parameters. However, accurate reconstruction of the subsurface geological features with the EnKF is challenging because of the limited measurements available from the wells and the smoothing effects imposed by the \\ell _{2} -norm nature of its update step. A new EnKF scheme based on sparse domain representation was introduced by Sana et al. (2015) to incorporate useful prior structural information in the estimation process for efficient recovery of subsurface channels. In this paper, we extend this work in two ways: 1) investigate the effects of incorporating time-lapse seismic data on the channel reconstruction; and 2) explore a Bayesian sparse reconstruction algorithm with the potential ability to reduce the computational requirements. Numerical results suggest that the performance of the new sparse Bayesian based EnKF scheme is enhanced with the availability of seismic measurements, leading to further improvement in the recovery of flow channels structures. The sparse Bayesian approach further provides a computationally efficient framework for enforcing a sparse solution, especially with the possibility of using high sparsity rates through the inclusion of seismic data.

Vector sparse representation of color image using quaternion matrix analysis.

Science.gov (United States)

Xu, Yi; Yu, Licheng; Xu, Hongteng; Zhang, Hao; Nguyen, Truong

2015-04-01

Traditional sparse image models treat color image pixel as a scalar, which represents color channels separately or concatenate color channels as a monochrome image. In this paper, we propose a vector sparse representation model for color images using quaternion matrix analysis. As a new tool for color image representation, its potential applications in several image-processing tasks are presented, including color image reconstruction, denoising, inpainting, and super-resolution. The proposed model represents the color image as a quaternion matrix, where a quaternion-based dictionary learning algorithm is presented using the K-quaternion singular value decomposition (QSVD) (generalized K-means clustering for QSVD) method. It conducts the sparse basis selection in quaternion space, which uniformly transforms the channel images to an orthogonal color space. In this new color space, it is significant that the inherent color structures can be completely preserved during vector reconstruction. Moreover, the proposed sparse model is more efficient comparing with the current sparse models for image restoration tasks due to lower redundancy between the atoms of different color channels. The experimental results demonstrate that the proposed sparse image model avoids the hue bias issue successfully and shows its potential as a general and powerful tool in color image analysis and processing domain.

Iterative Sparse Channel Estimation and Decoding for Underwater MIMO-OFDM

Directory of Open Access Journals (Sweden)

Berger ChristianR

2010-01-01

Full Text Available We propose a block-by-block iterative receiver for underwater MIMO-OFDM that couples channel estimation with multiple-input multiple-output (MIMO detection and low-density parity-check (LDPC channel decoding. In particular, the channel estimator is based on a compressive sensing technique to exploit the channel sparsity, the MIMO detector consists of a hybrid use of successive interference cancellation and soft minimum mean-square error (MMSE equalization, and channel coding uses nonbinary LDPC codes. Various feedback strategies from the channel decoder to the channel estimator are studied, including full feedback of hard or soft symbol decisions, as well as their threshold-controlled versions. We study the receiver performance using numerical simulation and experimental data collected from the RACE08 and SPACE08 experiments. We find that iterative receiver processing including sparse channel estimation leads to impressive performance gains. These gains are more pronounced when the number of available pilots to estimate the channel is decreased, for example, when a fixed number of pilots is split between an increasing number of parallel data streams in MIMO transmission. For the various feedback strategies for iterative channel estimation, we observe that soft decision feedback slightly outperforms hard decision feedback.

Bandwidth efficient channel estimation method for airborne hyperspectral data transmission in sparse doubly selective communication channels

Science.gov (United States)

Vahidi, Vahid; Saberinia, Ebrahim; Regentova, Emma E.

2017-10-01

A channel estimation (CE) method based on compressed sensing (CS) is proposed to estimate the sparse and doubly selective (DS) channel for hyperspectral image transmission from unmanned aircraft vehicles to ground stations. The proposed method contains three steps: (1) the priori estimate of the channel by orthogonal matching pursuit (OMP), (2) calculation of the linear minimum mean square error (LMMSE) estimate of the received pilots given the estimated channel, and (3) estimate of the complex amplitudes and Doppler shifts of the channel using the enhanced received pilot data applying a second round of a CS algorithm. The proposed method is named DS-LMMSE-OMP, and its performance is evaluated by simulating transmission of AVIRIS hyperspectral data via the communication channel and assessing their fidelity for the automated analysis after demodulation. The performance of the DS-LMMSE-OMP approach is compared with that of two other state-of-the-art CE methods. The simulation results exhibit up to 8-dB figure of merit in the bit error rate and 50% improvement in the hyperspectral image classification accuracy.

Efficient image enhancement using sparse source separation in the Retinex theory

Science.gov (United States)

Yoon, Jongsu; Choi, Jangwon; Choe, Yoonsik

2017-11-01

Color constancy is the feature of the human vision system (HVS) that ensures the relative constancy of the perceived color of objects under varying illumination conditions. The Retinex theory of machine vision systems is based on the HVS. Among Retinex algorithms, the physics-based algorithms are efficient; however, they generally do not satisfy the local characteristics of the original Retinex theory because they eliminate global illumination from their optimization. We apply the sparse source separation technique to the Retinex theory to present a physics-based algorithm that satisfies the locality characteristic of the original Retinex theory. Previous Retinex algorithms have limited use in image enhancement because the total variation Retinex results in an overly enhanced image and the sparse source separation Retinex cannot completely restore the original image. In contrast, our proposed method preserves the image edge and can very nearly replicate the original image without any special operation.

Separation of Particles in Channels Rotary Engine

Directory of Open Access Journals (Sweden)

Zyatikov Pavel

2015-01-01

Full Text Available The article considers the separation of particles in channels with different relative length. It is shown that the intensity of turbulence at the inlet section of the channel varies considerably in its length. The dependence of the turbulence damping along the channel expressing by fraction of the distance is shown. The ratio of the particle separation efficiency out the gas flow in the rotor channel is defined. The values of particle separation efficiency in the channel for the angle α=π/4 in turbulent aerosol flow is shows, including without mixing the particles.

Massive-MIMO Sparse Uplink Channel Estimation Using Implicit Training and Compressed Sensing

Directory of Open Access Journals (Sweden)

Babar Mansoor

2017-01-01

Full Text Available Massive multiple-input multiple-output (massive-MIMO is foreseen as a potential technology for future 5G cellular communication networks due to its substantial benefits in terms of increased spectral and energy efficiency. These advantages of massive-MIMO are a consequence of equipping the base station (BS with quite a large number of antenna elements, thus resulting in an aggressive spatial multiplexing. In order to effectively reap the benefits of massive-MIMO, an adequate estimate of the channel impulse response (CIR between each transmit–receive link is of utmost importance. It has been established in the literature that certain specific multipath propagation environments lead to a sparse structured CIR in spatial and/or delay domains. In this paper, implicit training and compressed sensing based CIR estimation techniques are proposed for the case of massive-MIMO sparse uplink channels. In the proposed superimposed training (SiT based techniques, a periodic and low power training sequence is superimposed (arithmetically added over the information sequence, thus avoiding any dedicated time/frequency slots for the training sequence. For the estimation of such massive-MIMO sparse uplink channels, two greedy pursuits based compressed sensing approaches are proposed, viz: SiT based stage-wise orthogonal matching pursuit (SiT-StOMP and gradient pursuit (SiT-GP. In order to demonstrate the validity of proposed techniques, a performance comparison in terms of normalized mean square error (NCMSE and bit error rate (BER is performed with a notable SiT based least squares (SiT-LS channel estimation technique. The effect of channels’ sparsity, training-to-information power ratio (TIR and signal-to-noise ratio (SNR on BER and NCMSE performance of proposed schemes is thoroughly studied. For a simulation scenario of: 4 × 64 massive-MIMO with a channel sparsity level of 80 % and signal-to-noise ratio (SNR of 10 dB , a performance gain of 18 dB and 13 d

Simultaneous Channel and Feature Selection of Fused EEG Features Based on Sparse Group Lasso

Directory of Open Access Journals (Sweden)

Jin-Jia Wang

2015-01-01

Full Text Available Feature extraction and classification of EEG signals are core parts of brain computer interfaces (BCIs. Due to the high dimension of the EEG feature vector, an effective feature selection algorithm has become an integral part of research studies. In this paper, we present a new method based on a wrapped Sparse Group Lasso for channel and feature selection of fused EEG signals. The high-dimensional fused features are firstly obtained, which include the power spectrum, time-domain statistics, AR model, and the wavelet coefficient features extracted from the preprocessed EEG signals. The wrapped channel and feature selection method is then applied, which uses the logistical regression model with Sparse Group Lasso penalized function. The model is fitted on the training data, and parameter estimation is obtained by modified blockwise coordinate descent and coordinate gradient descent method. The best parameters and feature subset are selected by using a 10-fold cross-validation. Finally, the test data is classified using the trained model. Compared with existing channel and feature selection methods, results show that the proposed method is more suitable, more stable, and faster for high-dimensional feature fusion. It can simultaneously achieve channel and feature selection with a lower error rate. The test accuracy on the data used from international BCI Competition IV reached 84.72%.

Hydrodynamic blood plasma separation in microfluidic channels

DEFF Research Database (Denmark)

Jouvet, Lionel

2010-01-01

The separation of red blood cells from plasma flowing in microchannels is possible by biophysical effects such as the Zweifach–Fung bifurcation law. In the present study, daughter channels are placed alongside a main channel such that cells and plasma are collected separately. The device is aimed...

iSAP: Interactive Sparse Astronomical Data Analysis Packages

Science.gov (United States)

Fourt, O.; Starck, J.-L.; Sureau, F.; Bobin, J.; Moudden, Y.; Abrial, P.; Schmitt, J.

2013-03-01

iSAP consists of three programs, written in IDL, which together are useful for spherical data analysis. MR/S (MultiResolution on the Sphere) contains routines for wavelet, ridgelet and curvelet transform on the sphere, and applications such denoising on the sphere using wavelets and/or curvelets, Gaussianity tests and Independent Component Analysis on the Sphere. MR/S has been designed for the PLANCK project, but can be used for many other applications. SparsePol (Polarized Spherical Wavelets and Curvelets) has routines for polarized wavelet, polarized ridgelet and polarized curvelet transform on the sphere, and applications such denoising on the sphere using wavelets and/or curvelets, Gaussianity tests and blind source separation on the Sphere. SparsePol has been designed for the PLANCK project. MS-VSTS (Multi-Scale Variance Stabilizing Transform on the Sphere), designed initially for the FERMI project, is useful for spherical mono-channel and multi-channel data analysis when the data are contaminated by a Poisson noise. It contains routines for wavelet/curvelet denoising, wavelet deconvolution, multichannel wavelet denoising and deconvolution.

Interferometric interpolation of sparse marine data

KAUST Repository

Hanafy, Sherif M.

2013-10-11

We present the theory and numerical results for interferometrically interpolating 2D and 3D marine surface seismic profiles data. For the interpolation of seismic data we use the combination of a recorded Green\\'s function and a model-based Green\\'s function for a water-layer model. Synthetic (2D and 3D) and field (2D) results show that the seismic data with sparse receiver intervals can be accurately interpolated to smaller intervals using multiples in the data. An up- and downgoing separation of both recorded and model-based Green\\'s functions can help in minimizing artefacts in a virtual shot gather. If the up- and downgoing separation is not possible, noticeable artefacts will be generated in the virtual shot gather. As a partial remedy we iteratively use a non-stationary 1D multi-channel matching filter with the interpolated data. Results suggest that a sparse marine seismic survey can yield more information about reflectors if traces are interpolated by interferometry. Comparing our results to those of f-k interpolation shows that the synthetic example gives comparable results while the field example shows better interpolation quality for the interferometric method. © 2013 European Association of Geoscientists & Engineers.

Joint Single-Channel Speech Separation and Speaker Identification

DEFF Research Database (Denmark)

Mowlaee, Pejman; Saeidi, Rahim; Tan, Zheng-Hua

2010-01-01

In this paper, we propose a closed loop system to improve the performance of single-channel speech separation in a speaker independent scenario. The system is composed of two interconnected blocks: a separation block and a speaker identiſcation block. The improvement is accomplished by incorporat......In this paper, we propose a closed loop system to improve the performance of single-channel speech separation in a speaker independent scenario. The system is composed of two interconnected blocks: a separation block and a speaker identiſcation block. The improvement is accomplished...... enhances the quality of the separated output signals. To assess the improvements, the results are reported in terms of PESQ for both target and masked signals....

Single-channel source separation using non-negative matrix factorization

DEFF Research Database (Denmark)

Schmidt, Mikkel Nørgaard

-determined and its solution relies on making appropriate assumptions concerning the sources. This dissertation is concerned with model-based probabilistic single-channel source separation based on non-negative matrix factorization, and consists of two parts: i) three introductory chapters and ii) five published...... papers. The first part introduces the single-channel source separation problem as well as non-negative matrix factorization and provides a comprehensive review of existing approaches, applications, and practical algorithms. This serves to provide context for the second part, the published papers......, in which a number of methods for single-channel source separation based on non-negative matrix factorization are presented. In the papers, the methods are applied to separating audio signals such as speech and musical instruments and separating different types of tissue in chemical shift imaging....

Conditions for uniqueness of product representations for separable quantum channels and separable quantum states

International Nuclear Information System (INIS)

Cohen, Scott M.

2014-01-01

We give a sufficient condition that an operator sum representation of a separable quantum channel in terms of product operators is the unique product representation for that channel, and then provide examples of such channels for any number of parties. This result has implications for efforts to determine whether or not a given separable channel can be exactly implemented by local operations and classical communication. By the Choi-Jamiolkowski isomorphism, it also translates to a condition for the uniqueness of product state ensembles representing a given quantum state. These ideas follow from considerations concerning whether or not a subspace spanned by a given set of product operators contains at least one additional product operator

Emitter signal separation method based on multi-level digital channelization

Science.gov (United States)

Han, Xun; Ping, Yifan; Wang, Sujun; Feng, Ying; Kuang, Yin; Yang, Xinquan

2018-02-01

To solve the problem of emitter separation under complex electromagnetic environment, a signal separation method based on multi-level digital channelization is proposed in this paper. A two-level structure which can divide signal into different channel is designed first, after that, the peaks of different channels are tracked using the track filter and the coincident signals in time domain are separated in time-frequency domain. Finally, the time domain waveforms of different signals are acquired by reverse transformation. The validness of the proposed method is proved by experiment.

Trajectory separation of channeled ions in crystalline materials

International Nuclear Information System (INIS)

Temkin, Misha; Chakarov, Ivan; Webb, Roger

2000-01-01

Spatial distributions of ions implanted into crystals can be of a very complex shape with 'lobes' due to ions penetrating through open channels in several directions. This paper suggests an analytical model which represents such a distribution as a linear combination of 'random' distribution and one or more 'channeled' distributions. This study is focused on the algorithm of the separation of ion trajectories into several distributions. The first distribution includes those ions which have undergone predominantly random collisions. The other distributions include those ions which have undergone mainly 'weak' collisions and traveled mostly along the main channeling directions. Our binary collision approximation (BCA) simulator is used for generating and analyzing ion trajectories. The spatial moments can be extracted from each separated distribution. It is shown that 2D analytical distributions obtained as a linear combination of distributions derived from these moments and aligned along corresponding channeling direction are in a very good agreement with direct BCA calculations

A novel integrated circuit for semiconductor radiation detectors with sparse readout

International Nuclear Information System (INIS)

Zhang Yacong; Chen Zhognjian; Lu Wengao; Zhao Baoying; Ji Lijiu

2008-01-01

A novel fully integrated CMOS readout circuit for semiconductor radiation detector with sparse readout is presented. The new sparse scheme is: when one channel is being read out, the trigger signal from other channels is delayed and then processed. Therefore, the dead time is reduced and so is the error rate. Besides sparse readout, sequential readout is also allowed, which means the analog voltages and addresses of all the channels are read out sequentially once there is a channel triggered. The circuit comprises Charge Sensitive Amplifier (CSA), pulse shaper, peak detect and hold circuit, and digital logic. A test chip of four channels designed in a 0.5 μ DPTM CMOS technology has been taped out. The results of post simulation indicate that the gain is 79.3 mV/fC with a linearity of 99.92%. The power dissipation is 4 mW per channel. Theory analysis and calculation shows that the error probability is approximately 2.5%, which means a reduction of about 37% is obtained compared with the traditional scanning scheme, assuming a 16-channel system with a particle rate of 100 k/s per channel. (authors)

A Subjective Evaluation of the Minimum Audible Channel Separation in Binaural Reproduction Systems Through Loudspeakers

DEFF Research Database (Denmark)

Lacouture Parodi, Yesenia; Rubak, Per

2010-01-01

To evaluate the performance of crosstalk cancellation systems the channel separation is usually used as parameter.  However, no systematic evaluation of the minimum audible channel separation has been found in the literature known by the authors.  This paper describes a set of subjective experime......To evaluate the performance of crosstalk cancellation systems the channel separation is usually used as parameter.  However, no systematic evaluation of the minimum audible channel separation has been found in the literature known by the authors.  This paper describes a set of subjective...... simulated.  Results indicate that  in order to avoid lateralization the  channel separation should be below -15dB for most of the stimuli and around -20dB for broad-band noise....

Sinusoidal masks for single channel speech separation

DEFF Research Database (Denmark)

Mowlaee, Pejman; Christensen, Mads Græsbøll; Jensen, Søren Holdt

2010-01-01

In this paper we present a new approach for binary and soft masks used in single-channel speech separation. We present a novel approach called the sinusoidal mask (binary mask and Wiener filter) in a sinusoidal space. Theoretical analysis is presented for the proposed method, and we show...... that the proposed method is able to minimize the target speech distortion while suppressing the crosstalk to a predetermined threshold. It is observed that compared to the STFTbased masks, the proposed sinusoidal masks improve the separation performance in terms of objective measures (SSNR and PESQ) and are mostly...

Single channel blind source separation based on ICA feature extraction

Institute of Scientific and Technical Information of China (English)

无

2007-01-01

A new technique is proposed to solve the blind source separation (BSS) given only a single channel observation. The basis functions and the density of the coefficients of source signals learned by ICA are used as the prior knowledge. Based on the learned prior information the learning rules of single channel BSS are presented by maximizing the joint log likelihood of the mixed sources to obtain source signals from single observation,in which the posterior density of the given measurements is maximized. The experimental results exhibit a successful separation performance for mixtures of speech and music signals.

When sparse coding meets ranking: a joint framework for learning sparse codes and ranking scores

KAUST Repository

Wang, Jim Jing-Yan

2017-06-28

Sparse coding, which represents a data point as a sparse reconstruction code with regard to a dictionary, has been a popular data representation method. Meanwhile, in database retrieval problems, learning the ranking scores from data points plays an important role. Up to now, these two problems have always been considered separately, assuming that data coding and ranking are two independent and irrelevant problems. However, is there any internal relationship between sparse coding and ranking score learning? If yes, how to explore and make use of this internal relationship? In this paper, we try to answer these questions by developing the first joint sparse coding and ranking score learning algorithm. To explore the local distribution in the sparse code space, and also to bridge coding and ranking problems, we assume that in the neighborhood of each data point, the ranking scores can be approximated from the corresponding sparse codes by a local linear function. By considering the local approximation error of ranking scores, the reconstruction error and sparsity of sparse coding, and the query information provided by the user, we construct a unified objective function for learning of sparse codes, the dictionary and ranking scores. We further develop an iterative algorithm to solve this optimization problem.

Encoding of rat working memory by power of multi-channel local field potentials via sparse non-negative matrix factorization

Institute of Scientific and Technical Information of China (English)

Xu Liu; Tiao-Tiao Liu; Wen-Wen Bai; Hu Yi; Shuang-Yan Li; Xin Tian

2013-01-01

Working memory plays an important role in human cognition.This study investigated how working memory was encoded by the power of multi-channel local field potentials (LFPs) based on sparse nonnegative matrix factorization (SNMF).SNMF was used to extract features from LFPs recorded from the prefrontal cortex of four Sprague-Dawley rats during a memory task in a Y maze,with 10 trials for each rat.Then the power-increased LFP components were selected as working memory-related features and the other components were removed.After that,the inverse operation of SNMF was used to study the encoding of working memory in the timefrequency domain.We demonstrated that theta and gamma power increased significantly during the working memory task.The results suggested that postsynaptic activity was simulated well by the sparse activity model.The theta and gamma bands were meaningful for encoding working memory.

Output channel design for collecting closely-spaced particle streams from spiral inertial separation devices

Directory of Open Access Journals (Sweden)

Caffiyar Mohamed Yousuff

2017-08-01

Full Text Available Recent advances in inertial microfluidics designs have enabled high throughput, label-free separation of cells for a variety of bioanalytical applications. Various device configurations have been proposed for binary separation with a focus on enhancing the separation distance between particle streams to improve the efficiency of separate particle collection. These configurations have not demonstrated scaling beyond 3 particle streams either because the channel width is a constraint at the collection outlets or particle streams would be too closely spaced to be collected separately. We propose a method to design collection outlets for inertial focusing and separation devices which can collect closely-spaced particle streams and easily scale to an arbitrary number of collection channels without constraining the outlet channel width, which is the usual cause of clogging or cell damage. According to our approach, collection outlets are a series of side-branching channels perpendicular to the main channel of egress. The width and length of the outlets can be chosen subject to constraints from the position of the particle streams and fluidic resistance ratio computed from fluid dynamics simulations. We show the efficacy of this approach by demonstrating a successful collection of upto 3 particle streams of 7μm, 10μm and 15μm fluorescent beads which have been focused and separated by a spiral inertial device with a separation distance of only 10μm -15μm. With a throughput of 1.8mL/min, we achieved collection efficiency exceeding 90% for each particle at the respective collection outlet. The flexibility to use wide collection channels also enabled us to fabricate the microfluidic device with an epoxy mold that was created using xurography, a low cost, and imprecise fabrication technique.

Sequencing of real-world samples using a microfabricated hybrid device having unconstrained straight separation channels.

Science.gov (United States)

Liu, Shaorong; Elkin, Christopher; Kapur, Hitesh

2003-11-01

We describe a microfabricated hybrid device that consists of a microfabricated chip containing multiple twin-T injectors attached to an array of capillaries that serve as the separation channels. A new fabrication process was employed to create two differently sized round channels in a chip. Twin-T injectors were formed by the smaller round channels that match the bore of the separation capillaries and separation capillaries were incorporated to the injectors through the larger round channels that match the outer diameter of the capillaries. This allows for a minimum dead volume and provides a robust chip/capillary interface. This hybrid design takes full advantage, such as sample stacking and purification and uniform signal intensity profile, of the unique chip injection scheme for DNA sequencing while employing long straight capillaries for the separations. In essence, the separation channel length is optimized for both speed and resolution since it is unconstrained by chip size. To demonstrate the reliability and practicality of this hybrid device, we sequenced over 1000 real-world samples from Human Chromosome 5 and Ciona intestinalis, prepared at Joint Genome Institute. We achieved average Phred20 read of 675 bases in about 70 min with a success rate of 91%. For the similar type of samples on MegaBACE 1000, the average Phred20 read is about 550-600 bases in 120 min separation time with a success rate of about 80-90%.

Effect of Non Submerged Vanes on Separation Zone at Strongly-curved Channel Bends, a Laboratory Scale Study

Directory of Open Access Journals (Sweden)

Ali Akbar Akhtari

2010-03-01

Full Text Available Bends along open channels always pose difficulties for water transfer systems. One undesirable effect of bends in such channels, i.e. separation of water from inner banks, was studied. For the purposes of this study, the literature on the subject was first reviewed, and a strongly-curved open channel was designed and constructed on the laboratory scale. Several tests were performed to evaluate the accuracy of the lab model, data homogeneity, and systematic errors. The model was then calibrated and the influence of curvature on flow pattern past the curve was investigated. Also, for the first time, the influence of separation walls on flow pattern was investigated. Experimental results on three strongly-curved open channels with a curvature radius to channel width ratio of 1.5 and curvature angles of 30°, 60°, and 90° showed that, in all the cases studied, the effect of flow separation could be observed immediately after the curve. In addition, the greatest effect of flow separation was seen at a distance equal to channel width from the bend end. In the presence of middle walls and flow separation, the effect of water separation reduced at the bend, especially for a curvature of 90°.

Subjective and Objective Quality Assessment of Single-Channel Speech Separation Algorithms

DEFF Research Database (Denmark)

Mowlaee, Pejman; Saeidi, Rahim; Christensen, Mads Græsbøll

2012-01-01

Previous studies on performance evaluation of single-channel speech separation (SCSS) algorithms mostly focused on automatic speech recognition (ASR) accuracy as their performance measure. Assessing the separated signals by different metrics other than this has the benefit that the results...... are expected to carry on to other applications beyond ASR. In this paper, in addition to conventional speech quality metrics (PESQ and SNRloss), we also evaluate the separation systems output using different source separation metrics: blind source separation evaluation (BSS EVAL) and perceptual evaluation...... that PESQ and PEASS quality metrics predict well the subjective quality of separated signals obtained by the separation systems. From the results it is observed that the short-time objective intelligibility (STOI) measure predict the speech intelligibility results....

A Mathematical Model of Membrane Gas Separation with Energy Transfer by Molecules of Gas Flowing in a Channel to Molecules Penetrating this Channel from the Adjacent Channel

Directory of Open Access Journals (Sweden)

Szwast Maciej

2015-06-01

Full Text Available The paper presents the mathematical modelling of selected isothermal separation processes of gaseous mixtures, taking place in plants using membranes, in particular nonporous polymer membranes. The modelling concerns membrane modules consisting of two channels - the feeding and the permeate channels. Different shapes of the channels cross-section were taken into account. Consideration was given to co-current and counter-current flows, for feeding and permeate streams, respectively, flowing together with the inert gas receiving permeate. In the proposed mathematical model it was considered that pressure of gas changes along the length of flow channels was the result of both - the drop of pressure connected with flow resistance, and energy transfer by molecules of gas flowing in a given channel to molecules which penetrate this channel from the adjacent channel. The literature on membrane technology takes into account only the drop of pressure connected with flow resistance. Consideration given to energy transfer by molecules of gas flowing in a given channel to molecules which penetrate this channel from the adjacent channel constitute the essential novelty in the current study. The paper also presents results of calculations obtained by means of a computer program which used equations of the derived model. Physicochemical data concerning separation of the CO2/CH4 mixture with He as the sweep gas and data concerning properties of the membrane made of PDMS were assumed for calculations.

New Results on Single-Channel Speech Separation Using Sinusoidal Modeling

DEFF Research Database (Denmark)

Mowlaee, Pejman; Christensen, Mads Græsbøll; Jensen, Søren Holdt

2011-01-01

We present new results on single-channel speech separation and suggest a new separation approach to improve the speech quality of separated signals from an observed mix- ture. The key idea is to derive a mixture estimator based on sinusoidal parameters. The proposed estimator is aimed at finding...... mixture estimator used in binary masks and the Wiener filtering approach, it is observed that the proposed method achieves an acceptable perceptual speech quality with less cross- talk at different signal-to-signal ratios. Moreover, the method is independent of pitch estimates and reduces the computational...... complexity of the separation by replacing the short-time Fourier transform (STFT) feature vectors of high dimensionality with sinusoidal feature vectors. We report separation results for the proposed method and compare them with respect to other benchmark methods. The improvements made by applying...

Separation of ions in nanofluidic channels with combined pressure-driven and electro-osmotic flow.

Science.gov (United States)

Gillespie, Dirk; Pennathur, Sumita

2013-03-05

Separation of ionic species with the same electrophoretic mobility but different valence in electrolyte systems can occur within nanometer-scale channels with finite electrical double layers (EDLs). This is because EDL thicknesses are a significant fraction of slit height in such channels and can create transverse analyte concentration profiles that allow for unique separation modalities when combined with axial fluid flow. Previous work has shown such separation to occur using either pressure-driven flow or electro-osmotic flow separately. Here, we develop a Poisson-Boltzmann model to compare the separation of such ions using the combination of both pressure-driven and electro-osmotic flow. Applying a pressure gradient in the opposite direction of electro-osmotic flow can allow for zero or infinite retention of analyte species, which we investigate using three different wall boundary conditions. Furthermore, we determine conditions in fused silica nanochannels with which to generate optimal separation between two analytes of different charge but the same mobility. We also give simple rules of thumb to achieve the best separation efficacy in nanochannel systems.

SparseM: A Sparse Matrix Package for R *

Directory of Open Access Journals (Sweden)

Roger Koenker

2003-02-01

Full Text Available SparseM provides some basic R functionality for linear algebra with sparse matrices. Use of the package is illustrated by a family of linear model fitting functions that implement least squares methods for problems with sparse design matrices. Significant performance improvements in memory utilization and computational speed are possible for applications involving large sparse matrices.

Separating rings detection in fuel channels of Embalse NPP

International Nuclear Information System (INIS)

Obrutsky, L.S.; Otero, P.A.; Schmidt, O.A.

1988-01-01

The design specifications of Embalse Nuclear Power Plants (CANDU Type Reactor 600Mw) define the positions to be taken by 4 separating rings of the fuel channels. Experience has demonstrated the displacement possibility of the above mentioned rings. It means a risk of contact between pressure tube and calandria tube. In order to determine the position of separating rings, an inspection system based on Eddy Currents technique was developed by CNEA personnel. Detection is performed through two special probes operating according the ''emitter-receiver'' principle. Obtained signals and its relative position are recorded in a video tape and registered in paper. The probe is telecommanded by an automatic equipment. In this paper the construction and calibration of the detection equipment is described, as well as the propulsion. Final results are also outlined in the inspection carried out in November 1986 when an effective displacement of separating rings was verified from its design position in most of the inspected tubes

Comparison of Miniaturized and Conventional Asymmetrical Flow Field-Flow Fractionation (AF4 Channels for Nanoparticle Separations

Directory of Open Access Journals (Sweden)

Zengchao You

2017-03-01

Full Text Available The performance of a miniaturized channel for the separation of polymer and metal nanoparticles (NP using Asymmetrical Flow Field-Flow Fractionation (AF4 was investigated and compared with a conventional AF4 system. To develop standard separation methods, experimental parameters like cross flow, gradient profile and injection time were varied and optimized. Corresponding chromatographic parameters were calculated and compared. Our results indicate that the chromatographic resolution in the miniaturized channel is lower, whereas significantly shorter analyses time and less solvent consumption were obtained. Moreover, the limit of detection (LOD and limit of quantification (LOQ obtained from hyphenation with a UV-detector are obviously lower than in a conventional channel, which makes the miniaturized channel interesting for trace analysis.

Robust and Secure Watermarking Using Sparse Information of Watermark for Biometric Data Protection

Directory of Open Access Journals (Sweden)

Rohit M Thanki

2016-08-01

Full Text Available Biometric based human authentication system is used for security purpose in many organizations in the present world. This biometric authentication system has several vulnerable points. Two of vulnerable points are protection of biometric templates at system database and protection of biometric templates at communication channel between two modules of biometric authentication systems. In this paper proposed a robust watermarking scheme using the sparse information of watermark biometric to secure vulnerable point like protection of biometric templates at the communication channel of biometric authentication systems. A compressive sensing theory procedure is used for generation of sparse information on watermark biometric data using detail wavelet coefficients. Then sparse information of watermark biometric data is embedded into DCT coefficients of host biometric data. This proposed scheme is robust to common signal processing and geometric attacks like JPEG compression, adding noise, filtering, and cropping, histogram equalization. This proposed scheme has more advantages and high quality measures compared to existing schemes in the literature.

Blood–plasma separation in Y-shaped bifurcating microfluidic channels: a dissipative particle dynamics simulation study

International Nuclear Information System (INIS)

Li, Xuejin; Karniadakis, George Em; Popel, Aleksander S

2012-01-01

The motion of a suspension of red blood cells (RBCs) flowing in a Y-shaped bifurcating microfluidic channel is investigated using a validated low-dimensional RBC model based on dissipative particle dynamics. Specifically, the RBC is represented as a closed torus-like ring of ten colloidal particles, which leads to efficient simulations of blood flow in microcirculation over a wide range of hematocrits. Adaptive no-slip wall boundary conditions were implemented to model hydrodynamic flow within a specific wall structure of diverging three-dimensional microfluidic channels, paying attention to controlling density fluctuations. Plasma skimming and the all-or-nothing phenomenon of RBCs in a bifurcating microfluidic channel have been investigated in our simulations for healthy and diseased blood, including the size of a cell-free layer on the daughter branches. The feed hematocrit level in the parent channel has considerable influence on blood–plasma separation. Compared to the blood–plasma separation efficiencies of healthy RBCs, malaria-infected stiff RBCs (iRBCs) have a tendency to travel into the low flow-rate daughter branch because of their different initial distribution in the parent channel. Our simulation results are consistent with previously published experimental results and theoretical predictions. (paper)

Multiple-channel ultra-violet absorbance detector for two-dimensional chromatographic separations.

Science.gov (United States)

Lynch, Kyle B; Yang, Yu; Ren, Jiangtao; Liu, Shaorong

2018-05-01

In recent years, much research has gone into developing online comprehensive two-dimensional liquid chromatographic systems allowing for high peak capacities in comparable separation times to that of one-dimensional liquid chromatographic systems. However, the speed requirements in the second dimension (2nd-D) still remain one challenge for complex biological samples due to the current configuration of two column/two detector systems. Utilization of multiple 2nd-D columns can mitigate this challenge. To adapt this approach, we need a multiple channel detector. Here we develop a versatile multichannel ultraviolet (UV) light absorbance detector that is capable of simultaneously monitoring separations in 12 columns. The detector consists of a deuterium lighthouse, a flow cell assembly (a 13-channel flow cell fitted with a 13-photodiode-detection system), and a data acquisition and monitoring terminal. Through the use of a custom high optical quality furcated fiber to improve light transmission, precise machining of a flow cell to reduce background stray light through precision alignment, and sensitive electronic circuitry to reduce electronic noise through an active low pass filter, the background noise level is measured in the tens of µAU. We obtain a linear dynamic range of close to three orders of magnitude. Compared to a commercialized multichannel UV light absorbance detector like the Waters 2488 UV/Vis, our device provides an increase in channel detection while residing within the same noise region and linear range. Copyright © 2018 Elsevier B.V. All rights reserved.

Triple-channel portable capillary electrophoresis instrument with individual background electrolytes for the concurrent separations of anionic and cationic species

Energy Technology Data Exchange (ETDEWEB)

Mai, Thanh Duc; Le, Minh Duc [Centre for Environmental Technology and Sustainable Development (CETASD), Hanoi University of Science, Nguyen Trai Street 334, Hanoi (Viet Nam); Sáiz, Jorge [Department of Analytical Chemistry, Physical Chemistry and Chemical Engineering, University of Alcalá, Ctra. Madrid-Barcelona Km 33.6, Alcalá de Henares, Madrid (Spain); Duong, Hong Anh [Centre for Environmental Technology and Sustainable Development (CETASD), Hanoi University of Science, Nguyen Trai Street 334, Hanoi (Viet Nam); Koenka, Israel Joel [University of Basel, Department of Chemistry, Spitalstrasse 51, 4056 Basel (Switzerland); Pham, Hung Viet, E-mail: phamhungviet@hus.edu.vn [Centre for Environmental Technology and Sustainable Development (CETASD), Hanoi University of Science, Nguyen Trai Street 334, Hanoi (Viet Nam); Hauser, Peter C., E-mail: Peter.Hauser@unibas.ch [University of Basel, Department of Chemistry, Spitalstrasse 51, 4056 Basel (Switzerland)

2016-03-10

The portable capillary electrophoresis instrument is automated and features three independent channels with different background electrolytes to allow the concurrent optimized determination of three different categories of charged analytes. The fluidic system is based on a miniature manifold which is based on mechanically milled channels for injection of samples and buffers. The planar manifold pattern was designed to minimize the number of electronic valves required for each channel. The system utilizes pneumatic pressurization to transport solutions at the grounded as well as the high voltage side of the separation capillaries. The instrument has a compact design, with all components arranged in a briefcase with dimensions of 45 (w) × 35 (d) × 15 cm (h) and a weight of about 15 kg. It can operate continuously for 8 h in the battery-powered mode if only one electrophoresis channel is in use, or for about 2.5 h in the case of simultaneous employment of all three channels. The different operations, i.e. capillary flushing, rinsing of the interfaces at both capillary ends, sample injection and electrophoretic separation, are activated automatically with a control program featuring a graphical user interface. For demonstration, the system was employed successfully for the concurrent separation of different inorganic cations and anions, organic preservatives, additives and artificial sweeteners in various beverage and food matrices. - Highlights: • The use of parallel channels allows the concurrent separation of different classes of analytes. • Separate background electrolytes allow individual optimization. • The instrument is compact and field portable.

Triple-channel portable capillary electrophoresis instrument with individual background electrolytes for the concurrent separations of anionic and cationic species

International Nuclear Information System (INIS)

Mai, Thanh Duc; Le, Minh Duc; Sáiz, Jorge; Duong, Hong Anh; Koenka, Israel Joel; Pham, Hung Viet; Hauser, Peter C.

2016-01-01

The portable capillary electrophoresis instrument is automated and features three independent channels with different background electrolytes to allow the concurrent optimized determination of three different categories of charged analytes. The fluidic system is based on a miniature manifold which is based on mechanically milled channels for injection of samples and buffers. The planar manifold pattern was designed to minimize the number of electronic valves required for each channel. The system utilizes pneumatic pressurization to transport solutions at the grounded as well as the high voltage side of the separation capillaries. The instrument has a compact design, with all components arranged in a briefcase with dimensions of 45 (w) × 35 (d) × 15 cm (h) and a weight of about 15 kg. It can operate continuously for 8 h in the battery-powered mode if only one electrophoresis channel is in use, or for about 2.5 h in the case of simultaneous employment of all three channels. The different operations, i.e. capillary flushing, rinsing of the interfaces at both capillary ends, sample injection and electrophoretic separation, are activated automatically with a control program featuring a graphical user interface. For demonstration, the system was employed successfully for the concurrent separation of different inorganic cations and anions, organic preservatives, additives and artificial sweeteners in various beverage and food matrices. - Highlights: • The use of parallel channels allows the concurrent separation of different classes of analytes. • Separate background electrolytes allow individual optimization. • The instrument is compact and field portable.

Sparse regularization for force identification using dictionaries

Science.gov (United States)

Qiao, Baijie; Zhang, Xingwu; Wang, Chenxi; Zhang, Hang; Chen, Xuefeng

2016-04-01

The classical function expansion method based on minimizing l2-norm of the response residual employs various basis functions to represent the unknown force. Its difficulty lies in determining the optimum number of basis functions. Considering the sparsity of force in the time domain or in other basis space, we develop a general sparse regularization method based on minimizing l1-norm of the coefficient vector of basis functions. The number of basis functions is adaptively determined by minimizing the number of nonzero components in the coefficient vector during the sparse regularization process. First, according to the profile of the unknown force, the dictionary composed of basis functions is determined. Second, a sparsity convex optimization model for force identification is constructed. Third, given the transfer function and the operational response, Sparse reconstruction by separable approximation (SpaRSA) is developed to solve the sparse regularization problem of force identification. Finally, experiments including identification of impact and harmonic forces are conducted on a cantilever thin plate structure to illustrate the effectiveness and applicability of SpaRSA. Besides the Dirac dictionary, other three sparse dictionaries including Db6 wavelets, Sym4 wavelets and cubic B-spline functions can also accurately identify both the single and double impact forces from highly noisy responses in a sparse representation frame. The discrete cosine functions can also successfully reconstruct the harmonic forces including the sinusoidal, square and triangular forces. Conversely, the traditional Tikhonov regularization method with the L-curve criterion fails to identify both the impact and harmonic forces in these cases.

Low Complexity Sparse Bayesian Learning for Channel Estimation Using Generalized Mean Field

DEFF Research Database (Denmark)

Pedersen, Niels Lovmand; Manchón, Carles Navarro; Fleury, Bernard Henri

2014-01-01

We derive low complexity versions of a wide range of algorithms for sparse Bayesian learning (SBL) in underdetermined linear systems. The proposed algorithms are obtained by applying the generalized mean field (GMF) inference framework to a generic SBL probabilistic model. In the GMF framework, we...

A Joint Approach for Single-Channel Speaker Identification and Speech Separation

DEFF Research Database (Denmark)

Mowlaee, Pejman; Saeidi, Rahim; Christensen, Mads Græsbøll

2012-01-01

) accuracy, here, we report the objective and subjective results as well. The results show that the proposed system performs as well as the best of the state-of-the-art in terms of perceived quality while its performance in terms of speaker identification and automatic speech recognition results......In this paper, we present a novel system for joint speaker identification and speech separation. For speaker identification a single-channel speaker identification algorithm is proposed which provides an estimate of signal-to-signal ratio (SSR) as a by-product. For speech separation, we propose...... a sinusoidal model-based algorithm. The speech separation algorithm consists of a double-talk/single-talk detector followed by a minimum mean square error estimator of sinusoidal parameters for finding optimal codevectors from pre-trained speaker codebooks. In evaluating the proposed system, we start from...

Efficient channel estimation in massive MIMO systems - a distributed approach

KAUST Repository

Al-Naffouri, Tareq Y.

2016-01-01

We present two efficient algorithms for distributed estimation of channels in massive MIMO systems. The two cases of 1) generic, and 2) sparse channels is considered. The algorithms estimate the impulse response for each channel observed

Orthogonal Matching Pursuit for Enhanced Recovery of Sparse Geological Structures With the Ensemble Kalman Filter

KAUST Repository

Sana, Furrukh; Katterbauer, Klemens; Al-Naffouri, Tareq Y.; Hoteit, Ibrahim

2016-01-01

Estimating the locations and the structures of subsurface channels holds significant importance for forecasting the subsurface flow and reservoir productivity. These channels exhibit high permeability and are easily contrasted from the low-permeability rock formations in their surroundings. This enables formulating the flow channels estimation problem as a sparse field recovery problem. The ensemble Kalman filter (EnKF) is a widely used technique for the estimation and calibration of subsurface reservoir model parameters, such as permeability. However, the conventional EnKF framework does not provide an efficient mechanism to incorporate prior information on the wide varieties of subsurface geological structures, and often fails to recover and preserve flow channel structures. Recent works in the area of compressed sensing (CS) have shown that estimating in a sparse domain, using algorithms such as the orthogonal matching pursuit (OMP), may significantly improve the estimation quality when dealing with such problems. We propose two new, and computationally efficient, algorithms combining OMP with the EnKF to improve the estimation and recovery of the subsurface geological channels. Numerical experiments suggest that the proposed algorithms provide efficient mechanisms to incorporate and preserve structural information in the EnKF and result in significant improvements in recovering flow channel structures.

Orthogonal Matching Pursuit for Enhanced Recovery of Sparse Geological Structures With the Ensemble Kalman Filter

KAUST Repository

Sana, Furrukh

2016-02-23

Estimating the locations and the structures of subsurface channels holds significant importance for forecasting the subsurface flow and reservoir productivity. These channels exhibit high permeability and are easily contrasted from the low-permeability rock formations in their surroundings. This enables formulating the flow channels estimation problem as a sparse field recovery problem. The ensemble Kalman filter (EnKF) is a widely used technique for the estimation and calibration of subsurface reservoir model parameters, such as permeability. However, the conventional EnKF framework does not provide an efficient mechanism to incorporate prior information on the wide varieties of subsurface geological structures, and often fails to recover and preserve flow channel structures. Recent works in the area of compressed sensing (CS) have shown that estimating in a sparse domain, using algorithms such as the orthogonal matching pursuit (OMP), may significantly improve the estimation quality when dealing with such problems. We propose two new, and computationally efficient, algorithms combining OMP with the EnKF to improve the estimation and recovery of the subsurface geological channels. Numerical experiments suggest that the proposed algorithms provide efficient mechanisms to incorporate and preserve structural information in the EnKF and result in significant improvements in recovering flow channel structures.

Dentate Gyrus circuitry features improve performance of sparse approximation algorithms.

Directory of Open Access Journals (Sweden)

Panagiotis C Petrantonakis

Full Text Available Memory-related activity in the Dentate Gyrus (DG is characterized by sparsity. Memory representations are seen as activated neuronal populations of granule cells, the main encoding cells in DG, which are estimated to engage 2-4% of the total population. This sparsity is assumed to enhance the ability of DG to perform pattern separation, one of the most valuable contributions of DG during memory formation. In this work, we investigate how features of the DG such as its excitatory and inhibitory connectivity diagram can be used to develop theoretical algorithms performing Sparse Approximation, a widely used strategy in the Signal Processing field. Sparse approximation stands for the algorithmic identification of few components from a dictionary that approximate a certain signal. The ability of DG to achieve pattern separation by sparsifing its representations is exploited here to improve the performance of the state of the art sparse approximation algorithm "Iterative Soft Thresholding" (IST by adding new algorithmic features inspired by the DG circuitry. Lateral inhibition of granule cells, either direct or indirect, via mossy cells, is shown to enhance the performance of the IST. Apart from revealing the potential of DG-inspired theoretical algorithms, this work presents new insights regarding the function of particular cell types in the pattern separation task of the DG.

Point-source reconstruction with a sparse light-sensor array for optical TPC readout

International Nuclear Information System (INIS)

Rutter, G; Richards, M; Bennieston, A J; Ramachers, Y A

2011-01-01

A reconstruction technique for sparse array optical signal readout is introduced and applied to the generic challenge of large-area readout of a large number of point light sources. This challenge finds a prominent example in future, large volume neutrino detector studies based on liquid argon. It is concluded that the sparse array option may be ruled out for reasons of required number of channels when compared to a benchmark derived from charge readout on wire-planes. Smaller-scale detectors, however, could benefit from this technology.

On-line coupling of sample preconcentration by LVSEP with gel electrophoretic separation on T-channel chips.

Science.gov (United States)

Kitagawa, Fumihiko; Kinami, Saeko; Takegawa, Yuuki; Nukatsuka, Isoshi; Sueyoshi, Kenji; Kawai, Takayuki; Otsuka, Koji

2017-01-01

To achieve an on-line coupling of the sample preconcentration by a large-volume sample stacking with an electroosmotic flow pump (LVSEP) with microchip gel electrophoresis (MCGE), a sample solution, a background solution for LVSEP and a sieving solution for MCGE were loaded in a T-form channel and three reservoirs on PDMS microchips. By utilizing the difference in the flow resistance of the two channels, a low-viscosity sample and a viscous polymer solution were easily introduced into the LVSEP and MCGE channels, respectively. Fluorescence imaging of the sequential LVSEP-MCGE processes clearly demonstrated that a faster stacking of anionic fluorescein and successive introduction into the MCGE channel can be carried out on the T-channel chip. To evaluate the preconcentration performance, a conventional MCZE analysis of fluorescein on the cross-channel chip was compared with LVSEP-MCGE on the short T-channel chip, and as a result that the value of sensitive enhancement factor (SEF) was estimated to be 370. The repeatability of the peak height was good with the RSD value of 3.2%, indicating the robustness of the enrichment performance. In the successive LVSEP-MCGE analysis of φX174/HaeIII digest, the DNA fragments were well enriched to a sharp peak in the LVSEP channel, and they were separated in the MCGE channel, whose electropherogram was well-resembled with that in the conventional MCGE. The values of SEF for the DNA fragments were calculated to be ranging from 74 to 108. Thus, the successive LVSEP-MCGE analysis was effective for both preconcentrating and separating DNA fragments. © 2016 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Linear program differentiation for single-channel speech separation

DEFF Research Database (Denmark)

Pearlmutter, Barak A.; Olsson, Rasmus Kongsgaard

2006-01-01

Many apparently difficult problems can be solved by reduction to linear programming. Such problems are often subproblems within larger systems. When gradient optimisation of the entire larger system is desired, it is necessary to propagate gradients through the internally-invoked LP solver....... For instance, when an intermediate quantity z is the solution to a linear program involving constraint matrix A, a vector of sensitivities dE/dz will induce sensitivities dE/dA. Here we show how these can be efficiently calculated, when they exist. This allows algorithmic differentiation to be applied...... to algorithms that invoke linear programming solvers as subroutines, as is common when using sparse representations in signal processing. Here we apply it to gradient optimisation of over complete dictionaries for maximally sparse representations of a speech corpus. The dictionaries are employed in a single...

Sparse BLIP: BLind Iterative Parallel imaging reconstruction using compressed sensing.

Science.gov (United States)

She, Huajun; Chen, Rong-Rong; Liang, Dong; DiBella, Edward V R; Ying, Leslie

2014-02-01

To develop a sensitivity-based parallel imaging reconstruction method to reconstruct iteratively both the coil sensitivities and MR image simultaneously based on their prior information. Parallel magnetic resonance imaging reconstruction problem can be formulated as a multichannel sampling problem where solutions are sought analytically. However, the channel functions given by the coil sensitivities in parallel imaging are not known exactly and the estimation error usually leads to artifacts. In this study, we propose a new reconstruction algorithm, termed Sparse BLind Iterative Parallel, for blind iterative parallel imaging reconstruction using compressed sensing. The proposed algorithm reconstructs both the sensitivity functions and the image simultaneously from undersampled data. It enforces the sparseness constraint in the image as done in compressed sensing, but is different from compressed sensing in that the sensing matrix is unknown and additional constraint is enforced on the sensitivities as well. Both phantom and in vivo imaging experiments were carried out with retrospective undersampling to evaluate the performance of the proposed method. Experiments show improvement in Sparse BLind Iterative Parallel reconstruction when compared with Sparse SENSE, JSENSE, IRGN-TV, and L1-SPIRiT reconstructions with the same number of measurements. The proposed Sparse BLind Iterative Parallel algorithm reduces the reconstruction errors when compared to the state-of-the-art parallel imaging methods. Copyright © 2013 Wiley Periodicals, Inc.

Semi-supervised sparse coding

KAUST Repository

Wang, Jim Jing-Yan; Gao, Xin

2014-01-01

Sparse coding approximates the data sample as a sparse linear combination of some basic codewords and uses the sparse codes as new presentations. In this paper, we investigate learning discriminative sparse codes by sparse coding in a semi-supervised manner, where only a few training samples are labeled. By using the manifold structure spanned by the data set of both labeled and unlabeled samples and the constraints provided by the labels of the labeled samples, we learn the variable class labels for all the samples. Furthermore, to improve the discriminative ability of the learned sparse codes, we assume that the class labels could be predicted from the sparse codes directly using a linear classifier. By solving the codebook, sparse codes, class labels and classifier parameters simultaneously in a unified objective function, we develop a semi-supervised sparse coding algorithm. Experiments on two real-world pattern recognition problems demonstrate the advantage of the proposed methods over supervised sparse coding methods on partially labeled data sets.

Semi-supervised sparse coding

KAUST Repository

Wang, Jim Jing-Yan

2014-07-06

Sparse coding approximates the data sample as a sparse linear combination of some basic codewords and uses the sparse codes as new presentations. In this paper, we investigate learning discriminative sparse codes by sparse coding in a semi-supervised manner, where only a few training samples are labeled. By using the manifold structure spanned by the data set of both labeled and unlabeled samples and the constraints provided by the labels of the labeled samples, we learn the variable class labels for all the samples. Furthermore, to improve the discriminative ability of the learned sparse codes, we assume that the class labels could be predicted from the sparse codes directly using a linear classifier. By solving the codebook, sparse codes, class labels and classifier parameters simultaneously in a unified objective function, we develop a semi-supervised sparse coding algorithm. Experiments on two real-world pattern recognition problems demonstrate the advantage of the proposed methods over supervised sparse coding methods on partially labeled data sets.

Influences of the separation distance, ship speed and channel dimension on ship maneuverability in a confined waterway

Science.gov (United States)

Du, Peng; Ouahsine, Abdellatif; Sergent, Philippe

2018-05-01

Ship maneuvering in the confined inland waterway is investigated using the system-based method, where a nonlinear transient hydrodynamic model is adopted and confinement models are implemented to account for the influence of the channel bank and bottom. The maneuvering model is validated using the turning circle test, and the confinement model is validated using the experimental data. The separation distance, ship speed, and channel width are then varied to investigate their influences on ship maneuverability. With smaller separation distances and higher speeds near the bank, the ship's trajectory deviates more from the original course and the bow is repelled with a larger yaw angle, which increase the difficulty of maneuvering. Smaller channel widths induce higher advancing resistances on the ship. The minimum distance to the bank are extracted and studied. It is suggested to navigate the ship in the middle of the channel and with a reasonable speed in the restricted waterway.

In Defense of Sparse Tracking: Circulant Sparse Tracker

KAUST Repository

Zhang, Tianzhu; Bibi, Adel Aamer; Ghanem, Bernard

2016-01-01

Sparse representation has been introduced to visual tracking by finding the best target candidate with minimal reconstruction error within the particle filter framework. However, most sparse representation based trackers have high computational cost, less than promising tracking performance, and limited feature representation. To deal with the above issues, we propose a novel circulant sparse tracker (CST), which exploits circulant target templates. Because of the circulant structure property, CST has the following advantages: (1) It can refine and reduce particles using circular shifts of target templates. (2) The optimization can be efficiently solved entirely in the Fourier domain. (3) High dimensional features can be embedded into CST to significantly improve tracking performance without sacrificing much computation time. Both qualitative and quantitative evaluations on challenging benchmark sequences demonstrate that CST performs better than all other sparse trackers and favorably against state-of-the-art methods.

In Defense of Sparse Tracking: Circulant Sparse Tracker

KAUST Repository

Zhang, Tianzhu

2016-12-13

Sparse representation has been introduced to visual tracking by finding the best target candidate with minimal reconstruction error within the particle filter framework. However, most sparse representation based trackers have high computational cost, less than promising tracking performance, and limited feature representation. To deal with the above issues, we propose a novel circulant sparse tracker (CST), which exploits circulant target templates. Because of the circulant structure property, CST has the following advantages: (1) It can refine and reduce particles using circular shifts of target templates. (2) The optimization can be efficiently solved entirely in the Fourier domain. (3) High dimensional features can be embedded into CST to significantly improve tracking performance without sacrificing much computation time. Both qualitative and quantitative evaluations on challenging benchmark sequences demonstrate that CST performs better than all other sparse trackers and favorably against state-of-the-art methods.

High Order Tensor Formulation for Convolutional Sparse Coding

KAUST Repository

Bibi, Adel Aamer

2017-12-25

Convolutional sparse coding (CSC) has gained attention for its successful role as a reconstruction and a classification tool in the computer vision and machine learning community. Current CSC methods can only reconstruct singlefeature 2D images independently. However, learning multidimensional dictionaries and sparse codes for the reconstruction of multi-dimensional data is very important, as it examines correlations among all the data jointly. This provides more capacity for the learned dictionaries to better reconstruct data. In this paper, we propose a generic and novel formulation for the CSC problem that can handle an arbitrary order tensor of data. Backed with experimental results, our proposed formulation can not only tackle applications that are not possible with standard CSC solvers, including colored video reconstruction (5D- tensors), but it also performs favorably in reconstruction with much fewer parameters as compared to naive extensions of standard CSC to multiple features/channels.

Channel Estimation in DCT-Based OFDM

Science.gov (United States)

Wang, Yulin; Zhang, Gengxin; Xie, Zhidong; Hu, Jing

2014-01-01

This paper derives the channel estimation of a discrete cosine transform- (DCT-) based orthogonal frequency-division multiplexing (OFDM) system over a frequency-selective multipath fading channel. Channel estimation has been proved to improve system throughput and performance by allowing for coherent demodulation. Pilot-aided methods are traditionally used to learn the channel response. Least square (LS) and mean square error estimators (MMSE) are investigated. We also study a compressed sensing (CS) based channel estimation, which takes the sparse property of wireless channel into account. Simulation results have shown that the CS based channel estimation is expected to have better performance than LS. However MMSE can achieve optimal performance because of prior knowledge of the channel statistic. PMID:24757439

Achieving high permeability and enhanced selectivity for Angstrom-scale separations using artificial water channel membranes.

Science.gov (United States)

Shen, Yue-Xiao; Song, Woochul C; Barden, D Ryan; Ren, Tingwei; Lang, Chao; Feroz, Hasin; Henderson, Codey B; Saboe, Patrick O; Tsai, Daniel; Yan, Hengjing; Butler, Peter J; Bazan, Guillermo C; Phillip, William A; Hickey, Robert J; Cremer, Paul S; Vashisth, Harish; Kumar, Manish

2018-06-12

Synthetic polymer membranes, critical to diverse energy-efficient separations, are subject to permeability-selectivity trade-offs that decrease their overall efficacy. These trade-offs are due to structural variations (e.g., broad pore size distributions) in both nonporous membranes used for Angstrom-scale separations and porous membranes used for nano to micron-scale separations. Biological membranes utilize well-defined Angstrom-scale pores to provide exceptional transport properties and can be used as inspiration to overcome this trade-off. Here, we present a comprehensive demonstration of such a bioinspired approach based on pillar[5]arene artificial water channels, resulting in artificial water channel-based block copolymer membranes. These membranes have a sharp selectivity profile with a molecular weight cutoff of ~ 500 Da, a size range challenging to achieve with current membranes, while achieving a large improvement in permeability (~65 L m -2  h -1  bar -1  compared with 4-7 L m -2  h -1  bar -1 ) over similarly rated commercial membranes.

A density functional for sparse matter

DEFF Research Database (Denmark)

Langreth, D.C.; Lundqvist, Bengt; Chakarova-Kack, S.D.

2009-01-01

forces in molecules, to adsorbed molecules, like benzene, naphthalene, phenol and adenine on graphite, alumina and metals, to polymer and carbon nanotube (CNT) crystals, and hydrogen storage in graphite and metal-organic frameworks (MOFs), and to the structure of DNA and of DNA with intercalators......Sparse matter is abundant and has both strong local bonds and weak nonbonding forces, in particular nonlocal van der Waals (vdW) forces between atoms separated by empty space. It encompasses a broad spectrum of systems, like soft matter, adsorption systems and biostructures. Density-functional...... theory (DFT), long since proven successful for dense matter, seems now to have come to a point, where useful extensions to sparse matter are available. In particular, a functional form, vdW-DF (Dion et al 2004 Phys. Rev. Lett. 92 246401; Thonhauser et al 2007 Phys. Rev. B 76 125112), has been proposed...

Rank-defective millimeter-wave channel estimation based on subspace-compressive sensing

Directory of Open Access Journals (Sweden)

Majid Shakhsi Dastgahian

2016-11-01

Full Text Available Millimeter-wave communication (mmWC is considered as one of the pioneer candidates for 5G indoor and outdoor systems in E-band. To subdue the channel propagation characteristics in this band, high dimensional antenna arrays need to be deployed at both the base station (BS and mobile sets (MS. Unlike the conventional MIMO systems, Millimeter-wave (mmW systems lay away to employ the power predatory equipment such as ADC or RF chain in each branch of MIMO system because of hardware constraints. Such systems leverage to the hybrid precoding (combining architecture for downlink deployment. Because there is a large array at the transceiver, it is impossible to estimate the channel by conventional methods. This paper develops a new algorithm to estimate the mmW channel by exploiting the sparse nature of the channel. The main contribution is the representation of a sparse channel model and the exploitation of a modified approach based on Multiple Measurement Vector (MMV greedy sparse framework and subspace method of Multiple Signal Classification (MUSIC which work together to recover the indices of non-zero elements of an unknown channel matrix when the rank of the channel matrix is defected. In practical rank-defective channels, MUSIC fails, and we need to propose new extended MUSIC approaches based on subspace enhancement to compensate the limitation of MUSIC. Simulation results indicate that our proposed extended MUSIC algorithms will have proper performances and moderate computational speeds, and that they are even able to work in channels with an unknown sparsity level.

Structural Sparse Tracking

KAUST Repository

Zhang, Tianzhu

2015-06-01

Sparse representation has been applied to visual tracking by finding the best target candidate with minimal reconstruction error by use of target templates. However, most sparse representation based trackers only consider holistic or local representations and do not make full use of the intrinsic structure among and inside target candidates, thereby making the representation less effective when similar objects appear or under occlusion. In this paper, we propose a novel Structural Sparse Tracking (SST) algorithm, which not only exploits the intrinsic relationship among target candidates and their local patches to learn their sparse representations jointly, but also preserves the spatial layout structure among the local patches inside each target candidate. We show that our SST algorithm accommodates most existing sparse trackers with the respective merits. Both qualitative and quantitative evaluations on challenging benchmark image sequences demonstrate that the proposed SST algorithm performs favorably against several state-of-the-art methods.

Color normalization of histology slides using graph regularized sparse NMF

Science.gov (United States)

Sha, Lingdao; Schonfeld, Dan; Sethi, Amit

2017-03-01

Computer based automatic medical image processing and quantification are becoming popular in digital pathology. However, preparation of histology slides can vary widely due to differences in staining equipment, procedures and reagents, which can reduce the accuracy of algorithms that analyze their color and texture information. To re- duce the unwanted color variations, various supervised and unsupervised color normalization methods have been proposed. Compared with supervised color normalization methods, unsupervised color normalization methods have advantages of time and cost efficient and universal applicability. Most of the unsupervised color normaliza- tion methods for histology are based on stain separation. Based on the fact that stain concentration cannot be negative and different parts of the tissue absorb different stains, nonnegative matrix factorization (NMF), and particular its sparse version (SNMF), are good candidates for stain separation. However, most of the existing unsupervised color normalization method like PCA, ICA, NMF and SNMF fail to consider important information about sparse manifolds that its pixels occupy, which could potentially result in loss of texture information during color normalization. Manifold learning methods like Graph Laplacian have proven to be very effective in interpreting high-dimensional data. In this paper, we propose a novel unsupervised stain separation method called graph regularized sparse nonnegative matrix factorization (GSNMF). By considering the sparse prior of stain concentration together with manifold information from high-dimensional image data, our method shows better performance in stain color deconvolution than existing unsupervised color deconvolution methods, especially in keeping connected texture information. To utilized the texture information, we construct a nearest neighbor graph between pixels within a spatial area of an image based on their distances using heat kernal in lαβ space. The

Sparse principal component analysis in medical shape modeling

Science.gov (United States)

Sjöstrand, Karl; Stegmann, Mikkel B.; Larsen, Rasmus

2006-03-01

Principal component analysis (PCA) is a widely used tool in medical image analysis for data reduction, model building, and data understanding and exploration. While PCA is a holistic approach where each new variable is a linear combination of all original variables, sparse PCA (SPCA) aims at producing easily interpreted models through sparse loadings, i.e. each new variable is a linear combination of a subset of the original variables. One of the aims of using SPCA is the possible separation of the results into isolated and easily identifiable effects. This article introduces SPCA for shape analysis in medicine. Results for three different data sets are given in relation to standard PCA and sparse PCA by simple thresholding of small loadings. Focus is on a recent algorithm for computing sparse principal components, but a review of other approaches is supplied as well. The SPCA algorithm has been implemented using Matlab and is available for download. The general behavior of the algorithm is investigated, and strengths and weaknesses are discussed. The original report on the SPCA algorithm argues that the ordering of modes is not an issue. We disagree on this point and propose several approaches to establish sensible orderings. A method that orders modes by decreasing variance and maximizes the sum of variances for all modes is presented and investigated in detail.

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.

System of multiwire proportional chambers at the separated particle channel for the Mirabelle bubble chamber

International Nuclear Information System (INIS)

Bryukhanov, N.S.; Galyaev, N.A.; Kotov, V.I.; Prosin, B.V.; Romanov, Yu.A.; Khodyrev, Yu.S.

1980-01-01

A system of multiwire proportional chambers (MPC) operating on-line with a M-6000 computer used during tuning and monitoring of beam parameters in a separated particle channel for the Mirabelle bubble chamber is described. Peculiarities of the construction and main characteristics of two MPC versions are considered. The first version is intended for placing in a vacuum at the edges of high-frequency separator deflector, the second one - for placing outside a vacuum in ionoguide gaps. Power supply of the proportional chambers is carried out from local compact (160x95x50 mm) high-voltage sources remotely controlled from a channel panel by low voltage. A MPC position diagram in the accelerator channel, flowsheet of registering electronics for the MPC system, main circuits of high-voltage power source, analog-to-digital converter of a code and trunk amplifier are given. A graph of amplifier signal amplitude dependence on high voltage of a chamber for a different composition of a gaseous mixture is presented. It is noted that the used elements of the electronic system provide the reliable processing of data and its transmission for a great distance (approximately 400 m). It is underlined that the MPC system operation for a long time has shown its high efficiency and reliability

Sparse linear models: Variational approximate inference and Bayesian experimental design

International Nuclear Information System (INIS)

Seeger, Matthias W

2009-01-01

A wide range of problems such as signal reconstruction, denoising, source separation, feature selection, and graphical model search are addressed today by posterior maximization for linear models with sparsity-favouring prior distributions. The Bayesian posterior contains useful information far beyond its mode, which can be used to drive methods for sampling optimization (active learning), feature relevance ranking, or hyperparameter estimation, if only this representation of uncertainty can be approximated in a tractable manner. In this paper, we review recent results for variational sparse inference, and show that they share underlying computational primitives. We discuss how sampling optimization can be implemented as sequential Bayesian experimental design. While there has been tremendous recent activity to develop sparse estimation, little attendance has been given to sparse approximate inference. In this paper, we argue that many problems in practice, such as compressive sensing for real-world image reconstruction, are served much better by proper uncertainty approximations than by ever more aggressive sparse estimation algorithms. Moreover, since some variational inference methods have been given strong convex optimization characterizations recently, theoretical analysis may become possible, promising new insights into nonlinear experimental design.

Sparse linear models: Variational approximate inference and Bayesian experimental design

Energy Technology Data Exchange (ETDEWEB)

Seeger, Matthias W [Saarland University and Max Planck Institute for Informatics, Campus E1.4, 66123 Saarbruecken (Germany)

2009-12-01

A wide range of problems such as signal reconstruction, denoising, source separation, feature selection, and graphical model search are addressed today by posterior maximization for linear models with sparsity-favouring prior distributions. The Bayesian posterior contains useful information far beyond its mode, which can be used to drive methods for sampling optimization (active learning), feature relevance ranking, or hyperparameter estimation, if only this representation of uncertainty can be approximated in a tractable manner. In this paper, we review recent results for variational sparse inference, and show that they share underlying computational primitives. We discuss how sampling optimization can be implemented as sequential Bayesian experimental design. While there has been tremendous recent activity to develop sparse estimation, little attendance has been given to sparse approximate inference. In this paper, we argue that many problems in practice, such as compressive sensing for real-world image reconstruction, are served much better by proper uncertainty approximations than by ever more aggressive sparse estimation algorithms. Moreover, since some variational inference methods have been given strong convex optimization characterizations recently, theoretical analysis may become possible, promising new insights into nonlinear experimental design.

Wind Noise Reduction using Non-negative Sparse Coding

DEFF Research Database (Denmark)

Schmidt, Mikkel N.; Larsen, Jan; Hsiao, Fu-Tien

2007-01-01

We introduce a new speaker independent method for reducing wind noise in single-channel recordings of noisy speech. The method is based on non-negative sparse coding and relies on a wind noise dictionary which is estimated from an isolated noise recording. We estimate the parameters of the model ...... and discuss their sensitivity. We then compare the algorithm with the classical spectral subtraction method and the Qualcomm-ICSI-OGI noise reduction method. We optimize the sound quality in terms of signal-to-noise ratio and provide results on a noisy speech recognition task....

The application of low-rank and sparse decomposition method in the field of climatology

Science.gov (United States)

Gupta, Nitika; Bhaskaran, Prasad K.

2018-04-01

The present study reports a low-rank and sparse decomposition method that separates the mean and the variability of a climate data field. Until now, the application of this technique was limited only in areas such as image processing, web data ranking, and bioinformatics data analysis. In climate science, this method exactly separates the original data into a set of low-rank and sparse components, wherein the low-rank components depict the linearly correlated dataset (expected or mean behavior), and the sparse component represents the variation or perturbation in the dataset from its mean behavior. The study attempts to verify the efficacy of this proposed technique in the field of climatology with two examples of real world. The first example attempts this technique on the maximum wind-speed (MWS) data for the Indian Ocean (IO) region. The study brings to light a decadal reversal pattern in the MWS for the North Indian Ocean (NIO) during the months of June, July, and August (JJA). The second example deals with the sea surface temperature (SST) data for the Bay of Bengal region that exhibits a distinct pattern in the sparse component. The study highlights the importance of the proposed technique used for interpretation and visualization of climate data.

CHANNEL ESTIMATION TECHNIQUE

DEFF Research Database (Denmark)

2015-01-01

A method includes determining a sequence of first coefficient estimates of a communication channel based on a sequence of pilots arranged according to a known pilot pattern and based on a receive signal, wherein the receive signal is based on the sequence of pilots transmitted over the communicat......A method includes determining a sequence of first coefficient estimates of a communication channel based on a sequence of pilots arranged according to a known pilot pattern and based on a receive signal, wherein the receive signal is based on the sequence of pilots transmitted over...... the communication channel. The method further includes determining a sequence of second coefficient estimates of the communication channel based on a decomposition of the first coefficient estimates in a dictionary matrix and a sparse vector of the second coefficient estimates, the dictionary matrix including...... filter characteristics of at least one known transceiver filter arranged in the communication channel....

Visual properties and memorising scenes: Effects of image-space sparseness and uniformity.

Science.gov (United States)

Lukavský, Jiří; Děchtěrenko, Filip

2017-10-01

Previous studies have demonstrated that humans have a remarkable capacity to memorise a large number of scenes. The research on memorability has shown that memory performance can be predicted by the content of an image. We explored how remembering an image is affected by the image properties within the context of the reference set, including the extent to which it is different from its neighbours (image-space sparseness) and if it belongs to the same category as its neighbours (uniformity). We used a reference set of 2,048 scenes (64 categories), evaluated pairwise scene similarity using deep features from a pretrained convolutional neural network (CNN), and calculated the image-space sparseness and uniformity for each image. We ran three memory experiments, varying the memory workload with experiment length and colour/greyscale presentation. We measured the sensitivity and criterion value changes as a function of image-space sparseness and uniformity. Across all three experiments, we found separate effects of 1) sparseness on memory sensitivity, and 2) uniformity on the recognition criterion. People better remembered (and correctly rejected) images that were more separated from others. People tended to make more false alarms and fewer miss errors in images from categorically uniform portions of the image-space. We propose that both image-space properties affect human decisions when recognising images. Additionally, we found that colour presentation did not yield better memory performance over grayscale images.

Example-Based Image Colorization Using Locality Consistent Sparse Representation.

Science.gov (United States)

Bo Li; Fuchen Zhao; Zhuo Su; Xiangguo Liang; Yu-Kun Lai; Rosin, Paul L

2017-11-01

Image colorization aims to produce a natural looking color image from a given gray-scale image, which remains a challenging problem. In this paper, we propose a novel example-based image colorization method exploiting a new locality consistent sparse representation. Given a single reference color image, our method automatically colorizes the target gray-scale image by sparse pursuit. For efficiency and robustness, our method operates at the superpixel level. We extract low-level intensity features, mid-level texture features, and high-level semantic features for each superpixel, which are then concatenated to form its descriptor. The collection of feature vectors for all the superpixels from the reference image composes the dictionary. We formulate colorization of target superpixels as a dictionary-based sparse reconstruction problem. Inspired by the observation that superpixels with similar spatial location and/or feature representation are likely to match spatially close regions from the reference image, we further introduce a locality promoting regularization term into the energy formulation, which substantially improves the matching consistency and subsequent colorization results. Target superpixels are colorized based on the chrominance information from the dominant reference superpixels. Finally, to further improve coherence while preserving sharpness, we develop a new edge-preserving filter for chrominance channels with the guidance from the target gray-scale image. To the best of our knowledge, this is the first work on sparse pursuit image colorization from single reference images. Experimental results demonstrate that our colorization method outperforms the state-of-the-art methods, both visually and quantitatively using a user study.

A flexible framework for sparse simultaneous component based data integration

Directory of Open Access Journals (Sweden)

Van Deun Katrijn

2011-11-01

Full Text Available Abstract 1 Background High throughput data are complex and methods that reveal structure underlying the data are most useful. Principal component analysis, frequently implemented as a singular value decomposition, is a popular technique in this respect. Nowadays often the challenge is to reveal structure in several sources of information (e.g., transcriptomics, proteomics that are available for the same biological entities under study. Simultaneous component methods are most promising in this respect. However, the interpretation of the principal and simultaneous components is often daunting because contributions of each of the biomolecules (transcripts, proteins have to be taken into account. 2 Results We propose a sparse simultaneous component method that makes many of the parameters redundant by shrinking them to zero. It includes principal component analysis, sparse principal component analysis, and ordinary simultaneous component analysis as special cases. Several penalties can be tuned that account in different ways for the block structure present in the integrated data. This yields known sparse approaches as the lasso, the ridge penalty, the elastic net, the group lasso, sparse group lasso, and elitist lasso. In addition, the algorithmic results can be easily transposed to the context of regression. Metabolomics data obtained with two measurement platforms for the same set of Escherichia coli samples are used to illustrate the proposed methodology and the properties of different penalties with respect to sparseness across and within data blocks. 3 Conclusion Sparse simultaneous component analysis is a useful method for data integration: First, simultaneous analyses of multiple blocks offer advantages over sequential and separate analyses and second, interpretation of the results is highly facilitated by their sparseness. The approach offered is flexible and allows to take the block structure in different ways into account. As such

A flexible framework for sparse simultaneous component based data integration.

Science.gov (United States)

Van Deun, Katrijn; Wilderjans, Tom F; van den Berg, Robert A; Antoniadis, Anestis; Van Mechelen, Iven

2011-11-15

High throughput data are complex and methods that reveal structure underlying the data are most useful. Principal component analysis, frequently implemented as a singular value decomposition, is a popular technique in this respect. Nowadays often the challenge is to reveal structure in several sources of information (e.g., transcriptomics, proteomics) that are available for the same biological entities under study. Simultaneous component methods are most promising in this respect. However, the interpretation of the principal and simultaneous components is often daunting because contributions of each of the biomolecules (transcripts, proteins) have to be taken into account. We propose a sparse simultaneous component method that makes many of the parameters redundant by shrinking them to zero. It includes principal component analysis, sparse principal component analysis, and ordinary simultaneous component analysis as special cases. Several penalties can be tuned that account in different ways for the block structure present in the integrated data. This yields known sparse approaches as the lasso, the ridge penalty, the elastic net, the group lasso, sparse group lasso, and elitist lasso. In addition, the algorithmic results can be easily transposed to the context of regression. Metabolomics data obtained with two measurement platforms for the same set of Escherichia coli samples are used to illustrate the proposed methodology and the properties of different penalties with respect to sparseness across and within data blocks. Sparse simultaneous component analysis is a useful method for data integration: First, simultaneous analyses of multiple blocks offer advantages over sequential and separate analyses and second, interpretation of the results is highly facilitated by their sparseness. The approach offered is flexible and allows to take the block structure in different ways into account. As such, structures can be found that are exclusively tied to one data platform

Epileptic Seizure Detection with Log-Euclidean Gaussian Kernel-Based Sparse Representation.

Science.gov (United States)

Yuan, Shasha; Zhou, Weidong; Wu, Qi; Zhang, Yanli

2016-05-01

Epileptic seizure detection plays an important role in the diagnosis of epilepsy and reducing the massive workload of reviewing electroencephalography (EEG) recordings. In this work, a novel algorithm is developed to detect seizures employing log-Euclidean Gaussian kernel-based sparse representation (SR) in long-term EEG recordings. Unlike the traditional SR for vector data in Euclidean space, the log-Euclidean Gaussian kernel-based SR framework is proposed for seizure detection in the space of the symmetric positive definite (SPD) matrices, which form a Riemannian manifold. Since the Riemannian manifold is nonlinear, the log-Euclidean Gaussian kernel function is applied to embed it into a reproducing kernel Hilbert space (RKHS) for performing SR. The EEG signals of all channels are divided into epochs and the SPD matrices representing EEG epochs are generated by covariance descriptors. Then, the testing samples are sparsely coded over the dictionary composed by training samples utilizing log-Euclidean Gaussian kernel-based SR. The classification of testing samples is achieved by computing the minimal reconstructed residuals. The proposed method is evaluated on the Freiburg EEG dataset of 21 patients and shows its notable performance on both epoch-based and event-based assessments. Moreover, this method handles multiple channels of EEG recordings synchronously which is more speedy and efficient than traditional seizure detection methods.

Multi-Layer Sparse Representation for Weighted LBP-Patches Based Facial Expression Recognition

Directory of Open Access Journals (Sweden)

Qi Jia

2015-03-01

Full Text Available In this paper, a novel facial expression recognition method based on sparse representation is proposed. Most contemporary facial expression recognition systems suffer from limited ability to handle image nuisances such as low resolution and noise. Especially for low intensity expression, most of the existing training methods have quite low recognition rates. Motivated by sparse representation, the problem can be solved by finding sparse coefficients of the test image by the whole training set. Deriving an effective facial representation from original face images is a vital step for successful facial expression recognition. We evaluate facial representation based on weighted local binary patterns, and Fisher separation criterion is used to calculate the weighs of patches. A multi-layer sparse representation framework is proposed for multi-intensity facial expression recognition, especially for low-intensity expressions and noisy expressions in reality, which is a critical problem but seldom addressed in the existing works. To this end, several experiments based on low-resolution and multi-intensity expressions are carried out. Promising results on publicly available databases demonstrate the potential of the proposed approach.

Learning Joint-Sparse Codes for Calibration-Free Parallel MR Imaging.

Science.gov (United States)

Wang, Shanshan; Tan, Sha; Gao, Yuan; Liu, Qiegen; Ying, Leslie; Xiao, Taohui; Liu, Yuanyuan; Liu, Xin; Zheng, Hairong; Liang, Dong

2018-01-01

The integration of compressed sensing and parallel imaging (CS-PI) has shown an increased popularity in recent years to accelerate magnetic resonance (MR) imaging. Among them, calibration-free techniques have presented encouraging performances due to its capability in robustly handling the sensitivity information. Unfortunately, existing calibration-free methods have only explored joint-sparsity with direct analysis transform projections. To further exploit joint-sparsity and improve reconstruction accuracy, this paper proposes to Learn joINt-sparse coDes for caliBration-free parallEl mR imaGing (LINDBERG) by modeling the parallel MR imaging problem as an - - minimization objective with an norm constraining data fidelity, Frobenius norm enforcing sparse representation error and the mixed norm triggering joint sparsity across multichannels. A corresponding algorithm has been developed to alternatively update the sparse representation, sensitivity encoded images and K-space data. Then, the final image is produced as the square root of sum of squares of all channel images. Experimental results on both physical phantom and in vivo data sets show that the proposed method is comparable and even superior to state-of-the-art CS-PI reconstruction approaches. Specifically, LINDBERG has presented strong capability in suppressing noise and artifacts while reconstructing MR images from highly undersampled multichannel measurements.

Efficient channel estimation in massive MIMO systems - a distributed approach

KAUST Repository

Al-Naffouri, Tareq Y.

2016-01-21

We present two efficient algorithms for distributed estimation of channels in massive MIMO systems. The two cases of 1) generic, and 2) sparse channels is considered. The algorithms estimate the impulse response for each channel observed by the antennas at the receiver (base station) in a coordinated manner by sharing minimal information among neighboring antennas. Simulations demonstrate the superior performance of the proposed methods as compared to other methods.

Miniature Laboratory for Detecting Sparse Biomolecules

Science.gov (United States)

Lin, Ying; Yu, Nan

2005-01-01

A miniature laboratory system has been proposed for use in the field to detect sparsely distributed biomolecules. By emphasizing concentration and sorting of specimens prior to detection, the underlying system concept would make it possible to attain high detection sensitivities without the need to develop ever more sensitive biosensors. The original purpose of the proposal is to aid the search for signs of life on a remote planet by enabling the detection of specimens as sparse as a few molecules or microbes in a large amount of soil, dust, rocks, water/ice, or other raw sample material. Some version of the system could prove useful on Earth for remote sensing of biological contamination, including agents of biological warfare. Processing in this system would begin with dissolution of the raw sample material in a sample-separation vessel. The solution in the vessel would contain floating microscopic magnetic beads coated with substances that could engage in chemical reactions with various target functional groups that are parts of target molecules. The chemical reactions would cause the targeted molecules to be captured on the surfaces of the beads. By use of a controlled magnetic field, the beads would be concentrated in a specified location in the vessel. Once the beads were thus concentrated, the rest of the solution would be discarded. This procedure would obviate the filtration steps and thereby also eliminate the filter-clogging difficulties of typical prior sample-concentration schemes. For ferrous dust/soil samples, the dissolution would be done first in a separate vessel before the solution is transferred to the microbead-containing vessel.

Intercomparison of two BRDF models in the estimation of the directional emissivity in MIR channel from MSG1-SEVIRI data.

Science.gov (United States)

Jiang, Geng-Ming; Li, Zhao-Liang

2008-11-10

This work intercompared two Bi-directional Reflectance Distribution Function (BRDF) models, the modified Minnaert's model and the RossThick-LiSparse-R model, in the estimation of the directional emissivity in Middle Infra-Red (MIR) channel from the data acquired by the Spinning Enhanced Visible and Infra-Red Imager (SEVIRI) onboard the first Meteosat Second Generation (MSG1). The bi-directional reflectances in SEVIRI channel 4 (3.9 microm) were estimated from the combined MIR and Thermal Infra-Red (TIR) data and then were used to estimate the directional emissivity in this channel with aid of the BRDF models. The results show that: (1) Both models can relatively well describe the non-Lambertian reflective behavior of land surfaces in SEVIRI channel 4; (2) The RossThick-LiSparse-R model is better than the modified Minnaert's model in modeling the bi-directional reflectances, and the directional emissivities modeled by the modified Minnaert's model are always lower than the ones obtained by the RossThick-LiSparse-R model with averaged emissivity differences of approximately 0.01 and approximately 0.04 over the vegetated and bare areas, respectively. The use of the RossThick-LiSparse-R model in the estimation of the directional emissivity in MIR channel is recommended.

Fast Sparse Coding for Range Data Denoising with Sparse Ridges Constraint

Directory of Open Access Journals (Sweden)

Zhi Gao

2018-05-01

Full Text Available Light detection and ranging (LiDAR sensors have been widely deployed on intelligent systems such as unmanned ground vehicles (UGVs and unmanned aerial vehicles (UAVs to perform localization, obstacle detection, and navigation tasks. Thus, research into range data processing with competitive performance in terms of both accuracy and efficiency has attracted increasing attention. Sparse coding has revolutionized signal processing and led to state-of-the-art performance in a variety of applications. However, dictionary learning, which plays the central role in sparse coding techniques, is computationally demanding, resulting in its limited applicability in real-time systems. In this study, we propose sparse coding algorithms with a fixed pre-learned ridge dictionary to realize range data denoising via leveraging the regularity of laser range measurements in man-made environments. Experiments on both synthesized data and real data demonstrate that our method obtains accuracy comparable to that of sophisticated sparse coding methods, but with much higher computational efficiency.

Fast Sparse Coding for Range Data Denoising with Sparse Ridges Constraint.

Science.gov (United States)

Gao, Zhi; Lao, Mingjie; Sang, Yongsheng; Wen, Fei; Ramesh, Bharath; Zhai, Ruifang

2018-05-06

Light detection and ranging (LiDAR) sensors have been widely deployed on intelligent systems such as unmanned ground vehicles (UGVs) and unmanned aerial vehicles (UAVs) to perform localization, obstacle detection, and navigation tasks. Thus, research into range data processing with competitive performance in terms of both accuracy and efficiency has attracted increasing attention. Sparse coding has revolutionized signal processing and led to state-of-the-art performance in a variety of applications. However, dictionary learning, which plays the central role in sparse coding techniques, is computationally demanding, resulting in its limited applicability in real-time systems. In this study, we propose sparse coding algorithms with a fixed pre-learned ridge dictionary to realize range data denoising via leveraging the regularity of laser range measurements in man-made environments. Experiments on both synthesized data and real data demonstrate that our method obtains accuracy comparable to that of sophisticated sparse coding methods, but with much higher computational efficiency.

An RFI Detection Algorithm for Microwave Radiometers Using Sparse Component Analysis

Science.gov (United States)

Mohammed-Tano, Priscilla N.; Korde-Patel, Asmita; Gholian, Armen; Piepmeier, Jeffrey R.; Schoenwald, Adam; Bradley, Damon

2017-01-01

Radio Frequency Interference (RFI) is a threat to passive microwave measurements and if undetected, can corrupt science retrievals. The sparse component analysis (SCA) for blind source separation has been investigated to detect RFI in microwave radiometer data. Various techniques using SCA have been simulated to determine detection performance with continuous wave (CW) RFI.

Groundwater flow into underground openings in fractured crystalline rocks: an interpretation based on long channels

Science.gov (United States)

Black, John H.; Woodman, Nicholas D.; Barker, John A.

2017-03-01

Rethinking an old tracer experiment in fractured crystalline rock suggests a concept of groundwater flow in sparse networks of long channels that is supported by results from an innovative lattice network model. The model, HyperConv, can vary the mean length of `strings' of connected bonds, and the gaps between them, using two independent probability functions. It is found that networks of long channels are able to percolate at lower values of (bond) density than networks of short channels. A general relationship between mean channel length, mean gap length and probability of percolation has been developed which incorporates the well-established result for `classical' lattice network models as a special case. Using parameters appropriate to a 4-m diameter drift located 360 m below surface at Stripa Mine Underground Research Laboratory in Sweden, HyperConv is able to reproduce values of apparent positive skin, as observed in the so-called Macropermeability Experiment, but only when mean channel length exceeds 10 m. This implies that such channel systems must cross many fracture intersections without bifurcating. A general relationship in terms of flow dimension is suggested. Some initial investigations using HyperConv show that the commonly observed feature, `compartmentalization', only occurs when channel density is just above the percolation threshold. Such compartments have been observed at Kamaishi Experimental Mine (Japan) implying a sparse flow network. It is suggested that compartments and skin are observable in the field, indicate sparse channel systems, and could form part of site characterization for deep nuclear waste repositories.

Two-dimensional fluid dynamics in a sharply bent channel: Laminar flow, separation bubble, and vortex dynamics

Science.gov (United States)

Matsumoto, Daichi; Fukudome, Koji; Wada, Hirofumi

2016-10-01

Understanding the hydrodynamic properties of fluid flow in a curving pipe and channel is important for controlling the flow behavior in technologies and biomechanics. The nature of the resulting flow in a bent pipe is extremely complicated because of the presence of a cross-stream secondary flow. In an attempt to disentangle this complexity, we investigate the fluid dynamics in a bent channel via the direct numerical simulation of the Navier-Stokes equation in two spatial dimensions. We exploit the absence of secondary flow from our model and systematically investigate the flow structure along the channel as a function of both the bend angle and Reynolds number of the laminar-to-turbulent regime. We numerically suggest a scaling relation between the shape of the separation bubble and the flow conductance, and construct an integrated phase diagram.

A coordinate descent MM algorithm for fast computation of sparse logistic PCA

KAUST Repository

Lee, Seokho

2013-06-01

Sparse logistic principal component analysis was proposed in Lee et al. (2010) for exploratory analysis of binary data. Relying on the joint estimation of multiple principal components, the algorithm therein is computationally too demanding to be useful when the data dimension is high. We develop a computationally fast algorithm using a combination of coordinate descent and majorization-minimization (MM) auxiliary optimization. Our new algorithm decouples the joint estimation of multiple components into separate estimations and consists of closed-form elementwise updating formulas for each sparse principal component. The performance of the proposed algorithm is tested using simulation and high-dimensional real-world datasets. © 2013 Elsevier B.V. All rights reserved.

Separation followed by direct SERS detection of explosives on a novel black silicon multifunctional nanostructured surface prepared in a microfluidic channel

DEFF Research Database (Denmark)

Talian, Ivan; Hübner, Jörg

2013-01-01

The article describes the multifunctionality of a novel black silicon (BS) nanostructured surface covered with a thin layer of noble metal prepared in the a microfluidic channel. It is focused on the separation properties of the BS substrate with direct detection of the separated analytes utilizing...

Sparse structure regularized ranking

KAUST Repository

Wang, Jim Jing-Yan; Sun, Yijun; Gao, Xin

2014-01-01

Learning ranking scores is critical for the multimedia database retrieval problem. In this paper, we propose a novel ranking score learning algorithm by exploring the sparse structure and using it to regularize ranking scores. To explore the sparse

A Novel Partial Discharge Ultra-High Frequency Signal De-Noising Method Based on a Single-Channel Blind Source Separation Algorithm

Directory of Open Access Journals (Sweden)

Liangliang Wei

2018-02-01

Full Text Available To effectively de-noise the Gaussian white noise and periodic narrow-band interference in the background noise of partial discharge ultra-high frequency (PD UHF signals in field tests, a novel de-noising method, based on a single-channel blind source separation algorithm, is proposed. Compared with traditional methods, the proposed method can effectively de-noise the noise interference, and the distortion of the de-noising PD signal is smaller. Firstly, the PD UHF signal is time-frequency analyzed by S-transform to obtain the number of source signals. Then, the single-channel detected PD signal is converted into multi-channel signals by singular value decomposition (SVD, and background noise is separated from multi-channel PD UHF signals by the joint approximate diagonalization of eigen-matrix method. At last, the source PD signal is estimated and recovered by the l1-norm minimization method. The proposed de-noising method was applied on the simulation test and field test detected signals, and the de-noising performance of the different methods was compared. The simulation and field test results demonstrate the effectiveness and correctness of the proposed method.

Sparse structure regularized ranking

KAUST Repository

Wang, Jim Jing-Yan

2014-04-17

Learning ranking scores is critical for the multimedia database retrieval problem. In this paper, we propose a novel ranking score learning algorithm by exploring the sparse structure and using it to regularize ranking scores. To explore the sparse structure, we assume that each multimedia object could be represented as a sparse linear combination of all other objects, and combination coefficients are regarded as a similarity measure between objects and used to regularize their ranking scores. Moreover, we propose to learn the sparse combination coefficients and the ranking scores simultaneously. A unified objective function is constructed with regard to both the combination coefficients and the ranking scores, and is optimized by an iterative algorithm. Experiments on two multimedia database retrieval data sets demonstrate the significant improvements of the propose algorithm over state-of-the-art ranking score learning algorithms.

Galaxy redshift surveys with sparse sampling

International Nuclear Information System (INIS)

Chiang, Chi-Ting; Wullstein, Philipp; Komatsu, Eiichiro; Jee, Inh; Jeong, Donghui; Blanc, Guillermo A.; Ciardullo, Robin; Gronwall, Caryl; Hagen, Alex; Schneider, Donald P.; Drory, Niv; Fabricius, Maximilian; Landriau, Martin; Finkelstein, Steven; Jogee, Shardha; Cooper, Erin Mentuch; Tuttle, Sarah; Gebhardt, Karl; Hill, Gary J.

2013-01-01

Survey observations of the three-dimensional locations of galaxies are a powerful approach to measure the distribution of matter in the universe, which can be used to learn about the nature of dark energy, physics of inflation, neutrino masses, etc. A competitive survey, however, requires a large volume (e.g., V survey ∼ 10Gpc 3 ) to be covered, and thus tends to be expensive. A ''sparse sampling'' method offers a more affordable solution to this problem: within a survey footprint covering a given survey volume, V survey , we observe only a fraction of the volume. The distribution of observed regions should be chosen such that their separation is smaller than the length scale corresponding to the wavenumber of interest. Then one can recover the power spectrum of galaxies with precision expected for a survey covering a volume of V survey (rather than the volume of the sum of observed regions) with the number density of galaxies given by the total number of observed galaxies divided by V survey (rather than the number density of galaxies within an observed region). We find that regularly-spaced sampling yields an unbiased power spectrum with no window function effect, and deviations from regularly-spaced sampling, which are unavoidable in realistic surveys, introduce calculable window function effects and increase the uncertainties of the recovered power spectrum. On the other hand, we show that the two-point correlation function (pair counting) is not affected by sparse sampling. While we discuss the sparse sampling method within the context of the forthcoming Hobby-Eberly Telescope Dark Energy Experiment, the method is general and can be applied to other galaxy surveys

Robust and Secure Watermarking Using Sparse Information of Watermark for Biometric Data Protection

OpenAIRE

Rohit M Thanki; Ved Vyas Dwivedi; Komal Borisagar

2016-01-01

Biometric based human authentication system is used for security purpose in many organizations in the present world. This biometric authentication system has several vulnerable points. Two of vulnerable points are protection of biometric templates at system database and protection of biometric templates at communication channel between two modules of biometric authentication systems. In this paper proposed a robust watermarking scheme using the sparse information of watermark biometric to sec...

Turbulent flows over sparse canopies

Science.gov (United States)

Sharma, Akshath; García-Mayoral, Ricardo

2018-04-01

Turbulent flows over sparse and dense canopies exerting a similar drag force on the flow are investigated using Direct Numerical Simulations. The dense canopies are modelled using a homogeneous drag force, while for the sparse canopy, the geometry of the canopy elements is represented. It is found that on using the friction velocity based on the local shear at each height, the streamwise velocity fluctuations and the Reynolds stress within the sparse canopy are similar to those from a comparable smooth-wall case. In addition, when scaled with the local friction velocity, the intensity of the off-wall peak in the streamwise vorticity for sparse canopies also recovers a value similar to a smooth-wall. This indicates that the sparse canopy does not significantly disturb the near-wall turbulence cycle, but causes its rescaling to an intensity consistent with a lower friction velocity within the canopy. In comparison, the dense canopy is found to have a higher damping effect on the turbulent fluctuations. For the case of the sparse canopy, a peak in the spectral energy density of the wall-normal velocity, and Reynolds stress is observed, which may indicate the formation of Kelvin-Helmholtz-like instabilities. It is also found that a sparse canopy is better modelled by a homogeneous drag applied on the mean flow alone, and not the turbulent fluctuations.

Wiring assembly and method of forming a channel in a wiring assembly for receiving conductor and providing separate regions of conductor contact with the channel

Energy Technology Data Exchange (ETDEWEB)

Stelzer, Gerald; Meinke, Rainer; Senti, Mark

2018-03-06

A conductor assembly and method for constructing an assembly of the type which, when conducting current, generates a magnetic field or which, in the presence of a changing magnetic field, induces a voltage. In one embodiment the method provides a first insulative layer tubular in shape and including a surface along which a conductor segment may be positioned. A channel formed in the surface of the insulative layer defines a first conductor path and includes a surface of first contour in cross section along a first plane transverse to the conductor path. A segment of conductor having a surface of second contour in cross section is positioned at least partly in the channel and extends along the conductor path. Along the first plane, contact between the conductor surface of second contour and the channel surface of first contour includes at least two separate regions of contact.

Discriminative sparse coding on multi-manifolds

KAUST Repository

Wang, J.J.-Y.; Bensmail, H.; Yao, N.; Gao, Xin

2013-01-01

Sparse coding has been popularly used as an effective data representation method in various applications, such as computer vision, medical imaging and bioinformatics. However, the conventional sparse coding algorithms and their manifold-regularized variants (graph sparse coding and Laplacian sparse coding), learn codebooks and codes in an unsupervised manner and neglect class information that is available in the training set. To address this problem, we propose a novel discriminative sparse coding method based on multi-manifolds, that learns discriminative class-conditioned codebooks and sparse codes from both data feature spaces and class labels. First, the entire training set is partitioned into multiple manifolds according to the class labels. Then, we formulate the sparse coding as a manifold-manifold matching problem and learn class-conditioned codebooks and codes to maximize the manifold margins of different classes. Lastly, we present a data sample-manifold matching-based strategy to classify the unlabeled data samples. Experimental results on somatic mutations identification and breast tumor classification based on ultrasonic images demonstrate the efficacy of the proposed data representation and classification approach. 2013 The Authors. All rights reserved.

Discriminative sparse coding on multi-manifolds

KAUST Repository

Wang, J.J.-Y.

2013-09-26

Sparse coding has been popularly used as an effective data representation method in various applications, such as computer vision, medical imaging and bioinformatics. However, the conventional sparse coding algorithms and their manifold-regularized variants (graph sparse coding and Laplacian sparse coding), learn codebooks and codes in an unsupervised manner and neglect class information that is available in the training set. To address this problem, we propose a novel discriminative sparse coding method based on multi-manifolds, that learns discriminative class-conditioned codebooks and sparse codes from both data feature spaces and class labels. First, the entire training set is partitioned into multiple manifolds according to the class labels. Then, we formulate the sparse coding as a manifold-manifold matching problem and learn class-conditioned codebooks and codes to maximize the manifold margins of different classes. Lastly, we present a data sample-manifold matching-based strategy to classify the unlabeled data samples. Experimental results on somatic mutations identification and breast tumor classification based on ultrasonic images demonstrate the efficacy of the proposed data representation and classification approach. 2013 The Authors. All rights reserved.

Particle separator at Los Alamos

International Nuclear Information System (INIS)

Liska, D.J.

1975-01-01

The beam separator under development at LAMPF for the EPICS channel (Energetic Pion Channel and Spectrometer) is described. The separator operates on the electrostatic crossed-field principle but has several unusual features. (U.S.)

Sparse Regression by Projection and Sparse Discriminant Analysis

KAUST Repository

Qi, Xin

2015-04-03

© 2015, © American Statistical Association, Institute of Mathematical Statistics, and Interface Foundation of North America. Recent years have seen active developments of various penalized regression methods, such as LASSO and elastic net, to analyze high-dimensional data. In these approaches, the direction and length of the regression coefficients are determined simultaneously. Due to the introduction of penalties, the length of the estimates can be far from being optimal for accurate predictions. We introduce a new framework, regression by projection, and its sparse version to analyze high-dimensional data. The unique nature of this framework is that the directions of the regression coefficients are inferred first, and the lengths and the tuning parameters are determined by a cross-validation procedure to achieve the largest prediction accuracy. We provide a theoretical result for simultaneous model selection consistency and parameter estimation consistency of our method in high dimension. This new framework is then generalized such that it can be applied to principal components analysis, partial least squares, and canonical correlation analysis. We also adapt this framework for discriminant analysis. Compared with the existing methods, where there is relatively little control of the dependency among the sparse components, our method can control the relationships among the components. We present efficient algorithms and related theory for solving the sparse regression by projection problem. Based on extensive simulations and real data analysis, we demonstrate that our method achieves good predictive performance and variable selection in the regression setting, and the ability to control relationships between the sparse components leads to more accurate classification. In supplementary materials available online, the details of the algorithms and theoretical proofs, and R codes for all simulation studies are provided.

Sparse distributed memory overview

Science.gov (United States)

Raugh, Mike

1990-01-01

The Sparse Distributed Memory (SDM) project is investigating the theory and applications of massively parallel computing architecture, called sparse distributed memory, that will support the storage and retrieval of sensory and motor patterns characteristic of autonomous systems. The immediate objectives of the project are centered in studies of the memory itself and in the use of the memory to solve problems in speech, vision, and robotics. Investigation of methods for encoding sensory data is an important part of the research. Examples of NASA missions that may benefit from this work are Space Station, planetary rovers, and solar exploration. Sparse distributed memory offers promising technology for systems that must learn through experience and be capable of adapting to new circumstances, and for operating any large complex system requiring automatic monitoring and control. Sparse distributed memory is a massively parallel architecture motivated by efforts to understand how the human brain works. Sparse distributed memory is an associative memory, able to retrieve information from cues that only partially match patterns stored in the memory. It is able to store long temporal sequences derived from the behavior of a complex system, such as progressive records of the system's sensory data and correlated records of the system's motor controls.

An Improved Sparse Representation over Learned Dictionary Method for Seizure Detection.

Science.gov (United States)

Li, Junhui; Zhou, Weidong; Yuan, Shasha; Zhang, Yanli; Li, Chengcheng; Wu, Qi

2016-02-01

Automatic seizure detection has played an important role in the monitoring, diagnosis and treatment of epilepsy. In this paper, a patient specific method is proposed for seizure detection in the long-term intracranial electroencephalogram (EEG) recordings. This seizure detection method is based on sparse representation with online dictionary learning and elastic net constraint. The online learned dictionary could sparsely represent the testing samples more accurately, and the elastic net constraint which combines the 11-norm and 12-norm not only makes the coefficients sparse but also avoids over-fitting problem. First, the EEG signals are preprocessed using wavelet filtering and differential filtering, and the kernel function is applied to make the samples closer to linearly separable. Then the dictionaries of seizure and nonseizure are respectively learned from original ictal and interictal training samples with online dictionary optimization algorithm to compose the training dictionary. After that, the test samples are sparsely coded over the learned dictionary and the residuals associated with ictal and interictal sub-dictionary are calculated, respectively. Eventually, the test samples are classified as two distinct categories, seizure or nonseizure, by comparing the reconstructed residuals. The average segment-based sensitivity of 95.45%, specificity of 99.08%, and event-based sensitivity of 94.44% with false detection rate of 0.23/h and average latency of -5.14 s have been achieved with our proposed method.

In-place sparse suffix sorting

DEFF Research Database (Denmark)

Prezza, Nicola

2018-01-01

information regarding the lexicographical order of a size-b subset of all n text suffixes is often needed. Such information can be stored space-efficiently (in b words) in the sparse suffix array (SSA). The SSA and its relative sparse LCP array (SLCP) can be used as a space-efficient substitute of the sparse...... suffix tree. Very recently, Gawrychowski and Kociumaka [11] showed that the sparse suffix tree (and therefore SSA and SLCP) can be built in asymptotically optimal O(b) space with a Monte Carlo algorithm running in O(n) time. The main reason for using the SSA and SLCP arrays in place of the sparse suffix...... tree is, however, their reduced space of b words each. This leads naturally to the quest for in-place algorithms building these arrays. Franceschini and Muthukrishnan [8] showed that the full suffix array can be built in-place and in optimal running time. On the other hand, finding sub-quadratic in...

Classification of multispectral or hyperspectral satellite imagery using clustering of sparse approximations on sparse representations in learned dictionaries obtained using efficient convolutional sparse coding

Science.gov (United States)

Moody, Daniela; Wohlberg, Brendt

2018-01-02

An approach for land cover classification, seasonal and yearly change detection and monitoring, and identification of changes in man-made features may use a clustering of sparse approximations (CoSA) on sparse representations in learned dictionaries. The learned dictionaries may be derived using efficient convolutional sparse coding to build multispectral or hyperspectral, multiresolution dictionaries that are adapted to regional satellite image data. Sparse image representations of images over the learned dictionaries may be used to perform unsupervised k-means clustering into land cover categories. The clustering process behaves as a classifier in detecting real variability. This approach may combine spectral and spatial textural characteristics to detect geologic, vegetative, hydrologic, and man-made features, as well as changes in these features over time.

Sparse estimation of model-based diffuse thermal dust emission

Science.gov (United States)

Irfan, Melis O.; Bobin, Jérôme

2018-03-01

Component separation for the Planck High Frequency Instrument (HFI) data is primarily concerned with the estimation of thermal dust emission, which requires the separation of thermal dust from the cosmic infrared background (CIB). For that purpose, current estimation methods rely on filtering techniques to decouple thermal dust emission from CIB anisotropies, which tend to yield a smooth, low-resolution, estimation of the dust emission. In this paper, we present a new parameter estimation method, premise: Parameter Recovery Exploiting Model Informed Sparse Estimates. This method exploits the sparse nature of thermal dust emission to calculate all-sky maps of thermal dust temperature, spectral index, and optical depth at 353 GHz. premise is evaluated and validated on full-sky simulated data. We find the percentage difference between the premise results and the true values to be 2.8, 5.7, and 7.2 per cent at the 1σ level across the full sky for thermal dust temperature, spectral index, and optical depth at 353 GHz, respectively. A comparison between premise and a GNILC-like method over selected regions of our sky simulation reveals that both methods perform comparably within high signal-to-noise regions. However, outside of the Galactic plane, premise is seen to outperform the GNILC-like method with increasing success as the signal-to-noise ratio worsens.

Permuting sparse rectangular matrices into block-diagonal form

Energy Technology Data Exchange (ETDEWEB)

Aykanat, Cevdet; Pinar, Ali; Catalyurek, Umit V.

2002-12-09

This work investigates the problem of permuting a sparse rectangular matrix into block diagonal form. Block diagonal form of a matrix grants an inherent parallelism for the solution of the deriving problem, as recently investigated in the context of mathematical programming, LU factorization and QR factorization. We propose graph and hypergraph models to represent the nonzero structure of a matrix, which reduce the permutation problem to those of graph partitioning by vertex separator and hypergraph partitioning, respectively. Besides proposing the models to represent sparse matrices and investigating related combinatorial problems, we provide a detailed survey of relevant literature to bridge the gap between different societies, investigate existing techniques for partitioning and propose new ones, and finally present a thorough empirical study of these techniques. Our experiments on a wide range of matrices, using state-of-the-art graph and hypergraph partitioning tools MeTiS and PaT oH, revealed that the proposed methods yield very effective solutions both in terms of solution quality and run time.

Discrete Sparse Coding.

Science.gov (United States)

Exarchakis, Georgios; Lücke, Jörg

2017-11-01

Sparse coding algorithms with continuous latent variables have been the subject of a large number of studies. However, discrete latent spaces for sparse coding have been largely ignored. In this work, we study sparse coding with latents described by discrete instead of continuous prior distributions. We consider the general case in which the latents (while being sparse) can take on any value of a finite set of possible values and in which we learn the prior probability of any value from data. This approach can be applied to any data generated by discrete causes, and it can be applied as an approximation of continuous causes. As the prior probabilities are learned, the approach then allows for estimating the prior shape without assuming specific functional forms. To efficiently train the parameters of our probabilistic generative model, we apply a truncated expectation-maximization approach (expectation truncation) that we modify to work with a general discrete prior. We evaluate the performance of the algorithm by applying it to a variety of tasks: (1) we use artificial data to verify that the algorithm can recover the generating parameters from a random initialization, (2) use image patches of natural images and discuss the role of the prior for the extraction of image components, (3) use extracellular recordings of neurons to present a novel method of analysis for spiking neurons that includes an intuitive discretization strategy, and (4) apply the algorithm on the task of encoding audio waveforms of human speech. The diverse set of numerical experiments presented in this letter suggests that discrete sparse coding algorithms can scale efficiently to work with realistic data sets and provide novel statistical quantities to describe the structure of the data.

Low Complexity Submatrix Divided MMSE Sparse-SQRD Detection for MIMO-OFDM with ESPAR Antenna Receiver

Directory of Open Access Journals (Sweden)

Diego Javier Reinoso Chisaguano

2013-01-01

Full Text Available Multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM with an electronically steerable passive array radiator (ESPAR antenna receiver can improve the bit error rate performance and obtains additional diversity gain without increasing the number of Radio Frequency (RF front-end circuits. However, due to the large size of the channel matrix, the computational cost required for the detection process using Vertical-Bell Laboratories Layered Space-Time (V-BLAST detection is too high to be implemented. Using the minimum mean square error sparse-sorted QR decomposition (MMSE sparse-SQRD algorithm for the detection process the average computational cost can be considerably reduced but is still higher compared with a conventional MIMOOFDM system without ESPAR antenna receiver. In this paper, we propose to use a low complexity submatrix divided MMSE sparse-SQRD algorithm for the detection process of MIMOOFDM with ESPAR antenna receiver. The computational cost analysis and simulation results show that on average the proposed scheme can further reduce the computational cost and achieve a complexity comparable to the conventional MIMO-OFDM detection schemes.

Apparatus for diffusion separation

International Nuclear Information System (INIS)

Nierenberg, W.A.

1976-01-01

A diffuser separator apparatus is described which comprises a plurality of flow channels in a single stage. Each of said channels has an inlet port and an outlet port and a constant cross sectional area between said ports. At least a portion of the defining surface of each of said channels is a diffusion separation membrane, and each of said channels is a different cross sectional area. Means are provided for connecting said channels in series so that each successive channel of said series has a smaller cross sectional area than the previous channel of said series. Also provided are a source of gaseous mixture, individual means for flowing said gaseous mixture to the inlet port of each of said channels, gas receiving and analyzing means, individual means for flowing gas passing from each of said outlet ports and means for flowing gas passing through said membranes to said receiving and analyzing means, and individual means for connecting the outlet port of each channel with the inlet port of the channel having the next smaller cross sectional area

Solving Sparse Polynomial Optimization Problems with Chordal Structure Using the Sparse, Bounded-Degree Sum-of-Squares Hierarchy

NARCIS (Netherlands)

Marandi, Ahmadreza; de Klerk, Etienne; Dahl, Joachim

The sparse bounded degree sum-of-squares (sparse-BSOS) hierarchy of Weisser, Lasserre and Toh [arXiv:1607.01151,2016] constructs a sequence of lower bounds for a sparse polynomial optimization problem. Under some assumptions, it is proven by the authors that the sequence converges to the optimal

Underdetermined Blind Source Separation in Echoic Environments Using DESPRIT

Directory of Open Access Journals (Sweden)

Melia Thomas

2007-01-01

Full Text Available The DUET blind source separation algorithm can demix an arbitrary number of speech signals using anechoic mixtures of the signals. DUET however is limited in that it relies upon source signals which are mixed in an anechoic environment and which are sufficiently sparse such that it is assumed that only one source is active at a given time frequency point. The DUET-ESPRIT (DESPRIT blind source separation algorithm extends DUET to situations where sparsely echoic mixtures of an arbitrary number of sources overlap in time frequency. This paper outlines the development of the DESPRIT method and demonstrates its properties through various experiments conducted on synthetic and real world mixtures.

Parallelized preconditioned BiCGStab solution of sparse linear system equations in F-COBRA-TF

International Nuclear Information System (INIS)

Geemert, Rene van; Glück, Markus; Riedmann, Michael; Gabriel, Harry

2011-01-01

Recently, the in-house development of a preconditioned and parallelized BiCGStab solver has been pursued successfully in AREVA’s advanced sub-channel code F-COBRA-TF. This solver can be run either in a sequential computation mode on a single CPU, or in a parallel computation mode on multiple parallel CPUs. The developed procedure enables the computation of several thousands of successive sparse linear system solutions in F-COBRA-TF with acceptable wall clock run times. The current paper provides general information about F-COBRA-TF in terms of modeling capabilities and application areas, and points out where the relevance arises for the efficient iterative solution of sparse linear systems. Furthermore, the preconditioning and parallelization strategies in the developed BiCGStab iterative solution approach are discussed. The paper is concluded with a number of verification examples. (author)

Axisymmetrical separator for separating particulate matter from a fluid carrying medium

Science.gov (United States)

Linhardt, Hans D.

1984-09-04

A separator for separating particles carried in a fluid carrying medium is disclosed. The separator includes an elongated duct and associated openings incorporated in a solid body. The duct is axisymmetrical relative to its longitudinal axis, and includes a curved wall portion having a curved cross-section taken along the longitudinal axis. An axisymmetrical opening located downstream of the curved wall portion leads from the duct into an axisymmetrical channel which is substantially radially disposed relative to the longitudinal axis. Continuation of the duct downstream of the opening is a discharge portion which is substantially colinear with the longitudinal axis. In operation, a substantial majority of the fluid carrying medium leaves the duct radially through the opening and channel in a state substantially free of particles. A remaining small portion of the fluid carrying medium and a substantial majority of the particles are channelled into the discharge portion by centrifugal forces arising due to travel of the particles along the curved walls. For industrial scale separation of particles from a fluid carrying medium, such as for the clean-up of stack gases, an array of several hundred to several thousand of the separators is provided.

When sparse coding meets ranking: a joint framework for learning sparse codes and ranking scores

KAUST Repository

Wang, Jim Jing-Yan; Cui, Xuefeng; Yu, Ge; Guo, Lili; Gao, Xin

2017-01-01

Sparse coding, which represents a data point as a sparse reconstruction code with regard to a dictionary, has been a popular data representation method. Meanwhile, in database retrieval problems, learning the ranking scores from data points plays

Sparse Image Reconstruction in Computed Tomography

DEFF Research Database (Denmark)

Jørgensen, Jakob Sauer

In recent years, increased focus on the potentially harmful effects of x-ray computed tomography (CT) scans, such as radiation-induced cancer, has motivated research on new low-dose imaging techniques. Sparse image reconstruction methods, as studied for instance in the field of compressed sensing...... applications. This thesis takes a systematic approach toward establishing quantitative understanding of conditions for sparse reconstruction to work well in CT. A general framework for analyzing sparse reconstruction methods in CT is introduced and two sets of computational tools are proposed: 1...... contributions to a general set of computational characterization tools. Thus, the thesis contributions help advance sparse reconstruction methods toward routine use in...

Sparse Regression by Projection and Sparse Discriminant Analysis

KAUST Repository

Qi, Xin; Luo, Ruiyan; Carroll, Raymond J.; Zhao, Hongyu

2015-01-01

predictions. We introduce a new framework, regression by projection, and its sparse version to analyze high-dimensional data. The unique nature of this framework is that the directions of the regression coefficients are inferred first, and the lengths

Visible-light-driven TiO2/Ag3PO4/GO heterostructure photocatalyst with dual-channel for photo-generated charges separation

International Nuclear Information System (INIS)

Lu, Bingqing; Ma, Ni; Wang, Yaping; Qiu, Yiwei; Hu, Haihua; Zhao, Jiahuan; Liang, Dayu; Xu, Sheng; Li, Xiaoyun; Zhu, Zhiyan; Cui, Can

2015-01-01

Highlights: • TiO 2 /Ag 3 PO 4 /GO was synthesized with a facile two-step method. • TiO 2 /Ag 3 PO 4 /GO exhibit superior photocatalytic activity and stability. • TiO 2 /Ag 3 PO 4 /GO has dual-channel for photo-generated charges separation. • TiO 2 /Ag 3 PO 4 /GO composite reduces the consumption of Ag. - Abstract: A novel triple-component TiO 2 /Ag 3 PO 4 /graphene oxide (TiO 2 /Ag 3 PO 4 /GO) photocatalyst with dual channels for photo-generated charges separation has been synthesized to improve the photocatalytic activity and stability of Ag 3 PO 4 under visible light. The synthesis involved in-situ growth of Ag 3 PO 4 nanoparticles on GO sheets to form Ag 3 PO 4 /GO, and then deposited TiO 2 nanocrystals on the surface of Ag 3 PO 4 by hydrolysis of Ti(SO 4 ) 2 at low-temperature hydrothermal condition. The TiO 2 /Ag 3 PO 4 /GO exhibited superior photocatalytic activity and stability to bare Ag 3 PO 4 , TiO 2 /Ag 3 PO 4 and Ag 3 PO 4 /GO in degradation of Rhodamine B and phenol solutions under visible light. It is suggested that the photo-generated electrons in the conduction band of Ag 3 PO 4 can be quickly transferred to GO, while the holes in the valence band of Ag 3 PO 4 can be transferred to the valence band of TiO 2 . The dual transfer channels at the interfaces of TiO 2 /Ag 3 PO 4 /GO result in effective charges separation, leading to enhanced photocatalytic activity and stability. Furthermore, the content of noble metal Ag significantly reduces from 77 wt% in bare Ag 3 PO 4 to 55 wt% in the nanocomposite. The concept of establishing dual channels for charges separation in a triple-component heterostructure provides a promising way to develop photocatalysts with high efficiency

A dual-channel gas chromatography method for the quantitation of low and high concentrations of NF3 and CF4 to study membrane separation of the two compounds.

Science.gov (United States)

Branken, D J; le Roux, J P; Krieg, H M; Lachmann, G

2013-09-13

A dual-channel gas chromatographic method is described in this paper that can be conveniently used for quantitation of NF3/CF4 mixtures with a thermal conductivity detector (TCD) on one channel for the quantitation of high-concentrations, and a pulsed discharge helium ionization detector (PDHID) on a second channel for the quantitation of low concentrations. It is shown that adequate separation is achieved on both channels with this dual single-column setup in which column switching as used for NF3/CF4 analysis in industrial chromatographic methods are not required, thus yielding an effective analysis method for laboratory-scale investigations. In addition, the use of packed columns with purified divinylbenzene-styrene co-polymers as the sole stationary phase yields satisfactory resolution between NF3 and CF4 at isothermal conditions of 30°C, with elution times of less than 8min on the TCD channel and less than 4min on the PDHID channel. Consequently, this method allows for reliable, straight-forward quantitation of NF3/CF4 mixtures, which is necessary when studying the commercially important problem of NF3 and CF4 separation by different methods. Therefore, the applicability of the method to studying membrane separation of NF3 and CF4 is briefly discussed and illustrated, for which the dual-channel setup is especially beneficial. Copyright © 2013 Elsevier B.V. All rights reserved.

Sparse decompositions in 'incoherent' dictionaries

DEFF Research Database (Denmark)

Gribonval, R.; Nielsen, Morten

2003-01-01

a unique sparse representation in such a dictionary. In particular, it is proved that the result of Donoho and Huo, concerning the replacement of a combinatorial optimization problem with a linear programming problem when searching for sparse representations, has an analog for dictionaries that may...

Isotachophoresis system having larger-diameter channels flowing into channels with reduced diameter and with selectable counter-flow

Energy Technology Data Exchange (ETDEWEB)

Mariella, Jr., Raymond P.

2018-03-06

An isotachophoresis system for separating a sample containing particles into discrete packets including a flow channel, the flow channel having a large diameter section and a small diameter section; a negative electrode operably connected to the flow channel; a positive electrode operably connected to the flow channel; a leading carrier fluid in the flow channel; a trailing carrier fluid in the flow channel; and a control for separating the particles in the sample into discrete packets using the leading carrier fluid, the trailing carrier fluid, the large diameter section, and the small diameter section.

A fast sparse reconstruction algorithm for electrical tomography

International Nuclear Information System (INIS)

Zhao, Jia; Xu, Yanbin; Tan, Chao; Dong, Feng

2014-01-01

Electrical tomography (ET) has been widely investigated due to its advantages of being non-radiative, low-cost and high-speed. However, the image reconstruction of ET is a nonlinear and ill-posed inverse problem and the imaging results are easily affected by measurement noise. A sparse reconstruction algorithm based on L 1 regularization is robust to noise and consequently provides a high quality of reconstructed images. In this paper, a sparse reconstruction by separable approximation algorithm (SpaRSA) is extended to solve the ET inverse problem. The algorithm is competitive with the fastest state-of-the-art algorithms in solving the standard L 2 −L 1 problem. However, it is computationally expensive when the dimension of the matrix is large. To further improve the calculation speed of solving inverse problems, a projection method based on the Krylov subspace is employed and combined with the SpaRSA algorithm. The proposed algorithm is tested with image reconstruction of electrical resistance tomography (ERT). Both simulation and experimental results demonstrate that the proposed method can reduce the computational time and improve the noise robustness for the image reconstruction. (paper)

Data analysis in high-dimensional sparse spaces

DEFF Research Database (Denmark)

Clemmensen, Line Katrine Harder

classification techniques for high-dimensional problems are presented: Sparse discriminant analysis, sparse mixture discriminant analysis and orthogonality constrained support vector machines. The first two introduces sparseness to the well known linear and mixture discriminant analysis and thereby provide low...... are applied to classifications of fish species, ear canal impressions used in the hearing aid industry, microbiological fungi species, and various cancerous tissues and healthy tissues. In addition, novel applications of sparse regressions (also called the elastic net) to the medical, concrete, and food...

A sparse-grid isogeometric solver

KAUST Repository

Beck, Joakim; Sangalli, Giancarlo; Tamellini, Lorenzo

2018-01-01

Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90’s in the context of the approximation of high-dimensional PDEs.The tests that we report show that, in accordance to the literature, a sparse-grid construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.

A sparse-grid isogeometric solver

KAUST Repository

Beck, Joakim

2018-02-28

Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90’s in the context of the approximation of high-dimensional PDEs.The tests that we report show that, in accordance to the literature, a sparse-grid construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.

Supervised Transfer Sparse Coding

KAUST Repository

Al-Shedivat, Maruan

2014-07-27

A combination of the sparse coding and transfer learn- ing techniques was shown to be accurate and robust in classification tasks where training and testing objects have a shared feature space but are sampled from differ- ent underlying distributions, i.e., belong to different do- mains. The key assumption in such case is that in spite of the domain disparity, samples from different domains share some common hidden factors. Previous methods often assumed that all the objects in the target domain are unlabeled, and thus the training set solely comprised objects from the source domain. However, in real world applications, the target domain often has some labeled objects, or one can always manually label a small num- ber of them. In this paper, we explore such possibil- ity and show how a small number of labeled data in the target domain can significantly leverage classifica- tion accuracy of the state-of-the-art transfer sparse cod- ing methods. We further propose a unified framework named supervised transfer sparse coding (STSC) which simultaneously optimizes sparse representation, domain transfer and classification. Experimental results on three applications demonstrate that a little manual labeling and then learning the model in a supervised fashion can significantly improve classification accuracy.

A Fast Gradient Method for Nonnegative Sparse Regression With Self-Dictionary

Science.gov (United States)

Gillis, Nicolas; Luce, Robert

2018-01-01

A nonnegative matrix factorization (NMF) can be computed efficiently under the separability assumption, which asserts that all the columns of the given input data matrix belong to the cone generated by a (small) subset of them. The provably most robust methods to identify these conic basis columns are based on nonnegative sparse regression and self dictionaries, and require the solution of large-scale convex optimization problems. In this paper we study a particular nonnegative sparse regression model with self dictionary. As opposed to previously proposed models, this model yields a smooth optimization problem where the sparsity is enforced through linear constraints. We show that the Euclidean projection on the polyhedron defined by these constraints can be computed efficiently, and propose a fast gradient method to solve our model. We compare our algorithm with several state-of-the-art methods on synthetic data sets and real-world hyperspectral images.

Joint Group Sparse PCA for Compressed Hyperspectral Imaging.

Science.gov (United States)

Khan, Zohaib; Shafait, Faisal; Mian, Ajmal

2015-12-01

A sparse principal component analysis (PCA) seeks a sparse linear combination of input features (variables), so that the derived features still explain most of the variations in the data. A group sparse PCA introduces structural constraints on the features in seeking such a linear combination. Collectively, the derived principal components may still require measuring all the input features. We present a joint group sparse PCA (JGSPCA) algorithm, which forces the basic coefficients corresponding to a group of features to be jointly sparse. Joint sparsity ensures that the complete basis involves only a sparse set of input features, whereas the group sparsity ensures that the structural integrity of the features is maximally preserved. We evaluate the JGSPCA algorithm on the problems of compressed hyperspectral imaging and face recognition. Compressed sensing results show that the proposed method consistently outperforms sparse PCA and group sparse PCA in reconstructing the hyperspectral scenes of natural and man-made objects. The efficacy of the proposed compressed sensing method is further demonstrated in band selection for face recognition.

Integrated acoustic and magnetic separation in microfluidic channels

DEFF Research Database (Denmark)

Adams, Jonathan; Thevoz, Patrick; Bruus, Henrik

2009-01-01

With a growing number of cell-based biotechnological applications, there is a need for particle separation systems capable of multiparameter separations at high purity and throughput, beyond what is presently offered by traditional methods including fluorescence activated cell sorting and column......-based magnetic separation. Toward this aim, we report on the integration of microfluidic acoustic and magnetic separation in a monolithic device for multiparameter particle separation. Using our device, we demonstrate high-purity separation of a multicomponent particle mixture at a throughput of up to 10...

Parallel Sparse Matrix - Vector Product

DEFF Research Database (Denmark)

Alexandersen, Joe; Lazarov, Boyan Stefanov; Dammann, Bernd

This technical report contains a case study of a sparse matrix-vector product routine, implemented for parallel execution on a compute cluster with both pure MPI and hybrid MPI-OpenMP solutions. C++ classes for sparse data types were developed and the report shows how these class can be used...

Multi-threaded Sparse Matrix Sparse Matrix Multiplication for Many-Core and GPU Architectures.

Energy Technology Data Exchange (ETDEWEB)

Deveci, Mehmet [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Trott, Christian Robert [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Rajamanickam, Sivasankaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2018-01-01

Sparse Matrix-Matrix multiplication is a key kernel that has applications in several domains such as scientific computing and graph analysis. Several algorithms have been studied in the past for this foundational kernel. In this paper, we develop parallel algorithms for sparse matrix- matrix multiplication with a focus on performance portability across different high performance computing architectures. The performance of these algorithms depend on the data structures used in them. We compare different types of accumulators in these algorithms and demonstrate the performance difference between these data structures. Furthermore, we develop a meta-algorithm, kkSpGEMM, to choose the right algorithm and data structure based on the characteristics of the problem. We show performance comparisons on three architectures and demonstrate the need for the community to develop two phase sparse matrix-matrix multiplication implementations for efficient reuse of the data structures involved.

Channel separation using the transversity parameter in the pi /sup +/n to p pi /sup +/ pi /sup -/ reaction at 9 GeV/c

CERN Document Server

Armenise, N

1978-01-01

To solve the problem of separating competitive channels in a multiparticle final state the use of a parameter, called A(*), measuring the 'event transversity' has been suggested. The A parameter is found to be as powerful as prism plot analysis in separating different channels and economic with respect to the computer time. The transversity method is applied to the three-body reaction p/sup +/n to p pi /sup +/ pi /sup -/ at 9 TeV/c selected in pi /sup +/d interactions obtained in 2m-DBC exposed at CERN-PS. The main contributions in the final state are rho /sup 0/, f, g/sup 0/ (a dipion mass resonance) resonance production and neutron diffraction dissociation. (5 refs).

An Effective Channel Allocation Scheme to Reduce Co-Channel and Adjacent Channel Interference for WMN Backhaul

International Nuclear Information System (INIS)

Abbasi, S.; Ismaili, I.A.; Khuhawar, F.Y.

2016-01-01

Two folded work presents channel allocation scheme sustaining channel orthogonality and channel spacing to reduce CCI (Co-Channel Interference) and ACI (Adjacent Channel Interference) for inter flow of an intra-flow link. Proposed scheme as a part of radio resource allocation is applied on infrastructure based backhaul of wireless mesh network using directional antennas. The proposed approach is applied separately on 2.4 and 5GHz bands. Interference of connectivity graph is modelled by strongly connected directed graph and greedy algorithms are used for channel allocation. We have used OPNET Modeller suite to simulate network models for this research. The proposed arrangement reduces the channel interference and increases system throughput. In this research, the influence of channel is computed in terms of network throughput and delay. (author)

Sparse approximation with bases

CERN Document Server

2015-01-01

This book systematically presents recent fundamental results on greedy approximation with respect to bases. Motivated by numerous applications, the last decade has seen great successes in studying nonlinear sparse approximation. Recent findings have established that greedy-type algorithms are suitable methods of nonlinear approximation in both sparse approximation with respect to bases and sparse approximation with respect to redundant systems. These insights, combined with some previous fundamental results, form the basis for constructing the theory of greedy approximation. Taking into account the theoretical and practical demand for this kind of theory, the book systematically elaborates a theoretical framework for greedy approximation and its applications.  The book addresses the needs of researchers working in numerical mathematics, harmonic analysis, and functional analysis. It quickly takes the reader from classical results to the latest frontier, but is written at the level of a graduate course and do...

Efficient convolutional sparse coding

Science.gov (United States)

Wohlberg, Brendt

2017-06-20

Computationally efficient algorithms may be applied for fast dictionary learning solving the convolutional sparse coding problem in the Fourier domain. More specifically, efficient convolutional sparse coding may be derived within an alternating direction method of multipliers (ADMM) framework that utilizes fast Fourier transforms (FFT) to solve the main linear system in the frequency domain. Such algorithms may enable a significant reduction in computational cost over conventional approaches by implementing a linear solver for the most critical and computationally expensive component of the conventional iterative algorithm. The theoretical computational cost of the algorithm may be reduced from O(M.sup.3N) to O(MN log N), where N is the dimensionality of the data and M is the number of elements in the dictionary. This significant improvement in efficiency may greatly increase the range of problems that can practically be addressed via convolutional sparse representations.

An interactive visualization tool for multi-channel confocal microscopy data in neurobiology research

KAUST Repository

Yong Wan,; Otsuna, H.; Chi-Bin Chien,; Hansen, C.

2009-01-01

; one channel may have dense data, while another has sparse; and there are often structures at several spatial scales: subneuronal domains, neurons, and large groups of neurons (brain regions). Even qualitative analysis can therefore require

Hyperspectral Unmixing with Robust Collaborative Sparse Regression

Directory of Open Access Journals (Sweden)

Chang Li

2016-07-01

Full Text Available Recently, sparse unmixing (SU of hyperspectral data has received particular attention for analyzing remote sensing images. However, most SU methods are based on the commonly admitted linear mixing model (LMM, which ignores the possible nonlinear effects (i.e., nonlinearity. In this paper, we propose a new method named robust collaborative sparse regression (RCSR based on the robust LMM (rLMM for hyperspectral unmixing. The rLMM takes the nonlinearity into consideration, and the nonlinearity is merely treated as outlier, which has the underlying sparse property. The RCSR simultaneously takes the collaborative sparse property of the abundance and sparsely distributed additive property of the outlier into consideration, which can be formed as a robust joint sparse regression problem. The inexact augmented Lagrangian method (IALM is used to optimize the proposed RCSR. The qualitative and quantitative experiments on synthetic datasets and real hyperspectral images demonstrate that the proposed RCSR is efficient for solving the hyperspectral SU problem compared with the other four state-of-the-art algorithms.

Image fusion using sparse overcomplete feature dictionaries

Science.gov (United States)

Brumby, Steven P.; Bettencourt, Luis; Kenyon, Garrett T.; Chartrand, Rick; Wohlberg, Brendt

2015-10-06

Approaches for deciding what individuals in a population of visual system "neurons" are looking for using sparse overcomplete feature dictionaries are provided. A sparse overcomplete feature dictionary may be learned for an image dataset and a local sparse representation of the image dataset may be built using the learned feature dictionary. A local maximum pooling operation may be applied on the local sparse representation to produce a translation-tolerant representation of the image dataset. An object may then be classified and/or clustered within the translation-tolerant representation of the image dataset using a supervised classification algorithm and/or an unsupervised clustering algorithm.

Manifold regularization for sparse unmixing of hyperspectral images.

Science.gov (United States)

Liu, Junmin; Zhang, Chunxia; Zhang, Jiangshe; Li, Huirong; Gao, Yuelin

2016-01-01

Recently, sparse unmixing has been successfully applied to spectral mixture analysis of remotely sensed hyperspectral images. Based on the assumption that the observed image signatures can be expressed in the form of linear combinations of a number of pure spectral signatures known in advance, unmixing of each mixed pixel in the scene is to find an optimal subset of signatures in a very large spectral library, which is cast into the framework of sparse regression. However, traditional sparse regression models, such as collaborative sparse regression , ignore the intrinsic geometric structure in the hyperspectral data. In this paper, we propose a novel model, called manifold regularized collaborative sparse regression , by introducing a manifold regularization to the collaborative sparse regression model. The manifold regularization utilizes a graph Laplacian to incorporate the locally geometrical structure of the hyperspectral data. An algorithm based on alternating direction method of multipliers has been developed for the manifold regularized collaborative sparse regression model. Experimental results on both the simulated and real hyperspectral data sets have demonstrated the effectiveness of our proposed model.

Random mutagenesis screening indicates the absence of a separate H(+)-sensor in the pH-sensitive Kir channels.

Science.gov (United States)

Paynter, Jennifer J; Shang, Lijun; Bollepalli, Murali K; Baukrowitz, Thomas; Tucker, Stephen J

2010-01-01

Several inwardly-rectifying (Kir) potassium channels (Kir1.1, Kir4.1 and Kir4.2) are characterised by their sensitivity to inhibition by intracellular H(+) within the physiological range. The mechanism by which these channels are regulated by intracellular pH has been the subject of intense scrutiny for over a decade, yet the molecular identity of the titratable pH-sensor remains elusive. In this study we have taken advantage of the acidic intracellular environment of S. cerevisiae and used a K(+) -auxotrophic strain to screen for mutants of Kir1.1 with impaired pH-sensitivity. In addition to the previously identified K80M mutation, this unbiased screening approach identified a novel mutation (S172T) in the second transmembrane domain (TM2) that also produces a marked reduction in pH-sensitivity through destabilization of the closed-state. However, despite this extensive mutagenic approach, no mutations could be identified which removed channel pH-sensitivity or which were likely to act as a separate H(+) -sensor unique to the pH-sensitive Kir channels. In order to explain these results we propose a model in which the pH-sensing mechanism is part of an intrinsic gating mechanism common to all Kir channels, not just the pH-sensitive Kir channels. In this model, mutations which disrupt this pH-sensor would result in an increase, not reduction, in pH-sensitivity. This has major implications for any future studies of Kir channel pH-sensitivity and explains why formal identification of these pH-sensing residues still represents a major challenge.

PARTRACK - A particle tracking algorithm for transport and dispersion of solutes in a sparsely fractured rock

International Nuclear Information System (INIS)

Svensson, Urban

2001-04-01

A particle tracking algorithm, PARTRACK, that simulates transport and dispersion in a sparsely fractured rock is described. The main novel feature of the algorithm is the introduction of multiple particle states. It is demonstrated that the introduction of this feature allows for the simultaneous simulation of Taylor dispersion, sorption and matrix diffusion. A number of test cases are used to verify and demonstrate the features of PARTRACK. It is shown that PARTRACK can simulate the following processes, believed to be important for the problem addressed: the split up of a tracer cloud at a fracture intersection, channeling in a fracture plane, Taylor dispersion and matrix diffusion and sorption. From the results of the test cases, it is concluded that PARTRACK is an adequate framework for simulation of transport and dispersion of a solute in a sparsely fractured rock

Enhancing Scalability of Sparse Direct Methods

International Nuclear Information System (INIS)

Li, Xiaoye S.; Demmel, James; Grigori, Laura; Gu, Ming; Xia, Jianlin; Jardin, Steve; Sovinec, Carl; Lee, Lie-Quan

2007-01-01

TOPS is providing high-performance, scalable sparse direct solvers, which have had significant impacts on the SciDAC applications, including fusion simulation (CEMM), accelerator modeling (COMPASS), as well as many other mission-critical applications in DOE and elsewhere. Our recent developments have been focusing on new techniques to overcome scalability bottleneck of direct methods, in both time and memory. These include parallelizing symbolic analysis phase and developing linear-complexity sparse factorization methods. The new techniques will make sparse direct methods more widely usable in large 3D simulations on highly-parallel petascale computers

Regression with Sparse Approximations of Data

DEFF Research Database (Denmark)

Noorzad, Pardis; Sturm, Bob L.

2012-01-01

We propose sparse approximation weighted regression (SPARROW), a method for local estimation of the regression function that uses sparse approximation with a dictionary of measurements. SPARROW estimates the regression function at a point with a linear combination of a few regressands selected...... by a sparse approximation of the point in terms of the regressors. We show SPARROW can be considered a variant of \\(k\\)-nearest neighbors regression (\\(k\\)-NNR), and more generally, local polynomial kernel regression. Unlike \\(k\\)-NNR, however, SPARROW can adapt the number of regressors to use based...

Sparse adaptive filters for echo cancellation

CERN Document Server

Paleologu, Constantin

2011-01-01

Adaptive filters with a large number of coefficients are usually involved in both network and acoustic echo cancellation. Consequently, it is important to improve the convergence rate and tracking of the conventional algorithms used for these applications. This can be achieved by exploiting the sparseness character of the echo paths. Identification of sparse impulse responses was addressed mainly in the last decade with the development of the so-called ``proportionate''-type algorithms. The goal of this book is to present the most important sparse adaptive filters developed for echo cancellati

A new scripting library for modeling flow and transport in fractured rock with channel networks

Science.gov (United States)

Dessirier, Benoît; Tsang, Chin-Fu; Niemi, Auli

2018-02-01

Deep crystalline bedrock formations are targeted to host spent nuclear fuel owing to their overall low permeability. They are however highly heterogeneous and only a few preferential paths pertaining to a small set of dominant rock fractures usually carry most of the flow or mass fluxes, a behavior known as channeling that needs to be accounted for in the performance assessment of repositories. Channel network models have been developed and used to investigate the effect of channeling. They are usually simpler than discrete fracture networks based on rock fracture mappings and rely on idealized full or sparsely populated lattices of channels. This study reexamines the fundamental parameter structure required to describe a channel network in terms of groundwater flow and solute transport, leading to an extended description suitable for unstructured arbitrary networks of channels. An implementation of this formalism in a Python scripting library is presented and released along with this article. A new algebraic multigrid preconditioner delivers a significant speedup in the flow solution step compared to previous channel network codes. 3D visualization is readily available for verification and interpretation of the results by exporting the results to an open and free dedicated software. The new code is applied to three example cases to verify its results on full uncorrelated lattices of channels, sparsely populated percolation lattices and to exemplify the use of unstructured networks to accommodate knowledge on local rock fractures.

Parallel sparse direct solver for integrated circuit simulation

CERN Document Server

Chen, Xiaoming; Yang, Huazhong

2017-01-01

This book describes algorithmic methods and parallelization techniques to design a parallel sparse direct solver which is specifically targeted at integrated circuit simulation problems. The authors describe a complete flow and detailed parallel algorithms of the sparse direct solver. They also show how to improve the performance by simple but effective numerical techniques. The sparse direct solver techniques described can be applied to any SPICE-like integrated circuit simulator and have been proven to be high-performance in actual circuit simulation. Readers will benefit from the state-of-the-art parallel integrated circuit simulation techniques described in this book, especially the latest parallel sparse matrix solution techniques. · Introduces complicated algorithms of sparse linear solvers, using concise principles and simple examples, without complex theory or lengthy derivations; · Describes a parallel sparse direct solver that can be adopted to accelerate any SPICE-like integrated circuit simulato...

Sparse/Low Rank Constrained Reconstruction for Dynamic PET Imaging.

Directory of Open Access Journals (Sweden)

Xingjian Yu

Full Text Available In dynamic Positron Emission Tomography (PET, an estimate of the radio activity concentration is obtained from a series of frames of sinogram data taken at ranging in duration from 10 seconds to minutes under some criteria. So far, all the well-known reconstruction algorithms require known data statistical properties. It limits the speed of data acquisition, besides, it is unable to afford the separated information about the structure and the variation of shape and rate of metabolism which play a major role in improving the visualization of contrast for some requirement of the diagnosing in application. This paper presents a novel low rank-based activity map reconstruction scheme from emission sinograms of dynamic PET, termed as SLCR representing Sparse/Low Rank Constrained Reconstruction for Dynamic PET Imaging. In this method, the stationary background is formulated as a low rank component while variations between successive frames are abstracted to the sparse. The resulting nuclear norm and l1 norm related minimization problem can also be efficiently solved by many recently developed numerical methods. In this paper, the linearized alternating direction method is applied. The effectiveness of the proposed scheme is illustrated on three data sets.

Biclustering via Sparse Singular Value Decomposition

KAUST Repository

Lee, Mihee

2010-02-16

Sparse singular value decomposition (SSVD) is proposed as a new exploratory analysis tool for biclustering or identifying interpretable row-column associations within high-dimensional data matrices. SSVD seeks a low-rank, checkerboard structured matrix approximation to data matrices. The desired checkerboard structure is achieved by forcing both the left- and right-singular vectors to be sparse, that is, having many zero entries. By interpreting singular vectors as regression coefficient vectors for certain linear regressions, sparsity-inducing regularization penalties are imposed to the least squares regression to produce sparse singular vectors. An efficient iterative algorithm is proposed for computing the sparse singular vectors, along with some discussion of penalty parameter selection. A lung cancer microarray dataset and a food nutrition dataset are used to illustrate SSVD as a biclustering method. SSVD is also compared with some existing biclustering methods using simulated datasets. © 2010, The International Biometric Society.

Robust Face Recognition Via Gabor Feature and Sparse Representation

Directory of Open Access Journals (Sweden)

Hao Yu-Juan

2016-01-01

Full Text Available Sparse representation based on compressed sensing theory has been widely used in the field of face recognition, and has achieved good recognition results. but the face feature extraction based on sparse representation is too simple, and the sparse coefficient is not sparse. In this paper, we improve the classification algorithm based on the fusion of sparse representation and Gabor feature, and then improved algorithm for Gabor feature which overcomes the problem of large dimension of the vector dimension, reduces the computation and storage cost, and enhances the robustness of the algorithm to the changes of the environment.The classification efficiency of sparse representation is determined by the collaborative representation,we simplify the sparse constraint based on L1 norm to the least square constraint, which makes the sparse coefficients both positive and reduce the complexity of the algorithm. Experimental results show that the proposed method is robust to illumination, facial expression and pose variations of face recognition, and the recognition rate of the algorithm is improved.

Message-Passing Receiver for OFDM Systems over Highly Delay-Dispersive Channels

DEFF Research Database (Denmark)

Barbu, Oana-Elena; Manchón, Carles Navarro; Rom, Christian

2017-01-01

Propagation channels with maximum excess delay exceeding the duration of the cyclic prefix (CP) in OFDM systems cause intercarrier and intersymbol interference which, unless accounted for, degrade the receiver performance. Using tools from Bayesian inference and sparse signal reconstruction, we...... derive an iterative algorithm that estimates an approximate representation of the channel impulse response and the noise variance, estimates and cancels the intrinsic interference and decodes the data over a block of symbols. Simulation results show that the receiver employing our algorithm outperforms...

Sparse Learning with Stochastic Composite Optimization.

Science.gov (United States)

Zhang, Weizhong; Zhang, Lijun; Jin, Zhongming; Jin, Rong; Cai, Deng; Li, Xuelong; Liang, Ronghua; He, Xiaofei

2017-06-01

In this paper, we study Stochastic Composite Optimization (SCO) for sparse learning that aims to learn a sparse solution from a composite function. Most of the recent SCO algorithms have already reached the optimal expected convergence rate O(1/λT), but they often fail to deliver sparse solutions at the end either due to the limited sparsity regularization during stochastic optimization (SO) or due to the limitation in online-to-batch conversion. Even when the objective function is strongly convex, their high probability bounds can only attain O(√{log(1/δ)/T}) with δ is the failure probability, which is much worse than the expected convergence rate. To address these limitations, we propose a simple yet effective two-phase Stochastic Composite Optimization scheme by adding a novel powerful sparse online-to-batch conversion to the general Stochastic Optimization algorithms. We further develop three concrete algorithms, OptimalSL, LastSL and AverageSL, directly under our scheme to prove the effectiveness of the proposed scheme. Both the theoretical analysis and the experiment results show that our methods can really outperform the existing methods at the ability of sparse learning and at the meantime we can improve the high probability bound to approximately O(log(log(T)/δ)/λT).

Shearlets and Optimally Sparse Approximations

DEFF Research Database (Denmark)

Kutyniok, Gitta; Lemvig, Jakob; Lim, Wang-Q

2012-01-01

Multivariate functions are typically governed by anisotropic features such as edges in images or shock fronts in solutions of transport-dominated equations. One major goal both for the purpose of compression as well as for an efficient analysis is the provision of optimally sparse approximations...... optimally sparse approximations of this model class in 2D as well as 3D. Even more, in contrast to all other directional representation systems, a theory for compactly supported shearlet frames was derived which moreover also satisfy this optimality benchmark. This chapter shall serve as an introduction...... to and a survey about sparse approximations of cartoon-like images by band-limited and also compactly supported shearlet frames as well as a reference for the state-of-the-art of this research field....

Multilevel sparse functional principal component analysis.

Science.gov (United States)

Di, Chongzhi; Crainiceanu, Ciprian M; Jank, Wolfgang S

2014-01-29

We consider analysis of sparsely sampled multilevel functional data, where the basic observational unit is a function and data have a natural hierarchy of basic units. An example is when functions are recorded at multiple visits for each subject. Multilevel functional principal component analysis (MFPCA; Di et al. 2009) was proposed for such data when functions are densely recorded. Here we consider the case when functions are sparsely sampled and may contain only a few observations per function. We exploit the multilevel structure of covariance operators and achieve data reduction by principal component decompositions at both between and within subject levels. We address inherent methodological differences in the sparse sampling context to: 1) estimate the covariance operators; 2) estimate the functional principal component scores; 3) predict the underlying curves. Through simulations the proposed method is able to discover dominating modes of variations and reconstruct underlying curves well even in sparse settings. Our approach is illustrated by two applications, the Sleep Heart Health Study and eBay auctions.

A sparse version of IGA solvers

KAUST Repository

Beck, Joakim; Sangalli, Giancarlo; Tamellini, Lorenzo

2017-01-01

Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90s in the context of the approximation of high-dimensional PDEs. The tests that we report show that, in accordance to the literature, a sparse grids construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.

A sparse version of IGA solvers

KAUST Repository

Beck, Joakim

2017-07-30

Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90s in the context of the approximation of high-dimensional PDEs. The tests that we report show that, in accordance to the literature, a sparse grids construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.

Performance of the LAMPF particle separator

International Nuclear Information System (INIS)

Liska, D.J.; Dauelsberg, L.B.

1977-01-01

The electrostatic beam separator in the EPICS channel at LAMPF is now nearly fully operational. Improvements to the high voltage transmission system and the electronic controls as well as a higher quality channel vacuum have allowed the unit to be operated at its design field strengths. The bias electrode has proven to be useful in reducing ion-exchange currents and associated electrode heating. The detachable shielding and other apparatus for removing the separator from the activated channel was perfected and its application is described

Language Recognition via Sparse Coding

Science.gov (United States)

2016-09-08

explanation is that sparse coding can achieve a near-optimal approximation of much complicated nonlinear relationship through local and piecewise linear...training examples, where x(i) ∈ RN is the ith example in the batch. Optionally, X can be normalized and whitened before sparse coding for better result...normalized input vectors are then ZCA- whitened [20]. Em- pirically, we choose ZCA- whitening over PCA- whitening , and there is no dimensionality reduction

A dual-channel gas chromatography method for the quantitation of low and high concentrations of NF3 and CF4 to study membrane separation of the two compounds

OpenAIRE

Branken, D.J.; Le Roux, J.P.; Krieg, H.M.; Lachmann, G.

2013-01-01

A dual-channel gas chromatographic method is described in this paper that can be conveniently used for quantitation of NF3/CF4 mixtures with a thermal conductivity detector (TCD) on one channel for the quantitation of high-concentrations, and a pulsed discharge helium ionization detector (PDHID) on a second channel for the quantitation of low concentrations. It is shown that adequate separation is achieved on both channels with this dual single-column setup in which column switchi...

Sparse seismic imaging using variable projection

NARCIS (Netherlands)

Aravkin, Aleksandr Y.; Tu, Ning; van Leeuwen, Tristan

2013-01-01

We consider an important class of signal processing problems where the signal of interest is known to be sparse, and can be recovered from data given auxiliary information about how the data was generated. For example, a sparse Green's function may be recovered from seismic experimental data using

Tunable Sparse Network Coding for Multicast Networks

DEFF Research Database (Denmark)

Feizi, Soheil; Roetter, Daniel Enrique Lucani; Sørensen, Chres Wiant

2014-01-01

This paper shows the potential and key enabling mechanisms for tunable sparse network coding, a scheme in which the density of network coded packets varies during a transmission session. At the beginning of a transmission session, sparsely coded packets are transmitted, which benefits decoding...... complexity. At the end of a transmission, when receivers have accumulated degrees of freedom, coding density is increased. We propose a family of tunable sparse network codes (TSNCs) for multicast erasure networks with a controllable trade-off between completion time performance to decoding complexity...... a mechanism to perform efficient Gaussian elimination over sparse matrices going beyond belief propagation but maintaining low decoding complexity. Supporting simulation results are provided showing the trade-off between decoding complexity and completion time....

Performance of Firth-and logF-type penalized methods in risk prediction for small or sparse binary data.

Science.gov (United States)

Rahman, M Shafiqur; Sultana, Mahbuba

2017-02-23

When developing risk models for binary data with small or sparse data sets, the standard maximum likelihood estimation (MLE) based logistic regression faces several problems including biased or infinite estimate of the regression coefficient and frequent convergence failure of the likelihood due to separation. The problem of separation occurs commonly even if sample size is large but there is sufficient number of strong predictors. In the presence of separation, even if one develops the model, it produces overfitted model with poor predictive performance. Firth-and logF-type penalized regression methods are popular alternative to MLE, particularly for solving separation-problem. Despite the attractive advantages, their use in risk prediction is very limited. This paper evaluated these methods in risk prediction in comparison with MLE and other commonly used penalized methods such as ridge. The predictive performance of the methods was evaluated through assessing calibration, discrimination and overall predictive performance using an extensive simulation study. Further an illustration of the methods were provided using a real data example with low prevalence of outcome. The MLE showed poor performance in risk prediction in small or sparse data sets. All penalized methods offered some improvements in calibration, discrimination and overall predictive performance. Although the Firth-and logF-type methods showed almost equal amount of improvement, Firth-type penalization produces some bias in the average predicted probability, and the amount of bias is even larger than that produced by MLE. Of the logF(1,1) and logF(2,2) penalization, logF(2,2) provides slight bias in the estimate of regression coefficient of binary predictor and logF(1,1) performed better in all aspects. Similarly, ridge performed well in discrimination and overall predictive performance but it often produces underfitted model and has high rate of convergence failure (even the rate is higher than that

Sparse PCA with Oracle Property.

Science.gov (United States)

Gu, Quanquan; Wang, Zhaoran; Liu, Han

In this paper, we study the estimation of the k -dimensional sparse principal subspace of covariance matrix Σ in the high-dimensional setting. We aim to recover the oracle principal subspace solution, i.e., the principal subspace estimator obtained assuming the true support is known a priori. To this end, we propose a family of estimators based on the semidefinite relaxation of sparse PCA with novel regularizations. In particular, under a weak assumption on the magnitude of the population projection matrix, one estimator within this family exactly recovers the true support with high probability, has exact rank- k , and attains a [Formula: see text] statistical rate of convergence with s being the subspace sparsity level and n the sample size. Compared to existing support recovery results for sparse PCA, our approach does not hinge on the spiked covariance model or the limited correlation condition. As a complement to the first estimator that enjoys the oracle property, we prove that, another estimator within the family achieves a sharper statistical rate of convergence than the standard semidefinite relaxation of sparse PCA, even when the previous assumption on the magnitude of the projection matrix is violated. We validate the theoretical results by numerical experiments on synthetic datasets.

Structural Sparse Tracking

KAUST Repository

Zhang, Tianzhu; Yang, Ming-Hsuan; Ahuja, Narendra; Ghanem, Bernard; Yan, Shuicheng; Xu, Changsheng; Liu, Si

2015-01-01

candidate. We show that our SST algorithm accommodates most existing sparse trackers with the respective merits. Both qualitative and quantitative evaluations on challenging benchmark image sequences demonstrate that the proposed SST algorithm performs

Technique detection software for Sparse Matrices

Directory of Open Access Journals (Sweden)

KHAN Muhammad Taimoor

2009-12-01

Full Text Available Sparse storage formats are techniques for storing and processing the sparse matrix data efficiently. The performance of these storage formats depend upon the distribution of non-zeros, within the matrix in different dimensions. In order to have better results we need a technique that suits best the organization of data in a particular matrix. So the decision of selecting a better technique is the main step towards improving the system's results otherwise the efficiency can be decreased. The purpose of this research is to help identify the best storage format in case of reduced storage size and high processing efficiency for a sparse matrix.

Sparse Representations of Hyperspectral Images

KAUST Repository

Swanson, Robin J.

2015-11-23

Hyperspectral image data has long been an important tool for many areas of sci- ence. The addition of spectral data yields significant improvements in areas such as object and image classification, chemical and mineral composition detection, and astronomy. Traditional capture methods for hyperspectral data often require each wavelength to be captured individually, or by sacrificing spatial resolution. Recently there have been significant improvements in snapshot hyperspectral captures using, in particular, compressed sensing methods. As we move to a compressed sensing image formation model the need for strong image priors to shape our reconstruction, as well as sparse basis become more important. Here we compare several several methods for representing hyperspectral images including learned three dimensional dictionaries, sparse convolutional coding, and decomposable nonlocal tensor dictionaries. Addi- tionally, we further explore their parameter space to identify which parameters provide the most faithful and sparse representations.

Sparse Representations of Hyperspectral Images

KAUST Repository

Swanson, Robin J.

2015-01-01

Hyperspectral image data has long been an important tool for many areas of sci- ence. The addition of spectral data yields significant improvements in areas such as object and image classification, chemical and mineral composition detection, and astronomy. Traditional capture methods for hyperspectral data often require each wavelength to be captured individually, or by sacrificing spatial resolution. Recently there have been significant improvements in snapshot hyperspectral captures using, in particular, compressed sensing methods. As we move to a compressed sensing image formation model the need for strong image priors to shape our reconstruction, as well as sparse basis become more important. Here we compare several several methods for representing hyperspectral images including learned three dimensional dictionaries, sparse convolutional coding, and decomposable nonlocal tensor dictionaries. Addi- tionally, we further explore their parameter space to identify which parameters provide the most faithful and sparse representations.

Supervised Convolutional Sparse Coding

KAUST Repository

Affara, Lama Ahmed

2018-04-08

Convolutional Sparse Coding (CSC) is a well-established image representation model especially suited for image restoration tasks. In this work, we extend the applicability of this model by proposing a supervised approach to convolutional sparse coding, which aims at learning discriminative dictionaries instead of purely reconstructive ones. We incorporate a supervised regularization term into the traditional unsupervised CSC objective to encourage the final dictionary elements to be discriminative. Experimental results show that using supervised convolutional learning results in two key advantages. First, we learn more semantically relevant filters in the dictionary and second, we achieve improved image reconstruction on unseen data.

Structure-aware Local Sparse Coding for Visual Tracking

KAUST Repository

Qi, Yuankai

2018-01-24

Sparse coding has been applied to visual tracking and related vision problems with demonstrated success in recent years. Existing tracking methods based on local sparse coding sample patches from a target candidate and sparsely encode these using a dictionary consisting of patches sampled from target template images. The discriminative strength of existing methods based on local sparse coding is limited as spatial structure constraints among the template patches are not exploited. To address this problem, we propose a structure-aware local sparse coding algorithm which encodes a target candidate using templates with both global and local sparsity constraints. For robust tracking, we show local regions of a candidate region should be encoded only with the corresponding local regions of the target templates that are the most similar from the global view. Thus, a more precise and discriminative sparse representation is obtained to account for appearance changes. To alleviate the issues with tracking drifts, we design an effective template update scheme. Extensive experiments on challenging image sequences demonstrate the effectiveness of the proposed algorithm against numerous stateof- the-art methods.

Calculation of the inverse data space via sparse inversion

KAUST Repository

Saragiotis, Christos

2011-01-01

The inverse data space provides a natural separation of primaries and surface-related multiples, as the surface multiples map onto the area around the origin while the primaries map elsewhere. However, the calculation of the inverse data is far from trivial as theory requires infinite time and offset recording. Furthermore regularization issues arise during inversion. We perform the inversion by minimizing the least-squares norm of the misfit function by constraining the $ell_1$ norm of the solution, being the inverse data space. In this way a sparse inversion approach is obtained. We show results on field data with an application to surface multiple removal.

Signal Separation of Helicopter Radar Returns Using Wavelet-Based Sparse Signal Optimisation

Science.gov (United States)

2016-10-01

helicopter from the composite radar returns. The received signal consists of returns from the rotating main and tail rotor blades, the helicopter body...is used to separate the main and tail rotor blade components of a helicopter from the composite radar returns. The received signal consists of returns...Two algorithms are presented in the report to separately extract main rotor blade returns and tail rotor blade returns from the composite signal

Wireless Sensor Array Network DoA Estimation from Compressed Array Data via Joint Sparse Representation.

Science.gov (United States)

Yu, Kai; Yin, Ming; Luo, Ji-An; Wang, Yingguan; Bao, Ming; Hu, Yu-Hen; Wang, Zhi

2016-05-23

A compressive sensing joint sparse representation direction of arrival estimation (CSJSR-DoA) approach is proposed for wireless sensor array networks (WSAN). By exploiting the joint spatial and spectral correlations of acoustic sensor array data, the CSJSR-DoA approach provides reliable DoA estimation using randomly-sampled acoustic sensor data. Since random sampling is performed at remote sensor arrays, less data need to be transmitted over lossy wireless channels to the fusion center (FC), and the expensive source coding operation at sensor nodes can be avoided. To investigate the spatial sparsity, an upper bound of the coherence of incoming sensor signals is derived assuming a linear sensor array configuration. This bound provides a theoretical constraint on the angular separation of acoustic sources to ensure the spatial sparsity of the received acoustic sensor array signals. The Cram e ´ r-Rao bound of the CSJSR-DoA estimator that quantifies the theoretical DoA estimation performance is also derived. The potential performance of the CSJSR-DoA approach is validated using both simulations and field experiments on a prototype WSAN platform. Compared to existing compressive sensing-based DoA estimation methods, the CSJSR-DoA approach shows significant performance improvement.

Sparse Frequency Waveform Design for Radar-Embedded Communication

Directory of Open Access Journals (Sweden)

Chaoyun Mai

2016-01-01

Full Text Available According to the Tag application with function of covert communication, a method for sparse frequency waveform design based on radar-embedded communication is proposed. Firstly, sparse frequency waveforms are designed based on power spectral density fitting and quasi-Newton method. Secondly, the eigenvalue decomposition of the sparse frequency waveform sequence is used to get the dominant space. Finally the communication waveforms are designed through the projection of orthogonal pseudorandom vectors in the vertical subspace. Compared with the linear frequency modulation waveform, the sparse frequency waveform can further improve the bandwidth occupation of communication signals, thus achieving higher communication rate. A certain correlation exists between the reciprocally orthogonal communication signals samples and the sparse frequency waveform, which guarantees the low SER (signal error rate and LPI (low probability of intercept. The simulation results verify the effectiveness of this method.

Massive Asynchronous Parallelization of Sparse Matrix Factorizations

Energy Technology Data Exchange (ETDEWEB)

Chow, Edmond [Georgia Inst. of Technology, Atlanta, GA (United States)

2018-01-08

Solving sparse problems is at the core of many DOE computational science applications. We focus on the challenge of developing sparse algorithms that can fully exploit the parallelism in extreme-scale computing systems, in particular systems with massive numbers of cores per node. Our approach is to express a sparse matrix factorization as a large number of bilinear constraint equations, and then solving these equations via an asynchronous iterative method. The unknowns in these equations are the matrix entries of the factorization that is desired.

Role of vascular potassium channels in the regulation of renal hemodynamics

DEFF Research Database (Denmark)

Sørensen, Charlotte Mehlin; Braunstein, Thomas Hartig; von Holstein-Rathlou, Niels-Henrik

2012-01-01

of one or more classes of K+ channels will lead to a change in hemodynamic resistance and therefore of renal blood flow and glomerular filtration pressure. Through these effects, the activity of renal vascular K+ channels influences renal salt and water excretion, fluid homeostasis, and ultimately blood...... pressure. Four main classes of K+ channels [calcium activated (KCa), inward rectifier (Kir), voltage activated (KV), and ATP sensitive (KATP)] are found in the renal vasculature. Several in vitro experiments have suggested a role for individual classes of K+ channels in the regulation of renal vascular...... function. Results from in vivo experiments are sparse. We discuss the role of the different classes of renal vascular K+ channels and their possible role in the integrated function of the renal microvasculature. Since several pathological conditions, among them hypertension, are associated with alterations...

Pilot-based parametric channel estimation algorithm for DCO-OFDM-based visual light communications

Science.gov (United States)

Qian, Xuewen; Deng, Honggui; He, Hailang

2017-10-01

Due to wide modulation bandwidth in optical communication, multipath channels may be non-sparse and deteriorate communication performance heavily. Traditional compressive sensing-based channel estimation algorithm cannot be employed in this kind of situation. In this paper, we propose a practical parametric channel estimation algorithm for orthogonal frequency division multiplexing (OFDM)-based visual light communication (VLC) systems based on modified zero correlation code (ZCC) pair that has the impulse-like correlation property. Simulation results show that the proposed algorithm achieves better performances than existing least squares (LS)-based algorithm in both bit error ratio (BER) and frequency response estimation.

Study on a particle separator using ultrasonic wave

International Nuclear Information System (INIS)

Lee, Young Seop; Kwon, Jae Hwa; Seo, Dae Chul; Yun, Dong Jin

2005-01-01

This paper presents the theory, design and evaluation of a smart device for the enhanced separation of particles mixed in fluid. The smart device takes advantage of the ultrasonic standing wave, which was generated by the operation of a piezoceramic PZT patch installed in the smart device. The details of the device design including the electro-acoustical modelling for separation and PZT transducer are described at the first. Based on this design, the separation device was fabricated and evaluated. In the experiments, an optical camera with a zoom lense was used to monitor the position of interested particles within the separation channel layer in the device. The electric impedance of the PZT patch bonded on the separation device was measured. The device shows a strong levitation and separation force against 50m diameter particles mixed with water at the separation channel in the device. Experimental results also showed that the device can work at both heavy and light sand particles mixed with water due to the generated standing wave field in the separation channel.

Storage of sparse files using parallel log-structured file system

Science.gov (United States)

Bent, John M.; Faibish, Sorin; Grider, Gary; Torres, Aaron

2017-11-07

A sparse file is stored without holes by storing a data portion of the sparse file using a parallel log-structured file system; and generating an index entry for the data portion, the index entry comprising a logical offset, physical offset and length of the data portion. The holes can be restored to the sparse file upon a reading of the sparse file. The data portion can be stored at a logical end of the sparse file. Additional storage efficiency can optionally be achieved by (i) detecting a write pattern for a plurality of the data portions and generating a single patterned index entry for the plurality of the patterned data portions; and/or (ii) storing the patterned index entries for a plurality of the sparse files in a single directory, wherein each entry in the single directory comprises an identifier of a corresponding sparse file.

Sparse reconstruction using distribution agnostic bayesian matching pursuit

KAUST Repository

Masood, Mudassir

2013-11-01

A fast matching pursuit method using a Bayesian approach is introduced for sparse signal recovery. This method performs Bayesian estimates of sparse signals even when the signal prior is non-Gaussian or unknown. It is agnostic on signal statistics and utilizes a priori statistics of additive noise and the sparsity rate of the signal, which are shown to be easily estimated from data if not available. The method utilizes a greedy approach and order-recursive updates of its metrics to find the most dominant sparse supports to determine the approximate minimum mean-square error (MMSE) estimate of the sparse signal. Simulation results demonstrate the power and robustness of our proposed estimator. © 2013 IEEE.

Image understanding using sparse representations

CERN Document Server

Thiagarajan, Jayaraman J; Turaga, Pavan; Spanias, Andreas

2014-01-01

Image understanding has been playing an increasingly crucial role in several inverse problems and computer vision. Sparse models form an important component in image understanding, since they emulate the activity of neural receptors in the primary visual cortex of the human brain. Sparse methods have been utilized in several learning problems because of their ability to provide parsimonious, interpretable, and efficient models. Exploiting the sparsity of natural signals has led to advances in several application areas including image compression, denoising, inpainting, compressed sensing, blin

Sparse inpainting and isotropy

Energy Technology Data Exchange (ETDEWEB)

Feeney, Stephen M.; McEwen, Jason D.; Peiris, Hiranya V. [Department of Physics and Astronomy, University College London, Gower Street, London, WC1E 6BT (United Kingdom); Marinucci, Domenico; Cammarota, Valentina [Department of Mathematics, University of Rome Tor Vergata, via della Ricerca Scientifica 1, Roma, 00133 (Italy); Wandelt, Benjamin D., E-mail: s.feeney@imperial.ac.uk, E-mail: marinucc@axp.mat.uniroma2.it, E-mail: jason.mcewen@ucl.ac.uk, E-mail: h.peiris@ucl.ac.uk, E-mail: wandelt@iap.fr, E-mail: cammarot@axp.mat.uniroma2.it [Kavli Institute for Theoretical Physics, Kohn Hall, University of California, 552 University Road, Santa Barbara, CA, 93106 (United States)

2014-01-01

Sparse inpainting techniques are gaining in popularity as a tool for cosmological data analysis, in particular for handling data which present masked regions and missing observations. We investigate here the relationship between sparse inpainting techniques using the spherical harmonic basis as a dictionary and the isotropy properties of cosmological maps, as for instance those arising from cosmic microwave background (CMB) experiments. In particular, we investigate the possibility that inpainted maps may exhibit anisotropies in the behaviour of higher-order angular polyspectra. We provide analytic computations and simulations of inpainted maps for a Gaussian isotropic model of CMB data, suggesting that the resulting angular trispectrum may exhibit small but non-negligible deviations from isotropy.

Object tracking by occlusion detection via structured sparse learning

KAUST Repository

Zhang, Tianzhu

2013-06-01

Sparse representation based methods have recently drawn much attention in visual tracking due to good performance against illumination variation and occlusion. They assume the errors caused by image variations can be modeled as pixel-wise sparse. However, in many practical scenarios these errors are not truly pixel-wise sparse but rather sparsely distributed in a structured way. In fact, pixels in error constitute contiguous regions within the object\\'s track. This is the case when significant occlusion occurs. To accommodate for non-sparse occlusion in a given frame, we assume that occlusion detected in previous frames can be propagated to the current one. This propagated information determines which pixels will contribute to the sparse representation of the current track. In other words, pixels that were detected as part of an occlusion in the previous frame will be removed from the target representation process. As such, this paper proposes a novel tracking algorithm that models and detects occlusion through structured sparse learning. We test our tracker on challenging benchmark sequences, such as sports videos, which involve heavy occlusion, drastic illumination changes, and large pose variations. Experimental results show that our tracker consistently outperforms the state-of-the-art. © 2013 IEEE.

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...... empirically investigate this dependence for seven distributions and fifteen recovery algorithms. The two morals of this work are: 1) any judgement of the recovery performance of one algorithm over that of another must be prefaced by the conditions for which this is observed to be true, including sparse vector...... 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....

Exhaustive Search for Sparse Variable Selection in Linear Regression

Science.gov (United States)

Igarashi, Yasuhiko; Takenaka, Hikaru; Nakanishi-Ohno, Yoshinori; Uemura, Makoto; Ikeda, Shiro; Okada, Masato

2018-04-01

We propose a K-sparse exhaustive search (ES-K) method and a K-sparse approximate exhaustive search method (AES-K) for selecting variables in linear regression. With these methods, K-sparse combinations of variables are tested exhaustively assuming that the optimal combination of explanatory variables is K-sparse. By collecting the results of exhaustively computing ES-K, various approximate methods for selecting sparse variables can be summarized as density of states. With this density of states, we can compare different methods for selecting sparse variables such as relaxation and sampling. For large problems where the combinatorial explosion of explanatory variables is crucial, the AES-K method enables density of states to be effectively reconstructed by using the replica-exchange Monte Carlo method and the multiple histogram method. Applying the ES-K and AES-K methods to type Ia supernova data, we confirmed the conventional understanding in astronomy when an appropriate K is given beforehand. However, we found the difficulty to determine K from the data. Using virtual measurement and analysis, we argue that this is caused by data shortage.

Secrecy Capacity Analysis over α−μ Fading Channels

KAUST Repository

Lei, Hongjiang

2017-02-15

In this work, we study the secrecy capacity of the classic Wyner’s model over the α − μ fading channels, where α and μ specify the nonlinearity and clustering of fading channels, respectively. The average secrecy capacity (ASC) is derived in closed-form by using the extended generalized bivariate Fox’s Hfunction (EGBFHF). Moreover, the asymptotic analysis of ASC in high signal-to-noise ratio (SNR) regime is conducted. The asymptotic results unveil that the ASC follows the scaling law of Θ(ln p), where p stands for the ratio between the average powers of main channels and eavesdropping channels. Moreover, the ASC can be enhanced by increasing the transmit SNR, while there exists a ceiling of ASC as the SNRs at both sides are improved simultaneously. The accuracy of the analytical results is validated by Monte-Carlo simulations. The numerical results show that rigorous fading channels are beneficial to the secrecy performance, that is, serious nonlinearity (small α) and sparse clustering (small μ) will lead to the improvement of ASC.

Secrecy Capacity Analysis over α−μ Fading Channels

KAUST Repository

Lei, Hongjiang; Ansari, Imran Shafique; Pan, Gaofeng; Alomair, Basel; Alouini, Mohamed-Slim

2017-01-01

In this work, we study the secrecy capacity of the classic Wyner’s model over the α − μ fading channels, where α and μ specify the nonlinearity and clustering of fading channels, respectively. The average secrecy capacity (ASC) is derived in closed-form by using the extended generalized bivariate Fox’s Hfunction (EGBFHF). Moreover, the asymptotic analysis of ASC in high signal-to-noise ratio (SNR) regime is conducted. The asymptotic results unveil that the ASC follows the scaling law of Θ(ln p), where p stands for the ratio between the average powers of main channels and eavesdropping channels. Moreover, the ASC can be enhanced by increasing the transmit SNR, while there exists a ceiling of ASC as the SNRs at both sides are improved simultaneously. The accuracy of the analytical results is validated by Monte-Carlo simulations. The numerical results show that rigorous fading channels are beneficial to the secrecy performance, that is, serious nonlinearity (small α) and sparse clustering (small μ) will lead to the improvement of ASC.

A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems

Czech Academy of Sciences Publication Activity Database

Benzi, M.; Tůma, Miroslav

1998-01-01

Roč. 19, č. 3 (1998), s. 968-994 ISSN 1064-8275 R&D Projects: GA ČR GA201/93/0067; GA AV ČR IAA230401 Keywords : large sparse systems * interative methods * preconditioning * approximate inverse * sparse linear systems * sparse matrices * incomplete factorizations * conjugate gradient -type methods Subject RIV: BA - General Mathematics Impact factor: 1.378, year: 1998

Learning Discriminative Sparse Models for Source Separation and Mapping of Hyperspectral Imagery

Science.gov (United States)

2010-10-01

Ψ λGI  . We solve the coupling using a standard Gauss - Seidel type of iteration (or primal decomposition), where we iteratively solve the problem...This tells us that the MSE is lower bounded by a very slow convergence rate in the number of samples relative to the dimension (b-channels). Thus, we...36] are widely used in the processing of natural images for this task. In this work, we use a Projected Gradient (PG) iteration , where we update the i

Sliding-MOMP Based Channel Estimation Scheme for ISDB-T Systems

Directory of Open Access Journals (Sweden)

Ziji Ma

2016-01-01

Full Text Available Compressive sensing based channel estimation has shown its advantage of accurate reconstruction for sparse signal with less pilots for OFDM systems. However, high computational cost requirement of CS method, due to linear programming, significantly restricts its implementation in practical applications. In this paper, we propose a reduced complexity channel estimation scheme of modified orthogonal matching pursuit with sliding windows for ISDB-T (Integrated Services Digital Broadcasting for Terrestrial system. The proposed scheme can reduce the computational cost by limiting the searching region as well as making effective use of the last estimation result. In addition, adaptive tracking strategy with sliding sampling window can improve the robustness of CS based methods to guarantee its accuracy of channel matrix reconstruction, even for fast time-variant channels. The computer simulation demonstrates its impact on improving bit error rate and computational complexity for ISDB-T system.

Structure-based bayesian sparse reconstruction

KAUST Repository

Quadeer, Ahmed Abdul

2012-12-01

Sparse signal reconstruction algorithms have attracted research attention due to their wide applications in various fields. In this paper, we present a simple Bayesian approach that utilizes the sparsity constraint and a priori statistical information (Gaussian or otherwise) to obtain near optimal estimates. In addition, we make use of the rich structure of the sensing matrix encountered in many signal processing applications to develop a fast sparse recovery algorithm. The computational complexity of the proposed algorithm is very low compared with the widely used convex relaxation methods as well as greedy matching pursuit techniques, especially at high sparsity. © 1991-2012 IEEE.

Sparse Representation Based Binary Hypothesis Model for Hyperspectral Image Classification

Directory of Open Access Journals (Sweden)

Yidong Tang

2016-01-01

Full Text Available The sparse representation based classifier (SRC and its kernel version (KSRC have been employed for hyperspectral image (HSI classification. However, the state-of-the-art SRC often aims at extended surface objects with linear mixture in smooth scene and assumes that the number of classes is given. Considering the small target with complex background, a sparse representation based binary hypothesis (SRBBH model is established in this paper. In this model, a query pixel is represented in two ways, which are, respectively, by background dictionary and by union dictionary. The background dictionary is composed of samples selected from the local dual concentric window centered at the query pixel. Thus, for each pixel the classification issue becomes an adaptive multiclass classification problem, where only the number of desired classes is required. Furthermore, the kernel method is employed to improve the interclass separability. In kernel space, the coding vector is obtained by using kernel-based orthogonal matching pursuit (KOMP algorithm. Then the query pixel can be labeled by the characteristics of the coding vectors. Instead of directly using the reconstruction residuals, the different impacts the background dictionary and union dictionary have on reconstruction are used for validation and classification. It enhances the discrimination and hence improves the performance.

Greedy vs. L1 convex optimization in sparse coding

DEFF Research Database (Denmark)

Ren, Huamin; Pan, Hong; Olsen, Søren Ingvor

2015-01-01

Sparse representation has been applied successfully in many image analysis applications, including abnormal event detection, in which a baseline is to learn a dictionary from the training data and detect anomalies from its sparse codes. During this procedure, sparse codes which can be achieved...... solutions. Considering the property of abnormal event detection, i.e., only normal videos are used as training data due to practical reasons, effective codes in classification application may not perform well in abnormality detection. Therefore, we compare the sparse codes and comprehensively evaluate...... their performance from various aspects to better understand their applicability, including computation time, reconstruction error, sparsity, detection...

A sparse matrix based full-configuration interaction algorithm

International Nuclear Information System (INIS)

Rolik, Zoltan; Szabados, Agnes; Surjan, Peter R.

2008-01-01

We present an algorithm related to the full-configuration interaction (FCI) method that makes complete use of the sparse nature of the coefficient vector representing the many-electron wave function in a determinantal basis. Main achievements of the presented sparse FCI (SFCI) algorithm are (i) development of an iteration procedure that avoids the storage of FCI size vectors; (ii) development of an efficient algorithm to evaluate the effect of the Hamiltonian when both the initial and the product vectors are sparse. As a result of point (i) large disk operations can be skipped which otherwise may be a bottleneck of the procedure. At point (ii) we progress by adopting the implementation of the linear transformation by Olsen et al. [J. Chem Phys. 89, 2185 (1988)] for the sparse case, getting the algorithm applicable to larger systems and faster at the same time. The error of a SFCI calculation depends only on the dropout thresholds for the sparse vectors, and can be tuned by controlling the amount of system memory passed to the procedure. The algorithm permits to perform FCI calculations on single node workstations for systems previously accessible only by supercomputers

Separation of lanthanides using micro solvent extraction system

International Nuclear Information System (INIS)

Nishihama, S.; Tajiri, Y.; Yoshizuka, K.

2006-01-01

A micro solvent extraction system for the separation of lanthanides has been investigated. The micro flow channel is fabricated on a poly(methyl methacrylate) (PMMA) plate, and solvent extraction progresses by feeding aqueous and organic solutions into the channel simultaneously. The extraction equilibrium is quickly achieved, without any mechanical mixing, when a narrow channel (100 μm width and 100 μm depth) is used. The results of solvent extraction from the Pr/Nd and Pr/Sm binary solutions revealed that both lanthanides are firstly extracted together, and then, the lighter lanthanide extracted in the organic solution alternatively exchanges to the heavier one in the aqueous solution to achieve the extraction equilibrium. The phase separation of the aqueous and organic phases after extraction can also be successively achieved by contriving the cross section of the flow channel, and the extractive separation of Pr/Sm is demonstrated. (authors)

An in-depth study of sparse codes on abnormality detection

DEFF Research Database (Denmark)

Ren, Huamin; Pan, Hong; Olsen, Søren Ingvor

2016-01-01

Sparse representation has been applied successfully in abnormal event detection, in which the baseline is to learn a dictionary accompanied by sparse codes. While much emphasis is put on discriminative dictionary construction, there are no comparative studies of sparse codes regarding abnormality...... are carried out from various angles to better understand the applicability of sparse codes, including computation time, reconstruction error, sparsity, detection accuracy, and their performance combining various detection methods. The experiment results show that combining OMP codes with maximum coordinate...

Sparse Principal Component Analysis in Medical Shape Modeling

DEFF Research Database (Denmark)

Sjöstrand, Karl; Stegmann, Mikkel Bille; Larsen, Rasmus

2006-01-01

Principal component analysis (PCA) is a widely used tool in medical image analysis for data reduction, model building, and data understanding and exploration. While PCA is a holistic approach where each new variable is a linear combination of all original variables, sparse PCA (SPCA) aims...... analysis in medicine. Results for three different data sets are given in relation to standard PCA and sparse PCA by simple thresholding of sufficiently small loadings. Focus is on a recent algorithm for computing sparse principal components, but a review of other approaches is supplied as well. The SPCA...

Sparse reconstruction using distribution agnostic bayesian matching pursuit

KAUST Repository

Masood, Mudassir; Al-Naffouri, Tareq Y.

2013-01-01

A fast matching pursuit method using a Bayesian approach is introduced for sparse signal recovery. This method performs Bayesian estimates of sparse signals even when the signal prior is non-Gaussian or unknown. It is agnostic on signal statistics

Statistical model of natural stimuli predicts edge-like pooling of spatial frequency channels in V2

Directory of Open Access Journals (Sweden)

Gutmann Michael

2005-02-01

Full Text Available Abstract Background It has been shown that the classical receptive fields of simple and complex cells in the primary visual cortex emerge from the statistical properties of natural images by forcing the cell responses to be maximally sparse or independent. We investigate how to learn features beyond the primary visual cortex from the statistical properties of modelled complex-cell outputs. In previous work, we showed that a new model, non-negative sparse coding, led to the emergence of features which code for contours of a given spatial frequency band. Results We applied ordinary independent component analysis to modelled outputs of complex cells that span different frequency bands. The analysis led to the emergence of features which pool spatially coherent across-frequency activity in the modelled primary visual cortex. Thus, the statistically optimal way of processing complex-cell outputs abandons separate frequency channels, while preserving and even enhancing orientation tuning and spatial localization. As a technical aside, we found that the non-negativity constraint is not necessary: ordinary independent component analysis produces essentially the same results as our previous work. Conclusion We propose that the pooling that emerges allows the features to code for realistic low-level image features related to step edges. Further, the results prove the viability of statistical modelling of natural images as a framework that produces quantitative predictions of visual processing.

Spatial-Temporal Correlation Properties of the 3GPP Spatial Channel Model and the Kronecker MIMO Channel Model

Directory of Open Access Journals (Sweden)

Cheng-Xiang Wang

2007-02-01

Full Text Available The performance of multiple-input multiple-output (MIMO systems is greatly influenced by the spatial-temporal correlation properties of the underlying MIMO channels. This paper investigates the spatial-temporal correlation characteristics of the spatial channel model (SCM in the Third Generation Partnership Project (3GPP and the Kronecker-based stochastic model (KBSM at three levels, namely, the cluster level, link level, and system level. The KBSM has both the spatial separability and spatial-temporal separability at all the three levels. The spatial-temporal separability is observed for the SCM only at the system level, but not at the cluster and link levels. The SCM shows the spatial separability at the link and system levels, but not at the cluster level since its spatial correlation is related to the joint distribution of the angle of arrival (AoA and angle of departure (AoD. The KBSM with the Gaussian-shaped power azimuth spectrum (PAS is found to fit best the 3GPP SCM in terms of the spatial correlations. Despite its simplicity and analytical tractability, the KBSM is restricted to model only the average spatial-temporal behavior of MIMO channels. The SCM provides more insights of the variations of different MIMO channel realizations, but the implementation complexity is relatively high.

Macrocyclic ligand decorated ordered mesoporous silica with large-pore and short-channel characteristics for effective separation of lithium isotopes: synthesis, adsorptive behavior study and DFT modeling.

Science.gov (United States)

Liu, Yuekun; Liu, Fei; Ye, Gang; Pu, Ning; Wu, Fengcheng; Wang, Zhe; Huo, Xiaomei; Xu, Jian; Chen, Jing

2016-10-18

Effective separation of lithium isotopes is of strategic value which attracts growing attention worldwide. This study reports a new class of macrocyclic ligand decorated ordered mesoporous silica (OMS) with large-pore and short-channel characteristics, which holds the potential to effectively separate lithium isotopes in aqueous solutions. Initially, a series of benzo-15-crown-5 (B15C5) derivatives containing different electron-donating or -withdrawing substituents were synthesized. Extractive separation of lithium isotopes in a liquid-liquid system was comparatively studied, highlighting the effect of the substituent, solvent, counter anion and temperature. The optimal NH 2 -B15C5 ligands were then covalently anchored to a short-channel SBA-15 OMS precursor bearing alkyl halides via a post-modification protocol. Adsorptive separation of the lithium isotopes was fully investigated, combined with kinetics and thermodynamics analysis, and simulation by using classic adsorption isotherm models. The NH 2 -B15C5 ligand functionalized OMSs exhibited selectivity to lithium ions against other alkali metal ions including K(i). Additionally, a more efficient separation of lithium isotopes could be obtained at a lower temperature in systems with softer counter anions and solvents with a lower dielectric constant. The highest value separation factor (α = 1.049 ± 0.002) was obtained in CF 3 COOLi aqueous solution at 288.15 K. Moreover, theoretical computation based on the density functional theory (DFT) was performed to elucidate the complexation interactions between the macrocyclic ligands and lithium ions. A suggested mechanism involving an isotopic exchange equilibrium was proposed to describe the lithium isotope separation by the functionalized OMSs.

User's Manual for PCSMS (Parallel Complex Sparse Matrix Solver). Version 1.

Science.gov (United States)

Reddy, C. J.

2000-01-01

PCSMS (Parallel Complex Sparse Matrix Solver) is a computer code written to make use of the existing real sparse direct solvers to solve complex, sparse matrix linear equations. PCSMS converts complex matrices into real matrices and use real, sparse direct matrix solvers to factor and solve the real matrices. The solution vector is reconverted to complex numbers. Though, this utility is written for Silicon Graphics (SGI) real sparse matrix solution routines, it is general in nature and can be easily modified to work with any real sparse matrix solver. The User's Manual is written to make the user acquainted with the installation and operation of the code. Driver routines are given to aid the users to integrate PCSMS routines in their own codes.

Parallel transposition of sparse data structures

DEFF Research Database (Denmark)

Wang, Hao; Liu, Weifeng; Hou, Kaixi

2016-01-01

Many applications in computational sciences and social sciences exploit sparsity and connectivity of acquired data. Even though many parallel sparse primitives such as sparse matrix-vector (SpMV) multiplication have been extensively studied, some other important building blocks, e.g., parallel tr...... transposition in the latest vendor-supplied library on an Intel multicore CPU platform, and the MergeTrans approach achieves on average of 3.4-fold (up to 11.7-fold) speedup on an Intel Xeon Phi many-core processor....

Numerical solution of large sparse linear systems

International Nuclear Information System (INIS)

Meurant, Gerard; Golub, Gene.

1982-02-01

This note is based on one of the lectures given at the 1980 CEA-EDF-INRIA Numerical Analysis Summer School whose aim is the study of large sparse linear systems. The main topics are solving least squares problems by orthogonal transformation, fast Poisson solvers and solution of sparse linear system by iterative methods with a special emphasis on preconditioned conjuguate gradient method [fr

Sparse Source EEG Imaging with the Variational Garrote

DEFF Research Database (Denmark)

Hansen, Sofie Therese; Stahlhut, Carsten; Hansen, Lars Kai

2013-01-01

EEG imaging, the estimation of the cortical source distribution from scalp electrode measurements, poses an extremely ill-posed inverse problem. Recent work by Delorme et al. (2012) supports the hypothesis that distributed source solutions are sparse. We show that direct search for sparse solutions...

Low-count PET image restoration using sparse representation

Science.gov (United States)

Li, Tao; Jiang, Changhui; Gao, Juan; Yang, Yongfeng; Liang, Dong; Liu, Xin; Zheng, Hairong; Hu, Zhanli

2018-04-01

In the field of positron emission tomography (PET), reconstructed images are often blurry and contain noise. These problems are primarily caused by the low resolution of projection data. Solving this problem by improving hardware is an expensive solution, and therefore, we attempted to develop a solution based on optimizing several related algorithms in both the reconstruction and image post-processing domains. As sparse technology is widely used, sparse prediction is increasingly applied to solve this problem. In this paper, we propose a new sparse method to process low-resolution PET images. Two dictionaries (D1 for low-resolution PET images and D2 for high-resolution PET images) are learned from a group real PET image data sets. Among these two dictionaries, D1 is used to obtain a sparse representation for each patch of the input PET image. Then, a high-resolution PET image is generated from this sparse representation using D2. Experimental results indicate that the proposed method exhibits a stable and superior ability to enhance image resolution and recover image details. Quantitatively, this method achieves better performance than traditional methods. This proposed strategy is a new and efficient approach for improving the quality of PET images.

X-ray computed tomography using curvelet sparse regularization.

Science.gov (United States)

Wieczorek, Matthias; Frikel, Jürgen; Vogel, Jakob; Eggl, Elena; Kopp, Felix; Noël, Peter B; Pfeiffer, Franz; Demaret, Laurent; Lasser, Tobias

2015-04-01

Reconstruction of x-ray computed tomography (CT) data remains a mathematically challenging problem in medical imaging. Complementing the standard analytical reconstruction methods, sparse regularization is growing in importance, as it allows inclusion of prior knowledge. The paper presents a method for sparse regularization based on the curvelet frame for the application to iterative reconstruction in x-ray computed tomography. In this work, the authors present an iterative reconstruction approach based on the alternating direction method of multipliers using curvelet sparse regularization. Evaluation of the method is performed on a specifically crafted numerical phantom dataset to highlight the method's strengths. Additional evaluation is performed on two real datasets from commercial scanners with different noise characteristics, a clinical bone sample acquired in a micro-CT and a human abdomen scanned in a diagnostic CT. The results clearly illustrate that curvelet sparse regularization has characteristic strengths. In particular, it improves the restoration and resolution of highly directional, high contrast features with smooth contrast variations. The authors also compare this approach to the popular technique of total variation and to traditional filtered backprojection. The authors conclude that curvelet sparse regularization is able to improve reconstruction quality by reducing noise while preserving highly directional features.

Long-term morphological developments of river channels separated by a longitudinal training wall

NARCIS (Netherlands)

Le, T.B.; Crosato, A.; Uijttewaal, W.S.J.

2018-01-01

Rivers have been trained for centuries by channel narrowing and straightening. This caused important damages to their ecosystems, particularly around the bank areas. We analyse here the possibility to train rivers in a new way by subdividing their channel in main and ecological channel with a

Sparse dictionary for synthetic transmit aperture medical ultrasound imaging.

Science.gov (United States)

Wang, Ping; Jiang, Jin-Yang; Li, Na; Luo, Han-Wu; Li, Fang; Cui, Shi-Gang

2017-07-01

It is possible to recover a signal below the Nyquist sampling limit using a compressive sensing technique in ultrasound imaging. However, the reconstruction enabled by common sparse transform approaches does not achieve satisfactory results. Considering the ultrasound echo signal's features of attenuation, repetition, and superposition, a sparse dictionary with the emission pulse signal is proposed. Sparse coefficients in the proposed dictionary have high sparsity. Images reconstructed with this dictionary were compared with those obtained with the three other common transforms, namely, discrete Fourier transform, discrete cosine transform, and discrete wavelet transform. The performance of the proposed dictionary was analyzed via a simulation and experimental data. The mean absolute error (MAE) was used to quantify the quality of the reconstructions. Experimental results indicate that the MAE associated with the proposed dictionary was always the smallest, the reconstruction time required was the shortest, and the lateral resolution and contrast of the reconstructed images were also the closest to the original images. The proposed sparse dictionary performed better than the other three sparse transforms. With the same sampling rate, the proposed dictionary achieved excellent reconstruction quality.

A sparse electromagnetic imaging scheme using nonlinear landweber iterations

KAUST Repository

Desmal, Abdulla; Bagci, Hakan

2015-01-01

Development and use of electromagnetic inverse scattering techniques for imagining sparse domains have been on the rise following the recent advancements in solving sparse optimization problems. Existing techniques rely on iteratively converting

Scalable group level probabilistic sparse factor analysis

DEFF Research Database (Denmark)

Hinrich, Jesper Løve; Nielsen, Søren Føns Vind; Riis, Nicolai Andre Brogaard

2017-01-01

Many data-driven approaches exist to extract neural representations of functional magnetic resonance imaging (fMRI) data, but most of them lack a proper probabilistic formulation. We propose a scalable group level probabilistic sparse factor analysis (psFA) allowing spatially sparse maps, component...... pruning using automatic relevance determination (ARD) and subject specific heteroscedastic spatial noise modeling. For task-based and resting state fMRI, we show that the sparsity constraint gives rise to components similar to those obtained by group independent component analysis. The noise modeling...... shows that noise is reduced in areas typically associated with activation by the experimental design. The psFA model identifies sparse components and the probabilistic setting provides a natural way to handle parameter uncertainties. The variational Bayesian framework easily extends to more complex...

Fast wavelet based sparse approximate inverse preconditioner

Energy Technology Data Exchange (ETDEWEB)

Wan, W.L. [Univ. of California, Los Angeles, CA (United States)

1996-12-31

Incomplete LU factorization is a robust preconditioner for both general and PDE problems but unfortunately not easy to parallelize. Recent study of Huckle and Grote and Chow and Saad showed that sparse approximate inverse could be a potential alternative while readily parallelizable. However, for special class of matrix A that comes from elliptic PDE problems, their preconditioners are not optimal in the sense that independent of mesh size. A reason may be that no good sparse approximate inverse exists for the dense inverse matrix. Our observation is that for this kind of matrices, its inverse entries typically have piecewise smooth changes. We can take advantage of this fact and use wavelet compression techniques to construct a better sparse approximate inverse preconditioner. We shall show numerically that our approach is effective for this kind of matrices.

Local posterior concentration rate for multilevel sparse sequences

NARCIS (Netherlands)

Belitser, E.N.; Nurushev, N.

2017-01-01

We consider empirical Bayesian inference in the many normal means model in the situation when the high-dimensional mean vector is multilevel sparse, that is,most of the entries of the parameter vector are some fixed values. For instance, the traditional sparse signal is a particular case (with one

Sparse modeling of spatial environmental variables associated with asthma.

Science.gov (United States)

Chang, Timothy S; Gangnon, Ronald E; David Page, C; Buckingham, William R; Tandias, Aman; Cowan, Kelly J; Tomasallo, Carrie D; Arndt, Brian G; Hanrahan, Lawrence P; Guilbert, Theresa W

2015-02-01

Geographically distributed environmental factors influence the burden of diseases such as asthma. Our objective was to identify sparse environmental variables associated with asthma diagnosis gathered from a large electronic health record (EHR) dataset while controlling for spatial variation. An EHR dataset from the University of Wisconsin's Family Medicine, Internal Medicine and Pediatrics Departments was obtained for 199,220 patients aged 5-50years over a three-year period. Each patient's home address was geocoded to one of 3456 geographic census block groups. Over one thousand block group variables were obtained from a commercial database. We developed a Sparse Spatial Environmental Analysis (SASEA). Using this method, the environmental variables were first dimensionally reduced with sparse principal component analysis. Logistic thin plate regression spline modeling was then used to identify block group variables associated with asthma from sparse principal components. The addresses of patients from the EHR dataset were distributed throughout the majority of Wisconsin's geography. Logistic thin plate regression spline modeling captured spatial variation of asthma. Four sparse principal components identified via model selection consisted of food at home, dog ownership, household size, and disposable income variables. In rural areas, dog ownership and renter occupied housing units from significant sparse principal components were associated with asthma. Our main contribution is the incorporation of sparsity in spatial modeling. SASEA sequentially added sparse principal components to Logistic thin plate regression spline modeling. This method allowed association of geographically distributed environmental factors with asthma using EHR and environmental datasets. SASEA can be applied to other diseases with environmental risk factors. Copyright © 2014 Elsevier Inc. All rights reserved.

Analog system for computing sparse codes

Science.gov (United States)

Rozell, Christopher John; Johnson, Don Herrick; Baraniuk, Richard Gordon; Olshausen, Bruno A.; Ortman, Robert Lowell

2010-08-24

A parallel dynamical system for computing sparse representations of data, i.e., where the data can be fully represented in terms of a small number of non-zero code elements, and for reconstructing compressively sensed images. The system is based on the principles of thresholding and local competition that solves a family of sparse approximation problems corresponding to various sparsity metrics. The system utilizes Locally Competitive Algorithms (LCAs), nodes in a population continually compete with neighboring units using (usually one-way) lateral inhibition to calculate coefficients representing an input in an over complete dictionary.

Efficient Pseudorecursive Evaluation Schemes for Non-adaptive Sparse Grids

KAUST Repository

Buse, Gerrit; Pflü ger, Dirk; Jacob, Riko

2014-01-01

In this work we propose novel algorithms for storing and evaluating sparse grid functions, operating on regular (not spatially adaptive), yet potentially dimensionally adaptive grid types. Besides regular sparse grids our approach includes truncated

Occlusion detection via structured sparse learning for robust object tracking

KAUST Repository

Zhang, Tianzhu

2014-01-01

Sparse representation based methods have recently drawn much attention in visual tracking due to good performance against illumination variation and occlusion. They assume the errors caused by image variations can be modeled as pixel-wise sparse. However, in many practical scenarios, these errors are not truly pixel-wise sparse but rather sparsely distributed in a structured way. In fact, pixels in error constitute contiguous regions within the object’s track. This is the case when significant occlusion occurs. To accommodate for nonsparse occlusion in a given frame, we assume that occlusion detected in previous frames can be propagated to the current one. This propagated information determines which pixels will contribute to the sparse representation of the current track. In other words, pixels that were detected as part of an occlusion in the previous frame will be removed from the target representation process. As such, this paper proposes a novel tracking algorithm that models and detects occlusion through structured sparse learning. We test our tracker on challenging benchmark sequences, such as sports videos, which involve heavy occlusion, drastic illumination changes, and large pose variations. Extensive experimental results show that our proposed tracker consistently outperforms the state-of-the-art trackers.

Sparse Representation Based SAR Vehicle Recognition along with Aspect Angle

Directory of Open Access Journals (Sweden)

Xiangwei Xing

2014-01-01

Full Text Available As a method of representing the test sample with few training samples from an overcomplete dictionary, sparse representation classification (SRC has attracted much attention in synthetic aperture radar (SAR automatic target recognition (ATR recently. In this paper, we develop a novel SAR vehicle recognition method based on sparse representation classification along with aspect information (SRCA, in which the correlation between the vehicle’s aspect angle and the sparse representation vector is exploited. The detailed procedure presented in this paper can be summarized as follows. Initially, the sparse representation vector of a test sample is solved by sparse representation algorithm with a principle component analysis (PCA feature-based dictionary. Then, the coefficient vector is projected onto a sparser one within a certain range of the vehicle’s aspect angle. Finally, the vehicle is classified into a certain category that minimizes the reconstruction error with the novel sparse representation vector. Extensive experiments are conducted on the moving and stationary target acquisition and recognition (MSTAR dataset and the results demonstrate that the proposed method performs robustly under the variations of depression angle and target configurations, as well as incomplete observation.

Learning sparse generative models of audiovisual signals

OpenAIRE

Monaci, Gianluca; Sommer, Friedrich T.; Vandergheynst, Pierre

2008-01-01

This paper presents a novel framework to learn sparse represen- tations for audiovisual signals. An audiovisual signal is modeled as a sparse sum of audiovisual kernels. The kernels are bimodal functions made of synchronous audio and video components that can be positioned independently and arbitrarily in space and time. We design an algorithm capable of learning sets of such audiovi- sual, synchronous, shift-invariant functions by alternatingly solving a coding and a learning pr...

Dynamical phase separation using a microfluidic device: experiments and modeling

Science.gov (United States)

Aymard, Benjamin; Vaes, Urbain; Radhakrishnan, Anand; Pradas, Marc; Gavriilidis, Asterios; Kalliadasis, Serafim; Complex Multiscale Systems Team

2017-11-01

We study the dynamical phase separation of a binary fluid by a microfluidic device both from the experimental and from the modeling points of view. The experimental device consists of a main channel (600 μm wide) leading into an array of 276 trapezoidal capillaries of 5 μm width arranged on both sides and separating the lateral channels from the main channel. Due to geometrical effects as well as wetting properties of the substrate, and under well chosen pressure boundary conditions, a multiphase flow introduced into the main channel gets separated at the capillaries. Understanding this dynamics via modeling and numerical simulation is a crucial step in designing future efficient micro-separators. We propose a diffuse-interface model, based on the classical Cahn-Hilliard-Navier-Stokes system, with a new nonlinear mobility and new wetting boundary conditions. We also propose a novel numerical method using a finite-element approach, together with an adaptive mesh refinement strategy. The complex geometry is captured using the same computer-aided design files as the ones adopted in the fabrication of the actual device. Numerical simulations reveal a very good qualitative agreement between model and experiments, demonstrating also a clear separation of phases.

Support agnostic Bayesian matching pursuit for block sparse signals

KAUST Repository

Masood, Mudassir

2013-05-01

A fast matching pursuit method using a Bayesian approach is introduced for block-sparse signal recovery. This method performs Bayesian estimates of block-sparse signals even when the distribution of active blocks is non-Gaussian or unknown. It is agnostic to the distribution of active blocks in the signal and utilizes a priori statistics of additive noise and the sparsity rate of the signal, which are shown to be easily estimated from data and no user intervention is required. The method requires a priori knowledge of block partition and utilizes a greedy approach and order-recursive updates of its metrics to find the most dominant sparse supports to determine the approximate minimum mean square error (MMSE) estimate of the block-sparse signal. Simulation results demonstrate the power and robustness of our proposed estimator. © 2013 IEEE.

Smartphone-Based Indoor Localization with Bluetooth Low Energy Beacons.

Science.gov (United States)

Zhuang, Yuan; Yang, Jun; Li, You; Qi, Longning; El-Sheimy, Naser

2016-04-26

Indoor wireless localization using Bluetooth Low Energy (BLE) beacons has attracted considerable attention after the release of the BLE protocol. In this paper, we propose an algorithm that uses the combination of channel-separate polynomial regression model (PRM), channel-separate fingerprinting (FP), outlier detection and extended Kalman filtering (EKF) for smartphone-based indoor localization with BLE beacons. The proposed algorithm uses FP and PRM to estimate the target's location and the distances between the target and BLE beacons respectively. We compare the performance of distance estimation that uses separate PRM for three advertisement channels (i.e., the separate strategy) with that use an aggregate PRM generated through the combination of information from all channels (i.e., the aggregate strategy). The performance of FP-based location estimation results of the separate strategy and the aggregate strategy are also compared. It was found that the separate strategy can provide higher accuracy; thus, it is preferred to adopt PRM and FP for each BLE advertisement channel separately. Furthermore, to enhance the robustness of the algorithm, a two-level outlier detection mechanism is designed. Distance and location estimates obtained from PRM and FP are passed to the first outlier detection to generate improved distance estimates for the EKF. After the EKF process, the second outlier detection algorithm based on statistical testing is further performed to remove the outliers. The proposed algorithm was evaluated by various field experiments. Results show that the proposed algorithm achieved the accuracy of EKF algorithm and 15.77% more accurate than EKF algorithm. With sparse deployment (1 beacon per 18 m), the proposed algorithm achieves the accuracies of EKF algorithm and 21.41% better than EKF algorithm. Therefore, the proposed algorithm is especially useful to improve the localization accuracy in environments with sparse beacon deployment.

Preconditioned Inexact Newton for Nonlinear Sparse Electromagnetic Imaging

KAUST Repository

Desmal, Abdulla

2014-05-04

Newton-type algorithms have been extensively studied in nonlinear microwave imaging due to their quadratic convergence rate and ability to recover images with high contrast values. In the past, Newton methods have been implemented in conjunction with smoothness promoting optimization/regularization schemes. However, this type of regularization schemes are known to perform poorly when applied in imagining domains with sparse content or sharp variations. In this work, an inexact Newton algorithm is formulated and implemented in conjunction with a linear sparse optimization scheme. A novel preconditioning technique is proposed to increase the convergence rate of the optimization problem. Numerical results demonstrate that the proposed framework produces sharper and more accurate images when applied in sparse/sparsified domains.

Preconditioned Inexact Newton for Nonlinear Sparse Electromagnetic Imaging

KAUST Repository

Desmal, Abdulla

2014-01-06

Newton-type algorithms have been extensively studied in nonlinear microwave imaging due to their quadratic convergence rate and ability to recover images with high contrast values. In the past, Newton methods have been implemented in conjunction with smoothness promoting optimization/regularization schemes. However, this type of regularization schemes are known to perform poorly when applied in imagining domains with sparse content or sharp variations. In this work, an inexact Newton algorithm is formulated and implemented in conjunction with a linear sparse optimization scheme. A novel preconditioning technique is proposed to increase the convergence rate of the optimization problem. Numerical results demonstrate that the proposed framework produces sharper and more accurate images when applied in sparse/sparsified domains.

Electromagnetic Formation Flight (EMFF) for Sparse Aperture Arrays

Science.gov (United States)

Kwon, Daniel W.; Miller, David W.; Sedwick, Raymond J.

2004-01-01

Traditional methods of actuating spacecraft in sparse aperture arrays use propellant as a reaction mass. For formation flying systems, propellant becomes a critical consumable which can be quickly exhausted while maintaining relative orientation. Additional problems posed by propellant include optical contamination, plume impingement, thermal emission, and vibration excitation. For these missions where control of relative degrees of freedom is important, we consider using a system of electromagnets, in concert with reaction wheels, to replace the consumables. Electromagnetic Formation Flight sparse apertures, powered by solar energy, are designed differently from traditional propulsion systems, which are based on V. This paper investigates the design of sparse apertures both inside and outside the Earth's gravity field.

Preconditioned Inexact Newton for Nonlinear Sparse Electromagnetic Imaging

KAUST Repository

Desmal, Abdulla; Bagci, Hakan

2014-01-01

Newton-type algorithms have been extensively studied in nonlinear microwave imaging due to their quadratic convergence rate and ability to recover images with high contrast values. In the past, Newton methods have been implemented in conjunction with smoothness promoting optimization/regularization schemes. However, this type of regularization schemes are known to perform poorly when applied in imagining domains with sparse content or sharp variations. In this work, an inexact Newton algorithm is formulated and implemented in conjunction with a linear sparse optimization scheme. A novel preconditioning technique is proposed to increase the convergence rate of the optimization problem. Numerical results demonstrate that the proposed framework produces sharper and more accurate images when applied in sparse/sparsified domains.

A comprehensive study of sparse codes on abnormality detection

DEFF Research Database (Denmark)

Ren, Huamin; Pan, Hong; Olsen, Søren Ingvor

2017-01-01

Sparse representation has been applied successfully in abnor-mal event detection, in which the baseline is to learn a dic-tionary accompanied by sparse codes. While much empha-sis is put on discriminative dictionary construction, there areno comparative studies of sparse codes regarding abnormal-ity...... detection. We comprehensively study two types of sparsecodes solutions - greedy algorithms and convex L1-norm so-lutions - and their impact on abnormality detection perfor-mance. We also propose our framework of combining sparsecodes with different detection methods. Our comparative ex-periments are carried...

Support agnostic Bayesian matching pursuit for block sparse signals

KAUST Repository

Masood, Mudassir; Al-Naffouri, Tareq Y.

2013-01-01

priori knowledge of block partition and utilizes a greedy approach and order-recursive updates of its metrics to find the most dominant sparse supports to determine the approximate minimum mean square error (MMSE) estimate of the block-sparse signal

Efficient Sequence Detection of Multicarrier Transmissions over Doubly Dispersive Channels

Directory of Open Access Journals (Sweden)

Hwang Sung-Jun

2006-01-01

Full Text Available We propose a high-spectral-efficiency multicarrier system for communication over the doubly dispersive (DD channel which yields very low frame error rate (FER, with quadratic (in the frame length receiver complexity. To accomplish this, we combine a non-(biorthogonal multicarrier modulation (MCM scheme recently proposed by the authors with novel sequence detection (SD and channel estimation (CE algorithms. In particular, our MCM scheme allows us to accurately represent the DD channels otherwise complicated intercarrier interference (ICI and intersymbol interference (ISI response with a relatively small number of coefficients. The SD and CE algorithms then leverage this sparse ICI/ISI structure for low-complexity operation. Our SD algorithm combines a novel adaptive breadth-first search procedure with a new fast MMSE-GDFE preprocessor, while our CE algorithm uses a rank-reduced pilot-aided Wiener technique to estimate only the significant ICI/ISI coefficients.

Direction-of-Arrival Estimation for Coherent Sources via Sparse Bayesian Learning

Directory of Open Access Journals (Sweden)

Zhang-Meng Liu

2014-01-01

Full Text Available A spatial filtering-based relevance vector machine (RVM is proposed in this paper to separate coherent sources and estimate their directions-of-arrival (DOA, with the filter parameters and DOA estimates initialized and refined via sparse Bayesian learning. The RVM is used to exploit the spatial sparsity of the incident signals and gain improved adaptability to much demanding scenarios, such as low signal-to-noise ratio (SNR, limited snapshots, and spatially adjacent sources, and the spatial filters are introduced to enhance global convergence of the original RVM in the case of coherent sources. The proposed method adapts to arbitrary array geometry, and simulation results show that it surpasses the existing methods in DOA estimation performance.

Selectivity and sparseness in randomly connected balanced networks.

Directory of Open Access Journals (Sweden)

Cengiz Pehlevan

Full Text Available Neurons in sensory cortex show stimulus selectivity and sparse population response, even in cases where no strong functionally specific structure in connectivity can be detected. This raises the question whether selectivity and sparseness can be generated and maintained in randomly connected networks. We consider a recurrent network of excitatory and inhibitory spiking neurons with random connectivity, driven by random projections from an input layer of stimulus selective neurons. In this architecture, the stimulus-to-stimulus and neuron-to-neuron modulation of total synaptic input is weak compared to the mean input. Surprisingly, we show that in the balanced state the network can still support high stimulus selectivity and sparse population response. In the balanced state, strong synapses amplify the variation in synaptic input and recurrent inhibition cancels the mean. Functional specificity in connectivity emerges due to the inhomogeneity caused by the generative statistical rule used to build the network. We further elucidate the mechanism behind and evaluate the effects of model parameters on population sparseness and stimulus selectivity. Network response to mixtures of stimuli is investigated. It is shown that a balanced state with unselective inhibition can be achieved with densely connected input to inhibitory population. Balanced networks exhibit the "paradoxical" effect: an increase in excitatory drive to inhibition leads to decreased inhibitory population firing rate. We compare and contrast selectivity and sparseness generated by the balanced network to randomly connected unbalanced networks. Finally, we discuss our results in light of experiments.

SPARSE ELECTROMAGNETIC IMAGING USING NONLINEAR LANDWEBER ITERATIONS

KAUST Repository

Desmal, Abdulla

2015-07-29

A scheme for efficiently solving the nonlinear electromagnetic inverse scattering problem on sparse investigation domains is described. The proposed scheme reconstructs the (complex) dielectric permittivity of an investigation domain from fields measured away from the domain itself. Least-squares data misfit between the computed scattered fields, which are expressed as a nonlinear function of the permittivity, and the measured fields is constrained by the L0/L1-norm of the solution. The resulting minimization problem is solved using nonlinear Landweber iterations, where at each iteration a thresholding function is applied to enforce the sparseness-promoting L0/L1-norm constraint. The thresholded nonlinear Landweber iterations are applied to several two-dimensional problems, where the ``measured\\'\\' fields are synthetically generated or obtained from actual experiments. These numerical experiments demonstrate the accuracy, efficiency, and applicability of the proposed scheme in reconstructing sparse profiles with high permittivity values.

Low Complexity Bayesian Single Channel Source Separation

DEFF Research Database (Denmark)

Beierholm, Thomas; Pedersen, Brian Dam; Winther, Ole

2004-01-01

can be estimated quite precisely using ML-II, but the estimation is quite sensitive to the accuracy of the priors as opposed to the source separation quality for known mixing coefficients, which is quite insensitive to the accuracy of the priors. Finally, we discuss how to improve our approach while...

Fast convolutional sparse coding using matrix inversion lemma

Czech Academy of Sciences Publication Activity Database

Šorel, Michal; Šroubek, Filip

2016-01-01

Roč. 55, č. 1 (2016), s. 44-51 ISSN 1051-2004 R&D Projects: GA ČR GA13-29225S Institutional support: RVO:67985556 Keywords : Convolutional sparse coding * Feature learning * Deconvolution networks * Shift-invariant sparse coding Subject RIV: JD - Computer Applications, Robotics Impact factor: 2.337, year: 2016 http://library.utia.cas.cz/separaty/2016/ZOI/sorel-0459332.pdf

Structure-based bayesian sparse reconstruction

KAUST Repository

Quadeer, Ahmed Abdul; Al-Naffouri, Tareq Y.

2012-01-01

Sparse signal reconstruction algorithms have attracted research attention due to their wide applications in various fields. In this paper, we present a simple Bayesian approach that utilizes the sparsity constraint and a priori statistical

Improved Tensor-Based Singular Spectrum Analysis Based on Single Channel Blind Source Separation Algorithm and Its Application to Fault Diagnosis

Directory of Open Access Journals (Sweden)

Dan Yang

2017-04-01

Full Text Available To solve the problem of multi-fault blind source separation (BSS in the case that the observed signals are under-determined, a novel approach for single channel blind source separation (SCBSS based on the improved tensor-based singular spectrum analysis (TSSA is proposed. As the most natural representation of high-dimensional data, tensor can preserve the intrinsic structure of the data to the maximum extent. Thus, TSSA method can be employed to extract the multi-fault features from the measured single-channel vibration signal. However, SCBSS based on TSSA still has some limitations, mainly including unsatisfactory convergence of TSSA in many cases and the number of source signals is hard to accurately estimate. Therefore, the improved TSSA algorithm based on canonical decomposition and parallel factors (CANDECOMP/PARAFAC weighted optimization, namely CP-WOPT, is proposed in this paper. CP-WOPT algorithm is applied to process the factor matrix using a first-order optimization approach instead of the original least square method in TSSA, so as to improve the convergence of this algorithm. In order to accurately estimate the number of the source signals in BSS, EMD-SVD-BIC (empirical mode decomposition—singular value decomposition—Bayesian information criterion method, instead of the SVD in the conventional TSSA, is introduced. To validate the proposed method, we applied it to the analysis of the numerical simulation signal and the multi-fault rolling bearing signals.

Binary Sparse Phase Retrieval via Simulated Annealing

Directory of Open Access Journals (Sweden)

Wei Peng

2016-01-01

Full Text Available This paper presents the Simulated Annealing Sparse PhAse Recovery (SASPAR algorithm for reconstructing sparse binary signals from their phaseless magnitudes of the Fourier transform. The greedy strategy version is also proposed for a comparison, which is a parameter-free algorithm. Sufficient numeric simulations indicate that our method is quite effective and suggest the binary model is robust. The SASPAR algorithm seems competitive to the existing methods for its efficiency and high recovery rate even with fewer Fourier measurements.

Study of the Calibration Channel Width for a Digital Sideband Separating System for SIS 2SB Receiver

Science.gov (United States)

Khudchenko, Andrey; Finger, R.; Baryshev, A. M.; Mena, F. P.; Rodriguez, R.; Hesper, R.; Fuentes, R.; Bronfman, L.

2018-01-01

A Digital Sideband Separating (DSS) system has been recently applied to a full 2SB receiver, i.e., one with the analog IF hybrid still in place. This concept allows reaching IRR level around 45 dB and it presents additional advantages in calibration stability compared to the case when no IF hybrid is present. If implemented in multipixel cameras, the DSS system relaxes the requirements for the IRR level of the analog receiver substantially enabling to reach at least an IRR of 30 dB with relatively simple hardware. It would be ideal for spectral line surveys since it practically eliminates the line confusion in addition to rejecting the atmospheric noise in the image band. Therefore, the DSS system is a potential option for a future ALMA upgrade. Here we present our study on an important practical question: how wide should the calibration-channel width in order to reach a desired IRR level? This parameter determines, for a large part, the calibration speed of the DSS system and influences the back-end architecture. We estimate that for currently installed ALMA bands (B3-B8), the channel width of the DSS system can be at least 45 MHz to reach a 30db IRR level in entire band.

Secure Degrees of Freedom of the Gaussian Z Channel with Single Antenna

Directory of Open Access Journals (Sweden)

Xianzhong XIE

2014-03-01

Full Text Available This paper presents the secrecy capacity and the secure degrees of freedom of Gaussian Z channel with single antenna and confidential information. Firstly, we analysis the secrecy capacity and the upper bound of secure degrees of freedom of this channel in theory. Then, we respectively discuss the security pre-coding scheme for real Gaussian channel model and frequency selection channel model. Under the first model, through real interference alignment and cooperative jamming, we obtain the secrecy capacity and secure degrees of freedom, proving that it can reach the upper bound of secure degrees of freedom in theory. While, under the second one, a strong security pre-coding algorithm is proposed, which is based on the fact that sparse matrix has strong hash property. Next, we arrange interference with interference alignment and the receivers process their received signal through zero forcing algorithm. At last, the messages are reconstructed with maximum likelihood decoding, where it shows that the algorithm can asymptotically achieve the optimal secrecy capacity.

Cyclic Communication and the Inseparability of MIMO Multi-way Relay Channels

KAUST Repository

Chaaban, Anas; Sezgin, Aydin

2015-01-01

The K-user MIMO multi-way relay channel (Ychannel) consisting of K users with M antennas each and a common relay node with N antennas is studied in this paper. Each user wants to exchange messages with all the other users via the relay. A transmission strategy is proposed for this channel. The proposed strategy is based on two steps: channel diagonalization and cyclic communication. The channel diagonalization is applied by using zero-forcing beam-forming. After channel diagonalization, the channel is decomposed into parallel sub-channels. Cyclic communication is then applied, where signal-space alignment for network-coding is used over each sub-channel. The proposed strategy achieves the optimal DoF region of the channel if N M. To prove this, a new degrees-of-freedom outer bound is derived. As a by-product, we conclude that the MIMO Y-channel is not separable, i.e., independent coding on separate sub-channels is not enough, and one has to code jointly over several sub-channels.

Cyclic Communication and the Inseparability of MIMO Multi-way Relay Channels

KAUST Repository

Chaaban, Anas

2015-10-27

The K-user MIMO multi-way relay channel (Ychannel) consisting of K users with M antennas each and a common relay node with N antennas is studied in this paper. Each user wants to exchange messages with all the other users via the relay. A transmission strategy is proposed for this channel. The proposed strategy is based on two steps: channel diagonalization and cyclic communication. The channel diagonalization is applied by using zero-forcing beam-forming. After channel diagonalization, the channel is decomposed into parallel sub-channels. Cyclic communication is then applied, where signal-space alignment for network-coding is used over each sub-channel. The proposed strategy achieves the optimal DoF region of the channel if N M. To prove this, a new degrees-of-freedom outer bound is derived. As a by-product, we conclude that the MIMO Y-channel is not separable, i.e., independent coding on separate sub-channels is not enough, and one has to code jointly over several sub-channels.

Conveyance estimation in channels with emergent bank vegetation ...

African Journals Online (AJOL)

Emergent vegetation along the banks of a river channel influences its conveyance considerably. The total channel discharge can be estimated as the sum of the discharges of the vegetated and clear channel zones calculated separately. The vegetated zone discharge is often negligible, but can be estimated using ...

Confidence of model based shape reconstruction from sparse data

DEFF Research Database (Denmark)

Baka, N.; de Bruijne, Marleen; Reiber, J. H. C.

2010-01-01

Statistical shape models (SSM) are commonly applied for plausible interpolation of missing data in medical imaging. However, when fitting a shape model to sparse information, many solutions may fit the available data. In this paper we derive a constrained SSM to fit noisy sparse input landmarks...

Proportionate Minimum Error Entropy Algorithm for Sparse System Identification

Directory of Open Access Journals (Sweden)

Zongze Wu

2015-08-01

Full Text Available Sparse system identification has received a great deal of attention due to its broad applicability. The proportionate normalized least mean square (PNLMS algorithm, as a popular tool, achieves excellent performance for sparse system identification. In previous studies, most of the cost functions used in proportionate-type sparse adaptive algorithms are based on the mean square error (MSE criterion, which is optimal only when the measurement noise is Gaussian. However, this condition does not hold in most real-world environments. In this work, we use the minimum error entropy (MEE criterion, an alternative to the conventional MSE criterion, to develop the proportionate minimum error entropy (PMEE algorithm for sparse system identification, which may achieve much better performance than the MSE based methods especially in heavy-tailed non-Gaussian situations. Moreover, we analyze the convergence of the proposed algorithm and derive a sufficient condition that ensures the mean square convergence. Simulation results confirm the excellent performance of the new algorithm.

Sparse PDF Volumes for Consistent Multi-Resolution Volume Rendering

KAUST Repository

Sicat, Ronell Barrera

2014-12-31

This paper presents a new multi-resolution volume representation called sparse pdf volumes, which enables consistent multi-resolution volume rendering based on probability density functions (pdfs) of voxel neighborhoods. These pdfs are defined in the 4D domain jointly comprising the 3D volume and its 1D intensity range. Crucially, the computation of sparse pdf volumes exploits data coherence in 4D, resulting in a sparse representation with surprisingly low storage requirements. At run time, we dynamically apply transfer functions to the pdfs using simple and fast convolutions. Whereas standard low-pass filtering and down-sampling incur visible differences between resolution levels, the use of pdfs facilitates consistent results independent of the resolution level used. We describe the efficient out-of-core computation of large-scale sparse pdf volumes, using a novel iterative simplification procedure of a mixture of 4D Gaussians. Finally, our data structure is optimized to facilitate interactive multi-resolution volume rendering on GPUs.

Ordering sparse matrices for cache-based systems

International Nuclear Information System (INIS)

Biswas, Rupak; Oliker, Leonid

2001-01-01

The Conjugate Gradient (CG) algorithm is the oldest and best-known Krylov subspace method used to solve sparse linear systems. Most of the coating-point operations within each CG iteration is spent performing sparse matrix-vector multiplication (SPMV). We examine how various ordering and partitioning strategies affect the performance of CG and SPMV when different programming paradigms are used on current commercial cache-based computers. However, a multithreaded implementation on the cacheless Cray MTA demonstrates high efficiency and scalability without any special ordering or partitioning

Separation of irradiance and reflectance from observed color images by logarithmical nonlinear diffusion process

Science.gov (United States)

Saito, Takahiro; Takahashi, Hiromi; Komatsu, Takashi

2006-02-01

The Retinex theory was first proposed by Land, and deals with separation of irradiance from reflectance in an observed image. The separation problem is an ill-posed problem. Land and others proposed various Retinex separation algorithms. Recently, Kimmel and others proposed a variational framework that unifies the previous Retinex algorithms such as the Poisson-equation-type Retinex algorithms developed by Horn and others, and presented a Retinex separation algorithm with the time-evolution of a linear diffusion process. However, the Kimmel's separation algorithm cannot achieve physically rational separation, if true irradiance varies among color channels. To cope with this problem, we introduce a nonlinear diffusion process into the time-evolution. Moreover, as to its extension to color images, we present two approaches to treat color channels: the independent approach to treat each color channel separately and the collective approach to treat all color channels collectively. The latter approach outperforms the former. Furthermore, we apply our separation algorithm to a high quality chroma key in which before combining a foreground frame and a background frame into an output image a color of each pixel in the foreground frame are spatially adaptively corrected through transformation of the separated irradiance. Experiments demonstrate superiority of our separation algorithm over the Kimmel's separation algorithm.

Pedestrian detection from thermal images: A sparse representation based approach

Science.gov (United States)

Qi, Bin; John, Vijay; Liu, Zheng; Mita, Seiichi

2016-05-01

Pedestrian detection, a key technology in computer vision, plays a paramount role in the applications of advanced driver assistant systems (ADASs) and autonomous vehicles. The objective of pedestrian detection is to identify and locate people in a dynamic environment so that accidents can be avoided. With significant variations introduced by illumination, occlusion, articulated pose, and complex background, pedestrian detection is a challenging task for visual perception. Different from visible images, thermal images are captured and presented with intensity maps based objects' emissivity, and thus have an enhanced spectral range to make human beings perceptible from the cool background. In this study, a sparse representation based approach is proposed for pedestrian detection from thermal images. We first adopted the histogram of sparse code to represent image features and then detect pedestrian with the extracted features in an unimodal and a multimodal framework respectively. In the unimodal framework, two types of dictionaries, i.e. joint dictionary and individual dictionary, are built by learning from prepared training samples. In the multimodal framework, a weighted fusion scheme is proposed to further highlight the contributions from features with higher separability. To validate the proposed approach, experiments were conducted to compare with three widely used features: Haar wavelets (HWs), histogram of oriented gradients (HOG), and histogram of phase congruency (HPC) as well as two classification methods, i.e. AdaBoost and support vector machine (SVM). Experimental results on a publicly available data set demonstrate the superiority of the proposed approach.

P-SPARSLIB: A parallel sparse iterative solution package

Energy Technology Data Exchange (ETDEWEB)

Saad, Y. [Univ. of Minnesota, Minneapolis, MN (United States)

1994-12-31

Iterative methods are gaining popularity in engineering and sciences at a time where the computational environment is changing rapidly. P-SPARSLIB is a project to build a software library for sparse matrix computations on parallel computers. The emphasis is on iterative methods and the use of distributed sparse matrices, an extension of the domain decomposition approach to general sparse matrices. One of the goals of this project is to develop a software package geared towards specific applications. For example, the author will test the performance and usefulness of P-SPARSLIB modules on linear systems arising from CFD applications. Equally important is the goal of portability. In the long run, the author wishes to ensure that this package is portable on a variety of platforms, including SIMD environments and shared memory environments.

Designer proton-channel transgenic algae for photobiological hydrogen production

Science.gov (United States)

Lee, James Weifu [Knoxville, TN

2011-04-26

A designer proton-channel transgenic alga for photobiological hydrogen production that is specifically designed for production of molecular hydrogen (H.sub.2) through photosynthetic water splitting. The designer transgenic alga includes proton-conductive channels that are expressed to produce such uncoupler proteins in an amount sufficient to increase the algal H.sub.2 productivity. In one embodiment the designer proton-channel transgene is a nucleic acid construct (300) including a PCR forward primer (302), an externally inducible promoter (304), a transit targeting sequence (306), a designer proton-channel encoding sequence (308), a transcription and translation terminator (310), and a PCR reverse primer (312). In various embodiments, the designer proton-channel transgenic algae are used with a gas-separation system (500) and a gas-products-separation and utilization system (600) for photobiological H.sub.2 production.

Channeling ion implantation through palladium films

International Nuclear Information System (INIS)

Ishiwara, H.; Furukawa, S.

1975-01-01

The possibility of channeling ion implantation into semiconductors through polycrystalline metallic layers is studied. Minimum values and standard deviations of channeling angular yield in polycrystalline Pd 2 Si layers formed on Si have been measured by protons and 4 He, and 14 N ion backscattering and channeling measurements. Depth distributions of the spread of crystallite orientations and scattering centers such as lattice defects have been separately derived by using the above two quantities. It has been concluded that the channeling-ion-implantation technique will become a practical one by using the parallel scanning system

LASER APPLICATIONS AND OTHER TOPICS IN QUANTUM ELECTRONICS: Measurement of wavefront distortions by the method of aperture sounding with spatially separated channels

Science.gov (United States)

Prilepskiy, Boris V.; Alikhanov, Alexey N.; Berchenko, Evgeniy A.; Kiselev, Vladimir Yu; Narusbek, Ernest A.; Filatov, Aleksander S.

2005-08-01

Features of the formation of signals in wavefront sensors with the single-frequency light wave phase modulation and spatial separation of control channels are considered. Analysis is performed for sensors in which phase modulation is governed by a controlled element located in the pupil of the optical system of a sensor or in the focal plane of the objective of this system. Peculiarities of the signal formation for a tilted wavefront are considered separately for internal points of the exit pupil in the case of light wave phase modulation in the pupil. It is shown that a signal at the modulation frequency in these wavefront sensors for points located far from the pupil boundaries is determined by the wavefront curvature.

Feature selection and multi-kernel learning for sparse representation on a manifold

KAUST Repository

Wang, Jim Jing-Yan

2014-03-01

Sparse representation has been widely studied as a part-based data representation method and applied in many scientific and engineering fields, such as bioinformatics and medical imaging. It seeks to represent a data sample as a sparse linear combination of some basic items in a dictionary. Gao etal. (2013) recently proposed Laplacian sparse coding by regularizing the sparse codes with an affinity graph. However, due to the noisy features and nonlinear distribution of the data samples, the affinity graph constructed directly from the original feature space is not necessarily a reliable reflection of the intrinsic manifold of the data samples. To overcome this problem, we integrate feature selection and multiple kernel learning into the sparse coding on the manifold. To this end, unified objectives are defined for feature selection, multiple kernel learning, sparse coding, and graph regularization. By optimizing the objective functions iteratively, we develop novel data representation algorithms with feature selection and multiple kernel learning respectively. Experimental results on two challenging tasks, N-linked glycosylation prediction and mammogram retrieval, demonstrate that the proposed algorithms outperform the traditional sparse coding methods. © 2013 Elsevier Ltd.

Feature selection and multi-kernel learning for sparse representation on a manifold.

Science.gov (United States)

Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

2014-03-01

Sparse representation has been widely studied as a part-based data representation method and applied in many scientific and engineering fields, such as bioinformatics and medical imaging. It seeks to represent a data sample as a sparse linear combination of some basic items in a dictionary. Gao et al. (2013) recently proposed Laplacian sparse coding by regularizing the sparse codes with an affinity graph. However, due to the noisy features and nonlinear distribution of the data samples, the affinity graph constructed directly from the original feature space is not necessarily a reliable reflection of the intrinsic manifold of the data samples. To overcome this problem, we integrate feature selection and multiple kernel learning into the sparse coding on the manifold. To this end, unified objectives are defined for feature selection, multiple kernel learning, sparse coding, and graph regularization. By optimizing the objective functions iteratively, we develop novel data representation algorithms with feature selection and multiple kernel learning respectively. Experimental results on two challenging tasks, N-linked glycosylation prediction and mammogram retrieval, demonstrate that the proposed algorithms outperform the traditional sparse coding methods. Copyright © 2013 Elsevier Ltd. All rights reserved.

Sparse representation, modeling and learning in visual recognition theory, algorithms and applications

CERN Document Server

Cheng, Hong

2015-01-01

This unique text/reference presents a comprehensive review of the state of the art in sparse representations, modeling and learning. The book examines both the theoretical foundations and details of algorithm implementation, highlighting the practical application of compressed sensing research in visual recognition and computer vision. Topics and features: provides a thorough introduction to the fundamentals of sparse representation, modeling and learning, and the application of these techniques in visual recognition; describes sparse recovery approaches, robust and efficient sparse represen

Design Patterns for Sparse-Matrix Computations on Hybrid CPU/GPU Platforms

Directory of Open Access Journals (Sweden)

Valeria Cardellini

2014-01-01

Full Text Available We apply object-oriented software design patterns to develop code for scientific software involving sparse matrices. Design patterns arise when multiple independent developments produce similar designs which converge onto a generic solution. We demonstrate how to use design patterns to implement an interface for sparse matrix computations on NVIDIA GPUs starting from PSBLAS, an existing sparse matrix library, and from existing sets of GPU kernels for sparse matrices. We also compare the throughput of the PSBLAS sparse matrix–vector multiplication on two platforms exploiting the GPU with that obtained by a CPU-only PSBLAS implementation. Our experiments exhibit encouraging results regarding the comparison between CPU and GPU executions in double precision, obtaining a speedup of up to 35.35 on NVIDIA GTX 285 with respect to AMD Athlon 7750, and up to 10.15 on NVIDIA Tesla C2050 with respect to Intel Xeon X5650.

An Efficient GPU General Sparse Matrix-Matrix Multiplication for Irregular Data

DEFF Research Database (Denmark)

Liu, Weifeng; Vinter, Brian

2014-01-01

General sparse matrix-matrix multiplication (SpGEMM) is a fundamental building block for numerous applications such as algebraic multigrid method, breadth first search and shortest path problem. Compared to other sparse BLAS routines, an efficient parallel SpGEMM algorithm has to handle extra...... irregularity from three aspects: (1) the number of the nonzero entries in the result sparse matrix is unknown in advance, (2) very expensive parallel insert operations at random positions in the result sparse matrix dominate the execution time, and (3) load balancing must account for sparse data in both input....... Load balancing builds on the number of the necessary arithmetic operations on the nonzero entries and is guaranteed in all stages. Compared with the state-of-the-art GPU SpGEMM methods in the CUSPARSE library and the CUSP library and the latest CPU SpGEMM method in the Intel Math Kernel Library, our...

Comparison of Methods for Sparse Representation of Musical Signals

DEFF Research Database (Denmark)

Endelt, Line Ørtoft; la Cour-Harbo, Anders

2005-01-01

by a number of sparseness measures and results are shown on the ℓ1 norm of the coefficients, using a dictionary containing a Dirac basis, a Discrete Cosine Transform, and a Wavelet Packet. Evaluated only on the sparseness Matching Pursuit is the best method, and it is also relatively fast....

Joint-2D-SL0 Algorithm for Joint Sparse Matrix Reconstruction

Directory of Open Access Journals (Sweden)

Dong Zhang

2017-01-01

Full Text Available Sparse matrix reconstruction has a wide application such as DOA estimation and STAP. However, its performance is usually restricted by the grid mismatch problem. In this paper, we revise the sparse matrix reconstruction model and propose the joint sparse matrix reconstruction model based on one-order Taylor expansion. And it can overcome the grid mismatch problem. Then, we put forward the Joint-2D-SL0 algorithm which can solve the joint sparse matrix reconstruction problem efficiently. Compared with the Kronecker compressive sensing method, our proposed method has a higher computational efficiency and acceptable reconstruction accuracy. Finally, simulation results validate the superiority of the proposed method.

Discussion of CoSA: Clustering of Sparse Approximations

Energy Technology Data Exchange (ETDEWEB)

Armstrong, Derek Elswick [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

2017-03-07

The purpose of this talk is to discuss the possible applications of CoSA (Clustering of Sparse Approximations) to the exploitation of HSI (HyperSpectral Imagery) data. CoSA is presented by Moody et al. in the Journal of Applied Remote Sensing (“Land cover classification in multispectral imagery using clustering of sparse approximations over learned feature dictionaries”, Vol. 8, 2014) and is based on machine learning techniques.

Relativistic quantum channel of communication through field quanta

International Nuclear Information System (INIS)

Cliche, M.; Kempf, A.

2010-01-01

Setups in which a system Alice emits field quanta that a system Bob receives are prototypical for wireless communication and have been extensively studied. In the most basic setup, Alice and Bob are modeled as Unruh-DeWitt detectors for scalar quanta, and the only noise in their communication is due to quantum fluctuations. For this basic setup, we construct the corresponding information-theoretic quantum channel. We calculate the classical channel capacity as a function of the spacetime separation, and we confirm that the classical as well as the quantum channel capacity are strictly zero for spacelike separations. We show that this channel can be used to entangle Alice and Bob instantaneously. Alice and Bob are shown to extract this entanglement from the vacuum through a Casimir-Polder effect.

Fuel channel refilling

International Nuclear Information System (INIS)

Shoukri, M.; Abdul-Razzak, A.

1990-04-01

Analysis of existing data on fuel channel refilling is presented. The analysis focuses on the data obtained using the Stern Laboratories Cold Water Injection Test (CWIT) Facility. The two-fluid model thermal-hydraulics computer code CATHENA is also used to simulate experimental results on fuel channel refilling from both the CWIT and RD-14 facilities. Conclusions related to single and double break tests, including the effect of non-condensible gases, are presented. A set of recommendations is given for further analysis and separate effect experiments. (67 figs., 5 tabs., 24 refs.)

Real-Space Analysis of Scanning Tunneling Microscopy Topography Datasets Using Sparse Modeling Approach

Science.gov (United States)

Miyama, Masamichi J.; Hukushima, Koji

2018-04-01

A sparse modeling approach is proposed for analyzing scanning tunneling microscopy topography data, which contain numerous peaks originating from the electron density of surface atoms and/or impurities. The method, based on the relevance vector machine with L1 regularization and k-means clustering, enables separation of the peaks and peak center positioning with accuracy beyond the resolution of the measurement grid. The validity and efficiency of the proposed method are demonstrated using synthetic data in comparison with the conventional least-squares method. An application of the proposed method to experimental data of a metallic oxide thin-film clearly indicates the existence of defects and corresponding local lattice distortions.

Facial Expression Recognition via Non-Negative Least-Squares Sparse Coding

Directory of Open Access Journals (Sweden)

Ying Chen

2014-05-01

Full Text Available Sparse coding is an active research subject in signal processing, computer vision, and pattern recognition. A novel method of facial expression recognition via non-negative least squares (NNLS sparse coding is presented in this paper. The NNLS sparse coding is used to form a facial expression classifier. To testify the performance of the presented method, local binary patterns (LBP and the raw pixels are extracted for facial feature representation. Facial expression recognition experiments are conducted on the Japanese Female Facial Expression (JAFFE database. Compared with other widely used methods such as linear support vector machines (SVM, sparse representation-based classifier (SRC, nearest subspace classifier (NSC, K-nearest neighbor (KNN and radial basis function neural networks (RBFNN, the experiment results indicate that the presented NNLS method performs better than other used methods on facial expression recognition tasks.

Sparse Representation Based Multi-Instance Learning for Breast Ultrasound Image Classification

Directory of Open Access Journals (Sweden)

Lu Bing

2017-01-01

Full Text Available We propose a novel method based on sparse representation for breast ultrasound image classification under the framework of multi-instance learning (MIL. After image enhancement and segmentation, concentric circle is used to extract the global and local features for improving the accuracy in diagnosis and prediction. The classification problem of ultrasound image is converted to sparse representation based MIL problem. Each instance of a bag is represented as a sparse linear combination of all basis vectors in the dictionary, and then the bag is represented by one feature vector which is obtained via sparse representations of all instances within the bag. The sparse and MIL problem is further converted to a conventional learning problem that is solved by relevance vector machine (RVM. Results of single classifiers are combined to be used for classification. Experimental results on the breast cancer datasets demonstrate the superiority of the proposed method in terms of classification accuracy as compared with state-of-the-art MIL methods.

Sparse Representation Based Multi-Instance Learning for Breast Ultrasound Image Classification.

Science.gov (United States)

Bing, Lu; Wang, Wei

2017-01-01

We propose a novel method based on sparse representation for breast ultrasound image classification under the framework of multi-instance learning (MIL). After image enhancement and segmentation, concentric circle is used to extract the global and local features for improving the accuracy in diagnosis and prediction. The classification problem of ultrasound image is converted to sparse representation based MIL problem. Each instance of a bag is represented as a sparse linear combination of all basis vectors in the dictionary, and then the bag is represented by one feature vector which is obtained via sparse representations of all instances within the bag. The sparse and MIL problem is further converted to a conventional learning problem that is solved by relevance vector machine (RVM). Results of single classifiers are combined to be used for classification. Experimental results on the breast cancer datasets demonstrate the superiority of the proposed method in terms of classification accuracy as compared with state-of-the-art MIL methods.

A Vehicle Active Safety Model: Vehicle Speed Control Based on Driver Vigilance Detection Using Wearable EEG and Sparse Representation.

Science.gov (United States)

Zhang, Zutao; Luo, Dianyuan; Rasim, Yagubov; Li, Yanjun; Meng, Guanjun; Xu, Jian; Wang, Chunbai

2016-02-19

In this paper, we present a vehicle active safety model for vehicle speed control based on driver vigilance detection using low-cost, comfortable, wearable electroencephalographic (EEG) sensors and sparse representation. The proposed system consists of three main steps, namely wireless wearable EEG collection, driver vigilance detection, and vehicle speed control strategy. First of all, a homemade low-cost comfortable wearable brain-computer interface (BCI) system with eight channels is designed for collecting the driver's EEG signal. Second, wavelet de-noising and down-sample algorithms are utilized to enhance the quality of EEG data, and Fast Fourier Transformation (FFT) is adopted to extract the EEG power spectrum density (PSD). In this step, sparse representation classification combined with k-singular value decomposition (KSVD) is firstly introduced in PSD to estimate the driver's vigilance level. Finally, a novel safety strategy of vehicle speed control, which controls the electronic throttle opening and automatic braking after driver fatigue detection using the above method, is presented to avoid serious collisions and traffic accidents. The simulation and practical testing results demonstrate the feasibility of the vehicle active safety model.

Joint sparse representation for robust multimodal biometrics recognition.

Science.gov (United States)

Shekhar, Sumit; Patel, Vishal M; Nasrabadi, Nasser M; Chellappa, Rama

2014-01-01

Traditional biometric recognition systems rely on a single biometric signature for authentication. While the advantage of using multiple sources of information for establishing the identity has been widely recognized, computational models for multimodal biometrics recognition have only recently received attention. We propose a multimodal sparse representation method, which represents the test data by a sparse linear combination of training data, while constraining the observations from different modalities of the test subject to share their sparse representations. Thus, we simultaneously take into account correlations as well as coupling information among biometric modalities. A multimodal quality measure is also proposed to weigh each modality as it gets fused. Furthermore, we also kernelize the algorithm to handle nonlinearity in data. The optimization problem is solved using an efficient alternative direction method. Various experiments show that the proposed method compares favorably with competing fusion-based methods.

Single-channel kinetics of BK (Slo1 channels

Directory of Open Access Journals (Sweden)

Yanyan eGeng

2015-01-01

Full Text Available Single-channel kinetics has proven a powerful tool to reveal information about the gating mechanisms that control the opening and closing of ion channels. This introductory review focuses on the gating of large conductance Ca2+- and voltage-activated K+ (BK or Slo1 channels at the single-channel level. It starts with single-channel current records and progresses to presentation and analysis of single-channel data and the development of gating mechanisms in terms of discrete state Markov (DSM models. The DSM models are formulated in terms of the tetrameric modular structure of BK channels, consisting of a central transmembrane pore-gate domain (PGD attached to four surrounding transmembrane voltage sensing domains (VSD and a large intracellular cytosolic domain (CTD, also referred to as the gating ring. The modular structure and data analysis shows that the Ca2+ and voltage dependent gating considered separately can each be approximated by 10-state two-tiered models with 5 closed states on the upper tier and 5 open states on the lower tier. The modular structure and joint Ca2+ and voltage dependent gating are consistent with a 50 state two-tiered model with 25 closed states on the upper tier and 25 open states on the lower tier. Adding an additional tier of brief closed (flicker states to the 10-state or 50-state models improved the description of the gating. For fixed experimental conditions a channel would gate in only a subset of the potential number of states. The detected number of states and the correlations between adjacent interval durations are consistent with the tiered models. The examined models can account for the single-channel kinetics and the bursting behavior of gating. Ca2+ and voltage activate BK channels by predominantly increasing the effective opening rate of the channel with a smaller decrease in the effective closing rate. Ca2+ and depolarization thus activate by mainly destabilizing the closed states.

Robust Visual Tracking Via Consistent Low-Rank Sparse Learning

KAUST Repository

Zhang, Tianzhu

2014-06-19

Object tracking is the process of determining the states of a target in consecutive video frames based on properties of motion and appearance consistency. In this paper, we propose a consistent low-rank sparse tracker (CLRST) that builds upon the particle filter framework for tracking. By exploiting temporal consistency, the proposed CLRST algorithm adaptively prunes and selects candidate particles. By using linear sparse combinations of dictionary templates, the proposed method learns the sparse representations of image regions corresponding to candidate particles jointly by exploiting the underlying low-rank constraints. In addition, the proposed CLRST algorithm is computationally attractive since temporal consistency property helps prune particles and the low-rank minimization problem for learning joint sparse representations can be efficiently solved by a sequence of closed form update operations. We evaluate the proposed CLRST algorithm against 14 state-of-the-art tracking methods on a set of 25 challenging image sequences. Experimental results show that the CLRST algorithm performs favorably against state-of-the-art tracking methods in terms of accuracy and execution time.

Reliability assessment of PARR-1 renovated I and C system startup channel-b

Energy Technology Data Exchange (ETDEWEB)

Qamar, M.A.; Habib, M.A.; Iqbal, M.

1991-11-20

The report covers the reliability assessment of the startup channel-B of the PARR-1 renovated instrumentation and Control. For startup channel-A, a separate report (DNSRP-10(7)/88) was prepared in 1988. As the modules are of different origins in both the channels, a separate calculation was necessary. In the report the overall unreliability of the startup channel has been calculated by considering 1 out of 2 operation mode. In the assessment, the reliability calculations for the channel has been performed using similar assumptions as used in the authors' report on startup channel-A. For the analysis the Component Count Method (CCM) was applied. Comparison of results for channel-A and channel-B were made.

Sparse dictionary learning of resting state fMRI networks.

Science.gov (United States)

Eavani, Harini; Filipovych, Roman; Davatzikos, Christos; Satterthwaite, Theodore D; Gur, Raquel E; Gur, Ruben C

2012-07-02

Research in resting state fMRI (rsfMRI) has revealed the presence of stable, anti-correlated functional subnetworks in the brain. Task-positive networks are active during a cognitive process and are anti-correlated with task-negative networks, which are active during rest. In this paper, based on the assumption that the structure of the resting state functional brain connectivity is sparse, we utilize sparse dictionary modeling to identify distinct functional sub-networks. We propose two ways of formulating the sparse functional network learning problem that characterize the underlying functional connectivity from different perspectives. Our results show that the whole-brain functional connectivity can be concisely represented with highly modular, overlapping task-positive/negative pairs of sub-networks.

Low-Rank Sparse Coding for Image Classification

KAUST Repository

Zhang, Tianzhu; Ghanem, Bernard; Liu, Si; Xu, Changsheng; Ahuja, Narendra

2013-01-01

In this paper, we propose a low-rank sparse coding (LRSC) method that exploits local structure information among features in an image for the purpose of image-level classification. LRSC represents densely sampled SIFT descriptors, in a spatial neighborhood, collectively as low-rank, sparse linear combinations of code words. As such, it casts the feature coding problem as a low-rank matrix learning problem, which is different from previous methods that encode features independently. This LRSC has a number of attractive properties. (1) It encourages sparsity in feature codes, locality in codebook construction, and low-rankness for spatial consistency. (2) LRSC encodes local features jointly by considering their low-rank structure information, and is computationally attractive. We evaluate the LRSC by comparing its performance on a set of challenging benchmarks with that of 7 popular coding and other state-of-the-art methods. Our experiments show that by representing local features jointly, LRSC not only outperforms the state-of-the-art in classification accuracy but also improves the time complexity of methods that use a similar sparse linear representation model for feature coding.

Low-Rank Sparse Coding for Image Classification

KAUST Repository

Zhang, Tianzhu

2013-12-01

In this paper, we propose a low-rank sparse coding (LRSC) method that exploits local structure information among features in an image for the purpose of image-level classification. LRSC represents densely sampled SIFT descriptors, in a spatial neighborhood, collectively as low-rank, sparse linear combinations of code words. As such, it casts the feature coding problem as a low-rank matrix learning problem, which is different from previous methods that encode features independently. This LRSC has a number of attractive properties. (1) It encourages sparsity in feature codes, locality in codebook construction, and low-rankness for spatial consistency. (2) LRSC encodes local features jointly by considering their low-rank structure information, and is computationally attractive. We evaluate the LRSC by comparing its performance on a set of challenging benchmarks with that of 7 popular coding and other state-of-the-art methods. Our experiments show that by representing local features jointly, LRSC not only outperforms the state-of-the-art in classification accuracy but also improves the time complexity of methods that use a similar sparse linear representation model for feature coding.

Regularized generalized eigen-decomposition with applications to sparse supervised feature extraction and sparse discriminant analysis

DEFF Research Database (Denmark)

Han, Xixuan; Clemmensen, Line Katrine Harder

2015-01-01

We propose a general technique for obtaining sparse solutions to generalized eigenvalue problems, and call it Regularized Generalized Eigen-Decomposition (RGED). For decades, Fisher's discriminant criterion has been applied in supervised feature extraction and discriminant analysis, and it is for...

Vortex Formation During Unsteady Boundary-Layer Separation

Science.gov (United States)

Das, Debopam; Arakeri, Jaywant H.

1998-11-01

Unsteady laminar boundary-layer separation is invariably accompanied by the formation of vortices. The aim of the present work is to study the vortex formation mechanism(s). An adverse pressure gradient causing a separation can be decomposed into a spatial component ( spatial variation of the velocity external to the boundary layer ) and a temporal component ( temporal variation of the external velocity ). Experiments were conducted in a piston driven 2-D water channel, where the spatial component could be be contolled by geometry and the temporal component by the piston motion. We present results for three divergent channel geometries. The piston motion consists of three phases: constant acceleration from start, contant velocity, and constant deceleration to stop. Depending on the geometry and piston motion we observe different types of unsteady separation and vortex formation.

A performance study of sparse Cholesky factorization on INTEL iPSC/860

Science.gov (United States)

Zubair, M.; Ghose, M.

1992-01-01

The problem of Cholesky factorization of a sparse matrix has been very well investigated on sequential machines. A number of efficient codes exist for factorizing large unstructured sparse matrices. However, there is a lack of such efficient codes on parallel machines in general, and distributed machines in particular. Some of the issues that are critical to the implementation of sparse Cholesky factorization on a distributed memory parallel machine are ordering, partitioning and mapping, load balancing, and ordering of various tasks within a processor. Here, we focus on the effect of various partitioning schemes on the performance of sparse Cholesky factorization on the Intel iPSC/860. Also, a new partitioning heuristic for structured as well as unstructured sparse matrices is proposed, and its performance is compared with other schemes.

Fast sparsely synchronized brain rhythms in a scale-free neural network.

Science.gov (United States)

Kim, Sang-Yoon; Lim, Woochang

2015-08-01

We consider a directed version of the Barabási-Albert scale-free network model with symmetric preferential attachment with the same in- and out-degrees and study the emergence of sparsely synchronized rhythms for a fixed attachment degree in an inhibitory population of fast-spiking Izhikevich interneurons. Fast sparsely synchronized rhythms with stochastic and intermittent neuronal discharges are found to appear for large values of J (synaptic inhibition strength) and D (noise intensity). For an intensive study we fix J at a sufficiently large value and investigate the population states by increasing D. For small D, full synchronization with the same population-rhythm frequency fp and mean firing rate (MFR) fi of individual neurons occurs, while for large D partial synchronization with fp>〈fi〉 (〈fi〉: ensemble-averaged MFR) appears due to intermittent discharge of individual neurons; in particular, the case of fp>4〈fi〉 is referred to as sparse synchronization. For the case of partial and sparse synchronization, MFRs of individual neurons vary depending on their degrees. As D passes a critical value D* (which is determined by employing an order parameter), a transition to unsynchronization occurs due to the destructive role of noise to spoil the pacing between sparse spikes. For Dsparse synchronization do contributions of individual neuronal dynamics to population synchronization change depending on their degrees, unlike in the case of full synchronization. Consequently, dynamics of individual neurons reveal the inhomogeneous network structure for the case of partial and sparse synchronization, which is in contrast to the case of

Fast sparsely synchronized brain rhythms in a scale-free neural network

Science.gov (United States)

Kim, Sang-Yoon; Lim, Woochang

2015-08-01

We consider a directed version of the Barabási-Albert scale-free network model with symmetric preferential attachment with the same in- and out-degrees and study the emergence of sparsely synchronized rhythms for a fixed attachment degree in an inhibitory population of fast-spiking Izhikevich interneurons. Fast sparsely synchronized rhythms with stochastic and intermittent neuronal discharges are found to appear for large values of J (synaptic inhibition strength) and D (noise intensity). For an intensive study we fix J at a sufficiently large value and investigate the population states by increasing D . For small D , full synchronization with the same population-rhythm frequency fp and mean firing rate (MFR) fi of individual neurons occurs, while for large D partial synchronization with fp> ( : ensemble-averaged MFR) appears due to intermittent discharge of individual neurons; in particular, the case of fp>4 is referred to as sparse synchronization. For the case of partial and sparse synchronization, MFRs of individual neurons vary depending on their degrees. As D passes a critical value D* (which is determined by employing an order parameter), a transition to unsynchronization occurs due to the destructive role of noise to spoil the pacing between sparse spikes. For D sparse synchronization do contributions of individual neuronal dynamics to population synchronization change depending on their degrees, unlike in the case of full synchronization. Consequently, dynamics of individual neurons reveal the inhomogeneous network structure for the case of partial and sparse synchronization, which is in contrast to the case of statistically homogeneous

Experimental Research of Machineless Energy Separation Effect Influenced by Shock Waves

Directory of Open Access Journals (Sweden)

S. S. Popovich

2016-01-01

Full Text Available The paper presents experimental research results of machineless energy separation effect with transversal ribs in supersonic channel. The energy separation effect assumes a physical division of the inlet flow into two or more flows, each having different stagnation temperature. Among well-known energy separation effects noted there are Ranque-Hilsch vortex tubes, Hartmann-Sprenger resonance tubes, pulsating tubes and some others.A working principle of device under study is based on thermal interaction between subsonic and supersonic gas flows through a heat-conducting division wall. This energy separation method was proposed by academician Leontiev and was patented in 1998. A number of references for PhD theses, articles, and conference proceedings devoted to the research of “Leontiev tube” have been mentioned in the paper. Efficiency factors for energy separation device performability have been analyzed in detail. The main attention was focused on the phenomenon of shock waves generation in supersonic channel of Leontiev tube.Experiment was carried out in the air prototype of energy separation device with supersonic flow Mach numbers 1.9 and 2.5, stagnation temperatures 40°С and 70°С, and for uni-flow and counter-flow air moving direction in subsonic and supersonic channels. Shock waves have been generated by means of circular ribs in supersonic channel of energy separation device. The research was carried out by means of infrared thermal imaging, thermocouples, total and static pressure probes, and modern National Insturments automation equipment. The work shows that shock waves have no negative influence on energy separation effect. A conclusion is made that unexpected shock wave generation in supersonic channel will not cause operability loss. It was gained that counter-flow regime is more efficient than uni-flow. Energy separation effect also appears to be higher with the rise of Mach number and flow initial stagnation temperature

l1- and l2-Norm Joint Regularization Based Sparse Signal Reconstruction Scheme

Directory of Open Access Journals (Sweden)

Chanzi Liu

2016-01-01

Full Text Available Many problems in signal processing and statistical inference involve finding sparse solution to some underdetermined linear system of equations. This is also the application condition of compressive sensing (CS which can find the sparse solution from the measurements far less than the original signal. In this paper, we propose l1- and l2-norm joint regularization based reconstruction framework to approach the original l0-norm based sparseness-inducing constrained sparse signal reconstruction problem. Firstly, it is shown that, by employing the simple conjugate gradient algorithm, the new formulation provides an effective framework to deduce the solution as the original sparse signal reconstruction problem with l0-norm regularization item. Secondly, the upper reconstruction error limit is presented for the proposed sparse signal reconstruction framework, and it is unveiled that a smaller reconstruction error than l1-norm relaxation approaches can be realized by using the proposed scheme in most cases. Finally, simulation results are presented to validate the proposed sparse signal reconstruction approach.

Image fusion via nonlocal sparse K-SVD dictionary learning.

Science.gov (United States)

Li, Ying; Li, Fangyi; Bai, Bendu; Shen, Qiang

2016-03-01

Image fusion aims to merge two or more images captured via various sensors of the same scene to construct a more informative image by integrating their details. Generally, such integration is achieved through the manipulation of the representations of the images concerned. Sparse representation plays an important role in the effective description of images, offering a great potential in a variety of image processing tasks, including image fusion. Supported by sparse representation, in this paper, an approach for image fusion by the use of a novel dictionary learning scheme is proposed. The nonlocal self-similarity property of the images is exploited, not only at the stage of learning the underlying description dictionary but during the process of image fusion. In particular, the property of nonlocal self-similarity is combined with the traditional sparse dictionary. This results in an improved learned dictionary, hereafter referred to as the nonlocal sparse K-SVD dictionary (where K-SVD stands for the K times singular value decomposition that is commonly used in the literature), and abbreviated to NL_SK_SVD. The performance of the NL_SK_SVD dictionary is applied for image fusion using simultaneous orthogonal matching pursuit. The proposed approach is evaluated with different types of images, and compared with a number of alternative image fusion techniques. The resultant superior fused images using the present approach demonstrates the efficacy of the NL_SK_SVD dictionary in sparse image representation.

Cell swelling activates separate taurine and chloride channels in Ehrlich mouse ascites tumor cells

DEFF Research Database (Denmark)

Lambert, Ian Henry; Hoffmann, Else Kay

1994-01-01

The taurine efflux from Ehrlich ascites tumor cells is stimulated by hypotonic cell swelling. The swelling-activated taurine efflux is unaffected by substitution of gluconate for extracellular Cl– but inhibited by addition of MK196 (anion channel blocker) and 4,4 -diisothiocyanostilbene-2......,2 -disulfonic acid (DIDS; anion channel and anion exchange blocker) and by depolarization of the cell membrane. This is taken to indicate that taurine does not leave the osmotically swollen Ehrlich cells in exchange for extracellular Cl–, i.e., via the anion exchanger but via a MK196- and DIDS-sensitive channel...... that is potential dependent. An additional stimulation of the swelling-activated taurine efflux is seen after addition of arachidonic acid and oleic acid. Cell swelling also activates a Mini Cl– channel. The Cl– efflux via this Cl– channel, in contrast to the swelling-activated taurine efflux, is unaffected by DIDS...

Detection of Pitting in Gears Using a Deep Sparse Autoencoder

Directory of Open Access Journals (Sweden)

Yongzhi Qu

2017-05-01

Full Text Available In this paper; a new method for gear pitting fault detection is presented. The presented method is developed based on a deep sparse autoencoder. The method integrates dictionary learning in sparse coding into a stacked autoencoder network. Sparse coding with dictionary learning is viewed as an adaptive feature extraction method for machinery fault diagnosis. An autoencoder is an unsupervised machine learning technique. A stacked autoencoder network with multiple hidden layers is considered to be a deep learning network. The presented method uses a stacked autoencoder network to perform the dictionary learning in sparse coding and extract features from raw vibration data automatically. These features are then used to perform gear pitting fault detection. The presented method is validated with vibration data collected from gear tests with pitting faults in a gearbox test rig and compared with an existing deep learning-based approach.

Alpha Channeling in Open-System Magnetic Devices

International Nuclear Information System (INIS)

Fisch, Nathaniel

2016-01-01

The Grant DE-SC0000736, Alpha Channeling in Open-System Magnetic Devices, is a continuation of the Grant DE-FG02-06ER54851, Alpha Channeling in Mirror Machines. In publications funded by DE-SC0000736, the grant DE-FG02-06ER54851 was actually credited. The key results obtained under Grant DE-SC0000736, Alpha Channeling in Open-System Magnetic Devices, appear in a series of publications. The earlier effort under DE-FG02- 06ER54851 was the subject of a previous Final Report. The theme of this later effort has been unusual confinement effects, or de-confinement effects, in open-field magnetic confinement devices. First, the possibilities in losing axisymmetry were explored. Then a number of issues in rotating plasma were addressed. Most importantly, a spinoff application to plasma separations was recognized, which also resulted in a provisional patent application. (That provisional patent application, however, was not pursued further.) Alpha channeling entails injecting waves into magnetically confined plasma to release energy from one particular ion while ejecting that ion. The ejection of the ion is actually a concomitant effect in releasing energy from the ion to the wave. In rotating plasma, there is the opportunity to store the energy in a radial electric field rather than in waves. In other words, the ejected alpha particle loses its energy to the radial potential, which in turn produces plasma rotation. This is a very useful effect, since producing radial electric fields by other means are technologically more difficult. In fact, one can heat ions, and then eject them, to produce the desired radial field. In each case, there is a separation effect of different ions, which generalizes the original alpha-channeling concept of separating alpha ash from hydrogen. In a further generalization of the separation concept, a double-well filter represents a new way to produce high-throughput separations of ions, potentially useful for nuclear waste remediation.

In-Storage Embedded Accelerator for Sparse Pattern Processing

OpenAIRE

Jun, Sang-Woo; Nguyen, Huy T.; Gadepally, Vijay N.; Arvind

2016-01-01

We present a novel architecture for sparse pattern processing, using flash storage with embedded accelerators. Sparse pattern processing on large data sets is the essence of applications such as document search, natural language processing, bioinformatics, subgraph matching, machine learning, and graph processing. One slice of our prototype accelerator is capable of handling up to 1TB of data, and experiments show that it can outperform C/C++ software solutions on a 16-core system at a fracti...

Process Knowledge Discovery Using Sparse Principal Component Analysis

DEFF Research Database (Denmark)

Gao, Huihui; Gajjar, Shriram; Kulahci, Murat

2016-01-01

As the goals of ensuring process safety and energy efficiency become ever more challenging, engineers increasingly rely on data collected from such processes for informed decision making. During recent decades, extracting and interpreting valuable process information from large historical data sets...... SPCA approach that helps uncover the underlying process knowledge regarding variable relations. This approach systematically determines the optimal sparse loadings for each sparse PC while improving interpretability and minimizing information loss. The salient features of the proposed approach...

Massively parallel sparse matrix function calculations with NTPoly

Science.gov (United States)

Dawson, William; Nakajima, Takahito

2018-04-01

We present NTPoly, a massively parallel library for computing the functions of sparse, symmetric matrices. The theory of matrix functions is a well developed framework with a wide range of applications including differential equations, graph theory, and electronic structure calculations. One particularly important application area is diagonalization free methods in quantum chemistry. When the input and output of the matrix function are sparse, methods based on polynomial expansions can be used to compute matrix functions in linear time. We present a library based on these methods that can compute a variety of matrix functions. Distributed memory parallelization is based on a communication avoiding sparse matrix multiplication algorithm. OpenMP task parallellization is utilized to implement hybrid parallelization. We describe NTPoly's interface and show how it can be integrated with programs written in many different programming languages. We demonstrate the merits of NTPoly by performing large scale calculations on the K computer.

Deformable segmentation via sparse representation and dictionary learning.

Science.gov (United States)

Zhang, Shaoting; Zhan, Yiqiang; Metaxas, Dimitris N

2012-10-01

"Shape" and "appearance", the two pillars of a deformable model, complement each other in object segmentation. In many medical imaging applications, while the low-level appearance information is weak or mis-leading, shape priors play a more important role to guide a correct segmentation, thanks to the strong shape characteristics of biological structures. Recently a novel shape prior modeling method has been proposed based on sparse learning theory. Instead of learning a generative shape model, shape priors are incorporated on-the-fly through the sparse shape composition (SSC). SSC is robust to non-Gaussian errors and still preserves individual shape characteristics even when such characteristics is not statistically significant. Although it seems straightforward to incorporate SSC into a deformable segmentation framework as shape priors, the large-scale sparse optimization of SSC has low runtime efficiency, which cannot satisfy clinical requirements. In this paper, we design two strategies to decrease the computational complexity of SSC, making a robust, accurate and efficient deformable segmentation system. (1) When the shape repository contains a large number of instances, which is often the case in 2D problems, K-SVD is used to learn a more compact but still informative shape dictionary. (2) If the derived shape instance has a large number of vertices, which often appears in 3D problems, an affinity propagation method is used to partition the surface into small sub-regions, on which the sparse shape composition is performed locally. Both strategies dramatically decrease the scale of the sparse optimization problem and hence speed up the algorithm. Our method is applied on a diverse set of biomedical image analysis problems. Compared to the original SSC, these two newly-proposed modules not only significant reduce the computational complexity, but also improve the overall accuracy. Copyright © 2012 Elsevier B.V. All rights reserved.

Sparseness- and continuity-constrained seismic imaging

Science.gov (United States)

Herrmann, Felix J.

2005-04-01

Non-linear solution strategies to the least-squares seismic inverse-scattering problem with sparseness and continuity constraints are proposed. Our approach is designed to (i) deal with substantial amounts of additive noise (SNR formulating the solution of the seismic inverse problem in terms of an optimization problem. During the optimization, sparseness on the basis and continuity along the reflectors are imposed by jointly minimizing the l1- and anisotropic diffusion/total-variation norms on the coefficients and reflectivity, respectively. [Joint work with Peyman P. Moghaddam was carried out as part of the SINBAD project, with financial support secured through ITF (the Industry Technology Facilitator) from the following organizations: BG Group, BP, ExxonMobil, and SHELL. Additional funding came from the NSERC Discovery Grants 22R81254.

Combinatorial Algorithms for Computing Column Space Bases ThatHave Sparse Inverses

Energy Technology Data Exchange (ETDEWEB)

Pinar, Ali; Chow, Edmond; Pothen, Alex

2005-03-18

This paper presents a combinatorial study on the problem ofconstructing a sparse basis forthe null-space of a sparse, underdetermined, full rank matrix, A. Such a null-space is suitable forsolving solving many saddle point problems. Our approach is to form acolumn space basis of A that has a sparse inverse, by selecting suitablecolumns of A. This basis is then used to form a sparse null-space basisin fundamental form. We investigate three different algorithms forcomputing the column space basis: Two greedy approaches that rely onmatching, and a third employing a divide and conquer strategy implementedwith hypergraph partitioning followed by the greedy approach. We alsodiscuss the complexity of selecting a column basis when it is known thata block diagonal basis exists with a small given block size.

Image Super-Resolution Algorithm Based on an Improved Sparse Autoencoder

Directory of Open Access Journals (Sweden)

Detian Huang

2018-01-01

Full Text Available Due to the limitations of the resolution of the imaging system and the influence of scene changes and other factors, sometimes only low-resolution images can be acquired, which cannot satisfy the practical application’s requirements. To improve the quality of low-resolution images, a novel super-resolution algorithm based on an improved sparse autoencoder is proposed. Firstly, in the training set preprocessing stage, the high- and low-resolution image training sets are constructed, respectively, by using high-frequency information of the training samples as the characterization, and then the zero-phase component analysis whitening technique is utilized to decorrelate the formed joint training set to reduce its redundancy. Secondly, a constructed sparse regularization term is added to the cost function of the traditional sparse autoencoder to further strengthen the sparseness constraint on the hidden layer. Finally, in the dictionary learning stage, the improved sparse autoencoder is adopted to achieve unsupervised dictionary learning to improve the accuracy and stability of the dictionary. Experimental results validate that the proposed algorithm outperforms the existing algorithms both in terms of the subjective visual perception and the objective evaluation indices, including the peak signal-to-noise ratio and the structural similarity measure.

Diagnosis and prognosis of Ostheoarthritis by texture analysis using sparse linear models

DEFF Research Database (Denmark)

Marques, Joselene; Clemmensen, Line Katrine Harder; Dam, Erik

We present a texture analysis methodology that combines uncommitted machine-learning techniques and sparse feature transformation methods in a fully automatic framework. We compare the performances of a partial least squares (PLS) forward feature selection strategy to a hard threshold sparse PLS...... algorithm and a sparse linear discriminant model. The texture analysis framework was applied to diagnosis of knee osteoarthritis (OA) and prognosis of cartilage loss. For this investigation, a generic texture feature bank was extracted from magnetic resonance images of tibial knee bone. The features were...... used as input to the sparse algorithms, which dened the best features to retain in the model. To cope with the limited number of samples, the data was evaluated using 10 fold cross validation (CV). The diagnosis evaluation using sparse PLS reached a generalization area-under-the-ROC curve (AUC) of 0...

Efficient implementations of block sparse matrix operations on shared memory vector machines

International Nuclear Information System (INIS)

Washio, T.; Maruyama, K.; Osoda, T.; Doi, S.; Shimizu, F.

2000-01-01

In this paper, we propose vectorization and shared memory-parallelization techniques for block-type random sparse matrix operations in finite element (FEM) applications. Here, a block corresponds to unknowns on one node in the FEM mesh and we assume that the block size is constant over the mesh. First, we discuss some basic vectorization ideas (the jagged diagonal (JAD) format and the segmented scan algorithm) for the sparse matrix-vector product. Then, we extend these ideas to the shared memory parallelization. After that, we show that the techniques can be applied not only to the sparse matrix-vector product but also to the sparse matrix-matrix product, the incomplete or complete sparse LU factorization and preconditioning. Finally, we report the performance evaluation results obtained on an NEC SX-4 shared memory vector machine for linear systems in some FEM applications. (author)

Sparse grid-based polynomial chaos expansion for aerodynamics of an airfoil with uncertainties

Directory of Open Access Journals (Sweden)

Xiaojing WU

2018-05-01

Full Text Available The uncertainties can generate fluctuations with aerodynamic characteristics. Uncertainty Quantification (UQ is applied to compute its impact on the aerodynamic characteristics. In addition, the contribution of each uncertainty to aerodynamic characteristics should be computed by uncertainty sensitivity analysis. Non-Intrusive Polynomial Chaos (NIPC has been successfully applied to uncertainty quantification and uncertainty sensitivity analysis. However, the non-intrusive polynomial chaos method becomes inefficient as the number of random variables adopted to describe uncertainties increases. This deficiency becomes significant in stochastic aerodynamic analysis considering the geometric uncertainty because the description of geometric uncertainty generally needs many parameters. To solve the deficiency, a Sparse Grid-based Polynomial Chaos (SGPC expansion is used to do uncertainty quantification and sensitivity analysis for stochastic aerodynamic analysis considering geometric and operational uncertainties. It is proved that the method is more efficient than non-intrusive polynomial chaos and Monte Carlo Simulation (MSC method for the stochastic aerodynamic analysis. By uncertainty quantification, it can be learnt that the flow characteristics of shock wave and boundary layer separation are sensitive to the geometric uncertainty in transonic region. The uncertainty sensitivity analysis reveals the individual and coupled effects among the uncertainty parameters. Keywords: Non-intrusive polynomial chaos, Sparse grid, Stochastic aerodynamic analysis, Uncertainty sensitivity analysis, Uncertainty quantification

A Projected Conjugate Gradient Method for Sparse Minimax Problems

DEFF Research Database (Denmark)

Madsen, Kaj; Jonasson, Kristjan

1993-01-01

A new method for nonlinear minimax problems is presented. The method is of the trust region type and based on sequential linear programming. It is a first order method that only uses first derivatives and does not approximate Hessians. The new method is well suited for large sparse problems...... as it only requires that software for sparse linear programming and a sparse symmetric positive definite equation solver are available. On each iteration a special linear/quadratic model of the function is minimized, but contrary to the usual practice in trust region methods the quadratic model is only...... with the method are presented. In fact, we find that the number of iterations required is comparable to that of state-of-the-art quasi-Newton codes....

Identification of MIMO systems with sparse transfer function coefficients

Science.gov (United States)

Qiu, Wanzhi; Saleem, Syed Khusro; Skafidas, Efstratios

2012-12-01

We study the problem of estimating transfer functions of multivariable (multiple-input multiple-output--MIMO) systems with sparse coefficients. We note that subspace identification methods are powerful and convenient tools in dealing with MIMO systems since they neither require nonlinear optimization nor impose any canonical form on the systems. However, subspace-based methods are inefficient for systems with sparse transfer function coefficients since they work on state space models. We propose a two-step algorithm where the first step identifies the system order using the subspace principle in a state space format, while the second step estimates coefficients of the transfer functions via L1-norm convex optimization. The proposed algorithm retains good features of subspace methods with improved noise-robustness for sparse systems.

MULTISCALE SPARSE APPEARANCE MODELING AND SIMULATION OF PATHOLOGICAL DEFORMATIONS

Directory of Open Access Journals (Sweden)

Rami Zewail

2017-08-01

Full Text Available Machine learning and statistical modeling techniques has drawn much interest within the medical imaging research community. However, clinically-relevant modeling of anatomical structures continues to be a challenging task. This paper presents a novel method for multiscale sparse appearance modeling in medical images with application to simulation of pathological deformations in X-ray images of human spine. The proposed appearance model benefits from the non-linear approximation power of Contourlets and its ability to capture higher order singularities to achieve a sparse representation while preserving the accuracy of the statistical model. Independent Component Analysis is used to extract statistical independent modes of variations from the sparse Contourlet-based domain. The new model is then used to simulate clinically-relevant pathological deformations in radiographic images.

An Adaptive Sparse Grid Algorithm for Elliptic PDEs with Lognormal Diffusion Coefficient

KAUST Repository

Nobile, Fabio

2016-03-18

In this work we build on the classical adaptive sparse grid algorithm (T. Gerstner and M. Griebel, Dimension-adaptive tensor-product quadrature), obtaining an enhanced version capable of using non-nested collocation points, and supporting quadrature and interpolation on unbounded sets. We also consider several profit indicators that are suitable to drive the adaptation process. We then use such algorithm to solve an important test case in Uncertainty Quantification problem, namely the Darcy equation with lognormal permeability random field, and compare the results with those obtained with the quasi-optimal sparse grids based on profit estimates, which we have proposed in our previous works (cf. e.g. Convergence of quasi-optimal sparse grids approximation of Hilbert-valued functions: application to random elliptic PDEs). To treat the case of rough permeability fields, in which a sparse grid approach may not be suitable, we propose to use the adaptive sparse grid quadrature as a control variate in a Monte Carlo simulation. Numerical results show that the adaptive sparse grids have performances similar to those of the quasi-optimal sparse grids and are very effective in the case of smooth permeability fields. Moreover, their use as control variate in a Monte Carlo simulation allows to tackle efficiently also problems with rough coefficients, significantly improving the performances of a standard Monte Carlo scheme.

Dual-Channel, Molecular-Sieving Core/Shell ZIF@MOF Architectures as Engineered Fillers in Hybrid Membranes for Highly Selective CO2 Separation.

Science.gov (United States)

Song, Zhuonan; Qiu, Fen; Zaia, Edmond W; Wang, Zhongying; Kunz, Martin; Guo, Jinghua; Brady, Michael; Mi, Baoxia; Urban, Jeffrey J

2017-11-08

A novel core/shell porous crystalline structure was prepared using a large pore metal organic framework (MOF, UiO-66-NH 2 , pore size, ∼ 0.6 nm) as core surrounded by a small pore zeolitic imidazolate framework (ZIF, ZIF-8, pore size, ∼ 0.4 nm) through a layer-by-layer deposition method and subsequently used as an engineered filler to construct hybrid polysulfone (PSF) membranes for CO 2 capture. Compared to traditional fillers utilizing only one type of porous material with rigid channels (either large or small), our custom designed core/shell fillers possess clear advantages via pore engineering: the large internal channels of the UiO-66-NH 2 MOFs create molecular highways to accelerate molecular transport through the membrane, while the thin shells with small pores (ZIF-8) or even smaller pores generated at the interface by the imperfect registry between the overlapping pores of ZIF and MOF enhance molecular sieving thus serving to distinguish slightly larger N 2 molecules (kinetic diameter, 0.364 nm) from smaller CO 2 molecules (kinetic diameter, 0.33 nm). The resultant core/shell ZIF@MOF and as-prepared hybrid PSF membranes were characterized by transmission electron microscopy, X-ray diffraction, wide-angle X-ray scattering, scanning electron microscopy, Fourier transform infrared, thermogravimetric analysis, differential scanning calorimetry, and contact angle tests. The dependence of the separation performance of the membranes on the MOF/ZIF ratio was also studied by varying the number of layers of ZIF coatings. The integrated PSF-ZIF@MOF hybrid membrane (40 wt % loading) with optimized ZIF coating cycles showed improved hydrophobicity and excellent CO 2 separation performance by simultaneously increasing CO 2 permeability (CO 2 permeability of 45.2 barrer, 710% higher than PSF membrane) and CO 2 /N 2 selectivity (CO 2 /N 2 selectivity of 39, 50% higher than PSF membrane), which is superior to most reported hybrid PSF membranes. The strategy of using

Inference algorithms and learning theory for Bayesian sparse factor analysis

International Nuclear Information System (INIS)

Rattray, Magnus; Sharp, Kevin; Stegle, Oliver; Winn, John

2009-01-01

Bayesian sparse factor analysis has many applications; for example, it has been applied to the problem of inferring a sparse regulatory network from gene expression data. We describe a number of inference algorithms for Bayesian sparse factor analysis using a slab and spike mixture prior. These include well-established Markov chain Monte Carlo (MCMC) and variational Bayes (VB) algorithms as well as a novel hybrid of VB and Expectation Propagation (EP). For the case of a single latent factor we derive a theory for learning performance using the replica method. We compare the MCMC and VB/EP algorithm results with simulated data to the theoretical prediction. The results for MCMC agree closely with the theory as expected. Results for VB/EP are slightly sub-optimal but show that the new algorithm is effective for sparse inference. In large-scale problems MCMC is infeasible due to computational limitations and the VB/EP algorithm then provides a very useful computationally efficient alternative.

Inference algorithms and learning theory for Bayesian sparse factor analysis

Energy Technology Data Exchange (ETDEWEB)

Rattray, Magnus; Sharp, Kevin [School of Computer Science, University of Manchester, Manchester M13 9PL (United Kingdom); Stegle, Oliver [Max-Planck-Institute for Biological Cybernetics, Tuebingen (Germany); Winn, John, E-mail: magnus.rattray@manchester.ac.u [Microsoft Research Cambridge, Roger Needham Building, Cambridge, CB3 0FB (United Kingdom)

2009-12-01

Bayesian sparse factor analysis has many applications; for example, it has been applied to the problem of inferring a sparse regulatory network from gene expression data. We describe a number of inference algorithms for Bayesian sparse factor analysis using a slab and spike mixture prior. These include well-established Markov chain Monte Carlo (MCMC) and variational Bayes (VB) algorithms as well as a novel hybrid of VB and Expectation Propagation (EP). For the case of a single latent factor we derive a theory for learning performance using the replica method. We compare the MCMC and VB/EP algorithm results with simulated data to the theoretical prediction. The results for MCMC agree closely with the theory as expected. Results for VB/EP are slightly sub-optimal but show that the new algorithm is effective for sparse inference. In large-scale problems MCMC is infeasible due to computational limitations and the VB/EP algorithm then provides a very useful computationally efficient alternative.

Multi-channel polarized thermal emitter

Science.gov (United States)

Lee, Jae-Hwang; Ho, Kai-Ming; Constant, Kristen P

2013-07-16

A multi-channel polarized thermal emitter (PTE) is presented. The multi-channel PTE can emit polarized thermal radiation without using a polarizer at normal emergence. The multi-channel PTE consists of two layers of metallic gratings on a monolithic and homogeneous metallic plate. It can be fabricated by a low-cost soft lithography technique called two-polymer microtransfer molding. The spectral positions of the mid-infrared (MIR) radiation peaks can be tuned by changing the periodicity of the gratings and the spectral separation between peaks are tuned by changing the mutual angle between the orientations of the two gratings.

Universal Regularizers For Robust Sparse Coding and Modeling

OpenAIRE

Ramirez, Ignacio; Sapiro, Guillermo

2010-01-01

Sparse data models, where data is assumed to be well represented as a linear combination of a few elements from a dictionary, have gained considerable attention in recent years, and their use has led to state-of-the-art results in many signal and image processing tasks. It is now well understood that the choice of the sparsity regularization term is critical in the success of such models. Based on a codelength minimization interpretation of sparse coding, and using tools from universal coding...

Deep ensemble learning of sparse regression models for brain disease diagnosis.

Science.gov (United States)

Suk, Heung-Il; Lee, Seong-Whan; Shen, Dinggang

2017-04-01

Recent studies on brain imaging analysis witnessed the core roles of machine learning techniques in computer-assisted intervention for brain disease diagnosis. Of various machine-learning techniques, sparse regression models have proved their effectiveness in handling high-dimensional data but with a small number of training samples, especially in medical problems. In the meantime, deep learning methods have been making great successes by outperforming the state-of-the-art performances in various applications. In this paper, we propose a novel framework that combines the two conceptually different methods of sparse regression and deep learning for Alzheimer's disease/mild cognitive impairment diagnosis and prognosis. Specifically, we first train multiple sparse regression models, each of which is trained with different values of a regularization control parameter. Thus, our multiple sparse regression models potentially select different feature subsets from the original feature set; thereby they have different powers to predict the response values, i.e., clinical label and clinical scores in our work. By regarding the response values from our sparse regression models as target-level representations, we then build a deep convolutional neural network for clinical decision making, which thus we call 'Deep Ensemble Sparse Regression Network.' To our best knowledge, this is the first work that combines sparse regression models with deep neural network. In our experiments with the ADNI cohort, we validated the effectiveness of the proposed method by achieving the highest diagnostic accuracies in three classification tasks. We also rigorously analyzed our results and compared with the previous studies on the ADNI cohort in the literature. Copyright © 2017 Elsevier B.V. All rights reserved.

Hierarchical Bayesian sparse image reconstruction with application to MRFM.

Science.gov (United States)

Dobigeon, Nicolas; Hero, Alfred O; Tourneret, Jean-Yves

2009-09-01

This paper presents a hierarchical Bayesian model to reconstruct sparse images when the observations are obtained from linear transformations and corrupted by an additive white Gaussian noise. Our hierarchical Bayes model is well suited to such naturally sparse image applications as it seamlessly accounts for properties such as sparsity and positivity of the image via appropriate Bayes priors. We propose a prior that is based on a weighted mixture of a positive exponential distribution and a mass at zero. The prior has hyperparameters that are tuned automatically by marginalization over the hierarchical Bayesian model. To overcome the complexity of the posterior distribution, a Gibbs sampling strategy is proposed. The Gibbs samples can be used to estimate the image to be recovered, e.g., by maximizing the estimated posterior distribution. In our fully Bayesian approach, the posteriors of all the parameters are available. Thus, our algorithm provides more information than other previously proposed sparse reconstruction methods that only give a point estimate. The performance of the proposed hierarchical Bayesian sparse reconstruction method is illustrated on synthetic data and real data collected from a tobacco virus sample using a prototype MRFM instrument.

Volumetric CT with sparse detector arrays (and application to Si-strip photon counters).

Science.gov (United States)

Sisniega, A; Zbijewski, W; Stayman, J W; Xu, J; Taguchi, K; Fredenberg, E; Lundqvist, Mats; Siewerdsen, J H

2016-01-07

Novel x-ray medical imaging sensors, such as photon counting detectors (PCDs) and large area CCD and CMOS cameras can involve irregular and/or sparse sampling of the detector plane. Application of such detectors to CT involves undersampling that is markedly different from the commonly considered case of sparse angular sampling. This work investigates volumetric sampling in CT systems incorporating sparsely sampled detectors with axial and helical scan orbits and evaluates performance of model-based image reconstruction (MBIR) with spatially varying regularization in mitigating artifacts due to sparse detector sampling. Volumetric metrics of sampling density and uniformity were introduced. Penalized-likelihood MBIR with a spatially varying penalty that homogenized resolution by accounting for variations in local sampling density (i.e. detector gaps) was evaluated. The proposed methodology was tested in simulations and on an imaging bench based on a Si-strip PCD (total area 5 cm  ×  25 cm) consisting of an arrangement of line sensors separated by gaps of up to 2.5 mm. The bench was equipped with translation/rotation stages allowing a variety of scanning trajectories, ranging from a simple axial acquisition to helical scans with variable pitch. Statistical (spherical clutter) and anthropomorphic (hand) phantoms were considered. Image quality was compared to that obtained with a conventional uniform penalty in terms of structural similarity index (SSIM), image uniformity, spatial resolution, contrast, and noise. Scan trajectories with intermediate helical width (~10 mm longitudinal distance per 360° rotation) demonstrated optimal tradeoff between the average sampling density and the homogeneity of sampling throughout the volume. For a scan trajectory with 10.8 mm helical width, the spatially varying penalty resulted in significant visual reduction of sampling artifacts, confirmed by a 10% reduction in minimum SSIM (from 0.88 to 0.8) and a 40

Using dynamic mode decomposition for real-time background/foreground separation in video

Science.gov (United States)

Kutz, Jose Nathan; Grosek, Jacob; Brunton, Steven; Fu, Xing; Pendergrass, Seth

2017-06-06

The technique of dynamic mode decomposition (DMD) is disclosed herein for the purpose of robustly separating video frames into background (low-rank) and foreground (sparse) components in real-time. Foreground/background separation is achieved at the computational cost of just one singular value decomposition (SVD) and one linear equation solve, thus producing results orders of magnitude faster than robust principal component analysis (RPCA). Additional techniques, including techniques for analyzing the video for multi-resolution time-scale components, and techniques for reusing computations to allow processing of streaming video in real time, are also described herein.

Predictive spatio-temporal model for spatially sparse global solar radiation data

International Nuclear Information System (INIS)

André, Maïna; Dabo-Niang, Sophie; Soubdhan, Ted; Ould-Baba, Hanany

2016-01-01

This paper introduces a new approach for the forecasting of solar radiation series at a located station for very short time scale. We built a multivariate model in using few stations (3 stations) separated with irregular distances from 26 km to 56 km. The proposed model is a spatio temporal vector autoregressive VAR model specifically designed for the analysis of spatially sparse spatio-temporal data. This model differs from classic linear models in using spatial and temporal parameters where the available predictors are the lagged values at each station. A spatial structure of stations is defined by the sequential introduction of predictors in the model. Moreover, an iterative strategy in the process of our model will select the necessary stations removing the uninteresting predictors and also selecting the optimal p-order. We studied the performance of this model. The metric error, the relative root mean squared error (rRMSE), is presented at different short time scales. Moreover, we compared the results of our model to simple and well known persistence model and those found in literature. - Highlights: • A spatio-temporal VAR forecast model is used for spatially sparse data solar. • Lags and locations are selected by an optimization strategy. • Definition of spatial ordering of predictors influences forecasting results. • The model shows a better performance predictive at 30 min ahead in our context. • Benchmarking study shows a more accurate forecast at 1 h ahead with spatio-temporal VAR.

Centrifugal sedimentation for selectively packing channels with silica microbeads in three-dimensional micro/nanofluidic devices.

Science.gov (United States)

Gong, Maojun; Bohn, Paul W; Sweedler, Jonathan V

2009-03-01

Incorporation of nanofluidic elements into microfluidic channels is one approach for adding filtration and partition functionality to planar microfluidic devices, as well as providing enhanced biomolecular separations. Here we introduce a strategy to pack microfluidic channels with silica nanoparticles and microbeads, thereby indirectly producing functional nanostructures; the method allows selected channels to be packed, here demonstrated so that a separation channel is packed while keeping an injection channel unpacked. A nanocapillary array membrane is integrated between two patterned microfluidic channels that cross each other in vertically separated layers. The membrane serves both as a frit for bead packing and as a fluid communication conduit between microfluidic channels. Centrifugal force-assisted sedimentation is then used to selectively pack the microfluidic channels using an aqueous silica bead suspension loaded into the appropriate inlet reservoirs. This packing approach may be used to simultaneously pack multiple channels with silica microbeads having different sizes and surface properties. The chip design and packing method introduced here are suitable for packing silica particles in sizes ranging from nanometers to micrometers and allow rapid (approximately 10 min) packing with high quality. The liquid/analyte transport characteristics of these packed micro/nanofluidic devices have potential utility in a wide range of applications, including electroosmotic pumping, liquid chromatographic separations, and electrochromatography.

Separation of a single photon and products of the π0, η and K0s meson neutral decay channels using neural network

International Nuclear Information System (INIS)

Bandurin, D.V.; Skachkov, N.B.

2004-01-01

The artificial neural network approach is used for separation of signals from a single photon and products of the π 0 , η and K s 0 meson neutral decay channels on the basis of the data from the CMS electromagnetic calorimeter alone. Rejection values for the three types of mesons as a function of single photon selection efficiencies are obtained for two pseudorapidity regions and initial Et of 20, 40, 60 and 100 GeV. (author)

Robust Fringe Projection Profilometry via Sparse Representation.

Science.gov (United States)

Budianto; Lun, Daniel P K

2016-04-01

In this paper, a robust fringe projection profilometry (FPP) algorithm using the sparse dictionary learning and sparse coding techniques is proposed. When reconstructing the 3D model of objects, traditional FPP systems often fail to perform if the captured fringe images have a complex scene, such as having multiple and occluded objects. It introduces great difficulty to the phase unwrapping process of an FPP system that can result in serious distortion in the final reconstructed 3D model. For the proposed algorithm, it encodes the period order information, which is essential to phase unwrapping, into some texture patterns and embeds them to the projected fringe patterns. When the encoded fringe image is captured, a modified morphological component analysis and a sparse classification procedure are performed to decode and identify the embedded period order information. It is then used to assist the phase unwrapping process to deal with the different artifacts in the fringe images. Experimental results show that the proposed algorithm can significantly improve the robustness of an FPP system. It performs equally well no matter the fringe images have a simple or complex scene, or are affected due to the ambient lighting of the working environment.

Multichannel deconvolution and source detection using sparse representations: application to Fermi project

International Nuclear Information System (INIS)

Schmitt, Jeremy

2011-01-01

This thesis presents new methods for spherical Poisson data analysis for the Fermi mission. Fermi main scientific objectives, the study of diffuse galactic background et the building of the source catalog, are complicated by the weakness of photon flux and the point spread function of the instrument. This thesis proposes a new multi-scale representation for Poisson data on the sphere, the Multi-Scale Variance Stabilizing Transform on the Sphere (MS-VSTS), consisting in the combination of a spherical multi-scale transform (wavelets, curvelets) with a variance stabilizing transform (VST). This method is applied to mono- and multichannel Poisson noise removal, missing data interpolation, background extraction and multichannel deconvolution. Finally, this thesis deals with the problem of component separation using sparse representations (template fitting). (author) [fr

Sparse DOA estimation with polynomial rooting

DEFF Research Database (Denmark)

Xenaki, Angeliki; Gerstoft, Peter; Fernandez Grande, Efren

2015-01-01

Direction-of-arrival (DOA) estimation involves the localization of a few sources from a limited number of observations on an array of sensors. Thus, DOA estimation can be formulated as a sparse signal reconstruction problem and solved efficiently with compressive sensing (CS) to achieve highresol......Direction-of-arrival (DOA) estimation involves the localization of a few sources from a limited number of observations on an array of sensors. Thus, DOA estimation can be formulated as a sparse signal reconstruction problem and solved efficiently with compressive sensing (CS) to achieve...... highresolution imaging. Utilizing the dual optimal variables of the CS optimization problem, it is shown with Monte Carlo simulations that the DOAs are accurately reconstructed through polynomial rooting (Root-CS). Polynomial rooting is known to improve the resolution in several other DOA estimation methods...

A General Sparse Tensor Framework for Electronic Structure Theory.

Science.gov (United States)

Manzer, Samuel; Epifanovsky, Evgeny; Krylov, Anna I; Head-Gordon, Martin

2017-03-14

Linear-scaling algorithms must be developed in order to extend the domain of applicability of electronic structure theory to molecules of any desired size. However, the increasing complexity of modern linear-scaling methods makes code development and maintenance a significant challenge. A major contributor to this difficulty is the lack of robust software abstractions for handling block-sparse tensor operations. We therefore report the development of a highly efficient symbolic block-sparse tensor library in order to provide access to high-level software constructs to treat such problems. Our implementation supports arbitrary multi-dimensional sparsity in all input and output tensors. We avoid cumbersome machine-generated code by implementing all functionality as a high-level symbolic C++ language library and demonstrate that our implementation attains very high performance for linear-scaling sparse tensor contractions.

The Cortex Transform as an image preprocessor for sparse distributed memory: An initial study

Science.gov (United States)

Olshausen, Bruno; Watson, Andrew

1990-01-01

An experiment is described which was designed to evaluate the use of the Cortex Transform as an image processor for Sparse Distributed Memory (SDM). In the experiment, a set of images were injected with Gaussian noise, preprocessed with the Cortex Transform, and then encoded into bit patterns. The various spatial frequency bands of the Cortex Transform were encoded separately so that they could be evaluated based on their ability to properly cluster patterns belonging to the same class. The results of this study indicate that by simply encoding the low pass band of the Cortex Transform, a very suitable input representation for the SDM can be achieved.

Marketing channel behaviour and performance

OpenAIRE

Duarte, Margarida

2000-01-01

Thesis submitted to University of Manchester for the degree of Doctor of Philosophy in the Faculty of Business Administration. A major aim of this study is to offer a relatively comprehensive picture of marketing channel behaviour and performance. Given the statistical difficulties in testing a very large, comprehensive model to achieve this aim, two separate but overlapping models are proposed. One model specifically addresses behaviour in marketing channels, while the other integrates k...

Improving residue-residue contact prediction via low-rank and sparse decomposition of residue correlation matrix.

Science.gov (United States)

Zhang, Haicang; Gao, Yujuan; Deng, Minghua; Wang, Chao; Zhu, Jianwei; Li, Shuai Cheng; Zheng, Wei-Mou; Bu, Dongbo

2016-03-25

Strategies for correlation analysis in protein contact prediction often encounter two challenges, namely, the indirect coupling among residues, and the background correlations mainly caused by phylogenetic biases. While various studies have been conducted on how to disentangle indirect coupling, the removal of background correlations still remains unresolved. Here, we present an approach for removing background correlations via low-rank and sparse decomposition (LRS) of a residue correlation matrix. The correlation matrix can be constructed using either local inference strategies (e.g., mutual information, or MI) or global inference strategies (e.g., direct coupling analysis, or DCA). In our approach, a correlation matrix was decomposed into two components, i.e., a low-rank component representing background correlations, and a sparse component representing true correlations. Finally the residue contacts were inferred from the sparse component of correlation matrix. We trained our LRS-based method on the PSICOV dataset, and tested it on both GREMLIN and CASP11 datasets. Our experimental results suggested that LRS significantly improves the contact prediction precision. For example, when equipped with the LRS technique, the prediction precision of MI and mfDCA increased from 0.25 to 0.67 and from 0.58 to 0.70, respectively (Top L/10 predicted contacts, sequence separation: 5 AA, dataset: GREMLIN). In addition, our LRS technique also consistently outperforms the popular denoising technique APC (average product correction), on both local (MI_LRS: 0.67 vs MI_APC: 0.34) and global measures (mfDCA_LRS: 0.70 vs mfDCA_APC: 0.67). Interestingly, we found out that when equipped with our LRS technique, local inference strategies performed in a comparable manner to that of global inference strategies, implying that the application of LRS technique narrowed down the performance gap between local and global inference strategies. Overall, our LRS technique greatly facilitates

Low-rank and sparse modeling for visual analysis

CERN Document Server

Fu, Yun

2014-01-01

This book provides a view of low-rank and sparse computing, especially approximation, recovery, representation, scaling, coding, embedding and learning among unconstrained visual data. The book includes chapters covering multiple emerging topics in this new field. It links multiple popular research fields in Human-Centered Computing, Social Media, Image Classification, Pattern Recognition, Computer Vision, Big Data, and Human-Computer Interaction. Contains an overview of the low-rank and sparse modeling techniques for visual analysis by examining both theoretical analysis and real-world applic

Real-time SPARSE-SENSE cardiac cine MR imaging: optimization of image reconstruction and sequence validation.

Science.gov (United States)

Goebel, Juliane; Nensa, Felix; Bomas, Bettina; Schemuth, Haemi P; Maderwald, Stefan; Gratz, Marcel; Quick, Harald H; Schlosser, Thomas; Nassenstein, Kai

2016-12-01

Improved real-time cardiac magnetic resonance (CMR) sequences have currently been introduced, but so far only limited practical experience exists. This study aimed at image reconstruction optimization and clinical validation of a new highly accelerated real-time cine SPARSE-SENSE sequence. Left ventricular (LV) short-axis stacks of a real-time free-breathing SPARSE-SENSE sequence with high spatiotemporal resolution and of a standard segmented cine SSFP sequence were acquired at 1.5 T in 11 volunteers and 15 patients. To determine the optimal iterations, all volunteers' SPARSE-SENSE images were reconstructed using 10-200 iterations, and contrast ratios, image entropies, and reconstruction times were assessed. Subsequently, the patients' SPARSE-SENSE images were reconstructed with the clinically optimal iterations. LV volumetric values were evaluated and compared between both sequences. Sufficient image quality and acceptable reconstruction times were achieved when using 80 iterations. Bland-Altman plots and Passing-Bablok regression showed good agreement for all volumetric parameters. 80 iterations are recommended for iterative SPARSE-SENSE image reconstruction in clinical routine. Real-time cine SPARSE-SENSE yielded comparable volumetric results as the current standard SSFP sequence. Due to its intrinsic low image acquisition times, real-time cine SPARSE-SENSE imaging with iterative image reconstruction seems to be an attractive alternative for LV function analysis. • A highly accelerated real-time CMR sequence using SPARSE-SENSE was evaluated. • SPARSE-SENSE allows free breathing in real-time cardiac cine imaging. • For clinically optimal SPARSE-SENSE image reconstruction, 80 iterations are recommended. • Real-time SPARSE-SENSE imaging yielded comparable volumetric results as the reference SSFP sequence. • The fast SPARSE-SENSE sequence is an attractive alternative to standard SSFP sequences.

Complex sparse spatial filter for decoding mixed frequency and phase coded steady-state visually evoked potentials.

Science.gov (United States)

Morikawa, Naoki; Tanaka, Toshihisa; Islam, Md Rabiul

2018-07-01

Mixed frequency and phase coding (FPC) can achieve the significant increase of the number of commands in steady-state visual evoked potential-based brain-computer interface (SSVEP-BCI). However, the inconsistent phases of the SSVEP over channels in a trial and the existence of non-contributing channels due to noise effects can decrease accurate detection of stimulus frequency. We propose a novel command detection method based on a complex sparse spatial filter (CSSF) by solving ℓ 1 - and ℓ 2,1 -regularization problems for a mixed-coded SSVEP-BCI. In particular, ℓ 2,1 -regularization (aka group sparsification) can lead to the rejection of electrodes that are not contributing to the SSVEP detection. A calibration data based canonical correlation analysis (CCA) and CSSF with ℓ 1 - and ℓ 2,1 -regularization cases were demonstrated for a 16-target stimuli with eleven subjects. The results of statistical test suggest that the proposed method with ℓ 1 - and ℓ 2,1 -regularization significantly achieved the highest ITR. The proposed approaches do not need any reference signals, automatically select prominent channels, and reduce the computational cost compared to the other mixed frequency-phase coding (FPC)-based BCIs. The experimental results suggested that the proposed method can be usable implementing BCI effectively with reduce visual fatigue. Copyright © 2018 Elsevier B.V. All rights reserved.

Security-enhanced phase encryption assisted by nonlinear optical correlation via sparse phase

International Nuclear Information System (INIS)

Chen, Wen; Chen, Xudong; Wang, Xiaogang

2015-01-01

We propose a method for security-enhanced phase encryption assisted by a nonlinear optical correlation via a sparse phase. Optical configurations are established based on a phase retrieval algorithm for embedding an input image and the secret data into phase-only masks. We found that when one or a few phase-only masks generated during data hiding are sparse, it is possible to integrate these sparse masks into those phase-only masks generated during the encoding of the input image. Synthesized phase-only masks are used for the recovery, and sparse distributions (i.e., binary maps) for generating the incomplete phase-only masks are considered as additional parameters for the recovery of secret data. It is difficult for unauthorized receivers to know that a useful phase has been sparsely distributed in the finally generated phase-only masks for secret-data recovery. Only when the secret data are correctly verified can the input image obtained with valid keys be claimed as targeted information. (paper)

Single and Multiple Object Tracking Using a Multi-Feature Joint Sparse Representation.

Science.gov (United States)

Hu, Weiming; Li, Wei; Zhang, Xiaoqin; Maybank, Stephen

2015-04-01

In this paper, we propose a tracking algorithm based on a multi-feature joint sparse representation. The templates for the sparse representation can include pixel values, textures, and edges. In the multi-feature joint optimization, noise or occlusion is dealt with using a set of trivial templates. A sparse weight constraint is introduced to dynamically select the relevant templates from the full set of templates. A variance ratio measure is adopted to adaptively adjust the weights of different features. The multi-feature template set is updated adaptively. We further propose an algorithm for tracking multi-objects with occlusion handling based on the multi-feature joint sparse reconstruction. The observation model based on sparse reconstruction automatically focuses on the visible parts of an occluded object by using the information in the trivial templates. The multi-object tracking is simplified into a joint Bayesian inference. The experimental results show the superiority of our algorithm over several state-of-the-art tracking algorithms.

Low-rank sparse learning for robust visual tracking

KAUST Repository

Zhang, Tianzhu

2012-01-01

In this paper, we propose a new particle-filter based tracking algorithm that exploits the relationship between particles (candidate targets). By representing particles as sparse linear combinations of dictionary templates, this algorithm capitalizes on the inherent low-rank structure of particle representations that are learned jointly. As such, it casts the tracking problem as a low-rank matrix learning problem. This low-rank sparse tracker (LRST) has a number of attractive properties. (1) Since LRST adaptively updates dictionary templates, it can handle significant changes in appearance due to variations in illumination, pose, scale, etc. (2) The linear representation in LRST explicitly incorporates background templates in the dictionary and a sparse error term, which enables LRST to address the tracking drift problem and to be robust against occlusion respectively. (3) LRST is computationally attractive, since the low-rank learning problem can be efficiently solved as a sequence of closed form update operations, which yield a time complexity that is linear in the number of particles and the template size. We evaluate the performance of LRST by applying it to a set of challenging video sequences and comparing it to 6 popular tracking methods. Our experiments show that by representing particles jointly, LRST not only outperforms the state-of-the-art in tracking accuracy but also significantly improves the time complexity of methods that use a similar sparse linear representation model for particles [1]. © 2012 Springer-Verlag.

MHD electrical boundary layer theory and applications to the performance of channels with partial wraparound electrodes

International Nuclear Information System (INIS)

Zwick, S.A.; Doss, E.D.; West Florida University, Pensacola, FL)

1981-01-01

Analytical methods are developed for calculating the potential and currents near boundary singularities caused by electrode edges or abrupt drops in conductivity or in the induction field. A three-dimensional control volume (finite-difference) model for solving the MHD electrical problems in oblique coordinates has been developed, which accounts for the near-wall singular behavior accurately and can be used with relatively sparse grids. Analyses based on the model indicate that, for practical generator design where the electrode pitch is in the order of 1 to 5 cm and the wall temperature less than 2100 K, the performance of diagonal conducting wall (DCW) channels is always superior to that of channels with insulating sidewalls, although the performance of insulating sidewall channel is better at higher wall temperatures. Sidewall electrode extensions up to a wraparound of about 20% of the channel height are shown to cause an increase in power output. The output of diagonally connected channels remains approximately the same for more than 20% wraparound whereas the power output of Faraday channels drops off with further extensions of the sidewall conductors

Group-sparse representation with dictionary learning for medical image denoising and fusion.

Science.gov (United States)

Li, Shutao; Yin, Haitao; Fang, Leyuan

2012-12-01

Recently, sparse representation has attracted a lot of interest in various areas. However, the standard sparse representation does not consider the intrinsic structure, i.e., the nonzero elements occur in clusters, called group sparsity. Furthermore, there is no dictionary learning method for group sparse representation considering the geometrical structure of space spanned by atoms. In this paper, we propose a novel dictionary learning method, called Dictionary Learning with Group Sparsity and Graph Regularization (DL-GSGR). First, the geometrical structure of atoms is modeled as the graph regularization. Then, combining group sparsity and graph regularization, the DL-GSGR is presented, which is solved by alternating the group sparse coding and dictionary updating. In this way, the group coherence of learned dictionary can be enforced small enough such that any signal can be group sparse coded effectively. Finally, group sparse representation with DL-GSGR is applied to 3-D medical image denoising and image fusion. Specifically, in 3-D medical image denoising, a 3-D processing mechanism (using the similarity among nearby slices) and temporal regularization (to perverse the correlations across nearby slices) are exploited. The experimental results on 3-D image denoising and image fusion demonstrate the superiority of our proposed denoising and fusion approaches.

Sparse electromagnetic imaging using nonlinear iterative shrinkage thresholding

KAUST Repository

Desmal, Abdulla; Bagci, Hakan

2015-01-01

A sparse nonlinear electromagnetic imaging scheme is proposed for reconstructing dielectric contrast of investigation domains from measured fields. The proposed approach constructs the optimization problem by introducing the sparsity constraint to the data misfit between the scattered fields expressed as a nonlinear function of the contrast and the measured fields and solves it using the nonlinear iterative shrinkage thresholding algorithm. The thresholding is applied to the result of every nonlinear Landweber iteration to enforce the sparsity constraint. Numerical results demonstrate the accuracy and efficiency of the proposed method in reconstructing sparse dielectric profiles.

Sparse electromagnetic imaging using nonlinear iterative shrinkage thresholding

KAUST Repository

Desmal, Abdulla

2015-04-13

A sparse nonlinear electromagnetic imaging scheme is proposed for reconstructing dielectric contrast of investigation domains from measured fields. The proposed approach constructs the optimization problem by introducing the sparsity constraint to the data misfit between the scattered fields expressed as a nonlinear function of the contrast and the measured fields and solves it using the nonlinear iterative shrinkage thresholding algorithm. The thresholding is applied to the result of every nonlinear Landweber iteration to enforce the sparsity constraint. Numerical results demonstrate the accuracy and efficiency of the proposed method in reconstructing sparse dielectric profiles.

Radiation gradient isotope separator

International Nuclear Information System (INIS)

Hughes, J.L.

1980-01-01

A system is described for transporting, separating and storing charged particles, charged antiparticles and fully or partially ionized isotopes of any element comprising a laser beam generator, laser beam intensity profiler, a laser beam variable intensity attenuator, and means for injecting charged particles, charged antiparticles and ionized isotopes into the beam and extracting them from the system as required. The invention is particularly useful for channelling electrons and ions used for fuel pellet compression in inertial fusion systems, for separating the isotopes of elements and for the confinement of charged antiparticles and particle/antiparticle plasmas

On the Automatic Parallelization of Sparse and Irregular Fortran Programs

Directory of Open Access Journals (Sweden)

Yuan Lin

1999-01-01

Full Text Available Automatic parallelization is usually believed to be less effective at exploiting implicit parallelism in sparse/irregular programs than in their dense/regular counterparts. However, not much is really known because there have been few research reports on this topic. In this work, we have studied the possibility of using an automatic parallelizing compiler to detect the parallelism in sparse/irregular programs. The study with a collection of sparse/irregular programs led us to some common loop patterns. Based on these patterns new techniques were derived that produced good speedups when manually applied to our benchmark codes. More importantly, these parallelization methods can be implemented in a parallelizing compiler and can be applied automatically.

The new secondary channel control system at TRIUMF

International Nuclear Information System (INIS)

Keitel, R.; Bishop, D.; Dale, D.; England, N.; Harrison, D.

1990-01-01

The control of the secondary channels at TRIUMF has been decentralized. Each channel is now controlled through a single CAMAC crate from an IBM PC in the experimental counting room. Intelligent motor controllers were developed to replace the ageing slit control system. Advanced features of the control software package TICS, such as computer optimization of channel parameters and high-voltage conditioning of the dc separators, are described. (orig.)

Split-Bregman-based sparse-view CT reconstruction

Energy Technology Data Exchange (ETDEWEB)

Vandeghinste, Bert; Vandenberghe, Stefaan [Ghent Univ. (Belgium). Medical Image and Signal Processing (MEDISIP); Goossens, Bart; Pizurica, Aleksandra; Philips, Wilfried [Ghent Univ. (Belgium). Image Processing and Interpretation Research Group (IPI); Beenhouwer, Jan de [Ghent Univ. (Belgium). Medical Image and Signal Processing (MEDISIP); Antwerp Univ., Wilrijk (Belgium). The Vision Lab; Staelens, Steven [Ghent Univ. (Belgium). Medical Image and Signal Processing (MEDISIP); Antwerp Univ., Edegem (Belgium). Molecular Imaging Centre Antwerp

2011-07-01

Total variation minimization has been extensively researched for image denoising and sparse view reconstruction. These methods show superior denoising performance for simple images with little texture, but result in texture information loss when applied to more complex images. It could thus be beneficial to use other regularizers within medical imaging. We propose a general regularization method, based on a split-Bregman approach. We show results for this framework combined with a total variation denoising operator, in comparison to ASD-POCS. We show that sparse-view reconstruction and noise regularization is possible. This general method will allow us to investigate other regularizers in the context of regularized CT reconstruction, and decrease the acquisition times in {mu}CT. (orig.)

A Vehicle Active Safety Model: Vehicle Speed Control Based on Driver Vigilance Detection Using Wearable EEG and Sparse Representation

Directory of Open Access Journals (Sweden)

Zutao Zhang

2016-02-01

Full Text Available In this paper, we present a vehicle active safety model for vehicle speed control based on driver vigilance detection using low-cost, comfortable, wearable electroencephalographic (EEG sensors and sparse representation. The proposed system consists of three main steps, namely wireless wearable EEG collection, driver vigilance detection, and vehicle speed control strategy. First of all, a homemade low-cost comfortable wearable brain-computer interface (BCI system with eight channels is designed for collecting the driver’s EEG signal. Second, wavelet de-noising and down-sample algorithms are utilized to enhance the quality of EEG data, and Fast Fourier Transformation (FFT is adopted to extract the EEG power spectrum density (PSD. In this step, sparse representation classification combined with k-singular value decomposition (KSVD is firstly introduced in PSD to estimate the driver’s vigilance level. Finally, a novel safety strategy of vehicle speed control, which controls the electronic throttle opening and automatic braking after driver fatigue detection using the above method, is presented to avoid serious collisions and traffic accidents. The simulation and practical testing results demonstrate the feasibility of the vehicle active safety model.

Continuous separation of submicron particles using Angled electrodes

International Nuclear Information System (INIS)

Yunus, Nurul A Md; Green, Nicolas G

2008-01-01

Dielectrophoretic separation of particles is achieved by the generation of electric forces on the particles by non-uniform electric fields. This paper presents a technique based on negative dielectrophoresis in a novel design of electrode array for the non-contact separation of polarisable particles. Angled electrodes are used to generate a lateral force in a microfluidic channel separating a mixed stream of particles into distinct streams of constituent components and achieving a high degree of spatial separation.

A framework for general sparse matrix-matrix multiplication on GPUs and heterogeneous processors

DEFF Research Database (Denmark)

Liu, Weifeng; Vinter, Brian

2015-01-01

General sparse matrix-matrix multiplication (SpGEMM) is a fundamental building block for numerous applications such as algebraic multigrid method (AMG), breadth first search and shortest path problem. Compared to other sparse BLAS routines, an efficient parallel SpGEMM implementation has to handle...... extra irregularity from three aspects: (1) the number of nonzero entries in the resulting sparse matrix is unknown in advance, (2) very expensive parallel insert operations at random positions in the resulting sparse matrix dominate the execution time, and (3) load balancing must account for sparse data...... memory space and efficiently utilizes the very limited on-chip scratchpad memory. Parallel insert operations of the nonzero entries are implemented through the GPU merge path algorithm that is experimentally found to be the fastest GPU merge approach. Load balancing builds on the number of necessary...

Optimal Couple Projections for Domain Adaptive Sparse Representation-based Classification.

Science.gov (United States)

Zhang, Guoqing; Sun, Huaijiang; Porikli, Fatih; Liu, Yazhou; Sun, Quansen

2017-08-29

In recent years, sparse representation based classification (SRC) is one of the most successful methods and has been shown impressive performance in various classification tasks. However, when the training data has a different distribution than the testing data, the learned sparse representation may not be optimal, and the performance of SRC will be degraded significantly. To address this problem, in this paper, we propose an optimal couple projections for domain-adaptive sparse representation-based classification (OCPD-SRC) method, in which the discriminative features of data in the two domains are simultaneously learned with the dictionary that can succinctly represent the training and testing data in the projected space. OCPD-SRC is designed based on the decision rule of SRC, with the objective to learn coupled projection matrices and a common discriminative dictionary such that the between-class sparse reconstruction residuals of data from both domains are maximized, and the within-class sparse reconstruction residuals of data are minimized in the projected low-dimensional space. Thus, the resulting representations can well fit SRC and simultaneously have a better discriminant ability. In addition, our method can be easily extended to multiple domains and can be kernelized to deal with the nonlinear structure of data. The optimal solution for the proposed method can be efficiently obtained following the alternative optimization method. Extensive experimental results on a series of benchmark databases show that our method is better or comparable to many state-of-the-art methods.

Continuous particle separation in a serpentine microchannel via negative and positive dielectrophoretic focusing

International Nuclear Information System (INIS)

Church, Christopher; Zhu, Junjie; Nieto, Juan; Keten, Gyunay; Ibarra, Erl; Xuan, Xiangchun

2010-01-01

Dielectrophoresis (DEP) has been widely used to focus and separate cells and particles in microfluidic devices. This work first demonstrates negative and positive dielectrophoretic focusing of particles in a serpentine microchannel by changing only the electric conductivity of the suspending fluid. Due to the channel turn-induced dielectrophoretic force, particles are focused to either the centerline or the sidewalls of the channel when their electric conductivity is lower (i.e. negative DEP) or higher (i.e. positive DEP) than that of the fluid. These distinctive dielectrophoretic focusing phenomena in a serpentine microchannel are then combined to implement a continuous separation between particles of different sizes and electric conductivities. Such separation eliminates the fabrication of in-channel microelectrodes or micro-insulators that are typically required in DEP-based separation techniques. A numerical model is also developed to predict the particle motion, and the simulation results agree reasonably with the observed particle focusing and separation behaviors.

Two-dimensional sparse wavenumber recovery for guided wavefields

Science.gov (United States)

Sabeti, Soroosh; Harley, Joel B.

2018-04-01

The multi-modal and dispersive behavior of guided waves is often characterized by their dispersion curves, which describe their frequency-wavenumber behavior. In prior work, compressive sensing based techniques, such as sparse wavenumber analysis (SWA), have been capable of recovering dispersion curves from limited data samples. A major limitation of SWA, however, is the assumption that the structure is isotropic. As a result, SWA fails when applied to composites and other anisotropic structures. There have been efforts to address this issue in the literature, but they either are not easily generalizable or do not sufficiently express the data. In this paper, we enhance the existing approaches by employing a two-dimensional wavenumber model to account for direction-dependent velocities in anisotropic media. We integrate this model with tools from compressive sensing to reconstruct a wavefield from incomplete data. Specifically, we create a modified two-dimensional orthogonal matching pursuit algorithm that takes an undersampled wavefield image, with specified unknown elements, and determines its sparse wavenumber characteristics. We then recover the entire wavefield from the sparse representations obtained with our small number of data samples.

Sparse matrix test collections

Energy Technology Data Exchange (ETDEWEB)

Duff, I.

1996-12-31

This workshop will discuss plans for coordinating and developing sets of test matrices for the comparison and testing of sparse linear algebra software. We will talk of plans for the next release (Release 2) of the Harwell-Boeing Collection and recent work on improving the accessibility of this Collection and others through the World Wide Web. There will only be three talks of about 15 to 20 minutes followed by a discussion from the floor.

Magnetic Separation Using HTS Bulk Magnet for Cs-Bearing Fe precipitates

Science.gov (United States)

Oka, T.; Ichiju, K.; Sasaki, S.; Ogawa, J.; Fukui, S.; Sato, T.; Ooizumi, M.; Yokoyama, K.; Aoki, S.; Ohnishi, N.

2017-09-01

A peculiar magnetic separation technique has been examined in order to remove the Cs-bearing Fe precipitates formed of the waste ash from the withdrawn incinerator furnaces in Fukushima. The separation system was constructed in combination with high temperature superconducting bulk magnets which generates the intensive magnetic field over 2 T, which was activated by the pulsed field magnetization process. The separation experiment has been operated with use of the newly-built alternating channel type magnetic separating device, which followed the high-gradient magnetic separation technique. The magnetic stainless steel filters installed in the water channels are magnetized by the applied magnetic fields, and are capable of attracting the precipitates bearing the Fe compound and thin Cs contamination. The experimental results clearly exhibited the positive feasibility of HTS bulk magnets.

The elusive character of discontinuous deep-water channels: New insights from Lucia Chica channel system, offshore California

Science.gov (United States)

Maier, K.L.; Fildani, A.; Paull, C.K.; Graham, S.A.; McHargue, T.R.; Caress, D.W.; McGann, M.

2011-01-01

New high-resolution autonomous underwater vehicle (AUV) seafloor images, with 1 m lateral resolution and 0.3 m vertical resolution, reveal unexpected seafloor rugosity and low-relief (thalwegs were interpreted originally from lower-resolution images, but newly acquired AUV data indicate that a single sinuous channel fed a series of discontinuous lower-relief channels. These discontinuous channels were created by at least four avulsion events. Channel relief, defined as the height from the thalweg to the levee crest, controls avulsions and overall stratigraphic architecture of the depositional area. Flowstripped turbidity currents separated into and reactivated multiple channels to create a distributary pattern and developed discontinuous trains of cyclic scours and megaflutes, which may be erosional precursors to continuous channels. The diverse features now imaged in the Lucia Chica channel system (offshore California) are likely common in modern and ancient systems with similar overall morphologies, but have not been previously mapped with lower-resolution detection methods in any of these systems. ?? 2011 Geological Society of America.

47 CFR 73.807 - Minimum distance separation between stations.

Science.gov (United States)

2010-10-01

... and the right-hand column lists (for informational purposes only) the minimum distance necessary for...) Within 320 km of the Mexican border, LP100 stations must meet the following separations with respect to any Mexican stations: Mexican station class Co-channel (km) First-adjacent channel (km) Second-third...

JiTTree: A Just-in-Time Compiled Sparse GPU Volume Data Structure

KAUST Repository

Labschutz, Matthias

2015-08-12

Sparse volume data structures enable the efficient representation of large but sparse volumes in GPU memory for computation and visualization. However, the choice of a specific data structure for a given data set depends on several factors, such as the memory budget, the sparsity of the data, and data access patterns. In general, there is no single optimal sparse data structure, but a set of several candidates with individual strengths and drawbacks. One solution to this problem are hybrid data structures which locally adapt themselves to the sparsity. However, they typically suffer from increased traversal overhead which limits their utility in many applications. This paper presents JiTTree, a novel sparse hybrid volume data structure that uses just-in-time compilation to overcome these problems. By combining multiple sparse data structures and reducing traversal overhead we leverage their individual advantages. We demonstrate that hybrid data structures adapt well to a large range of data sets. They are especially superior to other sparse data structures for data sets that locally vary in sparsity. Possible optimization criteria are memory, performance and a combination thereof. Through just-in-time (JIT) compilation, JiTTree reduces the traversal overhead of the resulting optimal data structure. As a result, our hybrid volume data structure enables efficient computations on the GPU, while being superior in terms of memory usage when compared to non-hybrid data structures.

JiTTree: A Just-in-Time Compiled Sparse GPU Volume Data Structure

KAUST Repository

Labschutz, Matthias; Bruckner, Stefan; Groller, M. Eduard; Hadwiger, Markus; Rautek, Peter

2015-01-01

Sparse volume data structures enable the efficient representation of large but sparse volumes in GPU memory for computation and visualization. However, the choice of a specific data structure for a given data set depends on several factors, such as the memory budget, the sparsity of the data, and data access patterns. In general, there is no single optimal sparse data structure, but a set of several candidates with individual strengths and drawbacks. One solution to this problem are hybrid data structures which locally adapt themselves to the sparsity. However, they typically suffer from increased traversal overhead which limits their utility in many applications. This paper presents JiTTree, a novel sparse hybrid volume data structure that uses just-in-time compilation to overcome these problems. By combining multiple sparse data structures and reducing traversal overhead we leverage their individual advantages. We demonstrate that hybrid data structures adapt well to a large range of data sets. They are especially superior to other sparse data structures for data sets that locally vary in sparsity. Possible optimization criteria are memory, performance and a combination thereof. Through just-in-time (JIT) compilation, JiTTree reduces the traversal overhead of the resulting optimal data structure. As a result, our hybrid volume data structure enables efficient computations on the GPU, while being superior in terms of memory usage when compared to non-hybrid data structures.

JiTTree: A Just-in-Time Compiled Sparse GPU Volume Data Structure.

Science.gov (United States)

Labschütz, Matthias; Bruckner, Stefan; Gröller, M Eduard; Hadwiger, Markus; Rautek, Peter

2016-01-01

Sparse volume data structures enable the efficient representation of large but sparse volumes in GPU memory for computation and visualization. However, the choice of a specific data structure for a given data set depends on several factors, such as the memory budget, the sparsity of the data, and data access patterns. In general, there is no single optimal sparse data structure, but a set of several candidates with individual strengths and drawbacks. One solution to this problem are hybrid data structures which locally adapt themselves to the sparsity. However, they typically suffer from increased traversal overhead which limits their utility in many applications. This paper presents JiTTree, a novel sparse hybrid volume data structure that uses just-in-time compilation to overcome these problems. By combining multiple sparse data structures and reducing traversal overhead we leverage their individual advantages. We demonstrate that hybrid data structures adapt well to a large range of data sets. They are especially superior to other sparse data structures for data sets that locally vary in sparsity. Possible optimization criteria are memory, performance and a combination thereof. Through just-in-time (JIT) compilation, JiTTree reduces the traversal overhead of the resulting optimal data structure. As a result, our hybrid volume data structure enables efficient computations on the GPU, while being superior in terms of memory usage when compared to non-hybrid data structures.

Uncovering Transcriptional Regulatory Networks by Sparse Bayesian Factor Model

Directory of Open Access Journals (Sweden)

Qi Yuan(Alan

2010-01-01

Full Text Available Abstract The problem of uncovering transcriptional regulation by transcription factors (TFs based on microarray data is considered. A novel Bayesian sparse correlated rectified factor model (BSCRFM is proposed that models the unknown TF protein level activity, the correlated regulations between TFs, and the sparse nature of TF-regulated genes. The model admits prior knowledge from existing database regarding TF-regulated target genes based on a sparse prior and through a developed Gibbs sampling algorithm, a context-specific transcriptional regulatory network specific to the experimental condition of the microarray data can be obtained. The proposed model and the Gibbs sampling algorithm were evaluated on the simulated systems, and results demonstrated the validity and effectiveness of the proposed approach. The proposed model was then applied to the breast cancer microarray data of patients with Estrogen Receptor positive ( status and Estrogen Receptor negative ( status, respectively.

Flow-induced separation in wall turbulence.

Science.gov (United States)

Nguyen, Quoc; Srinivasan, Chiranth; Papavassiliou, Dimitrios V

2015-03-01

One of the defining characteristics of turbulence is its ability to promote mixing. We present here a case where the opposite happens-simulation results indicate that particles can separate near the wall of a turbulent channel flow, when they have sufficiently different Schmidt numbers without use of any other means. The physical mechanism of the separation is understood when the interplay between convection and diffusion, as expressed by their characteristic time scales, is considered, leading to the determination of the necessary conditions for a successful separation between particles. Practical applications of these results can be found when very small particles need to be separated or removed from a fluid.

Magnetic Resonance Super-resolution Imaging Measurement with Dictionary-optimized Sparse Learning

Directory of Open Access Journals (Sweden)

Li Jun-Bao

2017-06-01

Full Text Available Magnetic Resonance Super-resolution Imaging Measurement (MRIM is an effective way of measuring materials. MRIM has wide applications in physics, chemistry, biology, geology, medical and material science, especially in medical diagnosis. It is feasible to improve the resolution of MR imaging through increasing radiation intensity, but the high radiation intensity and the longtime of magnetic field harm the human body. Thus, in the practical applications the resolution of hardware imaging reaches the limitation of resolution. Software-based super-resolution technology is effective to improve the resolution of image. This work proposes a framework of dictionary-optimized sparse learning based MR super-resolution method. The framework is to solve the problem of sample selection for dictionary learning of sparse reconstruction. The textural complexity-based image quality representation is proposed to choose the optimal samples for dictionary learning. Comprehensive experiments show that the dictionary-optimized sparse learning improves the performance of sparse representation.

Compact data structure and scalable algorithms for the sparse grid technique

KAUST Repository

Murarasu, Alin

2011-01-01

The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data structures, thus being far from well-suited for GPUs. In this paper, we describe optimizations that enable us to implement compression and decompression, the crucial sparse grid algorithms for our application, on Nvidia GPUs. The main idea consists of a bijective mapping between the set of points in a multi-dimensional sparse grid and a set of consecutive natural numbers. The resulting data structure consumes a minimum amount of memory. For a 10-dimensional sparse grid with approximately 127 million points, it consumes up to 30 times less memory than trees or hash tables which are typically used. Compared to a sequential CPU implementation, the speedups achieved on GPU are up to 17 for compression and up to 70 for decompression, respectively. We show that the optimizations are also applicable to multicore CPUs. Copyright © 2011 ACM.

Multisnapshot Sparse Bayesian Learning for DOA

DEFF Research Database (Denmark)

Gerstoft, Peter; Mecklenbrauker, Christoph F.; Xenaki, Angeliki

2016-01-01

The directions of arrival (DOA) of plane waves are estimated from multisnapshot sensor array data using sparse Bayesian learning (SBL). The prior for the source amplitudes is assumed independent zero-mean complex Gaussian distributed with hyperparameters, the unknown variances (i.e., the source...

Continuous speech recognition with sparse coding

CSIR Research Space (South Africa)

Smit, WJ

2009-04-01

Full Text Available generative model. The spike train is classified by making use of a spike train model and dynamic programming. It is computationally expensive to find a sparse code. We use an iterative subset selection algorithm with quadratic programming for this process...

Biomimetic membranes for sensor and separation applications

CERN Document Server

2012-01-01

This book addresses the possibilities and challenges in mimicking biological membranes and creating membrane-based sensor and separation devices. It covers recent advances in developing biomimetic membranes for technological applications with a focus on the use of integral membrane protein mediated transport. It describes the fundamentals of biosensing as well as separation and shows how the two processes work together in biological systems. The book provides an overview of the current state of the art, points to areas that need further investigation and anticipates future directions in the field. Biomimetics is a truly cross-disciplinary approach and this is exemplified by the challenges in mimicking osmotic processes as they occur in nature using aquaporin protein water channels as central building blocks. In the development of a biomimetic sensor/separation technology, both channel and carrier proteins are important and examples of how these may be reconstituted and controlled in biomimetic membranes are ...

Predictive techniques for river channel evolution and maintenance

Science.gov (United States)

Nelson, J.M.

1996-01-01

Predicting changes in alluvial channel morphology associated with anthropogenic and natural changes in flow and/or sediment supply is a critical part of the management of riverine systems. Over the past few years, advances in the understanding of the physics of sediment transport in conjunction with rapidly increasing capabilities in computational fluid dynamics have yielded now approaches to problems in river mechanics. Techniques appropriate for length scales ranging from reaches to bars and bedforms are described here. Examples of the use of these computational approaches are discussed for three cases: (1) the design of diversion scenarios that maintain channel morphology in steep cobble-bedded channels in Colorado, (2) determination of channel maintenance flows for the preservation of channel islands in the Snake River in Idaho, and (3) prediction of the temporal evolution of deposits in lateral separation zones for future assessment of the impacts of various dam release scenarios on lateral separation deposits in the Colorado River in Grand Canyon. With continued development of their scientific and technical components, the methodologies described here can provide powerful tools for the management of river environments in the future.

Sparse learning of stochastic dynamical equations

Science.gov (United States)

Boninsegna, Lorenzo; Nüske, Feliks; Clementi, Cecilia

2018-06-01

With the rapid increase of available data for complex systems, there is great interest in the extraction of physically relevant information from massive datasets. Recently, a framework called Sparse Identification of Nonlinear Dynamics (SINDy) has been introduced to identify the governing equations of dynamical systems from simulation data. In this study, we extend SINDy to stochastic dynamical systems which are frequently used to model biophysical processes. We prove the asymptotic correctness of stochastic SINDy in the infinite data limit, both in the original and projected variables. We discuss algorithms to solve the sparse regression problem arising from the practical implementation of SINDy and show that cross validation is an essential tool to determine the right level of sparsity. We demonstrate the proposed methodology on two test systems, namely, the diffusion in a one-dimensional potential and the projected dynamics of a two-dimensional diffusion process.

A novel method to design sparse linear arrays for ultrasonic phased array.

Science.gov (United States)

Yang, Ping; Chen, Bin; Shi, Ke-Ren

2006-12-22

In ultrasonic phased array testing, a sparse array can increase the resolution by enlarging the aperture without adding system complexity. Designing a sparse array involves choosing the best or a better configuration from a large number of candidate arrays. We firstly designed sparse arrays by using a genetic algorithm, but found that the arrays have poor performance and poor consistency. So, a method based on the Minimum Redundancy Linear Array was then adopted. Some elements are determined by the minimum-redundancy array firstly in order to ensure spatial resolution and then a genetic algorithm is used to optimize the remaining elements. Sparse arrays designed by this method have much better performance and consistency compared to the arrays designed only by a genetic algorithm. Both simulation and experiment confirm the effectiveness.

Multiple instance learning tracking method with local sparse representation

KAUST Repository

Xie, Chengjun

2013-10-01

When objects undergo large pose change, illumination variation or partial occlusion, most existed visual tracking algorithms tend to drift away from targets and even fail in tracking them. To address this issue, in this study, the authors propose an online algorithm by combining multiple instance learning (MIL) and local sparse representation for tracking an object in a video system. The key idea in our method is to model the appearance of an object by local sparse codes that can be formed as training data for the MIL framework. First, local image patches of a target object are represented as sparse codes with an overcomplete dictionary, where the adaptive representation can be helpful in overcoming partial occlusion in object tracking. Then MIL learns the sparse codes by a classifier to discriminate the target from the background. Finally, results from the trained classifier are input into a particle filter framework to sequentially estimate the target state over time in visual tracking. In addition, to decrease the visual drift because of the accumulative errors when updating the dictionary and classifier, a two-step object tracking method combining a static MIL classifier with a dynamical MIL classifier is proposed. Experiments on some publicly available benchmarks of video sequences show that our proposed tracker is more robust and effective than others. © The Institution of Engineering and Technology 2013.

Microfluidic ultrasonic particle separators with engineered node locations and geometries

Science.gov (United States)

Rose, Klint A.; Fisher, Karl A.; Wajda, Douglas A.; Mariella, Jr., Raymond P.; Bailey, Christopher; Dehlinger, Dietrich; Shusteff, Maxim; Jung, Byoungsok; Ness, Kevin D.

2016-04-26

An ultrasonic microfluidic system includes a separation channel for conveying a sample fluid containing small particles and large particles, flowing substantially parallel, adjacent to a recovery fluid, with which it is in contact. An acoustic transducer produces an ultrasound standing wave, that generates a pressure field having at least one node of minimum pressure amplitude. An acoustic extension structure is located proximate to said separation channel for positioning said acoustic node off center in said acoustic area and concentrating the large particles in said recovery fluid stream.

Separation of rare earth metal using micro solvent extraction system

International Nuclear Information System (INIS)

Nishihama, S.; Tajiri, Y.; Yoshizuka, K.

2005-01-01

A micro solvent extraction system for the separation of rare earth metals has been investigated. The micro flow channel was fabricated on a PMMA plate. Extraction equilibrium was quickly achieved, without any mechanical mixing. The solvent extraction results obtained for the Pr/Sm binary solutions revealed that both rare earth metals are firstly extracted together. Following, the Pr is extracted in the organic solution and Sm remains in the aqueous phase. The phase separation can be successively achieved by contriving the cross section of the flow channel

Discriminative object tracking via sparse representation and online dictionary learning.

Science.gov (United States)

Xie, Yuan; Zhang, Wensheng; Li, Cuihua; Lin, Shuyang; Qu, Yanyun; Zhang, Yinghua

2014-04-01

We propose a robust tracking algorithm based on local sparse coding with discriminative dictionary learning and new keypoint matching schema. This algorithm consists of two parts: the local sparse coding with online updated discriminative dictionary for tracking (SOD part), and the keypoint matching refinement for enhancing the tracking performance (KP part). In the SOD part, the local image patches of the target object and background are represented by their sparse codes using an over-complete discriminative dictionary. Such discriminative dictionary, which encodes the information of both the foreground and the background, may provide more discriminative power. Furthermore, in order to adapt the dictionary to the variation of the foreground and background during the tracking, an online learning method is employed to update the dictionary. The KP part utilizes refined keypoint matching schema to improve the performance of the SOD. With the help of sparse representation and online updated discriminative dictionary, the KP part are more robust than the traditional method to reject the incorrect matches and eliminate the outliers. The proposed method is embedded into a Bayesian inference framework for visual tracking. Experimental results on several challenging video sequences demonstrate the effectiveness and robustness of our approach.

Coolant channel module CCM

International Nuclear Information System (INIS)

Hoeld, Alois

2007-01-01

A complete and detailed description of the theoretical background of an '(1D) thermal-hydraulic drift-flux based mixture-fluid' coolant channel model and its resulting module CCM will be presented. The objective of this module is to simulate as universally as possible the steady state and transient behaviour of the key characteristic parameters of a single- or two-phase fluid flowing within any type of heated or non-heated coolant channel. Due to the possibility that different flow regimes can appear along any channel, such a 'basic (BC)' 1D channel is assumed to be subdivided into a number of corresponding sub-channels (SC-s). Each SC can belong to only two types of flow regime, an SC with just a single-phase fluid, containing exclusively either sub-cooled water or superheated steam, or an SC with a two-phase mixture flow. After an appropriate nodalisation of such a BC (and therefore also its SC-s) a 'modified finite volume method' has been applied for the spatial discretisation of the partial differential equations (PDE-s) which represent the basic conservation equations of thermal-hydraulics. Special attention had to be given to the possibility of variable SC entrance or outlet positions (which describe boiling boundaries or mixture levels) and thus the fact that an SC can even disappear or be created anew. The procedure yields for each SC type (and thus the entire BC), a set of non-linear ordinary 1st order differential equations (ODE-s). To link the resulting mean nodal with the nodal boundary function values, both of which are present in the discretised differential equations, a special quadratic polygon approximation procedure (PAX) had to be constructed. Together with the very thoroughly tested packages for drift-flux, heat transfer and single- and two-phase friction factors this procedure represents the central part of the here presented 'Separate-Region' approach, a theoretical model which provides the basis to the very effective working code package CCM

Building Input Adaptive Parallel Applications: A Case Study of Sparse Grid Interpolation

KAUST Repository

Murarasu, Alin; Weidendorfer, Josef

2012-01-01

bring a substantial contribution to the speedup. By identifying common patterns in the input data, we propose new algorithms for sparse grid interpolation that accelerate the state-of-the-art non-specialized version. Sparse grid interpolation

Improving liquid chromatography efficiency: channels structured with micro-pillars

NARCIS (Netherlands)

De Pra, Mauro; Kok, Wim Th.; Gardeniers, Johannes G.E.; Desmet, Gert; Schoenmakers, Peter J.; Jensen, K.F; Han, J.; Harrison, D.J.; Voldman, J.

2005-01-01

Band dispersion has been measured in micromachined separation channels structured with orderly disposed cylindrical micropillars. It was found that with an optimal channel design the band broadening could be lower by a factor of 3 than in packed columns with a comparable particle size. The

Jointly-check iterative decoding algorithm for quantum sparse graph codes

International Nuclear Information System (INIS)

Jun-Hu, Shao; Bao-Ming, Bai; Wei, Lin; Lin, Zhou

2010-01-01

For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with a standard belief-propagation (BP) algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms the standard BP algorithm with an obvious performance improvement. (general)

Rotational image deblurring with sparse matrices

DEFF Research Database (Denmark)

Hansen, Per Christian; Nagy, James G.; Tigkos, Konstantinos

2014-01-01

We describe iterative deblurring algorithms that can handle blur caused by a rotation along an arbitrary axis (including the common case of pure rotation). Our algorithms use a sparse-matrix representation of the blurring operation, which allows us to easily handle several different boundary...

Normalization for sparse encoding of odors by a wide-field interneuron.

Science.gov (United States)

Papadopoulou, Maria; Cassenaer, Stijn; Nowotny, Thomas; Laurent, Gilles

2011-05-06

Sparse coding presents practical advantages for sensory representations and memory storage. In the insect olfactory system, the representation of general odors is dense in the antennal lobes but sparse in the mushroom bodies, only one synapse downstream. In locusts, this transformation relies on the oscillatory structure of antennal lobe output, feed-forward inhibitory circuits, intrinsic properties of mushroom body neurons, and connectivity between antennal lobe and mushroom bodies. Here we show the existence of a normalizing negative-feedback loop within the mushroom body to maintain sparse output over a wide range of input conditions. This loop consists of an identifiable "giant" nonspiking inhibitory interneuron with ubiquitous connectivity and graded release properties.

Quantum finite-depth memory channels: Case study

International Nuclear Information System (INIS)

Rybar, Tomas; Ziman, Mario

2009-01-01

We analyze the depth of the memory of quantum memory channels generated by a fixed unitary transformation describing the interaction between the principal system and internal degrees of freedom of the process device. We investigate the simplest case of a qubit memory channel with a two-level memory system. In particular, we explicitly characterize all interactions for which the memory depth is finite. We show that the memory effects are either infinite, or they disappear after at most two uses of the channel. Memory channels of finite depth can be to some extent controlled and manipulated by so-called reset sequences. We show that actions separated by the sequences of inputs of the length of the memory depth are independent and constitute memoryless channels.

Sparse Representation Denoising for Radar High Resolution Range Profiling

Directory of Open Access Journals (Sweden)

Min Li

2014-01-01

Full Text Available Radar high resolution range profile has attracted considerable attention in radar automatic target recognition. In practice, radar return is usually contaminated by noise, which results in profile distortion and recognition performance degradation. To deal with this problem, in this paper, a novel denoising method based on sparse representation is proposed to remove the Gaussian white additive noise. The return is sparsely described in the Fourier redundant dictionary and the denoising problem is described as a sparse representation model. Noise level of the return, which is crucial to the denoising performance but often unknown, is estimated by performing subspace method on the sliding subsequence correlation matrix. Sliding window process enables noise level estimation using only one observation sequence, not only guaranteeing estimation efficiency but also avoiding the influence of profile time-shift sensitivity. Experimental results show that the proposed method can effectively improve the signal-to-noise ratio of the return, leading to a high-quality profile.

The Real-Valued Sparse Direction of Arrival (DOA Estimation Based on the Khatri-Rao Product

Directory of Open Access Journals (Sweden)

Tao Chen

2016-05-01

Full Text Available There is a problem that complex operation which leads to a heavy calculation burden is required when the direction of arrival (DOA of a sparse signal is estimated by using the array covariance matrix. The solution of the multiple measurement vectors (MMV model is difficult. In this paper, a real-valued sparse DOA estimation algorithm based on the Khatri-Rao (KR product called the L1-RVSKR is proposed. The proposed algorithm is based on the sparse representation of the array covariance matrix. The array covariance matrix is transformed to a real-valued matrix via a unitary transformation so that a real-valued sparse model is achieved. The real-valued sparse model is vectorized for transforming to a single measurement vector (SMV model, and a new virtual overcomplete dictionary is constructed according to the KR product’s property. Finally, the sparse DOA estimation is solved by utilizing the idea of a sparse representation of array covariance vectors (SRACV. The simulation results demonstrate the superior performance and the low computational complexity of the proposed algorithm.

Channel coding in the space station data system network

Science.gov (United States)

Healy, T.

1982-01-01

A detailed discussion of the use of channel coding for error correction, privacy/secrecy, channel separation, and synchronization is presented. Channel coding, in one form or another, is an established and common element in data systems. No analysis and design of a major new system would fail to consider ways in which channel coding could make the system more effective. The presence of channel coding on TDRS, Shuttle, the Advanced Communication Technology Satellite Program system, the JSC-proposed Space Operations Center, and the proposed 30/20 GHz Satellite Communication System strongly support the requirement for the utilization of coding for the communications channel. The designers of the space station data system have to consider the use of channel coding.

Integrative analysis of multiple diverse omics datasets by sparse group multitask regression

Directory of Open Access Journals (Sweden)

Dongdong eLin

2014-10-01

Full Text Available A variety of high throughput genome-wide assays enable the exploration of genetic risk factors underlying complex traits. Although these studies have remarkable impact on identifying susceptible biomarkers, they suffer from issues such as limited sample size and low reproducibility. Combining individual studies of different genetic levels/platforms has the promise to improve the power and consistency of biomarker identification. In this paper, we propose a novel integrative method, namely sparse group multitask regression, for integrating diverse omics datasets, platforms and populations to identify risk genes/factors of complex diseases. This method combines multitask learning with sparse group regularization, which will: 1 treat the biomarker identification in each single study as a task and then combine them by multitask learning; 2 group variables from all studies for identifying significant genes; 3 enforce sparse constraint on groups of variables to overcome the ‘small sample, but large variables’ problem. We introduce two sparse group penalties: sparse group lasso and sparse group ridge in our multitask model, and provide an effective algorithm for each model. In addition, we propose a significance test for the identification of potential risk genes. Two simulation studies are performed to evaluate the performance of our integrative method by comparing it with conventional meta-analysis method. The results show that our sparse group multitask method outperforms meta-analysis method significantly. In an application to our osteoporosis studies, 7 genes are identified as significant genes by our method and are found to have significant effects in other three independent studies for validation. The most significant gene SOD2 has been identified in our previous osteoporosis study involving the same expression dataset. Several other genes such as TREML2, HTR1E and GLO1 are shown to be novel susceptible genes for osteoporosis, as confirmed

A modified sparse reconstruction method for three-dimensional synthetic aperture radar image

Science.gov (United States)

Zhang, Ziqiang; Ji, Kefeng; Song, Haibo; Zou, Huanxin

2018-03-01

There is an increasing interest in three-dimensional Synthetic Aperture Radar (3-D SAR) imaging from observed sparse scattering data. However, the existing 3-D sparse imaging method requires large computing times and storage capacity. In this paper, we propose a modified method for the sparse 3-D SAR imaging. The method processes the collection of noisy SAR measurements, usually collected over nonlinear flight paths, and outputs 3-D SAR imagery. Firstly, the 3-D sparse reconstruction problem is transformed into a series of 2-D slices reconstruction problem by range compression. Then the slices are reconstructed by the modified SL0 (smoothed l0 norm) reconstruction algorithm. The improved algorithm uses hyperbolic tangent function instead of the Gaussian function to approximate the l0 norm and uses the Newton direction instead of the steepest descent direction, which can speed up the convergence rate of the SL0 algorithm. Finally, numerical simulation results are given to demonstrate the effectiveness of the proposed algorithm. It is shown that our method, compared with existing 3-D sparse imaging method, performs better in reconstruction quality and the reconstruction time.

Porting of the DBCSR library for Sparse Matrix-Matrix Multiplications to Intel Xeon Phi systems

OpenAIRE

Bethune, Iain; Gloess, Andeas; Hutter, Juerg; Lazzaro, Alfio; Pabst, Hans; Reid, Fiona

2017-01-01

Multiplication of two sparse matrices is a key operation in the simulation of the electronic structure of systems containing thousands of atoms and electrons. The highly optimized sparse linear algebra library DBCSR (Distributed Block Compressed Sparse Row) has been specifically designed to efficiently perform such sparse matrix-matrix multiplications. This library is the basic building block for linear scaling electronic structure theory and low scaling correlated methods in CP2K. It is para...

Fast Solution in Sparse LDA for Binary Classification

Science.gov (United States)

Moghaddam, Baback

2010-01-01

An algorithm that performs sparse linear discriminant analysis (Sparse-LDA) finds near-optimal solutions in far less time than the prior art when specialized to binary classification (of 2 classes). Sparse-LDA is a type of feature- or variable- selection problem with numerous applications in statistics, machine learning, computer vision, computational finance, operations research, and bio-informatics. Because of its combinatorial nature, feature- or variable-selection problems are NP-hard or computationally intractable in cases involving more than 30 variables or features. Therefore, one typically seeks approximate solutions by means of greedy search algorithms. The prior Sparse-LDA algorithm was a greedy algorithm that considered the best variable or feature to add/ delete to/ from its subsets in order to maximally discriminate between multiple classes of data. The present algorithm is designed for the special but prevalent case of 2-class or binary classification (e.g. 1 vs. 0, functioning vs. malfunctioning, or change versus no change). The present algorithm provides near-optimal solutions on large real-world datasets having hundreds or even thousands of variables or features (e.g. selecting the fewest wavelength bands in a hyperspectral sensor to do terrain classification) and does so in typical computation times of minutes as compared to days or weeks as taken by the prior art. Sparse LDA requires solving generalized eigenvalue problems for a large number of variable subsets (represented by the submatrices of the input within-class and between-class covariance matrices). In the general (fullrank) case, the amount of computation scales at least cubically with the number of variables and thus the size of the problems that can be solved is limited accordingly. However, in binary classification, the principal eigenvalues can be found using a special analytic formula, without resorting to costly iterative techniques. The present algorithm exploits this analytic

Punctuated sediment record resulting from channel migration in a shallow sand-dominated micro-tidal lagoon, Northern Wadden Sea, Denmark

DEFF Research Database (Denmark)

Fruergaard, M.; Andersen, T.J.; Nielsen, L.H.

2011-01-01

depositional environment, but tidal channel sediments dominate in the five sediment cores, making up 56% of the 15 mof sediment core. Sedimentation in the lagoon alternated between slow vertical aggradation of sand flats (1.5–2 mm yr-1) and very fast lateral progradation of point bars in tidal channels, which...... caused the formation of a punctuated lagoonal fill. Frequent and comprehensive reworking of the sand flat sediments by tidal channel migration entails loss of sedimentary structures and bioturbation related to sand flat deposits, and old sand flat sediments are only very sparsely preserved. We further...... conclude that long-term (millennial timescale) sediment accumulation in the lagoon was controlled by rising sea-level, whereas short-term (centurial timescale) sediment accumulation was controlled by local erosion and depositional events caused by lateral migration of channels. Records of short-term sea...

Sparse Localization with a Mobile Beacon Based on LU Decomposition in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Chunhui Zhao

2015-09-01

Full Text Available Node localization is the core in wireless sensor network. It can be solved by powerful beacons, which are equipped with global positioning system devices to know their location information. In this article, we present a novel sparse localization approach with a mobile beacon based on LU decomposition. Our scheme firstly translates node localization problem into a 1-sparse vector recovery problem by establishing sparse localization model. Then, LU decomposition pre-processing is adopted to solve the problem that measurement matrix does not meet the re¬stricted isometry property. Later, the 1-sparse vector can be exactly recovered by compressive sensing. Finally, as the 1-sparse vector is approximate sparse, weighted Cen¬troid scheme is introduced to accurately locate the node. Simulation and analysis show that our scheme has better localization performance and lower requirement for the mobile beacon than MAP+GC, MAP-M, and MAP-MN schemes. In addition, the obstacles and DOI have little effect on the novel scheme, and it has great localization performance under low SNR, thus, the scheme proposed is robust.

On S-mixing entropy of quantum channels

Science.gov (United States)

Mukhamedov, Farrukh; Watanabe, Noboru

2018-06-01

In this paper, an S-mixing entropy of quantum channels is introduced as a generalization of Ohya's S-mixing entropy. We investigate several properties of the introduced entropy. Moreover, certain relations between the S-mixing entropy and the existing map and output entropies of quantum channels are investigated as well. These relations allowed us to find certain connections between separable states and the introduced entropy. Hence, there is a sufficient condition to detect entangled states. Moreover, several properties of the introduced entropy are investigated. Besides, entropies of qubit and phase-damping channels are calculated.

Robust visual tracking via multiscale deep sparse networks

Science.gov (United States)

Wang, Xin; Hou, Zhiqiang; Yu, Wangsheng; Xue, Yang; Jin, Zefenfen; Dai, Bo

2017-04-01

In visual tracking, deep learning with offline pretraining can extract more intrinsic and robust features. It has significant success solving the tracking drift in a complicated environment. However, offline pretraining requires numerous auxiliary training datasets and is considerably time-consuming for tracking tasks. To solve these problems, a multiscale sparse networks-based tracker (MSNT) under the particle filter framework is proposed. Based on the stacked sparse autoencoders and rectifier linear unit, the tracker has a flexible and adjustable architecture without the offline pretraining process and exploits the robust and powerful features effectively only through online training of limited labeled data. Meanwhile, the tracker builds four deep sparse networks of different scales, according to the target's profile type. During tracking, the tracker selects the matched tracking network adaptively in accordance with the initial target's profile type. It preserves the inherent structural information more efficiently than the single-scale networks. Additionally, a corresponding update strategy is proposed to improve the robustness of the tracker. Extensive experimental results on a large scale benchmark dataset show that the proposed method performs favorably against state-of-the-art methods in challenging environments.

Efficient MATLAB computations with sparse and factored tensors.

Energy Technology Data Exchange (ETDEWEB)

Bader, Brett William; Kolda, Tamara Gibson (Sandia National Lab, Livermore, CA)

2006-12-01

In this paper, the term tensor refers simply to a multidimensional or N-way array, and we consider how specially structured tensors allow for efficient storage and computation. First, we study sparse tensors, which have the property that the vast majority of the elements are zero. We propose storing sparse tensors using coordinate format and describe the computational efficiency of this scheme for various mathematical operations, including those typical to tensor decomposition algorithms. Second, we study factored tensors, which have the property that they can be assembled from more basic components. We consider two specific types: a Tucker tensor can be expressed as the product of a core tensor (which itself may be dense, sparse, or factored) and a matrix along each mode, and a Kruskal tensor can be expressed as the sum of rank-1 tensors. We are interested in the case where the storage of the components is less than the storage of the full tensor, and we demonstrate that many elementary operations can be computed using only the components. All of the efficiencies described in this paper are implemented in the Tensor Toolbox for MATLAB.

A network of spiking neurons for computing sparse representations in an energy-efficient way.

Science.gov (United States)

Hu, Tao; Genkin, Alexander; Chklovskii, Dmitri B

2012-11-01

Computing sparse redundant representations is an important problem in both applied mathematics and neuroscience. In many applications, this problem must be solved in an energy-efficient way. Here, we propose a hybrid distributed algorithm (HDA), which solves this problem on a network of simple nodes communicating by low-bandwidth channels. HDA nodes perform both gradient-descent-like steps on analog internal variables and coordinate-descent-like steps via quantized external variables communicated to each other. Interestingly, the operation is equivalent to a network of integrate-and-fire neurons, suggesting that HDA may serve as a model of neural computation. We show that the numerical performance of HDA is on par with existing algorithms. In the asymptotic regime, the representation error of HDA decays with time, t, as 1/t. HDA is stable against time-varying noise; specifically, the representation error decays as 1/√t for gaussian white noise.

The Effect of Confluence Angle on the Flow Pattern at a Rectangular Open-Channel

Directory of Open Access Journals (Sweden)

F. Rooniyan

2014-02-01

Full Text Available Flow connection in channels is a phenomenon which frequently happens in rivers, water and drainage channels and urban sewage systems. The phenomenon appears to be more complex in rivers than in channels, especially at the y-junction bed joint that causes erosion and sedimentation at some areas resulting to morphological changes. Flow behavior at the channel junction area depends on variables such as channel geometry, discharge ratio, tributary width and y-junction connection angle of the channel, bed level changes at the bed joint, flow characteristic at the bed joint upstream and flow Froude number in different sections. In this research, fluent numerical model and junction angles of 30o, 45o & 60o are used to analyze and evaluate the effect of channel junction geometry on the flow pattern and the flow separation zone dimensions in different ratios of flow discharge (upstream channel discharge to total discharge of the flow. Results for two ratios of flow discharge are represented. Results are in agreement with earlier studies and it is shown that the change of the channel crossing angle affects the flow pattern in the main channel and also that the dimensions of the created separation zone in the main channel become larger when the crossing angle increases. This phenomenon can also be observed when the flow discharge ratio is lower. Analysis showed that the least dimension of the separation zone will be at the crossing angle of 45o .

MXene molecular sieving membranes for highly efficient gas separation.

Science.gov (United States)

Ding, Li; Wei, Yanying; Li, Libo; Zhang, Tao; Wang, Haihui; Xue, Jian; Ding, Liang-Xin; Wang, Suqing; Caro, Jürgen; Gogotsi, Yury

2018-01-11

Molecular sieving membranes with sufficient and uniform nanochannels that break the permeability-selectivity trade-off are desirable for energy-efficient gas separation, and the arising two-dimensional (2D) materials provide new routes for membrane development. However, for 2D lamellar membranes, disordered interlayer nanochannels for mass transport are usually formed between randomly stacked neighboring nanosheets, which is obstructive for highly efficient separation. Therefore, manufacturing lamellar membranes with highly ordered nanochannel structures for fast and precise molecular sieving is still challenging. Here, we report on lamellar stacked MXene membranes with aligned and regular subnanometer channels, taking advantage of the abundant surface-terminating groups on the MXene nanosheets, which exhibit excellent gas separation performance with H 2 permeability >2200 Barrer and H 2 /CO 2 selectivity >160, superior to the state-of-the-art membranes. The results of molecular dynamics simulations quantitatively support the experiments, confirming the subnanometer interlayer spacing between the neighboring MXene nanosheets as molecular sieving channels for gas separation.

Sparse grid techniques for particle-in-cell schemes

Science.gov (United States)

Ricketson, L. F.; Cerfon, A. J.

2017-02-01

We propose the use of sparse grids to accelerate particle-in-cell (PIC) schemes. By using the so-called ‘combination technique’ from the sparse grids literature, we are able to dramatically increase the size of the spatial cells in multi-dimensional PIC schemes while paying only a slight penalty in grid-based error. The resulting increase in cell size allows us to reduce the statistical noise in the simulation without increasing total particle number. We present initial proof-of-principle results from test cases in two and three dimensions that demonstrate the new scheme’s efficiency, both in terms of computation time and memory usage.

Multi-rate control over AWGN channels via analog joint source-channel coding

KAUST Repository

Khina, Anatoly; Pettersson, Gustav M.; Kostina, Victoria; Hassibi, Babak

2017-01-01

We consider the problem of controlling an unstable plant over an additive white Gaussian noise (AWGN) channel with a transmit power constraint, where the signaling rate of communication is larger than the sampling rate (for generating observations and applying control inputs) of the underlying plant. Such a situation is quite common since sampling is done at a rate that captures the dynamics of the plant and which is often much lower than the rate that can be communicated. This setting offers the opportunity of improving the system performance by employing multiple channel uses to convey a single message (output plant observation or control input). Common ways of doing so are through either repeating the message, or by quantizing it to a number of bits and then transmitting a channel coded version of the bits whose length is commensurate with the number of channel uses per sampled message. We argue that such “separated source and channel coding” can be suboptimal and propose to perform joint source-channel coding. Since the block length is short we obviate the need to go to the digital domain altogether and instead consider analog joint source-channel coding. For the case where the communication signaling rate is twice the sampling rate, we employ the Archimedean bi-spiral-based Shannon-Kotel'nikov analog maps to show significant improvement in stability margins and linear-quadratic Gaussian (LQG) costs over simple schemes that employ repetition.

Multi-rate control over AWGN channels via analog joint source-channel coding

KAUST Repository

Khina, Anatoly

2017-01-05

We consider the problem of controlling an unstable plant over an additive white Gaussian noise (AWGN) channel with a transmit power constraint, where the signaling rate of communication is larger than the sampling rate (for generating observations and applying control inputs) of the underlying plant. Such a situation is quite common since sampling is done at a rate that captures the dynamics of the plant and which is often much lower than the rate that can be communicated. This setting offers the opportunity of improving the system performance by employing multiple channel uses to convey a single message (output plant observation or control input). Common ways of doing so are through either repeating the message, or by quantizing it to a number of bits and then transmitting a channel coded version of the bits whose length is commensurate with the number of channel uses per sampled message. We argue that such “separated source and channel coding” can be suboptimal and propose to perform joint source-channel coding. Since the block length is short we obviate the need to go to the digital domain altogether and instead consider analog joint source-channel coding. For the case where the communication signaling rate is twice the sampling rate, we employ the Archimedean bi-spiral-based Shannon-Kotel\\'nikov analog maps to show significant improvement in stability margins and linear-quadratic Gaussian (LQG) costs over simple schemes that employ repetition.

Feature selection and multi-kernel learning for sparse representation on a manifold

KAUST Repository

Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

2014-01-01

combination of some basic items in a dictionary. Gao etal. (2013) recently proposed Laplacian sparse coding by regularizing the sparse codes with an affinity graph. However, due to the noisy features and nonlinear distribution of the data samples, the affinity

Communication and Student Unrest: A Report to the President of the University of New Mexico; Part I: Student-Administration Channels, Student Faculty Channels.

Science.gov (United States)

Goldhaber, Gerald M.

This initial segment of a three-part study (Communication and Student Unrest) is an examination of the various communication channels--informal and formal, vertical and horizontal--which exist for student-administration and student-faculty interaction. Student-administration and student-faculty communication channels are discussed separately, and…

Group sparse canonical correlation analysis for genomic data integration.

Science.gov (United States)

Lin, Dongdong; Zhang, Jigang; Li, Jingyao; Calhoun, Vince D; Deng, Hong-Wen; Wang, Yu-Ping

2013-08-12

The emergence of high-throughput genomic datasets from different sources and platforms (e.g., gene expression, single nucleotide polymorphisms (SNP), and copy number variation (CNV)) has greatly enhanced our understandings of the interplay of these genomic factors as well as their influences on the complex diseases. It is challenging to explore the relationship between these different types of genomic data sets. In this paper, we focus on a multivariate statistical method, canonical correlation analysis (CCA) method for this problem. Conventional CCA method does not work effectively if the number of data samples is significantly less than that of biomarkers, which is a typical case for genomic data (e.g., SNPs). Sparse CCA (sCCA) methods were introduced to overcome such difficulty, mostly using penalizations with l-1 norm (CCA-l1) or the combination of l-1and l-2 norm (CCA-elastic net). However, they overlook the structural or group effect within genomic data in the analysis, which often exist and are important (e.g., SNPs spanning a gene interact and work together as a group). We propose a new group sparse CCA method (CCA-sparse group) along with an effective numerical algorithm to study the mutual relationship between two different types of genomic data (i.e., SNP and gene expression). We then extend the model to a more general formulation that can include the existing sCCA models. We apply the model to feature/variable selection from two data sets and compare our group sparse CCA method with existing sCCA methods on both simulation and two real datasets (human gliomas data and NCI60 data). We use a graphical representation of the samples with a pair of canonical variates to demonstrate the discriminating characteristic of the selected features. Pathway analysis is further performed for biological interpretation of those features. The CCA-sparse group method incorporates group effects of features into the correlation analysis while performs individual feature

Information filtering in sparse online systems: recommendation via semi-local diffusion.

Science.gov (United States)

Zeng, Wei; Zeng, An; Shang, Ming-Sheng; Zhang, Yi-Cheng

2013-01-01

With the rapid growth of the Internet and overwhelming amount of information and choices that people are confronted with, recommender systems have been developed to effectively support users' decision-making process in the online systems. However, many recommendation algorithms suffer from the data sparsity problem, i.e. the user-object bipartite networks are so sparse that algorithms cannot accurately recommend objects for users. This data sparsity problem makes many well-known recommendation algorithms perform poorly. To solve the problem, we propose a recommendation algorithm based on the semi-local diffusion process on the user-object bipartite network. The simulation results on two sparse datasets, Amazon and Bookcross, show that our method significantly outperforms the state-of-the-art methods especially for those small-degree users. Two personalized semi-local diffusion methods are proposed which further improve the recommendation accuracy. Finally, our work indicates that sparse online systems are essentially different from the dense online systems, so it is necessary to reexamine former algorithms and conclusions based on dense data in sparse systems.

Codesign of Beam Pattern and Sparse Frequency Waveforms for MIMO Radar

Directory of Open Access Journals (Sweden)

Chaoyun Mai

2015-01-01

Full Text Available Multiple-input multiple-output (MIMO radar takes the advantages of high degrees of freedom for beam pattern design and waveform optimization, because each antenna in centralized MIMO radar system can transmit different signal waveforms. When continuous band is divided into several pieces, sparse frequency radar waveforms play an important role due to the special pattern of the sparse spectrum. In this paper, we start from the covariance matrix of the transmitted waveform and extend the concept of sparse frequency design to the study of MIMO radar beam pattern. With this idea in mind, we first solve the problem of semidefinite constraint by optimization tools and get the desired covariance matrix of the ideal beam pattern. Then, we use the acquired covariance matrix and generalize the objective function by adding the constraint of both constant modulus of the signals and corresponding spectrum. Finally, we solve the objective function by the cyclic algorithm and obtain the sparse frequency MIMO radar waveforms with desired beam pattern. The simulation results verify the effectiveness of this method.

Theoretical analysis of selectivity mechanisms in molecular transport through channels and nanopores

International Nuclear Information System (INIS)

Agah, Shaghayegh; Pasquali, Matteo; Kolomeisky, Anatoly B.

2015-01-01

Selectivity is one of the most fundamental concepts in natural sciences, and it is also critically important in various technological, industrial, and medical applications. Although there are many experimental methods that allow to separate molecules, frequently they are expensive and not efficient. Recently, a new method of separation of chemical mixtures based on utilization of channels and nanopores has been proposed and successfully tested in several systems. However, mechanisms of selectivity in the molecular transport during the translocation are still not well understood. Here, we develop a simple theoretical approach to explain the origin of selectivity in molecular fluxes through channels. Our method utilizes discrete-state stochastic models that take into account all relevant chemical transitions and can be solved analytically. More specifically, we analyze channels with one and two binding sites employed for separating mixtures of two types of molecules. The effects of the symmetry and the strength of the molecular-pore interactions are examined. It is found that for one-site binding channels, the differences in the strength of interactions for two species drive the separation. At the same time, in more realistic two-site systems, the symmetry of interaction potential becomes also important. The most efficient separation is predicted when the specific binding site is located near the entrance to the nanopore. In addition, the selectivity is higher for large entrance rates into the channel. It is also found that the molecular transport is more selective for repulsive interactions than for attractive interactions. The physical-chemical origin of the observed phenomena is discussed

Worst configurations (instantons) for compressed sensing over reals: a channel coding approach

International Nuclear Information System (INIS)

Chertkov, Michael; Chilappagari, Shashi K.; Vasic, Bane

2010-01-01

We consider Linear Programming (LP) solution of a Compressed Sensing (CS) problem over reals, also known as the Basis Pursuit (BasP) algorithm. The BasP allows interpretation as a channel-coding problem, and it guarantees the error-free reconstruction over reals for properly chosen measurement matrix and sufficiently sparse error vectors. In this manuscript, we examine how the BasP performs on a given measurement matrix and develop a technique to discover sparse vectors for which the BasP fails. The resulting algorithm is a generalization of our previous results on finding the most probable error-patterns, so called instantons, degrading performance of a finite size Low-Density Parity-Check (LDPC) code in the error-floor regime. The BasP fails when its output is different from the actual error-pattern. We design CS-Instanton Search Algorithm (ISA) generating a sparse vector, called CS-instanton, such that the BasP fails on the instanton, while its action on any modification of the CS-instanton decreasing a properly defined norm is successful. We also prove that, given a sufficiently dense random input for the error-vector, the CS-ISA converges to an instanton in a small finite number of steps. Performance of the CS-ISA is tested on example of a randomly generated 512 * 120 matrix, that outputs the shortest instanton (error vector) pattern of length 11.

High-SNR spectrum measurement based on Hadamard encoding and sparse reconstruction

Science.gov (United States)

Wang, Zhaoxin; Yue, Jiang; Han, Jing; Li, Long; Jin, Yong; Gao, Yuan; Li, Baoming

2017-12-01

The denoising capabilities of the H-matrix and cyclic S-matrix based on the sparse reconstruction, employed in the Pixel of Focal Plane Coded Visible Spectrometer for spectrum measurement are investigated, where the spectrum is sparse in a known basis. In the measurement process, the digital micromirror device plays an important role, which implements the Hadamard coding. In contrast with Hadamard transform spectrometry, based on the shift invariability, this spectrometer may have the advantage of a high efficiency. Simulations and experiments show that the nonlinear solution with a sparse reconstruction has a better signal-to-noise ratio than the linear solution and the H-matrix outperforms the cyclic S-matrix whether the reconstruction method is nonlinear or linear.

Comparison of sparse point distribution models

DEFF Research Database (Denmark)

Erbou, Søren Gylling Hemmingsen; Vester-Christensen, Martin; Larsen, Rasmus

2010-01-01

This paper compares several methods for obtaining sparse and compact point distribution models suited for data sets containing many variables. These are evaluated on a database consisting of 3D surfaces of a section of the pelvic bone obtained from CT scans of 33 porcine carcasses. The superior m...

Transportation channels calculation method in MATLAB

International Nuclear Information System (INIS)

Averyanov, G.P.; Budkin, V.A.; Dmitrieva, V.V.; Osadchuk, I.O.; Bashmakov, Yu.A.

2014-01-01

Output devices and charged particles transport channels are necessary components of any modern particle accelerator. They differ both in sizes and in terms of focusing elements depending on particle accelerator type and its destination. A package of transport line designing codes for magnet optical channels in MATLAB environment is presented in this report. Charged particles dynamics in a focusing channel can be studied easily by means of the matrix technique. MATLAB usage is convenient because its information objects are matrixes. MATLAB allows the use the modular principle to build the software package. Program blocks are small in size and easy to use. They can be executed separately or commonly. A set of codes has a user-friendly interface. Transport channel construction consists of focusing lenses (doublets and triplets). The main of the magneto-optical channel parameters are total length and lens position and parameters of the output beam in the phase space (channel acceptance, beam emittance - beam transverse dimensions, particles divergence and image stigmaticity). Choice of the channel operation parameters is based on the conditions for satisfying mutually competing demands. And therefore the channel parameters calculation is carried out by using the search engine optimization techniques.

Magnetic particle separation using controllable magnetic force switches

International Nuclear Information System (INIS)

Wei Zunghang; Lee, C.-P.; Lai, M.-F.

2010-01-01

Magnetic particle separation is very important in biomedical applications. In this study, a magnetic particle microseparator is proposed that uses micro magnets to produce open/closed magnetic flux for switching on/off the separation. When all magnets are magnetized in the same direction, the magnetic force switch for separation is on; almost all magnetic particles are trapped in the channel side walls and the separation rate can reach 95%. When the magnetization directions of adjacent magnets are opposite, the magnetic force switch for separation is off, and most magnetic particles pass through the microchannel without being trapped. For the separation of multi-sized magnetic particles, the proposed microseparator is numerically demonstrated to have high separation rate.

A Multiobjective Sparse Feature Learning Model for Deep Neural Networks.

Science.gov (United States)

Gong, Maoguo; Liu, Jia; Li, Hao; Cai, Qing; Su, Linzhi

2015-12-01

Hierarchical deep neural networks are currently popular learning models for imitating the hierarchical architecture of human brain. Single-layer feature extractors are the bricks to build deep networks. Sparse feature learning models are popular models that can learn useful representations. But most of those models need a user-defined constant to control the sparsity of representations. In this paper, we propose a multiobjective sparse feature learning model based on the autoencoder. The parameters of the model are learnt by optimizing two objectives, reconstruction error and the sparsity of hidden units simultaneously to find a reasonable compromise between them automatically. We design a multiobjective induced learning procedure for this model based on a multiobjective evolutionary algorithm. In the experiments, we demonstrate that the learning procedure is effective, and the proposed multiobjective model can learn useful sparse features.

Uniform sparse bounds for discrete quadratic phase Hilbert transforms

Science.gov (United States)

Kesler, Robert; Arias, Darío Mena

2017-09-01

For each α \\in T consider the discrete quadratic phase Hilbert transform acting on finitely supported functions f : Z → C according to H^{α }f(n):= \\sum _{m ≠ 0} e^{iα m^2} f(n - m)/m. We prove that, uniformly in α \\in T , there is a sparse bound for the bilinear form for every pair of finitely supported functions f,g : Z→ C . The sparse bound implies several mapping properties such as weighted inequalities in an intersection of Muckenhoupt and reverse Hölder classes.

Sparse Matrix for ECG Identification with Two-Lead Features

Directory of Open Access Journals (Sweden)

Kuo-Kun Tseng

2015-01-01

Full Text Available Electrocardiograph (ECG human identification has the potential to improve biometric security. However, improvements in ECG identification and feature extraction are required. Previous work has focused on single lead ECG signals. Our work proposes a new algorithm for human identification by mapping two-lead ECG signals onto a two-dimensional matrix then employing a sparse matrix method to process the matrix. And that is the first application of sparse matrix techniques for ECG identification. Moreover, the results of our experiments demonstrate the benefits of our approach over existing methods.

Polynomial meta-models with canonical low-rank approximations: Numerical insights and comparison to sparse polynomial chaos expansions

International Nuclear Information System (INIS)

Konakli, Katerina; Sudret, Bruno

2016-01-01

The growing need for uncertainty analysis of complex computational models has led to an expanding use of meta-models across engineering and sciences. The efficiency of meta-modeling techniques relies on their ability to provide statistically-equivalent analytical representations based on relatively few evaluations of the original model. Polynomial chaos expansions (PCE) have proven a powerful tool for developing meta-models in a wide range of applications; the key idea thereof is to expand the model response onto a basis made of multivariate polynomials obtained as tensor products of appropriate univariate polynomials. The classical PCE approach nevertheless faces the “curse of dimensionality”, namely the exponential increase of the basis size with increasing input dimension. To address this limitation, the sparse PCE technique has been proposed, in which the expansion is carried out on only a few relevant basis terms that are automatically selected by a suitable algorithm. An alternative for developing meta-models with polynomial functions in high-dimensional problems is offered by the newly emerged low-rank approximations (LRA) approach. By exploiting the tensor–product structure of the multivariate basis, LRA can provide polynomial representations in highly compressed formats. Through extensive numerical investigations, we herein first shed light on issues relating to the construction of canonical LRA with a particular greedy algorithm involving a sequential updating of the polynomial coefficients along separate dimensions. Specifically, we examine the selection of optimal rank, stopping criteria in the updating of the polynomial coefficients and error estimation. In the sequel, we confront canonical LRA to sparse PCE in structural-mechanics and heat-conduction applications based on finite-element solutions. Canonical LRA exhibit smaller errors than sparse PCE in cases when the number of available model evaluations is small with respect to the input

Polynomial meta-models with canonical low-rank approximations: Numerical insights and comparison to sparse polynomial chaos expansions

Energy Technology Data Exchange (ETDEWEB)

Konakli, Katerina, E-mail: konakli@ibk.baug.ethz.ch; Sudret, Bruno

2016-09-15

The growing need for uncertainty analysis of complex computational models has led to an expanding use of meta-models across engineering and sciences. The efficiency of meta-modeling techniques relies on their ability to provide statistically-equivalent analytical representations based on relatively few evaluations of the original model. Polynomial chaos expansions (PCE) have proven a powerful tool for developing meta-models in a wide range of applications; the key idea thereof is to expand the model response onto a basis made of multivariate polynomials obtained as tensor products of appropriate univariate polynomials. The classical PCE approach nevertheless faces the “curse of dimensionality”, namely the exponential increase of the basis size with increasing input dimension. To address this limitation, the sparse PCE technique has been proposed, in which the expansion is carried out on only a few relevant basis terms that are automatically selected by a suitable algorithm. An alternative for developing meta-models with polynomial functions in high-dimensional problems is offered by the newly emerged low-rank approximations (LRA) approach. By exploiting the tensor–product structure of the multivariate basis, LRA can provide polynomial representations in highly compressed formats. Through extensive numerical investigations, we herein first shed light on issues relating to the construction of canonical LRA with a particular greedy algorithm involving a sequential updating of the polynomial coefficients along separate dimensions. Specifically, we examine the selection of optimal rank, stopping criteria in the updating of the polynomial coefficients and error estimation. In the sequel, we confront canonical LRA to sparse PCE in structural-mechanics and heat-conduction applications based on finite-element solutions. Canonical LRA exhibit smaller errors than sparse PCE in cases when the number of available model evaluations is small with respect to the input

Automated bone segmentation from dental CBCT images using patch-based sparse representation and convex optimization

Energy Technology Data Exchange (ETDEWEB)

Wang, Li; Gao, Yaozong; Shi, Feng; Liao, Shu; Li, Gang [Department of Radiology and BRIC, University of North Carolina at Chapel Hill, North Carolina 27599 (United States); Chen, Ken Chung [Department of Oral and Maxillofacial Surgery, Houston Methodist Hospital Research Institute, Houston, Texas 77030 and Department of Stomatology, National Cheng Kung University Medical College and Hospital, Tainan, Taiwan 70403 (China); Shen, Steve G. F.; Yan, Jin [Department of Oral and Craniomaxillofacial Surgery and Science, Shanghai Ninth People' s Hospital, Shanghai Jiao Tong University College of Medicine, Shanghai, China 200011 (China); Lee, Philip K. M.; Chow, Ben [Hong Kong Dental Implant and Maxillofacial Centre, Hong Kong, China 999077 (China); Liu, Nancy X. [Department of Oral and Maxillofacial Surgery, Houston Methodist Hospital Research Institute, Houston, Texas 77030 and Department of Oral and Maxillofacial Surgery, Peking University School and Hospital of Stomatology, Beijing, China 100050 (China); Xia, James J. [Department of Oral and Maxillofacial Surgery, Houston Methodist Hospital Research Institute, Houston, Texas 77030 (United States); Department of Surgery (Oral and Maxillofacial Surgery), Weill Medical College, Cornell University, New York, New York 10065 (United States); Department of Oral and Craniomaxillofacial Surgery and Science, Shanghai Ninth People' s Hospital, Shanghai Jiao Tong University College of Medicine, Shanghai, China 200011 (China); Shen, Dinggang, E-mail: dgshen@med.unc.edu [Department of Radiology and BRIC, University of North Carolina at Chapel Hill, North Carolina 27599 and Department of Brain and Cognitive Engineering, Korea University, Seoul, 136701 (Korea, Republic of)

2014-04-15

Purpose: Cone-beam computed tomography (CBCT) is an increasingly utilized imaging modality for the diagnosis and treatment planning of the patients with craniomaxillofacial (CMF) deformities. Accurate segmentation of CBCT image is an essential step to generate three-dimensional (3D) models for the diagnosis and treatment planning of the patients with CMF deformities. However, due to the poor image quality, including very low signal-to-noise ratio and the widespread image artifacts such as noise, beam hardening, and inhomogeneity, it is challenging to segment the CBCT images. In this paper, the authors present a new automatic segmentation method to address these problems. Methods: To segment CBCT images, the authors propose a new method for fully automated CBCT segmentation by using patch-based sparse representation to (1) segment bony structures from the soft tissues and (2) further separate the mandible from the maxilla. Specifically, a region-specific registration strategy is first proposed to warp all the atlases to the current testing subject and then a sparse-based label propagation strategy is employed to estimate a patient-specific atlas from all aligned atlases. Finally, the patient-specific atlas is integrated into amaximum a posteriori probability-based convex segmentation framework for accurate segmentation. Results: The proposed method has been evaluated on a dataset with 15 CBCT images. The effectiveness of the proposed region-specific registration strategy and patient-specific atlas has been validated by comparing with the traditional registration strategy and population-based atlas. The experimental results show that the proposed method achieves the best segmentation accuracy by comparison with other state-of-the-art segmentation methods. Conclusions: The authors have proposed a new CBCT segmentation method by using patch-based sparse representation and convex optimization, which can achieve considerably accurate segmentation results in CBCT

Automated bone segmentation from dental CBCT images using patch-based sparse representation and convex optimization

International Nuclear Information System (INIS)

Wang, Li; Gao, Yaozong; Shi, Feng; Liao, Shu; Li, Gang; Chen, Ken Chung; Shen, Steve G. F.; Yan, Jin; Lee, Philip K. M.; Chow, Ben; Liu, Nancy X.; Xia, James J.; Shen, Dinggang

2014-01-01

Purpose: Cone-beam computed tomography (CBCT) is an increasingly utilized imaging modality for the diagnosis and treatment planning of the patients with craniomaxillofacial (CMF) deformities. Accurate segmentation of CBCT image is an essential step to generate three-dimensional (3D) models for the diagnosis and treatment planning of the patients with CMF deformities. However, due to the poor image quality, including very low signal-to-noise ratio and the widespread image artifacts such as noise, beam hardening, and inhomogeneity, it is challenging to segment the CBCT images. In this paper, the authors present a new automatic segmentation method to address these problems. Methods: To segment CBCT images, the authors propose a new method for fully automated CBCT segmentation by using patch-based sparse representation to (1) segment bony structures from the soft tissues and (2) further separate the mandible from the maxilla. Specifically, a region-specific registration strategy is first proposed to warp all the atlases to the current testing subject and then a sparse-based label propagation strategy is employed to estimate a patient-specific atlas from all aligned atlases. Finally, the patient-specific atlas is integrated into amaximum a posteriori probability-based convex segmentation framework for accurate segmentation. Results: The proposed method has been evaluated on a dataset with 15 CBCT images. The effectiveness of the proposed region-specific registration strategy and patient-specific atlas has been validated by comparing with the traditional registration strategy and population-based atlas. The experimental results show that the proposed method achieves the best segmentation accuracy by comparison with other state-of-the-art segmentation methods. Conclusions: The authors have proposed a new CBCT segmentation method by using patch-based sparse representation and convex optimization, which can achieve considerably accurate segmentation results in CBCT

A Non-static Data Layout Enhancing Parallelism and Vectorization in Sparse Grid Algorithms

KAUST Repository

Buse, Gerrit

2012-06-01

The name sparse grids denotes a highly space-efficient, grid-based numerical technique to approximate high-dimensional functions. Although employed in a broad spectrum of applications from different fields, there have only been few tries to use it in real time visualization (e.g. [1]), due to complex data structures and long algorithm runtime. In this work we present a novel approach inspired by principles of I/0-efficient algorithms. Locally applied coefficient permutations lead to improved cache performance and facilitate the use of vector registers for our sparse grid benchmark problem hierarchization. Based on the compact data structure proposed for regular sparse grids in [2], we developed a new algorithm that outperforms existing implementations on modern multi-core systems by a factor of 37 for a grid size of 127 million points. For larger problems the speedup is even increasing, and with execution times below 1 s, sparse grids are well-suited for visualization applications. Furthermore, we point out how a broad class of sparse grid algorithms can benefit from our approach. © 2012 IEEE.

History-dependent dynamics in a generic model of ion channels - an analytic study

Directory of Open Access Journals (Sweden)

Daniel Soudry

2010-04-01

Full Text Available Recent experiments have demonstrated that the timescale of adaptation of single neurons and ion channel populations to stimuli slows down as the length of stimulation increases; in fact, no upper bound on temporal time-scales seems to exist in such systems. Furthermore, patch clamp experiments on single ion channels have hinted at the existence of large, mostly unobservable, inactivation state spaces within a single ion channel. This raises the question of the relation between this multitude of inactivation states and the observed behavior. In this work we propose a minimal model for ion channel dynamics which does not assume any specific structure of the inactivation state space. The model is simple enough to render an analytical study possible. This leads to a clear and concise explanation of the experimentally observed exponential history-dependent relaxation in sodium channels in a voltage clamp setting, and shows that their recovery rate from slow inactivation must be voltage dependent. Furthermore, we predict that history-dependent relaxation cannot be created by overly sparse spiking activity. While the model was created with ion channel populations in mind, its simplicity and genericalness render it a good starting point for modeling similar effects in other systems, and for scaling up to higher levels such as single neurons which are also known to exhibit multiple time scales.

Enhancing adaptive sparse grid approximations and improving refinement strategies using adjoint-based a posteriori error estimates

Science.gov (United States)

Jakeman, J. D.; Wildey, T.

2015-01-01

In this paper we present an algorithm for adaptive sparse grid approximations of quantities of interest computed from discretized partial differential equations. We use adjoint-based a posteriori error estimates of the physical discretization error and the interpolation error in the sparse grid to enhance the sparse grid approximation and to drive adaptivity of the sparse grid. Utilizing these error estimates provides significantly more accurate functional values for random samples of the sparse grid approximation. We also demonstrate that alternative refinement strategies based upon a posteriori error estimates can lead to further increases in accuracy in the approximation over traditional hierarchical surplus based strategies. Throughout this paper we also provide and test a framework for balancing the physical discretization error with the stochastic interpolation error of the enhanced sparse grid approximation.

Enhancing adaptive sparse grid approximations and improving refinement strategies using adjoint-based a posteriori error estimates

International Nuclear Information System (INIS)

Jakeman, J.D.; Wildey, T.

2015-01-01

In this paper we present an algorithm for adaptive sparse grid approximations of quantities of interest computed from discretized partial differential equations. We use adjoint-based a posteriori error estimates of the physical discretization error and the interpolation error in the sparse grid to enhance the sparse grid approximation and to drive adaptivity of the sparse grid. Utilizing these error estimates provides significantly more accurate functional values for random samples of the sparse grid approximation. We also demonstrate that alternative refinement strategies based upon a posteriori error estimates can lead to further increases in accuracy in the approximation over traditional hierarchical surplus based strategies. Throughout this paper we also provide and test a framework for balancing the physical discretization error with the stochastic interpolation error of the enhanced sparse grid approximation

Single image super-resolution based on compressive sensing and improved TV minimization sparse recovery

Science.gov (United States)

Vishnukumar, S.; Wilscy, M.

2017-12-01

In this paper, we propose a single image Super-Resolution (SR) method based on Compressive Sensing (CS) and Improved Total Variation (TV) Minimization Sparse Recovery. In the CS framework, low-resolution (LR) image is treated as the compressed version of high-resolution (HR) image. Dictionary Training and Sparse Recovery are the two phases of the method. K-Singular Value Decomposition (K-SVD) method is used for dictionary training and the dictionary represents HR image patches in a sparse manner. Here, only the interpolated version of the LR image is used for training purpose and thereby the structural self similarity inherent in the LR image is exploited. In the sparse recovery phase the sparse representation coefficients with respect to the trained dictionary for LR image patches are derived using Improved TV Minimization method. HR image can be reconstructed by the linear combination of the dictionary and the sparse coefficients. The experimental results show that the proposed method gives better results quantitatively as well as qualitatively on both natural and remote sensing images. The reconstructed images have better visual quality since edges and other sharp details are preserved.

SPARSE: quadratic time simultaneous alignment and folding of RNAs without sequence-based heuristics

Science.gov (United States)

Will, Sebastian; Otto, Christina; Miladi, Milad; Möhl, Mathias; Backofen, Rolf

2015-01-01

Motivation: RNA-Seq experiments have revealed a multitude of novel ncRNAs. The gold standard for their analysis based on simultaneous alignment and folding suffers from extreme time complexity of O(n6). Subsequently, numerous faster ‘Sankoff-style’ approaches have been suggested. Commonly, the performance of such methods relies on sequence-based heuristics that restrict the search space to optimal or near-optimal sequence alignments; however, the accuracy of sequence-based methods breaks down for RNAs with sequence identities below 60%. Alignment approaches like LocARNA that do not require sequence-based heuristics, have been limited to high complexity (≥ quartic time). Results: Breaking this barrier, we introduce the novel Sankoff-style algorithm ‘sparsified prediction and alignment of RNAs based on their structure ensembles (SPARSE)’, which runs in quadratic time without sequence-based heuristics. To achieve this low complexity, on par with sequence alignment algorithms, SPARSE features strong sparsification based on structural properties of the RNA ensembles. Following PMcomp, SPARSE gains further speed-up from lightweight energy computation. Although all existing lightweight Sankoff-style methods restrict Sankoff’s original model by disallowing loop deletions and insertions, SPARSE transfers the Sankoff algorithm to the lightweight energy model completely for the first time. Compared with LocARNA, SPARSE achieves similar alignment and better folding quality in significantly less time (speedup: 3.7). At similar run-time, it aligns low sequence identity instances substantially more accurate than RAF, which uses sequence-based heuristics. Availability and implementation: SPARSE is freely available at http://www.bioinf.uni-freiburg.de/Software/SPARSE. Contact: backofen@informatik.uni-freiburg.de Supplementary information: Supplementary data are available at Bioinformatics online. PMID:25838465

Ca2+-dependent phospholipid scrambling by a reconstituted TMEM16 ion channel.

Science.gov (United States)

Malvezzi, Mattia; Chalat, Madhavan; Janjusevic, Radmila; Picollo, Alessandra; Terashima, Hiroyuki; Menon, Anant K; Accardi, Alessio

2013-01-01

Phospholipid (PL) scramblases disrupt the lipid asymmetry of the plasma membrane, externalizing phosphatidylserine to trigger blood coagulation and mark apoptotic cells. Recently, members of the TMEM16 family of Ca(2+)-gated channels have been shown to be involved in Ca(2+)-dependent scrambling. It is however controversial whether they are scramblases or channels regulating scrambling. Here we show that purified afTMEM16, from Aspergillus fumigatus, is a dual-function protein: it is a Ca(2+)-gated channel, with characteristics of other TMEM16 homologues, and a Ca(2+)-dependent scramblase, with the expected properties of mammalian PL scramblases. Remarkably, we find that a single Ca(2+) site regulates separate transmembrane pathways for ions and lipids. Two other purified TMEM16-channel homologues do not mediate scrambling, suggesting that the family diverged into channels and channel/scramblases. We propose that the spatial separation of the ion and lipid pathways underlies the evolutionary divergence of the TMEM16 family, and that other homologues, such as TMEM16F, might also be dual-function channel/scramblases.

Greedy Algorithms for Nonnegativity-Constrained Simultaneous Sparse Recovery

Science.gov (United States)

Kim, Daeun; Haldar, Justin P.

2016-01-01

This work proposes a family of greedy algorithms to jointly reconstruct a set of vectors that are (i) nonnegative and (ii) simultaneously sparse with a shared support set. The proposed algorithms generalize previous approaches that were designed to impose these constraints individually. Similar to previous greedy algorithms for sparse recovery, the proposed algorithms iteratively identify promising support indices. In contrast to previous approaches, the support index selection procedure has been adapted to prioritize indices that are consistent with both the nonnegativity and shared support constraints. Empirical results demonstrate for the first time that the combined use of simultaneous sparsity and nonnegativity constraints can substantially improve recovery performance relative to existing greedy algorithms that impose less signal structure. PMID:26973368

SPARSE ELECTROMAGNETIC IMAGING USING NONLINEAR LANDWEBER ITERATIONS

KAUST Repository

Desmal, Abdulla; Bagci, Hakan

2015-01-01

minimization problem is solved using nonlinear Landweber iterations, where at each iteration a thresholding function is applied to enforce the sparseness-promoting L0/L1-norm constraint. The thresholded nonlinear Landweber iterations are applied to several two

Effects of sparse sampling schemes on image quality in low-dose CT

International Nuclear Information System (INIS)

Abbas, Sajid; Lee, Taewon; Cho, Seungryong; Shin, Sukyoung; Lee, Rena

2013-01-01

Purpose: Various scanning methods and image reconstruction algorithms are actively investigated for low-dose computed tomography (CT) that can potentially reduce a health-risk related to radiation dose. Particularly, compressive-sensing (CS) based algorithms have been successfully developed for reconstructing images from sparsely sampled data. Although these algorithms have shown promises in low-dose CT, it has not been studied how sparse sampling schemes affect image quality in CS-based image reconstruction. In this work, the authors present several sparse-sampling schemes for low-dose CT, quantitatively analyze their data property, and compare effects of the sampling schemes on the image quality.Methods: Data properties of several sampling schemes are analyzed with respect to the CS-based image reconstruction using two measures: sampling density and data incoherence. The authors present five different sparse sampling schemes, and simulated those schemes to achieve a targeted dose reduction. Dose reduction factors of about 75% and 87.5%, compared to a conventional scan, were tested. A fully sampled circular cone-beam CT data set was used as a reference, and sparse sampling has been realized numerically based on the CBCT data.Results: It is found that both sampling density and data incoherence affect the image quality in the CS-based reconstruction. Among the sampling schemes the authors investigated, the sparse-view, many-view undersampling (MVUS)-fine, and MVUS-moving cases have shown promising results. These sampling schemes produced images with similar image quality compared to the reference image and their structure similarity index values were higher than 0.92 in the mouse head scan with 75% dose reduction.Conclusions: The authors found that in CS-based image reconstructions both sampling density and data incoherence affect the image quality, and suggest that a sampling scheme should be devised and optimized by use of these indicators. With this strategic

Impact of a bone conduction communication channel on multichannel communication system effectiveness.

Science.gov (United States)

Blue, Misty; McBride, Maranda; Weatherless, Rachel; Letowski, Tomasz

2013-04-01

In this study, the impact of including a bone conduction transducer in a three-channel spatialized communication system was investigated. Several military and security forces situations require concurrent listening to three or more radio channels. In such radio systems, spatial separation between three concurrent radio channels can be achieved by delivering separate signals to the left and right earphone independently and both earphones simultaneously. This method appears to be effective; however, the use of bone conduction as one channel may provide both operational and performance benefits. Three three-channel communication systems were used to collect speech intelligibility data from 18 listeners (System I, three loudspeakers; System 2, stereo headphones; System 3, stereo headphones and a bone conduction vibrator). Each channel presented signals perceived to originate from separate locations. Volunteers listened to three sets of competing sentences and identified a number, color, and object spoken in the target sentence. Each listener participated in three trials (one per system). Each trial consisted of 48 competing sentence sets. Systems 2 and 3 were more intelligible than System I. Systems 2 and 3 were overall equally intelligible; however, the intelligibility of all three channels was significantly more balanced in System 3. Replacing an air conduction transducer with a bone conduction transducer in a multichannel audio device can provide a more effective and balanced simultaneous monitoring auditory environment. These results have important design and implementation implications for spatial auditory communication equipment.

Pulse-Width-Modulation of Neutral-Point-Clamped Sparse Matrix Converter

DEFF Research Database (Denmark)

Loh, P.C.; Blaabjerg, Frede; Gao, F.

2007-01-01

input current and output voltage can be achieved with minimized rectification switching loss, rendering the sparse matrix converter as a competitive choice for interfacing the utility grid to (e.g.) defense facilities that require a different frequency supply. As an improvement, sparse matrix converter...... with improved waveform quality. Performances and practicalities of the designed schemes are verified in simulation and experimentally using an implemented laboratory prototype with some representative results captured and presented in the paper....

Boundary separating the seismically active reelfoot rift from the sparsely seismic Rough Creek graben, Kentucky and Illinois

Science.gov (United States)

Wheeler, R.L.

1997-01-01

The Reelfoot rift is the most active of six Iapetan rifts and grabens in central and eastern North America. In contrast, the Rough Creek graben is one of the least active, being seismically indistinguishable from the central craton of North America. Yet the rift and graben adjoin. Hazard assessment in the rift and graben would be aided by identification of a boundary between them. Changes in the strikes of single large faults, the location of a Cambrian transfer zone, and the geographic extent of alkaline igneous rocks provide three independent estimates of the location of a structural boundary between the rift and the graben. The boundary trends north-northwest through the northeastern part of the Fluorspar Area Fault Complex of Kentucky and Illinois, and has no obvious surface expression. The boundary involves the largest faults, which are the most likely to penetrate to hypocentral depths, and the boundary coincides with the geographic change from abundant seismicity in the rift to sparse seismicity in the graben. Because the structural boundary was defined by geologic variables that are expected to be causally associated with seismicity, it may continue to bound the Reelfoot rift seismicity in the future.

Nonlinear spike-and-slab sparse coding for interpretable image encoding.

Directory of Open Access Journals (Sweden)

Jacquelyn A Shelton

Full Text Available Sparse coding is a popular approach to model natural images but has faced two main challenges: modelling low-level image components (such as edge-like structures and their occlusions and modelling varying pixel intensities. Traditionally, images are modelled as a sparse linear superposition of dictionary elements, where the probabilistic view of this problem is that the coefficients follow a Laplace or Cauchy prior distribution. We propose a novel model that instead uses a spike-and-slab prior and nonlinear combination of components. With the prior, our model can easily represent exact zeros for e.g. the absence of an image component, such as an edge, and a distribution over non-zero pixel intensities. With the nonlinearity (the nonlinear max combination rule, the idea is to target occlusions; dictionary elements correspond to image components that can occlude each other. There are major consequences of the model assumptions made by both (nonlinear approaches, thus the main goal of this paper is to isolate and highlight differences between them. Parameter optimization is analytically and computationally intractable in our model, thus as a main contribution we design an exact Gibbs sampler for efficient inference which we can apply to higher dimensional data using latent variable preselection. Results on natural and artificial occlusion-rich data with controlled forms of sparse structure show that our model can extract a sparse set of edge-like components that closely match the generating process, which we refer to as interpretable components. Furthermore, the sparseness of the solution closely follows the ground-truth number of components/edges in the images. The linear model did not learn such edge-like components with any level of sparsity. This suggests that our model can adaptively well-approximate and characterize the meaningful generation process.

Efficient sparse matrix-matrix multiplication for computing periodic responses by shooting method on Intel Xeon Phi

Science.gov (United States)

Stoykov, S.; Atanassov, E.; Margenov, S.

2016-10-01

Many of the scientific applications involve sparse or dense matrix operations, such as solving linear systems, matrix-matrix products, eigensolvers, etc. In what concerns structural nonlinear dynamics, the computations of periodic responses and the determination of stability of the solution are of primary interest. Shooting method iswidely used for obtaining periodic responses of nonlinear systems. The method involves simultaneously operations with sparse and dense matrices. One of the computationally expensive operations in the method is multiplication of sparse by dense matrices. In the current work, a new algorithm for sparse matrix by dense matrix products is presented. The algorithm takes into account the structure of the sparse matrix, which is obtained by space discretization of the nonlinear Mindlin's plate equation of motion by the finite element method. The algorithm is developed to use the vector engine of Intel Xeon Phi coprocessors. It is compared with the standard sparse matrix by dense matrix algorithm and the one developed by Intel MKL and it is shown that by considering the properties of the sparse matrix better algorithms can be developed.

Compressed sensing & sparse filtering

CERN Document Server

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

Simulation of channelled ion ranges in crystalline silicon

International Nuclear Information System (INIS)

Kabadayi, Oender; Guemues, Hasan

2004-01-01

We present results from a channelled ion range simulation model based on separation of ion trajectories into three different categories known as random, channelled, and well-channelled. We present this for boron projectiles incident along the Si direction. Stopping powers for channelled particles, well-channelled, and random particles are determined using experimental ratios of random and channelled stopping powers for a boron/silicon system. We have found the particle range distributions and the mean range of particles in crystalline channels. A new program code has been developed for the implementation of the presented model. The results are compared with experimental data as well as Crystal-transport and range of ions in matter, stopping and ranges of ions in matter, and projected range algorithm programs. We have found good agreement between our calculations and experiment, with an average discrepancy of 7%. Our model is also able to simulate the observed shift towards larger depths for the main ion distribution under channelling conditions

Dose-shaping using targeted sparse optimization

International Nuclear Information System (INIS)

Sayre, George A.; Ruan, Dan

2013-01-01

Purpose: Dose volume histograms (DVHs) are common tools in radiation therapy treatment planning to characterize plan quality. As statistical metrics, DVHs provide a compact summary of the underlying plan at the cost of losing spatial information: the same or similar dose-volume histograms can arise from substantially different spatial dose maps. This is exactly the reason why physicians and physicists scrutinize dose maps even after they satisfy all DVH endpoints numerically. However, up to this point, little has been done to control spatial phenomena, such as the spatial distribution of hot spots, which has significant clinical implications. To this end, the authors propose a novel objective function that enables a more direct tradeoff between target coverage, organ-sparing, and planning target volume (PTV) homogeneity, and presents our findings from four prostate cases, a pancreas case, and a head-and-neck case to illustrate the advantages and general applicability of our method.Methods: In designing the energy minimization objective (E tot sparse ), the authors utilized the following robust cost functions: (1) an asymmetric linear well function to allow differential penalties for underdose, relaxation of prescription dose, and overdose in the PTV; (2) a two-piece linear function to heavily penalize high dose and mildly penalize low and intermediate dose in organs-at risk (OARs); and (3) a total variation energy, i.e., the L 1 norm applied to the first-order approximation of the dose gradient in the PTV. By minimizing a weighted sum of these robust costs, general conformity to dose prescription and dose-gradient prescription is achieved while encouraging prescription violations to follow a Laplace distribution. In contrast, conventional quadratic objectives are associated with a Gaussian distribution of violations, which is less forgiving to large violations of prescription than the Laplace distribution. As a result, the proposed objective E tot sparse improves

Dose-shaping using targeted sparse optimization.

Science.gov (United States)

Sayre, George A; Ruan, Dan

2013-07-01

Dose volume histograms (DVHs) are common tools in radiation therapy treatment planning to characterize plan quality. As statistical metrics, DVHs provide a compact summary of the underlying plan at the cost of losing spatial information: the same or similar dose-volume histograms can arise from substantially different spatial dose maps. This is exactly the reason why physicians and physicists scrutinize dose maps even after they satisfy all DVH endpoints numerically. However, up to this point, little has been done to control spatial phenomena, such as the spatial distribution of hot spots, which has significant clinical implications. To this end, the authors propose a novel objective function that enables a more direct tradeoff between target coverage, organ-sparing, and planning target volume (PTV) homogeneity, and presents our findings from four prostate cases, a pancreas case, and a head-and-neck case to illustrate the advantages and general applicability of our method. In designing the energy minimization objective (E tot (sparse)), the authors utilized the following robust cost functions: (1) an asymmetric linear well function to allow differential penalties for underdose, relaxation of prescription dose, and overdose in the PTV; (2) a two-piece linear function to heavily penalize high dose and mildly penalize low and intermediate dose in organs-at risk (OARs); and (3) a total variation energy, i.e., the L1 norm applied to the first-order approximation of the dose gradient in the PTV. By minimizing a weighted sum of these robust costs, general conformity to dose prescription and dose-gradient prescription is achieved while encouraging prescription violations to follow a Laplace distribution. In contrast, conventional quadratic objectives are associated with a Gaussian distribution of violations, which is less forgiving to large violations of prescription than the Laplace distribution. As a result, the proposed objective E tot (sparse) improves tradeoff between

Signal Sampling for Efficient Sparse Representation of Resting State FMRI Data

Science.gov (United States)

Ge, Bao; Makkie, Milad; Wang, Jin; Zhao, Shijie; Jiang, Xi; Li, Xiang; Lv, Jinglei; Zhang, Shu; Zhang, Wei; Han, Junwei; Guo, Lei; Liu, Tianming

2015-01-01

As the size of brain imaging data such as fMRI grows explosively, it provides us with unprecedented and abundant information about the brain. How to reduce the size of fMRI data but not lose much information becomes a more and more pressing issue. Recent literature studies tried to deal with it by dictionary learning and sparse representation methods, however, their computation complexities are still high, which hampers the wider application of sparse representation method to large scale fMRI datasets. To effectively address this problem, this work proposes to represent resting state fMRI (rs-fMRI) signals of a whole brain via a statistical sampling based sparse representation. First we sampled the whole brain’s signals via different sampling methods, then the sampled signals were aggregate into an input data matrix to learn a dictionary, finally this dictionary was used to sparsely represent the whole brain’s signals and identify the resting state networks. Comparative experiments demonstrate that the proposed signal sampling framework can speed-up by ten times in reconstructing concurrent brain networks without losing much information. The experiments on the 1000 Functional Connectomes Project further demonstrate its effectiveness and superiority. PMID:26646924

Feature based omnidirectional sparse visual path following

OpenAIRE

Goedemé, Toon; Tuytelaars, Tinne; Van Gool, Luc; Vanacker, Gerolf; Nuttin, Marnix

2005-01-01

Goedemé T., Tuytelaars T., Van Gool L., Vanacker G., Nuttin M., ''Feature based omnidirectional sparse visual path following'', Proceedings IEEE/RSJ international conference on intelligent robots and systems - IROS2005, pp. 1003-1008, August 2-6, 2005, Edmonton, Alberta, Canada.

A Non-static Data Layout Enhancing Parallelism and Vectorization in Sparse Grid Algorithms

KAUST Repository

Buse, Gerrit; Pfluger, Dirk; Murarasu, Alin; Jacob, Riko

2012-01-01

performance and facilitate the use of vector registers for our sparse grid benchmark problem hierarchization. Based on the compact data structure proposed for regular sparse grids in [2], we developed a new algorithm that outperforms existing implementations

Smartphone-Based Indoor Localization with Bluetooth Low Energy Beacons

Directory of Open Access Journals (Sweden)

Yuan Zhuang

2016-04-01

Full Text Available Indoor wireless localization using Bluetooth Low Energy (BLE beacons has attracted considerable attention after the release of the BLE protocol. In this paper, we propose an algorithm that uses the combination of channel-separate polynomial regression model (PRM, channel-separate fingerprinting (FP, outlier detection and extended Kalman filtering (EKF for smartphone-based indoor localization with BLE beacons. The proposed algorithm uses FP and PRM to estimate the target’s location and the distances between the target and BLE beacons respectively. We compare the performance of distance estimation that uses separate PRM for three advertisement channels (i.e., the separate strategy with that use an aggregate PRM generated through the combination of information from all channels (i.e., the aggregate strategy. The performance of FP-based location estimation results of the separate strategy and the aggregate strategy are also compared. It was found that the separate strategy can provide higher accuracy; thus, it is preferred to adopt PRM and FP for each BLE advertisement channel separately. Furthermore, to enhance the robustness of the algorithm, a two-level outlier detection mechanism is designed. Distance and location estimates obtained from PRM and FP are passed to the first outlier detection to generate improved distance estimates for the EKF. After the EKF process, the second outlier detection algorithm based on statistical testing is further performed to remove the outliers. The proposed algorithm was evaluated by various field experiments. Results show that the proposed algorithm achieved the accuracy of <2.56 m at 90% of the time with dense deployment of BLE beacons (1 beacon per 9 m, which performs 35.82% better than <3.99 m from the Propagation Model (PM + EKF algorithm and 15.77% more accurate than <3.04 m from the FP + EKF algorithm. With sparse deployment (1 beacon per 18 m, the proposed algorithm achieves the accuracies of <3.88 m at

Modeling channel interference in an orbital angular momentum-multiplexed laser link

Science.gov (United States)

Anguita, Jaime A.; Neifeld, Mark A.; Vasic, Bane V.

2009-08-01

We study the effects of optical turbulence on the energy crosstalk among constituent orbital angular momentum (OAM) states in a vortex-based multi-channel laser communication link and determine channel interference in terms of turbulence strength and OAM state separation. We characterize the channel interference as a function of C2n and transmit OAM state, and propose probability models to predict the random fluctuations in the received signals for such architecture. Simulations indicate that turbulence-induced channel interference is mutually correlated across receive channels.

New methods for sampling sparse populations

Science.gov (United States)

Anna Ringvall

2007-01-01

To improve surveys of sparse objects, methods that use auxiliary information have been suggested. Guided transect sampling uses prior information, e.g., from aerial photographs, for the layout of survey strips. Instead of being laid out straight, the strips will wind between potentially more interesting areas. 3P sampling (probability proportional to prediction) uses...

Balanced and sparse Tamo-Barg codes

KAUST Repository

Halbawi, Wael; Duursma, Iwan; Dau, Hoang; Hassibi, Babak

2017-01-01

We construct balanced and sparse generator matrices for Tamo and Barg's Locally Recoverable Codes (LRCs). More specifically, for a cyclic Tamo-Barg code of length n, dimension k and locality r, we show how to deterministically construct a generator matrix where the number of nonzeros in any two columns differs by at most one, and where the weight of every row is d + r - 1, where d is the minimum distance of the code. Since LRCs are designed mainly for distributed storage systems, the results presented in this work provide a computationally balanced and efficient encoding scheme for these codes. The balanced property ensures that the computational effort exerted by any storage node is essentially the same, whilst the sparse property ensures that this effort is minimal. The work presented in this paper extends a similar result previously established for Reed-Solomon (RS) codes, where it is now known that any cyclic RS code possesses a generator matrix that is balanced as described, but is sparsest, meaning that each row has d nonzeros.

Balanced and sparse Tamo-Barg codes

KAUST Repository

Halbawi, Wael

2017-08-29

We construct balanced and sparse generator matrices for Tamo and Barg\\'s Locally Recoverable Codes (LRCs). More specifically, for a cyclic Tamo-Barg code of length n, dimension k and locality r, we show how to deterministically construct a generator matrix where the number of nonzeros in any two columns differs by at most one, and where the weight of every row is d + r - 1, where d is the minimum distance of the code. Since LRCs are designed mainly for distributed storage systems, the results presented in this work provide a computationally balanced and efficient encoding scheme for these codes. The balanced property ensures that the computational effort exerted by any storage node is essentially the same, whilst the sparse property ensures that this effort is minimal. The work presented in this paper extends a similar result previously established for Reed-Solomon (RS) codes, where it is now known that any cyclic RS code possesses a generator matrix that is balanced as described, but is sparsest, meaning that each row has d nonzeros.

MIMO Channel Capacity for Handsets in Data Mode Operation

DEFF Research Database (Denmark)

Nielsen, Jesper Ødum; Yanakiev, Boyan; Bonev, Ivan Bonev

2010-01-01

The current paper concerns realistic evaluation of the capacity of the MIMO channel between a BS and handheld device, such as a PDA or smart phone, held in front of the user’s body (data mode). The work is based on measurements of the MIMO channel between two widely separated BSs in a micro...

The application of sparse linear prediction dictionary to compressive sensing in speech signals

Directory of Open Access Journals (Sweden)

YOU Hanxu

2016-04-01

Full Text Available Appling compressive sensing (CS,which theoretically guarantees that signal sampling and signal compression can be achieved simultaneously,into audio and speech signal processing is one of the most popular research topics in recent years.In this paper,K-SVD algorithm was employed to learn a sparse linear prediction dictionary regarding as the sparse basis of underlying speech signals.Compressed signals was obtained by applying random Gaussian matrix to sample original speech frames.Orthogonal matching pursuit (OMP and compressive sampling matching pursuit (CoSaMP were adopted to recovery original signals from compressed one.Numbers of experiments were carried out to investigate the impact of speech frames length,compression ratios,sparse basis and reconstruction algorithms on CS performance.Results show that sparse linear prediction dictionary can advance the performance of speech signals reconstruction compared with discrete cosine transform (DCT matrix.

Mutation rules and the evolution of sparseness and modularity in biological systems.

Directory of Open Access Journals (Sweden)

Tamar Friedlander

Full Text Available Biological systems exhibit two structural features on many levels of organization: sparseness, in which only a small fraction of possible interactions between components actually occur; and modularity--the near decomposability of the system into modules with distinct functionality. Recent work suggests that modularity can evolve in a variety of circumstances, including goals that vary in time such that they share the same subgoals (modularly varying goals, or when connections are costly. Here, we studied the origin of modularity and sparseness focusing on the nature of the mutation process, rather than on connection cost or variations in the goal. We use simulations of evolution with different mutation rules. We found that commonly used sum-rule mutations, in which interactions are mutated by adding random numbers, do not lead to modularity or sparseness except for in special situations. In contrast, product-rule mutations in which interactions are mutated by multiplying by random numbers--a better model for the effects of biological mutations--led to sparseness naturally. When the goals of evolution are modular, in the sense that specific groups of inputs affect specific groups of outputs, product-rule mutations also lead to modular structure; sum-rule mutations do not. Product-rule mutations generate sparseness and modularity because they tend to reduce interactions, and to keep small interaction terms small.

Natural image sequences constrain dynamic receptive fields and imply a sparse code.

Science.gov (United States)

Häusler, Chris; Susemihl, Alex; Nawrot, Martin P

2013-11-06

In their natural environment, animals experience a complex and dynamic visual scenery. Under such natural stimulus conditions, neurons in the visual cortex employ a spatially and temporally sparse code. For the input scenario of natural still images, previous work demonstrated that unsupervised feature learning combined with the constraint of sparse coding can predict physiologically measured receptive fields of simple cells in the primary visual cortex. This convincingly indicated that the mammalian visual system is adapted to the natural spatial input statistics. Here, we extend this approach to the time domain in order to predict dynamic receptive fields that can account for both spatial and temporal sparse activation in biological neurons. We rely on temporal restricted Boltzmann machines and suggest a novel temporal autoencoding training procedure. When tested on a dynamic multi-variate benchmark dataset this method outperformed existing models of this class. Learning features on a large dataset of natural movies allowed us to model spatio-temporal receptive fields for single neurons. They resemble temporally smooth transformations of previously obtained static receptive fields and are thus consistent with existing theories. A neuronal spike response model demonstrates how the dynamic receptive field facilitates temporal and population sparseness. We discuss the potential mechanisms and benefits of a spatially and temporally sparse representation of natural visual input. Copyright © 2013 The Authors. Published by Elsevier B.V. All rights reserved.

Rapid cell separation with minimal manipulation for autologous cell therapies

Science.gov (United States)

Smith, Alban J.; O'Rorke, Richard D.; Kale, Akshay; Rimsa, Roberts; Tomlinson, Matthew J.; Kirkham, Jennifer; Davies, A. Giles; Wälti, Christoph; Wood, Christopher D.

2017-02-01

The ability to isolate specific, viable cell populations from mixed ensembles with minimal manipulation and within intra-operative time would provide significant advantages for autologous, cell-based therapies in regenerative medicine. Current cell-enrichment technologies are either slow, lack specificity and/or require labelling. Thus a rapid, label-free separation technology that does not affect cell functionality, viability or phenotype is highly desirable. Here, we demonstrate separation of viable from non-viable human stromal cells using remote dielectrophoresis, in which an electric field is coupled into a microfluidic channel using shear-horizontal surface acoustic waves, producing an array of virtual electrodes within the channel. This allows high-throughput dielectrophoretic cell separation in high conductivity, physiological-like fluids, overcoming the limitations of conventional dielectrophoresis. We demonstrate viable/non-viable separation efficacy of >98% in pre-purified mesenchymal stromal cells, extracted from human dental pulp, with no adverse effects on cell viability, or on their subsequent osteogenic capabilities.

Model reduction method using variable-separation for stochastic saddle point problems

Science.gov (United States)

Jiang, Lijian; Li, Qiuqi

2018-02-01

In this paper, we consider a variable-separation (VS) method to solve the stochastic saddle point (SSP) problems. The VS method is applied to obtain the solution in tensor product structure for stochastic partial differential equations (SPDEs) in a mixed formulation. The aim of such a technique is to construct a reduced basis approximation of the solution of the SSP problems. The VS method attempts to get a low rank separated representation of the solution for SSP in a systematic enrichment manner. No iteration is performed at each enrichment step. In order to satisfy the inf-sup condition in the mixed formulation, we enrich the separated terms for the primal system variable at each enrichment step. For the SSP problems by regularization or penalty, we propose a more efficient variable-separation (VS) method, i.e., the variable-separation by penalty method. This can avoid further enrichment of the separated terms in the original mixed formulation. The computation of the variable-separation method decomposes into offline phase and online phase. Sparse low rank tensor approximation method is used to significantly improve the online computation efficiency when the number of separated terms is large. For the applications of SSP problems, we present three numerical examples to illustrate the performance of the proposed methods.

Transmural expression of ion channels and transporters in human nondiseased and end-stage failing hearts

DEFF Research Database (Denmark)

Soltysinska, Ewa; Olesen, Søren-Peter; Christ, Torsten

2009-01-01

The cardiac action potential is primarily shaped by the orchestrated function of several different types of ion channels and transporters. One of the regional differences believed to play a major role in the progression and stability of the action potential is the transmural gradient of electrica...... cardiac ion channels and transporters which may in part explain the increased susceptibility to arrhythmia in end-state failing hearts....... activity across the ventricular wall. An altered balance in the ionic currents across the free wall is assumed to be a substrate for arrhythmia. A large fraction of patients with heart failure experience ventricular arrhythmia. However, the underlying substrate of these functional changes is not well......-established as expression analyses of human heart failure (HF) are sparse. We have investigated steady-state RNA levels by quantitative polymerase chain reaction of ion channels, transporters, connexin 43, and miR-1 in 11 end-stage HF and seven nonfailing (NF) hearts. The quantifications were performed on endo-, mid...

The Roles of Sparse Direct Methods in Large-scale Simulations

Energy Technology Data Exchange (ETDEWEB)

Li, Xiaoye S.; Gao, Weiguo; Husbands, Parry J.R.; Yang, Chao; Ng, Esmond G.

2005-06-27

Sparse systems of linear equations and eigen-equations arise at the heart of many large-scale, vital simulations in DOE. Examples include the Accelerator Science and Technology SciDAC (Omega3P code, electromagnetic problem), the Center for Extended Magnetohydrodynamic Modeling SciDAC(NIMROD and M3D-C1 codes, fusion plasma simulation). The Terascale Optimal PDE Simulations (TOPS)is providing high-performance sparse direct solvers, which have had significant impacts on these applications. Over the past several years, we have been working closely with the other SciDAC teams to solve their large, sparse matrix problems arising from discretization of the partial differential equations. Most of these systems are very ill-conditioned, resulting in extremely poor convergence deployed our direct methods techniques in these applications, which achieved significant scientific results as well as performance gains. These successes were made possible through the SciDAC model of computer scientists and application scientists working together to take full advantage of terascale computing systems and new algorithms research.

The Roles of Sparse Direct Methods in Large-scale Simulations

International Nuclear Information System (INIS)

Li, Xiaoye S.; Gao, Weiguo; Husbands, Parry J.R.; Yang, Chao; Ng, Esmond G.

2005-01-01

Sparse systems of linear equations and eigen-equations arise at the heart of many large-scale, vital simulations in DOE. Examples include the Accelerator Science and Technology SciDAC (Omega3P code, electromagnetic problem), the Center for Extended Magnetohydrodynamic Modeling SciDAC(NIMROD and M3D-C1 codes, fusion plasma simulation). The Terascale Optimal PDE Simulations (TOPS)is providing high-performance sparse direct solvers, which have had significant impacts on these applications. Over the past several years, we have been working closely with the other SciDAC teams to solve their large, sparse matrix problems arising from discretization of the partial differential equations. Most of these systems are very ill-conditioned, resulting in extremely poor convergence deployed our direct methods techniques in these applications, which achieved significant scientific results as well as performance gains. These successes were made possible through the SciDAC model of computer scientists and application scientists working together to take full advantage of terascale computing systems and new algorithms research

Sparse logistic principal components analysis for binary data

KAUST Repository

Lee, Seokho

2010-09-01

We develop a new principal components analysis (PCA) type dimension reduction method for binary data. Different from the standard PCA which is defined on the observed data, the proposed PCA is defined on the logit transform of the success probabilities of the binary observations. Sparsity is introduced to the principal component (PC) loading vectors for enhanced interpretability and more stable extraction of the principal components. Our sparse PCA is formulated as solving an optimization problem with a criterion function motivated from a penalized Bernoulli likelihood. A Majorization-Minimization algorithm is developed to efficiently solve the optimization problem. The effectiveness of the proposed sparse logistic PCA method is illustrated by application to a single nucleotide polymorphism data set and a simulation study. © Institute ol Mathematical Statistics, 2010.

Sparse Nonnegative Matrix Factorization Strategy for Cochlear Implants

Directory of Open Access Journals (Sweden)

Hongmei Hu

2015-12-01

Full Text Available Current cochlear implant (CI strategies carry speech information via the waveform envelope in frequency subbands. CIs require efficient speech processing to maximize information transfer to the brain, especially in background noise, where the speech envelope is not robust to noise interference. In such conditions, the envelope, after decomposition into frequency bands, may be enhanced by sparse transformations, such as nonnegative matrix factorization (NMF. Here, a novel CI processing algorithm is described, which works by applying NMF to the envelope matrix (envelopogram of 22 frequency channels in order to improve performance in noisy environments. It is evaluated for speech in eight-talker babble noise. The critical sparsity constraint parameter was first tuned using objective measures and then evaluated with subjective speech perception experiments for both normal hearing and CI subjects. Results from vocoder simulations with 10 normal hearing subjects showed that the algorithm significantly enhances speech intelligibility with the selected sparsity constraints. Results from eight CI subjects showed no significant overall improvement compared with the standard advanced combination encoder algorithm, but a trend toward improvement of word identification of about 10 percentage points at +15 dB signal-to-noise ratio (SNR was observed in the eight CI subjects. Additionally, a considerable reduction of the spread of speech perception performance from 40% to 93% for advanced combination encoder to 80% to 100% for the suggested NMF coding strategy was observed.

Use of color-coded sleeve shutters accelerates oscillograph channel selection

Science.gov (United States)

Bouchlas, T.; Bowden, F. W.

1967-01-01

Sleeve-type shutters mechanically adjust individual galvanometer light beams onto or away from selected channels on oscillograph papers. In complex test setups, the sleeve-type shutters are color coded to separately identify each oscillograph channel. This technique could be used on any equipment using tubular galvanometer light sources.

Effect of the channel electron multiplier connection diagram on its parameters

International Nuclear Information System (INIS)

Ajnbund, M.R.

1976-01-01

Basic alternatives of connection of a channel electron multiplier are described. A dependence of a gain factor and amplitude resolution of the channel electron multiplier upon its connection diagram is studied. The studies have shown that the maximum gain factor is typical of an open-output circuit where the signal is recorded from the anode of the channel electron multiplier at a potential with respect to the channel outlet. The highest amplitude resolution is inherent in a separate-anode circuit where the loading resistance is connected directly to the channel outlet

Gas/liquid separator for BWR type reactor

International Nuclear Information System (INIS)

Soma, Naoshi; Akimoto, Seiichi; Yokoyama, Iwao.

1993-01-01

A two phase gas/liquid flow generated at a heating portion of a nuclear reactor is swirled by inlet vanes. The phase gas/liquid flow uprises as a vortex flow in a vortex cylinder, and a liquid phase of a high density gathers at the outer circumference of the vortex cylinder. The liquid phase gathered at the outer circumference is collected at the inlet of a discharge flow channel which protrude into the vortex cylinder and in a three-step structure, and introduced into a recycling liquid phase passing through the discharge flow channel for liquid phase. There is provided a structure that separated liquid collected at the lowermost state in the inlet of the three-step discharge flow channel inlet descends in the discharge flow channel, then uprises in an uprising flow channel and is introduced into the recycling liquid phase by way of a discharge flow channel exit. The height of the discharge flow channel exit is determined equal to that of a liquid level of the recycling liquid phase during rated operation of the reactor. Accordingly, even in a case where the liquid level in the recycling liquid phase is lowered, the liquid level of the uprising flow channel is kept equal to that during rated operation. (I.N.)

An rf separator for cloud muons at TRIUMF

International Nuclear Information System (INIS)

Macdonald, J.A.; Blackmore, E.W.; Bryman, D.A.; Doornbos, J.; Erdman, K.L.; Pearce, R.M.; Poirier, R.L.; Poutissou, J-M.; Spuller, J.

1983-03-01

A particle separator utilizing a magnetic field crossed with an rf electric field has been built and incorporated into the M9 secondary channel to produce a clean negative muon beam at 77 MeV/c +- 5 %. The separator is driven at the main cyclotron frequency (23 MHz) and is phase locked to the primary proton beam. Separation is achieved by using the temporal and velocity differences between the muons produced near the production target (cloud muons), and the pion and electron contaminants in the beam

Sparse linear systems: Theory of decomposition, methods, technology, applications and implementation in Wolfram Mathematica

Energy Technology Data Exchange (ETDEWEB)

Pilipchuk, L. A., E-mail: pilipchik@bsu.by [Belarussian State University, 220030 Minsk, 4, Nezavisimosti avenue, Republic of Belarus (Belarus); Pilipchuk, A. S., E-mail: an.pilipchuk@gmail.com [The Natural Resources and Environmental Protestion Ministry of the Republic of Belarus, 220004 Minsk, 10 Kollektornaya Street, Republic of Belarus (Belarus)

2015-11-30

In this paper we propose the theory of decomposition, methods, technologies, applications and implementation in Wol-fram Mathematica for the constructing the solutions of the sparse linear systems. One of the applications is the Sensor Location Problem for the symmetric graph in the case when split ratios of some arc flows can be zeros. The objective of that application is to minimize the number of sensors that are assigned to the nodes. We obtain a sparse system of linear algebraic equations and research its matrix rank. Sparse systems of these types appear in generalized network flow programming problems in the form of restrictions and can be characterized as systems with a large sparse sub-matrix representing the embedded network structure.

Sparse linear systems: Theory of decomposition, methods, technology, applications and implementation in Wolfram Mathematica

International Nuclear Information System (INIS)

Pilipchuk, L. A.; Pilipchuk, A. S.

2015-01-01

In this paper we propose the theory of decomposition, methods, technologies, applications and implementation in Wol-fram Mathematica for the constructing the solutions of the sparse linear systems. One of the applications is the Sensor Location Problem for the symmetric graph in the case when split ratios of some arc flows can be zeros. The objective of that application is to minimize the number of sensors that are assigned to the nodes. We obtain a sparse system of linear algebraic equations and research its matrix rank. Sparse systems of these types appear in generalized network flow programming problems in the form of restrictions and can be characterized as systems with a large sparse sub-matrix representing the embedded network structure

Face recognition via sparse representation of SIFT feature on hexagonal-sampling image

Science.gov (United States)

Zhang, Daming; Zhang, Xueyong; Li, Lu; Liu, Huayong

2018-04-01

This paper investigates a face recognition approach based on Scale Invariant Feature Transform (SIFT) feature and sparse representation. The approach takes advantage of SIFT which is local feature other than holistic feature in classical Sparse Representation based Classification (SRC) algorithm and possesses strong robustness to expression, pose and illumination variations. Since hexagonal image has more inherit merits than square image to make recognition process more efficient, we extract SIFT keypoint in hexagonal-sampling image. Instead of matching SIFT feature, firstly the sparse representation of each SIFT keypoint is given according the constructed dictionary; secondly these sparse vectors are quantized according dictionary; finally each face image is represented by a histogram and these so-called Bag-of-Words vectors are classified by SVM. Due to use of local feature, the proposed method achieves better result even when the number of training sample is small. In the experiments, the proposed method gave higher face recognition rather than other methods in ORL and Yale B face databases; also, the effectiveness of the hexagonal-sampling in the proposed method is verified.

Low-rank sparse learning for robust visual tracking

KAUST Repository