检索结果-内蒙古大学图书馆

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Stephen R. Schnelle Jason N. Laska Chinmay Hegde Marco F. Duarte Mark A. Davenport Richard G. Baraniuk Department of Electrical and Computer Engineering Rice University Houston TX 77005 Program in Applied and Computational Mathematics Princeton University Princeton NJ 08544

ISBN: (纸本)9781424442959

This paper develops a new class of algorithms for signal recovery in the distributed compressive sensing (DCS) framework. DCS exploits both intra-signal and inter-signal correlations through the concept of joint sparsity to further reduce the number of measurements required for recovery. DCS is well-suited for sensor network applications due to its universality, computational asymmetry, tolerance to quantization and noise, and robustness to measurement loss. In this paper we propose recovery algorithms for the sparse common and innovation joint sparsity model. Our approach leads to a class of efficient algorithms, the Texas Hold 'Em algorithms, which are scalable both in terms of communication bandwidth and computational complexity.

关键词： Signal reconstruction multisensor systems data compression Multisensor systems Signal reconstruction Data compression New classes algorithms Texas Signal restoration Quantization Scalability

来源：评论

学校读者我要写书评

暂无评论

KRONECKER PRODUCT MATRICES FOR COMPRESSIVE SENSING

KRONECKER PRODUCT MATRICES FOR COMPRESSIVE SENSING

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Marco F. Duarte Richard G. Baraniuk Program in Applied and Computational Mathematics Princeton University Princeton NJ 08544 Department of Electrical and Computer Engineering Rice University Houston TX 77005

ISBN: (纸本)9781424442959

Compressive sensing (CS) is an emerging approach for acquisition of signals having a sparse or compressible representation in some basis. While CS literature has mostly focused on problems involving 1-D and 2-D signals, many important applications involve signals that are multidimensional. We propose the use of Kronecker product matrices in CS for two purposes. First, we can use such matrices as sparsifying bases that jointly model the different types of structure present in the signal. Second, the measurement matrices used in distributed measurement settings can be easily expressed as Kronecker products. This new formulation enables the derivation of analytical bounds for sparse approximation and CS recovery of multidimensional signals.

关键词： Data compression multidimensional signal processing signal reconstruction

来源：评论

学校读者我要写书评

暂无评论

Analysis of hyperspectral data with diffusion maps and Fuzzy ART

Analysis of hyperspectral data with diffusion maps and Fuzzy...

引用

2009 International Joint Conference on Neural Networks, IJCNN 2009

作者： Xu, Rui Du Plessis, Louis Damelin, Steven Sears, Michael Wunsch II, Donald C. Applied Computational Intelligence Laboratory Department of Electrical and Computer Engineering Missouri University of Science and Technology MO 65409 United States School of Computational and Applied Mathematics University of the Witwatersrand Johannesburg South Africa Department of Mathematical Sciences Georgia Southern University Statesboro GA 30460 United States School of Computer Science University of the Witwatersrand Johannesburg South Africa Department of Electrical and Computer Engineering Missouri University of Science and Technology Rolla MO 65409 United States

ISBN: (纸本)9781424435531

The presence of large amounts of data in hyperspectral images makes it very difficult to perform further tractable analyses. Here, we present a method of analyzing real hyperspectral data by dimensionality reduction using diffusion maps. Diffusion maps interpret the eigenfunctions of Markov matrices as a system of coordinates on the original data set in order to obtain an efficient representation of data geometric descriptions. A neural network clustering theory, Fuzzy ART, is further applied to the reduced data to form clusters of the potential minerals. Experimental results on a subset of hyperspectral core imager data show that the proposed methods are promising in addressing the complicated hyperspectral data and identifying the minerals in core samples. © 2009 IEEE.

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Frame coherence and sparse signal processing

Frame coherence and sparse signal processing

引用

IEEE International Symposium on Information Theory

作者： Dustin G. Mixon Waheed U. Bajwa Robert Calderbank Program in Applied and Computational Mathematics Princeton University Princeton NJ USA Department of Electrical and Computer Engineering Duke University Durham NC USA

The sparse signal processing literature often uses random sensing matrices to obtain performance guarantees. Unfortunately, in the real world, sensing matrices do not always come from random processes. It is therefore desirable to evaluate whether an arbitrary matrix, or frame, is suitable for sensing sparse signals. To this end, the present paper investigates two parameters that measure the coherence of a frame: worst-case and average coherence. We first provide several examples of frames that have small spectral norm, worst-case coherence, and average coherence. Next, we present a new lower bound on worst-case coherence and compare it to the Welch bound. Later, we propose an algorithm that decreases the average coherence of a frame without changing its spectral norm or worst-case coherence. Finally, we use worst-case and average coherence, as opposed to the Restricted Isometry Property, to garner near-optimal probabilistic guarantees on both sparse signal detection and reconstruction in the presence of noise. This contrasts with recent results that only guarantee noiseless signal recovery from arbitrary frames, and which further assume independence across the nonzero entries of the signal-in a sense, requiring small average coherence replaces the need for such an assumption.

