Sample records for large sparse nonsymmetric

  1. MGMRES: A generalization of GMRES for solving large sparse nonsymmetric linear systems

    Young, D.M.; Chen, J.Y. [Univ. of Texas, Austin, TX (United States)


    The authors are concerned with the solution of the linear system (1): Au = b, where A is a real square nonsingular matrix which is large, sparse and non-symmetric. They consider the use of Krylov subspace methods. They first choose an initial approximation u{sup (0)} to the solution {bar u} = A{sup {minus}1}B of (1). They also choose an auxiliary matrix Z which is nonsingular. For n = 1,2,{hor_ellipsis} they determine u{sup (n)} such that u{sup (n)} {minus} u{sup (0)}{epsilon}K{sub n}(r{sup (0)},A) where K{sub n}(r{sup (0)},A) is the (Krylov) subspace spanned by the Krylov vectors r{sup (0)}, Ar{sup (0)}, {hor_ellipsis}, A{sup n{minus}1}r{sup 0} and where r{sup (0)} = b{minus}Au{sup (0)}. If ZA is SPD they also require that (u{sup (n)}{minus}{bar u}, ZA(u{sup (n)}{minus}{bar u})) be minimized. If, on the other hand, ZA is not SPD, then they require that the Galerkin condition, (Zr{sup n}, v) = 0, be satisfied for all v{epsilon}K{sub n}(r{sup (0)}, A) where r{sup n} = b{minus}Au{sup (n)}. In this paper the authors consider a generalization of GMRES. This generalized method, which they refer to as `MGMRES`, is very similar to GMRES except that they let Z = A{sup T}Y where Y is a nonsingular matrix which is symmetric by not necessarily SPD.

  2. Predicting structure in nonsymmetric sparse matrix factorizations

    Gilbert, J.R. (Xerox Palo Alto Research Center, CA (United States)); Ng, E.G. (Oak Ridge National Lab., TN (United States))


    Many computations on sparse matrices have a phase that predicts the nonzero structure of the output, followed by a phase that actually performs the numerical computation. We study structure prediction for computations that involve nonsymmetric row and column permutations and nonsymmetric or non-square matrices. Our tools are bipartite graphs, matchings, and alternating paths. Our main new result concerns LU factorization with partial pivoting. We show that if a square matrix A has the strong Hall property (i.e., is fully indecomposable) then an upper bound due to George and Ng on the nonzero structure of L + U is as tight as possible. To show this, we prove a crucial result about alternating paths in strong Hall graphs. The alternating-paths theorem seems to be of independent interest: it can also be used to prove related results about structure prediction for QR factorization that are due to Coleman, Edenbrandt, Gilbert, Hare, Johnson, Olesky, Pothen, and van den Driessche.

  3. Partitioning Rectangular and Structurally Nonsymmetric Sparse Matrices for Parallel Processing

    B. Hendrickson; T.G. Kolda


    A common operation in scientific computing is the multiplication of a sparse, rectangular or structurally nonsymmetric matrix and a vector. In many applications the matrix- transpose-vector product is also required. This paper addresses the efficient parallelization of these operations. We show that the problem can be expressed in terms of partitioning bipartite graphs. We then introduce several algorithms for this partitioning problem and compare their performance on a set of test matrices.

  4. Toy Model for Large Non-Symmetric Random Matrices

    Snarska, Małgorzata


    Non-symmetric rectangular correlation matrices occur in many problems in economics. We test the method of extracting statistically meaningful correlations between input and output variables of large dimensionality and build a toy model for artificially included correlations in large random time series.The results are then applied to analysis of polish macroeconomic data and can be used as an alternative to classical cointegration approach.

  5. More on Generalizations and Modifications of Iterative Methods for Solving Large Sparse Indefinite Linear Systems

    Jen-Yuan Chen


    Full Text Available Continuing from the works of Li et al. (2014, Li (2007, and Kincaid et al. (2000, we present more generalizations and modifications of iterative methods for solving large sparse symmetric and nonsymmetric indefinite systems of linear equations. We discuss a variety of iterative methods such as GMRES, MGMRES, MINRES, LQ-MINRES, QR MINRES, MMINRES, MGRES, and others.


    Zhong-zhi Bai


    A parallel chaotic multisplitting method for solving the large sparse linear complementarity problem is presented, and its convergence properties are discussed in detail when the system matrix is either symmetric or nonsymmetric. Moreover, some applicable relaxed variants of this parallel chaotic multisplitting method together with their convergence properties are investigated. Numerical results show that highly parallel efficiency can be achieved by these new parallel chaotic multisplitting methods.

  7. Tensor methods for large, sparse unconstrained optimization

    Bouaricha, A.


    Tensor methods for unconstrained optimization were first introduced by Schnabel and Chow [SIAM J. Optimization, 1 (1991), pp. 293-315], who describe these methods for small to moderate size problems. This paper extends these methods to large, sparse unconstrained optimization problems. This requires an entirely new way of solving the tensor model that makes the methods suitable for solving large, sparse optimization problems efficiently. We present test results for sets of problems where the Hessian at the minimizer is nonsingular and where it is singular. These results show that tensor methods are significantly more efficient and more reliable than standard methods based on Newton`s method.

  8. Significant communities in large sparse networks

    Mirshahvalad, Atieh; Derlen, Mattias; Rosvall, Martin


    Researchers use community-detection algorithms to reveal large-scale organization in biological and social networks, but community detection is useful only if the communities are significant and not a result of noisy data. To assess the statistical significance of the network communities, or the robustness of the detected structure, one approach is to perturb the network structure by removing links and measure how much the communities change. However, perturbing sparse networks is challenging because they are inherently sensitive; they shatter easily if links are removed. Here we propose a simple method to perturb sparse networks and assess the significance of their communities. We generate resampled networks by adding extra links based on local information, then we aggregate the information from multiple resampled networks to find a coarse-grained description of significant clusters. In addition to testing our method on benchmark networks, we use our method on the sparse network of the European Court of Just...


    Bao Zhenhua; Ye Zhongxing


    Some strong laws of large numbers for the frequencies of occurrence of states and ordered couples of states for nonsymmetric Markov chain fields (NSMC) on Cayley trees are studied. In the proof, a new technique for the study of strong limit theorems of Markov chains is extended to the case of Markov chain fields. The asymptotic equipartition properties with almost everywhere (a.e.) convergence for NSMC on Cayley trees are obtained.

  10. Eigensolver for a Sparse, Large Hermitian Matrix

    Tisdale, E. Robert; Oyafuso, Fabiano; Klimeck, Gerhard; Brown, R. Chris


    A parallel-processing computer program finds a few eigenvalues in a sparse Hermitian matrix that contains as many as 100 million diagonal elements. This program finds the eigenvalues faster, using less memory, than do other, comparable eigensolver programs. This program implements a Lanczos algorithm in the American National Standards Institute/ International Organization for Standardization (ANSI/ISO) C computing language, using the Message Passing Interface (MPI) standard to complement an eigensolver in PARPACK. [PARPACK (Parallel Arnoldi Package) is an extension, to parallel-processing computer architectures, of ARPACK (Arnoldi Package), which is a collection of Fortran 77 subroutines that solve large-scale eigenvalue problems.] The eigensolver runs on Beowulf clusters of computers at the Jet Propulsion Laboratory (JPL).




    Preconditioning techniques based on incomplete LU-decomposition are described for large, sparse, non-symmetric matrix systems in which the largest part of the coefficient matrix is a symmetric M-matrix with a very regular sparsity pattern. Some methods are described in which a small part of the matr

  12. Sparse neural networks with large learning diversity

    Gripon, Vincent


    Coded recurrent neural networks with three levels of sparsity are introduced. The first level is related to the size of messages, much smaller than the number of available neurons. The second one is provided by a particular coding rule, acting as a local constraint in the neural activity. The third one is a characteristic of the low final connection density of the network after the learning phase. Though the proposed network is very simple since it is based on binary neurons and binary connections, it is able to learn a large number of messages and recall them, even in presence of strong erasures. The performance of the network is assessed as a classifier and as an associative memory.

  13. Tensor methods for large sparse systems of nonlinear equations

    Bouaricha, A. [Argonne National Lab., IL (United States). Mathematics and Computer Science Div.; Schnabel, R.B. [Colorado Univ., Boulder, CO (United States). Dept. of Computer Science


    This paper introduces censor methods for solving, large sparse systems of nonlinear equations. Tensor methods for nonlinear equations were developed in the context of solving small to medium- sized dense problems. They base each iteration on a quadratic model of the nonlinear equations. where the second-order term is selected so that the model requires no more derivative or function information per iteration than standard linear model-based methods, and hardly more storage or arithmetic operations per iteration. Computational experiments on small to medium-sized problems have shown censor methods to be considerably more efficient than standard Newton-based methods, with a particularly large advantage on singular problems. This paper considers the extension of this approach to solve large sparse problems. The key issue that must be considered is how to make efficient use of sparsity in forming and solving the censor model problem at each iteration. Accomplishing this turns out to require an entirely new way of solving the tensor model that successfully exploits the sparsity of the Jacobian, whether the Jacobian is nonsingular or singular. We develop such an approach and, based upon it, an efficient tensor method for solving large sparse systems of nonlinear equations. Test results indicate that this tensor method is significantly more efficient and robust than an efficient sparse Newton-based method. in terms of iterations, function evaluations. and execution time.

  14. Approximate inverse preconditioning of iterative methods for nonsymmetric linear systems

    Benzi, M. [Universita di Bologna (Italy); Tuma, M. [Inst. of Computer Sciences, Prague (Czech Republic)


    A method for computing an incomplete factorization of the inverse of a nonsymmetric matrix A is presented. The resulting factorized sparse approximate inverse is used as a preconditioner in the iterative solution of Ax = b by Krylov subspace methods.

  15. On Some Extended Block Krylov Based Methods for Large Scale Nonsymmetric Stein Matrix Equations

    Abdeslem Hafid Bentbib


    Full Text Available In the present paper, we consider the large scale Stein matrix equation with a low-rank constant term A X B − X + E F T = 0 . These matrix equations appear in many applications in discrete-time control problems, filtering and image restoration and others. The proposed methods are based on projection onto the extended block Krylov subspace with a Galerkin approach (GA or with the minimization of the norm of the residual. We give some results on the residual and error norms and report some numerical experiments.

  16. On Skew-symmetric Preconditioning for Strongly Non-symmetric Linear Systems

    Krukier, L.A.; Botchev, M.A.


    To solve iteratively linear system $Au=b$ with large sparse strongly non-symmetric matrix $A$ we propose preconditioning $\\hat A \\hat u = \\hat b$, $\\hat A=(I+\\tau L_1)^{-1} A (I+\\tau U_1)^{-1},\\; \\tau>0$ where respectively lower and upper triangular matrices $L_1$ and $U_1$ are so that $L_1+U_1=1/2(

  17. Iterative solution of large sparse systems of equations

    Hackbusch, Wolfgang


    In the second edition of this classic monograph, complete with four new chapters and updated references, readers will now have access to content describing and analysing classical and modern methods with emphasis on the algebraic structure of linear iteration, which is usually ignored in other literature. The necessary amount of work increases dramatically with the size of systems, so one has to search for algorithms that most efficiently and accurately solve systems of, e.g., several million equations. The choice of algorithms depends on the special properties the matrices in practice have. An important class of large systems arises from the discretization of partial differential equations. In this case, the matrices are sparse (i.e., they contain mostly zeroes) and well-suited to iterative algorithms. The first edition of this book grew out of a series of lectures given by the author at the Christian-Albrecht University of Kiel to students of mathematics. The second edition includes quite novel approaches.

  18. Sparse Machine Learning Methods for Understanding Large Text Corpora

    National Aeronautics and Space Administration — Sparse machine learning has recently emerged as powerful tool to obtain models of high-dimensional data with high degree of interpretability, at low computational...


    Qin Ni


    An NGTN method was proposed for solving large-scale sparse nonlinear programming (NLP) problems. This is a hybrid method of a truncated Newton direction and a modified negative gradient direction, which is suitable for handling sparse data structure and possesses Q-quadratic convergence rate. The global convergence of this new method is proved,the convergence rate is further analysed, and the detailed implementation is discussed in this paper. Some numerical tests for solving truss optimization and large sparse problems are reported. The theoretical and numerical results show that the new method is efficient for solving large-scale sparse NLP problems.

  20. Nonsymmetric systems arising in the computation of invariant tori

    Trummer, M.R. [Simons Fraser Univ., Burnaby, British Columbia (Canada)


    We introduce two new spectral implementations for computing invariant tori. The underlying nonlinear partial differential equation although hyperbolic by nature, has periodic boundary conditions in both space and time. In our first approach we discretize the spatial variable, and find the solution via a shooting method. In our second approach, a full two-dimensional Fourier spectral discretization and Newton`s method lead to very large, sparse, nonsymmetric systems. These matrices are highly structured, but the sparsity pattern prohibits the use of direct solvers. A modified conjugate gradient type iterative solver appears to perform best for this type of problems. The two methods are applied to the van der Pol oscillator, and compared to previous algorithms. Several preconditioners are investigated.

  1. Listing All Maximal Cliques in Large Sparse Real-World Graphs

    Eppstein, David


    We implement a new algorithm for listing all maximal cliques in sparse graphs due to Eppstein, L\\"offler, and Strash (ISAAC 2010) and analyze its performance on a large corpus of real-world graphs. Our analysis shows that this algorithm is the first to offer a practical solution to listing all maximal cliques in large sparse graphs. All other theoretically-fast algorithms for sparse graphs have been shown to be significantly slower than the algorithm of Tomita et al. (Theoretical Computer Science, 2006) in practice. However, the algorithm of Tomita et al. uses an adjacency matrix, which requires too much space for large sparse graphs. Our new algorithm opens the door for fast analysis of large sparse graphs whose adjacency matrix will not fit into working memory.

  2. A nested decomposition algorithm for parallel computations of very large sparse systems

    D. D. Šiljak


    Full Text Available In this paper we present a generalization of the balanced border block diagonal (BBD decomposition algorithm, which was developed for the parallel computation of sparse systems of linear equations. The efficiency of the new procedure is substantially higher, and it extends the applicability of the BBD decomposition to extremely large problems. Examples of the decomposition are provided for matrices as large as 250,000×250,000, and its performance is compared to other sparse decompositions. Applications to the parallel solution of sparse systems are discussed for a variety of engineering problems.


    Zhong-zhi Bai; Yu-guang Huang


    Asynchronous parallel multisplitting relaxation methods for solving large sparse linear complementarity problems are presented, and their convergence is proved when the system matrices are H-matrices having positive diagonal elements. Moreover, block and multi-parameter variants of the new methods, together with their convergence properties,are investigated in detail. Numerical results show that these new methods can achieve high parallel efficiency for solving the large sparse linear complementarity problems on multiprocessor systems.

  4. Nonsymmetric entropy I: basic concepts and results

    Liu, Chengshi


    A new concept named nonsymmetric entropy which generalizes the concepts of Boltzman's entropy and shannon's entropy, was introduced. Maximal nonsymmetric entropy principle was proven. Some important distribution laws were derived naturally from maximal nonsymmetric entropy principle.

  5. Interpolation of sparse multivariate polynomials over large finite fields with applications

    Huang, Ming-Deh A.; Rao, A.J. [Univ. of Southern California, Los Angeles, CA (United States)


    We develop a randomized parallel algorithm which performs interpolation of sparse multivariate polynomials over finite fields. Our algorithm can be viewed as the first successful adaptation of the sparse interpolation algorithm for the complex field developed by Ben-Or and Tiwari to the case of finite fields. It improves a previous result of Grigoriev et al. and is by far the most time and space efficient algorithm for the problem when the finite field is large. As applications, we obtain efficient parallel algorithms for sparse multivariate polynomial factorization and GCD over finite fields. The efficiency of these algorithms improves that of the previous known algorithms for the problems.

  6. Sparse kernel orthonormalized PLS for feature extraction in large datasets

    Arenas-García, Jerónimo; Petersen, Kaare Brandt; Hansen, Lars Kai


    In this paper we are presenting a novel multivariate analysis method for large scale problems. Our scheme is based on a novel kernel orthonormalized partial least squares (PLS) variant for feature extraction, imposing sparsity constrains in the solution to improve scalability. The algorithm is te...

  7. A Dynamic Multiscale Magnifying Tool for Exploring Large Sparse Graphs

    Wong, Pak C.; Foote, Harlan P.; Mackey, Patrick S.; Chin, George; Sofia, Heidi J.; Thomas, James J.


    We present an information visualization tool, known as GreenMax, to visually explore large small-world graphs with up to a million graph nodes on a desktop computer. A major motivation for scanning a small-world graph in such a brute-force fashion is the demanding goal of identifying not just the well-known features but also the unknown-known and unknown-unknown features of the graph. GreenMax uses a highly effective multilevel graph drawing approach to pre-process a large graph by generating a hierarchy of increasingly coarse layouts that later support the dynamic zooming of the graph. This paper describes the graph visualization challenges, elaborates our solution, and evaluates the contributions of GreenMax in the larger context of visual analytics on large small-world graphs. We report the results of two case studies using GreenMax and the results support our claim that we can use GreenMax to locate unexpected features or structures behind a graph.

  8. An iteration for indefinite and non-symmetric systems and its application to the Navier-Stokes equations

    Wathen, A. [Oxford Univ. (United Kingdom); Golub, G. [Stanford Univ., CA (United States)


    A simple fixed point linearisation of the Navier-Stokes equations leads to the Oseen problem which after appropriate discretisation yields large sparse linear systems with coefficient matrices of the form (A B{sup T} B -C). Here A is non-symmetric but its symmetric part is positive definite, and C is symmetric and positive semi-definite. Such systems arise in other situations. In this talk we will describe and present some analysis for an iteration based on an indefinite and symmetric preconditioner of the form (D B{sup T} B -C).

  9. Applying Analytical Derivative and Sparse Matrix Techniques to Large-Scale Process Optimization Problems


    The performance of analytical derivative and sparse matrix techniques applied to a traditional densesequential quadratic programming(SQP) is studied, and the strategy utilizing those techniques is also presented. Computational results on two typicalchemical optimization problems demonstrate significant enhancement in efficiency, which shows this strategy ispromising and suitable for large-scale process optimization problems.

  10. Sparse deconvolution for the large-scale ill-posed inverse problem of impact force reconstruction

    Qiao, Baijie; Zhang, Xingwu; Gao, Jiawei; Liu, Ruonan; Chen, Xuefeng


    Most previous regularization methods for solving the inverse problem of force reconstruction are to minimize the l2-norm of the desired force. However, these traditional regularization methods such as Tikhonov regularization and truncated singular value decomposition, commonly fail to solve the large-scale ill-posed inverse problem in moderate computational cost. In this paper, taking into account the sparse characteristic of impact force, the idea of sparse deconvolution is first introduced to the field of impact force reconstruction and a general sparse deconvolution model of impact force is constructed. Second, a novel impact force reconstruction method based on the primal-dual interior point method (PDIPM) is proposed to solve such a large-scale sparse deconvolution model, where minimizing the l2-norm is replaced by minimizing the l1-norm. Meanwhile, the preconditioned conjugate gradient algorithm is used to compute the search direction of PDIPM with high computational efficiency. Finally, two experiments including the small-scale or medium-scale single impact force reconstruction and the relatively large-scale consecutive impact force reconstruction are conducted on a composite wind turbine blade and a shell structure to illustrate the advantage of PDIPM. Compared with Tikhonov regularization, PDIPM is more efficient, accurate and robust whether in the single impact force reconstruction or in the consecutive impact force reconstruction.

  11. SparseLeap: Efficient Empty Space Skipping for Large-Scale Volume Rendering

    Hadwiger, Markus


    Recent advances in data acquisition produce volume data of very high resolution and large size, such as terabyte-sized microscopy volumes. These data often contain many fine and intricate structures, which pose huge challenges for volume rendering, and make it particularly important to efficiently skip empty space. This paper addresses two major challenges: (1) The complexity of large volumes containing fine structures often leads to highly fragmented space subdivisions that make empty regions hard to skip efficiently. (2) The classification of space into empty and non-empty regions changes frequently, because the user or the evaluation of an interactive query activate a different set of objects, which makes it unfeasible to pre-compute a well-adapted space subdivision. We describe the novel SparseLeap method for efficient empty space skipping in very large volumes, even around fine structures. The main performance characteristic of SparseLeap is that it moves the major cost of empty space skipping out of the ray-casting stage. We achieve this via a hybrid strategy that balances the computational load between determining empty ray segments in a rasterization (object-order) stage, and sampling non-empty volume data in the ray-casting (image-order) stage. Before ray-casting, we exploit the fast hardware rasterization of GPUs to create a ray segment list for each pixel, which identifies non-empty regions along the ray. The ray-casting stage then leaps over empty space without hierarchy traversal. Ray segment lists are created by rasterizing a set of fine-grained, view-independent bounding boxes. Frame coherence is exploited by re-using the same bounding boxes unless the set of active objects changes. We show that SparseLeap scales better to large, sparse data than standard octree empty space skipping.

  12. The Roles of Sparse Direct Methods in Large-scale Simulations

    Li, Xiaoye S.; Gao, Weiguo; Husbands, Parry J.R.; Yang, Chao; Ng, Esmond G.


    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.

  13. A Combined Preconditioning Strategy for Nonsymmetric Systems

    de Dios, B. Ayuso [Univ. of Bologna (Italy). Dept. of Mathematics; King Abdullah Univ. of Science and Technology, Thuwal (Saudi Arabia); Barker, A. T. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Vassilevski, P. S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)


    Here, we present and analyze a class of nonsymmetric preconditioners within a normal (weighted least-squares) matrix form for use in GMRES to solve nonsymmetric matrix problems that typically arise in finite element discretizations. An example of the additive Schwarz method applied to nonsymmetric but definite matrices is presented for which the abstract assumptions are verified. Variable preconditioner, which combines the original nonsymmetric one and a weighted least-squares version of it, and it is shown to be convergent and provides a viable strategy for using nonsymmetric preconditioners in practice. Numerical results are included to assess the theory and the performance of the proposed preconditioners.

  14. A Combined Preconditioning Strategy for Nonsymmetric Systems

    de Dios, B. Ayuso


    We present and analyze a class of nonsymmetric preconditioners within a normal (weighted least-squares) matrix form for use in GMRES to solve nonsymmetric matrix problems that typically arise in finite element discretizations. An example of the additive Schwarz method applied to nonsymmetric but definite matrices is presented for which the abstract assumptions are verified. A variable preconditioner, combining the original nonsymmetric one and a weighted least-squares version of it, is shown to be convergent and provides a viable strategy for using nonsymmetric preconditioners in practice. Numerical results are included to assess the theory and the performance of the proposed preconditioners.

  15. Parallelizable restarted iterative methods for nonsymmetric linear systems. Part 1: Theory

    Joubert, W.D.; Carey, G.F.


    Large sparse nonsymmetric problems of the form Au = b are frequently solved using restarted conjugate gradient-type algorithms such as the popular GCR and GMRES algorithms. In this study the authors define a new class of algorithms which generate the same iterates as the standard GMRES algorithm but require as little as half of the computational expense. This performance improvement is obtained by using short economical three-term recurrences to replace the long recurrence used by GMRES. The new algorithms are shown to have good numerical properties in typical cases, and the new algorithms may be easily modified to be as numerically safe as standard GMRES. Numerical experiments with these algorithms are given in Part 2, in which they demonstrate the improved performance of the new schemes on different computer architectures.

  16. Solving sparse linear least squares problems on some supercomputers by using large dense blocks

    Hansen, Per Christian; Ostromsky, T; Sameh, A;


    technique is preferable to sparse matrix technique when the matrices are not large, because the high computational speed compensates fully the disadvantages of using more arithmetic operations and more storage. For very large matrices the computations must be organized as a sequence of tasks in each...... the matrix so that dense blocks can be constructed and treated with some standard software, say LAPACK or NAG. These ideas are implemented for linear least-squares problems. The rectangular matrices (that appear in such problems) are decomposed by an orthogonal method. Results obtained on a CRAY C92A...

  17. Sparse Variational Analysis of Linear Mixed Models for Large Data Sets.

    Armagan, Artin; Dunson, David


    It is increasingly common to be faced with longitudinal or multi-level data sets that have large numbers of predictors and/or a large sample size. Current methods of fitting and inference for mixed effects models tend to perform poorly in such settings. When there are many variables, it is appealing to allow uncertainty in subset selection and to obtain a sparse characterization of the data. Bayesian methods are available to address these goals using Markov chain Monte Carlo (MCMC), but MCMC is very computationally expensive and can be infeasible in large p and/or large n problems. As a fast approximate Bayes solution, we recommend a novel approximation to the posterior relying on variational methods. Variational methods are used to approximate the posterior of the parameters in a decomposition of the variance components, with priors chosen to obtain a sparse solution that allows selection of random effects. The method is evaluated through a simulation study, and applied to an epidemiological application.

  18. The Substitution Secant/Finite Difference Method for Large Scale Sparse Unconstrained Optimization

    Hong-wei Zhang; Jun-xiang Li


    This paper studies a substitution secant/finite difference (SSFD) method for solving large scale sparse unconstrained optimization problems. This method is a combination of a secant method and a finite difference method, which depends on a consistent partition of the columns of the lower triangular part of the Hessian matrix. A q-superlinear convergence result and an r-convergence rate estimate show that this method has good local convergence properties. The numerical results show that this method may be competitive with some currently used algorithms.

  19. {\\it Ab initio} nuclear structure - the large sparse matrix eigenvalue problem

    Vary, James P; Ng, Esmond; Yang, Chao; Sosonkina, Masha


    The structure and reactions of light nuclei represent fundamental and formidable challenges for microscopic theory based on realistic strong interaction potentials. Several {\\it ab initio} methods have now emerged that provide nearly exact solutions for some nuclear properties. The {\\it ab initio} no core shell model (NCSM) and the no core full configuration (NCFC) method, frame this quantum many-particle problem as a large sparse matrix eigenvalue problem where one evaluates the Hamiltonian matrix in a basis space consisting of many-fermion Slater determinants and then solves for a set of the lowest eigenvalues and their associated eigenvectors. The resulting eigenvectors are employed to evaluate a set of experimental quantities to test the underlying potential. For fundamental problems of interest, the matrix dimension often exceeds $10^{10}$ and the number of nonzero matrix elements may saturate available storage on present-day leadership class facilities. We survey recent results and advances in solving t...

  20. A parallel and vectorial implementation of basic linear algebra subroutines in iterative solving of large sparse linear systems of equations

    Magnin, H.; Coulomb, J.L. (Laboratoire d' electrotechnique de Grenoble (UA CNRS 355) E.N.S.I.E.G. BP 46 38402 St. Martin d' Heres (FR))


    Electromagnetic field analysis by finite elements methods needs solving of large sparse systems of linear equations. Though no discernible structure for the distribution of non-zero elements can be found (e.g. multidiagonal structures,...), subsets of independent equations can be determined. Equations that are in a same subset are then solved in parallel. A good choice for the storage scheme of sparse matrices is also very important to speedup the resolution by vectorization. The modifications the authors made to data structures are presented, and the possibility to use some other schemes is discussed.

  1. Nonsymmetric gravity does have acceptable global asymptotics

    Cornish, N J


    "Reports of my death are greatly exaggerated" - Mark Twain. We consider the claim by Damour, Deser and McCarthy that nonsymmetric gravity theory has unacceptable global asymptotics. We explain why this claim is incorrect.

  2. Iterative solution of large, sparse linear systems on a static data flow architecture - Performance studies

    Reed, D. A.; Patrick, M. L.


    The applicability of static data flow architectures to the iterative solution of sparse linear systems of equations is investigated. An analytic performance model of a static data flow computation is developed. This model includes both spatial parallelism, concurrent execution in multiple PE's, and pipelining, the streaming of data from array memories through the PE's. The performance model is used to analyze a row partitioned iterative algorithm for solving sparse linear systems of algebraic equations. Based on this analysis, design parameters for the static data flow architecture as a function of matrix sparsity and dimension are proposed.

  3. Lanczos-type variants of the COCR method for complex nonsymmetric linear systems

    Jing, Yan-Fei; Huang, Ting-Zhu; Zhang, Yong; Li, Liang; Cheng, Guang-Hui; Ren, Zhi-Gang; Duan, Yong; Sogabe, Tomohiro; Carpentieri, Bruno


    Motivated by the celebrated extending applications of the well-established complex Biconjugate Gradient (CBiCG) method to deal with large three-dimensional electromagnetic scattering problems by Pocock and Walker [M.D. Pocock, S.P. Walker, The complex Bi-conjugate Gradient solver applied to large electromagnetic scattering problems, computational costs, and cost scalings, IEEE Trans. Antennas Propagat. 45 (1997) 140-146], three Lanczos-type variants of the recent Conjugate A-Orthogonal Conjugate Residual (COCR) method of Sogabe and Zhang [T. Sogabe, S.-L. Zhang, A COCR method for solving complex symmetric linear systems, J. Comput. Appl. Math. 199 (2007) 297-303] are explored for the solution of complex nonsymmetric linear systems. The first two can be respectively considered as mathematically equivalent but numerically improved popularizing versions of the BiCR and CRS methods for complex systems presented in Sogabe's Ph.D. Dissertation. And the last one is somewhat new and is a stabilized and more smoothly converging variant of the first two in some circumstances. The presented algorithms are with the hope of obtaining smoother and, hopefully, faster convergence behavior in comparison with the CBiCG method as well as its two corresponding variants. This motivation is demonstrated by numerical experiments performed on some selective matrices borrowed from The University of Florida Sparse Matrix Collection by Davis.

  4. ReProCS: A Missing Link between Recursive Robust PCA and Recursive Sparse Recovery in Large but Correlated Noise

    Qiu, Chenlu


    This work studies the recursive robust principal components' analysis (PCA) problem. Here, "robust" refers to robustness to both independent and correlated sparse outliers, although we focus on the latter. A key application where this problem occurs is in video surveillance where the goal is to separate a slowly changing background from moving foreground objects on-the-fly. The background sequence is well modeled as lying in a low dimensional subspace, that can gradually change over time, while the moving foreground objects constitute the correlated sparse outliers. In this and many other applications, the foreground is an outlier for PCA but is actually the "signal of interest" for the application; where as the background is the corruption or noise. Thus our problem can also be interpreted as one of recursively recovering a time sequence of sparse signals in the presence of large but spatially correlated noise. This work has two key contributions. First, we provide a new way of looking at this problem and sh...


    Bao-jiang Zhong


    It has been observed that the residual polynomials resulted from successive restarting cycles of GMRES(m) may differ from one another meaningfully. In this paper, it is further shown that the polynomials can complement one another harmoniously in reducing the iterative residual. This characterization of GMRES(m) is exploited to formulate an efficient hybrid iterative scheme, which can be widely applied to existing hybrid algorithms for solving large nonsymmetric systems of linear equations. In particular, a variant of the hybrid GMRES algorithm of Nachtigal, Reichel and Trefethen (1992) is presented. It is described how the new algorithm may offer significant performance improvements over the original one.

  6. Electromagnetism in a nonsymmetric theory of gravitation

    Ragusa, S.; Bosquetti, D. [Sao Paulo Univ., Sao Carlos, SP (Brazil). Inst. de Fisica. Dept. de Fisica e Informatica]. E-mail:


    The field equations of a proposed nonsymmetric theory of gravitation are derived when electromagnetic fields are present, by adopting a nonminimal coupling which ensures the validity of the equivalence principle. The static and spherically symmetric solution of the field of a charged point particle is obtained. (author)

  7. SparseM: A Sparse Matrix Package for R *

    Roger Koenker


    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.

  8. Sparse distributed representation of odors in a large-scale olfactory bulb circuit.

    Yuguo Yu

    Full Text Available In the olfactory bulb, lateral inhibition mediated by granule cells has been suggested to modulate the timing of mitral cell firing, thereby shaping the representation of input odorants. Current experimental techniques, however, do not enable a clear study of how the mitral-granule cell network sculpts odor inputs to represent odor information spatially and temporally. To address this critical step in the neural basis of odor recognition, we built a biophysical network model of mitral and granule cells, corresponding to 1/100th of the real system in the rat, and used direct experimental imaging data of glomeruli activated by various odors. The model allows the systematic investigation and generation of testable hypotheses of the functional mechanisms underlying odor representation in the olfactory bulb circuit. Specifically, we demonstrate that lateral inhibition emerges within the olfactory bulb network through recurrent dendrodendritic synapses when constrained by a range of balanced excitatory and inhibitory conductances. We find that the spatio-temporal dynamics of lateral inhibition plays a critical role in building the glomerular-related cell clusters observed in experiments, through the modulation of synaptic weights during odor training. Lateral inhibition also mediates the development of sparse and synchronized spiking patterns of mitral cells related to odor inputs within the network, with the frequency of these synchronized spiking patterns also modulated by the sniff cycle.


    Chong-hua Yu; O. Axelsson


    In this paper, an algorithm for computing some of the largest (smallest) generalized eigenvalues with corresponding eigenvectors of a sparse symmetric positive definite matrix pencil is presented. The algorithm uses an iteration function and inverse power iteration process to get the largest one first, then executes m-1Lanczos-like steps to get initial approximations of the next m - 1 ones, without computing any Ritz pair, for which a procedure combining Rayleigh quotient iteration with shifted inverse power iteration is used to obtain more accurate eigenvalues and eigenvectors. This algorithm keeps the advantages of preserving sparsity of the original matrices as in Lanczos method and RQI and converges with a higher rate than the method described in[12] and provides a simple technique to compute initial approximate pairs which are guaranteed to converge to the wanted m largest eigenpairs using RQI. In addition, it avoids some of the disadvantages of Lanczos and RQI, for solving extreme eigenproblems. When symmetric positive definfite linear systems must be solved in the process, an algebraic multilevel iteration method (AMLI) is applied. The algorithm is fully parallelizable.

  10. ILUBCG2-11: Solution of 11-banded nonsymmetric linear equation systems by a preconditioned biconjugate gradient routine

    Chen, Y.-M.; Koniges, A. E.; Anderson, D. V.


    The biconjugate gradient method (BCG) provides an attractive alternative to the usual conjugate gradient algorithms for the solution of sparse systems of linear equations with nonsymmetric and indefinite matrix operators. A preconditioned algorithm is given, whose form resembles the incomplete L-U conjugate gradient scheme (ILUCG2) previously presented. Although the BCG scheme requires the storage of two additional vectors, it converges in a significantly lesser number of iterations (often half), while the number of calculations per iteration remains essentially the same.

  11. Alternating Anderson-Richardson method: An efficient alternative to preconditioned Krylov methods for large, sparse linear systems

    Suryanarayana, Phanish; Pask, John E


    We generalize the recently proposed Alternating Anderson-Jacobi (AAJ) method (Pratapa et al., J. Comput. Phys. (2016), 306, 43--54) to include preconditioning, and demonstrate its efficiency and scaling in the solution of large, sparse linear systems on parallel computers. The resulting preconditioned Alternating Anderson-Richardson (AAR) method reduces to the AAJ method for a particular choice of preconditioner. The AAR method employs Anderson extrapolation at periodic intervals within a preconditioned Richardson iteration to accelerate convergence. In this work, we develop a version of the method that is particularly well suited for scalable high-performance computing. In applications to Helmholtz and Poisson equations, we show that the strong and weak parallel scaling of AAR is superior to both Generalized Minimal Residual (GMRES) and Conjugate Gradient (CG) methods, using the same preconditioning, in large-scale parallel calculations employing up to 110,592 computational cores. Moreover, we find that the ...

  12. Fast solution of nonsymmetric linear systems on Grid computers using parallel variants of IDR(s)

    Collignon, T.P.; Van Gijzen, M.B.

    IDR(s) is a family of fast algorithms for iteratively solving large nonsymmetric linear systems [14]. With cluster computing and in particular with Grid computing, the inner product is a bottleneck operation. In this paper, three techniques are combined in order to alleviate this bottleneck. Firstly

  13. Fast solution of nonsymmetric linear systems on Grid computers using parallel variants of IDR(s)

    Collignon, T.P.; Van Gijzen, M.B.

    IDR(s) is a family of fast algorithms for iteratively solving large nonsymmetric linear systems [14]. With cluster computing and in particular with Grid computing, the inner product is a bottleneck operation. In this paper, three techniques are combined in order to alleviate this bottleneck. Firstly

  14. On some developments in the Nonsymmetric Kaluza-Klein Theory

    Kalinowski, M W


    We consider a condition for a charge confinement and gravito-electromagnetic wave solutions in the Nonsymmetric Kaluza-Klein Theory.We consider also an influence of a cosmological constant on a static,spherically symmetric solution.We remind to the reader some fudamentals of the Nonsymmetric Kaluza-Klein Theory and a geometrcal background behind the theory.Simultaneously we give some remarks concerning misunderstanding connected to several notions of the Nonsymmetric Kaluza-Klein Theory,Einstein Unified Field Theory,geometrization and unification of physical interactions .We reconsider Dirac field in the Nonsymmetric Kaluza-Klein Theory.

  15. GPU-Accelerated Sparse Matrix Solvers for Large-Scale Simulations Project

    National Aeronautics and Space Administration — Many large-scale numerical simulations can be broken down into common mathematical routines. While the applications may differ, the need to perform functions such as...

  16. A Performance Evaluation of QR-eigensolver on IBM Roadrunner cluster for Large Sparse Matrices

    Ionela RUSU


    Full Text Available The paper presents a performance analysis of theQR eigensolver from ScaLAPACK library on the IBMRoadrunner machine. A ScaLAPACK-based testing platformwas developed in order to evaluate the performance of a parallelsolver to compute the eigenvalues and eigenvectors for largescalesparse matrices. Our experiments showed encouragingresults on the IBM Roadrunner cluster, the acceleration factorgained was up to 40 for large matrices. This result is bright tosolve problems that involve scientific and large-scale computing.

  17. Non-parametric co-clustering of large scale sparse bipartite networks on the GPU

    Hansen, Toke Jansen; Mørup, Morten; Hansen, Lars Kai


    Co-clustering is a problem of both theoretical and practical importance, e.g., market basket analysis and collaborative filtering, and in web scale text processing. We state the co-clustering problem in terms of non-parametric generative models which can address the issue of estimating the number...... of row and column clusters from a hypothesis space of an infinite number of clusters. To reach large scale applications of co-clustering we exploit that parameter inference for co-clustering is well suited for parallel computing. We develop a generic GPU framework for efficient inference on large scale......-life large scale collaborative filtering data and web scale text corpora, demonstrating that latent mesoscale structures extracted by the co-clustering problem as formulated by the Infinite Relational Model (IRM) are consistent across consecutive runs with different initializations and also relevant...

  18. Nonsymmetric Interactions Trigger Collective Swings in Globally Ordered Systems

    Cavagna, Andrea; Giardina, Irene; Jelic, Asja; Melillo, Stefania; Parisi, Leonardo; Silvestri, Edmondo; Viale, Massimiliano


    Many systems in nature, from ferromagnets to flocks of birds, exhibit ordering phenomena on the large scale. In condensed matter systems, order is statistically robust for large enough dimensions, with relative fluctuations due to noise vanishing with system size. Several biological systems, however, are less stable and spontaneously change their global state on relatively short time scales. Here we show that there are two crucial ingredients in these systems that enhance the effect of noise, leading to collective changes of state on finite time scales and off-equilibrium behavior: the nonsymmetric nature of interactions between individuals, and the presence of local heterogeneities in the topology of the network. Our results might explain what is observed in several living systems and are consistent with recent experimental data on bird flocks and other animal groups.

  19. Large scale tracking of stem cells using sparse coding and coupled graphs

    Vestergaard, Jacob Schack; Dahl, Anders Lindbjerg; Holm, Peter

    Stem cell tracking is an inherently large scale problem. The challenge is to identify and track hundreds or thousands of cells over a time period of several weeks. This requires robust methods that can leverage the knowledge of specialists on the field. The tracking pipeline presented here consists...

  20. Universality of Sparse d>2 Conformal Field Theory at Large N

    Belin, Alexandre; Kruthoff, Jorrit; Michel, Ben; Shaghoulian, Edgar; Shyani, Milind


    We derive necessary and sufficient conditions for large-$N$ conformal field theories to have a universal free energy and an extended range of validity of the higher-dimensional Cardy formula. These constraints are much tighter than in two dimensions and must be satisfied by any conformal field theory dual to Einstein gravity. We construct and analyze symmetric product orbifold theories on $\\mathbb{T}^d$ and show that they only realize the necessary phase structure and extended range of validity if the seed theory is assumed to have a universal vacuum energy.

  1. Universality of sparse d > 2 conformal field theory at large N

    Belin, Alexandre; de Boer, Jan; Kruthoff, Jorrit; Michel, Ben; Shaghoulian, Edgar; Shyani, Milind


    We derive necessary and sufficient conditions for large N conformal field theories to have a universal free energy and an extended range of validity of the higher-dimensional Cardy formula. These constraints are much tighter than in two dimensions and must be satisfied by any conformal field theory dual to Einstein gravity. We construct and analyze symmetric product orbifold theories on T^d and show that they only realize the necessary phase structure and extended range of validity if the seed theory is assumed to have a universal vacuum energy.

  2. Integrated simulator for MEMS using FEM implementation in AHDL and frontal solver for large sparse systems of equations

    Mrcarica, Zeljko; Risojevic, Vladimir; Lenczner, Michel; Jakovljevic, Mirko; Litovski, Vanco


    MEMS that exhibit strong coupling between electronics and mechanics need to be described and simulated in a united simulation environment, in order to achieve more flexibility from the description point of view, and to avoid convergence problems. Behavioral simulators and analogue hardware description languages enable modeling of MEMS. Even space- continuous mechanical problems can be described in the hardware description language. That description should and can be automated. Space-discretization commonly leads to very large system of equations. For solving such systems, mechanical FEM simulators usually exploit iterative algorithms that have very low memory demands. However, if the problem at hand contains electronics, as in the case of intelligent materials, iterative methods might be not applicable, since the convergence is not guaranteed anymore. In our behavioral simulator we have implemented a frontal solver, enabling solution of very large sparse matrices with modest main memory resources by storing only part of the matrix at the time. Thermal problems with more than 20000 nodes have been simulated.

  3. Analysis of non-symmetrical flapping airfoils

    W.B.Tay; K.B.Lim


    Simulations have been done to assess the lift, thrust and propulsive efficiency of different types of nonsymmetrical airfoils under different flapping configurations. The variables involved are reduced frequency, Strouhal number, pitch amplitude and phase angle. In order to analyze the variables more efficiently, the design of experiments using the response surface methodology is applied. Results show that both the variables and shape of the airfoil have a profound effect on the lift, thrust, and efficiency. By using nonsymmetrical airfoils, average lift coefficient as high as 2.23 can be obtained. The average thrust coefficient and efficiency also reach high values of 2.53 and 0.6 I, respectively. The lift production is highly dependent on the airfoil's shape while thrust production is influenced more heavily by the variables. Efficiency falls somewhere in between. Two-factor interactions are found to exist among the variables. This shows that it is not sufficient to analyze each variable individually. Vorticity diagrams are analyzed to explain the results obtained. Overall, the S1020 airfoil is able to provide relatively good efficiency and at the same time generate high thrust and lift force. These results aid in the design of a better omithopter's wing.

  4. Analysis of non-symmetrical flapping airfoils

    Tay, W. B.; Lim, K. B.


    Simulations have been done to assess the lift, thrust and propulsive efficiency of different types of non-symmetrical airfoils under different flapping configurations. The variables involved are reduced frequency, Strouhal number, pitch amplitude and phase angle. In order to analyze the variables more efficiently, the design of experiments using the response surface methodology is applied. Results show that both the variables and shape of the airfoil have a profound effect on the lift, thrust, and efficiency. By using non-symmetrical airfoils, average lift coefficient as high as 2.23 can be obtained. The average thrust coefficient and efficiency also reach high values of 2.53 and 0.61, respectively. The lift production is highly dependent on the airfoil’s shape while thrust production is influenced more heavily by the variables. Efficiency falls somewhere in between. Two-factor interactions are found to exist among the variables. This shows that it is not sufficient to analyze each variable individually. Vorticity diagrams are analyzed to explain the results obtained. Overall, the S1020 airfoil is able to provide relatively good efficiency and at the same time generate high thrust and lift force. These results aid in the design of a better ornithopter’s wing.

  5. A SLAP (Sparse Linear Algebra Package) for the masses

    Seager, M.K.


    A Sparse Linear Algebra Package (SLAP), written in FORTRAN77, for the iterative solution of large sparse symmetric and non-symmetric linear systems is presented. SLAP Version 2.0 consists of three levels of routines: ''high level'', ''core'' and ''utility.'' The ''core'' routines implement the following preconditioned iterative methods: iterative refinement, conjugate gradient, conjugate gradient on the normal equations, bi-conjugate gradient, bi-conjugate gradient squared, orthomin and generalized minimum residual. All of these methods do not require the data structure of the matrix being solved nor of the preconditioning matrix, but do require the ''user'' to supply a matrix vector product and preconditioning routines. The ''high level'' routines assume one of two specific data structures and provide the required ''user routines.'' The preconditioners supported are diagonal scaling and incomplete factorization. One of the SLAP data structures allows for the vectorization of the matrix multiply and the backsolve of the incomplete factorization operations on machines with hardware gather/scatter capabilities. We present results for SLAP on the Cray Y/MP and Alliant FX/8 machines. 10 refs., 3 figs., 10 tabs.

  6. Large Scale Density Estimation of Blue and Fin Whales: Utilizing Sparse Array Data to Develop and Implement a New Method for Estimating Blue and Fin Whale Density


    1 DISTRIBUTION STATEMENT A. Approved for public release; distribution is unlimited. Large Scale Density Estimation of Blue and Fin Whales ...Utilizing Sparse Array Data to Develop and Implement a New Method for Estimating Blue and Fin Whale Density Len Thomas & Danielle Harris develop and implement a new method for estimating blue and fin whale density that is effective over large spatial scales and is designed to cope

  7. Nonsymmetrized hyperspherical harmonics with realistic NN potentials

    Deflorian, Sergio; Leidemann, Winfried; Orlandini, Giuseppina


    The Schroedinger equation is solved for an A-nucleon system using an expansion of the wave function in nonsymmetrized hyperspherical harmonics. Our approach is both an extension and a modification of the formalism developed by Gattobigio et al.. The extension consists in the inclusion of spin and isospin degrees of freedom such that a calculation with more realistic NN potential models becomes possible, whereas the modification allows a much simpler determination of the fermionic ground state. The approach is applied to four- and six-body nuclei (4He, 6Li) with various NN potential models. It is shown that the results for ground-state energy and radius agree well with those from the literature.

  8. On some developments in the Nonsymmetric Kaluza-Klein Theory

    Kalinowski, M.W. [Warsaw University, Faculty of Physics, Warsaw (Poland); Pracownia Bioinformatyki, Instytut Medycyny Doswiadczalnej i Klinicznej PAN, Warszawa (Poland)


    We consider a condition for charge confinement and gravito-electromagnetic wave solutions in nonsymmetric Kaluza-Klein theory. We consider also the influence of the cosmological constant on a static, spherically symmetric solution. We remind the reader of some fundamentals of nonsymmetric Kaluza-Klein theory and the geometrical background behind the theory. Simultaneously we make some remarks concerning a misunderstanding connected to several notions of Kaluza-Klein Theory, Einstein Unified Field Theory, geometrization and unification of physical interactions. We reconsider the Dirac field in nonsymmetric Kaluza-Klein theory. (orig.)

  9. The cosmology of the nonsymmetric theory of gravitation

    Prokopec, Tomislav [Institute for Theoretical Physics (ITP) and Spinoza Institute, Minnaertgebouw, Leuvenlaan 4, Utrecht University 3584 CE Utrecht (Netherlands)]. E-mail:; Valkenburg, Wessel [Institute for Theoretical Physics (ITP) and Spinoza Institute, Minnaertgebouw, Leuvenlaan 4, Utrecht University 3584 CE Utrecht (Netherlands)]. E-mail:


    We show that during cosmological inflation the nonsymmetric metric tensor theory of gravitation develops a spectrum which is potentially observable by cosmic microwave background observations, and may be the most sensitive probe of the scale of cosmic inflation.

  10. Macroscopic cumulative fatigue damage of material under nonsymmetrical cycle



    Hashin's macroscopic theory of fatigue damage is further discussed and a new method has been proposed for prediction of cumulative fatigue damage of material and its lifetime under nonsymmetrical cyclic loading.

  11. Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides

    Abdel-Rehim, A M; Stathopoulos, Andreas; Orginos, Kostas


    The technique that was used to build the EigCG algorithm for sparse symmetric linear systems is extended to the nonsymmetric case using the BiCG algorithm. We show that, similarly to the symmetric case, we can build an algorithm that is capable of computing a few smallest magnitude eigenvalues and their corresponding left and right eigenvectors of a nonsymmetric matrix using only a small window of the BiCG residuals while simultaneously solving a linear system with that matrix. For a system with multiple right-hand sides, we give an algorithm that computes incrementally more eigenvalues while solving the first few systems and then uses the computed eigenvectors to deflate BiCGStab for the remaining systems. Our experiments on various test problems, including Lattice QCD, show the remarkable ability of EigBiCG to compute spectral approximations with accuracy comparable to that of the unrestarted, nonsymmetric Lanczos. Furthermore, our incremental EigBiCG followed by appropriately restarted and deflated BiCGStab provides a competitive method for systems with multiple right-hand sides.

  12. Modelling of non-symmetric piezoelectric bimorphs

    Brissaud, Michel


    This paper deals with the modelling of non-symmetric piezoelectric bimorphs used in micromechanics or microsystems (MEMs). An analytical modelling including the elastic and geometric parameters of the substrate, bonding material, piezoelectric layer and electrodes is carried out. This model has been applied to bimorphs having different types of boundary conditions, that is clamped edges (CC), clamped and free edges (CF) or simply supported edges (SS). When the bimorph is used as an actuator, the resonance frequency and displacement of different types of bimorphs are calculated. Open circuit voltage, displacement and resonance frequency are determined when the bimorph is used as a sensor. The influence of the parameters of the bonding layer has been determined. A new method for calculating the global quality factor of bimorphs versus the quality factor of each layer is given. This method can easily be applied to all types of bimorphs (CC, CF, SS). The analytical form of the evolution of the resonance frequency and the sensitivity is deduced from the general modelling and theoretical models and are compared to those given by the finite element method and discussed.

  13. Amino acid alphabet size in protein evolution experiments: better to search a small library thoroughly or a large library sparsely?

    Muñoz, Enrique; Deem, Michael W


    We compare the results obtained from searching a smaller library thoroughly versus searching a more diverse, larger library sparsely. We study protein evolution with reduced amino acid alphabets, by simulating directed evolution experiments at three different alphabet sizes: 20, 5 and 2. We employ a physical model for evolution, the generalized NK model, that has proved successful in modeling protein evolution, antibody evolution and T-cell selection. We find that antibodies with higher affinity are found by searching a library with a larger alphabet sparsely than by searching a smaller library thoroughly, even with well-designed reduced libraries. We also find ranked amino acid usage frequencies in agreement with observations of the CDR-H3 variable region of human antibodies.

  14. Einstein Gravity, Lagrange-Finsler Geometry, and Nonsymmetric Metrics

    Sergiu I. Vacaru


    Full Text Available We formulate an approach to the geometry of Riemann-Cartan spaces provided with nonholonomic distributions defined by generic off-diagonal and nonsymmetric metrics inducing effective nonlinear and affine connections. Such geometries can be modelled by moving nonholonomic frames on (pseudo Riemannian manifolds and describe various types of nonholonomic Einstein, Eisenhart-Moffat and Finsler-Lagrange spaces with connections compatible to a general nonsymmetric metric structure. Elaborating a metrization procedure for arbitrary distinguished connections, we define the class of distinguished linear connections which are compatible with the nonlinear connection and general nonsymmetric metric structures. The nonsymmetric gravity theory is formulated in terms of metric compatible connections. Finally, there are constructed such nonholonomic deformations of geometric structures when the Einstein and/or Lagrange-Finsler manifolds are transformed equivalently into spaces with generic local anisotropy induced by nonsymmetric metrics and generalized connections. We speculate on possible applications of such geometric methods in Einstein and generalized theories of gravity, analogous gravity and geometric mechanics.

  15. Non-Symmetric Jack Polynomials and Integral Kernels

    Baker, T H


    We investigate some properties of non-symmetric Jack, Hermite and Laguerre polynomials which occur as the polynomial part of the eigenfunctions for certain Calogero-Sutherland models with exchange terms. For the non-symmetric Jack polynomials, the constant term normalization ${\\cal N}_\\eta$ is evaluated using recurrence relations, and ${\\cal N}_\\eta$ is related to the norm for the non-symmetric analogue of the power-sum inner product. Our results for the non-symmetric Hermite and Laguerre polynomials allow the explicit determination of the integral kernels which occur in Dunkl's theory of integral transforms based on reflection groups of type $A$ and $B$, and enable many analogues of properties of the classical Fourier, Laplace and Hankel transforms to be derived. The kernels are given as generalized hypergeometric functions based on non-symmetric Jack polynomials. Central to our calculations is the construction of operators $\\widehat{\\Phi}$ and $\\widehat{\\Psi}$, which act as lowering-type operators for the n...

  16. Optimally Sparse Frames

    Casazza, Peter G; Krahmer, Felix; Kutyniok, Gitta


    Frames have established themselves as a means to derive redundant, yet stable decompositions of a signal for analysis or transmission, while also promoting sparse expansions. However, when the signal dimension is large, the computation of the frame measurements of a signal typically requires a large number of additions and multiplications, and this makes a frame decomposition intractable in applications with limited computing budget. To address this problem, in this paper, we introduce sparsity of a frame as a new paradigm. In our terminology, a sparse frame is a frame whose elements have a sparse representation in an orthonormal basis, thereby enabling low-complexity frame decompositions. To introduce a precise meaning of optimality, we take the sum of the numbers of vectors needed of this orthonormal basis when expanding each frame vector as sparsity measure. We then analyze the recently introduced algorithm Spectral Tetris for construction of unit norm tight frames and prove that the tight frames generated...

  17. A Two-Level Method for Nonsymmetric Eigenvalue Problems

    Karel Kolman


    A two-level discretization method for eigenvalue problems is studied. Compared to the standard Galerkin finite element discretization technique performed on a fine grid this method discretizes the eigenvalue problem on a coarse grid and obtains an improved eigenvector (eigenvalue) approximation by solving only a linear problem on the fine grid (or two linear problems for the case of eigenvalue approximation of nonsymmetric problems). The improved solution has the asymptotic accuracy of the Galerkin discretization solution. The link between the method and the iterated Galerkin method is established. Error estimates for the general nonsymmetric case are derived.


    Xiao-xia Guo; Zhong-zhi Bai


    We study perturbation bound and structured condition number about the minimal nonnegative solution of nonsymmetric algebraic Riccati equation, obtaining a sharp perturbation bound and an accurate condition number. By using the matrix sign function method we present a new method for finding the minimal nonnegative solution of this algebraic Riccati equation. Based on this new method, we show how to compute the desired M-matrix solution of the quadratic matrix equation X2 - EX - F -= 0 by connecting it with the nonsymmetric algebraic Riccati equation, where E is a diagonal matrix and F is an M-matrix.

  19. Structured Multifrontal Sparse Solver


    StruMF is an algebraic structured preconditioner for the interative solution of large sparse linear systems. The preconditioner corresponds to a multifrontal variant of sparse LU factorization in which some dense blocks of the factors are approximated with low-rank matrices. It is algebraic in that it only requires the linear system itself, and the approximation threshold that determines the accuracy of individual low-rank approximations. Favourable rank properties are obtained using a block partitioning which is a refinement of the partitioning induced by nested dissection ordering.

  20. BlockSolve95 users manual: Scalable library software for the parallel solution of sparse linear systems

    Jones, M.T.; Plassmann, P.E.


    BlockSolve95 is a software library for solving large, sparse systems of linear equations on massively parallel computers or networks of workstations. The matrices must be symmetric in structure; however, the matrix nonzero values may be either symmetric or nonsymmetric. The nonzeros must be real valued. BlockSolve95 uses a message-passing paradigm and achieves portability through the use of the MPI message-passing standard. Emphasis has been placed on achieving both good professor performance through the use of higher-level BLAS and scalability through the use of advanced algorithms. This report gives detailed instructions on the use of BlockSolve95 and descriptions of a number of program examples that can be used as templates for application programs.

  1. Entanglement bounds for squeezed non-symmetric thermal state

    Jiang, L


    I study the three parameters bipartite quantum Gaussian state called squeezed asymmetric thermal state, calculate Gaussian entanglement of formation analytically and the up bound of relative entropy of entanglement, compare them with coherent information of the state. Based on the result obtained, it is anticipated that hashing inequality is not violated for squeezed non-symmetric thermal state.

  2. Theoretical modelling of non-symmetric circular piezoelectric bimorphs

    Brissaud, Michel


    This paper deals with the theoretical modelling of non-symmetric and symmetric circular bimorphs. The model is restricted to the study of flexural vibration modes having radial symmetry (axisymmetry), as is often the case for piezoelectric devices such as MEMs. The calculation of the resonance frequencies and the displacement of the non-symmetric circular bimorph has been carried out and the influence of the elastic and geometric parameters of the cement layer has been introduced into the model. As is shown, the modelling of non-symmetric and symmetric circular bimorphs reduces to the determination of two global quantities: the global rigidity DG and the global Poisson ratio σG of the bimorph which is then equivalent to a homogenous element. Consequently, the results obtained with elastic and homogeneous circular plates can be applied to non-symmetric and symmetric bimorphs with the only condition of using the global DG and σG. The new modelling was applied to bimorph functioning either as an actuator or as a sensor and having a simply supported or clamped edge. The electromechanical coupling factor of flexure modes has been calculated and compared to the radial mode. Comparison between analytical models and simulations using the finite-element method is given and discussed.

  3. A soil map of a large watershed in China: applying digital soil mapping in a data sparse region

    Barthold, F.; Blank, B.; Wiesmeier, M.; Breuer, L.; Frede, H.-G.


    Prediction of soil classes in data sparse regions is a major research challenge. With the advent of machine learning the possibilities to spatially predict soil classes have increased tremendously and given birth to new possibilities in soil mapping. Digital soil mapping is a research field that has been established during the last decades and has been accepted widely. We now need to develop tools to reduce the uncertainty in soil predictions. This is especially challenging in data sparse regions. One approach to do this is to implement soil taxonomic distance as a classification error criterion in classification and regression trees (CART) as suggested by Minasny et al. (Geoderma 142 (2007) 285-293). This approach assumes that the classification error should be larger between soils that are more dissimilar, i.e. differ in a larger number of soil properties, and smaller between more similar soils. Our study area is the Xilin River Basin, which is located in central Inner Mongolia in China. It is characterized by semi arid climate conditions and is representative for the natural occurring steppe ecosystem. The study area comprises 3600 km2. We applied a random, stratified sampling design after McKenzie and Ryan (Geoderma 89 (1999) 67-94) with landuse and topography as stratifying variables. We defined 10 sampling classes, from each class 14 replicates were randomly drawn and sampled. The dataset was split into 100 soil profiles for training and 40 soil profiles for validation. We then applied classification and regression trees (CART) to quantify the relationships between soil classes and environmental covariates. The classification tree explained 75.5% of the variance with land use and geology as most important predictor variables. Among the 8 soil classes that we predicted, the Kastanozems cover most of the area. They are predominantly found in steppe areas. However, even some of the soils at sand dune sites, which were thought to show only little soil formation

  4. Large, Sparse Optimal Matching with Refined Covariate Balance in an Observational Study of the Health Outcomes Produced by New Surgeons.

    Pimentel, Samuel D; Kelz, Rachel R; Silber, Jeffrey H; Rosenbaum, Paul R


    Every newly trained surgeon performs her first unsupervised operation. How do the health outcomes of her patients compare with the patients of experienced surgeons? Using data from 498 hospitals, we compare 1252 pairs comprised of a new surgeon and an experienced surgeon working at the same hospital. We introduce a new form of matching that matches patients of each new surgeon to patients of an otherwise similar experienced surgeon at the same hospital, perfectly balancing 176 surgical procedures and closely balancing a total of 2.9 million categories of patients; additionally, the individual patient pairs are as close as possible. A new goal for matching is introduced, called "refined covariate balance," in which a sequence of nested, ever more refined, nominal covariates is balanced as closely as possible, emphasizing the first or coarsest covariate in that sequence. A new algorithm for matching is proposed and the main new results prove that the algorithm finds the closest match in terms of the total within-pair covariate distances among all matches that achieve refined covariate balance. Unlike previous approaches to forcing balance on covariates, the new algorithm creates multiple paths to a match in a network, where paths that introduce imbalances are penalized and hence avoided to the extent possible. The algorithm exploits a sparse network to quickly optimize a match that is about two orders of magnitude larger than is typical in statistical matching problems, thereby permitting much more extensive use of fine and near-fine balance constraints. The match was constructed in a few minutes using a network optimization algorithm implemented in R. An R package called rcbalance implementing the method is available from CRAN.

  5. Bundle block adjustment of large-scale remote sensing data with Block-based Sparse Matrix Compression combined with Preconditioned Conjugate Gradient

    Zheng, Maoteng; Zhang, Yongjun; Zhou, Shunping; Zhu, Junfeng; Xiong, Xiaodong


    In recent years, new platforms and sensors in photogrammetry, remote sensing and computer vision areas have become available, such as Unmanned Aircraft Vehicles (UAV), oblique camera systems, common digital cameras and even mobile phone cameras. Images collected by all these kinds of sensors could be used as remote sensing data sources. These sensors can obtain large-scale remote sensing data which consist of a great number of images. Bundle block adjustment of large-scale data with conventional algorithm is very time and space (memory) consuming due to the super large normal matrix arising from large-scale data. In this paper, an efficient Block-based Sparse Matrix Compression (BSMC) method combined with the Preconditioned Conjugate Gradient (PCG) algorithm is chosen to develop a stable and efficient bundle block adjustment system in order to deal with the large-scale remote sensing data. The main contribution of this work is the BSMC-based PCG algorithm which is more efficient in time and memory than the traditional algorithm without compromising the accuracy. Totally 8 datasets of real data are used to test our proposed method. Preliminary results have shown that the BSMC method can efficiently decrease the time and memory requirement of large-scale data.

  6. A Fast LDL-factorization Approach for Large Sparse Positive Definite System and Its Application to One-to-one Marketing Optimization Computation

    Min Wu; Bei He; Jin-Hua She


    LDL-factorization is an efficient way of solving Ax = b for a large symmetric positive definite sparse matrix A. This paper presents a new method that further improves the efficiency of LDL-factorization. It is based on the theory of elimination trees for the factorization factor. It breaks the computations involved in LDL-factorization down into two stages: 1) the pattern of nonzero entries of the factor is predicted, and 2) the numerical values of the nonzero entries of the factor are computed. The factor is stored using the form of an elimination tree so as to reduce memory usage and avoid unnecessary numerical operations. The calculation results for some typical numerical examples demonstrate that this method provides a significantly higher calculation efficiency for the one-to-one marketing optimization algorithm.

  7. Investigation Into Non-Symmetrical Modes Of Linear Induction Motors

    Lisauskas, Saulius


    Linear induction motors are applied in equipments with different requirements set up to the controlled motion parameters. Investigation of motoring and breaking modes remains the relevant problem nowadays. The scientific novelty is based on analysis of non-symmetrical operation modes of linear induction motor at supplying it by a voltage source, developing a generalized model of motoring and breaking dynamic modes and analyzing influence of linear motor windings connection way and contro...

  8. Non-symmetric interactions trigger collective swings in globally ordered systems

    Cavagna, Andrea; Jelic, Asja; Silvestri, Edmondo; Viale, Massimiliano


    Many systems in nature, from ferromagnets to flocks of birds, exhibit ordering phenomena on the large scale. In physical systems order is statistically robust for large enough dimensions, with relative fluctuations due to noise vanishing with system size. Several biological systems, however, are less stable than their physical analogues and spontaneously change their global state on relatively short timescales. In this paper we show that there are two crucial ingredients in these systems that enhance the effect of noise, leading to collective changes of state: the non-symmetric nature of interactions between individuals, and the presence of local heterogeneities in the topology of the network. The consequences of these features can be larger the larger the system size leading to a localization of the fluctuation modes and a relaxation time that remains finite in the thermodynamic limit. The system keeps changing its global state in time, being constantly driven out of equilibrium by spontaneous fluctuations. ...

  9. BDDC for nonsymmetric positive definite and symmetric indefinite problems

    Tu, Xuemin; Li, Jing


    The balancing domain decomposition methods by constraints are extended to solving both nonsymmetric, positive definite and symmetric, indefinite linear systems. In both cases, certain nonstandard primal constraints are included in the coarse problems of BDDC algorithms to accelerate the convergence. Under the assumption that the subdomain size is small enough, a convergence rate estimate for the GMRES iteration is established that the rate is independent of the number of subdomains and depends only slightly on the subdomain problem size. Numerical experiments for several two-dimensional examples illustrate the fast convergence of the proposed algorithms.

  10. Tubular composite columns in a non-symmetrical fire

    Markku Heinisuo; Timo Jokinen


    A considerable number of studies have been conducted worldwide on fires that act on all four sides of a column (symmetrical fire). These cases are used for the validation of the analysis models developed in this study. In real buildings the columns are often embedded. If the fire does not act similarly on all surfaces of the column (non-symmetrical fire), it is extremely difficult to predict how the column will behave. The key research questions are: Is resistance stronger in non-symmetri...

  11. Inequalities among New Non-Symmetric Divergence and Chi-Square Divergence Measure

    Ram Naresh Saraswat


    Full Text Available Information divergence measures and their bounds are well known in the literature of Information Theory. In this research paper, we shall consider a new non-symmetric information divergence measure. Upper and lower bounds of new non-symmetric divergence measure are also considered.

  12. Inequalities among New Non-Symmetric Divergence and Chi-Square Divergence Measure

    Ram Naresh Saraswat


    Information divergence measures and their bounds are well known in the literature of Information Theory. In this research paper, we shall consider a new non-symmetric information divergence measure. Upper and lower bounds of new non-symmetric divergence measure are also considered.

  13. On Implementing a Homogeneous Interior-Point Algorithm for Nonsymmetric Conic Optimization

    Skajaa, Anders; Jørgensen, John Bagterp; Hansen, Per Christian

    Based on earlier work by Nesterov, an implementation of a homogeneous infeasible-start interior-point algorithm for solving nonsymmetric conic optimization problems is presented. Starting each iteration from (the vicinity of) the central path, the method computes (nearly) primal-dual symmetric......-cone problem, the facility location problem, entropy problems and geometric programs; all formulated as nonsymmetric conic optimization problems....

  14. Simulation of Multiple Cold Rolls Progressive Forming for Non-symmetrical Channel Section


    In cold roll forming process, the sheet is progressively formed into a very complex three dimensional surface. The design procedure for the roll formed products, forming rolls, and roll pass sequences was considered more an art than a science. Good roll pass design was the key to successful roll forming. In order to reduce forming defects and trial production cost, computer simulation of cold roll forming was employed. Based on the Updated-Lagrange method in the deformation mechanics, a theoretical model of elastic-plastic large deformation spline finite strip method is proposed in this paper. The method is employed to analyze the progressive forming process of non-symmetrical section, and the displacement, the stress and the strain along rolling direction during the multiple cold rolls forming process are got. This program written in C Language can be used to analyze other simple cross sectional profiles also.

  15. Error Correcting Coding for a Non-symmetric Ternary Channel

    Bitouze, Nicolas; Rosnes, Eirik


    Ternary channels can be used to model the behavior of some memory devices, where information is stored in three different levels. In this paper, error correcting coding for a ternary channel where some of the error transitions are not allowed, is considered. The resulting channel is non-symmetric, therefore classical linear codes are not optimal for this channel. We define the maximum-likelihood (ML) decoding rule for ternary codes over this channel and show that it is complex to compute, since it depends on the channel error probability. A simpler alternative decoding rule which depends only on code properties, called $\\da$-decoding, is then proposed. It is shown that $\\da$-decoding and ML decoding are equivalent, i.e., $\\da$-decoding is optimal, under certain conditions. Assuming $\\da$-decoding, we characterize the error correcting capabilities of ternary codes over the non-symmetric ternary channel. We also derive an upper bound and a constructive lower bound on the size of codes, given the code length and...

  16. Modelling of a cantilever non-symmetric piezoelectric bimorph

    Brissaud, Michel; Ledren, Sarah; Gonnard, P.


    The aim of this paper is the modelling of a non-symmetric bimorph constituted by a piezoelectric material deposited on an alumina substrate and used either as an actuator or a sensor. Theoretical modelling based on the flexural modes of the structure is carried out and the influence of the electrode characteristics (geometrical dimensions and elastic parameters) is introduced in the modelling for calculating the bimorph bending displacement. In actuator mode, the electrical admittance of the cantilever non-symmetric bimorph is stated and the intrinsic electromechanical coupling factor linked to the bimorph bending motion is deduced and compared with that defined in IEEE Standards. The analytical modelling was used for characterizing a cantilever bimorph constituted by a piezoelectric thick film deposited on an alumina substrate. A trial and error fitting method is described for determining the elastic, piezoelectric and dielectric constants of the piezoelectric material. The influence of the electrode parameters is calculated and the measurement uncertainty is deduced. In sensor mode the open voltage delivered by the bent piezoelectric layer and the electrical equivalent circuit of the bimorph are given. Theoretical results are compared with those obtained by the finite element method, and discussed.

  17. Sparse Regression as a Sparse Eigenvalue Problem

    Moghaddam, Baback; Gruber, Amit; Weiss, Yair; Avidan, Shai


    We extend the l0-norm "subspectral" algorithms for sparse-LDA [5] and sparse-PCA [6] to general quadratic costs such as MSE in linear (kernel) regression. The resulting "Sparse Least Squares" (SLS) problem is also NP-hard, by way of its equivalence to a rank-1 sparse eigenvalue problem (e.g., binary sparse-LDA [7]). Specifically, for a general quadratic cost we use a highly-efficient technique for direct eigenvalue computation using partitioned matrix inverses which leads to dramatic x103 speed-ups over standard eigenvalue decomposition. This increased efficiency mitigates the O(n4) scaling behaviour that up to now has limited the previous algorithms' utility for high-dimensional learning problems. Moreover, the new computation prioritizes the role of the less-myopic backward elimination stage which becomes more efficient than forward selection. Similarly, branch-and-bound search for Exact Sparse Least Squares (ESLS) also benefits from partitioned matrix inverse techniques. Our Greedy Sparse Least Squares (GSLS) generalizes Natarajan's algorithm [9] also known as Order-Recursive Matching Pursuit (ORMP). Specifically, the forward half of GSLS is exactly equivalent to ORMP but more efficient. By including the backward pass, which only doubles the computation, we can achieve lower MSE than ORMP. Experimental comparisons to the state-of-the-art LARS algorithm [3] show forward-GSLS is faster, more accurate and more flexible in terms of choice of regularization

  18. The Shifting Technique for Solving a Nonsymmetric Algebraic Riccati Equation

    Chiang, Chun-Yueh


    This paper analyzes a special instance of nonsymmetric algebraic matrix Riccati equations arising from transport theory. Traditional approaches for finding the minimal nonnegative solution of the matrix Riccati equations are based on the fixed point iteration and the speed of the convergence is linear. Relying on simultaneously matrix computation, a structure-preserving doubling algorithm (SDA) with quadratic convergence is designed for improving the speed of convergence. The difficulty is that the double algorithm with quadratic convergence cannot guarantee to work all the time. Our main trust in this work is to show that applied with a suitable shifted technique, the SDA is guaranteed to converge quadratically with no breakdown. Also, we modify the conventional simple iteration algorithm in the critical case to dramatically improve the speed of convergence. Numerical experiments strongly suggest that the total number of computational steps can be significantly reduced via the shifting procedure.

  19. Vacuum properties of nonsymmetric gravity in de Sitter space

    Janssen, T; Janssen, Tomas; Prokopec, Tomislav


    We consider quantum effects of a massive antisymmetric tensor field on the dynamics of de Sitter space-time. Our starting point is the most general, stable, linearized Lagrangian arising in nonsymmetric gravitational theories (NGTs), where part of the antisymmetric field mass is generated by the cosmological term. We construct a renormalization group (RG) improved effective action by integrating out one loop vacuum fluctuations of the antisymmetric tensor field and show that, in the limit when the RG scale goes to zero, the Hubble parameter -- and thus the effective cosmological constant -- relaxes rapidly to zero. We thus conclude that quantum loop effects in de Sitter space can dramatically change the infrared sector of the on-shell gravity, making the expansion rate insensitive to the original (bare) cosmological constant.

  20. A Note on the Cross Gramian for Non-Symmetric Systems

    Himpe, Christian; Ohlberger, Mario


    The cross gramian matrix is a tool for model reduction and system identification, but it is only computable for square control systems. For symmetric systems the cross gramian possesses a useful relation to the system's associated Hankel singular values. Yet, many real-life models are neither square nor symmetric. In this work, concepts from decentralized control are used to approximate a cross gramian for non-symmetric and non-square systems. To illustrate this new non-symmetric cross gramia...

  1. Recent advances in Lanczos-based iterative methods for nonsymmetric linear systems

    Freund, Roland W.; Golub, Gene H.; Nachtigal, Noel M.


    In recent years, there has been a true revival of the nonsymmetric Lanczos method. On the one hand, the possible breakdowns in the classical algorithm are now better understood, and so-called look-ahead variants of the Lanczos process have been developed, which remedy this problem. On the other hand, various new Lanczos-based iterative schemes for solving nonsymmetric linear systems have been proposed. This paper gives a survey of some of these recent developments.

  2. Multiple sparse representations classification

    E. Plenge (Esben); S.K. Klein (Stefan); W.J. Niessen (Wiro); E. Meijering (Erik)


    textabstractSparse representations classification (SRC) is a powerful technique for pixelwise classification of images and it is increasingly being used for a wide variety of image analysis tasks. The method uses sparse representation and learned redundant dictionaries to classify image pixels. In t

  3. Transformation invariant sparse coding

    Mørup, Morten; Schmidt, Mikkel Nørgaard


    Sparse coding is a well established principle for unsupervised learning. Traditionally, features are extracted in sparse coding in specific locations, however, often we would prefer invariant representation. This paper introduces a general transformation invariant sparse coding (TISC) model....... The model decomposes images into features invariant to location and general transformation by a set of specified operators as well as a sparse coding matrix indicating where and to what degree in the original image these features are present. The TISC model is in general overcomplete and we therefore invoke...... sparse coding to estimate its parameters. We demonstrate how the model can correctly identify components of non-trivial artificial as well as real image data. Thus, the model is capable of reducing feature redundancies in terms of pre-specified transformations improving the component identification....

  4. Structural Sparse Tracking

    Zhang, Tianzhu


    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.

  5. Ideal magnetohydrodynamic equilibrium in a non-symmetric topological torus

    Weitzner, Harold [Courant Institute of Mathematical Sciences, New York University, New York, New York 10012 (United States)


    An alternative representation of an ideal magnetohydrodynamic equilibrium is developed. The representation is a variation of one given by A. Salat, Phys. Plasmas 2, 1652 (1995). The system of equations is used to study the possibility of non-symmetric equilibria in a topological torus, here an approximate rectangular parallelopiped, with periodicity in two of the three rectangular coordinates. An expansion is carried out in the deviation of pressure surfaces from planes. Resonances are manifest in the process. Nonetheless, provided the magnetic shear is small, it is shown that it is possible to select the magnetic fields and flux surfaces in such a manner that no singularities appear on resonant surfaces. One boundary surface of the parallelopiped is not arbitrary but is dependent on the equilibrium in question. A comparison of the solution sets of axisymmetric and non-axisymmetric equilibria suggests that the latter have a wider class of possible boundary shapes but more restrictive rotational transform profiles. No proof of convergence of the series is given.

  6. Unidirectional transmission in non-symmetric gratings containing metallic layers.

    Serebryannikov, A E; Ozbay, Ekmel


    The mechanism of achieving unidirectional transmission in the gratings, which only contain isotropic dielectric and metallic layers, is suggested and numerically validated. It is shown that significant transmission in one direction and nearly zero transmission in the opposite direction can be obtained in the same intrinsically isotropic gratings as those studied recently in A. E. Serebryannikov and E. Ozbay, Opt. Express 17, 278 (2009), but at a non-zero angle of incidence. The tilting, non-symmetric features of the grating and the presence of a metallic layer with a small positive real part of the index of refraction are the conditions that are necessary for obtaining the unidirectionality. Single- and multibeam operational regimes are demonstrated. The frequency and angle ranges of the unidirectional transmission can be estimated by using the conventional framework based on isofrequency dispersion contours and construction lines that properly take into account the periodic features of the interfaces, but should then be corrected because of the tunneling arising within the adjacent ranges. After proper optimization, this mechanism is expected to become an alternative to that based on the use of anisotropic materials.

  7. Modelling non-symmetric collagen fibre dispersion in arterial walls.

    Holzapfel, Gerhard A; Niestrawska, Justyna A; Ogden, Ray W; Reinisch, Andreas J; Schriefl, Andreas J


    New experimental results on collagen fibre dispersion in human arterial layers have shown that the dispersion in the tangential plane is more significant than that out of plane. A rotationally symmetric dispersion model is not able to capture this distinction. For this reason, we introduce a new non-symmetric dispersion model, based on the bivariate von Mises distribution, which is used to construct a new structure tensor. The latter is incorporated in a strain-energy function that accommodates both the mechanical and structural features of the material, extending our rotationally symmetric dispersion model (Gasser et al. 2006 J. R. Soc. Interface 3, 15-35. (doi:10.1098/rsif.2005.0073)). We provide specific ranges for the dispersion parameters and show how previous models can be deduced as special cases. We also provide explicit expressions for the stress and elasticity tensors in the Lagrangian description that are needed for a finite-element implementation. Material and structural parameters were obtained by fitting predictions of the model to experimental data obtained from human abdominal aortic adventitia. In a finite-element example, we analyse the influence of the fibre dispersion on the homogeneous biaxial mechanical response of aortic strips, and in a final example the non-homogeneous stress distribution is obtained for circumferential and axial strips under fixed extension. It has recently become apparent that this more general model is needed for describing the mechanical behaviour of a variety of fibrous tissues.

  8. Estimating sparse precision matrices

    Padmanabhan, Nikhil; White, Martin; Zhou, Harrison H.; O'Connell, Ross


    We apply a method recently introduced to the statistical literature to directly estimate the precision matrix from an ensemble of samples drawn from a corresponding Gaussian distribution. Motivated by the observation that cosmological precision matrices are often approximately sparse, the method allows one to exploit this sparsity of the precision matrix to more quickly converge to an asymptotic 1/sqrt{N_sim} rate while simultaneously providing an error model for all of the terms. Such an estimate can be used as the starting point for further regularization efforts which can improve upon the 1/sqrt{N_sim} limit above, and incorporating such additional steps is straightforward within this framework. We demonstrate the technique with toy models and with an example motivated by large-scale structure two-point analysis, showing significant improvements in the rate of convergence. For the large-scale structure example, we find errors on the precision matrix which are factors of 5 smaller than for the sample precision matrix for thousands of simulations or, alternatively, convergence to the same error level with more than an order of magnitude fewer simulations.

  9. Sparse adaptive filters for echo cancellation

    Paleologu, Constantin


    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

  10. Probabilistic Recovery Guarantees for Sparsely Corrupted Signals

    Pope, Graeme; Studer, Christoph


    We consider the recovery of sparse signals subject to sparse interference, as introduced in Studer et al., IEEE Trans. IT, 2012. We present novel probabilistic recovery guarantees for this framework, covering varying degrees of knowledge of the signal and interference support, which are relevant for a large number of practical applications. Our results assume that the sparsifying dictionaries are solely characterized by coherence parameters and we require randomness only in the signal and/or interference. The obtained recovery guarantees show that one can recover sparsely corrupted signals with overwhelming probability, even if the sparsity of both the signal and interference scale (near) linearly with the number of measurements.

  11. PCG reference manual: A package for the iterative solution of large sparse linear systems on parallel computers. Version 1.0

    Joubert, W.D. [Los Alamos National Lab., NM (United States); Carey, G.F.; Kohli, H.; Lorber, A.; McLay, R.T.; Shen, Y. [Texas Univ., Austin, TX (United States); Berner, N.A. [Texas Univ., Austin, TX (United States)]|[Los Alamos National Lab., NM (United States); Kalhan, A. [Los Alamos National Lab., NM (United States)]|[Tennessee Univ., Knoxville, TN (United States)


    PCG (Preconditioned Conjugate Gradient package) is a system for solving linear equations of the form Au = b, for A a given matrix and b and u vectors. PCG, employing various gradient-type iterative methods coupled with preconditioners, is designed for general linear systems, with emphasis on sparse systems such as these arising from discretization of partial differential equations arising from physical applications. It can be used to solve linear equations efficiently on parallel computer architectures. Much of the code is reusable across architectures and the package is portable across different systems; the machines that are currently supported is listed. This manual is intended to be the general-purpose reference describing all features of the package accessible to the user; suggestions are also given regarding which methods to use for a given problem.

  12. Sparse Signal Processing with Frame Theory

    Mixon, Dustin G


    Many emerging applications involve sparse signals, and their processing is a subject of active research. We desire a large class of sensing matrices which allow the user to discern important properties of the measured sparse signal. Of particular interest are matrices with the restricted isometry property (RIP). RIP matrices are known to enable efficient and stable reconstruction of sufficiently sparse signals, but the deterministic construction of such matrices has proven very difficult. In this thesis, we discuss this matrix design problem in the context of a growing field of study known as frame theory. In the first two chapters, we build large families of equiangular tight frames and full spark frames, and we discuss their relationship to RIP matrices as well as their utility in other aspects of sparse signal processing. In Chapter 3, we pave the road to deterministic RIP matrices, evaluating various techniques to demonstrate RIP, and making interesting connections with graph theory and number theory. We ...

  13. Synthesis, characterization and photophysical properties of luminescent non-symmetric 4-pyridyl benzothiadiazole derivatives

    Pazini, Alessandra; Maqueira, Luis; Stieler, Rafael; Aucélio, Ricardo Q.; Limberger, Jones


    Two nonsymmetrical π-extended 2,1,3-benzothiadiazoles (BTDs) bearing a 4-pyridyl moiety (BTD-4pyr and BTD-Et4pyr) were synthesized by sequential cross coupling reactions. The structural difference between the two dyes is the presence of a triple bond between the BTD core and the 4-pyridyl moiety in BTD-Et4pyr. The compounds architecture is similar to previously described selective mitochondrial biomarkers. Both compounds exhibit large Stokes shifts (93-137 nm), high fluorescence quantum yields and linear fluorescence response in the nanomolar range. The existence of the triple bond decreased in about 35% the fluorescence measured from BTD-Et4pyr in respect to BTD-4pyr. Solid-state fluorescence of the dyes were measured, producing considerable smaller Stokes shifts than the ones observed in solutions (74 nm for BTD-4pyr and 66 nm for BTD-Et4pyr). X-ray crystallography analysis of BTD-4pyr indicated a quinoid character for the BTD ring and a nonplanar relation between the BTD core and the aryl/heteroaryl groups. DFT calculations pointed out that the LUMO electron density is concentrated over the BTD core. In relation to HOMO, the electron density is distributed mainly at the methoxyphenyl group, in the hydrocarbon fraction of the BTD core and in ethynyl group for BTD-Et4pyr.

  14. Composite-step product methods for solving nonsymmetric linear systems

    Chan, T.F.; Szeto, T. [Univ. of California, Los Angeles, CA (United States)


    The Biconjugate Gradient (BCG) algorithm is the {open_quotes}natural{close_quotes} generalization of the classical Conjugate Gradient method to nonsymmetric linear systems. It is an attractive method because of its simplicity and its good convergence properties. Unfortunately, BCG suffers from two kinds of breakdowns (divisions by 0): one due to the non-existence of the residual polynomial, and the other due to a breakdown in the recurrence relationship used. There are many look-ahead techniques in existence which are designed to handle these breakdowns. Although the step size needed to overcome an exact breakdown can be computed in principle, these methods can unfortunately be quite complicated for handling near breakdowns since the sizes of the look-ahead steps are variable (indeed, the breakdowns can be incurable). Recently, Bank and Chan introduced the Composite Step Biconjugate Gradient (CSBCG) algorithm, an alternative which cures only the first of the two breakdowns mentioned by skipping over steps for which the BCG iterate is not defined. This is done with a simple modification of BCG which needs only a maximum look-ahead step size of 2 to eliminate the (near) breakdown and to smooth the sometimes erratic convergence of BCG. Thus, instead of a more complicated (but less prone to breakdown) version, CSBCG cures only one kind of breakdown, but does so with a minimal modification to the usual implementation of BCG in the hope that its empirically observed stability will be inherited. The authors note, then, that the Composite Step idea can be incorporated anywhere the BCG polynomial is used; in particular, in product methods such as CGS, Bi-CGSTAB, and TFQMR. Doing this not only cures the breakdown mentioned above, but also takes on the advantages of these product methods, namely, no multiplications by the transpose matrix and a faster convergence rate than BCG.

  15. Sparse representation of astronomical images.

    Rebollo-Neira, Laura; Bowley, James


    Sparse representation of astronomical images is discussed. It is shown that a significant gain in sparsity is achieved when particular mixed dictionaries are used for approximating these types of images with greedy selection strategies. Experiments are conducted to confirm (i) the effectiveness at producing sparse representations and (ii) competitiveness, with respect to the time required to process large images. The latter is a consequence of the suitability of the proposed dictionaries for approximating images in partitions of small blocks. This feature makes it possible to apply the effective greedy selection technique called orthogonal matching pursuit, up to some block size. For blocks exceeding that size, a refinement of the original matching pursuit approach is considered. The resulting method is termed "self-projected matching pursuit," because it is shown to be effective for implementing, via matching pursuit itself, the optional backprojection intermediate steps in that approach.

  16. Consensus Convolutional Sparse Coding

    Choudhury, Biswarup


    Convolutional sparse coding (CSC) is a promising direction for unsupervised learning in computer vision. In contrast to recent supervised methods, CSC allows for convolutional image representations to be learned that are equally useful for high-level vision tasks and low-level image reconstruction and can be applied to a wide range of tasks without problem-specific retraining. Due to their extreme memory requirements, however, existing CSC solvers have so far been limited to low-dimensional problems and datasets using a handful of low-resolution example images at a time. In this paper, we propose a new approach to solving CSC as a consensus optimization problem, which lifts these limitations. By learning CSC features from large-scale image datasets for the first time, we achieve significant quality improvements in a number of imaging tasks. Moreover, the proposed method enables new applications in high dimensional feature learning that has been intractable using existing CSC methods. This is demonstrated for a variety of reconstruction problems across diverse problem domains, including 3D multispectral demosaickingand 4D light field view synthesis.

  17. Sparse structure regularized ranking

    Wang, Jim Jing-Yan


    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.

  18. A sparse effective Nullstellensatz

    Sombra, M


    We present bounds for the sparseness and for the degrees of the polynomials in the Nullstellensatz. Our bounds depend mainly on the unmixed volume of the input polynomial system. The degree bounds can substantially improve the known ones when this polynomial system is sparse, and they are, in the worst case, simply exponential in terms of the number of variables and the maximum degree of the input polynomials.

  19. Sparse extreme learning machine for classification.

    Bai, Zuo; Huang, Guang-Bin; Wang, Danwei; Wang, Han; Westover, M Brandon


    Extreme learning machine (ELM) was initially proposed for single-hidden-layer feedforward neural networks (SLFNs). In the hidden layer (feature mapping), nodes are randomly generated independently of training data. Furthermore, a unified ELM was proposed, providing a single framework to simplify and unify different learning methods, such as SLFNs, least square support vector machines, proximal support vector machines, and so on. However, the solution of unified ELM is dense, and thus, usually plenty of storage space and testing time are required for large-scale applications. In this paper, a sparse ELM is proposed as an alternative solution for classification, reducing storage space and testing time. In addition, unified ELM obtains the solution by matrix inversion, whose computational complexity is between quadratic and cubic with respect to the training size. It still requires plenty of training time for large-scale problems, even though it is much faster than many other traditional methods. In this paper, an efficient training algorithm is specifically developed for sparse ELM. The quadratic programming problem involved in sparse ELM is divided into a series of smallest possible sub-problems, each of which are solved analytically. Compared with SVM, sparse ELM obtains better generalization performance with much faster training speed. Compared with unified ELM, sparse ELM achieves similar generalization performance for binary classification applications, and when dealing with large-scale binary classification problems, sparse ELM realizes even faster training speed than unified ELM.

  20. Using sparse LU factorisation to precondition GMRES for a family of similarly structured matrices arising from process modelling

    Brooking, C. [Univ. of Bath (United Kingdom)


    Process engineering software is used to simulate the operation of large chemical plants. Such simulations are used for a variety of tasks, including operator training. For the software to be of practical use for this, dynamic simulations need to run in real-time. The models that the simulation is based upon are written in terms of Differential Algebraic Equations (DAE`s). In the numerical time-integration of systems of DAE`s using an implicit method such as backward Euler, the solution of nonlinear systems is required at each integration point. When solved using Newton`s method, this leads to the repeated solution of nonsymmetric sparse linear systems. These systems range in size from 500 to 20,000 variables. A typical integration may require around 3000 timesteps, and if 4 Newton iterates were needed on each time step, then this means approximately 12,000 linear systems must be solved. The matrices produced by the simulations have a similar sparsity pattern throughout the integration. They are also severely ill-conditioned, and have widely-scattered spectra.

  1. Basis-free expressions for derivatives of a subclass of nonsymmetric isotropic tensor functions


    The present paper generalizes the method for solving the derivatives of symmetric isotropic tensor-valued functions proposed by Dui and Chen (2004) to a subclass of nonsymmetric tensor functions satisfying the commutative condition.This subclass of tensor functions is more general than those investigated by the existing methods.In the case of three distinct eigenvalues, the commutativity makes it possible to introduce two scalar functions, which will be used to construct the general nonsymmetric tensor functions and their derivatives.In the cases of repeated eigenvalues, the results are acquired by taking limits.

  2. A case against a divide and conquer approach to the nonsymmetric eigenvalue problem

    Jessup, E.R.


    Divide and conquer techniques based on rank-one updating have proven fast, accurate, and efficient in parallel for the real symmetric tridiagonal and unitary eigenvalue problems and for the bidiagonal singular value problem. Although the divide and conquer mechanism can also be adapted to the real nonsymmetric eigenproblem in a straightforward way, most of the desirable characteristics of the other algorithms are lost. In this paper, we examine the problems of accuracy and efficiency that can stand in the way of a nonsymmetric divide and conquer eigensolver based on low-rank updating. 31 refs., 2 figs.

  3. Computing interior eigenvalues of nonsymmetric matrices: application to three-dimensional metamaterial composites.

    Terao, Takamichi


    We propose a numerical method to calculate interior eigenvalues and corresponding eigenvectors for nonsymmetric matrices. Based on the subspace projection technique onto expanded Ritz subspace, it becomes possible to obtain eigenvalues and eigenvectors with sufficiently high precision. This method overcomes the difficulties of the traditional nonsymmetric Lanczos algorithm, and improves the accuracy of the obtained interior eigenvalues and eigenvectors. Using this algorithm, we investigate three-dimensional metamaterial composites consisting of positive and negative refractive index materials, and it is demonstrated that the finite-difference frequency-domain algorithm is applicable to analyze these metamaterial composites.

  4. Sparse approximation with bases


    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...

  5. Efficient convolutional sparse coding

    Wohlberg, Brendt


    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.

  6. Scaled Sparse Linear Regression

    Sun, Tingni


    Scaled sparse linear regression jointly estimates the regression coefficients and noise level in a linear model. It chooses an equilibrium with a sparse regression method by iteratively estimating the noise level via the mean residual squares and scaling the penalty in proportion to the estimated noise level. The iterative algorithm costs nearly nothing beyond the computation of a path of the sparse regression estimator for penalty levels above a threshold. For the scaled Lasso, the algorithm is a gradient descent in a convex minimization of a penalized joint loss function for the regression coefficients and noise level. Under mild regularity conditions, we prove that the method yields simultaneously an estimator for the noise level and an estimated coefficient vector in the Lasso path satisfying certain oracle inequalities for the estimation of the noise level, prediction, and the estimation of regression coefficients. These oracle inequalities provide sufficient conditions for the consistency and asymptotic...

  7. Dynamic Representations of Sparse Graphs

    Brodal, Gerth Stølting; Fagerberg, Rolf


    We present a linear space data structure for maintaining graphs with bounded arboricity—a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth—under edge insertions, edge deletions, and adjacency queries. The data structure supports adjacency queries in worst...... case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity....

  8. Programming for Sparse Minimax Optimization

    Jonasson, K.; Madsen, Kaj


    We present an algorithm for nonlinear minimax optimization which is well suited for large and sparse problems. The method is based on trust regions and sequential linear programming. On each iteration, a linear minimax problem is solved for a basic step. If necessary, this is followed...... by the determination of a minimum norm corrective step based on a first-order Taylor approximation. No Hessian information needs to be stored. Global convergence is proved. This new method has been extensively tested and compared with other methods, including two well known codes for nonlinear programming...

  9. New representation of the non-symmetric homogeneous bounded domains in ℂ4 and ℂ5

    Gr. Tsagas


    Full Text Available This paper deals with the corresponding solvable Lie algebra to each of non-symmetric homogeneous bounded domains in ℂ4 and ℂ5 by special set of matrices. Some interesting properties of Kähler manifolds are found. The theory of s-structure on a complete Riemann manifold is also studied.

  10. A homogeneous interior-point algorithm for nonsymmetric convex conic optimization

    Skajaa, Anders; Ye, Yinyu


    a new Runge–Kutta type second order search direction suitable for the general nonsymmetric conic problem. Moreover, quasi-Newton updating is used to reduce the number of factorizations needed, implemented so that data sparsity can still be exploited. Extensive and promising computational results...

  11. A High Revolution Speed Noncontact Ultrasonic Motor Driven by a Non-Symmetrical Electrode

    YANG Bin; LIU Jing-Quan; CHEN Di; CAI Bing-Chu


    @@ A noncontact ultrasonic motor based on a non-symmetrical electrode is proposed. This motor has the advantages of using a simple driving electrode and having a high revolution speed. The revolution speed of its three-blade rotor can reach 5100rpm under a driving voltage of 20 V. A method operated easily is proposed to measure the output torque.

  12. Supervised Transfer Sparse Coding

    Al-Shedivat, Maruan


    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.

  13. CABOSFV algorithm for high dimensional sparse data clustering

    Sen Wu; Xuedong Gao


    An algorithm, Clustering Algorithm Based On Sparse Feature Vector (CABOSFV), was proposed for the high dimensional clustering of binary sparse data. This algorithm compresses the data effectively by using a tool 'Sparse Feature Vector', thus reduces the data scale enormously, and can get the clustering result with only one data scan. Both theoretical analysis and empirical tests showed that CABOSFV is of low computational complexity. The algorithm finds clusters in high dimensional large datasets efficiently and handles noise effectively.

  14. Sparse inpainting and isotropy

    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:, E-mail:, E-mail:, E-mail:, E-mail:, E-mail: [Kavli Institute for Theoretical Physics, Kohn Hall, University of California, 552 University Road, Santa Barbara, CA, 93106 (United States)


    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.

  15. Constrained Sparse Galerkin Regression

    Loiseau, Jean-Christophe


    In this work, we demonstrate the use of sparse regression techniques from machine learning to identify nonlinear low-order models of a fluid system purely from measurement data. In particular, we extend the sparse identification of nonlinear dynamics (SINDy) algorithm to enforce physical constraints in the regression, leading to energy conservation. The resulting models are closely related to Galerkin projection models, but the present method does not require the use of a full-order or high-fidelity Navier-Stokes solver to project onto basis modes. Instead, the most parsimonious nonlinear model is determined that is consistent with observed measurement data and satisfies necessary constraints. The constrained Galerkin regression algorithm is implemented on the fluid flow past a circular cylinder, demonstrating the ability to accurately construct models from data.

  16. Robust Sparse Analysis Regularization

    Vaiter, Samuel; Dossal, Charles; Fadili, Jalal


    This paper studies the properties of L1-analysis regularization for the resolution of linear inverse problems. Most previous works consider sparse synthesis priors where the sparsity is measured as the L1 norm of the coefficients that synthesize the signal in a given dictionary. In contrast, the more general analysis regularization minimizes the L1 norm of the correlations between the signal and the atoms in the dictionary. The corresponding variational problem includes several well-known regularizations such as the discrete total variation and the fused lasso. We first prove that a solution of analysis regularization is a piecewise affine function of the observations. Similarly, it is a piecewise affine function of the regularization parameter. This allows us to compute the degrees of freedom associated to sparse analysis estimators. Another contribution gives a sufficient condition to ensure that a signal is the unique solution of the analysis regularization when there is no noise in the observations. The s...

  17. Collaborative Hierarchical Sparse Modeling

    Sprechmann, Pablo; Sapiro, Guillermo; Eldar, Yonina C


    Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is done by solving an l_1-regularized linear regression problem, usually called Lasso. In this work we first combine the sparsity-inducing property of the Lasso model, at the individual feature level, with the block-sparsity property of the group Lasso model, where sparse groups of features are jointly encoded, obtaining a sparsity pattern hierarchically structured. This results in the hierarchical Lasso, which shows important practical modeling advantages. We then extend this approach to the collaborative case, where a set of simultaneously coded signals share the same sparsity pattern at the higher (group) level but not necessarily at the lower one. Signals then share the same active groups, or classes, but not necessarily the same active set. This is very well suited for applications such as source separation. An efficient optimization procedure, which guarantees convergence to the global opt...

  18. Sparse matrix test collections

    Duff, I.


    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.

  19. Neural associative memories and sparse coding.

    Palm, Günther


    The theoretical, practical and technical development of neural associative memories during the last 40 years is described. The importance of sparse coding of associative memory patterns is pointed out. The use of associative memory networks for large scale brain modeling is also mentioned.

  20. A Non-symmetric Digital Image Secure Communication Scheme Based on Generalized Chaos Synchronization System

    ZHANG Xiao-Hong; MIN Le-Quan


    Based on a generalized chaos synchronization system and a discrete Sinai map, a non-symmetric true color(RGB) digital image secur e communication scheme is proposed. The scheme first changes an ordinary RGB digital image with 8 bits into unrecognizable disorder codes and then transforms the disorder codes into an RGB digital image with 16 bits for transmitting. A receiver uses a non-symmetric key to verify the authentication of the received data origin,and decrypts the ciphertext. The scheme can encrypt and decrypt most formatted digital RGB images recognized by computers, and recover the plaintext almost without any errors. The scheme is suitable to be applied in network image communications. The analysis of the key space, sensitivity of key parameters, and correlation of encrypted images imply that this scheme has sound security.

  1. Two-Step Relaxation Newton Method for Nonsymmetric Algebraic Riccati Equations Arising from Transport Theory

    Shulin Wu


    Full Text Available We propose a new idea to construct an effective algorithm to compute the minimal positive solution of the nonsymmetric algebraic Riccati equations arising from transport theory. For a class of these equations, an important feature is that the minimal positive solution can be obtained by computing the minimal positive solution of a couple of fixed-point equations with vector form. Based on the fixed-point vector equations, we introduce a new algorithm, namely, two-step relaxation Newton, derived by combining two different relaxation Newton methods to compute the minimal positive solution. The monotone convergence of the solution sequence generated by this new algorithm is established. Numerical results are given to show the advantages of the new algorithm for the nonsymmetric algebraic Riccati equations in vector form.

  2. The Homogeneous Interior-Point Algorithm: Nonsymmetric Cones, Warmstarting, and Applications

    Skajaa, Anders

    algorithms for these problems is still limited. The goal of this thesis is to investigate and shed light on two computational aspects of homogeneous interior-point algorithms for convex conic optimization: The first part studies the possibility of devising a homogeneous interior-point method aimed at solving...... problems involving constraints that require nonsymmetric cones in their formulation. The second part studies the possibility of warmstarting the homogeneous interior-point algorithm for conic problems. The main outcome of the first part is the introduction of a completely new homogeneous interior......-point algorithm designed to solve nonsymmetric convex conic optimization problems. The algorithm is presented in detail and then analyzed. We prove its convergence and complexity. From a theoretical viewpoint, it is fully competitive with other algorithms and from a practical viewpoint, we show that it holds lots...

  3. Tailoring of the electrical and thermal properties using ultra-short period non-symmetric superlattices

    Komar, Paulina; Chávez-Ángel, Emigdio; Euler, Christoph; Balke, Benjamin; Kolb, Ute; Müller, Mathis M.; Kleebe, Hans-Joachim; Fecher, Gerhard H.; Jakob, Gerhard


    Thermoelectric modules based on half-Heusler compounds offer a cheap and clean way to create eco-friendly electrical energy from waste heat. Here we study the impact of the period composition on the electrical and thermal properties in non-symmetric superlattices, where the ratio of components varies according to (TiNiSn)n:(HfNiSn)6-n, and 0 ⩽ n ⩽ 6 unit cells. The thermal conductivity (κ) showed a strong dependence on the material content achieving a minimum value for n = 3, whereas the highest value of the figure of merit ZT was achieved for n = 4. The measured κ can be well modeled using non-symmetric strain relaxation applied to the model of the series of thermal resistances.

  4. Numerical procedures for solving nonsymmetric eigenvalue problems associated with optical resonators.

    Murphy, W D; Bernabe, M L


    The Prony method is extended to handle the nonsymmetric algebraic eigenvalue problem and improved to search automatically for the number of dominant eigenvalues. A simple iterative algorithm is given to compute the associated eigenvectors. Resolution studies using the QR method are made in order to determine the accuracy of the matrix approximation. Numerical results are given for both simple well defined resonators and more complex advanced designs containing multiple propagation geometries and misaligned mirrors.

  5. Generalized plane gravitational waves of non-symmetric unified field theories in plane symmetry

    Sanjiv R. Bhoyar


    Full Text Available In this paper we investigated the plane wave solutions of both the weak and strong non-symmetric unified field equations of Einstein and Bonner in a generalized plane symmetric space-time in the sense of Taub [Ann. Math. 53, 472 (1951] for plane gravitational waves. We show that the plane wave solutions of Einstein and Bonner field equations exist in plane symmetry.

  6. Semi-supervised sparse coding

    Wang, Jim Jing-Yan


    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.

  7. Compressed sensing & sparse filtering

    Carmi, Avishy Y; Godsill, Simon J


    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

  8. Neural Network for Sparse Reconstruction

    Qingfa Li


    Full Text Available We construct a neural network based on smoothing approximation techniques and projected gradient method to solve a kind of sparse reconstruction problems. Neural network can be implemented by circuits and can be seen as an important method for solving optimization problems, especially large scale problems. Smoothing approximation is an efficient technique for solving nonsmooth optimization problems. We combine these two techniques to overcome the difficulties of the choices of the step size in discrete algorithms and the item in the set-valued map of differential inclusion. In theory, the proposed network can converge to the optimal solution set of the given problem. Furthermore, some numerical experiments show the effectiveness of the proposed network in this paper.

  9. Sparse Empirical Bayes Analysis (SEBA)

    Bochkina, Natalia


    We consider a joint processing of $n$ independent sparse regression problems. Each is based on a sample $(y_{i1},x_{i1})...,(y_{im},x_{im})$ of $m$ \\iid observations from $y_{i1}=x_{i1}\\t\\beta_i+\\eps_{i1}$, $y_{i1}\\in \\R$, $x_{i 1}\\in\\R^p$, $i=1,...,n$, and $\\eps_{i1}\\dist N(0,\\sig^2)$, say. $p$ is large enough so that the empirical risk minimizer is not consistent. We consider three possible extensions of the lasso estimator to deal with this problem, the lassoes, the group lasso and the RING lasso, each utilizing a different assumption how these problems are related. For each estimator we give a Bayesian interpretation, and we present both persistency analysis and non-asymptotic error bounds based on restricted eigenvalue - type assumptions.

  10. Perturbing moments in a floating gyroscope with elastic device housing on a vibrating base in the case of a nonsymmetric end outflow

    Antsiferov, S. A.; Kondratov, D. V.; Mogilevich, L. I.


    The influence of elastic compliance of the float housing on the vibration perturbing moment in gyros with cylindrical floating suspension in the case of symmetric fluid outflow was studied in [1, 2]. It was shown that, for a sufficiently thick float housing made of a material of small density and large Young modulus, the influence of elastic compliance can be neglected, and one can assume that the float housing is absolutely rigid. In the case of collet fixation of the gyro at the working position, to ensure the heat withdrawal to the end faces, the device housing is constructed as an elastic cylindrical shell with rigid attachment on the end faces. The influence of the device housing elasticity in the case of symmetric fluid outflow through the end faces was considered in [3], and the influence of the nonsymmetric fluid outflow through the end faces for the case of a rigid device housing was studied in [4]. We consider the influence of the perturbing moment of the floating gyroscope with elastic device housing in the case of nonsymmetric fluid outflow through the ends on a vibrating base in the case of translational and angular vibrations of the base. We show that the elasticity of the device housing and the nonsymmetry of the fluid outflow significantly affect the hydrodynamic perturbing moment.

  11. Greedy algorithms for high-dimensional non-symmetric linear problems***

    Cancès E.


    Full Text Available In this article, we present a family of numerical approaches to solve high-dimensional linear non-symmetric problems. The principle of these methods is to approximate a function which depends on a large number of variates by a sum of tensor product functions, each term of which is iteratively computed via a greedy algorithm ? . There exists a good theoretical framework for these methods in the case of (linear and nonlinear symmetric elliptic problems. However, the convergence results are not valid any more as soon as the problems under consideration are not symmetric. We present here a review of the main algorithms proposed in the literature to circumvent this difficulty, together with some new approaches. The theoretical convergence results and the practical implementation of these algorithms are discussed. Their behaviors are illustrated through some numerical examples. Dans cet article, nous présentons une famille de méthodes numériques pour résoudre des problèmes linéaires non symétriques en grande dimension. Le principe de ces approches est de représenter une fonction dépendant d’un grand nombre de variables sous la forme d’une somme de fonctions produit tensoriel, dont chaque terme est calculé itérativement via un algorithme glouton ? . Ces méthodes possèdent de bonnes propriétés théoriques dans le cas de problèmes elliptiques symétriques (linéaires ou non linéaires, mais celles-ci ne sont plus valables dès lors que les problèmes considérés ne sont plus symétriques. Nous présentons une revue des principaux algorithmes proposés dans la littérature pour contourner cette difficulté ainsi que de nouvelles approches que nous proposons. Les résultats de convergence théoriques et la mise en oeuvre pratique de ces algorithmes sont détaillés et leur comportement est illustré au travers d’exemples numériques.

  12. Subspace Iteration Method for Complex Eigenvalue Problems with Nonsymmetric Matrices in Aeroelastic System

    Pak, Chan-gi; Lung, Shu


    Modern airplane design is a multidisciplinary task which combines several disciplines such as structures, aerodynamics, flight controls, and sometimes heat transfer. Historically, analytical and experimental investigations concerning the interaction of the elastic airframe with aerodynamic and in retia loads have been conducted during the design phase to determine the existence of aeroelastic instabilities, so called flutter .With the advent and increased usage of flight control systems, there is also a likelihood of instabilities caused by the interaction of the flight control system and the aeroelastic response of the airplane, known as aeroservoelastic instabilities. An in -house code MPASES (Ref. 1), modified from PASES (Ref. 2), is a general purpose digital computer program for the analysis of the closed-loop stability problem. This program used subroutines given in the International Mathematical and Statistical Library (IMSL) (Ref. 3) to compute all of the real and/or complex conjugate pairs of eigenvalues of the Hessenberg matrix. For high fidelity configuration, these aeroelastic system matrices are large and compute all eigenvalues will be time consuming. A subspace iteration method (Ref. 4) for complex eigenvalues problems with nonsymmetric matrices has been formulated and incorporated into the modified program for aeroservoelastic stability (MPASES code). Subspace iteration method only solve for the lowest p eigenvalues and corresponding eigenvectors for aeroelastic and aeroservoelastic analysis. In general, the selection of p is ranging from 10 for wing flutter analysis to 50 for an entire aircraft flutter analysis. The application of this newly incorporated code is an experiment known as the Aerostructures Test Wing (ATW) which was designed by the National Aeronautic and Space Administration (NASA) Dryden Flight Research Center, Edwards, California to research aeroelastic instabilities. Specifically, this experiment was used to study an instability

  13. Direct Solutions of Large, Sparse Linear Systems


    kiV W 2 Z.J@ gi z1 " ~Z iO P- I-SrP--NX VAJ 0 S Ci 0-4q., 4g ’’ p..CD wi I X I-- X X( 0 a. CD "M=0 4 W- W4 M maCJ P.-~ 4 4 r^ = = = obb 0I’ P4IUP so. Cat...r ;•i glll ,•-~l .j- , I• UNCLASSI FIED SECURIT ’, CLASSIFICATION OF THIS PAGE("Whw Does En.o ,,d) The performance comparison involves a wide rang of

  14. Sparse Hashing Tracking.

    Zhang, Lihe; Lu, Huchuan; Du, Dandan; Liu, Luning


    In this paper, we propose a novel tracking framework based on a sparse and discriminative hashing method. Different from the previous work, we treat object tracking as an approximate nearest neighbor searching process in a binary space. Using the hash functions, the target templates and the candidates can be projected into the Hamming space, facilitating the distance calculation and tracking efficiency. First, we integrate both the inter-class and intra-class information to train multiple hash functions for better classification, while most classifiers in previous tracking methods usually neglect the inter-class correlation, which may cause the inaccuracy. Then, we introduce sparsity into the hash coefficient vectors for dynamic feature selection, which is crucial to select the discriminative and stable features to adapt to visual variations during the tracking process. Extensive experiments on various challenging sequences show that the proposed algorithm performs favorably against the state-of-the-art methods.

  15. Group-based sparse representation for image restoration.

    Zhang, Jian; Zhao, Debin; Gao, Wen


    Traditional patch-based sparse representation modeling of natural images usually suffer from two problems. First, it has to solve a large-scale optimization problem with high computational complexity in dictionary learning. Second, each patch is considered independently in dictionary learning and sparse coding, which ignores the relationship among patches, resulting in inaccurate sparse coding coefficients. In this paper, instead of using patch as the basic unit of sparse representation, we exploit the concept of group as the basic unit of sparse representation, which is composed of nonlocal patches with similar structures, and establish a novel sparse representation modeling of natural images, called group-based sparse representation (GSR). The proposed GSR is able to sparsely represent natural images in the domain of group, which enforces the intrinsic local sparsity and nonlocal self-similarity of images simultaneously in a unified framework. In addition, an effective self-adaptive dictionary learning method for each group with low complexity is designed, rather than dictionary learning from natural images. To make GSR tractable and robust, a split Bregman-based technique is developed to solve the proposed GSR-driven ℓ0 minimization problem for image restoration efficiently. Extensive experiments on image inpainting, image deblurring and image compressive sensing recovery manifest that the proposed GSR modeling outperforms many current state-of-the-art schemes in both peak signal-to-noise ratio and visual perception.

  16. Robust Face Recognition Via Gabor Feature and Sparse Representation

    Hao Yu-Juan


    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.

  17. Parallel Sparse Matrix - Vector Product

    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...

  18. Sparse Matrix Vector Processing Formats

    Stathis, P.T.


    In this dissertation we have identified vector processing shortcomings related to the efficient storing and processing of sparse matrices. To alleviate existent problems we propose two storage formats denoted as Block Based Compression Storage (BBCS) format and Hierarchical Sparse Matrix (HiSM) stor

  19. Parallel Sparse Matrix - Vector Product

    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...

  20. Measurement Design for Detecting Sparse Signals

    Zahedi, Ramin; Pezeshki, Ali; Chong, Edwin K. P.


    We consider the problem of testing for the presence (or detection) of an unknown sparse signal in additive white noise. Given a fixed measurement budget, much smaller than the dimension of the signal, we consider the general problem of designing compressive measurements to maximize the measurement signal-to-noise ratio (SNR), as increasing SNR improves the detection performance in a large class of detectors. We use a lexicographic optimization approach, where the optimal measurement design fo...

  1. Universal Sparse Modeling

    Ramirez, Ignacio


    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. In this work, we use tools from information theory, and in particular universal coding theory, to propose a framework for designing sparsity regularization terms which have several theoretical and practical advantages when compared to the more standard l0 or l1 ones, and which lead to improved coding performance and accuracy in reconstruction and classification tasks. We also report on further improvements obtained by imposing low mutual coherence and Gram matrix norm on the corresponding learned dictionaries. The presentation of the framework and theoretical foundations is complemented with examples in image denoising and c...

  2. Computer assisted proofs for nonsymmetric planar choreographies and for stability of the Eight

    Kapela, Tomasz; Simó, Carles


    We present a general method to produce computer assisted proofs of the existence of choreographies in the N-body problem. This method allows us to verify rigorously numerical data from computer simulations. As an example we use it to prove the existence of nonsymmetric choreographies with six and seven bodies. The method provides estimates for the initial conditions and for the monodromy matrix of the choreography. These data are used to show linear stability of the Eight solution restricted to the plane and zero angular momentum motions.

  3. On a Non-Symmetric Eigenvalue Problem Governing Interior Structural–Acoustic Vibrations

    Heinrich Voss


    Full Text Available Small amplitude vibrations of a structure completely filled with a fluid are considered. Describing the structure by displacements and the fluid by its pressure field, the free vibrations are governed by a non-self-adjoint eigenvalue problem. This survey reports on a framework for taking advantage of the structure of the non-symmetric eigenvalue problem allowing for a variational characterization of its eigenvalues. Structure-preserving iterative projection methods of the the Arnoldi and of the Jacobi–Davidson type and an automated multi-level sub-structuring method are reviewed. The reliability and efficiency of the methods are demonstrated by a numerical example.

  4. A note on a one-parameter family of non-symmetric number triangles

    Maria Irene Falcão


    Full Text Available The recent growing interest in special Clifford algebra valued polynomial solutions of generalized Cauchy-Riemann systems in \\((n + 1\\-dimensional Euclidean spaces suggested a detailed study of the arithmetical properties of their coefficients, due to their combinatoric relevance. This concerns, in particular, a generalized Appell sequence of homogeneous polynomials whose coefficient set can be treated as a one-parameter family of non-symmetric triangles of fractions. The discussion of its properties, similar to those of the ordinary Pascal triangle (which itself does not belong to the family, is carried out in this paper.

  5. The PLSI Method of Stabilizing Two-Dimensional Nonsymmetric Half-Plane Recursive Digital Filters

    Gangatharan N; Reddy PS


    Two-dimensional (2D) recursive digital filters find applications in image processing as in medical X-ray processing. Nonsymmetric half-plane (NSHP) filters have definitely positive magnitude characteristics as opposed to quarter-plane (QP) filters. In this paper, we provide methods for stabilizing the given 2D NSHP polynomial by the planar least squares inverse (PLSI) method. We have proved in this paper that if the given 2D unstable NSHP polynomial and its PLSI are of the same degree, the P...

  6. A Projected Conjugate Gradient Method for Sparse Minimax Problems

    Madsen, Kaj; Jonasson, Kristjan


    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...

  7. In Defense of Sparse Tracking: Circulant Sparse Tracker

    Zhang, Tianzhu


    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.

  8. Nonlocally Centralized Simultaneous Sparse Coding

    雷阳; 宋占杰


    The concept of structured sparse coding noise is introduced to exploit the spatial correlations and nonlo-cal constraint of the local structure. Then the model of nonlocally centralized simultaneous sparse coding(NC-SSC)is proposed for reconstructing the original image, and an algorithm is proposed to transform the simultaneous sparse coding into reweighted low-rank approximation. Experimental results on image denoisng, deblurring and super-resolution demonstrate the advantage of the proposed NC-SSC method over the state-of-the-art image resto-ration methods.

  9. Out-of-Core Solutions of Complex Sparse Linear Equations

    Yip, E. L.


    ETCLIB is library of subroutines for obtaining out-of-core solutions of complex sparse linear equations. Routines apply to dense and sparse matrices too large to be stored in core. Useful for solving any set of linear equations, but particularly useful in cases where coefficient matrix has no special properties that guarantee convergence with any of interative processes. The only assumption made is that coefficient matrix is not singular.

  10. Approximate Sparse Regularized Hyperspectral Unmixing

    Chengzhi Deng


    Full Text Available Sparse regression based unmixing has been recently proposed to estimate the abundance of materials present in hyperspectral image pixel. In this paper, a novel sparse unmixing optimization model based on approximate sparsity, namely, approximate sparse unmixing (ASU, is firstly proposed to perform the unmixing task for hyperspectral remote sensing imagery. And then, a variable splitting and augmented Lagrangian algorithm is introduced to tackle the optimization problem. In ASU, approximate sparsity is used as a regularizer for sparse unmixing, which is sparser than l1 regularizer and much easier to be solved than l0 regularizer. Three simulated and one real hyperspectral images were used to evaluate the performance of the proposed algorithm in comparison to l1 regularizer. Experimental results demonstrate that the proposed algorithm is more effective and accurate for hyperspectral unmixing than state-of-the-art l1 regularizer.

  11. Object tracking by occlusion detection via structured sparse learning

    Zhang, Tianzhu


    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.

  12. An iris recognition method based on multi-orientation features and Non-symmetrical SVM

    GU Hong-ying; ZHUANG Yue-ting; PAN Yun-he


    A new iris feature extraction approach using both spatial and frequency domain is presented. Steerable pyramid is adopted to get the orientation information on iris images. The feature sequence is extracted on each sub-image and used to train Support Vector Machine (SVM) as iris classifiers. SVM has drawn great interest recently as one of the best classifiers in machine learning, although there is a problem in the use of traditional SVM for iris recognition. It cannot treat False Accept and False Reject differently with different security requirements. Therefore, a new kind of SVM called Non-symmetrical SVM is presented to classify the iris features. Experimental data shows that Non-symmetrical SVM can satisfy various security requirements in iris recognition applications. Feature sequence combined with spatial and frequency domain represents the variation details of the iris patterns properly. The results in this study demonstrate the potential of our new approach, and show that it performs more satisfactorily when compared to former algorithms.

  13. A Non-symmetric Digital Image Secure Communication Scheme Based on Generalized Chaos Synchronization System

    Zhang, Xiao-Hong; Min, Le-Quan


    Based on a generalized chaos synchronization system and a discrete Sinai map, a non-symmetric true color (RGB) digital image secure communication scheme is proposed. The scheme first changes an ordinary RGB digital image with 8 bits into unrecognizable disorder codes and then transforms the disorder codes into an RGB digital image with 16 bits for transmitting. A receiver uses a non-symmetric key to verify the authentication of the received data origin, and decrypts the ciphertext. The scheme can encrypt and decrypt most formatted digital RGB images recognized by computers, and recover the plaintext almost without any errors. The scheme is suitable to be applied in network image communications. The analysis of the key space, sensitivity of key parameters, and correlation of encrypted images imply that this scheme has sound security. The project supported by National Natural Science Foundation of China under Grant Nos. 60074034 and 70271068, the Foundation for University Key Teachers, and the Research Fund for the Doctoral Program of Higher Education under Grant No. 20020008004 by the Ministry of Education of China

  14. Finding communities in sparse networks

    Singh, Abhinav


    Spectral algorithms based on matrix representations of networks are often used to detect communities but classic spectral methods based on the adjacency matrix and its variants fail to detect communities in sparse networks. New spectral methods based on non-backtracking random walks have recently been introduced that successfully detect communities in many sparse networks. However, the spectrum of non-backtracking random walks ignores hanging trees in networks that can contain information about the community structure of networks. We introduce the reluctant backtracking operators that explicitly account for hanging trees as they admit a small probability of returning to the immediately previous node unlike the non-backtracking operators that forbid an immediate return. We show that the reluctant backtracking operators can detect communities in certain sparse networks where the non-backtracking operators cannot while performing comparably on benchmark stochastic block model networks and real world networks. We...

  15. Bayesian anti-sparse coding

    Elvira, Clément; Dobigeon, Nicolas


    Sparse representations have proven their efficiency in solving a wide class of inverse problems encountered in signal and image processing. Conversely, enforcing the information to be spread uniformly over representation coefficients exhibits relevant properties in various applications such as digital communications. Anti-sparse regularization can be naturally expressed through an $\\ell_{\\infty}$-norm penalty. This paper derives a probabilistic formulation of such representations. A new probability distribution, referred to as the democratic prior, is first introduced. Its main properties as well as three random variate generators for this distribution are derived. Then this probability distribution is used as a prior to promote anti-sparsity in a Gaussian linear inverse problem, yielding a fully Bayesian formulation of anti-sparse coding. Two Markov chain Monte Carlo (MCMC) algorithms are proposed to generate samples according to the posterior distribution. The first one is a standard Gibbs sampler. The seco...

  16. Sparse Linear Identifiable Multivariate Modeling

    Henao, Ricardo; Winther, Ole


    In this paper we consider sparse and identifiable linear latent variable (factor) and linear Bayesian network models for parsimonious analysis of multivariate data. We propose a computationally efficient method for joint parameter and model inference, and model comparison. It consists of a fully...... Bayesian hierarchy for sparse models using slab and spike priors (two-component δ-function and continuous mixtures), non-Gaussian latent factors and a stochastic search over the ordering of the variables. The framework, which we call SLIM (Sparse Linear Identifiable Multivariate modeling), is validated...... and bench-marked on artificial and real biological data sets. SLIM is closest in spirit to LiNGAM (Shimizu et al., 2006), but differs substantially in inference, Bayesian network structure learning and model comparison. Experimentally, SLIM performs equally well or better than LiNGAM with comparable...

  17. Sparse Representations of Hyperspectral Images

    Swanson, Robin J.


    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.

  18. 2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties

    Vazirani, Vijay V


    The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that each 2-player game whose convex program has linear constraints, admits a rational solution and such a solution can be found in polynomial time using only an LP solver. If in addition, the game is succinct, i.e., the coefficients in its convex program are ``small'', then its solution can be found in strongly polynomial time. We also give a non-succinct linear game whose solution can be found in strongly polynomial time. The notion of flexible budget markets, introduced in \\cite{va.NB}, plays a crucial role in the design of these algorithms.

  19. Experimental study of noncontact ultrasonic motor with non-symmetrical electrode

    Yang Bin; Liu Jing-Quan; Chen Di; Zhou Wei-Min; Cai Bing-Chu


    We have proposed a novel noncontact ultrasonic motor based on non-symmetrical electrode driving. The configuration of this electrode and the fabrication process of rotors are presented. Its vibration characteristics are computed and analysed by using the finite element method and studied experimentally. Good agreement between them is obtained. Moreover, it is also shown that this noncontact ultrasonic motor is operated in antisymmetric radial vibration mode of B21 mode. The maximum revolution speed for three-blade and six-blade rotors are 5100 and 3700r/min at an input voltage of 20V, respectively. Also, the noncontact high-speed revolution of the rotors can be realized by the parts of Ⅰ, Ⅲ of the electrode or Ⅱ, Ⅳ of the electrode. The levitation distance between the stator and rotor is about 140/μm according to the theoretical calculation and the experimental measurement.

  20. Nonsymmetric unified theory of gravitation, electromagnetism and Yang-Mills field

    Ragusa, S [Departamento de Fisica e Informatica, Instituto de Fisica de Sao Carlos, Universidade de Sao Paulo, CP 369, 13560-970 Sao Carlos, SP (Brazil)


    The recently studied new variation of Einstein's metric nonsymmetric unified field theory of gravitation and electromagnetism is enlarged to include the Yang-Mills field theory. It is shown that the antisymmetric part of the metric tensor, now a 2x2 matrix, can be made to describe both a field obeying Maxwell's equations and a field obeying Yang-Mills's field equations in the flat space linear approximation, thereby making its identification with the sum of a generalized electromagnetic and isotopic field strength tensors a possibly consistent procedure. The theory is shown to be free of unphysical ghost-negative energy radiative modes even when expanded on a curved Riemannian background. The Einstein-Maxwell-Yang-Mills theory is contained in the first approximation of the field equations on a curved general relativity background.

  1. The simple production of nonsymmetric quaterpyridines through Kröhnke pyridine synthesis

    Isabelle Sasaki


    Full Text Available Quaterpyridines have been demonstrated to be useful building blocks in metallo-supramolecular chemistry; however, their synthesis requires the preparation of sensitive building blocks. We present here three examples of nonsymmetric quaterpyridines that were easily obtained in yields of 70–85% by condensation of commercially available enones with 6-acetyl-2,2’:6’,2’’-terpyridine through a Kröhnke pyridine synthesis. Easy access to 6-acetyl-2,2’:6’,2’’-terpyridine starting from 2,6-diacetylpyridine and 2-acetylpyridine is described. The X-ray analysis of a chiral quaterpyridine and its Pt(II complex is presented.

  2. A subspace shift technique for solving close-to-critical nonsymmetric algebraic Riccati equations

    Iannazzo, Bruno


    The worst situation in computing the minimal nonnegative solution $X_*$ of a nonsymmetric algebraic Riccati equation $\\mathcal R(X)=0$ associated with an M-matrix occurs when the derivative of $\\mathcal R$ at $X_*$ is near to a singular matrix. When the derivative of $\\mathcal R$ at $X_*$ is singular, the problem is ill-conditioned and the convergence of the algorithms based on matrix iterations is slow; however, there exist some techniques to remove the singularity and restore well-conditioning and fast convergence. This phenomenon is partially shown also in the close-to-critical case, but the techniques used for the null recurrent case cannot be applied to this setting. We present a new method to accelerate the convergence and amend the conditioning in close-to-critical cases. The numerical experiments confirm the efficiency of the new method.

  3. Rotators for matching non-symmetric ion-therapy beams to rotating gantries

    Pavlovič, Márius; Bokor, Jozef; Šagátová, Andrea


    The paper deals with special ion-optical matching sections called “rotators” for matching non-symmetric beams to rotating ion-therapy gantries. General matrix analysis of the problem is formulated resulting in a specific set of ion-optical constraints that must be fulfilled by the rotator transfer matrix. Possible ways of fitting these ion-optical constraints are discussed and illustrated by several examples of suitable rotator lattices. Each lattice is representing a different type of rotator, e.g. point-to-point imaging lattice or parallel-to-point imaging lattice. Optimization of the rotator lattice with respect to its total length is discussed, and the most compact solutions are presented as well.

  4. A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems

    Chan, Tony; Szeto, Tedd


    We propose a new and more stable variant of the CGS method [27] for solving nonsymmetric linear systems. The method is based on squaring the Composite Step BCG method, introduced recently by Bank and Chan [1,2], which itself is a stabilized variant of BCG in that it skips over steps for which the BCG iterate is not defined and causes one kind of breakdown in BCG. By doing this, we obtain a method (Composite Step CGS or CSCGS) which not only handles the breakdowns described above, but does so with the advantages of CGS, namely, no multiplications by the transpose matrix and a faster convergence rate than BCG. Our strategy for deciding whether to skip a step does not involve any machine dependent parameters and is designed to skip near breakdowns as well as produce smoother iterates. Numerical experiments show that the new method does produce improved performance over CGS on practical problems.

  5. Probabilistic teleportation of a non-symmetric three-particle state

    Chen Xiu-Bo; Wen Qiao-Yan; Zhu Fu-Chen


    This paper proposes a scheme for teleporting a kind of essential three-particle non-symmetric entangled state,which is much more valuable than a GHZ and W state for some applications in quantum information processing. In comparison with previous proposal of teleportation, the resources of entangled states as quantum channel and the number of classical messages required by our scheme can be cut down. Moreover, it is shown that there exists a class of transformations which ensure the success of this scheme, because the two-particle transformation performed by the receiver in the course of teleportation may be a generic two-particle operation instead of a control-NOT (CNOT) operation. In addition, all kinds of transformations performed by sender and receiver are given in detail.

  6. The PLSI Method of Stabilizing Two-Dimensional Nonsymmetric Half-Plane Recursive Digital Filters

    Gangatharan N


    Full Text Available Two-dimensional (2D recursive digital filters find applications in image processing as in medical X-ray processing. Nonsymmetric half-plane (NSHP filters have definitely positive magnitude characteristics as opposed to quarter-plane (QP filters. In this paper, we provide methods for stabilizing the given 2D NSHP polynomial by the planar least squares inverse (PLSI method. We have proved in this paper that if the given 2D unstable NSHP polynomial and its PLSI are of the same degree, the PLSI polynomial is always stable, irrespective of whether the coefficients of the given polynomial have relationship among its coefficients or not. Examples are given for 2D first-order and second-order cases to prove our results. The generalization is done for the th order polynomial.

  7. Learn Sparse Dictionaries for Edit Propagation.

    Xiaowu Chen; Jianwei Li; Dongqing Zou; Qinping Zhao


    With the increasing availability of high-resolution images, videos, and 3D models, the demand for scalable large data processing techniques increases. We introduce a method of sparse dictionary learning for edit propagation of large input data. Previous approaches for edit propagation typically employ a global optimization over the whole set of pixels (or vertexes), incurring a prohibitively high memory and time-consumption for large input data. Rather than propagating an edit pixel by pixel, we follow the principle of sparse representation to obtain a representative and compact dictionary and perform edit propagation on the dictionary instead. The sparse dictionary provides an intrinsic basis for input data, and the coding coefficients capture the linear relationship between all pixels and the dictionary atoms. The learned dictionary is then optimized by a novel scheme, which maximizes the Kullback-Leibler divergence between each atom pair to remove redundant atoms. To enable local edit propagation for images or videos with similar appearance, a dictionary learning strategy is proposed by considering range constraint to better account for the global distribution of pixels in their feature space. We show several applications of the sparsity-based edit propagation, including video recoloring, theme editing, and seamless cloning, operating on both color and texture features. Our approach can also be applied to computer graphics tasks, such as 3D surface deformation. We demonstrate that with an atom-to-pixel ratio in the order of 0.01% signifying a significant reduction on memory consumption, our method still maintains a high degree of visual fidelity.

  8. Image understanding using sparse representations

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


    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

  9. Lower Bounds for Sparse Recovery

    Ba, Khanh Do; Price, Eric; Woodruff, David P


    We consider the following k-sparse recovery problem: design an m x n matrix A, such that for any signal x, given Ax we can efficiently recover x' satisfying ||x-x'||_1 <= C min_{k-sparse} x"} ||x-x"||_1. It is known that there exist matrices A with this property that have only O(k log (n/k)) rows. In this paper we show that this bound is tight. Our bound holds even for the more general /randomized/ version of the problem, where A is a random variable and the recovery algorithm is required to work for any fixed x with constant probability (over A).

  10. All scale-free networks are sparse.

    Del Genio, Charo I; Gross, Thilo; Bassler, Kevin E


    We study the realizability of scale-free networks with a given degree sequence, showing that the fraction of realizable sequences undergoes two first-order transitions at the values 0 and 2 of the power-law exponent. We substantiate this finding by analytical reasoning and by a numerical method, proposed here, based on extreme value arguments, which can be applied to any given degree distribution. Our results reveal a fundamental reason why large scale-free networks without constraints on minimum and maximum degree must be sparse.

  11. Abnormal Event Detection Using Local Sparse Representation

    Ren, Huamin; Moeslund, Thomas B.


    We propose to detect abnormal events via a sparse subspace clustering algorithm. Unlike most existing approaches, which search for optimized normal bases and detect abnormality based on least square error or reconstruction error from the learned normal patterns, we propose an abnormality measurem...... is found that satisfies: the distance between its local space and the normal space is large. We evaluate our method on two public benchmark datasets: UCSD and Subway Entrance datasets. The comparison to the state-of-the-art methods validate our method's effectiveness....

  12. Parallel preconditioning techniques for sparse CG solvers

    Basermann, A.; Reichel, B.; Schelthoff, C. [Central Institute for Applied Mathematics, Juelich (Germany)


    Conjugate gradient (CG) methods to solve sparse systems of linear equations play an important role in numerical methods for solving discretized partial differential equations. The large size and the condition of many technical or physical applications in this area result in the need for efficient parallelization and preconditioning techniques of the CG method. In particular for very ill-conditioned matrices, sophisticated preconditioner are necessary to obtain both acceptable convergence and accuracy of CG. Here, we investigate variants of polynomial and incomplete Cholesky preconditioners that markedly reduce the iterations of the simply diagonally scaled CG and are shown to be well suited for massively parallel machines.

  13. Modeling dinuclear copper sites of biological relevance - synthesis, molecular-structure, magnetic-properties, and h-1- nmr spectroscopy of a nonsymmetric dinuclear copper(ii) complex - microcalorimetric determination of stepwise complexation of copper(ii) by a nonsymmetric dinucleating ligand

    Lubben, M; Hage, R.; Meetsma, A.; Bijma, Koos; Feringa, B.L.


    The new nonsymmetric dinuclear copper(II) complex [Cu(2)L(1)(OAcW(ClO4) (7) was synthesized by complexation of Cu(OAc). H2O with a new nonsymmetric dinucleating ligand (5) which' is formed in situ by condensation of 2-formyl-6-((4-methylpiperazin-1-yl)methyl)phenol (3a) with 2-(aminoethyl)pyridine.

  14. Occlusion detection via structured sparse learning for robust object tracking

    Zhang, Tianzhu


    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.

  15. Efficient, sparse biological network determination

    Papachristodoulou Antonis


    Full Text Available Abstract Background Determining the interaction topology of biological systems is a topic that currently attracts significant research interest. Typical models for such systems take the form of differential equations that involve polynomial and rational functions. Such nonlinear models make the problem of determining the connectivity of biochemical networks from time-series experimental data much harder. The use of linear dynamics and linearization techniques that have been proposed in the past can circumvent this, but the general problem of developing efficient algorithms for models that provide more accurate system descriptions remains open. Results We present a network determination algorithm that can treat model descriptions with polynomial and rational functions and which does not make use of linearization. For this purpose, we make use of the observation that biochemical networks are in general 'sparse' and minimize the 1-norm of the decision variables (sum of weighted network connections while constraints keep the error between data and the network dynamics small. The emphasis of our methodology is on determining the interconnection topology rather than the specific reaction constants and it takes into account the necessary properties that a chemical reaction network should have – something that techniques based on linearization can not. The problem can be formulated as a Linear Program, a convex optimization problem, for which efficient algorithms are available that can treat large data sets efficiently and uncertainties in data or model parameters. Conclusion The presented methodology is able to predict with accuracy and efficiency the connectivity structure of a chemical reaction network with mass action kinetics and of a gene regulatory network from simulation data even if the dynamics of these systems are non-polynomial (rational and uncertainties in the data are taken into account. It also produces a network structure that can

  16. Diffusion Indexes with Sparse Loadings

    Kristensen, Johannes Tang

    to the problem by using the LASSO as a variable selection method to choose between the possible variables and thus obtain sparse loadings from which factors or diffusion indexes can be formed. This allows us to build a more parsimonious factor model which is better suited for forecasting compared...

  17. Language Recognition via Sparse Coding


    target language lT ) from the two pipelines. We can also think of more sophis- ticated fusion schemes on logistic regression and neural net - works. Table...vol. 16, no. 5, pp. 980–988, July 2008. [6] G. Sivaram, S. K. Nemala, M. Elhilali, T. D. Tran, and H. Herman- sky , “Sparse Coding for Speech

  18. Multiple Descriptions Using Sparse Decompositions

    Jensen, Tobias Lindstrøm; Østergaard, Jan; Dahl, Joachim


    In this paper, we consider the design of multiple descriptions (MDs) using sparse decompositions. In a description erasure channel only a subset of the transmitted descriptions is received. The MD problem concerns the design of the descriptions such that they individually approximate the source...

  19. Sparse decompositions in 'incoherent' dictionaries

    Gribonval, R.; Nielsen, Morten


    The purpose of this paper is to generalize a result by Donoho, Huo, Elad and Bruckstein on sparse representations of signals/images in a union of two orthonormal bases. We consider general (redundant) dictionaries in finite dimension, and derive sufficient conditions on a signal/image for having ...

  20. SparseAssembler: de novo Assembly with the Sparse de Bruijn Graph

    Ye, Chengxi; Ma,; Cannon, Charles H; Pop, Mihai; Yu, Douglas W


    de Bruijn graph-based algorithms are one of the two most widely used approaches for de novo genome assembly. A major limitation of this approach is the large computational memory space requirement to construct the de Bruijn graph, which scales with k-mer length and total diversity (N) of unique k-mers in the genome expressed in base pairs or roughly (2k+8)N bits. This limitation is particularly important with large-scale genome analysis and for sequencing centers that simultaneously process multiple genomes. We present a sparse de Bruijn graph structure, based on which we developed SparseAssembler that greatly reduces memory space requirements. The structure also allows us to introduce a novel method for the removal of substitution errors introduced during sequencing. The sparse de Bruijn graph structure skips g intermediate k-mers, therefore reducing the theoretical memory space requirement to ~(2k/g+8)N. We have found that a practical value of g=16 consumes approximately 10% of the memory required by standa...

  1. High-dimensional Sparse Precision Matrix Estimation via Sparse Column Inverse Operator

    Liu, Weidong


    This paper proposes a new method for estimating sparse precision matrices in the high dimensional setting. This procedure applies a novel Sparse Column-wise Inverse Operator (SCIO) to modified sample covariance matrices. We establish the convergence rates of this procedure under various matrix norms. Under the Frobenius norm loss, we prove theoretical guarantees on using cross validation to pick data-driven tunning parameters. Another important advantage of this estimator is its efficient computation for large-scale problems, using a path-following coordinate descent algorithm we provide. Numerical merits of our estimator are also illustrated using simulated and real datasets. In particular, this method is found to perform favorably on analyzing an HIV brain tissue dataset and an ADHD resting fMRI dataset.

  2. Sparse-posterior Gaussian Processes for general likelihoods

    Yuan,; Abdel-Gawad, Ahmed H; Minka, Thomas P


    Gaussian processes (GPs) provide a probabilistic nonparametric representation of functions in regression, classification, and other problems. Unfortunately, exact learning with GPs is intractable for large datasets. A variety of approximate GP methods have been proposed that essentially map the large dataset into a small set of basis points. Among them, two state-of-the-art methods are sparse pseudo-input Gaussian process (SPGP) (Snelson and Ghahramani, 2006) and variablesigma GP (VSGP) Walder et al. (2008), which generalizes SPGP and allows each basis point to have its own length scale. However, VSGP was only derived for regression. In this paper, we propose a new sparse GP framework that uses expectation propagation to directly approximate general GP likelihoods using a sparse and smooth basis. It includes both SPGP and VSGP for regression as special cases. Plus as an EP algorithm, it inherits the ability to process data online. As a particular choice of approximating family, we blur each basis point with a...

  3. Sparse Regression by Projection and Sparse Discriminant Analysis

    Qi, Xin


    © 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.




    In this paper,we present a kind of pre-symmetrizers for the nonsymmetric linear systems arising from the discretization of nonself-adjoint second order scalar elliptic equation.Based on combination these pre-symmetrizers with CG method,the new algorithm,LRSCG algorithm,is presented.The numerical results show that the LRSCG algorithm is better than BiCG,CGS,BiCGSTAB,GMRES,QMR and SGMRES methods for thses nonsymmetric linear systems.

  5. Stochastic convex sparse principal component analysis.

    Baytas, Inci M; Lin, Kaixiang; Wang, Fei; Jain, Anil K; Zhou, Jiayu


    Principal component analysis (PCA) is a dimensionality reduction and data analysis tool commonly used in many areas. The main idea of PCA is to represent high-dimensional data with a few representative components that capture most of the variance present in the data. However, there is an obvious disadvantage of traditional PCA when it is applied to analyze data where interpretability is important. In applications, where the features have some physical meanings, we lose the ability to interpret the principal components extracted by conventional PCA because each principal component is a linear combination of all the original features. For this reason, sparse PCA has been proposed to improve the interpretability of traditional PCA by introducing sparsity to the loading vectors of principal components. The sparse PCA can be formulated as an ℓ1 regularized optimization problem, which can be solved by proximal gradient methods. However, these methods do not scale well because computation of the exact gradient is generally required at each iteration. Stochastic gradient framework addresses this challenge by computing an expected gradient at each iteration. Nevertheless, stochastic approaches typically have low convergence rates due to the high variance. In this paper, we propose a convex sparse principal component analysis (Cvx-SPCA), which leverages a proximal variance reduced stochastic scheme to achieve a geometric convergence rate. We further show that the convergence analysis can be significantly simplified by using a weak condition which allows a broader class of objectives to be applied. The efficiency and effectiveness of the proposed method are demonstrated on a large-scale electronic medical record cohort.

  6. Adaptive fuzzy control with smooth inverse for nonlinear systems preceded by non-symmetric dead-zone

    Wang, Xingjian; Wang, Shaoping


    In this study, the adaptive output feedback control problem of a class of nonlinear systems preceded by non-symmetric dead-zone is considered. To cope with the possible control signal chattering phenomenon which is caused by non-smooth dead-zone inverse, a new smooth inverse is proposed for non-symmetric dead-zone compensation. For the systematic design procedure of the adaptive fuzzy control algorithm, we combine the backstepping technique and small-gain approach. The Takagi-Sugeno fuzzy logic systems are used to approximate unknown system nonlinearities. The closed-loop stability is studied by using small gain theorem and the closed-loop system is proved to be semi-globally uniformly ultimately bounded. Simulation results indicate that, compared to the algorithm with the non-smooth inverse, the proposed control strategy can achieve better tracking performance and the chattering phenomenon can be avoided effectively.

  7. Image Deblurring and Super-resolution by Adaptive Sparse Domain Selection and Adaptive Regularization

    Dong, Weisheng; Shi, Guangming; Wu, Xiaolin


    As a powerful statistical image modeling technique, sparse representation has been successfully used in various image restoration applications. The success of sparse representation owes to the development of l1-norm optimization techniques, and the fact that natural images are intrinsically sparse in some domain. The image restoration quality largely depends on whether the employed sparse domain can represent well the underlying image. Considering that the contents can vary significantly across different images or different patches in a single image, we propose to learn various sets of bases from a pre-collected dataset of example image patches, and then for a given patch to be processed, one set of bases are adaptively selected to characterize the local sparse domain. We further introduce two adaptive regularization terms into the sparse representation framework. First, a set of autoregressive (AR) models are learned from the dataset of example image patches. The best fitted AR models to a given patch are ad...

  8. Generalized sparse regularization with application to fMRI brain decoding.

    Ng, Bernard; Abugharbieh, Rafeef


    Many current medical image analysis problems involve learning thousands or even millions of model parameters from extremely few samples. Employing sparse models provides an effective means for handling the curse of dimensionality, but other propitious properties beyond sparsity are typically not modeled. In this paper, we propose a simple approach, generalized sparse regularization (GSR), for incorporating domain-specific knowledge into a wide range of sparse linear models, such as the LASSO and group LASSO regression models. We demonstrate the power of GSR by building anatomically-informed sparse classifiers that additionally model the intrinsic spatiotemporal characteristics of brain activity for fMRI classification. We validate on real data and show how prior-informed sparse classifiers outperform standard classifiers, such as SVM and a number of sparse linear classifiers, both in terms of prediction accuracy and result interpretability. Our results illustrate the added-value in facilitating flexible integration of prior knowledge beyond sparsity in large-scale model learning problems.

  9. Recovery of Sparsely Corrupted Signals

    Studer, Christoph; Pope, Graeme; Bölcskei, Helmut


    We investigate the recovery of signals exhibiting a sparse representation in a general (i.e., possibly redundant or incomplete) dictionary that are corrupted by additive noise admitting a sparse representation in another general dictionary. This setup covers a wide range of applications, such as image inpainting, super-resolution, signal separation, and recovery of signals that are impaired by, e.g., clipping, impulse noise, or narrowband interference. We present deterministic recovery guarantees based on a novel uncertainty relation for pairs of general dictionaries and we provide corresponding practicable recovery algorithms. The recovery guarantees we find depend on the signal and noise sparsity levels, on the coherence parameters of the involved dictionaries, and on the amount of prior knowledge on the support sets of signal and noise. We finally identify situations under which the recovery guarantees are tight.

  10. Sparse modeling of spatial environmental variables associated with asthma.

    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


    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.

  11. Sparse Similarity-Based Fisherfaces

    Fagertun, Jens; Gomez, David Delgado; Hansen, Mads Fogtmann;


    In this work, the effect of introducing Sparse Principal Component Analysis within the Similarity-based Fisherfaces algorithm is examined. The technique aims at mimicking the human ability to discriminate faces by projecting the faces in a highly discriminative and easy interpretative way. Pixel...... obtain the same recognition results as the technique in a dense version using only a fraction of the input data. Furthermore, the presented results suggest that using SPCA in the technique offers robustness to occlusions....

  12. Parallel Solutions for Large—Scale General Sparse Nonlinear Systems of Equations



    In solving application problems,many large-scale nonlinear systems of equaions result in sparse Jacobian matrices.Such nonlinear systems are called sparse nonlinear systems.The irregularity of the locations of nonzrero elements of a general sparse matrix makes it very difficult to generally map sparse matrix computations to multiprocessors for parallel processing in a well balanced manner.To overcome this difficulty,we define a new storage scheme for general sparse matrices in this paper,With the new storage scheme,we develop parallel algorithms to solve large-scale general sparse systems of equations by interval Newton/Generalized bisection methods which reliably find all numerical solutions within a given domain.I n Section 1,we provide an introduction to the addressed problem and the interval Newton's methods.In Section 2,some currently used storage schemes for sparse systems are reviewed.In Section 3,new index schemes to store general sparse matrices are reported.In Section 4,we present a parallel algorithm to evaluate a general sparse Jacobian matrix.In Section 5,we present a parallel algorithm to solve the corresponding interval linear system by the all-row preconditioned scheme.Conclusions and future work are discussed in Section 6.

  13. Semisupervised Sparse Multilinear Discriminant Analysis

    黄锴; 张丽清


    Various problems are encountered when adopting ordinary vector space algorithms for high-order tensor data input. Namely, one must overcome the Small Sample Size (SSS) and overfitting problems. In addition, the structural information of the original tensor signal is lost during the vectorization process. Therefore, comparable methods using a direct tensor input are more appropriate. In the case of electrocardiograms (ECGs), another problem must be overcome;the manual diagnosis of ECG data is expensive and time consuming, rendering it difficult to acquire data with diagnosis labels. However, when effective features for classification in the original data are very sparse, we propose a semisupervised sparse multilinear discriminant analysis (SSSMDA) method. This method uses the distribution of both the labeled and the unlabeled data together with labels discovered through a label propagation algorithm. In practice, we use 12-lead ECGs collected from a remote diagnosis system and apply a short-time-fourier transformation (STFT) to obtain third-order tensors. The experimental results highlight the sparsity of the ECG data and the ability of our method to extract sparse and effective features that can be used for classification.

  14. Exact dynamic stiffness matrix of non-symmetric thin-walled curved beams subjected to initial axial force

    Nam-Il, Kim; Moon-Young, Kim


    An improved numerical method to exactly evaluate the dynamic element stiffness matrix is proposed for the spatially coupled free vibration analysis of non-symmetric thin-walled curved beams subjected to uniform axial force. For this purpose, firstly equations of motion, boundary conditions and force-deformation relations are rigorously derived from the total potential energy for a curved beam element. Next systems of linear algebraic equations with non-symmetric matrices are constructed by introducing 14 displacement parameters and transforming the fourth-order simultaneous differential equations into the first-order simultaneous equations. And then explicit expressions for displacement parameters are numerically evaluated via eigensolutions and the exact 14×14 element stiffness matrix is determined using force-deformation relations. In order to demonstrate the validity and the accuracy of this study, the spatially coupled natural frequencies of non-symmetric thin-walled curved beams subjected to uniform compressive and tensile forces are evaluated and compared with analytical and finite element solutions using Hermitian curved beam elements or ABAQUS's shell element. In addition, some results by the parametric study are reported.

  15. A Frisch-Newton Algorithm for Sparse Quantile Regression

    Roger Koenker; Pin Ng


    Recent experience has shown that interior-point methods using a log barrier approach are far superior to classical simplex methods for computing solutions to large parametric quantile regression problems.In many large empirical applications, the design matrix has a very sparse structure. A typical example is the classical fixed-effect model for panel data where the parametric dimension of the model can be quite large, but the number of non-zero elements is quite small. Adopting recent developments in sparse linear algebra we introduce a modified version of the Frisch-Newton algorithm for quantile regression described in Portnoy and Koenker[28].The new algorithm substantially reduces the storage (memory) requirements and increases computational speed.The modified algorithm also facilitates the development of nonparametric quantile regression methods. The pseudo design matrices employed in nonparametric quantile regression smoothing are inherently sparse in both the fidelity and roughness penalty components. Exploiting the sparse structure of these problems opens up a whole range of new possibilities for multivariate smoothing on large data sets via ANOVA-type decomposition and partial linear models.

  16. Term extraction from sparse, ungrammatical domain-specific documents

    Ittoo, Ashwin; Bouma, Gosse


    Existing term extraction systems have predominantly targeted large and well-written document collections, which provide reliable statistical and linguistic evidence to support term extraction. In this article, we address the term extraction challenges posed by sparse, ungrammatical texts with domain

  17. Recursive nearest neighbor search in a sparse and multiscale domain for comparing audio signals

    Sturm, Bob L.; Daudet, Laurent


    We investigate recursive nearest neighbor search in a sparse domain at the scale of audio signals. Essentially, to approximate the cosine distance between the signals we make pairwise comparisons between the elements of localized sparse models built from large and redundant multiscale dictionaries...

  18. Fast Sparse Level Sets on Graphics Hardware.

    Jalba, Andrei C; van der Laan, Wladimir J; Roerdink, Jos B T M


    The level-set method is one of the most popular techniques for capturing and tracking deformable interfaces. Although level sets have demonstrated great potential in visualization and computer graphics applications, such as surface editing and physically based modeling, their use for interactive simulations has been limited due to the high computational demands involved. In this paper, we address this computational challenge by leveraging the increased computing power of graphics processors, to achieve fast simulations based on level sets. Our efficient, sparse GPU level-set method is substantially faster than other state-of-the-art, parallel approaches on both CPU and GPU hardware. We further investigate its performance through a method for surface reconstruction, based on GPU level sets. Our novel multiresolution method for surface reconstruction from unorganized point clouds compares favorably with recent, existing techniques and other parallel implementations. Finally, we point out that both level-set computations and rendering of level-set surfaces can be performed at interactive rates, even on large volumetric grids. Therefore, many applications based on level sets can benefit from our sparse level-set method.

  19. Measurement Design for Detecting Sparse Signals

    Zahedi, Ramin; Chong, Edwin K P


    We consider the problem of testing for the presence (or detection) of an unknown sparse signal in additive white noise. Given a fixed measurement budget, much smaller than the dimension of the signal, we consider the general problem of designing compressive measurements to maximize the measurement signal-to-noise ratio (SNR), as increasing SNR improves the detection performance in a large class of detectors. We use a lexicographic optimization approach, where the optimal measurement design for sparsity level $k$ is sought only among the set of measurement matrices that satisfy the optimality conditions for sparsity level k-1. We consider optimizing two different SNR criteria, namely a worst-case SNR measure, over all possible realizations of a k-sparse signal, and an average SNR measure with respect to a uniform distribution on the locations of the up to k nonzero entries in the signal. We establish connections between these two criteria and certain classes of tight frames. We constrain our measurement matric...

  20. A sparse matrix based full-configuration interaction algorithm.

    Rolik, Zoltán; Szabados, Agnes; Surján, Péter R


    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.

  1. Sparse microwave imaging: Principles and applications

    ZHANG BingChen; HONG Wen; WU YiRong


    This paper provides principles and applications of the sparse microwave imaging theory and technology.Synthetic aperture radar (SAR) is an important method of modern remote sensing.During decades microwave imaging technology has achieved remarkable progress in the system performance of microwave imaging technology,and at the same time encountered increasing complexity in system implementation.The sparse microwave imaging introduces the sparse signal processing theory to radar imaging to obtain new theory,new system and new methodology of microwave imaging.Based on classical SAR imaging model and fundamental theories of sparse signal processing,we can derive the model of sparse microwave imaging,which is a sparse measurement and recovery problem and can be solved with various algorithms.There exist several fundamental points that must be considered in the efforts of applying sparse signal processing to radar imaging,including sparse representation,measurement matrix construction,unambiguity reconstruction and performance evaluation.Based on these considerations,the sparse signal processing could be successfully applied to radar imaging,and achieve benefits in several aspects,including improvement of image quality,reduction of data amount for sparse scene and enhancement of system performance.The sparse signal processing has also been applied in several specific radar imaging applications.

  2. CUR from a Sparse Optimization Viewpoint

    Bien, Jacob; Mahoney, Michael W


    The CUR decomposition provides an approximation of a matrix $X$ that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span of only a few columns of $X$. In this regard, it appears to be similar to many sparse PCA methods. However, CUR takes a randomized algorithmic approach, whereas most sparse PCA methods are framed as convex optimization problems. In this paper, we try to understand CUR from a sparse optimization viewpoint. We show that CUR is implicitly optimizing a sparse regression objective and, furthermore, cannot be directly cast as a sparse PCA method. We also observe that the sparsity attained by CUR possesses an interesting structure, which leads us to formulate a sparse PCA method that achieves a CUR-like sparsity.

  3. Automatic landslide and mudflow detection method via multichannel sparse representation

    Chao, Chen; Zhou, Jianjun; Hao, Zhuo; Sun, Bo; He, Jun; Ge, Fengxiang


    Landslide and mudflow detection is an important application of aerial images and high resolution remote sensing images, which is crucial for national security and disaster relief. Since the high resolution images are often large in size, it's necessary to develop an efficient algorithm for landslide and mudflow detection. Based on the theory of sparse representation and, we propose a novel automatic landslide and mudflow detection method in this paper, which combines multi-channel sparse representation and eight neighbor judgment methods. The whole process of the detection is totally automatic. We make the experiment on a high resolution image of ZhouQu district of Gansu province in China on August, 2010 and get a promising result which proved the effective of using sparse representation on landslide and mudflow detection.

  4. On-the-fly Overlapping of Sparse Generations

    Sørensen, Chres Wiant; Roetter, Daniel Enrique Lucani; Fitzek, Frank


    Traditionally, the idea of overlapping generations in network coding research has focused on reducing the complexity of decoding large data files while maintaining the delay performance expected of a system that combines all data packets. However, the effort for encoding and decoding individual...... generations can still be quite high compared to other sparse coding approaches. This paper focuses on an inherently different approach that combines (i) sparsely coded generations configured on-the- fly based on (ii) controllable and infrequent feedback that allows the system to remove some original packets...... from the pool of packets to be mixed in the linear combinations. The latter is key to maintain a high impact of the coded packets received during the entire process while maintaining very sparsely coded generations. Interestingly, our proposed approach naturally bridges the idea of overlapping...

  5. Data analysis in high-dimensional sparse spaces

    Clemmensen, Line Katrine Harder

    The present thesis considers data analysis of problems with many features in relation to the number of observations (large p, small n problems). The theoretical considerations for such problems are outlined including the curses and blessings of dimensionality, and the importance of dimension...... reduction. In this context the trade off between a rich solution which answers the questions at hand and a simple solution which generalizes to unseen data is described. For all of the given data examples labelled output exists and the analyses are therefore limited to supervised settings. Three novel...... 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...

  6. Algorithms for Sparse Non-negative Tucker Decompositions

    Mørup, Morten; Hansen, Lars Kai


    There is a increasing interest in analysis of large scale multi-way data. The concept of multi-way data refers to arrays of data with more than two dimensions, i.e., taking the form of tensors. To analyze such data, decomposition techniques are widely used. The two most common decompositions...... decompositions). To reduce ambiguities of this type of decomposition we develop updates that can impose sparseness in any combination of modalities, hence, proposed algorithms for sparse non-negative Tucker decompositions (SN-TUCKER). We demonstrate how the proposed algorithms are superior to existing algorithms...... for Tucker decompositions when indeed the data and interactions can be considered non-negative. We further illustrate how sparse coding can help identify what model (PARAFAC or Tucker) is the most appropriate for the data as well as to select the number of components by turning off excess components...

  7. Experimental and theoretical studies of iterative methods for nonlinear, nonsymmetric systems arising in combustion

    Hagstrom, T. [Univ. of New Mexico, Albuquerque, NM (United States); Radhakrishnan, K. [Sverdrup Technology, Brook Park, OH (United States)


    The authors report on some iterative methods which they have tested for use in combustion simulations. In particular, they have developed a code to solve zero Mach number reacting flow equations with complex reaction and diffusion physics. These equations have the form of a nonlinear parabolic system coupled with constraints. In semi-discrete form, one obtains DAE`s of index two or three depending on the number of spatial dimensions. The authors have implemented a fourth order (fully implicit) BDF method in time, coupled with a suite of fourth order explicit and implicit spatial difference approximations. Most codes they know of for simulating reacting flows use a splitting strategy to march in time. This results in a sequence of nonlinear systems to solve, each of which has a simpler structure than the one they are faced with. The rapid and robust solution of the coupled system is the essential requirement for the success of their approach. They have implemented and analyzed nonlinear generalizations of conjugate gradient-like methods for nonsymmetric systems, including CGS and the quasi-Newton based method of Eirola and Nevanlinna. They develop a general framework for the nonlinearization of linear methods in terms of the acceleration of fixed-point iterations, where the latter is assumed to include the {open_quote}preconditioning{open_quote}. Their preconditioning is a single step of a split method, using lower order spatial difference approximations as well as simplified (Fickian) approximations of the diffusion physics.

  8. Using Group Theory to Obtain Eigenvalues of Nonsymmetric Systems by Symmetry Averaging

    Marion L. Ellzey


    Full Text Available If the Hamiltonian in the time independent Schrödinger equation, HΨ = EΨ, is invariant under a group of symmetry transformations, the theory of group representations can help obtain the eigenvalues and eigenvectors of H. A finite group that is not a symmetry group of H is nevertheless a symmetry group of an operator Hsym projected from H by the process of symmetry averaging. In this case H = Hsym + HR where HR is the nonsymmetric remainder. Depending on the nature of the remainder, the solutions for the full operator may be obtained by perturbation theory. It is shown here that when H is represented as a matrix [H] over a basis symmetry adapted to the group, the reduced matrix elements of [Hsym] are simple averages of certain elements of [H], providing a substantial enhancement in computational efficiency. A series of examples are given for the smallest molecular graphs. The first is a two vertex graph corresponding to a heteronuclear diatomic molecule. The symmetrized component then corresponds to a homonuclear system. A three vertex system is symmetry averaged in the first case to Cs and in the second case to the nonabelian C3v. These examples illustrate key aspects of the symmetry-averaging process.

  9. Laterally substituted symmetric and nonsymmetric salicylideneimine-based bent-core mesogens

    Sonja Findeisen-Tandel


    Full Text Available Bent-core mesogens have gained considerable importance due to their ability to form new mesophases with unusual properties. Relationships between the chemical structure of bent-core molecules and the type and physical properties of the formed mesophases are relatively unknown in detail and differ strongly from those known for calamitic liquid crystals. In this paper symmetric and nonsymmetric five-ring salicylideneaniline-based bent-core mesogens are presented, and the effect of lateral substituents attached at the outer phenyl rings (F, Cl, Br or the central phenyl ring (CH3 on the liquid-crystalline behaviour and on the physical properties is studied. Corresponding benzylideneaniline-based compounds were additionally prepared in order to study the influence of the intramolecular hydrogen bond. The occurring mesophases were investigated by differential scanning calorimetry, polarising microscopy, X-ray diffraction and dielectric and electro-optical measurements. The paper reports on new findings with respect to the structure–property relationships of bent-core mesogens. On one hand, the disruptive effect of laterally substituted halogen atoms, F, Cl and Br, on the mesophase behaviour of three isomeric series was much lower than expected. On the other hand, an increase of the clearing temperature by 34 K was observed, caused by small lateral substituents. The electro-optical behaviour, especially the type of polar switching and corresponding molecular movements, is sensitive to variations in the molecular structure.

  10. Limit of Riemann Solutions to the Nonsymmetric System of Keyfitz-Kranzer Type

    Lihui Guo


    Full Text Available The limit of Riemann solutions to the nonsymmetric system of Keyfitz-Kranzer type with a scaled pressure is considered for both polytropic gas and generalized Chaplygin gas. In the former case, the delta shock wave can be obtained as the limit of shock wave and contact discontinuity when u->u+ and the parameter ϵ tends to zero. The point is, the delta shock wave is not the one of transport equations, which is obviously different from cases of some other systems such as Euler equations or relativistic Euler equations. For the generalized Chaplygin gas, unlike the polytropic or isothermal gas, there exists a certain critical value ϵ2 depending only on the Riemann initial data, such that when ϵ drops to ϵ2, the delta shock wave appears as u->u+, which is actually a delta solution of the same system in one critical case. Then as ϵ becomes smaller and goes to zero at last, the delta shock wave solution is the exact one of transport equations. Furthermore, the vacuum states and contact discontinuities can be obtained as the limit of Riemann solutions when u-

  11. On the properness condition for modal analysis of non-symmetric second-order systems

    Ouisse, Morvan; Foltête, Emmanuel


    Non-symmetric second-order systems can be found in several engineering contexts, including vibroacoustics, rotordynamics, or active control. In this paper, the notion of properness for complex modes is extended to the case of non-self-adjoint problems. The properness condition is related to the ability of a set of complex modes to represent in an exact way the behavior of a physical second-order system, meaning that the modes are the solutions of a quadratic eigenvalue problem whose matrices are those of a physical system. This property can be used to identify the damping matrices which may be difficult to obtain with mathematical modeling techniques. The first part of the paper demonstrates the properness condition for non symmetric systems in general. In the second part, the authors propose a methodology to enforce that condition in order to perform an optimal reconstruction of the "closest" physical system starting from a given basis complex modes. The last part is dedicated to numerical and experimental illustrations of the proposed methodology. A simulated academic test case is first used to investigate the numerical aspects of the method. A physical application is then considered in the context of rotordynamics. Finally, an experimental test case is presented using a structure with an active control feedback. An extension of the LSCF identification technique is also introduced to identify both left and right complex mode shapes from measured frequency response functions.

  12. Sparse gammatone signal model optimized for English speech does not match the human auditory filters.

    Strahl, Stefan; Mertins, Alfred


    Evidence that neurosensory systems use sparse signal representations as well as improved performance of signal processing algorithms using sparse signal models raised interest in sparse signal coding in the last years. For natural audio signals like speech and environmental sounds, gammatone atoms have been derived as expansion functions that generate a nearly optimal sparse signal model (Smith, E., Lewicki, M., 2006. Efficient auditory coding. Nature 439, 978-982). Furthermore, gammatone functions are established models for the human auditory filters. Thus far, a practical application of a sparse gammatone signal model has been prevented by the fact that deriving the sparsest representation is, in general, computationally intractable. In this paper, we applied an accelerated version of the matching pursuit algorithm for gammatone dictionaries allowing real-time and large data set applications. We show that a sparse signal model in general has advantages in audio coding and that a sparse gammatone signal model encodes speech more efficiently in terms of sparseness than a sparse modified discrete cosine transform (MDCT) signal model. We also show that the optimal gammatone parameters derived for English speech do not match the human auditory filters, suggesting for signal processing applications to derive the parameters individually for each applied signal class instead of using psychometrically derived parameters. For brain research, it means that care should be taken with directly transferring findings of optimality for technical to biological systems.

  13. Sparse Matrices in Frame Theory

    Lemvig, Jakob; Krahmer, Felix; Kutyniok, Gitta


    Frame theory is closely intertwined with signal processing through a canon of methodologies for the analysis of signals using (redundant) linear measurements. The canonical dual frame associated with a frame provides a means for reconstruction by a least squares approach, but other dual frames...... yield alternative reconstruction procedures. The novel paradigm of sparsity has recently entered the area of frame theory in various ways. Of those different sparsity perspectives, we will focus on the situations where frames and (not necessarily canonical) dual frames can be written as sparse matrices...

  14. Sparse MRI for motion correction

    Yang, Zai; Xie, Lihua


    MR image sparsity/compressibility has been widely exploited for imaging acceleration with the development of compressed sensing. A sparsity-based approach to rigid-body motion correction is presented for the first time in this paper. A motion is sought after such that the compensated MR image is maximally sparse/compressible among the infinite candidates. Iterative algorithms are proposed that jointly estimate the motion and the image content. The proposed method has a lot of merits, such as no need of additional data and loose requirement for the sampling sequence. Promising results are presented to demonstrate its performance.

  15. TR01: Time-continuous Sparse Imputation

    Gemmeke, J F


    An effective way to increase the noise robustness of automatic speech recognition is to label noisy speech features as either reliable or unreliable (missing) prior to decoding, and to replace the missing ones by clean speech estimates. We present a novel method to obtain such clean speech estimates. Unlike previous imputation frameworks which work on a frame-by-frame basis, our method focuses on exploiting information from a large time-context. Using a sliding window approach, denoised speech representations are constructed using a sparse representation of the reliable features in an overcomplete basis of fixed-length exemplar fragments. We demonstrate the potential of our approach with experiments on the AURORA-2 connected digit database.

  16. Dose-shaping using targeted sparse optimization

    Sayre, George A.; Ruan, Dan [Department of Radiation Oncology, University of California - Los Angeles School of Medicine, 200 Medical Plaza, Los Angeles, California 90095 (United States)


    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{sub tot}{sup 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{sub 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{sub tot

  17. Sparse Coding for Alpha Matting.

    Johnson, Jubin; Varnousfaderani, Ehsan; Cholakkal, Hisham; Rajan, Deepu


    Existing color sampling based alpha matting methods use the compositing equation to estimate alpha at a pixel from pairs of foreground (F) and background (B) samples. The quality of the matte depends on the selected (F,B) pairs. In this paper, the matting problem is reinterpreted as a sparse coding of pixel features, wherein the sum of the codes gives the estimate of the alpha matte from a set of unpaired F and B samples. A non-parametric probabilistic segmentation provides a certainty measure on the pixel belonging to foreground or background, based on which a dictionary is formed for use in sparse coding. By removing the restriction to conform to (F,B) pairs, this method allows for better alpha estimation from multiple F and B samples. The same framework is extended to videos, where the requirement of temporal coherence is handled effectively. Here, the dictionary is formed by samples from multiple frames. A multi-frame graph model, as opposed to a single image as for image matting, is proposed that can be solved efficiently in closed form. Quantitative and qualitative evaluations on a benchmark dataset are provided to show that the proposed method outperforms current state-of-the-art in image and video matting.

  18. Bayesian Inference Methods for Sparse Channel Estimation

    Pedersen, Niels Lovmand


    This thesis deals with sparse Bayesian learning (SBL) with application to radio channel estimation. As opposed to the classical approach for sparse signal representation, we focus on the problem of inferring complex signals. Our investigations within SBL constitute the basis for the development...... of Bayesian inference algorithms for sparse channel estimation. Sparse inference methods aim at finding the sparse representation of a signal given in some overcomplete dictionary of basis vectors. Within this context, one of our main contributions to the field of SBL is a hierarchical representation...... analysis of the complex prior representation, where we show that the ability to induce sparse estimates of a given prior heavily depends on the inference method used and, interestingly, whether real or complex variables are inferred. We also show that the Bayesian estimators derived from the proposed...

  19. Efficient Coordinated Recovery of Sparse Channels in Massive MIMO

    Masood, Mudassir; Afify, Laila H.; Al-Naffouri, Tareq Y.


    This paper addresses the problem of estimating sparse channels in massive MIMO-OFDM systems. Most wireless channels are sparse in nature with large delay spread. In addition, these channels as observed by multiple antennas in a neighborhood have approximately common support. The sparsity and common support properties are attractive when it comes to the efficient estimation of large number of channels in massive MIMO systems. Moreover, to avoid pilot contamination and to achieve better spectral efficiency, it is important to use a small number of pilots. We present a novel channel estimation approach which utilizes the sparsity and common support properties to estimate sparse channels and require a small number of pilots. Two algorithms based on this approach have been developed which perform Bayesian estimates of sparse channels even when the prior is non-Gaussian or unknown. Neighboring antennas share among each other their beliefs about the locations of active channel taps to perform estimation. The coordinated approach improves channel estimates and also reduces the required number of pilots. Further improvement is achieved by the data-aided version of the algorithm. Extensive simulation results are provided to demonstrate the performance of the proposed algorithms.

  20. Efficient coordinated recovery of sparse channels in massive MIMO

    Masood, Mudassir


    This paper addresses the problem of estimating sparse channels in massive MIMO-OFDM systems. Most wireless channels are sparse in nature with large delay spread. In addition, these channels as observed by multiple antennas in a neighborhood have approximately common support. The sparsity and common support properties are attractive when it comes to the efficient estimation of large number of channels in massive MIMO systems. Moreover, to avoid pilot contamination and to achieve better spectral efficiency, it is important to use a small number of pilots. We present a novel channel estimation approach which utilizes the sparsity and common support properties to estimate sparse channels and requires a small number of pilots. Two algorithms based on this approach have been developed that perform Bayesian estimates of sparse channels even when the prior is non-Gaussian or unknown. Neighboring antennas share among each other their beliefs about the locations of active channel taps to perform estimation. The coordinated approach improves channel estimates and also reduces the required number of pilots. Further improvement is achieved by the data-aided version of the algorithm. Extensive simulation results are provided to demonstrate the performance of the proposed algorithms.

  1. Discriminative Sparse Representations in Hyperspectral Imagery


    classification , and unsupervised labeling (clustering) [2, 3, 4, 5, 6, 7, 8]. Recently, a non-parametric (Bayesian) approach to sparse modeling and com...DISCRIMINATIVE SPARSE REPRESENTATIONS IN HYPERSPECTRAL IMAGERY By Alexey Castrodad, Zhengming Xing John Greer, Edward Bosch Lawrence Carin and...00-00-2010 to 00-00-2010 4. TITLE AND SUBTITLE Discriminative Sparse Representations in Hyperspectral Imagery 5a. CONTRACT NUMBER 5b. GRANT

  2. Subspace orthogonalization for substructuring preconditioners for nonsymmetric systems of linear equations

    Starke, G. [Universitaet Karlsruhe (Germany)


    For nonselfadjoint elliptic boundary value problems which are preconditioned by a substructuring method, i.e., nonoverlapping domain decomposition, the author introduces and studies the concept of subspace orthogonalization. In subspace orthogonalization variants of Krylov methods the computation of inner products and vector updates, and the storage of basis elements is restricted to a (presumably small) subspace, in this case the edge and vertex unknowns with respect to the partitioning into subdomains. The author investigates subspace orthogonalization for two specific iterative algorithms, GMRES and the full orthogonalization method (FOM). This is intended to eliminate certain drawbacks of the Arnoldi-based Krylov subspace methods mentioned above. Above all, the length of the Arnoldi recurrences grows linearly with the iteration index which is therefore restricted to the number of basis elements that can be held in memory. Restarts become necessary and this often results in much slower convergence. The subspace orthogonalization methods, in contrast, require the storage of only the edge and vertex unknowns of each basis element which means that one can iterate much longer before restarts become necessary. Moreover, the computation of inner products is also restricted to the edge and vertex points which avoids the disturbance of the computational flow associated with the solution of subdomain problems. The author views subspace orthogonalization as an alternative to restarting or truncating Krylov subspace methods for nonsymmetric linear systems of equations. Instead of shortening the recurrences, one restricts them to a subset of the unknowns which has to be carefully chosen in order to be able to extend this partial solution to the entire space. The author discusses the convergence properties of these iteration schemes and its advantages compared to restarted or truncated versions of Krylov methods applied to the full preconditioned system.

  3. Deformable segmentation via sparse representation and dictionary learning.

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


    "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.

  4. Image fusion using sparse overcomplete feature dictionaries

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


    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.

  5. Miniature Laboratory for Detecting Sparse Biomolecules

    Lin, Ying; Yu, Nan


    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.

  6. Sparse and stable Markowitz portfolios.

    Brodie, Joshua; Daubechies, Ingrid; De Mol, Christine; Giannone, Domenico; Loris, Ignace


    We consider the problem of portfolio selection within the classical Markowitz mean-variance framework, reformulated as a constrained least-squares regression problem. We propose to add to the objective function a penalty proportional to the sum of the absolute values of the portfolio weights. This penalty regularizes (stabilizes) the optimization problem, encourages sparse portfolios (i.e., portfolios with only few active positions), and allows accounting for transaction costs. Our approach recovers as special cases the no-short-positions portfolios, but does allow for short positions in limited number. We implement this methodology on two benchmark data sets constructed by Fama and French. Using only a modest amount of training data, we construct portfolios whose out-of-sample performance, as measured by Sharpe ratio, is consistently and significantly better than that of the naïve evenly weighted portfolio.

  7. Efficient approximation of sparse Jacobians for time-implicit reduced order models


    This paper introduces a sparse matrix discrete interpolation method to effectively compute matrix approximations in the reduced order modeling framework. The sparse algorithm developed herein relies on the discrete empirical interpolation method and uses only samples of the nonzero entries of the matrix series. The proposed approach can approximate very large matrices, unlike the current matrix discrete empirical interpolation method which is limited by its large computational memory requirem...

  8. Automatic stellar spectral classification via sparse representations and dictionary learning

    Díaz-Hernández, R.; Peregrina-Barreto, H.; Altamirano-Robles, L.; González-Bernal, J. A.; Ortiz-Esquivel, A. E.


    Stellar classification is an important topic in astronomical tasks such as the study of stellar populations. However, stellar classification of a region of the sky is a time-consuming process due to the large amount of objects present in an image. Therefore, automatic techniques to speed up the process are required. In this work, we study the application of a sparse representation and a dictionary learning for automatic spectral stellar classification. Our dataset consist of 529 calibrated stellar spectra of classes B to K, belonging to the Pulkovo Spectrophotometric catalog, in the 3400-5500Å range. These stellar spectra are used for both training and testing of the proposed methodology. The sparse technique is applied by using the greedy algorithm OMP (Orthogonal Matching Pursuit) for finding an approximated solution, and the K-SVD (K-Singular Value Decomposition) for the dictionary learning step. Thus, sparse classification is based on the recognition of the common characteristics of a particular stellar type through the construction of a trained basis. In this work, we propose a classification criterion that evaluates the results of the sparse representation techniques and determines the final classification of the spectra. This methodology demonstrates its ability to achieve levels of classification comparable with automatic methodologies previously reported such as the Maximum Correlation Coefficient (MCC) and Artificial Neural Networks (ANN).

  9. Superpixel sparse representation for target detection in hyperspectral imagery

    Dong, Chunhua; Naghedolfeizi, Masoud; Aberra, Dawit; Qiu, Hao; Zeng, Xiangyan


    Sparse Representation (SR) is an effective classification method. Given a set of data vectors, SR aims at finding the sparsest representation of each data vector among the linear combinations of the bases in a given dictionary. In order to further improve the classification performance, the joint SR that incorporates interpixel correlation information of neighborhoods has been proposed for image pixel classification. However, SR and joint SR demand significant amount of computational time and memory, especially when classifying a large number of pixels. To address this issue, we propose a superpixel sparse representation (SSR) algorithm for target detection in hyperspectral imagery. We firstly cluster hyperspectral pixels into nearly uniform hyperspectral superpixels using our proposed patch-based SLIC approach based on their spectral and spatial information. The sparse representations of these superpixels are then obtained by simultaneously decomposing superpixels over a given dictionary consisting of both target and background pixels. The class of a hyperspectral pixel is determined by a competition between its projections on target and background subdictionaries. One key advantage of the proposed superpixel representation algorithm with respect to pixelwise and joint sparse representation algorithms is that it reduces computational cost while still maintaining competitive classification performance. We demonstrate the effectiveness of the proposed SSR algorithm through experiments on target detection in the in-door and out-door scene data under daylight illumination as well as the remote sensing data. Experimental results show that SSR generally outperforms state of the art algorithms both quantitatively and qualitatively.

  10. Sparse PDF Volumes for Consistent Multi-Resolution Volume Rendering

    Sicat, Ronell Barrera


    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.

  11. Sparse PDF Volumes for Consistent Multi-Resolution Volume Rendering.

    Sicat, Ronell; Krüger, Jens; Möller, Torsten; Hadwiger, Markus


    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.

  12. Multiple instance learning tracking method with local sparse representation

    Xie, Chengjun


    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.

  13. Sparsely Sampling the Sky: A Bayesian Experimental Design Approach

    Paykari, P


    The next generation of galaxy surveys will observe millions of galaxies over large volumes of the universe. These surveys are expensive both in time and cost, raising questions regarding the optimal investment of this time and money. In this work we investigate criteria for selecting amongst observing strategies for constraining the galaxy power spectrum and a set of cosmological parameters. Depending on the parameters of interest, it may be more efficient to observe a larger, but sparsely sampled, area of sky instead of a smaller contiguous area. In this work, by making use of the principles of Bayesian Experimental Design, we will investigate the advantages and disadvantages of the sparse sampling of the sky and discuss the circumstances in which a sparse survey is indeed the most efficient strategy. For the Dark Energy Survey (DES), we find that by sparsely observing the same area in a smaller amount of time, we only increase the errors on the parameters by a maximum of 0.45%. Conversely, investing the sam...

  14. Image Deblurring Using Sparse-Land Model

    Harini. B


    Full Text Available - In this paper, the problem of deblurring and poor image resolution is addressed and extended the task by removing blur and noise in the image to form a restored image as the output. Haar Wavelet transform based Wiener filtering is used in this algorithm. Soft Thresholding and Parallel Coordinate Descent (PCD iterative shrinkage algorithm are used for removal of noise and deblurring. Sequential Subspace Optimization (SESOP method or Line search method provides speed-up to this process. Sparse-land model is an emerging and powerful method to describe signals based on the sparsity and redundancy of their representations. Sparse coding is a key principle that underlies wavelet representation of images. Coefficient obtained after removal of noise and blur are not truly Sparse and so Minimum Mean Squared Error estimator (MMSE estimates the Sparse vectors. Sparse representation of signals have drawn considerable interest in recent years. Sparse coding is a key principle that underlies wavelet representation of images. In this paper, we explain the effort of seeking a common wavelet sparse coding of images from same object category leads to an active basis model called Sparse-land model, where the images share the same set of selected wavelet elements, which forms a linear basis for restoring the blurred image.

  15. Sparse representation for the ISAR image reconstruction

    Hu, Mengqi; Montalbo, John; Li, Shuxia; Sun, Ligang; Qiao, Zhijun G.


    In this paper, a sparse representation of the data for an inverse synthetic aperture radar (ISAR) system is provided in two dimensions. The proposed sparse representation motivates the use a of a Convex Optimization that recovers the image with far less samples, which is required by Nyquist-Shannon sampling theorem to increases the efficiency and decrease the cost of calculation in radar imaging.

  16. Sparse seismic imaging using variable projection

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


    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 s

  17. Regression with Sparse Approximations of Data

    Noorzad, Pardis; Sturm, Bob L.


    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...



    This letter proposes a novel and simple construction of regular Low-Density Parity-Check (LDPC) codes using sparse binary sequences. It utilizes the cyclic cross correlation function of sparse sequences to generate codes with girth8. The new codes perform well using the sumproduct decoding. Low encodingcomplexity can also be achieved due to the inherent quasi-cyclic structure of the codes.

  19. Approximate inverse preconditioners for general sparse matrices

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


    Preconditioned Krylov subspace methods are often very efficient in solving sparse linear matrices that arise from the discretization of elliptic partial differential equations. However, for general sparse indifinite matrices, the usual ILU preconditioners fail, often because of the fact that the resulting factors L and U give rise to unstable forward and backward sweeps. In such cases, alternative preconditioners based on approximate inverses may be attractive. We are currently developing a number of such preconditioners based on iterating on each column to get the approximate inverse. For this approach to be efficient, the iteration must be done in sparse mode, i.e., we must use sparse-matrix by sparse-vector type operatoins. We will discuss a few options and compare their performance on standard problems from the Harwell-Boeing collection.

  20. On the strong uniqueness of highly sparse representations from redundant dictionaries

    Gribonval, Rémi; Nielsen, Morten


    of sparsest respresentation w.r.t. arbitrary admissible sparsity measures. Our results should have a practical impact on source separation methods based on sparse decompositions, since they indicate that a large class of sparse priors can be efficiently replaced with a Laplacian prior without changing...... of sparsest respresentation w.r.t. arbitrary admissible sparsity measures. Our results should have a practical impact on source separation methods based on sparse decompositions, since they indicate that a large class of sparse priors can be efficiently replaced with a Laplacian prior without changing...... these results to a large class of sparsity measures which includes the l^p-sparsity measures for 0 \\leq p \\leq 1. We give sufficient conditions on a signal such that the simple solution of a linear programming problem simultaneously solves all the non-convex (and generally hard combinatorial) problems...

  1. Process Knowledge Discovery Using Sparse Principal Component Analysis

    Gao, Huihui; Gajjar, Shriram; Kulahci, Murat


    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...... are demonstrated through the Tennessee Eastman process simulation. The results indicate how knowledge and process insight can be discovered through a systematic analysis of sparse loadings....

  2. A Computing Platform for Parallel Sparse Matrix Computations


    infiniband. Each node contains 24 cores. This parallel computing platform has been used by my research group in the early stages of developing large... research staff Inventions (DD882) Scientific Progress Two classes of parallel solvers have been developed. The first is a family of parallel sparse...SECURITY CLASSIFICATION OF: This grant enabled the purchase of an Intel multiprocessor consisting of eight multicore nodes interconnected via an

  3. Parallel and Scalable Sparse Basic Linear Algebra Subprograms

    Liu, Weifeng

    Sparse basic linear algebra subprograms (BLAS) are fundamental building blocks for numerous scientific computations and graph applications. Compared with Dense BLAS, parallelization of Sparse BLAS routines entails extra challenges due to the irregularity of sparse data structures. This thesis...

  4. Parallel and Scalable Sparse Basic Linear Algebra Subprograms

    Liu, Weifeng

    Sparse basic linear algebra subprograms (BLAS) are fundamental building blocks for numerous scientific computations and graph applications. Compared with Dense BLAS, parallelization of Sparse BLAS routines entails extra challenges due to the irregularity of sparse data structures. This thesis...

  5. Sparse Spectrotemporal Coding of Sounds

    Körding Konrad P


    Full Text Available Recent studies of biological auditory processing have revealed that sophisticated spectrotemporal analyses are performed by central auditory systems of various animals. The analysis is typically well matched with the statistics of relevant natural sounds, suggesting that it produces an optimal representation of the animal's acoustic biotope. We address this topic using simulated neurons that learn an optimal representation of a speech corpus. As input, the neurons receive a spectrographic representation of sound produced by a peripheral auditory model. The output representation is deemed optimal when the responses of the neurons are maximally sparse. Following optimization, the simulated neurons are similar to real neurons in many respects. Most notably, a given neuron only analyzes the input over a localized region of time and frequency. In addition, multiple subregions either excite or inhibit the neuron, together producing selectivity to spectral and temporal modulation patterns. This suggests that the brain's solution is particularly well suited for coding natural sound; therefore, it may prove useful in the design of new computational methods for processing speech.

  6. Resistant multiple sparse canonical correlation.

    Coleman, Jacob; Replogle, Joseph; Chandler, Gabriel; Hardin, Johanna


    Canonical correlation analysis (CCA) is a multivariate technique that takes two datasets and forms the most highly correlated possible pairs of linear combinations between them. Each subsequent pair of linear combinations is orthogonal to the preceding pair, meaning that new information is gleaned from each pair. By looking at the magnitude of coefficient values, we can find out which variables can be grouped together, thus better understanding multiple interactions that are otherwise difficult to compute or grasp intuitively. CCA appears to have quite powerful applications to high-throughput data, as we can use it to discover, for example, relationships between gene expression and gene copy number variation. One of the biggest problems of CCA is that the number of variables (often upwards of 10,000) makes biological interpretation of linear combinations nearly impossible. To limit variable output, we have employed a method known as sparse canonical correlation analysis (SCCA), while adding estimation which is resistant to extreme observations or other types of deviant data. In this paper, we have demonstrated the success of resistant estimation in variable selection using SCCA. Additionally, we have used SCCA to find multiple canonical pairs for extended knowledge about the datasets at hand. Again, using resistant estimators provided more accurate estimates than standard estimators in the multiple canonical correlation setting. R code is available and documented at

  7. Efficient nearest neighbors via robust sparse hashing.

    Cherian, Anoop; Sra, Suvrit; Morellas, Vassilios; Papanikolopoulos, Nikolaos


    This paper presents a new nearest neighbor (NN) retrieval framework: robust sparse hashing (RSH). Our approach is inspired by the success of dictionary learning for sparse coding. Our key idea is to sparse code the data using a learned dictionary, and then to generate hash codes out of these sparse codes for accurate and fast NN retrieval. But, direct application of sparse coding to NN retrieval poses a technical difficulty: when data are noisy or uncertain (which is the case with most real-world data sets), for a query point, an exact match of the hash code generated from the sparse code seldom happens, thereby breaking the NN retrieval. Borrowing ideas from robust optimization theory, we circumvent this difficulty via our novel robust dictionary learning and sparse coding framework called RSH, by learning dictionaries on the robustified counterparts of the perturbed data points. The algorithm is applied to NN retrieval on both simulated and real-world data. Our results demonstrate that RSH holds significant promise for efficient NN retrieval against the state of the art.

  8. Discriminative sparse coding on multi-manifolds

    Wang, J.J.-Y.


    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.

  9. Sparse Signal Recovery in Hilbert Spaces

    Pope, Graeme


    This paper reports an effort to consolidate numerous coherence-based sparse signal recovery results available in the literature. We present a single theory that applies to general Hilbert spaces with the sparsity of a signal defined as the number of (possibly infinite-dimensional) subspaces participating in the signal's representation. Our general results recover uncertainty relations and coherence-based recovery thresholds for sparse signals, block-sparse signals, multi-band signals, signals in shift-invariant spaces, and signals in finite unions of (possibly infinite-dimensional) subspaces. Moreover, we improve upon and generalize several of the existing results and, in many cases, we find shortened and simplified proofs.

  10. Regression with Sparse Approximations of Data

    Noorzad, Pardis; Sturm, Bob L.


    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...

  11. Sparse Image Reconstruction in Computed Tomography

    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...... and limitations of sparse reconstruction methods in CT, in particular in a quantitative sense. For example, relations between image properties such as contrast, structure and sparsity, tolerable noise levels, suficient sampling levels, the choice of sparse reconstruction formulation and the achievable image...

  12. Sparse modeling theory, algorithms, and applications

    Rish, Irina


    ""A comprehensive, clear, and well-articulated book on sparse modeling. This book will stand as a prime reference to the research community for many years to come.""-Ricardo Vilalta, Department of Computer Science, University of Houston""This book provides a modern introduction to sparse methods for machine learning and signal processing, with a comprehensive treatment of both theory and algorithms. Sparse Modeling is an ideal book for a first-year graduate course.""-Francis Bach, INRIA - École Normale Supřieure, Paris

  13. Effect of non-symmetric waveform on conduction block induced by high-frequency (kHz) biphasic stimulation in unmyelinated axon.

    Zhao, Shouguo; Yang, Guangning; Wang, Jicheng; Roppolo, James R; de Groat, William C; Tai, Changfeng


    The effect of a non-symmetric waveform on nerve conduction block induced by high-frequency biphasic stimulation is investigated using a lumped circuit model of the unmyelinated axon based on Hodgkin-Huxley equations. The simulation results reveal that the block threshold monotonically increases with the stimulation frequency for the symmetric stimulation waveform. However, a non-monotonic relationship between block threshold and stimulation frequency is observed when the stimulation waveform is non-symmetric. Constant activation of potassium channels by the high-frequency stimulation results in the increase of block threshold with increasing frequency. The non-symmetric waveform with a positive pulse 0.4-0.8 μs longer than the negative pulse blocks axonal conduction by hyperpolarizing the membrane and causes a decrease in block threshold as the frequency increases above 12-16 kHz. On the other hand, the non-symmetric waveform with a negative pulse 0.4-0.8 μs longer than the positive pulse blocks axonal conduction by depolarizing the membrane and causes a decrease in block threshold as the frequency increases above 40-53 kHz. This simulation study is important for understanding the potential mechanisms underlying the nerve block observed in animal studies, and may also help to design new animal experiments to further improve the nerve block method for clinical applications.

  14. Sparse two-sided rank-one updates for nonlinear equations


    The two-sided rank-one (TR1) update method was introduced by Griewank and Walther (2002) for solving nonlinear equations. It generates dense approximations of the Jacobian and thus is not applicable to large-scale sparse problems. To overcome this difficulty, we propose sparse extensions of the TR1 update and give some convergence analysis. The numerical experiments show that some of our extensions are superior to the TR1 update method. Some convergence analysis is also presented.

  15. Eigenvalue problems solved by reorthogonalization Lanczos metho d for the large non-orthonormal sparse matrix%用重正交化Lanczos法求解大型非正交归一基稀疏矩阵的特征值问题



    在116 Sn原子核壳模型结构下,利用广义辛弱数截断多体空间得到的哈密顿矩阵是一个大型的实对称非正交归一基稀疏矩阵,因此求解大型矩阵的能量特征值和能量特征向量是原子核物理上的一个重要问题。为此,利用重正交化Lanczos法与Cholesky分解法和Elementary transformation法相结合的方法,实现了用内存较小的计算机求解大型实对称非正交归一基稀疏矩阵的特征值和特征向量。用这种方法计算小型矩阵得到的特征值和精确值符合得较好,且运用这个方法计算了116Sn壳模型截断后的大型非正交归一基稀疏矩阵的能量特征值,得到的原子核低态能量与实验测量能量相吻合,计算结果表明Lanczos法在Matlab编程和大型壳模型计算中的精确性和可行性。此方法也有助于求解一些中质核或者重核的低态能量,同时也有利于用内存稍大的计算机求解更大的非正交归一基矩阵的特征值问题。%Using shell model to calculate the nuclear systems in a large model space is an important method in the field of nuclear physics. On the basis of the nuclear shell model, a large symmetric non-orthonormal sparse Hamiltonian matrix is generated when adopting the generalized seniority method to truncate the many-body space. Calculating the energy eigenvalues and energy eigenvectors of the large symmetric non-orthonormal sparse Hamiltonian matrix is of indispensable steps before energies of nucleus are further calculated. In the mean time, some low-lying energy eigenvalues are always the focus of attention on the occasion of large scale shell model calculation. In this paper, by combining reorthogonalization Lanczos method with Cholesky decomposition method and Elementary transformation method, converting the generalized eigenvalue problems into the standard eigenvalue problems, and transforming the large standard eigenvalue problems into the small standard

  16. Relative species abundance of replicator dynamics with sparse interactions

    Obuchi, Tomoyuki; Tokita, Kei


    A theory of relative species abundance on sparsely-connected networks is presented by investigating the replicator dynamics with symmetric interactions. Sparseness of a network involves difficulty in analyzing the fixed points of the equation, and we avoid this problem by treating large self interaction $u$, which allows us to construct a perturbative expansion. Based on this perturbation, we find that the nature of the interactions is directly connected to the abundance distribution, and some characteristic behaviors, such as multiple peaks in the abundance distribution and all species coexistence at moderate values of $u$, are discovered in a wide class of the distribution of the interactions. The all species coexistence collapses at a critical value of $u$, $u_c$, and this collapsing is regarded as a phase transition. To get more quantitative information, we also construct a non-perturbative theory on random graphs based on techniques of statistical mechanics. The result shows those characteristic behavior...

  17. Advanced spectral analysis of ionospheric waves observed with sparse arrays

    Helmboldt, Joseph


    This paper presents a case study from a single, six-hour observing period to illustrate the application of techniques developed for interferometric radio telescopes to the spectral analysis of observations of ionospheric fluctuations with sparse arrays. We have adapted the deconvolution methods used for making high dynamic range images of cosmic sources with radio arrays to making comparably high dynamic range maps of spectral power of wavelike ionospheric phenomena. In the example presented here, we have used observations of the total electron content (TEC) gradient derived from Very Large Array (VLA) observations of synchrotron emission from two galaxy clusters at 330 MHz as well as GPS-based TEC measurements from a sparse array of 33 receivers located within New Mexico near the VLA. We show that these techniques provide a significant improvement in signal to noise (S/N) of detected wavelike structures by correcting for both measurement inaccuracies and wavefront distortions. This is especially true for the...

  18. Efficient cosmological parameter sampling using sparse grids

    Frommert, Mona; Riller, Thomas; Reinecke, Martin; Bungartz, Hans-Joachim; Ensslin, Torsten


    We present a novel method to significantly speed up cosmological parameter sampling. The method relies on constructing an interpolation of the CMB-log-likelihood based on sparse grids, which is used as a shortcut for the likelihood-evaluation. We obtain excellent results over a large region in parameter space, comprising about 25 log-likelihoods around the peak, and we reproduce the one-dimensional projections of the likelihood almost perfectly. In speed and accuracy, our technique is competitive to existing approaches to accelerate parameter estimation based on polynomial interpolation or neural networks, while having some advantages over them. In our method, there is no danger of creating unphysical wiggles as it can be the case for polynomial fits of a high degree. Furthermore, we do not require a long training time as for neural networks, but the construction of the interpolation is determined by the time it takes to evaluate the likelihood at the sampling points, which can be parallelised to an arbitrary...

  19. Second Workshop on Sparse Grids and Applications

    Pflüger, Dirk


    Sparse grids have gained increasing interest in recent years for the numerical treatment of high-dimensional problems. Whereas classical numerical discretization schemes fail in more than three or four dimensions, sparse grids make it possible to overcome the “curse” of dimensionality to some degree, extending the number of dimensions that can be dealt with. This volume of LNCSE collects the papers from the proceedings of the second workshop on sparse grids and applications, demonstrating once again the importance of this numerical discretization scheme. The selected articles present recent advances on the numerical analysis of sparse grids as well as efficient data structures, and the range of applications extends to uncertainty quantification settings and clustering, to name but a few examples.

  20. Parallel transposition of sparse data structures

    Wang, Hao; Liu, Weifeng; Hou, Kaixi


    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...... transposition for sparse matrices and graphs, have not received the attention they deserve. In this paper, we first identify that the transposition operation can be a bottleneck of some fundamental sparse matrix and graph algorithms. Then, we revisit the performance and scalability of parallel transposition...... approaches on x86-based multi-core and many-core processors. Based on the insights obtained, we propose two new parallel transposition algorithms: ScanTrans and MergeTrans. The experimental results show that our ScanTrans method achieves an average of 2.8-fold (up to 6.2-fold) speedup over the parallel...

  1. Homomorphic Hashing for Sparse Coefficient Extraction

    Kaski, Petteri; Nederlof, Jesper


    We study classes of Dynamic Programming (DP) algorithms which, due to their algebraic definitions, are closely related to coefficient extraction methods. DP algorithms can easily be modified to exploit sparseness in the DP table through memorization. Coefficient extraction techniques on the other hand are both space-efficient and parallelisable, but no tools have been available to exploit sparseness. We investigate the systematic use of homomorphic hash functions to combine the best of these methods and obtain improved space-efficient algorithms for problems including LINEAR SAT, SET PARTITION, and SUBSET SUM. Our algorithms run in time proportional to the number of nonzero entries of the last segment of the DP table, which presents a strict improvement over sparse DP. The last property also gives an improved algorithm for CNF SAT with sparse projections.

  2. Beam Combination for Sparse Aperture Telescopes Project

    National Aeronautics and Space Administration — The Stellar Imager, an ultraviolet, sparse-aperture telescope, was one of the fifteen Vision Missions chosen for a study completed last year. Stellar Imager will...

  3. Structured sparse priors for image classification.

    Srinivas, Umamahesh; Suo, Yuanming; Dao, Minh; Monga, Vishal; Tran, Trac D


    Model-based compressive sensing (CS) exploits the structure inherent in sparse signals for the design of better signal recovery algorithms. This information about structure is often captured in the form of a prior on the sparse coefficients, with the Laplacian being the most common such choice (leading to l1 -norm minimization). Recent work has exploited the discriminative capability of sparse representations for image classification by employing class-specific dictionaries in the CS framework. Our contribution is a logical extension of these ideas into structured sparsity for classification. We introduce the notion of discriminative class-specific priors in conjunction with class specific dictionaries, specifically the spike-and-slab prior widely applied in Bayesian sparse regression. Significantly, the proposed framework takes the burden off the demand for abundant training image samples necessary for the success of sparsity-based classification schemes. We demonstrate this practical benefit of our approach in important applications, such as face recognition and object categorization.

  4. Biclustering via Sparse Singular Value Decomposition

    Lee, Mihee


    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.

  5. Flood Inundation Modelling in Data Sparse Deltas

    Hawker, Laurence; Bates, Paul; Neal, Jeffrey


    An estimated 7% of global population currently live in deltas, and this number is increasing over time. This has resulted in numerous human induced impacts on deltas ranging from subsidence, upstream sediment trapping and coastal erosion amongst others. These threats have already impacted on flood dynamics in deltas and could intensify in line with human activities. However, the myriad of threats creates a large number of potential scenarios that need to be evaluated. Therefore, to assess the impacts of these scenarios, a pre-requisite is a flood inundation model that is both computationally efficient and flexible in its setup so it can be applied in data-sparse settings. An intermediate scale, which compromises between the computational speed of a global model and the detail of a case specific bespoke model, was chosen to achieve this. To this end, we have developed an intermediate scale flood inundation model at a resolution of 540m of the Mekong Delta, built with freely available data, using the LISFLOOD-FP hydrodynamic model. The purpose of this is to answer the following questions: 1) How much detail is required to accurately simulate flooding in the Mekong Delta? , 2) What characteristics of deltas are most important to include in flood inundation models? Models were run using a vegetation removed SRTM DEM and a hind-casting of tidal heights as a downstream boundary. Results indicate the importance of vegetation removal in the DEM for inundation extent and the sensitivity of water level to roughness coefficients. The propagation of the tidal signal was found to be sensitive to bathymetry, both within the river channel and offshore, yet data availability for this is poor, meaning the modeller has to be careful in his or her choice of bathymetry interpolation Supplementing global river channel data with more localised data demonstrated minor improvements in results suggesting detailed channel information is not always needed to produce good results. It is

  6. Sparse CSEM inversion driven by seismic coherence

    Guo, Zhenwei; Dong, Hefeng; Kristensen, Åge


    Marine controlled source electromagnetic (CSEM) data inversion for hydrocarbon exploration is often challenging due to high computational cost, physical memory requirement and low resolution of the obtained resistivity map. This paper aims to enhance both the speed and resolution of CSEM inversion by introducing structural geological information in the inversion algorithm. A coarse mesh is generated for Occam’s inversion, where the parameters are fewer than in the fine regular mesh. This sparse mesh is defined as a coherence-based irregular (IC) sparse mesh, which is based on vertices extracted from available geological information. Inversion results on synthetic data illustrate that the IC sparse mesh has a smaller inversion computational cost compared to the regular dense (RD) mesh. It also has a higher resolution than with a regular sparse (RS) mesh for the same number of estimated parameters. In order to study how the IC sparse mesh reduces the computational time, four different meshes are generated for Occam’s inversion. As a result, an IC sparse mesh can reduce the computational cost while it keeps the resolution as good as a fine regular mesh. The IC sparse mesh reduces the computational cost of the matrix operation for model updates. When the number of estimated parameters reduces to a limited value, the computational cost is independent of the number of parameters. For a testing model with two resistive layers, the inversion result using an IC sparse mesh has higher resolution in both horizontal and vertical directions. Overall, the model representing significant geological information in the IC mesh can improve the resolution of the resistivity models obtained from inversion of CSEM data.

  7. Tunable Sparse Network Coding for Multicast Networks

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


    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....

  8. Sparse representations for radar with Matlab examples

    Knee, Peter


    Although the field of sparse representations is relatively new, research activities in academic and industrial research labs are already producing encouraging results. The sparse signal or parameter model motivated several researchers and practitioners to explore high complexity/wide bandwidth applications such as Digital TV, MRI processing, and certain defense applications. The potential signal processing advancements in this area may influence radar technologies. This book presents the basic mathematical concepts along with a number of useful MATLAB® examples to emphasize the practical imple

  9. Online Dictionary Learning for Sparse Coding


    cessing tasks such as denoising (Elad & Aharon, 2006) as well as higher-level tasks such as classification (Raina et al., 2007; Mairal et al., 2008a...Bruckstein, A. M. (2006). The K- SVD : An algorithm for designing of overcomplete dic- tionaries for sparse representations. IEEE Trans. SP...Tibshirani, R. (2004). Least angle regression. Ann. Statist. Elad, M., & Aharon, M. (2006). Image denoising via sparse and redundant representations

  10. Rank Awareness in Joint Sparse Recovery

    Davies, Mike E


    In this paper we revisit the sparse multiple measurement vector (MMV) problem where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurements. This problem has received increasing interest as an extension of the single channel sparse recovery problem which lies at the heart of the emerging field of compressed sensing. However the sparse approximation problem has origins which include links to the field of array signal processing where we find the inspiration for a new family of MMV algorithms based on the MUSIC algorithm. We highlight the role of the rank of the coefficient matrix X in determining the difficulty of the recovery problem. We derive the necessary and sufficient conditions for the uniqueness of the sparse MMV solution, which indicates that the larger the rank of X the less sparse X needs to be to ensure uniqueness. We also show that the larger the rank of X the less the computational effort required to solve the MMV problem through a combinatorial search. In ...

  11. Sparse Recovery from Combined Fusion Frame Measurements

    Boufounos, Petros T; Rauhut, Holger


    Sparse representations have emerged as a powerful tool in signal and information processing, culminated by the success of new acquisition and processing techniques such as Compressed Sensing (CS). Fusion frames are very rich new signal representation methods that use collections of subspaces instead of vectors to represent signals. This work combines these exciting fields to introduce a new sparsity model for fusion frames. Signals that are sparse under the new model can be compressively sampled and uniquely reconstructed in ways similar to sparse signals using standard CS. The combination provides a promising new set of mathematical tools and signal models useful in a variety of applications. With the new model, a sparse signal has energy in very few of the subspaces of the fusion frame, although it does not need to be sparse within each of the subspaces it occupies. This sparsity model is captured using a mixed l1/l2 norm for fusion frames. A signal sparse in a fusion frame can be sampled using very few ran...

  12. Learning discriminative dictionary for group sparse representation.

    Sun, Yubao; Liu, Qingshan; Tang, Jinhui; Tao, Dacheng


    In recent years, sparse representation has been widely used in object recognition applications. How to learn the dictionary is a key issue to sparse representation. A popular method is to use l1 norm as the sparsity measurement of representation coefficients for dictionary learning. However, the l1 norm treats each atom in the dictionary independently, so the learned dictionary cannot well capture the multisubspaces structural information of the data. In addition, the learned subdictionary for each class usually shares some common atoms, which weakens the discriminative ability of the reconstruction error of each subdictionary. This paper presents a new dictionary learning model to improve sparse representation for image classification, which targets at learning a class-specific subdictionary for each class and a common subdictionary shared by all classes. The model is composed of a discriminative fidelity, a weighted group sparse constraint, and a subdictionary incoherence term. The discriminative fidelity encourages each class-specific subdictionary to sparsely represent the samples in the corresponding class. The weighted group sparse constraint term aims at capturing the structural information of the data. The subdictionary incoherence term is to make all subdictionaries independent as much as possible. Because the common subdictionary represents features shared by all classes, we only use the reconstruction error of each class-specific subdictionary for classification. Extensive experiments are conducted on several public image databases, and the experimental results demonstrate the power of the proposed method, compared with the state-of-the-arts.

  13. Quiver Varieties with Multiplicities, Weyl Groups of Non-Symmetric Kac-Moody Algebras, and Painlevé Equations

    Daisuke Yamakawa


    Full Text Available To a finite quiver equipped with a positive integer on each of its vertices, we associate a holomorphic symplectic manifold having some parameters. This coincides with Nakajima's quiver variety with no stability parameter/framing if the integers attached on the vertices are all equal to one. The construction of reflection functors for quiver varieties are generalized to our case, in which these relate to simple reflections in the Weyl group of some symmetrizable, possibly non-symmetric Kac-Moody algebra. The moduli spaces of meromorphic connections on the rank 2 trivial bundle over the Riemann sphere are described as our manifolds. In our picture, the list of Dynkin diagrams for Painlevé equations is slightly different from (but equivalent to Okamoto's.

  14. Observer-Based Adaptive NN Control for a Class of Uncertain Nonlinear Systems With Nonsymmetric Input Saturation.

    Gao, Yong-Feng; Sun, Xi-Ming; Wen, Changyun; Wang, Wei


    This paper is concerned with the problem of adaptive tracking control for a class of uncertain nonlinear systems with nonsymmetric input saturation and immeasurable states. The radial basis function of neural network (NN) is employed to approximate unknown functions, and an NN state observer is designed to estimate the immeasurable states. To analyze the effect of input saturation, an auxiliary system is employed. By the aid of adaptive backstepping technique, an adaptive tracking control approach is developed. Under the proposed adaptive tracking controller, the boundedness of all the signals in the closed-loop system is achieved. Moreover, distinct from most of the existing references, the tracking error can be bounded by an explicit function of design parameters and saturation input error. Finally, an example is given to show the effectiveness of the proposed method.

  15. Nonsymmetrical 3,4-dithienylmaleimides by cross-coupling reactions with indium organometallics: synthesis and photochemical studies.

    Mosquera, Angeles; Férnandez, M Isabel; Canle Lopez, Moisés; Pérez Sestelo, José; Sarandeses, Luis A


    The synthesis and photochemical study of novel nonsymmetrical 1,2-dithienylethenes (DTEs) with a maleimide bridge have been carried out. The synthetic approach to the DTEs was based on successive selective palladium-catalyzed cross-coupling reactions of 5-susbtituted-2-methyl-3-thiophenyl indium reagents with 3,4-dichloromaleimides. The required organoindium reagents were prepared from 2-methyl-3,5-dibromothiophene by a selective (C-5) coupling reaction with triorganoindium compounds (R3 In) and subsequent metal-halogen exchange. The coupling reactions usually gave good yields and have a high atom economy with substoichiometric amounts of R3 In. The results of photochemical studies show that these novel dithienylmaleimides undergo a photocyclization reaction upon irradiation in the UV region and a photocycloreversion after excitation in the visible region, thus they can be used as photochemical switches. ON-OFF operations can be repeated in successive cycles without appreciable loss of effectiveness in the process.

  16. Nonlinear Free Vibration Analysis of Thin-walled Curved Beam with Non-symmetric Open Cross Section

    DUAN Hai-juan; SONG Zhen-sen


    A finite element formulation was presented for the nonlinear free vibration of thin-walled curved beams with non-symmetric open across section. The kinetic and potential energies were derived by the virtual principle. The energy function includes the effect of flexural-torsional coupling, the torsion warping and the shear centre location. For finite element analysis, cubic polynomials were utilized as the shape functions of the two nodal thin-walled curved elements. Each node possesses seven degrees freedom including the warping degree of freedom. The nonlinear eigenvalue problem was solved by the direct iteration technique. The results are compared with those for straight beams as available in the literature. The results for nonlinear free vibration analysis of curved beams for various radii and subtended angle are presented.

  17. Fast Solution in Sparse LDA for Binary Classification

    Moghaddam, Baback


    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

  18. Optimized sparse-particle aerosol representations for modeling cloud-aerosol interactions

    Fierce, Laura; McGraw, Robert


    Sparse representations of atmospheric aerosols are needed for efficient regional- and global-scale chemical transport models. Here we introduce a new framework for representing aerosol distributions, based on the method of moments. Given a set of moment constraints, we show how linear programming can be used to identify collections of sparse particles that approximately maximize distributional entropy. The collections of sparse particles derived from this approach reproduce CCN activity of the exact model aerosol distributions with high accuracy. Additionally, the linear programming techniques described in this study can be used to bound key aerosol properties, such as the number concentration of CCN. Unlike the commonly used sparse representations, such as modal and sectional schemes, the maximum-entropy moment-based approach is not constrained to pre-determined size bins or assumed distribution shapes. This study is a first step toward a new aerosol simulation scheme that will track multivariate aerosol distributions with sufficient computational efficiency for large-scale simulations.

  19. Sparse linear systems: Theory of decomposition, methods, technology, applications and implementation in Wolfram Mathematica

    Pilipchuk, L. A., E-mail: [Belarussian State University, 220030 Minsk, 4, Nezavisimosti avenue, Republic of Belarus (Belarus); Pilipchuk, A. S., E-mail: [The Natural Resources and Environmental Protestion Ministry of the Republic of Belarus, 220004 Minsk, 10 Kollektornaya Street, Republic of Belarus (Belarus)


    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.

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

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


    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.

  1. Computational techniques and data structures of the sparse underdetermined systems with using graph theory

    Pilipchuk, L. A.; Pilipchuk, A. S.


    For constructing of the solutions of the sparse linear systems we propose effective methods, technologies and their implementation in Wolfram Mathematica. 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. In addition, such systems arise in estimating traffic in the generalized graph or multigraph on its unobservable part. For computing of each vector of the basis solution space with linear estimate in the worst case we propose effective algorithms and data structures in the case when a support of the multigraph or graph for the sparse systems contains a cycles.

  2. Robust visual tracking via multiscale deep sparse networks

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


    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.

  3. Efficient sparse kernel feature extraction based on partial least squares.

    Dhanjal, Charanpal; Gunn, Steve R; Shawe-Taylor, John


    The presence of irrelevant features in training data is a significant obstacle for many machine learning tasks. One approach to this problem is to extract appropriate features and, often, one selects a feature extraction method based on the inference algorithm. Here, we formalize a general framework for feature extraction, based on Partial Least Squares, in which one can select a user-defined criterion to compute projection directions. The framework draws together a number of existing results and provides additional insights into several popular feature extraction methods. Two new sparse kernel feature extraction methods are derived under the framework, called Sparse Maximal Alignment (SMA) and Sparse Maximal Covariance (SMC), respectively. Key advantages of these approaches include simple implementation and a training time which scales linearly in the number of examples. Furthermore, one can project a new test example using only k kernel evaluations, where k is the output dimensionality. Computational results on several real-world data sets show that SMA and SMC extract features which are as predictive as those found using other popular feature extraction methods. Additionally, on large text retrieval and face detection data sets, they produce features which match the performance of the original ones in conjunction with a Support Vector Machine.

  4. Accelerating sparse linear algebra using graphics processing units

    Spagnoli, Kyle E.; Humphrey, John R.; Price, Daniel K.; Kelmelis, Eric J.


    The modern graphics processing unit (GPU) found in many standard personal computers is a highly parallel math processor capable of over 1 TFLOPS of peak computational throughput at a cost similar to a high-end CPU with excellent FLOPS-to-watt ratio. High-level sparse linear algebra operations are computationally intense, often requiring large amounts of parallel operations and would seem a natural fit for the processing power of the GPU. Our work is on a GPU accelerated implementation of sparse linear algebra routines. We present results from both direct and iterative sparse system solvers. The GPU execution model featured by NVIDIA GPUs based on CUDA demands very strong parallelism, requiring between hundreds and thousands of simultaneous operations to achieve high performance. Some constructs from linear algebra map extremely well to the GPU and others map poorly. CPUs, on the other hand, do well at smaller order parallelism and perform acceptably during low-parallelism code segments. Our work addresses this via hybrid a processing model, in which the CPU and GPU work simultaneously to produce results. In many cases, this is accomplished by allowing each platform to do the work it performs most naturally. For example, the CPU is responsible for graph theory portion of the direct solvers while the GPU simultaneously performs the low level linear algebra routines.

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

    Labschutz, Matthias


    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.

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

    Wang, Jim Jing-Yan


    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.

  7. SparseAssembler2: Sparse k-mer Graph for Memory Efficient Genome Assembly

    Ye, Chengxi; Ma, Zhanshan Sam; Yu, Douglas W; Pop, Mihai


    Motivation: To tackle the problem of huge memory usage associated with de Bruijn graph-based algorithms, upon which some of the most widely used de novo genome assemblers have been built, we released SparseAssembler1. SparseAssembler1 can save as much as 90% memory consumption in comparison with the state-of-art assemblers, but it requires rounds of denoising to accurately assemble genomes. In this paper, we introduce a new general model for genome assembly that uses only sparse k-mers. The new model replaces the idea of the de Bruijn graph from the beginning, and achieves similar memory efficiency and much better robustness compared with our previous SparseAssembler1. Results: Based on the sparse k-mers graph model, we develop SparseAssembler2. We demonstrate that the decomposition of reads of all overlapping k-mers, which is used in existing de Bruijn graph genome assemblers, is overly cautious. We introduce a sparse k-mer graph structure for saving sparse k-mers, which greatly reduces memory space requirem...

  8. Determination of crystallographic intensities from sparse data

    Kartik Ayyer


    Full Text Available X-ray serial microcrystallography involves the collection and merging of frames of diffraction data from randomly oriented protein microcrystals. The number of diffracted X-rays in each frame is limited by radiation damage, and this number decreases with crystal size. The data in the frame are said to be sparse if too few X-rays are collected to determine the orientation of the microcrystal. It is commonly assumed that sparse crystal diffraction frames cannot be merged, thereby setting a lower limit to the size of microcrystals that may be merged with a given source fluence. The EMC algorithm [Loh & Elser (2009, Phys. Rev. E, 80, 026705] has previously been applied to reconstruct structures from sparse noncrystalline data of objects with unknown orientations [Philipp et al. (2012, Opt. Express, 20, 13129–13137; Ayyer et al. (2014, Opt. Express, 22, 2403–2413]. Here, it is shown that sparse data which cannot be oriented on a per-frame basis can be used effectively as crystallographic data. As a proof-of-principle, reconstruction of the three-dimensional diffraction intensity using sparse data frames from a 1.35 kDa molecule crystal is demonstrated. The results suggest that serial microcrystallography is, in principle, not limited by the fluence of the X-ray source, and collection of complete data sets should be feasible at, for instance, storage-ring X-ray sources.

  9. Sparse Representation for Detection of Microcalcification Clusters

    Minghu Wang


    Full Text Available To improve the performance of microcalcification clusters (MCs detection, we present an approach to detect MCs in mammograms by casting the detection problem as finding sparse representations of test samples with respect to training samples. The ground truth training samples of MCs in mammograms are assumed to be known as a priori. The sparse representation is computed by the l1-regularized least square approach using the interior-point method. The new method based on sparse representation expresses each testing sample as a linear combination of all the training samples. The sparse coefficient vector is obtained by l1-regularized least square through learning. MCs classification is achieved by defining discriminating functions from the sparse coefficient vector for each category. To investigate its performance, the proposed method is applied to DDSM datasets and compared with support vector machines (SVMs and twin support vector machines (TWSVMs. The experimental results have shown that the performance of the proposed method is comparable with or better than those methods. In addition, the proposed method is more efficient than SVMs and TWSVMs based methods as it has no need of model selection and parameter optimization.

  10. Finding nonoverlapping substructures of a sparse matrix

    Pinar, Ali; Vassilevska, Virginia


    Many applications of scientific computing rely on computations on sparse matrices, thus the design of efficient implementations of sparse matrix kernels is crucial for the overall efficiency of these applications. Due to the high compute-to-memory ratio and irregular memory access patterns, the performance of sparse matrix kernels is often far away from the peak performance on a modern processor. Alternative data structures have been proposed, which split the original matrix A into A{sub d} and A{sub s}, so that A{sub d} contains all dense blocks of a specified size in the matrix, and A{sub s} contains the remaining entries. This enables the use of dense matrix kernels on the entries of A{sub d} producing better memory performance. In this work, we study the problem of finding a maximum number of non overlapping rectangular dense blocks in a sparse matrix, which has not been studied in the sparse matrix community. We show that the maximum non overlapping dense blocks problem is NP-complete by using a reduction from the maximum independent set problem on cubic planar graphs. We also propose a 2/3-approximation algorithm for 2 times 2 blocks that runs in linear time in the number of nonzeros in the matrix. We discuss alternatives to rectangular blocks such as diagonal blocks and cross blocks and present complexity analysis and approximation algorithms.

  11. High Angular Resolution Microwave Sensing with Large, Sparse, Random Arrays


    approximate expression 10), asa function of diversity order M1. . eric (W) -’ for x 0. 1. In order to check the validity of (10). (20). and (21). corn...B. Thomaa . An Introduction ito Statiutical Communicatiton Throrv. iNew York: Wiley. 1969.The ratio K - cra-Io, in (4-0) was found through computer

  12. Finding Frequent Patterns in a Large Sparse Graph


    data.html 4∼ cheese /ispd98.html Table 2: Datasets used in the experiments Dataset Connected Vertices Edges Labels Components...Journal of Applied Intelligence, 4:297–328, 1994. [72] M. J. Zaki and K. Gouda . Fast vertical mining using diffsets. In Proc. of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2003), 2003.

  13. Feasibility of Very Large Sparse Aperture Deployable Antennas


    erfc = Complementary error function Eb = Energy per bit N0 = Noise spectral density, M = States of the phase -shift keying method Everything...5 Figure 3: Acceptable Phase Offset .................................................................................... 6...45 xiii List of Acronyms Acronym Definition TDRS Tracking and Data Relay Satellite BER Bit Error

  14. Sparse source configurations for asteroid tomography

    Pursiainen, S.; Kaasalainen, M.


    The objective of our recent research has been to develop non-invasive imaging techniques for future planetary research and mining activities involving a challenging in situ environment and tight payload limits [1]. This presentation will deal in particular with an approach in which the internal relative permittivity ∈r or the refractive index n = √ ∈r of an asteroid is to be recovered based on radio signal transmitted by a sparse set [2] of fixed or movable landers. To address important aspects of mission planning, we have analyzed different signal source configurations to find the minimal number of source positions needed for robust localization of anomalies, such as internal voids. Characteristic to this inverse problem are the large relative changes in signal speed caused by the high permittivity of typical asteroid minerals (e.g. basalt), leading to strong refractions and reflections of the signal. Finding an appropriate problemspecific signaling arrangement is an important premission goal for successful in situ measurements. This presentation will include inversion results obtained with laboratory-recorded travel time data y of the form in which n δ denotes a perturbation of a refractive index n = n δ + nbg; gi estimates the total noise due to different error sources; (ybg)i = ∫Ci nbg ds is an entry of noiseless background data ybg; and Ci is a signal path. Also simulated time-evolution data will be covered with respect to potential u satisfying the wave equation ∈rδ2/δt2+ ōδu/δt-∆u = f, where ō is a (latent) conductivity distribution and f is a source term. Special interest will be paid to inversion robustness regarding changes of the prior model and source positioning. Among other things, our analysis suggests that strongly refractive anomalies can be detected with three or four sources independently of their positioning.

  15. Finding One Community in a Sparse Graph

    Montanari, Andrea


    We consider a random sparse graph with bounded average degree, in which a subset of vertices has higher connectivity than the background. In particular, the average degree inside this subset of vertices is larger than outside (but still bounded). Given a realization of such graph, we aim at identifying the hidden subset of vertices. This can be regarded as a model for the problem of finding a tightly knitted community in a social network, or a cluster in a relational dataset. In this paper we present two sets of contributions: ( i) We use the cavity method from spin glass theory to derive an exact phase diagram for the reconstruction problem. In particular, as the difference in edge probability increases, the problem undergoes two phase transitions, a static phase transition and a dynamic one. ( ii) We establish rigorous bounds on the dynamic phase transition and prove that, above a certain threshold, a local algorithm (belief propagation) correctly identify most of the hidden set. Below the same threshold no local algorithm can achieve this goal. However, in this regime the subset can be identified by exhaustive search. For small hidden sets and large average degree, the phase transition for local algorithms takes an intriguingly simple form. Local algorithms succeed with high probability for deg _in - deg _out > √{deg _out/e} and fail for deg _in - deg _out < √{deg _out/e} (with deg _in, deg _out the average degrees inside and outside the community). We argue that spectral algorithms are also ineffective in the latter regime. It is an open problem whether any polynomial time algorithms might succeed for deg _in - deg _out < √{deg _out/e}.


    Desmal, Abdulla


    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.

  17. Simulating sparse Hamiltonians with star decompositions

    Childs, Andrew M


    We present an efficient algorithm for simulating the time evolution due to a sparse Hamiltonian. In terms of the maximum degree d and dimension N of the space on which the Hamiltonian H acts, this algorithm uses (d^2(d+log* N)||H||)^{1+o(1)} queries. This improves the complexity of the sparse Hamiltonian simulation algorithm of Berry, Ahokas, Cleve, and Sanders, which scales like (d^4(log* N)||H||)^{1+o(1)}. To achieve this, we decompose a general sparse Hamiltonian into a small sum of Hamiltonians whose graphs of non-zero entries have the property that every connected component is a star, and efficiently simulate each of these pieces.

  18. Scalable group level probabilistic sparse factor analysis

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


    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...

  19. Sparse Multivariate Modeling: Priors and Applications

    Henao, Ricardo

    modeling, a model for peptide-protein/protein-protein interactions called latent protein tree, a framework for sparse Gaussian process classification based on active set selection and a linear multi-category sparse classifier specially targeted to gene expression data. The thesis is organized to provide......This thesis presents a collection of statistical models that attempt to take advantage of every piece of prior knowledge available to provide the models with as much structure as possible. The main motivation for introducing these models is interpretability since in practice we want to be able...... to use them as hypothesis generating tools. All of our models start from a family of structures, for instance factor models, directed acyclic graphs, classifiers, etc. Then we let them be selectively sparse as a way to provide them with structural fl exibility and interpretability. Finally, we complement...

  20. Fast wavelet based sparse approximate inverse preconditioner

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


    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.

  1. Sparse Principal Component Analysis with missing observations

    Lounici, Karim


    In this paper, we study the problem of sparse Principal Component Analysis (PCA) in the high-dimensional setting with missing observations. Our goal is to estimate the first principal component when we only have access to partial observations. Existing estimation techniques are usually derived for fully observed data sets and require a prior knowledge of the sparsity of the first principal component in order to achieve good statistical guarantees. Our contributions is threefold. First, we establish the first information-theoretic lower bound for the sparse PCA problem with missing observations. Second, we propose a simple procedure that does not require any prior knowledge on the sparsity of the unknown first principal component or any imputation of the missing observations, adapts to the unknown sparsity of the first principal component and achieves the optimal rate of estimation up to a logarithmic factor. Third, if the covariance matrix of interest admits a sparse first principal component and is in additi...

  2. Sparse regularization for force identification using dictionaries

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


    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.

  3. Binary Sparse Phase Retrieval via Simulated Annealing

    Wei Peng


    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.

  4. Structure-based bayesian sparse reconstruction

    Quadeer, Ahmed Abdul


    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.

  5. Multisnapshot Sparse Bayesian Learning for DOA

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


    The directions of arrival (DOA) of plane waves are estimated from multi-snapshot sensor array data using Sparse Bayesian Learning (SBL). The prior source amplitudes is assumed independent zero-mean complex Gaussian distributed with hyperparameters the unknown variances (i.e. the source powers). For a complex Gaussian likelihood with hyperparameter the unknown noise variance, the corresponding Gaussian posterior distribution is derived. For a given number of DOAs, the hyperparameters are automatically selected by maximizing the evidence and promote sparse DOA estimates. The SBL scheme for DOA estimation is discussed and evaluated competitively against LASSO ($\\ell_1$-regularization), conventional beamforming, and MUSIC

  6. Modeling Dinuclear Copper Sites of Biological Relevance : Synthesis, Molecular Structure, Magnetic Properties, and 1H NMR Spectroscopy of a Nonsymmetric Dinuclear Copper(II) Complex. Microcalorimetric Determination of Stepwise Complexation of Copper(II) by

    Lubben, Marcel; Hage, Ronald; Meetsma, Auke; Bÿma, Koos; Feringa, Bernard


    The new nonsymmetric dinuclear copper(II) complex [Cu2L1(OAc)2](ClO4) (7) was synthesized by complexation of Cu(OAc)2·H2O with a new nonsymmetric dinucleating ligand (5) which is formed in situ by condensation of 2-formyl-6-((4-methylpiperazin-1-yl)methyl)phenol (3a) with 2-(aminoethyl)pyridine. Com

  7. External-Memory Network Analysis Algorithms for Naturally Sparse Graphs

    Goodrich, Michael T


    In this paper, we present a number of network-analysis algorithms in the external-memory model. We focus on methods for large naturally sparse graphs, that is, n-vertex graphs that have O(n) edges and are structured so that this sparsity property holds for any subgraph of such a graph. We give efficient external-memory algorithms for the following problems for such graphs: - Finding an approximate d-degeneracy ordering; - Finding a cycle of length exactly c; - Enumerating all maximal cliques. Such problems are of interest, for example, in the analysis of social networks, where they are used to study network cohesion.

  8. Universal Collaboration Strategies for Signal Detection: A Sparse Learning Approach

    Khanduri, Prashant; Kailkhura, Bhavya; Thiagarajan, Jayaraman J.; Varshney, Pramod K.


    This paper considers the problem of high dimensional signal detection in a large distributed network whose nodes can collaborate with their one-hop neighboring nodes (spatial collaboration). We assume that only a small subset of nodes communicate with the Fusion Center (FC). We design optimal collaboration strategies which are universal for a class of deterministic signals. By establishing the equivalence between the collaboration strategy design problem and sparse PCA, we solve the problem efficiently and evaluate the impact of collaboration on detection performance.

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

    Kim, Sang-Yoon; Lim, Woochang


    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

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

    Kim, Sang-Yoon; Lim, Woochang


    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

  11. Infrared image recognition based on structure sparse and atomic sparse parallel

    Wu, Yalu; Li, Ruilong; Xu, Yi; Wang, Liping


    Use the redundancy of the super complete dictionary can capture the structural features of the image effectively, can achieving the effective representation of the image. However, the commonly used atomic sparse representation without regard the structure of the dictionary and the unrelated non-zero-term in the process of the computation, though structure sparse consider the structure feature of dictionary, the majority coefficients of the blocks maybe are non-zero, it may affect the identification efficiency. For the disadvantages of these two sparse expressions, a weighted parallel atomic sparse and sparse structure is proposed, and the recognition efficiency is improved by the adaptive computation of the optimal weights. The atomic sparse expression and structure sparse expression are respectively, and the optimal weights are calculated by the adaptive method. Methods are as follows: training by using the less part of the identification sample, the recognition rate is calculated by the increase of the certain step size and t the constraint between weight. The recognition rate as the Z axis, two weight values respectively as X, Y axis, the resulting points can be connected in a straight line in the 3 dimensional coordinate system, by solving the highest recognition rate, the optimal weights can be obtained. Through simulation experiments can be known, the optimal weights based on adaptive method are better in the recognition rate, weights obtained by adaptive computation of a few samples, suitable for parallel recognition calculation, can effectively improve the recognition rate of infrared images.

  12. Robust and Sparse Factor Modelling

    Croux, Christophe; Exterkate, Peter

    Factor construction methods are widely used to summarize a large panel of variables by means of a relatively small number of representative factors. We propose a novel factor construction procedure that enjoys the properties of robustness to outliers and of sparsity; that is, having relatively few...... nonzero factor loadings. Compared to the traditional factor construction method, we find that this procedure leads to a favorable forecasting performance in the presence of outliers and to better interpretable factors. We investigate the performance of the method in a Monte Carlo experiment...

  13. Second SIAM conference on sparse matrices: Abstracts. Final technical report



    This report contains abstracts on the following topics: invited and long presentations (IP1 & LP1); sparse matrix reordering & graph theory I; sparse matrix tools & environments I; eigenvalue computations I; iterative methods & acceleration techniques I; applications I; parallel algorithms I; sparse matrix reordering & graphy theory II; sparse matrix tool & environments II; least squares & optimization I; iterative methods & acceleration techniques II; applications II; eigenvalue computations II; least squares & optimization II; parallel algorithms II; sparse direct methods; iterative methods & acceleration techniques III; eigenvalue computations III; and sparse matrix reordering & graph theory III.

  14. A Comparative Study of Sparse Associative Memories

    Gripon, Vincent; Heusel, Judith; Löwe, Matthias; Vermet, Franck


    We study various models of associative memories with sparse information, i.e. a pattern to be stored is a random string of 0s and 1s with about log N 1s, only. We compare different synaptic weights, architectures and retrieval mechanisms to shed light on the influence of the various parameters on the storage capacity.

  15. Rotational image deblurring with sparse matrices

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


    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 cond...

  16. Multisnapshot Sparse Bayesian Learning for DOA

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


    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...... is discussed and evaluated competitively against LASSO (l(1)-regularization), conventional beamforming, and MUSIC....

  17. Array aperture extrapolation using sparse reconstruction

    Anitori, L.; Rossum, W.L. van; Huizing, A.G.


    In this paper we present some preliminary results on antenna array extrapolation for Direction Of Arrival (DOA) estimation using Sparse Reconstruction (SR). The objective of this study is to establish wether it is possible to achieve with an array of a given physical length the performance (in terms

  18. Continuous speech recognition with sparse coding

    Smit, WJ


    Full Text Available . This algorithm finds a sparse code in reasonable time if the input is limited to a fairly coarse spectral resolution. At this resolution, our system achieves a word error rate of 19%, whereas a system based on Hidden Markov Models achieves a word error rate of 15...

  19. Sparse acoustic imaging with a spherical array

    Fernandez Grande, Efren; Xenaki, Angeliki


    proposes a plane wave expansion method based on measurements with a spherical microphone array, and solved in the framework provided by Compressed Sensing. The proposed methodology results in a sparse solution, i.e. few non-zero coefficients, and it is suitable for both source localization and sound field...

  20. Sparse DOA estimation with polynomial rooting

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


    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...

  1. Multilevel sparse functional principal component analysis.

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


    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.

  2. Handling Sparse Data by Successive Abstraction

    Samuelsson, C


    A general, practical method for handling sparse data that avoids held-out data and iterative reestimation is derived from first principles. It has been tested on a part-of-speech tagging task and outperformed (deleted) interpolation with context-independent weights, even when the latter used a globally optimal parameter setting determined a posteriori.

  3. New methods for sampling sparse populations

    Anna Ringvall


    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...

  4. Better Size Estimation for Sparse Matrix Products

    Amossen, Rasmus Resen; Campagna, Andrea; Pagh, Rasmus


    We consider the problem of doing fast and reliable estimation of the number of non-zero entries in a sparse Boolean matrix product. Let n denote the total number of non-zero entries in the input matrices. We show how to compute a 1 ± ε approximation (with small probability of error) in expected...

  5. Margin based ontology sparse vector learning algorithm and applied in biology science.

    Gao, Wei; Qudair Baig, Abdul; Ali, Haidar; Sajjad, Wasim; Reza Farahani, Mohammad


    In biology field, the ontology application relates to a large amount of genetic information and chemical information of molecular structure, which makes knowledge of ontology concepts convey much information. Therefore, in mathematical notation, the dimension of vector which corresponds to the ontology concept is often very large, and thus improves the higher requirements of ontology algorithm. Under this background, we consider the designing of ontology sparse vector algorithm and application in biology. In this paper, using knowledge of marginal likelihood and marginal distribution, the optimized strategy of marginal based ontology sparse vector learning algorithm is presented. Finally, the new algorithm is applied to gene ontology and plant ontology to verify its efficiency.

  6. Asymptotic Performance of Sparse Signal Detection Using Convex Programming Method

    LEI Chuan; ZHANG Jun


    The detection of sparse signals against background noise is considered.Detecting signals of such kind is difficult since only a small portion of the signal carries information.Prior knowledge is usually assumed to ease detection.In this paper,we consider the general unknown and arbitrary sparse signal detection problem when no prior knowledge is available.Under a Neyman-Pearson hypothesis-testing framework,a new detection scheme is proposed by combining a generalized likelihood ratio test (GLRT)-like test statistic and convex programming methods which directly exploit sparsity in an underdetermined system of linear equations.We characterize large sample behavior of the proposed method by analyzing its asymptotic performance.Specifically,we give the condition for the Chernoff-consistent detection which shows that the proposed method is very sensitive to the (e)2 norm energy of the sparse signals.Both the false alarm rate and the miss rate tend to zero at vanishing signal-to-noise ratio (SNR),as long as the signal energy grows at least logarithmically with the problem dimension.Next we give a large deviation analysis to characterize the error exponent for the Neyman-Pearson detection.We derive the oracle error exponent assuming signal knowledge.Then we explicitly derive the error exponent of the proposed scheme and compare it with the oracle exponent.We complement our study with numerical experiments,showing that the proposed method performs in the vicinity of the likelihood ratio test (LRT) method in the finite sample scenario and the error probability degrades exponentially with the number of observations.

  7. Compressive sensing of sparse tensors.

    Friedland, Shmuel; Li, Qun; Schonfeld, Dan


    Compressive sensing (CS) has triggered an enormous research activity since its first appearance. CS exploits the signal's sparsity or compressibility in a particular domain and integrates data compression and acquisition, thus allowing exact reconstruction through relatively few nonadaptive linear measurements. While conventional CS theory relies on data representation in the form of vectors, many data types in various applications, such as color imaging, video sequences, and multisensor networks, are intrinsically represented by higher order tensors. Application of CS to higher order data representation is typically performed by conversion of the data to very long vectors that must be measured using very large sampling matrices, thus imposing a huge computational and memory burden. In this paper, we propose generalized tensor compressive sensing (GTCS)-a unified framework for CS of higher order tensors, which preserves the intrinsic structure of tensor data with reduced computational complexity at reconstruction. GTCS offers an efficient means for representation of multidimensional data by providing simultaneous acquisition and compression from all tensor modes. In addition, we propound two reconstruction procedures, a serial method and a parallelizable method. We then compare the performance of the proposed method with Kronecker compressive sensing (KCS) and multiway compressive sensing (MWCS). We demonstrate experimentally that GTCS outperforms KCS and MWCS in terms of both reconstruction accuracy (within a range of compression ratios) and processing speed. The major disadvantage of our methods (and of MWCS as well) is that the compression ratios may be worse than that offered by KCS.

  8. SuperLU{_}DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems

    Li, Xiaoye S.; Demmel, James W.


    In this paper, we present the main algorithmic features in the software package SuperLU{_}DIST, a distributed-memory sparse direct solver for large sets of linear equations. We give in detail our parallelization strategies, with focus on scalability issues, and demonstrate the parallel performance and scalability on current machines. The solver is based on sparse Gaussian elimination, with an innovative static pivoting strategy proposed earlier by the authors. The main advantage of static pivoting over classical partial pivoting is that it permits a priori determination of data structures and communication pattern for sparse Gaussian elimination, which makes it more scalable on distributed memory machines. Based on this a priori knowledge, we designed highly parallel and scalable algorithms for both LU decomposition and triangular solve and we show that they are suitable for large-scale distributed memory machines.

  9. Sparse Approximations of the Schur Complement for Parallel Algebraic Hybrid Solvers in 3D

    L.Giraud; A.Haidar; Y.Saad


    In this paper we study the computational performance of variants of an al-gebraic additive Schwarz preconditioner for the Schur complement for the solution of large sparse linear systems. In earlier works, the local Schur complements were com- puted exactly using a sparse direct solver. The robustness of the preconditioner comes at the price of this memory and time intensive computation that is the main bottleneck of the approach for tackling huge problems. In this work we investigate the use of sparse approximation of the dense local Schur complements. These approximations are com-puted using a partial incomplete LU factorization. Such a numerical calculation is the core of the multi-level incomplete factorization such as the one implemented in pARMS. The numerical and computing performance of the new numerical scheme is illustrated on a set of large 3D convection-diffusion problems;preliminary experiments on linear systems arising from structural mechanics are also reported.

  10. On a Nonsymmetric Keyfitz-Kranzer System of Conservation Laws with Generalized and Modified Chaplygin Gas Pressure Law

    Hongjun Cheng


    Full Text Available This paper is devoted to the study of a nonsymmetric Keyfitz-Kranzer system of conservation laws with the generalized and modified Chaplygin gas pressure law, which may admit delta shock waves, a topic of interest. Firstly, we solve the Riemann problems with piecewise constant data having a single discontinuity. For the generalized Chaplygin gas pressure law, the solution consists of three different structures: R+J, S+J, and δ. Existence and uniqueness of delta shock solution are established under the generalized Rankine-Hugoniot relation and entropy condition. For the modified Chaplygin gas pressure law, the structures of solution are R+J and S+J. Secondly, we discuss the limits of Riemann solutions for the modified Chaplygin gas pressure law as the pressure law tends to the generalized Chaplygin gas one. In particular, for some cases, the solution S+J tends to a delta shock wave, and it is different from the delta shock wave for the generalized Chaplygin gas pressure law with the same initial data. Thirdly, we simulate the Riemann solutions and examine the formation process of delta shock wave by employing the Nessyahu-Tadmor scheme. The numerical results are coincident with the theoretical analysis.

  11. Carbonate, acetate and phenolate phosphonium salts as catalysts in transesterification reactions for the synthesis of non-symmetric dialkyl carbonates.

    Selva, Maurizio; Noè, Marco; Perosa, Alvise; Gottardo, Marina


    Methyl trioctylphosphonium methyl carbonate [P(8881)](+)[MeOCO(2)](-) was prepared by the alkylation of trioctyl phosphine with the non-toxic dimethyl carbonate. This salt was a convenient source to synthesize different ionic liquids where the methyl trioctylphosphonium cation was coupled to weakly basic anions such as bicarbonate, acetate, and phenolate. At 90-220 °C, all these compounds [P(8881)](+)X(-); X = MeOCO(2); HOCO(2); AcO; PhO were excellent organocatalysts for the transesterification of dimethyl and diethyl carbonate with primary and secondary alcohols, including benzyl alcohol, cyclopentanol, cyclohexanol, and the rather sterically hindered menthol. Conditions were optimized to operate with very low catalyst loadings up to 1 mol% and to obtain non-symmetric dialkyl carbonates (ROCO(2)R'; R = Me, Et) with selectivity up to 99% and isolated yields >90%. The catalytic performance of the investigated ionic liquids was discussed through a cooperative mechanism of simultaneous activation of both electrophilic and nucleophilic reactants.

  12. Relative species abundance of replicator dynamics with sparse interactions

    Obuchi, Tomoyuki; Kabashima, Yoshiyuki; Tokita, Kei


    A theory of relative species abundance on sparsely-connected networks is presented by investigating the replicator dynamics with symmetric interactions. Sparseness of a network involves difficulty in analyzing the fixed points of the equation, and we avoid this problem by treating large self interaction u, which allows us to construct a perturbative expansion. Based on this perturbation, we find that the nature of the interactions is directly connected to the abundance distribution, and some characteristic behaviors, such as multiple peaks in the abundance distribution and all species coexistence at moderate values of u, are discovered in a wide class of the distribution of the interactions. The all species coexistence collapses at a critical value of u, u c , and this collapsing is regarded as a phase transition. To get more quantitative information, we also construct a non-perturbative theory on random graphs based on techniques of statistical mechanics. The result shows those characteristic behaviors are sustained well even for not large u. For even smaller values of u, extinct species start to appear and the abundance distribution becomes rounded and closer to a standard functional form. Another interesting finding is the non-monotonic behavior of diversity, which quantifies the number of coexisting species, when changing the ratio of mutualistic relations Δ . These results are examined by numerical simulations, which show that our theory is exact for the case without extinct species, but becomes less and less precise as the proportion of extinct species grows.

  13. Fast Private Data Release Algorithms for Sparse Queries

    Blum, Avrim


    We revisit the problem of accurately answering large classes of statistical queries while preserving differential privacy. Previous approaches to this problem have either been very general but have not had run-time polynomial in the size of the database, have applied only to very limited classes of queries, or have relaxed the notion of worst-case error guarantees. In this paper we consider the large class of sparse queries, which take non-zero values on only polynomially many universe elements. We give efficient query release algorithms for this class, in both the interactive and the non-interactive setting. Our algorithms also achieve better accuracy bounds than previous general techniques do when applied to sparse queries: our bounds are independent of the universe size. In fact, even the runtime of our interactive mechanism is independent of the universe size, and so can be implemented in the "infinite universe" model in which no finite universe need be specified by the data curator.

  14. Classification of Histology Sections via Multispectral Convolutional Sparse Coding.

    Zhou, Yin; Chang, Hang; Barner, Kenneth; Spellman, Paul; Parvin, Bahram


    Image-based classification of histology sections plays an important role in predicting clinical outcomes. However this task is very challenging due to the presence of large technical variations (e.g., fixation, staining) and biological heterogeneities (e.g., cell type, cell state). In the field of biomedical imaging, for the purposes of visualization and/or quantification, different stains are typically used for different targets of interest (e.g., cellular/subcellular events), which generates multi-spectrum data (images) through various types of microscopes and, as a result, provides the possibility of learning biological-component-specific features by exploiting multispectral information. We propose a multispectral feature learning model that automatically learns a set of convolution filter banks from separate spectra to efficiently discover the intrinsic tissue morphometric signatures, based on convolutional sparse coding (CSC). The learned feature representations are then aggregated through the spatial pyramid matching framework (SPM) and finally classified using a linear SVM. The proposed system has been evaluated using two large-scale tumor cohorts, collected from The Cancer Genome Atlas (TCGA). Experimental results show that the proposed model 1) outperforms systems utilizing sparse coding for unsupervised feature learning (e.g., PSD-SPM [5]); 2) is competitive with systems built upon features with biological prior knowledge (e.g., SMLSPM [4]).

  15. Visual recognition and inference using dynamic overcomplete sparse learning.

    Murray, Joseph F; Kreutz-Delgado, Kenneth


    We present a hierarchical architecture and learning algorithm for visual recognition and other visual inference tasks such as imagination, reconstruction of occluded images, and expectation-driven segmentation. Using properties of biological vision for guidance, we posit a stochastic generative world model and from it develop a simplified world model (SWM) based on a tractable variational approximation that is designed to enforce sparse coding. Recent developments in computational methods for learning overcomplete representations (Lewicki & Sejnowski, 2000; Teh, Welling, Osindero, & Hinton, 2003) suggest that overcompleteness can be useful for visual tasks, and we use an overcomplete dictionary learning algorithm (Kreutz-Delgado, et al., 2003) as a preprocessing stage to produce accurate, sparse codings of images. Inference is performed by constructing a dynamic multilayer network with feedforward, feedback, and lateral connections, which is trained to approximate the SWM. Learning is done with a variant of the back-propagation-through-time algorithm, which encourages convergence to desired states within a fixed number of iterations. Vision tasks require large networks, and to make learning efficient, we take advantage of the sparsity of each layer to update only a small subset of elements in a large weight matrix at each iteration. Experiments on a set of rotated objects demonstrate various types of visual inference and show that increasing the degree of overcompleteness improves recognition performance in difficult scenes with occluded objects in clutter.

  16. Spatial Compressive Sensing for Strain Data Reconstruction from Sparse Sensors


    Spatial Compressive Sensing for Strain Data Reconstruction from Sparse Sensors by Mulugeta A Haile ARL-TR-7126 October 2014...Spatial Compressive Sensing for Strain Data Reconstruction from Sparse Sensors Mulugeta A Haile Vehicle Technology Directorate, ARL...

  17. Multiple Endmember Hyperspectral Sparse Unmixing Based on Improved OMP Algorithm

    Chunhui Zhao; Haifeng Zhu; Shiling Cui; Bin Qi


    In conventional linear spectral mixture analysis model, a class is represented by a single endmember. However, the intra-class spectral variability is usually very large, which makes it difficult to represent a class, and in this case, it leads to incorrect unmixing results. Some proposed algorithms play a positive role in overcoming the endmember variability, but there are shortcomings on computation intensive, unsatisfactory unmixing results and so on. Recently, sparse regression has been applied to unmixing, assuming each mixed pixel can be expressed as a linear combination of only a few spectra in a spectral library. It is essentially the same as multiple endmember spectral unmixing. OMP (orthogonal matching pursuit), a sparse reconstruction algorithm, has advantages of simple structure and high efficiency. However, it does not take into account the constraints of abundance non⁃negativity and abundance sum⁃to⁃one ( ANC and ASC ) , leading to undesirable unmixing results. In order to solve these issues, this paper presents an improved OMP algorithm ( fully constraint OMP, FOMP ) for multiple endmember hyperspectral sparse unmixing. The proposed algorithm overcomes the shortcomings of OMP, and on the other hand, it solves the problem of endmember variability. The ANC and ASC constraints are firstly added into the OMP algorithm, and then the endmember set is refined by the relative increase in root⁃mean⁃square⁃error ( RMSE) to avoid over⁃fitting, finally pixels are unmixed by their optimal endmember set. The simulated and real hyperspectral data experiments show that FOPM unmixing results are ideally comparable and abundance RMSE reduces much lower than OMP and simple spectral mixture analysis ( sSMA) , and has a strong anti⁃noise performance. It proves that multiple endmember spectral mixture analysis is more reasonable.

  18. Prediction of siRNA potency using sparse logistic regression.

    Hu, Wei; Hu, John


    RNA interference (RNAi) can modulate gene expression at post-transcriptional as well as transcriptional levels. Short interfering RNA (siRNA) serves as a trigger for the RNAi gene inhibition mechanism, and therefore is a crucial intermediate step in RNAi. There have been extensive studies to identify the sequence characteristics of potent siRNAs. One such study built a linear model using LASSO (Least Absolute Shrinkage and Selection Operator) to measure the contribution of each siRNA sequence feature. This model is simple and interpretable, but it requires a large number of nonzero weights. We have introduced a novel technique, sparse logistic regression, to build a linear model using single-position specific nucleotide compositions which has the same prediction accuracy of the linear model based on LASSO. The weights in our new model share the same general trend as those in the previous model, but have only 25 nonzero weights out of a total 84 weights, a 54% reduction compared to the previous model. Contrary to the linear model based on LASSO, our model suggests that only a few positions are influential on the efficacy of the siRNA, which are the 5' and 3' ends and the seed region of siRNA sequences. We also employed sparse logistic regression to build a linear model using dual-position specific nucleotide compositions, a task LASSO is not able to accomplish well due to its high dimensional nature. Our results demonstrate the superiority of sparse logistic regression as a technique for both feature selection and regression over LASSO in the context of siRNA design.

  19. Model Selection Through Sparse Maximum Likelihood Estimation

    Banerjee, Onureena; D'Aspremont, Alexandre


    We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to solve a maximum likelihood problem with an added l_1-norm penalty term. The problem as formulated is convex but the memory requirements and complexity of existing interior point methods are prohibitive for problems with more than tens of nodes. We present two new algorithms for solving problems with at least a thousand nodes in the Gaussian case. Our first algorithm uses block coordinate descent, and can be interpreted as recursive l_1-norm penalized regression. Our second algorithm, based on Nesterov's first order method, yields a complexity estimate with a better dependence on problem size than existing interior point methods. Using a log determinant relaxation of the log partition function (Wainwright & Jordan (2006)), we show that these same algorithms can be used to solve an approximate sparse maximum likelihood problem for...

  20. Compressed imaging by sparse random convolution.

    Marcos, Diego; Lasser, Theo; López, Antonio; Bourquard, Aurélien


    The theory of compressed sensing (CS) shows that signals can be acquired at sub-Nyquist rates if they are sufficiently sparse or compressible. Since many images bear this property, several acquisition models have been proposed for optical CS. An interesting approach is random convolution (RC). In contrast with single-pixel CS approaches, RC allows for the parallel capture of visual information on a sensor array as in conventional imaging approaches. Unfortunately, the RC strategy is difficult to implement as is in practical settings due to important contrast-to-noise-ratio (CNR) limitations. In this paper, we introduce a modified RC model circumventing such difficulties by considering measurement matrices involving sparse non-negative entries. We then implement this model based on a slightly modified microscopy setup using incoherent light. Our experiments demonstrate the suitability of this approach for dealing with distinct CS scenarii, including 1-bit CS.

  1. A Sparse-Feature-Based Face Detector

    LUXiaofeng; ZHENGNanning; ZHENGSongfeng


    Local features and global features are two kinds of important statistical features used to distinguish faces from nonfaces. They are both special cases of sparse features. A final classifier can be considered as a combination of a set of selected weak classiflers, and each weak classifier uses a sparse feature to classify samples. Motivated by this thought, we construct an over complete set of weak classifiers using LPSVM (Linear proximal support vector machine) algorithm, and then we select part of them using AdaBoost algorithm and combine the selected weak classifiers to form a strong classifier. And duringthe course of feature extraction and selection, our method can minimize the classification error directly, whereas most previous works cannot do this. The main difference from other methods is that the local features are learned from the training set instead of being arbitrarily defined. We applied our method to face detection; the test result shows that this method performs well.

  2. Local sparse representation for astronomical image denoising

    杨阿锋; 鲁敏; 滕书华; 孙即祥


    Motivated by local coordinate coding(LCC) theory in nonlinear manifold learning, a new image representation model called local sparse representation(LSR) for astronomical image denoising was proposed. Borrowing ideas from surrogate function and applying the iterative shrinkage-thresholding algorithm(ISTA), an iterative shrinkage operator for LSR was derived. Meanwhile, a fast approximated LSR method by first performing a K-nearest-neighbor search and then solving a l1optimization problem was presented under the guarantee of denoising performance. In addition, the LSR model and adaptive dictionary learning were incorporated into a unified optimization framework, which explicitly established the inner connection of them. Such processing allows us to simultaneously update sparse coding vectors and the dictionary by alternating optimization method. The experimental results show that the proposed method is superior to the traditional denoising method and reaches state-of-the-art performance on astronomical image.

  3. Faster exon assembly by sparse spliced alignment

    Tiskin, Alexander


    Assembling a gene from candidate exons is an important problem in computational biology. Among the most successful approaches to this problem is \\emph{spliced alignment}, proposed by Gelfand et al., which scores different candidate exon chains within a DNA sequence of length $m$ by comparing them to a known related gene sequence of length n, $m = \\Theta(n)$. Gelfand et al.\\ gave an algorithm for spliced alignment running in time O(n^3). Kent et al.\\ considered sparse spliced alignment, where the number of candidate exons is O(n), and proposed an algorithm for this problem running in time O(n^{2.5}). We improve on this result, by proposing an algorithm for sparse spliced alignment running in time O(n^{2.25}). Our approach is based on a new framework of \\emph{quasi-local string comparison}.

  4. Sparse representation for color image restoration.

    Mairal, Julien; Elad, Michael; Sapiro, Guillermo


    Sparse representations of signals have drawn considerable interest in recent years. The assumption that natural signals, such as images, admit a sparse decomposition over a redundant dictionary leads to efficient algorithms for handling such sources of data. In particular, the design of well adapted dictionaries for images has been a major challenge. The K-SVD has been recently proposed for this task and shown to perform very well for various grayscale image processing tasks. In this paper, we address the problem of learning dictionaries for color images and extend the K-SVD-based grayscale image denoising algorithm that appears in. This work puts forward ways for handling nonhomogeneous noise and missing information, paving the way to state-of-the-art results in applications such as color image denoising, demosaicing, and inpainting, as demonstrated in this paper.

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

    Dongdong eLin


    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

  6. Efficient Learning of Sparse Invariant Representations

    Gregor, Karol


    We propose a simple and efficient algorithm for learning sparse invariant representations from unlabeled data with fast inference. When trained on short movies sequences, the learned features are selective to a range of orientations and spatial frequencies, but robust to a wide range of positions, similar to complex cells in the primary visual cortex. We give a hierarchical version of the algorithm, and give guarantees of fast convergence under certain conditions.

  7. Sparse Positional Strategies for Safety Games

    Rüdiger Ehlers


    Full Text Available We consider the problem of obtaining sparse positional strategies for safety games. Such games are a commonly used model in many formal methods, as they make the interaction of a system with its environment explicit. Often, a winning strategy for one of the players is used as a certificate or as an artefact for further processing in the application. Small such certificates, i.e., strategies that can be written down very compactly, are typically preferred. For safety games, we only need to consider positional strategies. These map game positions of a player onto a move that is to be taken by the player whenever the play enters that position. For representing positional strategies compactly, a common goal is to minimize the number of positions for which a winning player's move needs to be defined such that the game is still won by the same player, without visiting a position with an undefined next move. We call winning strategies in which the next move is defined for few of the player's positions sparse. Unfortunately, even roughly approximating the density of the sparsest strategy for a safety game has been shown to be NP-hard. Thus, to obtain sparse strategies in practice, one either has to apply some heuristics, or use some exhaustive search technique, like ILP (integer linear programming solving. In this paper, we perform a comparative study of currently available methods to obtain sparse winning strategies for the safety player in safety games. We consider techniques from common knowledge, such as using ILP or SAT (satisfiability solving, and a novel technique based on iterative linear programming. The results of this paper tell us if current techniques are already scalable enough for practical use.

  8. Inpainting with sparse linear combinations of exemplars

    Wohlberg, Brendt [Los Alamos National Laboratory


    We introduce a new exemplar-based inpainting algorithm based on representing the region to be inpainted as a sparse linear combination of blocks extracted from similar parts of the image being inpainted. This method is conceptually simple, being computed by functional minimization, and avoids the complexity of correctly ordering the filling in of missing regions of other exemplar-based methods. Initial performance comparisons on small inpainting regions indicate that this method provides similar or better performance than other recent methods.

  9. Efficient segmentation by sparse pixel classification

    Dam, Erik B; Loog, Marco


    Segmentation methods based on pixel classification are powerful but often slow. We introduce two general algorithms, based on sparse classification, for optimizing the computation while still obtaining accurate segmentations. The computational costs of the algorithms are derived......, and they are demonstrated on real 3-D magnetic resonance imaging and 2-D radiograph data. We show that each algorithm is optimal for specific tasks, and that both algorithms allow a speedup of one or more orders of magnitude on typical segmentation tasks....

  10. Sparse DOA estimation with polynomial rooting

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


    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...

  11. A Patch-based Sparse Representation for Sketch Recognition

    Qi, Yonggong; Zhang, Honggang; Song, Yi-Zhe


    , such as Symmetric-aware Flip Invariant Sketch Histogram (SYM-FISH). We present a novel patch-based sparse representation (PSR) for describing sketch image and it is evaluated under a sketch recognition framework. Extensive experiments on a large scale human drawn sketch dataset demonstrate the effectiveness......Categorizing free-hand human sketches has profound implications in applications such as human computer interaction and image retrieval. The task is non-trivial due to the iconic nature of sketches, signified by large variances in both appearance and structure when compared with photographs. One...... of the most fundamental problem is how to effectively describe a sketch image. Many existing descriptors, such as Histogram of Oriented Gradients (HOG) and Shape Context (SC), have achieved great success. Moreover, some works have attempted to design features specifically engineered for sketches...

  12. M-estimation for robust sparse unmixing of hyperspectral images

    Toomik, Maria; Lu, Shijian; Nelson, James D. B.


    Hyperspectral unmixing methods often use a conventional least squares based lasso which assumes that the data follows the Gaussian distribution. The normality assumption is an approximation which is generally invalid for real imagery data. We consider a robust (non-Gaussian) approach to sparse spectral unmixing of remotely sensed imagery which reduces the sensitivity of the estimator to outliers and relaxes the linearity assumption. The method consists of several appropriate penalties. We propose to use an lp norm with 0 Gaussian likelihood with a fixed function ρ(e) that restrains outliers. The M-estimate function reduces the effect of errors with large amplitudes or even assigns the outliers zero weights. Our experimental results on real hyperspectral data show that noise with large amplitudes (outliers) often exists in the data. This ability to mitigate the influence of such outliers can therefore offer greater robustness. Qualitative hyperspectral unmixing results on real hyperspectral image data corroborate the efficacy of the proposed method.

  13. Spectral community detection in sparse networks

    Newman, M E J


    Spectral methods based on the eigenvectors of matrices are widely used in the analysis of network data, particularly for community detection and graph partitioning. Standard methods based on the adjacency matrix and related matrices, however, break down for very sparse networks, which includes many networks of practical interest. As a solution to this problem it has been recently proposed that we focus instead on the spectrum of the non-backtracking matrix, an alternative matrix representation of a network that shows better behavior in the sparse limit. Inspired by this suggestion, we here make use of a relaxation method to derive a spectral community detection algorithm that works well even in the sparse regime where other methods break down. Interestingly, however, the matrix at the heart of the method, it turns out, is not exactly the non-backtracking matrix, but a variant of it with a somewhat different definition. We study the behavior of this variant matrix for both artificial and real-world networks an...

  14. Sparse image reconstruction for molecular imaging

    Ting, Michael; Hero, Alfred O


    The application that motivates this paper is molecular imaging at the atomic level. When discretized at sub-atomic distances, the volume is inherently sparse. Noiseless measurements from an imaging technology can be modeled by convolution of the image with the system point spread function (psf). Such is the case with magnetic resonance force microscopy (MRFM), an emerging technology where imaging of an individual tobacco mosaic virus was recently demonstrated with nanometer resolution. We also consider additive white Gaussian noise (AWGN) in the measurements. Many prior works of sparse estimators have focused on the case when H has low coherence; however, the system matrix H in our application is the convolution matrix for the system psf. A typical convolution matrix has high coherence. The paper therefore does not assume a low coherence H. A discrete-continuous form of the Laplacian and atom at zero (LAZE) p.d.f. used by Johnstone and Silverman is formulated, and two sparse estimators derived by maximizing t...

  15. Modified sparse regularization for electrical impedance tomography.

    Fan, Wenru; Wang, Huaxiang; Xue, Qian; Cui, Ziqiang; Sun, Benyuan; Wang, Qi


    Electrical impedance tomography (EIT) aims to estimate the electrical properties at the interior of an object from current-voltage measurements on its boundary. It has been widely investigated due to its advantages of low cost, non-radiation, non-invasiveness, and high speed. Image reconstruction of EIT is a nonlinear and ill-posed inverse problem. Therefore, regularization techniques like Tikhonov regularization are used to solve the inverse problem. A sparse regularization based on L1 norm exhibits superiority in preserving boundary information at sharp changes or discontinuous areas in the image. However, the limitation of sparse regularization lies in the time consumption for solving the problem. In order to further improve the calculation speed of sparse regularization, a modified method based on separable approximation algorithm is proposed by using adaptive step-size and preconditioning technique. Both simulation and experimental results show the effectiveness of the proposed method in improving the image quality and real-time performance in the presence of different noise intensities and conductivity contrasts.

  16. Sparse Bayesian learning in ISAR tomography imaging

    SU Wu-ge; WANG Hong-qiang; DENG Bin; WANG Rui-jun; QIN Yu-liang


    Inverse synthetic aperture radar (ISAR) imaging can be regarded as a narrow-band version of the computer aided tomography (CT). The traditional CT imaging algorithms for ISAR, including the polar format algorithm (PFA) and the convolution back projection algorithm (CBP), usually suffer from the problem of the high sidelobe and the low resolution. The ISAR tomography image reconstruction within a sparse Bayesian framework is concerned. Firstly, the sparse ISAR tomography imaging model is established in light of the CT imaging theory. Then, by using the compressed sensing (CS) principle, a high resolution ISAR image can be achieved with limited number of pulses. Since the performance of existing CS-based ISAR imaging algorithms is sensitive to the user parameter, this makes the existing algorithms inconvenient to be used in practice. It is well known that the Bayesian formalism of recover algorithm named sparse Bayesian learning (SBL) acts as an effective tool in regression and classification, which uses an efficient expectation maximization procedure to estimate the necessary parameters, and retains a preferable property of thel0-norm diversity measure. Motivated by that, a fully automated ISAR tomography imaging algorithm based on SBL is proposed. Experimental results based on simulated and electromagnetic (EM) data illustrate the effectiveness and the superiority of the proposed algorithm over the existing algorithms.

  17. A Dirty Model for Multiple Sparse Regression

    Jalali, Ali; Sanghavi, Sujay


    Sparse linear regression -- finding an unknown vector from linear measurements -- is now known to be possible with fewer samples than variables, via methods like the LASSO. We consider the multiple sparse linear regression problem, where several related vectors -- with partially shared support sets -- have to be recovered. A natural question in this setting is whether one can use the sharing to further decrease the overall number of samples required. A line of recent research has studied the use of \\ell_1/\\ell_q norm block-regularizations with q>1 for such problems; however these could actually perform worse in sample complexity -- vis a vis solving each problem separately ignoring sharing -- depending on the level of sharing. We present a new method for multiple sparse linear regression that can leverage support and parameter overlap when it exists, but not pay a penalty when it does not. A very simple idea: we decompose the parameters into two components and regularize these differently. We show both theore...

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

    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

  19. Dynamic Stochastic Superresolution of sparsely observed turbulent systems

    Branicki, M., E-mail: [Department of Mathematics and Center for Atmosphere Ocean Science, Courant Institute of Mathematical Sciences, New York University (United States); Majda, A.J. [Department of Mathematics and Center for Atmosphere Ocean Science, Courant Institute of Mathematical Sciences, New York University (United States)


    Real-time capture of the relevant features of the unresolved turbulent dynamics of complex natural systems from sparse noisy observations and imperfect models is a notoriously difficult problem. The resulting lack of observational resolution and statistical accuracy in estimating the important turbulent processes, which intermittently send significant energy to the large-scale fluctuations, hinders efficient parameterization and real-time prediction using discretized PDE models. This issue is particularly subtle and important when dealing with turbulent geophysical systems with an vast range of interacting spatio-temporal scales and rough energy spectra near the mesh scale of numerical models. Here, we introduce and study a suite of general Dynamic Stochastic Superresolution (DSS) algorithms and show that, by appropriately filtering sparse regular observations with the help of cheap stochastic exactly solvable models, one can derive stochastically ‘superresolved’ velocity fields and gain insight into the important characteristics of the unresolved dynamics, including the detection of the so-called black swans. The DSS algorithms operate in Fourier domain and exploit the fact that the coarse observation network aliases high-wavenumber information into the resolved waveband. It is shown that these cheap algorithms are robust and have significant skill on a test bed of turbulent solutions from realistic nonlinear turbulent spatially extended systems in the presence of a significant model error. In particular, the DSS algorithms are capable of successfully capturing time-localized extreme events in the unresolved modes, and they provide good and robust skill for recovery of the unresolved processes in terms of pattern correlation. Moreover, we show that DSS improves the skill for recovering the primary modes associated with the sparse observation mesh which is equally important in applications. The skill of the various DSS algorithms depends on the energy spectrum

  20. Efficient visual tracking via low-complexity sparse representation

    Lu, Weizhi; Zhang, Jinglin; Kpalma, Kidiyo; Ronsin, Joseph


    Thanks to its good performance on object recognition, sparse representation has recently been widely studied in the area of visual object tracking. Up to now, little attention has been paid to the complexity of sparse representation, while most works are focused on the performance improvement. By reducing the computation load related to sparse representation hundreds of times, this paper proposes by far the most computationally efficient tracking approach based on sparse representation. The proposal simply consists of two stages of sparse representation, one is for object detection and the other for object validation. Experimentally, it achieves better performance than some state-of-the-art methods in both accuracy and speed.

  1. Finding column depedencies in sparse matrices over $ F_ 2 $ by block Wiedemann

    Penninga, O.


    Large systems of linear equations over $mathbb{F_2$ with sparse coefficient matrices have to be solved as a part of integer factorization with sieve-based methods such as in the Number Field Sieve algorithm. In this report, we first discuss the Wiedemann algorithm to solve these systems and investig

  2. Global Convergence of Schubert’s Method for Solving Sparse Nonlinear Equations

    Huiping Cao


    Full Text Available Schubert’s method is an extension of Broyden’s method for solving sparse nonlinear equations, which can preserve the zero-nonzero structure defined by the sparse Jacobian matrix and can retain many good properties of Broyden’s method. In particular, Schubert’s method has been proved to be locally and q-superlinearly convergent. In this paper, we globalize Schubert’s method by using a nonmonotone line search. Under appropriate conditions, we show that the proposed algorithm converges globally and superlinearly. Some preliminary numerical experiments are presented, which demonstrate that our algorithm is effective for large-scale problems.

  3. Sparse Representation for Classification of Tumors Using Gene Expression Data

    Xiyi Hang


    Full Text Available Personalized drug design requires the classification of cancer patients as accurate as possible. With advances in genome sequencing and microarray technology, a large amount of gene expression data has been and will continuously be produced from various cancerous patients. Such cancer-alerted gene expression data allows us to classify tumors at the genomewide level. However, cancer-alerted gene expression datasets typically have much more number of genes (features than that of samples (patients, which imposes a challenge for classification of tumors. In this paper, a new method is proposed for cancer diagnosis using gene expression data by casting the classification problem as finding sparse representations of test samples with respect to training samples. The sparse representation is computed by the l1-regularized least square method. To investigate its performance, the proposed method is applied to six tumor gene expression datasets and compared with various support vector machine (SVM methods. The experimental results have shown that the performance of the proposed method is comparable with or better than those of SVMs. In addition, the proposed method is more efficient than SVMs as it has no need of model selection.

  4. Advanced spectral analysis of ionospheric waves observed with sparse arrays

    Helmboldt, J. F.; Intema, H. T.


    This paper presents a case study from a single, 6h observing period to illustrate the application of techniques developed for interferometric radio telescopes to the spectral analysis of observations of ionospheric fluctuations with sparse arrays. We have adapted the deconvolution methods used for making high dynamic range images of cosmic sources with radio arrays to making comparably high dynamic range maps of spectral power of wavelike ionospheric phenomena. In the example presented here, we have used observations of the total electron content (TEC) gradient derived from Very Large Array (VLA) observations of synchrotron emission from two galaxy clusters at 330MHz as well as GPS-based TEC measurements from a sparse array of 33 receivers located within New Mexico near the VLA. We show that these techniques provide a significant improvement in signal-to-noise ratio (S/N) of detected wavelike structures by correcting for both measurement inaccuracies and wavefront distortions. This is especially true for the GPS data when combining all available satellite/receiver pairs, which probe a larger physical area and likely have a wider variety of measurement errors than in the single-satellite case. In this instance, we found that the peak S/N of the detected waves was improved by more than an order of magnitude. The data products generated by the deconvolution procedure also allow for a reconstruction of the fluctuations as a two-dimensional waveform/phase screen that can be used to correct for their effects.

  5. Threshold partitioning of sparse matrices and applications to Markov chains

    Choi, Hwajeong; Szyld, D.B. [Temple Univ., Philadelphia, PA (United States)


    It is well known that the order of the variables and equations of a large, sparse linear system influences the performance of classical iterative methods. In particular if, after a symmetric permutation, the blocks in the diagonal have more nonzeros, classical block methods have a faster asymptotic rate of convergence. In this paper, different ordering and partitioning algorithms for sparse matrices are presented. They are modifications of PABLO. In the new algorithms, in addition to the location of the nonzeros, the values of the entries are taken into account. The matrix resulting after the symmetric permutation has dense blocks along the diagonal, and small entries in the off-diagonal blocks. Parameters can be easily adjusted to obtain, for example, denser blocks, or blocks with elements of larger magnitude. In particular, when the matrices represent Markov chains, the permuted matrices are well suited for block iterative methods that find the corresponding probability distribution. Applications to three types of methods are explored: (1) Classical block methods, such as Block Gauss Seidel. (2) Preconditioned GMRES, where a block diagonal preconditioner is used. (3) Iterative aggregation method (also called aggregation/disaggregation) where the partition obtained from the ordering algorithm with certain parameters is used as an aggregation scheme. In all three cases, experiments are presented which illustrate the performance of the methods with the new orderings. The complexity of the new algorithms is linear in the number of nonzeros and the order of the matrix, and thus adding little computational effort to the overall solution.

  6. Synthesizing spatiotemporally sparse smartphone sensor data for bridge modal identification

    Ozer, Ekin; Feng, Maria Q.


    Smartphones as vibration measurement instruments form a large-scale, citizen-induced, and mobile wireless sensor network (WSN) for system identification and structural health monitoring (SHM) applications. Crowdsourcing-based SHM is possible with a decentralized system granting citizens with operational responsibility and control. Yet, citizen initiatives introduce device mobility, drastically changing SHM results due to uncertainties in the time and the space domains. This paper proposes a modal identification strategy that fuses spatiotemporally sparse SHM data collected by smartphone-based WSNs. Multichannel data sampled with the time and the space independence is used to compose the modal identification parameters such as frequencies and mode shapes. Structural response time history can be gathered by smartphone accelerometers and converted into Fourier spectra by the processor units. Timestamp, data length, energy to power conversion address temporal variation, whereas spatial uncertainties are reduced by geolocation services or determining node identity via QR code labels. Then, parameters collected from each distributed network component can be extended to global behavior to deduce modal parameters without the need of a centralized and synchronous data acquisition system. The proposed method is tested on a pedestrian bridge and compared with a conventional reference monitoring system. The results show that the spatiotemporally sparse mobile WSN data can be used to infer modal parameters despite non-overlapping sensor operation schedule.

  7. Dictionary learning and sparse recovery for electrodermal activity analysis

    Kelsey, Malia; Dallal, Ahmed; Eldeeb, Safaa; Akcakaya, Murat; Kleckner, Ian; Gerard, Christophe; Quigley, Karen S.; Goodwin, Matthew S.


    Measures of electrodermal activity (EDA) have advanced research in a wide variety of areas including psychophysiology; however, the majority of this research is typically undertaken in laboratory settings. To extend the ecological validity of laboratory assessments, researchers are taking advantage of advances in wireless biosensors to gather EDA data in ambulatory settings, such as in school classrooms. While measuring EDA in naturalistic contexts may enhance ecological validity, it also introduces analytical challenges that current techniques cannot address. One limitation is the limited efficiency and automation of analysis techniques. Many groups either analyze their data by hand, reviewing each individual record, or use computationally inefficient software that limits timely analysis of large data sets. To address this limitation, we developed a method to accurately and automatically identify SCRs using curve fitting methods. Curve fitting has been shown to improve the accuracy of SCR amplitude and location estimations, but have not yet been used to reduce computational complexity. In this paper, sparse recovery and dictionary learning methods are combined to improve computational efficiency of analysis and decrease run time, while maintaining a high degree of accuracy in detecting SCRs. Here, a dictionary is first created using curve fitting methods for a standard SCR shape. Then, orthogonal matching pursuit (OMP) is used to detect SCRs within a dataset using the dictionary to complete sparse recovery. Evaluation of our method, including a comparison to for speed and accuracy with existing software, showed an accuracy of 80% and a reduced run time.

  8. Reconstructing cortical current density by exploring sparseness in the transform domain.

    Ding, Lei


    In the present study, we have developed a novel electromagnetic source imaging approach to reconstruct extended cortical sources by means of cortical current density (CCD) modeling and a novel EEG imaging algorithm which explores sparseness in cortical source representations through the use of L1-norm in objective functions. The new sparse cortical current density (SCCD) imaging algorithm is unique since it reconstructs cortical sources by attaining sparseness in a transform domain (the variation map of cortical source distributions). While large variations are expected to occur along boundaries (sparseness) between active and inactive cortical regions, cortical sources can be reconstructed and their spatial extents can be estimated by locating these boundaries. We studied the SCCD algorithm using numerous simulations to investigate its capability in reconstructing cortical sources with different extents and in reconstructing multiple cortical sources with different extent contrasts. The SCCD algorithm was compared with two L2-norm solutions, i.e. weighted minimum norm estimate (wMNE) and cortical LORETA. Our simulation data from the comparison study show that the proposed sparse source imaging algorithm is able to accurately and efficiently recover extended cortical sources and is promising to provide high-accuracy estimation of cortical source extents.

  9. Experimental results and analysis of sparse microwave imaging from spaceborne radar raw data

    JIANG ChengLong; ZHANG BingChen; ZHANG Zhe; HONG Wen; WU YiRong


    Sparse microwave imaging is a novel radar framework aiming to bring revolutions to the microwave imaging according to the theory of sparse signal processing. As compressive sensing (CS) is introduced to synthetic aperture radar (SAR) imaging in recent years,the current SAR sparse imaging methods have shown their advantages over the traditional matched filtering methods.However,the requirement for these methods to process the compressed range data results in the increase of the hardware complexity.So the SAR sparse imaging method that directly uses the raw data is needed.This paper describes the method of SAR sparse imaging with raw data directly,presents the analysis of the signal-to-noise ratio (SNR) in the echo signal by combining the traditional radar equation with the compressive sensing theory,and provides the tests on 2-D simulated SAR data.The simulation results demonstrate the validity of the SNR analysis,and the good performance of the proposed method while a large percentage of the raw data is dropped. An experiment with RadarSat-1 raw data is also carried out to show the feasibility of processing the real SAR data via the method proposed in this paper.Our method is helpful for designing new SAR systems.

  10. Note on RIP-based Co-sparse Analysis

    Li, Lianlin


    Over the past years, there are increasing interests in recovering the signals from undersampling data where such signals are sparse under some orthogonal dictionary or tight framework, which is referred to be sparse synthetic model. More recently, its counterpart, i.e., the sparse analysis model, has also attracted researcher's attentions where many practical signals which are sparse in the truly redundant dictionary are concerned. This short paper presents important complement to the results in existing literatures for treating sparse analysis model. Firstly, we give the natural generalization of well-known restricted isometry property (RIP) to deal with sparse analysis model, where the truly arbitrary incoherent dictionary is considered. Secondly, we studied the theoretical guarantee for the accurate recovery of signal which is sparse in general redundant dictionaries through solving l1-norm sparsity-promoted optimization problem. This work shows not only that compressed sensing is viable in the context of ...

  11. Importance measures for imprecise probability distributions and their sparse grid solutions

    WANG; Pan; LU; ZhenZhou; CHENG; Lei


    For the imprecise probability distribution of structural system, the variance based importance measures (IMs) of the inputs are investigated, and three IMs are defined on the conditions of random distribution parameters, interval distribution parameters and the mixture of those two types of distribution parameters. The defined IMs can reflect the influence of the inputs on the output of the structural system with imprecise distribution parameters, respectively. Due to the large computational cost of the variance based IMs, sparse grid method is employed in this work to compute the variance based IMs at each reference point of distribution parameters. For the three imprecise distribution parameter cases, the sparse grid method and the combination of sparse grid method with genetic algorithm are used to compute the defined IMs. Numerical and engineering examples are em-ployed to demonstrate the rationality of the defined IMs and the efficiency of the applied methods.

  12. Analysis of multiple exposures in the case-crossover design via sparse conditional likelihood.

    Avalos, Marta; Grandvalet, Yves; Adroher, Nuria Duran; Orriols, Ludivine; Lagarde, Emmanuel


    We adapt the least absolute shrinkage and selection operator (lasso) and other sparse methods (elastic net and bootstrapped versions of lasso) to the conditional logistic regression model and provide a full R implementation. These variable selection procedures are applied in the context of case-crossover studies. We study the performances of conventional and sparse modelling strategies by simulations, then empirically compare results of these methods on the analysis of the association between exposure to medicinal drugs and the risk of causing an injurious road traffic crash in elderly drivers. Controlling the false discovery rate of lasso-type methods is still problematic, but this problem is also present in conventional methods. The sparse methods have the ability to provide a global analysis of dependencies, and we conclude that some of the variants compared here are valuable tools in the context of case-crossover studies with a large number of variables.

  13. Implicit kernel sparse shape representation: a sparse-neighbors-based objection segmentation framework.

    Yao, Jincao; Yu, Huimin; Hu, Roland


    This paper introduces a new implicit-kernel-sparse-shape-representation-based object segmentation framework. Given an input object whose shape is similar to some of the elements in the training set, the proposed model can automatically find a cluster of implicit kernel sparse neighbors to approximately represent the input shape and guide the segmentation. A distance-constrained probabilistic definition together with a dualization energy term is developed to connect high-level shape representation and low-level image information. We theoretically prove that our model not only derives from two projected convex sets but is also equivalent to a sparse-reconstruction-error-based representation in the Hilbert space. Finally, a "wake-sleep"-based segmentation framework is applied to drive the evolutionary curve to recover the original shape of the object. We test our model on two public datasets. Numerical experiments on both synthetic images and real applications show the superior capabilities of the proposed framework.

  14. Reliable positioning in a sparse GPS network, eastern Ontario

    Samadi Alinia, H.; Tiampo, K.; Atkinson, G. M.


    Canada hosts two regions that are prone to large earthquakes: western British Columbia, and the St. Lawrence River region in eastern Canada. Although eastern Ontario is not as seismically active as other areas of eastern Canada, such as the Charlevoix/Ottawa Valley seismic zone, it experiences ongoing moderate seismicity. In historic times, potentially damaging events have occurred in New York State (Attica, 1929, M=5.7; Plattsburg, 2002, M=5.0), north-central Ontario (Temiskaming, 1935, M=6.2; North Bay, 2000, M=5.0), eastern Ontario (Cornwall, 1944, M=5.8), Georgian Bay (2005, MN=4.3), and western Quebec (Val-Des-Bois,2010, M=5.0, MN=5.8). In eastern Canada, the analysis of detailed, high-precision measurements of surface deformation is a key component in our efforts to better characterize the associated seismic hazard. The data from precise, continuous GPS stations is necessary to adequately characterize surface velocities from which patterns and rates of stress accumulation on faults can be estimated (Mazzotti and Adams, 2005; Mazzotti et al., 2005). Monitoring of these displacements requires employing high accuracy GPS positioning techniques. Detailed strain measurements can determine whether the regional strain everywhere is commensurate with a large event occurring every few hundred years anywhere within this general area or whether large earthquakes are limited to specific areas (Adams and Halchuck, 2003; Mazzotti and Adams, 2005). In many parts of southeastern Ontario and western Québec, GPS stations are distributed quite sparsely, with spacings of approximately 100 km or more. The challenge is to provide accurate solutions for these sparse networks with an approach that is capable of achieving high-accuracy positioning. Here, various reduction techniques are applied to a sparse network installed with the Southern Ontario Seismic Network in eastern Ontario. Recent developments include the implementation of precise point positioning processing on acquired

  15. Phasing software for a free flyer space-based sparse mirror array not requiring laser interferometry

    Maker, David J.


    This paper presents new software (and simulations) that would phase a space based free flyer sparse array telescope. This particular sparse array method uses mirrors that are far enough away for sensors at the focal point module to detect tip tilt by simply using the deflection of the beam from each mirror. Also the large distance allows these circle six array mirrors to be actuated flats. For piston the secondary actuated mirrors (one for each large mirror segment of these widely spaced sparse array mirrors distributed on a parabola) are moved in real time to maximize the Strehle ratio using the light from the star the planet is revolving around since that star usually has an extremely high SNR (Signal to Noise Ratio). There is then no need for a 6DOF spider web of laser interferometric beams and deep dish mirrors (as in the competing Darwin and JPL methods) to accomplish this. Also the distance between the six 3 meter aperture mirrors could be large (kilometer range) guaranteeing a high resolution and also substantial light gathering power (with these 6 large mirrors) for imaging the details on the surface of extrasolar terrestrial type planets. In any case such a multisatellite free flyer concept would then be no more complex than the European cluster which is now operational. This is a viable concept and a compelling way to image surface detail on extra solar earthlike planets. It is the ideal engineering solution to the problem of space based large baseline sparse arrays. Significant details of the software requirements have been recently developed. In this paper the Fortran code needed to both simulate and operate the actuators in the secondary mirror for this type of sparse array is discussed.

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

    Han, Xixuan; Clemmensen, Line Katrine Harder


    techniques, for instance, 2D-Linear Discriminant Analysis (2D-LDA). Furthermore, an iterative algorithm based on the alternating direction method of multipliers is developed. The algorithm approximately solves RGED with monotonically decreasing convergence and at an acceptable speed for results of modest......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...... accuracy. Numerical experiments based on four data sets of different types of images show that RGED has competitive classification performance with existing multidimensional and sparse techniques of discriminant analysis....

  17. Space-Time Approximation with Sparse Grids

    Griebel, M; Oeltz, D; Vassilevski, P S


    In this article we introduce approximation spaces for parabolic problems which are based on the tensor product construction of a multiscale basis in space and a multiscale basis in time. Proper truncation then leads to so-called space-time sparse grid spaces. For a uniform discretization of the spatial space of dimension d with O(N{sup d}) degrees of freedom, these spaces involve for d > 1 also only O(N{sup d}) degrees of freedom for the discretization of the whole space-time problem. But they provide the same approximation rate as classical space-time Finite Element spaces which need O(N{sup d+1}) degrees of freedoms. This makes these approximation spaces well suited for conventional parabolic and for time-dependent optimization problems. We analyze the approximation properties and the dimension of these sparse grid space-time spaces for general stable multiscale bases. We then restrict ourselves to an interpolatory multiscale basis, i.e. a hierarchical basis. Here, to be able to handle also complicated spatial domains {Omega}, we construct the hierarchical basis from a given spatial Finite Element basis as follows: First we determine coarse grid points recursively over the levels by the coarsening step of the algebraic multigrid method. Then, we derive interpolatory prolongation operators between the respective coarse and fine grid points by a least squares approach. This way we obtain an algebraic hierarchical basis for the spatial domain which we then use in our space-time sparse grid approach. We give numerical results on the convergence rate of the interpolation error of these spaces for various space-time problems with two spatial dimensions. Also implementational issues, data structures and questions of adaptivity are addressed to some extent.

  18. Computing sparse derivatives and consecutive zeros problem

    Chandra, B. V. Ravi; Hossain, Shahadat


    We describe a substitution based sparse Jacobian matrix determination method using algorithmic differentiation. Utilizing the a priori known sparsity pattern, a compression scheme is determined using graph coloring. The "compressed pattern" of the Jacobian matrix is then reordered into a form suitable for computation by substitution. We show that the column reordering of the compressed pattern matrix (so as to align the zero entries into consecutive locations in each row) can be viewed as a variant of traveling salesman problem. Preliminary computational results show that on the test problems the performance of nearest-neighbor type heuristic algorithms is highly encouraging.

  19. Comparison of sparse point distribution models

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


    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...... model w.r.t. sparsity, reconstruction error and interpretability is found to be a varimax rotated model with a threshold applied to small loadings. The models describe the biological variation in the database and is used for developing robotic tools when automating labor intensive procedures...

  20. A density functional for sparse matter

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


    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...

  1. Sublinear distance labeling for sparse graphs

    Alstrup, Stephen; Dahlgaard, Søren; Knudsen, Mathias Bæk Tejs;


    between pairs of nodes that are at distance at least $D$ from each other. In this paper we consider distance labeling schemes for the classical case of unweighted and undirected graphs. We present the first distance labeling scheme of size $o(n)$ for sparse graphs (and hence bounded degree graphs......). This addresses an open problem by Gavoille et. al. [J. Algo. 2004], hereby separating the complexity from general graphs which require $\\Omega(n)$ size Moon [Proc. of Glasgow Math. Association 1965]. As an intermediate result we give a $O(\\frac{n}{D}\\log^2 D)$ $D$-preserving distance labeling scheme, improving...

  2. Distributed memory compiler design for sparse problems

    Wu, Janet; Saltz, Joel; Berryman, Harry; Hiranandani, Seema


    A compiler and runtime support mechanism is described and demonstrated. The methods presented are capable of solving a wide range of sparse and unstructured problems in scientific computing. The compiler takes as input a FORTRAN 77 program enhanced with specifications for distributing data, and the compiler outputs a message passing program that runs on a distributed memory computer. The runtime support for this compiler is a library of primitives designed to efficiently support irregular patterns of distributed array accesses and irregular distributed array partitions. A variety of Intel iPSC/860 performance results obtained through the use of this compiler are presented.

  3. Sparse Dataflow Analysis with Pointers and Reachability

    Madsen, Magnus; Møller, Anders


    for a sparse analysis framework that supports pointers and reachability. We present such a framework, which uses static single assignment form for heap addresses and computes def-use information on-the-fly. We also show that essential information about dominating definitions can be maintained efficiently using...... quadtrees. The framework is presented as a systematic modification of a traditional dataflow analysis algorithm. Our experimental results demonstrate the effectiveness of the technique for a suite of JavaScript programs. By also comparing the performance with an idealized staged approach that computes...

  4. Sparse dynamics for partial differential equations.

    Schaeffer, Hayden; Caflisch, Russel; Hauck, Cory D; Osher, Stanley


    We investigate the approximate dynamics of several differential equations when the solutions are restricted to a sparse subset of a given basis. The restriction is enforced at every time step by simply applying soft thresholding to the coefficients of the basis approximation. By reducing or compressing the information needed to represent the solution at every step, only the essential dynamics are represented. In many cases, there are natural bases derived from the differential equations, which promote sparsity. We find that our method successfully reduces the dynamics of convection equations, diffusion equations, weak shocks, and vorticity equations with high-frequency source terms.

  5. Sparse Text Indexing in Small Space

    Bille, Philip; Fischer, Johannes; Gørtz, Inge Li


    other applications in which space usage is a concern. Our first solution is Monte Carlo, and outputs the correct tree with high probability. We then give a Las Vegas algorithm, which also uses O(b) space and runs in the same time bounds with high probability when b = O(&sqrt; n). Additional trade......-offs between space usage and construction time for the Monte Carlo algorithm are given. Finally, we show that, at the expense of slower pattern queries, it is possible to construct sparse position heaps in O(n + blog b) time and O(b) space....

  6. 非对称型受阻酚抗氧剂的结构与作用特点及应用技术%Structure and function feature with application technique of non-symmetrical hindered phenol antioxidantal

    李杰; 孙书适; 夏飞; 计汝文


    分析了非对称型受阻酚抗氧剂的结构和作用特点,说明了非对称型受阻酚抗氧剂反应活性更大,反应速度较快,色泽保护性好,热氧稳定效率高。国内非对称型受阻酚抗氧剂的现有消费量很低,有较好的应用前景。%Structure and function feature of non-symmetrical hindered phenol antioxidant were analyzed.It is explained that non-symmetrical hindered phenol antioxidant has strong reaction activity,faster reaction velocity, better color retention and excellent heat-oxygen stability.In domestic market,current consumption of non-symmetrical hindered phenol antioxidant is low so it has good application prospect.

  7. Sparse regularization techniques provide novel insights into outcome integration processes.

    Mohr, Holger; Wolfensteller, Uta; Frimmel, Steffi; Ruge, Hannes


    By exploiting information that is contained in the spatial arrangement of neural activations, multivariate pattern analysis (MVPA) can detect distributed brain activations which are not accessible by standard univariate analysis. Recent methodological advances in MVPA regularization techniques have made it feasible to produce sparse discriminative whole-brain maps with highly specific patterns. Furthermore, the most recent refinement, the Graph Net, explicitly takes the 3D-structure of fMRI data into account. Here, these advanced classification methods were applied to a large fMRI sample (N=70) in order to gain novel insights into the functional localization of outcome integration processes. While the beneficial effect of differential outcomes is well-studied in trial-and-error learning, outcome integration in the context of instruction-based learning has remained largely unexplored. In order to examine neural processes associated with outcome integration in the context of instruction-based learning, two groups of subjects underwent functional imaging while being presented with either differential or ambiguous outcomes following the execution of varying stimulus-response instructions. While no significant univariate group differences were found in the resulting fMRI dataset, L1-regularized (sparse) classifiers performed significantly above chance and also clearly outperformed the standard L2-regularized (dense) Support Vector Machine on this whole-brain between-subject classification task. Moreover, additional L2-regularization via the Elastic Net and spatial regularization by the Graph Net improved interpretability of discriminative weight maps but were accompanied by reduced classification accuracies. Most importantly, classification based on sparse regularization facilitated the identification of highly specific regions differentially engaged under ambiguous and differential outcome conditions, comprising several prefrontal regions previously associated with

  8. Constraints on Fluctuations in Sparsely Characterized Biological Systems

    Hilfinger, Andreas; Norman, Thomas M.; Vinnicombe, Glenn


    Biochemical processes are inherently stochastic, creating molecular fluctuations in otherwise identical cells. Such “noise” is widespread but has proven difficult to analyze because most systems are sparsely characterized at the single cell level and because nonlinear stochastic models are analytically intractable. Here, we exactly relate average abundances, lifetimes, step sizes, and covariances for any pair of components in complex stochastic reaction systems even when the dynamics of other components are left unspecified. Using basic mathematical inequalities, we then establish bounds for whole classes of systems. These bounds highlight fundamental trade-offs that show how efficient assembly processes must invariably exhibit large fluctuations in subunit levels and how eliminating fluctuations in one cellular component requires creating heterogeneity in another. PMID:26894735

  9. Constraints on Fluctuations in Sparsely Characterized Biological Systems

    Hilfinger, Andreas; Norman, Thomas M.; Vinnicombe, Glenn; Paulsson, Johan


    Biochemical processes are inherently stochastic, creating molecular fluctuations in otherwise identical cells. Such "noise" is widespread but has proven difficult to analyze because most systems are sparsely characterized at the single cell level and because nonlinear stochastic models are analytically intractable. Here, we exactly relate average abundances, lifetimes, step sizes, and covariances for any pair of components in complex stochastic reaction systems even when the dynamics of other components are left unspecified. Using basic mathematical inequalities, we then establish bounds for whole classes of systems. These bounds highlight fundamental trade-offs that show how efficient assembly processes must invariably exhibit large fluctuations in subunit levels and how eliminating fluctuations in one cellular component requires creating heterogeneity in another.

  10. Robust sparse image reconstruction of radio interferometric observations with PURIFY

    Pratley, Luke; d'Avezac, Mayeul; Carrillo, Rafael E; Onose, Alexandru; Wiaux, Yves


    Next-generation radio interferometers, such as the Square Kilometre Array (SKA), will revolutionise our understanding of the universe through their unprecedented sensitivity and resolution. However, to realise these goals significant challenges in image and data processing need to be overcome. The standard methods in radio interferometry for reconstructing images, such as CLEAN and its variants, have served the community well over the last few decades and have survived largely because they are pragmatic. However, they produce reconstructed interferometric images that are limited in quality and they are not scalable for big data. In this work we apply and evaluate alternative interferometric reconstruction methods that make use of state-of-the-art sparse image reconstruction algorithms motivated by compressive sensing, which have been implemented in the PURIFY software package. In particular, we implement and apply the proximal alternating direction method of multipliers (P-ADMM) algorithm presented in a recen...

  11. Multiple peaks of species abundance distributions induced by sparse interactions

    Obuchi, Tomoyuki; Tokita, Kei


    We investigate the replicator dynamics with "sparse" symmetric interactions which represent specialist-specialist interactions in ecological communities. By considering a large self interaction $u$, we conduct a perturbative expansion which manifests that the nature of the interactions has a direct impact on the species abundance distribution. The central results are all species coexistence in a realistic range of the model parameters and that a certain discrete nature of the interactions induces multiple peaks in the species abundance distribution, providing the possibility of theoretically explaining multiple peaks observed in various field studies. To get more quantitative information, we also construct a non-perturbative theory which becomes exact on tree-like networks if all the species coexist, providing exact critical values of $u$ below which extinct species emerge. Numerical simulations in various different situations are conducted and they clarify the robustness of the presented mechanism of all spe...

  12. Interferometric interpolation of sparse marine data

    Hanafy, Sherif M.


    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.

  13. Inferring sparse networks for noisy transient processes

    Tran, Hoang M.; Bukkapatnam, Satish T. S.


    Inferring causal structures of real world complex networks from measured time series signals remains an open issue. The current approaches are inadequate to discern between direct versus indirect influences (i.e., the presence or absence of a directed arc connecting two nodes) in the presence of noise, sparse interactions, as well as nonlinear and transient dynamics of real world processes. We report a sparse regression (referred to as the -min) approach with theoretical bounds on the constraints on the allowable perturbation to recover the network structure that guarantees sparsity and robustness to noise. We also introduce averaging and perturbation procedures to further enhance prediction scores (i.e., reduce inference errors), and the numerical stability of -min approach. Extensive investigations have been conducted with multiple benchmark simulated genetic regulatory network and Michaelis-Menten dynamics, as well as real world data sets from DREAM5 challenge. These investigations suggest that our approach can significantly improve, oftentimes by 5 orders of magnitude over the methods reported previously for inferring the structure of dynamic networks, such as Bayesian network, network deconvolution, silencing and modular response analysis methods based on optimizing for sparsity, transients, noise and high dimensionality issues.

  14. Neonatal atlas construction using sparse representation.

    Shi, Feng; Wang, Li; Wu, Guorong; Li, Gang; Gilmore, John H; Lin, Weili; Shen, Dinggang


    Atlas construction generally includes first an image registration step to normalize all images into a common space and then an atlas building step to fuse the information from all the aligned images. Although numerous atlas construction studies have been performed to improve the accuracy of the image registration step, unweighted or simply weighted average is often used in the atlas building step. In this article, we propose a novel patch-based sparse representation method for atlas construction after all images have been registered into the common space. By taking advantage of local sparse representation, more anatomical details can be recovered in the built atlas. To make the anatomical structures spatially smooth in the atlas, the anatomical feature constraints on group structure of representations and also the overlapping of neighboring patches are imposed to ensure the anatomical consistency between neighboring patches. The proposed method has been applied to 73 neonatal MR images with poor spatial resolution and low tissue contrast, for constructing a neonatal brain atlas with sharp anatomical details. Experimental results demonstrate that the proposed method can significantly enhance the quality of the constructed atlas by discovering more anatomical details especially in the highly convoluted cortical regions. The resulting atlas demonstrates superior performance of our atlas when applied to spatially normalizing three different neonatal datasets, compared with other start-of-the-art neonatal brain atlases.

  15. Everywhere-Sparse Spanners via Dense Subgraphs

    Chlamtac, Eden; Krauthgamer, Robert


    The significant progress in constructing graph spanners that are sparse (small number of edges) or light (low total weight) has skipped spanners that are everywhere-sparse (small maximum degree). This disparity is in line with other network design problems, where the maximum-degree objective has been a notorious technical challenge. Our main result is for the Lowest Degree 2-Spanner (LD2S) problem, where the goal is to compute a 2-spanner of an input graph so as to minimize the maximum degree. We design a polynomial-time algorithm achieving approximation factor $\\tilde O(\\Delta^{3-2\\sqrt{2}}) \\approx \\tilde O(\\Delta^{0.172})$, where $\\Delta$ is the maximum degree of the input graph. The previous $\\tilde O(\\Delta^{1/4})$ -approximation was proved nearly two decades ago by Kortsarz and Peleg [SODA 1994, SICOMP 1998]. Our main conceptual contribution is to establish a formal connection between LD2S and a variant of the Densest k-Subgraph (DkS) problem. Specifically, we design for both problems strong relaxations...

  16. Duplex scanning using sparse data sequences

    Møllenbach, S. K.; Jensen, Jørgen Arendt


    The velocity distribution in vessels can be displayed using duplex scanning where B-mode acquisitions are interspaced with the velocity data. This gives an image for orientation, but lowers the maximum detectable velocity by a factor of two. Other pulse sequences either omits the B-mode image...... or leaves gaps in the velocity data, which makes it difficult to output audio data. The near full velocity range can be maintained and B-mode images shown by using a sparse data sequence with velocity and B-mode samples intermixed. The B-mode samples are placed in a (sparse) periodical pattern, which makes...... is scaled by the factor A/T. The approach has been investigated using in vivo RF data from the Hepatic vein, Carotid artery and Aorta from a 33 year old healthy male. A B-K Medical 3535 ultrasound scanner has been used in Duplex mode with a BK 8556, 3.2 MHz linear array probe. The sampling frequency...

  17. Statistical mechanics analysis of sparse data.

    Habeck, Michael


    Inferential structure determination uses Bayesian theory to combine experimental data with prior structural knowledge into a posterior probability distribution over protein conformational space. The posterior distribution encodes everything one can say objectively about the native structure in the light of the available data and additional prior assumptions and can be searched for structural representatives. Here an analogy is drawn between the posterior distribution and the canonical ensemble of statistical physics. A statistical mechanics analysis assesses the complexity of a structure calculation globally in terms of ensemble properties. Analogs of the free energy and density of states are introduced; partition functions evaluate the consistency of prior assumptions with data. Critical behavior is observed with dwindling restraint density, which impairs structure determination with too sparse data. However, prior distributions with improved realism ameliorate the situation by lowering the critical number of observations. An in-depth analysis of various experimentally accessible structural parameters and force field terms will facilitate a statistical approach to protein structure determination with sparse data that avoids bias as much as possible.

  18. Sparse Identification of Nonlinear Dynamics (SINDy)

    Brunton, Steven; Proctor, Joshua; Kutz, Nathan


    This work develops a general new framework to discover the governing equations underlying a dynamical system simply from data measurements, leveraging advances in sparsity techniques and machine learning. The so-called sparse identification of nonlinear dynamics (SINDy) method results in models that are parsimonious, balancing model complexity with descriptive ability while avoiding over fitting. The only assumption about the structure of the model is that there are only a few important terms that govern the dynamics, so that the equations are sparse in the space of possible functions; this assumption holds for many physical systems in an appropriate basis. We demonstrate the algorithm on a wide range of problems, from simple canonical systems, including the chaotic Lorenz system, to the canonical fluid vortex shedding behind an circular cylinder at Re=100. We also show that this method generalizes to parameterized systems and systems that are time-varying or have external forcing. With abundant data and elusive laws, data-driven discovery of dynamics will continue to play an increasingly important role in the characterization and control of fluid dynamics.

  19. Learning doubly sparse transforms for images.

    Ravishankar, Saiprasad; Bresler, Yoram


    The sparsity of images in a transform domain or dictionary has been exploited in many applications in image processing. For example, analytical sparsifying transforms, such as wavelets and discrete cosine transform (DCT), have been extensively used in compression standards. Recently, synthesis sparsifying dictionaries that are directly adapted to the data have become popular especially in applications such as image denoising. Following up on our recent research, where we introduced the idea of learning square sparsifying transforms, we propose here novel problem formulations for learning doubly sparse transforms for signals or image patches. These transforms are a product of a fixed, fast analytic transform such as the DCT, and an adaptive matrix constrained to be sparse. Such transforms can be learnt, stored, and implemented efficiently. We show the superior promise of our learnt transforms as compared with analytical sparsifying transforms such as the DCT for image representation. We also show promising performance in image denoising that compares favorably with approaches involving learnt synthesis dictionaries such as the K-SVD algorithm. The proposed approach is also much faster than K-SVD denoising.

  20. Parallel sparse direct solver for integrated circuit simulation

    Chen, Xiaoming; Yang, Huazhong


    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...

  1. OSKI: A Library of Automatically Tuned Sparse Matrix Kernels

    Vuduc, R; Demmel, J W; Yelick, K A


    The Optimized Sparse Kernel Interface (OSKI) is a collection of low-level primitives that provide automatically tuned computational kernels on sparse matrices, for use by solver libraries and applications. These kernels include sparse matrix-vector multiply and sparse triangular solve, among others. The primary aim of this interface is to hide the complex decision-making process needed to tune the performance of a kernel implementation for a particular user's sparse matrix and machine, while also exposing the steps and potentially non-trivial costs of tuning at run-time. This paper provides an overview of OSKI, which is based on our research on automatically tuned sparse kernels for modern cache-based superscalar machines.

  2. OSKI: A library of automatically tuned sparse matrix kernels

    Vuduc, Richard; Demmel, James W.; Yelick, Katherine A.


    The Optimized Sparse Kernel Interface (OSKI) is a collection of low-level primitives that provide automatically tuned computational kernels on sparse matrices, for use by solver libraries and applications. These kernels include sparse matrix-vector multiply and sparse triangular solve, among others. The primary aim of this interface is to hide the complex decisionmaking process needed to tune the performance of a kernel implementation for a particular user's sparse matrix and machine, while also exposing the steps and potentially non-trivial costs of tuning at run-time. This paper provides an overview of OSKI, which is based on our research on automatically tuned sparse kernels for modern cache-based superscalar machines.

  3. Novel Nonsymmetrically p-Benzyl-Substituted (Benzimidazole N-Heterocyclic Carbene-Silver(I Acetate Complexes: Synthesis and Biological Evaluation

    Frauke Hackenberg


    Full Text Available Nonsymmetrically substituted N-heterocyclic carbene (NHC precursors 1a–d and 3a–d were synthesised by first reacting 1H-(benzimidazole with p-cyanobenzyl bromide to give 4-(1H-imidazole-1-ylmethylbenzonitrile (1 and 4-(1H-benzimidazole-1-ylmethylbenzonitrile (3 and afterwards introducing benzyl bromide, 1-(bromomethyl-4-methylbenzene, 1-(bromomethyl-4-methoxybenzene, and methyl 4-(bromomethylbenzoate. The NHC-silver(I acetate complexes (1-benzyl-3-(4-cyanobenzyl-2,3-dihydro-1H-imidazole-2-ylidene silver(I acetate (2a, (1-(4-cyanobenzyl-3-(4-methylbenzyl-2,3-dihydro-1H-imidazole-2-ylidene silver(I acetate (2b, (1-(4-cyanobenzyl-3-[4-(methoxycarbonylbenzyl]-2,3-dihydro-1H-imidazole-2-ylidene silver(I acetate (2c, (1-benzyl-3-(4-cyanobenzyl-2,3-dihydro-1H-benzimidazole-2-ylidene silver(I acetate (4a, (1-(4-cyanobenzyl-3-(4-methylbenzyl-2,3-dihydro-1H-benzimidazole-2-ylidene silver(I acetate (4b, (1-(4-cyanobenzyl-3-(4-methoxybenzyl-2,3-dihydro-1H-benzimidazole-2-ylidene silver(I acetate (4c, and (1-(4-cyanobenzyl-3-[4-(methoxycarbonylbenzyl]-2,3-dihydro-1H-benzimidazole-2-ylidene silver(I acetate (4d were yielded by reacting these NHC precursors with silver(I acetate. The silver(I acetate complex 4b was characterised by single crystal X-ray diffraction. Preliminary in vitro antibacterial studies against the Gram-positive bacteria Staphylococcus aureus and the Gram-negative bacteria Escherichia coli, using the Kirby-Bauer disc diffusion method, were carried out on the seven NHC-silver(I acetate complexes 2a–c and 4a–d. Also the IC50 values of these seven complexes were determined by an MTT-based assay against the human renal cancer cell line Caki-1. The complexes 2a–c and 4a–c revealed the following IC50 values, respectively, 25 (±1, 15 (±2, 5.4 (±0.8, 16 (±2, 7.1 (±1, 20 (±4, and 14 (±1 μM.

  4. Optically Biaxial, Re-entrant and Frustrated Mesophases in Chiral, Non-symmetric Liquid Crystal Dimers and Binary Mixtures.

    Padmini, Vediappen; Babu, Palakurthy Nani; Nair, Geetha G; Rao, D S Shankar; Yelamaggad, Channabasaveshwar V


    Sixteen optically active, non-symmetric dimers, in which cyanobiphenyl and salicylaldimine mesogens are interlinked by a flexible spacer, were synthesized and characterized. While the terminal chiral tail, in the form of either (R)-2-octyloxy or (S)-2-octyloxy chain attached to salicylaldimine core, was held constant, the number of methylene units in the spacer was varied from 3 to 10 affording eight pairs of (R & S) enantiomers. They were probed for their thermal properties with the aid of orthoscopy, conoscopy, differential scanning calorimetry and X-ray powder diffraction. In addition, the binary mixture study was carried out using chiral and achiral dimers with the intensions of stabilizing optically biaxial phase/s, re-entrant phases and important phase sequences. Notably, one of the chiral dimers as well as some mixtures exhibited a biaxial smectic A (SmAb ) phase appearing between a uniaxial SmA and a re-entrant uniaxial SmA phases. The mesophases such as chiral nematic (N*) and frustrated phases viz., blue phases (BPs) and twist grain boundary (TGB) phases, were also found to occur in most of the dimers and mixtures. X-ray diffraction studies revealed that the dimers possessing oxybutoxy and oxypentoxy spacers show interdigitated (SmAd ) phase where smectic periodicity is over 1.4 times the molecular length; whereas in the intercalated SmA (SmAc ) phase formed by a dimer having oxydecoxy spacer the periodicity was found to be approximately half the molecular length. The handedness of the helical structure of the N* phases formed by two enantiomers was examined with the aid of CD measurements; as expected, these enantiomers showed optical activities of equal magnitudes but with opposite signs. Overall, it appears that the chiral dimers and mixtures presented herein may serve as model systems in design and developing novel materials exhibiting the apolar SmAb phase possessing D2h symmetry and nematic-type biaxiality. © 2016 Wiley-VCH Verlag GmbH & Co. KGa

  5. Exact CS Reconstruction Condition of Undersampled Spectrum-Sparse Signals

    Ying Luo


    Full Text Available Compressive sensing (CS reconstruction of a spectrum-sparse signal from undersampled data is, in fact, an ill-posed problem. In this paper, we mathematically prove that, in certain cases, the exact CS reconstruction of a spectrum-sparse signal from undersampled data is impossible. Then we present the exact CS reconstruction condition of undersampled spectrum-sparse signals, which is valuable for digital signal compression.

  6. Sparse Vector Distributions and Recovery from Compressed Sensing

    Sturm, Bob L.

    It is well known that the performance of sparse vector recovery algorithms from compressive measurements can depend on the distribution underlying the non-zero elements of a sparse vector. However, the extent of these effects has yet to be explored, and formally presented. In this paper, I...... distributions, and the criterion for exact recovery; and 2) a recovery algorithm must be selected carefully based on what distribution one expects to underlie the sensed sparse signal....

  7. Local structure preserving sparse coding for infrared target recognition

    Han, Jing; Yue, Jiang; Zhang, Yi; Bai, Lianfa


    Sparse coding performs well in image classification. However, robust target recognition requires a lot of comprehensive template images and the sparse learning process is complex. We incorporate sparsity into a template matching concept to construct a local sparse structure matching (LSSM) model for general infrared target recognition. A local structure preserving sparse coding (LSPSc) formulation is proposed to simultaneously preserve the local sparse and structural information of objects. By adding a spatial local structure constraint into the classical sparse coding algorithm, LSPSc can improve the stability of sparse representation for targets and inhibit background interference in infrared images. Furthermore, a kernel LSPSc (K-LSPSc) formulation is proposed, which extends LSPSc to the kernel space to weaken the influence of the linear structure constraint in nonlinear natural data. Because of the anti-interference and fault-tolerant capabilities, both LSPSc- and K-LSPSc-based LSSM can implement target identification based on a simple template set, which just needs several images containing enough local sparse structures to learn a sufficient sparse structure dictionary of a target class. Specifically, this LSSM approach has stable performance in the target detection with scene, shape and occlusions variations. High performance is demonstrated on several datasets, indicating robust infrared target recognition in diverse environments and imaging conditions. PMID:28323824

  8. Dictionary-Based, Clustered Sparse Representation for Hyperspectral Image Classification

    Zhen-tao Qin


    Full Text Available This paper presents a new, dictionary-based method for hyperspectral image classification, which incorporates both spectral and contextual characteristics of a sample clustered to obtain a dictionary of each pixel. The resulting pixels display a common sparsity pattern in identical clustered groups. We calculated the image’s sparse coefficients using the dictionary approach, which generated the sparse representation features of the remote sensing images. The sparse coefficients are then used to classify the hyperspectral images via a linear SVM. Experiments show that our proposed method of dictionary-based, clustered sparse coefficients can create better representations of hyperspectral images, with a greater overall accuracy and a Kappa coefficient.

  9. Improving sparse representation algorithms for maritime video processing

    Smith, L. N.; Nichols, J. M.; Waterman, J. R.; Olson, C. C.; Judd, K. P.


    We present several improvements to published algorithms for sparse image modeling with the goal of improving processing of imagery of small watercraft in littoral environments. The first improvement is to the K-SVD algorithm for training over-complete dictionaries, which are used in sparse representations. It is shown that the training converges significantly faster by incorporating multiple dictionary (i.e., codebook) update stages in each training iteration. The paper also provides several useful and practical lessons learned from our experience with sparse representations. Results of three applications of sparse representation are presented and compared to the state-of-the-art methods; image compression, image denoising, and super-resolution.

  10. 非对称冲击-卸载实验中纵波声速的特征线分析方法%Characteristic metho d to infer the high-pressure sound sp eed in a nonsymmetric impact and release exp eriment

    潘昊; 吴子辉; 胡晓棉


    Sound speed is of great importance for high velocity impact phenomena because it is a fundamental parameter to deduce the shear moduli, strengths and phase transitions of materials at high pressure. It has attracted much attention because of significant challenges to experiment and simulation. In practice, with the development of laser interferometer measurement system, one can obtain velocity-time histories of windowed-surfaces or free surfaces with high resolution in shock or ramp compression and unload experiments. This development provides a possible way to infer the sound speed from these velocity profiles. The key problem is to build valid analysis technique to extract the sound speed. Commonly used Lagrangian analysis methods include backward integration method, incremental impedance matching method, transfer function method and backward characteristic analysis method. However, all of these methods hardly infer the right results from the nonsymmetric impact and release experiment with only one depth of material due to the complex impedance mismatch among a flyer, sample and window. Some decreasing impedance mismatch techniques have been developed for the experiments including reverse impact or using a high strength flyer, but these techniques will limit the pressure range or need a newly designed gun with large caliber. In fact, the traditional backward characteristic analysis method only considers the sample/window interaction while bending of the incoming characteristics due to impedance difference between the flyer and sample is always ignored, which causes a distortion to the loading condition of samples. Thus in this work, we add forward characteristics to describe rarefaction wave reflection at the flyer/sample interface. Then a reasonable loading-releasing in-situ velocity profile of the interface can be derived from this improvement. We use the improved/tradition characteristics and incremental impedance matching method to analyze a synthetic

  11. Robust visual tracking via structured multi-task sparse learning

    Zhang, Tianzhu


    In this paper, we formulate object tracking in a particle filter framework as a structured multi-task sparse learning problem, which we denote as Structured Multi-Task Tracking (S-MTT). Since we model particles as linear combinations of dictionary templates that are updated dynamically, learning the representation of each particle is considered a single task in Multi-Task Tracking (MTT). By employing popular sparsity-inducing lp,q mixed norms (specifically p∈2,∞ and q=1), we regularize the representation problem to enforce joint sparsity and learn the particle representations together. As compared to previous methods that handle particles independently, our results demonstrate that mining the interdependencies between particles improves tracking performance and overall computational complexity. Interestingly, we show that the popular L1 tracker (Mei and Ling, IEEE Trans Pattern Anal Mach Intel 33(11):2259-2272, 2011) is a special case of our MTT formulation (denoted as the L11 tracker) when p=q=1. Under the MTT framework, some of the tasks (particle representations) are often more closely related and more likely to share common relevant covariates than other tasks. Therefore, we extend the MTT framework to take into account pairwise structural correlations between particles (e.g. spatial smoothness of representation) and denote the novel framework as S-MTT. The problem of learning the regularized sparse representation in MTT and S-MTT can be solved efficiently using an Accelerated Proximal Gradient (APG) method that yields a sequence of closed form updates. As such, S-MTT and MTT are computationally attractive. We test our proposed approach on challenging sequences involving heavy occlusion, drastic illumination changes, and large pose variations. Experimental results show that S-MTT is much better than MTT, and both methods consistently outperform state-of-the-art trackers. © 2012 Springer Science+Business Media New York.

  12. Sparse Signal Separation in Redundant Dictionaries

    Aubel, Céline; Pope, Graeme; Bölcskei, Helmut


    We formulate a unified framework for the separation of signals that are sparse in "morphologically" different redundant dictionaries. This formulation incorporates the so-called "analysis" and "synthesis" approaches as special cases and contains novel hybrid setups. We find corresponding coherence-based recovery guarantees for an l1-norm based separation algorithm. Our results recover those reported in Studer and Baraniuk, ACHA, submitted, for the synthesis setting, provide new recovery guarantees for the analysis setting, and form a basis for comparing performance in the analysis and synthesis settings. As an aside our findings complement the D-RIP recovery results reported in Cand\\`es et al., ACHA, 2011, for the "analysis" signal recovery problem: minimize_x ||{\\Psi}x||_1 subject to ||y - Ax||_2 \\leq {\\epsilon}, by delivering corresponding coherence-based recovery results.

  13. Sparse regularization in limited angle tomography

    Frikel, Jürgen


    We investigate the reconstruction problem of limited angle tomography. Such problems arise naturally in applications like digital breast tomosynthesis, dental tomography, electron microscopy etc. Since the acquired tomographic data is highly incomplete, the reconstruction problem is severely ill-posed and the traditional reconstruction methods, such as filtered backprojection (FBP), do not perform well in such situations. To stabilize the reconstruction procedure additional prior knowledge about the unknown object has to be integrated into the reconstruction process. In this work, we propose the use of the sparse regularization technique in combination with curvelets. We argue that this technique gives rise to an edge-preserving reconstruction. Moreover, we show that the dimension of the problem can be significantly reduced in the curvelet domain. To this end, we give a characterization of the kernel of limited angle Radon transform in terms of curvelets and derive a characterization of solutions obtained thr...

  14. Sparse Matrix Inversion with Scaled Lasso

    Sun, Tingni


    We propose a new method of learning a sparse nonnegative-definite target matrix. Our primary example of the target matrix is the inverse of a population covariance matrix or correlation matrix. The algorithm first estimates each column of the matrix by scaled Lasso, a joint estimation of regression coefficients and noise level, and then adjusts the matrix estimator to be symmetric. The procedure is efficient in the sense that the penalty level of the scaled Lasso for each column is completely determined by the data via convex minimization, without using cross-validation. We prove that this method guarantees the fastest proven rate of convergence in the spectrum norm under conditions of weaker form than those in the existing analyses of other $\\ell_1$ algorithms, and has faster guaranteed rate of convergence when the ratio of the $\\ell_1$ and spectrum norms of the target inverse matrix diverges to infinity. A simulation study also demonstrates the competitive performance of the proposed estimator.

  15. A scalable sparse eigensolver for petascale applications

    Keceli, Murat; Zhang, Hong; Zapol, Peter; Dixon, David; Wagner, Albert


    Exploiting locality of chemical interactions and therefore sparsity is necessary to push the limits of quantum simulations beyond petascale. However, sparse numerical algorithms are known to have poor strong scaling. Here, we show that shift-and-invert parallel spectral transformations (SIPs) method can scale up to two-hundred thousand cores for density functional based tight-binding (DFTB), or semi-empirical molecular orbital (SEMO) applications. We demonstrated the robustness and scalability of the SIPs method on various kinds of systems including metallic carbon nanotubes, diamond crystals and water clusters. We analyzed how sparsity patterns and eigenvalue spectrums of these different type of applications affect the computational performance of the SIPs. The SIPs method enables us to perform simulations with more than five hundred thousands of basis functions utilizing more than hundreds of thousands of cores. SIPs has a better scaling for memory and computational time in contrast to dense eigensolvers, and it does not require fast interconnects.

  16. Approximating acyclicity parameters of sparse hypergraphs

    Fomin, Fedor V; Thilikos, Dimitrios M


    The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These notions were further generalized by Grohe and Marx, who introduced the fractional hypertree width of a hypergraph. All these width parameters on hypergraphs are useful for extending tractability of many problems in database theory and artificial intelligence. In this paper, we study the approximability of (generalized, fractional) hyper treewidth of sparse hypergraphs where the criterion of sparsity reflects the sparsity of their incidence graphs. Our first step is to prove that the (generalized, fractional) hypertree width of a hypergraph H is constant-factor sandwiched by the treewidth of its incidence graph, when the incidence graph belongs to some apex-minor-free graph class. This determines the combinatorial borderline above which the notion of (generalized, fractional) hypertree width becomes essentially more general than treewidth...

  17. Integer sparse distributed memory: analysis and results.

    Snaider, Javier; Franklin, Stan; Strain, Steve; George, E Olusegun


    Sparse distributed memory is an auto-associative memory system that stores high dimensional Boolean vectors. Here we present an extension of the original SDM, the Integer SDM that uses modular arithmetic integer vectors rather than binary vectors. This extension preserves many of the desirable properties of the original SDM: auto-associativity, content addressability, distributed storage, and robustness over noisy inputs. In addition, it improves the representation capabilities of the memory and is more robust over normalization. It can also be extended to support forgetting and reliable sequence storage. We performed several simulations that test the noise robustness property and capacity of the memory. Theoretical analyses of the memory's fidelity and capacity are also presented.

  18. Narrowband interference parameterization for sparse Bayesian recovery

    Ali, Anum


    This paper addresses the problem of narrowband interference (NBI) in SC-FDMA systems by using tools from compressed sensing and stochastic geometry. The proposed NBI cancellation scheme exploits the frequency domain sparsity of the unknown signal and adopts a Bayesian sparse recovery procedure. This is done by keeping a few randomly chosen sub-carriers data free to sense the NBI signal at the receiver. As Bayesian recovery requires knowledge of some NBI parameters (i.e., mean, variance and sparsity rate), we use tools from stochastic geometry to obtain analytical expressions for the required parameters. Our simulation results validate the analysis and depict suitability of the proposed recovery method for NBI mitigation. © 2015 IEEE.

  19. Bayesian learning of sparse multiscale image representations.

    Hughes, James Michael; Rockmore, Daniel N; Wang, Yang


    Multiscale representations of images have become a standard tool in image analysis. Such representations offer a number of advantages over fixed-scale methods, including the potential for improved performance in denoising, compression, and the ability to represent distinct but complementary information that exists at various scales. A variety of multiresolution transforms exist, including both orthogonal decompositions such as wavelets as well as nonorthogonal, overcomplete representations. Recently, techniques for finding adaptive, sparse representations have yielded state-of-the-art results when applied to traditional image processing problems. Attempts at developing multiscale versions of these so-called dictionary learning models have yielded modest but encouraging results. However, none of these techniques has sought to combine a rigorous statistical formulation of the multiscale dictionary learning problem and the ability to share atoms across scales. We present a model for multiscale dictionary learning that overcomes some of the drawbacks of previous approaches by first decomposing an input into a pyramid of distinct frequency bands using a recursive filtering scheme, after which we perform dictionary learning and sparse coding on the individual levels of the resulting pyramid. The associated image model allows us to use a single set of adapted dictionary atoms that is shared--and learned--across all scales in the model. The underlying statistical model of our proposed method is fully Bayesian and allows for efficient inference of parameters, including the level of additive noise for denoising applications. We apply the proposed model to several common image processing problems including non-Gaussian and nonstationary denoising of real-world color images.

  20. Impact-force sparse reconstruction from highly incomplete and inaccurate measurements

    Qiao, Baijie; Zhang, Xingwu; Gao, Jiawei; Chen, Xuefeng


    The classical l2-norm-based regularization methods applied for force reconstruction inverse problem require that the number of measurements should not be less than the number of unknown sources. Taking into account the sparse nature of impact-force in time domain, we develop a general sparse methodology based on minimizing l1-norm for solving the highly underdetermined model of impact-force reconstruction. A monotonic two-step iterative shrinkage/thresholding (MTWIST) algorithm is proposed to find the sparse solution to such an underdetermined model from highly incomplete and inaccurate measurements, which can be problematic with Tikhonov regularization. MTWIST is highly efficient for large-scale ill-posed problems since it mainly involves matrix-vector multiplies without matrix factorization. In sparsity frame, the proposed sparse regularization method can not only determine the actual impact location from many candidate sources but also simultaneously reconstruct the time history of impact-force. Simulation and experiment including single-source and two-source impact-force reconstruction are conducted on a simply supported rectangular plate and a shell structure to illustrate the effectiveness and applicability of MTWIST, respectively. Both the locations and force time histories of the single-source and two-source cases are accurately reconstructed from a single accelerometer, where the high noise level is considered in simulation and the primary noise in experiment is supposed to be colored noise. Meanwhile, the consecutive impact-forces reconstruction in a large-scale (greater than 104) sparse frame illustrates that MTWIST has advantages of computational efficiency and identification accuracy over Tikhonov regularization.

  1. Novel calibration system with sparse wires for CMB polarization receivers

    Tajima, O.; /KEK, Tsukuba /Chicago U., KICP; Nguyen, H.; /Fermilab; Bischoff, C.; /Chicago U., KICP /Harvard-Smithsonian Ctr. Astrophys.; Brizius, A.; Buder, I.; Kusaka, A. /Chicago U., KICP


    B-modes in the cosmic microwave background (CMB) polarization is a smoking gun signature of the inflationary universe. To achieve better sensitivity to this faint signal, CMB polarization experiments aim to maximize the number of detector elements, resulting in a large focal plane receiver. Detector calibration of the polarization response becomes essential. It is extremely useful to be able to calibrate 'simultaneously' all detectors on the large focal plane. We developed a novel calibration system that rotates a large 'sparse' grid of metal wires, in front of and fully covering the field of view of the focal plane receiver. Polarized radiation is created via the reflection of ambient temperature from the wire surface. Since the detector has a finite beam size, the observed signal is smeared according to the beam property. The resulting smeared polarized radiation has a reasonable intensity (a few Kelvin or less) compared to the sky temperature ({approx}10 K observing condition). The system played a successful role for receiver calibration of QUIET, a CMB polarization experiment located in the Atacama desert in Chile. The successful performance revealed that this system is applicable to other experiments based on different technologies, e.g. TES bolometers.

  2. Novel calibration system with sparse wires for CMB polarization receivers

    Tajima, O.; /KEK, Tsukuba /Chicago U., KICP; Nguyen, H.; /Fermilab; Bischoff, C.; /Chicago U., KICP /Harvard-Smithsonian Ctr. Astrophys.; Brizius, A.; Buder, I.; Kusaka, A. /Chicago U., KICP


    B-modes in the cosmic microwave background (CMB) polarization is a smoking gun signature of the inflationary universe. To achieve better sensitivity to this faint signal, CMB polarization experiments aim to maximize the number of detector elements, resulting in a large focal plane receiver. Detector calibration of the polarization response becomes essential. It is extremely useful to be able to calibrate 'simultaneously' all detectors on the large focal plane. We developed a novel calibration system that rotates a large 'sparse' grid of metal wires, in front of and fully covering the field of view of the focal plane receiver. Polarized radiation is created via the reflection of ambient temperature from the wire surface. Since the detector has a finite beam size, the observed signal is smeared according to the beam property. The resulting smeared polarized radiation has a reasonable intensity (a few Kelvin or less) compared to the sky temperature ({approx}10 K observing condition). The system played a successful role for receiver calibration of QUIET, a CMB polarization experiment located in the Atacama desert in Chile. The successful performance revealed that this system is applicable to other experiments based on different technologies, e.g. TES bolometers.

  3. Performance optimization of Sparse Matrix-Vector Multiplication for multi-component PDE-based applications using GPUs

    Abdelfattah, Ahmad


    Simulations of many multi-component PDE-based applications, such as petroleum reservoirs or reacting flows, are dominated by the solution, on each time step and within each Newton step, of large sparse linear systems. The standard solver is a preconditioned Krylov method. Along with application of the preconditioner, memory-bound Sparse Matrix-Vector Multiplication (SpMV) is the most time-consuming operation in such solvers. Multi-species models produce Jacobians with a dense block structure, where the block size can be as large as a few dozen. Failing to exploit this dense block structure vastly underutilizes hardware capable of delivering high performance on dense BLAS operations. This paper presents a GPU-accelerated SpMV kernel for block-sparse matrices. Dense matrix-vector multiplications within the sparse-block structure leverage optimization techniques from the KBLAS library, a high performance library for dense BLAS kernels. The design ideas of KBLAS can be applied to block-sparse matrices. Furthermore, a technique is proposed to balance the workload among thread blocks when there are large variations in the lengths of nonzero rows. Multi-GPU performance is highlighted. The proposed SpMV kernel outperforms existing state-of-the-art implementations using matrices with real structures from different applications. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

  4. Synthetic aperture radar imaging based on attributed scatter model using sparse recovery techniques

    苏伍各; 王宏强; 阳召成


    The sparse recovery algorithms formulate synthetic aperture radar (SAR) imaging problem in terms of sparse representation (SR) of a small number of strong scatters’ positions among a much large number of potential scatters’ positions, and provide an effective approach to improve the SAR image resolution. Based on the attributed scatter center model, several experiments were performed with different practical considerations to evaluate the performance of five representative SR techniques, namely, sparse Bayesian learning (SBL), fast Bayesian matching pursuit (FBMP), smoothed l0 norm method (SL0), sparse reconstruction by separable approximation (SpaRSA), fast iterative shrinkage-thresholding algorithm (FISTA), and the parameter settings in five SR algorithms were discussed. In different situations, the performances of these algorithms were also discussed. Through the comparison of MSE and failure rate in each algorithm simulation, FBMP and SpaRSA are found suitable for dealing with problems in the SAR imaging based on attributed scattering center model. Although the SBL is time-consuming, it always get better performance when related to failure rate and high SNR.

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

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


    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.

  6. Track monitoring from the dynamic response of a passing train: A sparse approach

    Lederman, George; Chen, Siheng; Garrett, James H.; Kovačević, Jelena; Noh, Hae Young; Bielak, Jacobo


    Collecting vibration data from revenue service trains could be a low-cost way to more frequently monitor railroad tracks, yet operational variability makes robust analysis a challenge. We propose a novel analysis technique for track monitoring that exploits the sparsity inherent in train-vibration data. This sparsity is based on the observation that large vertical train vibrations typically involve the excitation of the train's fundamental mode due to track joints, switchgear, or other discrete hardware. Rather than try to model the entire rail profile, in this study we examine a sparse approach to solving an inverse problem where (1) the roughness is constrained to a discrete and limited set of "bumps"; and (2) the train system is idealized as a simple damped oscillator that models the train's vibration in the fundamental mode. We use an expectation maximization (EM) approach to iteratively solve for the track profile and the train system properties, using orthogonal matching pursuit (OMP) to find the sparse approximation within each step. By enforcing sparsity, the inverse problem is well posed and the train's position can be found relative to the sparse bumps, thus reducing the uncertainty in the GPS data. We validate the sparse approach on two sections of track monitored from an operational train over a 16 month period of time, one where track changes did not occur during this period and another where changes did occur. We show that this approach can not only detect when track changes occur, but also offers insight into the type of such changes.

  7. Subspace weighted ℓ 2,1 minimization for sparse signal recovery

    Zheng, Chundi; Li, Gang; Liu, Yimin; Wang, Xiqin


    In this article, we propose a weighted ℓ 2,1 minimization algorithm for jointly-sparse signal recovery problem. The proposed algorithm exploits the relationship between the noise subspace and the overcomplete basis matrix for designing weights, i.e., large weights are appointed to the entries, whose indices are more likely to be outside of the row support of the jointly sparse signals, so that their indices are expelled from the row support in the solution, and small weights are appointed to the entries, whose indices correspond to the row support of the jointly sparse signals, so that the solution prefers to reserve their indices. Compared with the regular ℓ 2,1 minimization, the proposed algorithm can not only further enhance the sparseness of the solution but also reduce the requirements on both the number of snapshots and the signal-to-noise ratio (SNR) for stable recovery. Both simulations and experiments on real data demonstrate that the proposed algorithm outperforms the ℓ 1-SVD algorithm, which exploits straightforwardly ℓ 2,1 minimization, for both deterministic basis matrix and random basis matrix.

  8. SAR and Infrared Image Fusion in Complex Contourlet Domain Based on Joint Sparse Representation

    Wu Yiquan


    Full Text Available To investigate the problems of the large grayscale difference between infrared and Synthetic Aperture Radar (SAR images and their fusion image not being fit for human visual perception, we propose a fusion method for SAR and infrared images in the complex contourlet domain based on joint sparse representation. First, we perform complex contourlet decomposition of the infrared and SAR images. Then, we employ the KSingular Value Decomposition (K-SVD method to obtain an over-complete dictionary of the low-frequency components of the two source images. Using a joint sparse representation model, we then generate a joint dictionary. We obtain the sparse representation coefficients of the low-frequency components of the source images in the joint dictionary by the Orthogonal Matching Pursuit (OMP method and select them using the selection maximization strategy. We then reconstruct these components to obtain the fused low-frequency components and fuse the high-frequency components using two criteria——the coefficient of visual sensitivity and the degree of energy matching. Finally, we obtain the fusion image by the inverse complex contourlet transform. Compared with the three classical fusion methods and recently presented fusion methods, e.g., that based on the Non-Subsampled Contourlet Transform (NSCT and another based on sparse representation, the method we propose in this paper can effectively highlight the salient features of the two source images and inherit their information to the greatest extent.

  9. Designing sparse sensing matrix for compressive sensing to reconstruct high resolution medical images

    Vibha Tiwari


    Full Text Available Compressive sensing theory enables faithful reconstruction of signals, sparse in domain $ \\Psi $, at sampling rate lesser than Nyquist criterion, while using sampling or sensing matrix $ \\Phi $ which satisfies restricted isometric property. The role played by sensing matrix $ \\Phi $ and sparsity matrix $ \\Psi $ is vital in faithful reconstruction. If the sensing matrix is dense then it takes large storage space and leads to high computational cost. In this paper, effort is made to design sparse sensing matrix with least incurred computational cost while maintaining quality of reconstructed image. The design approach followed is based on sparse block circulant matrix (SBCM with few modifications. The other used sparse sensing matrix consists of 15 ones in each column. The medical images used are acquired from US, MRI and CT modalities. The image quality measurement parameters are used to compare the performance of reconstructed medical images using various sensing matrices. It is observed that, since Gram matrix of dictionary matrix ($ \\Phi \\Psi \\mathrm{} $ is closed to identity matrix in case of proposed modified SBCM, therefore, it helps to reconstruct the medical images of very good quality.

  10. Sparse Source EEG Imaging with the Variational Garrote

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


    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...

  11. Sparse principal component analysis in hyperspectral change detection

    Nielsen, Allan Aasbjerg; Larsen, Rasmus; Vestergaard, Jacob Schack


    This contribution deals with change detection by means of sparse principal component analysis (PCA) of simple differences of calibrated, bi-temporal HyMap data. Results show that if we retain only 15 nonzero loadings (out of 126) in the sparse PCA the resulting change scores appear visually very ...

  12. Semantic Mapping for Lexical Sparseness Reduction in Parsing

    Suster, Simon; van Noord, Gertjan


    Bilexical information is known to be helpful in parse disambiguation, but the benefit is limited because of lexical sparseness. An approach us- ing word classes can reduce sparseness and po- tentially leads to more accurate parsing. Firstly, we describe a method identifying the depen- dency types of

  13. Robust Face Recognition via Block Sparse Bayesian Learning

    Taiyong Li


    Full Text Available Face recognition (FR is an important task in pattern recognition and computer vision. Sparse representation (SR has been demonstrated to be a powerful framework for FR. In general, an SR algorithm treats each face in a training dataset as a basis function and tries to find a sparse representation of a test face under these basis functions. The sparse representation coefficients then provide a recognition hint. Early SR algorithms are based on a basic sparse model. Recently, it has been found that algorithms based on a block sparse model can achieve better recognition rates. Based on this model, in this study, we use block sparse Bayesian learning (BSBL to find a sparse representation of a test face for recognition. BSBL is a recently proposed framework, which has many advantages over existing block-sparse-model-based algorithms. Experimental results on the Extended Yale B, the AR, and the CMU PIE face databases show that using BSBL can achieve better recognition rates and higher robustness than state-of-the-art algorithms in most cases.

  14. Sparse Frequency Waveform Design for Radar-Embedded Communication

    Chaoyun Mai


    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.

  15. Joint hierarchical models for sparsely sampled high-dimensional LiDAR and forest variables

    Finley, Andrew O.; Banerjee, Sudipto; Zhou, Yuzhen; Cook, Bruce D; Babcock, Chad


    Recent advancements in remote sensing technology, specifically Light Detection and Ranging (LiDAR) sensors, provide the data needed to quantify forest characteristics at a fine spatial resolution over large geographic domains. From an inferential standpoint, there is interest in prediction and interpolation of the often sparsely sampled and spatially misaligned LiDAR signals and forest variables. We propose a fully process-based Bayesian hierarchical model for above ground biomass (AGB) and L...

  16. Key point selection and clustering of swimmer coordination through Sparse Fisher-EM

    Komar, John; Seifert, Ludovic


    To answer the existence of optimal swimmer learning/teaching strategies, this work introduces a two-level clustering in order to analyze temporal dynamics of motor learning in breaststroke swimming. Each level have been performed through Sparse Fisher-EM, a unsupervised framework which can be applied efficiently on large and correlated datasets. The induced sparsity selects key points of the coordination phase without any prior knowledge.

  17. The Hawking cascade from a black hole is extremely sparse

    Gray, Finnian; Van-Brunt, Alexander; Visser, Matt


    The Hawking flux from a black hole, (at least as seen from large distances), is extremely sparse and thin, with the average time between emission of successive Hawking quanta being hundreds of times larger than the natural timescale set by the energies of the emitted quanta. Some aspects of this result have been known for over 30 years, but have been largely forgotten, possibly because authors focussed mainly on the late-time high-temperature regime. We shall instead focus on the early-stage low-temperature regime, and shall both quantify and significantly extend these observations in a number of different ways. First we shall identify several natural dimensionless figures of merit, and thereby compare the mean time between emission of successive Hawking quanta to several quite natural timescales that can be associated with the emitted quanta, demonstrating that ratios of 300 or more are typical for emission of photons or gravitons from a Schwarzschild black hole. Furthermore these ratios are independent of t...

  18. Two Glass Transitions Associated to Different Dynamic Disorders in the Nematic Glassy State of a Non-Symmetric Liquid Crystal Dimer Dopped with g-Alumina Nanoparticles

    Sergio Diez-Berart


    Full Text Available In the present work, the nematic glassy state of the non-symmetric LC dimer α-(4-cyanobiphenyl-4′-yloxy-ω-(1-pyrenimine-benzylidene-4′-oxy undecane is studied by means of calorimetric and dielectric measurements. The most striking result of the work is the presence of two different glass transition temperatures: one due to the freezing of the flip-flop motions of the bulkier unit of the dimer and the other, at a lower temperature, related to the freezing of the flip-flop and precessional motions of the cyanobiphenyl unit. This result shows the fact that glass transition is the consequence of the freezing of one or more coupled dynamic disorders and not of the disordered phase itself. In order to avoid crystallization when the bulk sample is cooled down, the LC dimer has been confined via the dispersion of γ-alumina nanoparticles, in several concentrations.

  19. New algorithms for solving third- and fifth-order two point boundary value problems based on nonsymmetric generalized Jacobi Petrov-Galerkin method.

    Doha, E H; Abd-Elhameed, W M; Youssri, Y H


    Two families of certain nonsymmetric generalized Jacobi polynomials with negative integer indexes are employed for solving third- and fifth-order two point boundary value problems governed by homogeneous and nonhomogeneous boundary conditions using a dual Petrov-Galerkin method. The idea behind our method is to use trial functions satisfying the underlying boundary conditions of the differential equations and the test functions satisfying the dual boundary conditions. The resulting linear systems from the application of our method are specially structured and they can be efficiently inverted. The use of generalized Jacobi polynomials simplify the theoretical and numerical analysis of the method and also leads to accurate and efficient numerical algorithms. The presented numerical results indicate that the proposed numerical algorithms are reliable and very efficient.

  20. Sparse Matrix Decompositions and Graph Characterizations

    Khare, Kshitij


    The question of when zeros (i.e., sparsity) in a positive definite matrix $A$ are preserved in its Cholesky decomposition, and vice versa, was addressed by Paulsen et al. in the Journal of Functional Analysis (85, pp151-178). In particular, they prove that for the pattern of zeros in $A$ to be retained in the Cholesky decomposition of $A$, the pattern of zeros in $A$ has to necessarily correspond to a chordal (or decomposable) graph associated with a specific type of vertex ordering. This result therefore yields a characterization of chordal graphs in terms of sparse positive definite matrices. It has also proved to be extremely useful in probabilistic and statistical analysis of Markov random fields where zeros in positive definite correlation matrices are intimately related to the notion of stochastic independence. Now, consider a positive definite matrix $A$ and its Cholesky decomposition given by $A = LDL^T$, where $L$ is lower triangular with unit diagonal entries, and $D$ a diagonal matrix with positive...

  1. Joint Sparse Recovery With Semisupervised MUSIC

    Wen, Zaidao; Hou, Biao; Jiao, Licheng


    Discrete multiple signal classification (MUSIC) with its low computational cost and mild condition requirement becomes a significant noniterative algorithm for joint sparse recovery (JSR). However, it fails in rank defective problem caused by coherent or limited amount of multiple measurement vectors (MMVs). In this letter, we provide a novel sight to address this problem by interpreting JSR as a binary classification problem with respect to atoms. Meanwhile, MUSIC essentially constructs a supervised classifier based on the labeled MMVs so that its performance will heavily depend on the quality and quantity of these training samples. From this viewpoint, we develop a semisupervised MUSIC (SS-MUSIC) in the spirit of machine learning, which declares that the insufficient supervised information in the training samples can be compensated from those unlabeled atoms. Instead of constructing a classifier in a fully supervised manner, we iteratively refine a semisupervised classifier by exploiting the labeled MMVs and some reliable unlabeled atoms simultaneously. Through this way, the required conditions and iterations can be greatly relaxed and reduced. Numerical experimental results demonstrate that SS-MUSIC can achieve much better recovery performances than other MUSIC extended algorithms as well as some typical greedy algorithms for JSR in terms of iterations and recovery probability.

  2. Sparse alignment for robust tensor learning.

    Lai, Zhihui; Wong, Wai Keung; Xu, Yong; Zhao, Cairong; Sun, Mingming


    Multilinear/tensor extensions of manifold learning based algorithms have been widely used in computer vision and pattern recognition. This paper first provides a systematic analysis of the multilinear extensions for the most popular methods by using alignment techniques, thereby obtaining a general tensor alignment framework. From this framework, it is easy to show that the manifold learning based tensor learning methods are intrinsically different from the alignment techniques. Based on the alignment framework, a robust tensor learning method called sparse tensor alignment (STA) is then proposed for unsupervised tensor feature extraction. Different from the existing tensor learning methods, L1- and L2-norms are introduced to enhance the robustness in the alignment step of the STA. The advantage of the proposed technique is that the difficulty in selecting the size of the local neighborhood can be avoided in the manifold learning based tensor feature extraction algorithms. Although STA is an unsupervised learning method, the sparsity encodes the discriminative information in the alignment step and provides the robustness of STA. Extensive experiments on the well-known image databases as well as action and hand gesture databases by encoding object images as tensors demonstrate that the proposed STA algorithm gives the most competitive performance when compared with the tensor-based unsupervised learning methods.

  3. An Optimized Sparse Approximate Matrix Multiply

    Bock, Nicolas


    We present an optimized single-precision implementation of the Sparse Approximate Matrix Multiply (\\SpAMM{}) [M. Challacombe and N. Bock, arXiv {\\bf 1011.3534} (2010)], a fast algorithm for matrix-matrix multiplication for matrices with decay that achieves an $\\mathcal{O} (n \\ln n)$ computational complexity with respect to matrix dimension $n$. We find that the max norm of the error matrix achieved with a \\SpAMM{} tolerance of below $2 \\times 10^{-8}$ is lower than that of the single-precision {\\tt SGEMM} for quantum chemical test matrices, while outperforming {\\tt SGEMM} with a cross-over already for small matrices ($n \\sim 1000$). Relative to naive implementations of \\SpAMM{} using optimized versions of {\\tt SGEMM}, such as those found in Intel's Math Kernel Library ({\\tt MKL}) or AMD's Core Math Library ({\\tt ACML}), our optimized version is found to be significantly faster. Detailed performance comparisons are made with for quantum chemical matrices of RHF/STO-2G and RHF/6-31G${}^{**}$ water clusters.

  4. Sparse coding for layered neural networks

    Katayama, Katsuki; Sakata, Yasuo; Horiguchi, Tsuyoshi


    We investigate storage capacity of two types of fully connected layered neural networks with sparse coding when binary patterns are embedded into the networks by a Hebbian learning rule. One of them is a layered network, in which a transfer function of even layers is different from that of odd layers. The other is a layered network with intra-layer connections, in which the transfer function of inter-layer is different from that of intra-layer, and inter-layered neurons and intra-layered neurons are updated alternately. We derive recursion relations for order parameters by means of the signal-to-noise ratio method, and then apply the self-control threshold method proposed by Dominguez and Bollé to both layered networks with monotonic transfer functions. We find that a critical value αC of storage capacity is about 0.11|a ln a| -1 ( a≪1) for both layered networks, where a is a neuronal activity. It turns out that the basin of attraction is larger for both layered networks when the self-control threshold method is applied.

  5. HAWC Upgrade with a Sparse Outrigger Array

    Sandoval, A


    The High Altitude Water Cherenkov (HAWC) high-energy gamma-ray observatory has recently been completed on the slopes of the Sierra Negra volcano in central Mexico. HAWC consists of 300 Water Cherenkov Detectors, each containing 180 m$^3$ of ultra-purified water, that cover a total surface area of 20,000 m$^2$. It detects and reconstructs cosmic- and gamma-ray showers in the energy range of 100 GeV to 100 TeV. The HAWC trigger for the highest energy gammas reaches an effective area of 10$^5$ m$^2$ but many of them are poorly reconstructed because the shower core falls outside the array. An upgrade that increases the present fraction of well reconstructed showers above 10 TeV by a factor of 3-4 can be done with a sparse outrigger array of small water Cherenkov detectors that pinpoint the core position and by that improve the angular resolution of the reconstructed showers. Such an outrigger array would be of the order of 200 small water Cherenkov detectors of 2.5 m$^3$ placed over an area four times larger than...

  6. Transformer fault diagnosis using continuous sparse autoencoder.

    Wang, Lukun; Zhao, Xiaoying; Pei, Jiangnan; Tang, Gongyou


    This paper proposes a novel continuous sparse autoencoder (CSAE) which can be used in unsupervised feature learning. The CSAE adds Gaussian stochastic unit into activation function to extract features of nonlinear data. In this paper, CSAE is applied to solve the problem of transformer fault recognition. Firstly, based on dissolved gas analysis method, IEC three ratios are calculated by the concentrations of dissolved gases. Then IEC three ratios data is normalized to reduce data singularity and improve training speed. Secondly, deep belief network is established by two layers of CSAE and one layer of back propagation (BP) network. Thirdly, CSAE is adopted to unsupervised training and getting features. Then BP network is used for supervised training and getting transformer fault. Finally, the experimental data from IEC TC 10 dataset aims to illustrate the effectiveness of the presented approach. Comparative experiments clearly show that CSAE can extract features from the original data, and achieve a superior correct differentiation rate on transformer fault diagnosis.

  7. Image fusion with nonsubsampled contourlet transform and sparse representation

    Wang, Jun; Peng, Jinye; Feng, Xiaoyi; He, Guiqing; Wu, Jun; Yan, Kun


    Image fusion combines several images of the same scene into a fused image, which contains all important information. Multiscale transform and sparse representation can solve this problem effectively. However, due to the limited number of dictionary atoms, it is difficult to provide an accurate description for image details in the sparse representation-based image fusion method, and it needs a great deal of calculations. In addition, for the multiscale transform-based method, the low-pass subband coefficients are so hard to represent sparsely that they cannot extract significant features from images. In this paper, a nonsubsampled contourlet transform (NSCT) and sparse representation-based image fusion method (NSCTSR) is proposed. NSCT is used to perform a multiscale decomposition of source images to express the details of images, and we present a dictionary learning scheme in NSCT domain, based on which we can represent low-frequency information of the image sparsely in order to extract the salient features of images. Furthermore, it can reduce the calculation cost of the fusion algorithm with sparse representation by the way of nonoverlapping blocking. The experimental results show that the proposed method outperforms both the fusion method based on single sparse representation and multiscale decompositon.

  8. Optimized design and analysis of sparse-sampling FMRI experiments.

    Perrachione, Tyler K; Ghosh, Satrajit S


    Sparse-sampling is an important methodological advance in functional magnetic resonance imaging (fMRI), in which silent delays are introduced between MR volume acquisitions, allowing for the presentation of auditory stimuli without contamination by acoustic scanner noise and for overt vocal responses without motion-induced artifacts in the functional time series. As such, the sparse-sampling technique has become a mainstay of principled fMRI research into the cognitive and systems neuroscience of speech, language, hearing, and music. Despite being in use for over a decade, there has been little systematic investigation of the acquisition parameters, experimental design considerations, and statistical analysis approaches that bear on the results and interpretation of sparse-sampling fMRI experiments. In this report, we examined how design and analysis choices related to the duration of repetition time (TR) delay (an acquisition parameter), stimulation rate (an experimental design parameter), and model basis function (an analysis parameter) act independently and interactively to affect the neural activation profiles observed in fMRI. First, we conducted a series of computational simulations to explore the parameter space of sparse design and analysis with respect to these variables; second, we validated the results of these simulations in a series of sparse-sampling fMRI experiments. Overall, these experiments suggest the employment of three methodological approaches that can, in many situations, substantially improve the detection of neurophysiological response in sparse fMRI: (1) Sparse analyses should utilize a physiologically informed model that incorporates hemodynamic response convolution to reduce model error. (2) The design of sparse fMRI experiments should maintain a high rate of stimulus presentation to maximize effect size. (3) TR delays of short to intermediate length can be used between acquisitions of sparse-sampled functional image volumes to increase

  9. Electromagnetic Formation Flight (EMFF) for Sparse Aperture Arrays

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


    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.

  10. Real-time Algorithms for Sparse Neuronal System Identification.

    Sheikhattar, Alireza; Babadi, Behtash


    We consider the problem of sparse adaptive neuronal system identification, where the goal is to estimate the sparse time-varying neuronal model parameters in an online fashion from neural spiking observations. We develop two adaptive filters based on greedy estimation techniques and regularized log-likelihood maximization. We apply the proposed algorithms to simulated spiking data as well as experimentally recorded data from the ferret's primary auditory cortex during performance of auditory tasks. Our results reveal significant performance gains achieved by the proposed algorithms in terms of sparse identification and trackability, compared to existing algorithms.

  11. Accelerating Dynamic Cardiac MR Imaging Using Structured Sparse Representation

    Nian Cai


    Full Text Available Compressed sensing (CS has produced promising results on dynamic cardiac MR imaging by exploiting the sparsity in image series. In this paper, we propose a new method to improve the CS reconstruction for dynamic cardiac MRI based on the theory of structured sparse representation. The proposed method user the PCA subdictionaries for adaptive sparse representation and suppresses the sparse coding noise to obtain good reconstructions. An accelerated iterative shrinkage algorithm is used to solve the optimization problem and achieve a fast convergence rate. Experimental results demonstrate that the proposed method improves the reconstruction quality of dynamic cardiac cine MRI over the state-of-the-art CS method.

  12. Periodic pattern detection in sparse boolean sequences

    Hérisson Joan


    Full Text Available Abstract Background The specific position of functionally related genes along the DNA has been shown to reflect the interplay between chromosome structure and genetic regulation. By investigating the statistical properties of the distances separating such genes, several studies have highlighted various periodic trends. In many cases, however, groups built up from co-functional or co-regulated genes are small and contain wrong information (data contamination so that the statistics is poorly exploitable. In addition, gene positions are not expected to satisfy a perfectly ordered pattern along the DNA. Within this scope, we present an algorithm that aims to highlight periodic patterns in sparse boolean sequences, i.e. sequences of the type 010011011010... where the ratio of the number of 1's (denoting here the transcription start of a gene to 0's is small. Results The algorithm is particularly robust with respect to strong signal distortions such as the addition of 1's at arbitrary positions (contaminated data, the deletion of existing 1's in the sequence (missing data and the presence of disorder in the position of the 1's (noise. This robustness property stems from an appropriate exploitation of the remarkable alignment properties of periodic points in solenoidal coordinates. Conclusions The efficiency of the algorithm is demonstrated in situations where standard Fourier-based spectral methods are poorly adapted. We also show how the proposed framework allows to identify the 1's that participate in the periodic trends, i.e. how the framework allows to allocate a positional score to genes, in the same spirit of the sequence score. The software is available for public use at

  13. BlockSolve v1.1: Scalable library software for the parallel solution of sparse linear systems

    Jones, M.T.; Plassmann, P.E.


    BlockSolve is a software library for solving large, sparse systems of linear equations on massively parallel computers. The matrices must be symmetric, but may have an arbitrary sparsity structure. BlockSolve is a portable package that is compatible with several different message-passing pardigms. This report gives detailed instructions on the use of BlockSolve in applications programs.

  14. BlockSolve v1. 1: Scalable library software for the parallel solution of sparse linear systems

    Jones, M.T.; Plassmann, P.E.


    BlockSolve is a software library for solving large, sparse systems of linear equations on massively parallel computers. The matrices must be symmetric, but may have an arbitrary sparsity structure. BlockSolve is a portable package that is compatible with several different message-passing pardigms. This report gives detailed instructions on the use of BlockSolve in applications programs.

  15. Energy balanced strategies for maximizing the lifetime of sparsely deployed underwater acoustic sensor networks.

    Luo, Hanjiang; Guo, Zhongwen; Wu, Kaishun; Hong, Feng; Feng, Yuan


    Underwater acoustic sensor networks (UWA-SNs) are envisioned to perform monitoring tasks over the large portion of the world covered by oceans. Due to economics and the large area of the ocean, UWA-SNs are mainly sparsely deployed networks nowadays. The limited battery resources is a big challenge for the deployment of such long-term sensor networks. Unbalanced battery energy consumption will lead to early energy depletion of nodes, which partitions the whole networks and impairs the integrity of the monitoring datasets or even results in the collapse of the entire networks. On the contrary, balanced energy dissipation of nodes can prolong the lifetime of such networks. In this paper, we focus on the energy balance dissipation problem of two types of sparsely deployed UWA-SNs: underwater moored monitoring systems and sparsely deployed two-dimensional UWA-SNs. We first analyze the reasons of unbalanced energy consumption in such networks, then we propose two energy balanced strategies to maximize the lifetime of networks both in shallow and deep water. Finally, we evaluate our methods by simulations and the results show that the two strategies can achieve balanced energy consumption per node while at the same time prolong the networks lifetime.

  16. Energy Balanced Strategies for Maximizing the Lifetime of Sparsely Deployed Underwater Acoustic Sensor Networks

    Hanjiang Luo


    Full Text Available Underwater acoustic sensor networks (UWA-SNs are envisioned to perform monitoring tasks over the large portion of the world covered by oceans. Due to economics and the large area of the ocean, UWA-SNs are mainly sparsely deployed networks nowadays. The limited battery resources is a big challenge for the deployment of such long-term sensor networks. Unbalanced battery energy consumption will lead to early energy depletion of nodes, which partitions the whole networks and impairs the integrity of the monitoring datasets or even results in the collapse of the entire networks. On the contrary, balanced energy dissipation of nodes can prolong the lifetime of such networks. In this paper, we focus on the energy balance dissipation problem of two types of sparsely deployed UWA-SNs: underwater moored monitoring systems and sparsely deployed two-dimensional UWA-SNs. We first analyze the reasons of unbalanced energy consumption in such networks, then we propose two energy balanced strategies to maximize the lifetime of networks both in shallow and deep water. Finally, we evaluate our methods by simulations and the results show that the two strategies can achieve balanced energy consumption per node while at the same time prolong the networks lifetime.

  17. An NoC Traffic Compiler for Efficient FPGA Implementation of Sparse Graph-Oriented Workloads

    Nachiket Kapre


    synchronization to optimize our workloads for large networks up to 2025 parallel elements for BSP model and 25 parallel elements for Token Dataflow. This allows us to demonstrate speedups between 1.2× and 22× (3.5× mean, area reductions (number of Processing Elements between 3× and 15× (9× mean and dynamic energy savings between 2× and 3.5× (2.7× mean over a range of real-world graph applications in the BSP compute model. We deliver speedups of 0.5–13× (geomean 3.6× for Sparse Direct Matrix Solve (Token Dataflow compute model applied to a range of sparse matrices when using a high-quality placement algorithm. We expect such traffic optimization tools and techniques to become an essential part of the NoC application-mapping flow.

  18. Sparse representations and convex optimization as tools for LOFAR radio interferometric imaging

    Girard, Julien N; Starck, Jean Luc; Corbel, Stéphane; Woiselle, Arnaud; Tasse, Cyril; McKean, John P; Bobin, Jérôme


    Compressed sensing theory is slowly making its way to solve more and more astronomical inverse problems. We address here the application of sparse representations, convex optimization and proximal theory to radio interferometric imaging. First, we expose the theory behind interferometric imaging, sparse representations and convex optimization, and second, we illustrate their application with numerical tests with SASIR, an implementation of the FISTA, a Forward-Backward splitting algorithm hosted in a LOFAR imager. Various tests have been conducted in Garsden et al., 2015. The main results are: i) an improved angular resolution (super resolution of a factor ~2) with point sources as compared to CLEAN on the same data, ii) correct photometry measurements on a field of point sources at high dynamic range and iii) the imaging of extended sources with improved fidelity. SASIR provides better reconstructions (five time less residuals) of the extended emissions as compared to CLEAN. With the advent of large radiotel...

  19. Sparse Recovery for Bistatic MIMO Radar Imaging in the Presence of Array Gain Uncertainties

    Jun Li


    Full Text Available A sparse recovery based transmit-receive angle imaging scheme is proposed for bistatic multiple-input multiple-output (MIMO radar. The redundancy of the transmit and receive angles in the same range cell is exploited to construct the sparse model. The imaging is then performed by compressive sensing method with consideration of both the transmit and receive array gain uncertainties. An additional constraint is imposed on the inverse of the transmit and receive array gain errors matrices to make the optimization problem of the CS solvable. The image of the targets can be reconstructed using small number of snapshots in the case of large array gain uncertainties. Simulation results confirm the effectiveness of the proposed scheme.

  20. Improving the energy efficiency of sparse linear system solvers on multicore and manycore systems.

    Anzt, H; Quintana-Ortí, E S


    While most recent breakthroughs in scientific research rely on complex simulations carried out in large-scale supercomputers, the power draft and energy spent for this purpose is increasingly becoming a limiting factor to this trend. In this paper, we provide an overview of the current status in energy-efficient scientific computing by reviewing different technologies used to monitor power draft as well as power- and energy-saving mechanisms available in commodity hardware. For the particular domain of sparse linear algebra, we analyse the energy efficiency of a broad collection of hardware architectures and investigate how algorithmic and implementation modifications can improve the energy performance of sparse linear system solvers, without negatively impacting their performance.

  1. Bayesian model choice and information criteria in sparse generalized linear models

    Foygel, Rina


    We consider Bayesian model selection in generalized linear models that are high-dimensional, with the number of covariates p being large relative to the sample size n, but sparse in that the number of active covariates is small compared to p. Treating the covariates as random and adopting an asymptotic scenario in which p increases with n, we show that Bayesian model selection using certain priors on the set of models is asymptotically equivalent to selecting a model using an extended Bayesian information criterion. Moreover, we prove that the smallest true model is selected by either of these methods with probability tending to one. Having addressed random covariates, we are also able to give a consistency result for pseudo-likelihood approaches to high-dimensional sparse graphical modeling. Experiments on real data demonstrate good performance of the extended Bayesian information criterion for regression and for graphical models.

  2. Iterative solution of general sparse linear systems on clusters of workstations

    Lo, Gen-Ching; Saad, Y. [Univ. of Minnesota, Minneapolis, MN (United States)


    Solving sparse irregularly structured linear systems on parallel platforms poses several challenges. First, sparsity makes it difficult to exploit data locality, whether in a distributed or shared memory environment. A second, perhaps more serious challenge, is to find efficient ways to precondition the system. Preconditioning techniques which have a large degree of parallelism, such as multicolor SSOR, often have a slower rate of convergence than their sequential counterparts. Finally, a number of other computational kernels such as inner products could ruin any gains gained from parallel speed-ups, and this is especially true on workstation clusters where start-up times may be high. In this paper we discuss these issues and report on our experience with PSPARSLIB, an on-going project for building a library of parallel iterative sparse matrix solvers.

  3. Design of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers

    Lin, Fu; Jovanović, Mihailo R


    We design sparse and block sparse feedback gains that minimize the $H_2$ norm of distributed systems. Our approach consists of two steps. First, we identify sparsity patterns of the feedback gains by incorporating sparsity-promoting penalty functions into the $H_2$ problem, where the added terms penalize the number of communication links in the distributed controller. Second, we optimize the state feedback gains subject to the structural constraints determined by the identified sparsity patterns. This polishing step improves the $H_2$ performance of the distributed controllers. In the first step, we identify sparsity structure of the feedback gains using the alternating direction method of multipliers, which is a powerful algorithm well-suited to large optimization problems. This method alternates between optimizing the sparsity and optimizing the closed-loop $H_2$ norm, which allows us to exploit the structure of the corresponding objective functions. In particular, we take advantage of the separability of t...

  4. Capacity of Sparse Wideband Channels with Partial Channel Feedback

    Hariharan, Gautham; Sayeed, Akbar M


    This paper studies the ergodic capacity of wideband multipath channels with limited feedback. Our work builds on recent results that have established the possibility of significant capacity gains in the wideband/low-SNR regime when there is perfect channel state information (CSI) at the transmitter. Furthermore, the perfect CSI benchmark gain can be obtained with the feedback of just one bit per channel coefficient. However, the input signals used in these methods are peaky, that is, they have a large peak-to-average power ratios. Signal peakiness is related to channel coherence and many recent measurement campaigns show that, in contrast to previous assumptions, wideband channels exhibit a sparse multipath structure that naturally leads to coherence in time and frequency. In this work, we first show that even an instantaneous power constraint is sufficient to achieve the benchmark gain when perfect CSI is available at the receiver. In the more realistic non-coherent setting, we study the performance of a tra...

  5. Optimization Techniques for Dimensionally Truncated Sparse Grids on Heterogeneous Systems

    Deftu, A.


    Given the existing heterogeneous processor landscape dominated by CPUs and GPUs, topics such as programming productivity and performance portability have become increasingly important. In this context, an important question refers to how can we develop optimization strategies that cover both CPUs and GPUs. We answer this for fastsg, a library that provides functionality for handling efficiently high-dimensional functions. As it can be employed for compressing and decompressing large-scale simulation data, it finds itself at the core of a computational steering application which serves us as test case. We describe our experience with implementing fastsg\\'s time critical routines for Intel CPUs and Nvidia Fermi GPUs. We show the differences and especially the similarities between our optimization strategies for the two architectures. With regard to our test case for which achieving high speedups is a "must" for real-time visualization, we report a speedup of up to 6.2x times compared to the state-of-the-art implementation of the sparse grid technique for GPUs. © 2013 IEEE.

  6. Sparse source configurations in radio tomography of asteroids

    Pursiainen, S.; Kaasalainen, M.


    Our research targets at progress in non-invasive imaging of asteroids to support future planetary research and extra-terrestrial mining activities. This presentation concerns principally radio tomography in which the permittivity distribution inside an asteroid is to be recovered based on the radio frequency signal transmitted from the asteroid's surface and gathered by an orbiter. The focus will be on a sparse distribution (Pursiainen and Kaasalainen, 2013) of signal sources that can be necessary in the challenging in situ environment and within tight payload limits. The general goal in our recent research has been to approximate the minimal number of source positions needed for robust localization of anomalies caused, for example, by an internal void. Characteristic to the localization problem are the large relative changes in signal speed caused by the high permittivity of typical asteroid minerals (e.g. basalt), meaning that a signal path can include strong refractions and reflections. This presentation introduces results of a laboratory experiment in which real travel time data was inverted using a hierarchical Bayesian approach combined with the iterative alternating sequential (IAS) posterior exploration algorithm. Special interest was paid to robustness of the inverse results regarding changes of the prior model and source positioning. According to our results, strongly refractive anomalies can be detected with three or four sources independently of their positioning.

  7. Robust visual tracking via multi-task sparse learning

    Zhang, Tianzhu


    In this paper, we formulate object tracking in a particle filter framework as a multi-task sparse learning problem, which we denote as Multi-Task Tracking (MTT). Since we model particles as linear combinations of dictionary templates that are updated dynamically, learning the representation of each particle is considered a single task in MTT. By employing popular sparsity-inducing p, q mixed norms (p D; 1), we regularize the representation problem to enforce joint sparsity and learn the particle representations together. As compared to previous methods that handle particles independently, our results demonstrate that mining the interdependencies between particles improves tracking performance and overall computational complexity. Interestingly, we show that the popular L 1 tracker [15] is a special case of our MTT formulation (denoted as the L 11 tracker) when p q 1. The learning problem can be efficiently solved using an Accelerated Proximal Gradient (APG) method that yields a sequence of closed form updates. As such, MTT is computationally attractive. We test our proposed approach on challenging sequences involving heavy occlusion, drastic illumination changes, and large pose variations. Experimental results show that MTT methods consistently outperform state-of-the-art trackers. © 2012 IEEE.

  8. Sparse coding joint decision rule for ear print recognition

    Guermoui, Mawloud; Melaab, Djamel; Mekhalfi, Mohamed Lamine


    Human ear recognition has been promoted as a profitable biometric over the past few years. With respect to other modalities, such as the face and iris, that have undergone a significant investigation in the literature, ear pattern is relatively still uncommon. We put forth a sparse coding-induced decision-making for ear recognition. It jointly involves the reconstruction residuals and the respective reconstruction coefficients pertaining to the input features (co-occurrence of adjacent local binary patterns) for a further fusion. We particularly show that combining both components (i.e., the residuals as well as the coefficients) yields better outcomes than the case when either of them is deemed singly. The proposed method has been evaluated on two benchmark datasets, namely IITD1 (125 subject) and IITD2 (221 subjects). The recognition rates of the suggested scheme amount for 99.5% and 98.95% for both datasets, respectively, which suggest that our method decently stands out against reference state-of-the-art methodologies. Furthermore, experiments conclude that the presented scheme manifests a promising robustness under large-scale occlusion scenarios.

  9. Heterogeneous micro-structure of percolation in sparse networks

    Kühn, Reimer; Rogers, Tim


    We examine the heterogeneous responses of individual nodes in sparse networks to the random removal of a fraction of edges. Using the message-passing formulation of percolation, we discover considerable variation across the network in the probability of a particular node to remain part of the giant component, and in the expected size of small clusters containing that node. In the vicinity of the percolation threshold, weakly non-linear analysis reveals that node-to-node heterogeneity is captured by the recently introduced notion of non-backtracking centrality. We supplement these results for fixed finite networks by a population dynamics approach to analyse random graph models in the infinite system size limit, also providing closed-form approximations for the large mean degree limit of Erdős-Rényi random graphs. Interpreted in terms of the application of percolation to real-world processes, our results shed light on the heterogeneous exposure of different nodes to cascading failures, epidemic spread, and information flow.

  10. 3rd Workshop on Sparse Grids and Applications

    Pflüger, Dirk


    This volume of LNCSE is a collection of the papers from the proceedings of the third workshop on sparse grids and applications. Sparse grids are a popular approach for the numerical treatment of high-dimensional problems. Where classical numerical discretization schemes fail in more than three or four dimensions, sparse grids, in their different guises, are frequently the method of choice, be it spatially adaptive in the hierarchical basis or via the dimensionally adaptive combination technique. Demonstrating once again the importance of this numerical discretization scheme, the selected articles present recent advances on the numerical analysis of sparse grids as well as efficient data structures. The book also discusses a range of applications, including uncertainty quantification and plasma physics.

  11. Sparse encoding of automatic visual association in hippocampal networks

    Hulme, Oliver J; Skov, Martin; Chadwick, Martin J


    Intelligent action entails exploiting predictions about associations between elements of ones environment. The hippocampus and mediotemporal cortex are endowed with the network topology, physiology, and neurochemistry to automatically and sparsely code sensori-cognitive associations that can...

  12. Ensemble polarimetric SAR image classification based on contextual sparse representation

    Zhang, Lamei; Wang, Xiao; Zou, Bin; Qiao, Zhijun


    Polarimetric SAR image interpretation has become one of the most interesting topics, in which the construction of the reasonable and effective technique of image classification is of key importance. Sparse representation represents the data using the most succinct sparse atoms of the over-complete dictionary and the advantages of sparse representation also have been confirmed in the field of PolSAR classification. However, it is not perfect, like the ordinary classifier, at different aspects. So ensemble learning is introduced to improve the issue, which makes a plurality of different learners training and obtained the integrated results by combining the individual learner to get more accurate and ideal learning results. Therefore, this paper presents a polarimetric SAR image classification method based on the ensemble learning of sparse representation to achieve the optimal classification.

  13. Local and Dimension Adaptive Sparse Grid Interpolation and Quadrature

    Jakeman, John D


    In this paper we present a locally and dimension-adaptive sparse grid method for interpolation and integration of high-dimensional functions with discontinuities. The proposed algorithm combines the strengths of the generalised sparse grid algorithm and hierarchical surplus-guided local adaptivity. A high-degree basis is used to obtain a high-order method which, given sufficient smoothness, performs significantly better than the piecewise-linear basis. The underlying generalised sparse grid algorithm greedily selects the dimensions and variable interactions that contribute most to the variability of a function. The hierarchical surplus of points within the sparse grid is used as an error criterion for local refinement with the aim of concentrating computational effort within rapidly varying or discontinuous regions. This approach limits the number of points that are invested in `unimportant' dimensions and regions within the high-dimensional domain. We show the utility of the proposed method for non-smooth fu...

  14. SAR target recognition based on improved joint sparse representation

    Cheng, Jian; Li, Lan; Li, Hongsheng; Wang, Feng


    In this paper, a SAR target recognition method is proposed based on the improved joint sparse representation (IJSR) model. The IJSR model can effectively combine multiple-view SAR images from the same physical target to improve the recognition performance. The classification process contains two stages. Convex relaxation is used to obtain support sample candidates with the ℓ 1-norm minimization in the first stage. The low-rank matrix recovery strategy is introduced to explore the final support samples and its corresponding sparse representation coefficient matrix in the second stage. Finally, with the minimal reconstruction residual strategy, we can make the SAR target classification. The experimental results on the MSTAR database show the recognition performance outperforms state-of-the-art methods, such as the joint sparse representation classification (JSRC) method and the sparse representation classification (SRC) method.

  15. Support agnostic Bayesian matching pursuit for block sparse signals

    Masood, Mudassir


    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.

  16. Manifold Elastic Net: A Unified Framework for Sparse Dimension Reduction

    Zhou, Tianyi; Wu, Xindong


    It is difficult to find the optimal sparse solution of a manifold learning based dimensionality reduction algorithm. The lasso or the elastic net penalized manifold learning based dimensionality reduction is not directly a lasso penalized least square problem and thus the least angle regression (LARS) (Efron et al. \\cite{LARS}), one of the most popular algorithms in sparse learning, cannot be applied. Therefore, most current approaches take indirect ways or have strict settings, which can be inconvenient for applications. In this paper, we proposed the manifold elastic net or MEN for short. MEN incorporates the merits of both the manifold learning based dimensionality reduction and the sparse learning based dimensionality reduction. By using a series of equivalent transformations, we show MEN is equivalent to the lasso penalized least square problem and thus LARS is adopted to obtain the optimal sparse solution of MEN. In particular, MEN has the following advantages for subsequent classification: 1) the local...

  17. Parametric Sparse Representation and Its Applications to Radar Sensing

    Li Gang


    Full Text Available Sparse signal processing has been utilized to the area of radar sensing. Due to the presence of unknown factors such as the motion of the targets of interest and the error of the radar trajectory, a predesigned dictionary cannot provide the optimally spare representation of the actual radar signals. This paper will introduce a method called parametric sparse representation, which is a special case of dictionary learning and can dynamically learn the unknown factors during the radar sensing and achieve the optimally sparse representation of radar signals. This paper will also introduce the applications of parametric sparse representation to Inverse Synthetic Aperture Radar imaging (ISAR imaging, Synthetic Aperture Radar imaging (SAR autofocusing and target recognition based on micro-Doppler effect.

  18. Comparison of Methods for Sparse Representation of Musical Signals

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


    Networks, Matching Pursuit, Best Orthogonal Basis, Alternating Projections and Methods of Frames on “real” signals. The methods are applied on a number of excerpts sampled from a small collection of music, and their ability to expresmusic signals in a sparse manner is evaluated. The sparseness is measured......Within the last few decades a number of new signal processing tools has appeared. These have mainly been compared using constructed signals, signals designed to show the advantage of a new method over already existing methods. In this paper we evaluate the methods Basis Pursuit, Minimum Fuel Neural...... 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....

  19. Sparse Vector Distributions and Recovery from Compressed Sensing

    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....

  20. Sparse reconstruction using distribution agnostic bayesian matching pursuit

    Masood, Mudassir


    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.