关键词： Coherence Signal processing algorithms Noise Harmonic analysis Noise measurement Geometry

来源：评论

学校读者我要写书评

暂无评论

Gait transitions in a phase oscillator model of an insect central pattern generator

arXiv

引用

arXiv 2017年

作者： Aminzare, Zahra Srivastava, Vaibhav Holmes, Philip Program in Applied and Computational Mathematics Department of Mechanical and Aerospace Engineering Princeton University NJ United States Department of Electrical and Computer Engineering Michigan State University LansingMI United States Program in Applied and Computational Mathematics Department of Mechanical and Aerospace Engineering Princeton Neuroscience Institute Princeton University NJ United States

Legged locomotion involves various gaits. It has been observed that fast running insects (cockroaches) employ a tripod gait with three legs lifted off the ground simultaneously in swing, while slow walking insects (stick insects) use a tetrapod gait with two legs lifted off the ground simultaneously. Fruit flies use both gaits and exhibit a transition from tetrapod to tripod at intermediate speeds. Here we study the effect of stepping frequency on gait transition in an ion-channel bursting neuron model in which each cell represents a hemi-segmental thoracic circuit of the central pattern generator. Employing phase reduction, we collapse the network of bursting neurons represented by 24 ordinary differential equations to 6 coupled nonlinear phase oscillators, each corresponding to a sub-network of neurons controlling one leg. Assuming that the left and right legs maintain constant phase differences (contralateral symmetry), we reduce from 6 equations to 3, allowing analysis of a dynamical system with 2 phase differences defined on a torus. We show that bifurcations occur from multiple stable tetrapod gaits to a unique stable tripod gait as speed increases. Finally, we consider gait transitions in two sets of data fitted to freely walking fruit flies.34C16, 34C60, 37G10, 92B20, 92C2034C16, 34C60, 37G10, 92B20, 92C20 Copyright © 2017, The Authors. All rights reserved.

关键词： Bifurcation (mathematics)

来源：评论

学校读者我要写书评

暂无评论

End-to-end symmetry preserving inter-atomic potential energy model for finite and extended systems 32

End-to-end symmetry preserving inter-atomic potential energy...

引用

32nd Conference on Neural Information Processing Systems, NeurIPS 2018

作者： Zhang, Linfeng Han, Jiequn Wang, Han Saidi, Wissam A. Car, Roberto Weinan, E. Program in Applied and Computational Mathematics Princeton University United States Institute of Applied Physics and Computational Mathematics China CAEP Software Center for High Performance Numerical Simulation China Department of Mechanical Engineering and Materials Science University of Pittsburgh United States Department of Chemistry Department of Physics Princeton University United States Princeton Institute for the Science and Technology of Materials Princeton University United States Department of Mathematics Princeton University United States Beijing Institute of Big Data Research China

Machine learning models are changing the paradigm of molecular modeling, which is a fundamental tool for material science, chemistry, and computational biology. Of particular interest is the inter-atomic potential energy surface (PES). Here we develop Deep Potential - Smooth Edition (DeepPot-SE), an end-to-end machine learning-based PES model, which is able to efficiently represent the PES of a wide variety of systems with the accuracy of ab initio quantum mechanics models. By construction, DeepPot-SE is extensive and continuously differentiable, scales linearly with system size, and preserves all the natural symmetries of the system. Further, we show that DeepPot-SE describes finite and extended systems including organic molecules, metals, semiconductors, and insulators with high fidelity. © 2018 Curran Associates Inc..All rights reserved.

关键词： Potential energy

来源：评论

学校读者我要写书评

暂无评论

Nonlocal orbital-free kinetic energy density functional for semiconductors

引用

Physical Review B 2010年第4期81卷 045206-045206页

作者： Chen Huang Emily A. Carter Department of Mechanical and Aerospace Engineering and Program in Applied and Computational Mathematics Princeton University Princeton New Jersey 08544-5263 USA

We propose a nonlocal kinetic energy density functional (KEDF) for semiconductors based on the expected asymptotic behavior of its susceptibility function. The KEDF’s kernel depends on both the electron density and the reduced density gradient, with an internal parameter formally related to the material’s static dielectric constant. We determine the accuracy of the KEDF within orbital-free density functional theory (DFT) by applying it to a variety of common semiconductors. With only two adjustable parameters, the KEDF reproduces quite well the exact noninteracting KEDF (i.e., Kohn-Sham DFT) predictions of bulk moduli, equilibrium volumes, and equilibrium energies. The two parameters in our KEDF are sensitive primarily to changes in the local crystal structure (such as atomic coordination number) and exhibit good transferability between different tetrahedrally-bonded phases. This local crystal structure dependence is rationalized by considering Thomas-Fermi dielectric screening theory.

关键词： .Phases orbital-free KEDF bulk moduli

来源：评论

学校读者我要写书评

暂无评论

Prior variances and depth un-biased estimators in eeg focal source imaging 1

引用

Joint Conference of the European Medical and Biological engineering Conference, EMBEC 2017 and Nordic-Baltic Conference on Biomedical engineering and Medical Physics, NBC 2107

作者： Koulouri, Alexandra Rimpiläinen, V. Brookes, M. Kaipio, J.P. Institute for Computational and Applied Mathematics University of Münster Münster Germany Institute for Biomagnetism and Biosignalanalysis University of Münster Münster Germany Department of Electrical and Electronic Engineering Imperial College London London United Kingdom Department of Mathematics University of Auckland Auckland New Zealand

ISBN: (数字)9789811051227

ISBN: (纸本)9789811051210

In electroencephalography (EEG) source imaging, the inverse source estimates are depth biased in such a way that their maxima are often close to the sensors. This depth bias can be quantified by inspecting the statistics (mean and covariance) of these estimates. In this paper, we find weighting factors within a Bayesian framework for the used 1/2 sparsity prior that the resulting maximum a posterior (MAP) estimates do not favour any particular source location. Due to the lack of an analytical expression for the MAP estimate when this sparsity prior is used, we solve the weights indirectly. First, we calculate the Gaussian prior variances that lead to depth un-biased maximum a posterior (MAP) estimates. Subsequently, we approximate the corresponding weight factors in the sparsity prior based on the solved Gaussian prior variances. Finally, we reconstruct focal source configurations using the sparsity prior with the proposed weights and two other commonly used choices of weights that can be found in literature. © Springer Nature Singapore Pte Ltd. 2018.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

Ab initio evaluation of Coulomb and exchange parameters for DFT+U calculations

引用

Physical Review B 2007年第15期76卷 155123-155123页

作者： Nicholas J. Mosey Emily A. Carter []Department of Mechanical and Aerospace Engineering and Program in Applied and Computational Mathematics Princeton University Princeton New Jersey 08544-5263 USA

Conventional density functional theory (DFT) fails for materials with strongly correlated electrons, such as late transition metal oxides. Large errors in the intra-atomic Coulomb and exchange interactions are the source of this failure. The DFT+U method has provided a means, through empirical parameters, to correct these errors. Here, we present a systematic ab initio approach in evaluating the intra-atomic Coulomb and exchange terms, U and J, respectively, in order to make the DFT+U method a fully first-principles technique. The method is based on a relationship between these terms and the Coulomb and exchange integrals evaluated in the basis of unrestricted Hartree-Fock molecular orbitals that represent localized states of the extended system. We used this ab initio scheme to evaluate U and J for chromia (Cr2O3). The resulting values are somewhat higher than those determined earlier either empirically or in constrained DFT calculations but have the advantage of originating from an ab initio theory containing exact exchange. Subsequent DFT+U calculations on chromia using the ab initio derived U and J yield properties consistent with experiment, unlike conventional DFT. Overall, the technique developed and tested in this work holds promise in enabling accurate and fully predictive DFT+U calculations of strongly correlated electron materials.

关键词： .electrons Empirical evaluation of Coulomb DFT calculations chromia

来源：评论

学校读者我要写书评

暂无评论

Reed-Muller Codes Polarize

Reed-Muller Codes Polarize

引用

Annual IEEE Symposium on Foundations of Computer Science

作者： Emmanuel Abbe Min Ye Mathematics Institute and the School of Computer and Communication Sciences at EPFL Switzerland Program in Applied and Computational Mathematics in Princeton University USA Department of Electrical Engineering Princeton University USA

Reed-Muller (RM) codes were introduced in 1954 and have long been conjectured to achieve Shannon's capacity on symmetric channels. The activity on this conjecture has recently been revived with the emergence of polar codes. RM codes and polar codes are generated by the same matrix G_m= [1/1 0/1] ^⊗m but using different subset of rows. RM codes select simply rows having largest weights. Polar codes select instead rows having the largest conditional mutual information proceeding top to down in G_m; while this is a more elaborate and channel-dependent rule, the top-to-down ordering allows Arikan to show that the conditional mutual information polarizes, and this gives directly a capacity-achieving code on any symmetric channel. RM codes are yet to be proved to have such a property, despite the recent success for the erasure channel. In this paper, we connect RM codes to polarization theory. We show that proceeding in the RM code ordering, i.e., not top-to-down but from the lightest to the heaviest rows in G_m, the conditional mutual information again polarizes. We further demonstrate that it does so faster than for polar codes. This implies that G_m contains another code, different than the polar code and called here the twin-RM code, that is provably capacity-achieving on any symmetric channel. This gives in particular a necessary condition for RM codes to achieve capacity on symmetric channels. It further gives a sufficient condition if the rows with largest conditional mutual information correspond to the heaviest rows, i.e., if the twin-RM code is the RM code. We demonstrate here that the two codes are at least similar and give further evidence that they are indeed the same.

关键词： Polar codes Mutual information Channel capacity Decoding Entropy Boolean functions

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：