Image denoising via collaborative support-agnostic recovery

KAUST Repository

Behzad, Muzammil; Masood, Mudassir; Ballal, Tarig; Shadaydeh, Maha; Al-Naffouri, Tareq Y.

2017-01-01

In this paper, we propose a novel patch-based image denoising algorithm using collaborative support-agnostic sparse reconstruction. In the proposed collaborative scheme, similar patches are assumed to share the same support taps. For sparse reconstruction, the likelihood of a tap being active in a patch is computed and refined through a collaboration process with other similar patches in the similarity group. This provides a very good patch support estimation, hence enhancing the quality of image restoration. Performance comparisons with state-of-the-art algorithms, in terms of PSNR and SSIM, demonstrate the superiority of the proposed algorithm.

Image denoising via collaborative support-agnostic recovery

KAUST Repository

Behzad, Muzammil

2017-06-20

In this paper, we propose a novel patch-based image denoising algorithm using collaborative support-agnostic sparse reconstruction. In the proposed collaborative scheme, similar patches are assumed to share the same support taps. For sparse reconstruction, the likelihood of a tap being active in a patch is computed and refined through a collaboration process with other similar patches in the similarity group. This provides a very good patch support estimation, hence enhancing the quality of image restoration. Performance comparisons with state-of-the-art algorithms, in terms of PSNR and SSIM, demonstrate the superiority of the proposed algorithm.

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

KAUST Repository

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

2016-01-01

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

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

KAUST Repository

Sana, Furrukh

2016-02-23

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

Distribution Agnostic Structured Sparsity Recovery: Algorithms and Applications

KAUST Repository

Masood, Mudassir

2015-05-01

Compressed sensing has been a very active area of research and several elegant algorithms have been developed for the recovery of sparse signals in the past few years. However, most of these algorithms are either computationally expensive or make some assumptions that are not suitable for all real world problems. Recently, focus has shifted to Bayesian-based approaches that are able to perform sparse signal recovery at much lower complexity while invoking constraint and/or a priori information about the data. While Bayesian approaches have their advantages, these methods must have access to a priori statistics. Usually, these statistics are unknown and are often difficult or even impossible to predict. An effective workaround is to assume a distribution which is typically considered to be Gaussian, as it makes many signal processing problems mathematically tractable. Seemingly attractive, this assumption necessitates the estimation of the associated parameters; which could be hard if not impossible. In the thesis, we focus on this aspect of Bayesian recovery and present a framework to address the challenges mentioned above. The proposed framework allows Bayesian recovery of sparse signals but at the same time is agnostic to the distribution of the unknown sparse signal components. The algorithms based on this framework are agnostic to signal statistics and utilize 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. In the thesis, we propose several algorithms based on this framework which utilize the structure present in signals for improved recovery. In addition to the algorithm that considers just the sparsity structure of sparse signals, tools that target additional structure of the sparsity recovery problem are proposed. These include several algorithms for a) block-sparse signal estimation, b) joint reconstruction of several common support sparse signals, and c

Binary Sparse Phase Retrieval via Simulated Annealing

Directory of Open Access Journals (Sweden)

Wei Peng

2016-01-01

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

Sparse reconstruction using distribution agnostic bayesian matching pursuit

KAUST Repository

Masood, Mudassir; Al-Naffouri, Tareq Y.

2013-01-01

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

Sparsely corrupted stimulated scattering signals recovery by iterative reweighted continuous basis pursuit

Energy Technology Data Exchange (ETDEWEB)

Wang, Kunpeng; Chai, Yi [College of Automation, Chongqing University, Chongqing 400044 (China); Su, Chunxiao [Research Center of Laser Fusion, CAEP, P. O. Box 919-983, Mianyang 621900 (China)

2013-08-15

In this paper, we consider the problem of extracting the desired signals from noisy measurements. This is a classical problem of signal recovery which is of paramount importance in inertial confinement fusion. To accomplish this task, we develop a tractable algorithm based on continuous basis pursuit and reweighted ℓ{sub 1}-minimization. By modeling the observed signals as superposition of scale time-shifted copies of theoretical waveform, structured noise, and unstructured noise on a finite time interval, a sparse optimization problem is obtained. We propose to solve this problem through an iterative procedure that alternates between convex optimization to estimate the amplitude, and local optimization to estimate the dictionary. The performance of the method was evaluated both numerically and experimentally. Numerically, we recovered theoretical signals embedded in increasing amounts of unstructured noise and compared the results with those obtained through popular denoising methods. We also applied the proposed method to a set of actual experimental data acquired from the Shenguang-II laser whose energy was below the detector noise-equivalent energy. Both simulation and experiments show that the proposed method improves the signal recovery performance and extends the dynamic detection range of detectors.

Sparsely corrupted stimulated scattering signals recovery by iterative reweighted continuous basis pursuit

International Nuclear Information System (INIS)

Wang, Kunpeng; Chai, Yi; Su, Chunxiao

2013-01-01

In this paper, we consider the problem of extracting the desired signals from noisy measurements. This is a classical problem of signal recovery which is of paramount importance in inertial confinement fusion. To accomplish this task, we develop a tractable algorithm based on continuous basis pursuit and reweighted ℓ 1 -minimization. By modeling the observed signals as superposition of scale time-shifted copies of theoretical waveform, structured noise, and unstructured noise on a finite time interval, a sparse optimization problem is obtained. We propose to solve this problem through an iterative procedure that alternates between convex optimization to estimate the amplitude, and local optimization to estimate the dictionary. The performance of the method was evaluated both numerically and experimentally. Numerically, we recovered theoretical signals embedded in increasing amounts of unstructured noise and compared the results with those obtained through popular denoising methods. We also applied the proposed method to a set of actual experimental data acquired from the Shenguang-II laser whose energy was below the detector noise-equivalent energy. Both simulation and experiments show that the proposed method improves the signal recovery performance and extends the dynamic detection range of detectors

Two-dimensional sparse wavenumber recovery for guided wavefields

Science.gov (United States)

Sabeti, Soroosh; Harley, Joel B.

2018-04-01

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

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

International Nuclear Information System (INIS)

Chen, Wen; Chen, Xudong; Wang, Xiaogang

2015-01-01

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

Spousal recovery support, recovery experiences, and life satisfaction crossover among dual-earner couples.

Science.gov (United States)

Park, YoungAh; Fritz, Charlotte

2015-03-01

Research has indicated the importance of recovery from work stress for employee well-being and work engagement. However, very little is known about the specific factors that may support or hinder recovery in the context of dual-earner couples. This study proposes spousal recovery support as a potential resource that dual-earner couples can draw on to enhance their recovery experiences and well-being. It was hypothesized that spousal recovery support would be related to the recipient spouse's life satisfaction via his or her own recovery experiences (i.e., psychological detachment, relaxation, and mastery experiences). The study further investigated the crossover of life satisfaction between working spouses as a potential outcome of recovery processes. Data from 318 full-time employed married couples in South Korea were analyzed using structural equation modeling. Results showed that spousal recovery support was positively related to all 3 recovery experiences of the recipient spouse. Moreover, this recovery support was related to the recipient spouse's life satisfaction via relaxation and mastery experiences. Unexpectedly, psychological detachment was negatively related to life satisfaction, possibly indicating a suppression effect. Life satisfaction crossed over between working spouses. No gender differences were found in the hypothesized paths. Based on these findings, theoretical and practical implications are discussed, and future research directions are presented. PsycINFO Database Record (c) 2015 APA, all rights reserved.

Structure-based bayesian sparse reconstruction

KAUST Repository

Quadeer, Ahmed Abdul

2012-12-01

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

Multi-stage classification method oriented to aerial image based on low-rank recovery and multi-feature fusion sparse representation.

Science.gov (United States)

Ma, Xu; Cheng, Yongmei; Hao, Shuai

2016-12-10

Automatic classification of terrain surfaces from an aerial image is essential for an autonomous unmanned aerial vehicle (UAV) landing at an unprepared site by using vision. Diverse terrain surfaces may show similar spectral properties due to the illumination and noise that easily cause poor classification performance. To address this issue, a multi-stage classification algorithm based on low-rank recovery and multi-feature fusion sparse representation is proposed. First, color moments and Gabor texture feature are extracted from training data and stacked as column vectors of a dictionary. Then we perform low-rank matrix recovery for the dictionary by using augmented Lagrange multipliers and construct a multi-stage terrain classifier. Experimental results on an aerial map database that we prepared verify the classification accuracy and robustness of the proposed method.

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

CERN Document Server

Cheng, Hong

2015-01-01

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

Sparse Adaptive Iteratively-Weighted Thresholding Algorithm (SAITA for L p -Regularization Using the Multiple Sub-Dictionary Representation

Directory of Open Access Journals (Sweden)

Yunyi Li

2017-12-01

Full Text Available Both L 1 / 2 and L 2 / 3 are two typical non-convex regularizations of L p ( 0 < p < 1 , which can be employed to obtain a sparser solution than the L 1 regularization. Recently, the multiple-state sparse transformation strategy has been developed to exploit the sparsity in L 1 regularization for sparse signal recovery, which combines the iterative reweighted algorithms. To further exploit the sparse structure of signal and image, this paper adopts multiple dictionary sparse transform strategies for the two typical cases p ∈ { 1 / 2 ,   2 / 3 } based on an iterative L p thresholding algorithm and then proposes a sparse adaptive iterative-weighted L p thresholding algorithm (SAITA. Moreover, a simple yet effective regularization parameter is proposed to weight each sub-dictionary-based L p regularizer. Simulation results have shown that the proposed SAITA not only performs better than the corresponding L 1 algorithms but can also obtain a better recovery performance and achieve faster convergence than the conventional single-dictionary sparse transform-based L p case. Moreover, we conduct some applications about sparse image recovery and obtain good results by comparison with relative work.

Efficient coordinated recovery of sparse channels in massive MIMO

KAUST Repository

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

2015-01-01

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

Promoting recovery through peer support: possibilities for social work practice.

Science.gov (United States)

Loumpa, Vasiliki

2012-01-01

The Recovery Approach has been adopted by mental health services worldwide and peer support constitutes one of the main elements of recovery-based services. This article discusses the relevancy of recovery and peer support to mental health social work practice through an exploration of social work ethics and values. Furthermore, it provides an exploration of how peer support can be maximized in groupwork to assist the social work clinician to promote recovery and well-being. More specifically, this article discusses how the narrative therapy concepts of "retelling" and "witnessing" can be used in the context of peer support to promote recovery, and also how social constructionist, dialogical, and systemic therapy approaches can assist the social work practitioner to enhance peer support in recovery oriented groupwork. Copyright © Taylor & Francis Group, LLC

Precise RFID localization in impaired environment through sparse signal recovery

Science.gov (United States)

Subedi, Saurav; Zhang, Yimin D.; Amin, Moeness G.

2013-05-01

Radio frequency identification (RFID) is a rapidly developing wireless communication technology for electronically identifying, locating, and tracking products, assets, and personnel. RFID has become one of the most important means to construct real-time locating systems (RTLS) that track and identify the location of objects in real time using simple, inexpensive tags and readers. The applicability and usefulness of RTLS techniques depend on their achievable accuracy. In particular, when multilateration-based localization techniques are exploited, the achievable accuracy primarily relies on the precision of the range estimates between a reader and the tags. Such range information can be obtained by using the received signal strength indicator (RSSI) and/or the phase difference of arrival (PDOA). In both cases, however, the accuracy is significantly compromised when the operation environment is impaired. In particular, multipath propagation significantly affects the measurement accuracy of both RSSI and phase information. In addition, because RFID systems are typically operated in short distances, RSSI and phase measurements are also coupled with the reader and tag antenna patterns, making accurate RFID localization very complicated and challenging. In this paper, we develop new methods to localize RFID tags or readers by exploiting sparse signal recovery techniques. The proposed method allows the channel environment and antenna patterns to be taken into account and be properly compensated at a low computational cost. As such, the proposed technique yields superior performance in challenging operation environments with the above-mentioned impairments.

Low-rank and sparse modeling for visual analysis

CERN Document Server

Fu, Yun

2014-01-01

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

Shearlets and Optimally Sparse Approximations

DEFF Research Database (Denmark)

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

2012-01-01

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

Data analysis in high-dimensional sparse spaces

DEFF Research Database (Denmark)

Clemmensen, Line Katrine Harder

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

Fast alternating projected gradient descent algorithms for recovering spectrally sparse signals

KAUST Repository

Cho, Myung

2016-06-24

We propose fast algorithms that speed up or improve the performance of recovering spectrally sparse signals from un-derdetermined measurements. Our algorithms are based on a non-convex approach of using alternating projected gradient descent for structured matrix recovery. We apply this approach to two formulations of structured matrix recovery: Hankel and Toeplitz mosaic structured matrix, and Hankel structured matrix. Our methods provide better recovery performance, and faster signal recovery than existing algorithms, including atomic norm minimization.

Fast alternating projected gradient descent algorithms for recovering spectrally sparse signals

KAUST Repository

Cho, Myung; Cai, Jian-Feng; Liu, Suhui; Eldar, Yonina C.; Xu, Weiyu

2016-01-01

We propose fast algorithms that speed up or improve the performance of recovering spectrally sparse signals from un-derdetermined measurements. Our algorithms are based on a non-convex approach of using alternating projected gradient descent for structured matrix recovery. We apply this approach to two formulations of structured matrix recovery: Hankel and Toeplitz mosaic structured matrix, and Hankel structured matrix. Our methods provide better recovery performance, and faster signal recovery than existing algorithms, including atomic norm minimization.

Sparse Adaptive Iteratively-Weighted Thresholding Algorithm (SAITA) for Lp-Regularization Using the Multiple Sub-Dictionary Representation.

Science.gov (United States)

Li, Yunyi; Zhang, Jie; Fan, Shangang; Yang, Jie; Xiong, Jian; Cheng, Xiefeng; Sari, Hikmet; Adachi, Fumiyuki; Gui, Guan

2017-12-15

Both L 1/2 and L 2/3 are two typical non-convex regularizations of L p (0dictionary sparse transform strategies for the two typical cases p∈{1/2, 2/3} based on an iterative Lp thresholding algorithm and then proposes a sparse adaptive iterative-weighted L p thresholding algorithm (SAITA). Moreover, a simple yet effective regularization parameter is proposed to weight each sub-dictionary-based L p regularizer. Simulation results have shown that the proposed SAITA not only performs better than the corresponding L₁ algorithms but can also obtain a better recovery performance and achieve faster convergence than the conventional single-dictionary sparse transform-based L p case. Moreover, we conduct some applications about sparse image recovery and obtain good results by comparison with relative work.

Decision support systems for recovery of endangered species

International Nuclear Information System (INIS)

Armstrong, C.E.

1995-01-01

The listing of a species as endangered under the Endangered Species Act invokes a suite of responses to help improve conditions for the recovery of that species, to include identification of stressors contributing to population loss, decision analysis of the impacts of proposed recovery options, and implementation of optimal recovery measures. The ability of a decision support system to quantify inherent stressor uncertainties and to identify the key stressors that can be controlled or eliminated becomes key to ensuring the recovery of an endangered species. The listing of the Snake River sockeye, spring/summer chinook, and fall chinook salmon species in the Snake River as endangered provides a vivid example of the importance of sophisticated decision support systems. Operational and physical changes under consideration at eight of the hydroelectric dams along the Columbia and Lower Snake River pose significant financial impacts to a variety of stakeholders involved in the salmon population recovery process and carry significant uncertainties of outcome. A decision support system is presented to assist in the identification of optimal recovery actions for this example that includes the following: creation of datamarts of information on environmental, engineering, and ecological values that influence species survival; incorporation of decision analysis tools to determine optimal decision policies; and the use of geographic information systems (GIS) to provide a context for decision analysis and to communicate the impacts of decision policies

Youth Homelessness: The Impact of Supportive Relationships on Recovery.

Science.gov (United States)

Gasior, Sara; Forchuk, Cheryl; Regan, Sandra

2018-03-01

Background Homeless youth are the fastest growing sub-group within the homeless population. They face impaired access to health services and are often left unsupported. They lack social and family support or relationships with service providers. Unsupported homeless youth often become homeless adults. Purpose To test a model based on Peplau's Theory of Interpersonal Relations, examining the influence of a network of service providers, perceptions of social supports, and family relations on a homeless youth's perceptions of recovery. Methods This study is a secondary analysis and used a sample (n = 187) of data collected as part of the original Youth Matters in London study. A cross-sectional design was used to analyze the relationship between variables. Participants were interviewed at 6-month intervals over a 2.5-year period. Hierarchical multiple regression analysis was used. Results Network of service providers, perceived social supports, and perceived family relations explained 21.8% of the variance in homeless youth perceptions of recovery. Perceived social support and family relations were significantly, positively correlated to perceptions of recovery. Network of service providers was not significantly correlated to perceptions of recovery. Conclusions The findings suggest that stronger social supports and family relations may contribute to increased perceptions of recovery among homeless youth.

Distribution agnostic structured sparsity recovery algorithms

KAUST Repository

Al-Naffouri, Tareq Y.; Masood, Mudassir

2013-01-01

We present an algorithm and its variants for sparse signal recovery from a small number of its measurements in a distribution agnostic manner. The proposed algorithm finds Bayesian estimate of a sparse signal to be recovered and at the same time

Sparse distributed memory overview

Science.gov (United States)

Raugh, Mike

1990-01-01

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

SparseM: A Sparse Matrix Package for R *

Directory of Open Access Journals (Sweden)

Roger Koenker

2003-02-01

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

Distribution agnostic structured sparsity recovery algorithms

KAUST Repository

Al-Naffouri, Tareq Y.

2013-05-01

We present an algorithm and its variants for sparse signal recovery from a small number of its measurements in a distribution agnostic manner. The proposed algorithm finds Bayesian estimate of a sparse signal to be recovered and at the same time is indifferent to the actual distribution of its non-zero elements. Termed Support Agnostic Bayesian Matching Pursuit (SABMP), the algorithm also has the capability of refining the estimates of signal and required parameters in the absence of the exact parameter values. The inherent feature of the algorithm of being agnostic to the distribution of the data grants it the flexibility to adapt itself to several related problems. Specifically, we present two important extensions to this algorithm. One extension handles the problem of recovering sparse signals having block structures while the other handles multiple measurement vectors to jointly estimate the related unknown signals. We conduct extensive experiments to show that SABMP and its variants have superior performance to most of the state-of-the-art algorithms and that too at low-computational expense. © 2013 IEEE.

The Alternative Peer Group: A Developmentally Appropriate Recovery Support Model for Adolescents.

Science.gov (United States)

Nash, Angela; Collier, Crystal

2016-01-01

Recovery as the goal for substance use disorder treatment has been a key component of the Substance Abuse and Mental Health Services Administration's mission for the past decade. Consistent with their mission, there is a call for research and development of recovery-oriented systems of care to support affected individuals through all stages of the recovery process. Evidence is emerging to support recovery practice and research for adults, but recovery-oriented models for adolescents are scant. The Alternative Peer Group (APG) is a comprehensive adolescent recovery support model that integrates recovering peers and prosocial activities into evidence-based clinical practice. Employing APG participants' own words, this article will describe the essential elements and three theoretical frameworks underlying the APG model to illustrate how the APG serves as a developmentally appropriate recovery support service for adolescents with substance use disorder.

SPARSE FARADAY ROTATION MEASURE SYNTHESIS

International Nuclear Information System (INIS)

Andrecut, M.; Stil, J. M.; Taylor, A. R.

2012-01-01

Faraday rotation measure synthesis is a method for analyzing multichannel polarized radio emissions, and it has emerged as an important tool in the study of Galactic and extragalactic magnetic fields. The method requires the recovery of the Faraday dispersion function from measurements restricted to limited wavelength ranges, which is an ill-conditioned deconvolution problem. Here, we discuss a recovery method that assumes a sparse approximation of the Faraday dispersion function in an overcomplete dictionary of functions. We discuss the general case when both thin and thick components are included in the model, and we present the implementation of a greedy deconvolution algorithm. We illustrate the method with several numerical simulations that emphasize the effect of the covered range and sampling resolution in the Faraday depth space, and the effect of noise on the observed data.

The influence of perceived family support on post surgery recovery.

Science.gov (United States)

Cardoso-Moreno, M J; Tomás-Aragones, L

2017-01-01

The objective of this work was to investigate the possible relationship between perceived family support, levels of cortisol and post surgery recovery. The study sample comprised 42 patients that were due to undergo open cholecystectomy surgery in a Regional Health Authority Reference Centre of the Autonomous Community of Extremadura in Spain. The FACES-II questionnaire was used for the evaluation of perceived family support and to measure the three fundamental dimensions of perceived family behaviour: cohesion, adaptability and family type. The day before surgery, a sample of saliva was taken from each subject in order to determine the level of cortisol. Results showed a clear relationship between family support and recovery. Patients with higher scores on the Cohesion Scale demonstrated better post surgery recovery (F = 8.8; gl = 40; p = .005). A relationship between levels of cortisol, perceived family support and recovery was also revealed. Patients with lower scores on the Cohesion scale and higher cortisol levels demonstrated poorer post surgery recovery (F = 10.96; gl = 40; p = .006). These results are coherent with other studies that have highlighted the beneficial effects of perceived family support on mental and physical health.

Socioeconomic Factors Affecting Local Support for Black Bear Recovery Strategies

Science.gov (United States)

Morzillo, Anita T.; Mertig, Angela G.; Hollister, Jeffrey W.; Garner, Nathan; Liu, Jianguo

2010-06-01

There is global interest in recovering locally extirpated carnivore species. Successful efforts to recover Louisiana black bear in Louisiana have prompted interest in recovery throughout the species’ historical range. We evaluated support for three potential black bear recovery strategies prior to public release of a black bear conservation and management plan for eastern Texas, United States. Data were collected from 1,006 residents living in proximity to potential recovery locations, particularly Big Thicket National Preserve. In addition to traditional logistic regression analysis, we used conditional probability analysis to statistically and visually evaluate probabilities of public support for potential black bear recovery strategies based on socioeconomic characteristics. Allowing black bears to repopulate the region on their own (i.e., without active reintroduction) was the recovery strategy with the greatest probability of acceptance. Recovery strategy acceptance was influenced by many socioeconomic factors. Older and long-time local residents were most likely to want to exclude black bears from the area. Concern about the problems that black bears may cause was the only variable significantly related to support or non-support across all strategies. Lack of personal knowledge about black bears was the most frequent reason for uncertainty about preferred strategy. In order to reduce local uncertainty about possible recovery strategies, we suggest that wildlife managers focus outreach efforts on providing local residents with general information about black bears, as well as information pertinent to minimizing the potential for human-black bear conflict.

CT Image Sequence Restoration Based on Sparse and Low-Rank Decomposition

Science.gov (United States)

Gou, Shuiping; Wang, Yueyue; Wang, Zhilong; Peng, Yong; Zhang, Xiaopeng; Jiao, Licheng; Wu, Jianshe

2013-01-01

Blurry organ boundaries and soft tissue structures present a major challenge in biomedical image restoration. In this paper, we propose a low-rank decomposition-based method for computed tomography (CT) image sequence restoration, where the CT image sequence is decomposed into a sparse component and a low-rank component. A new point spread function of Weiner filter is employed to efficiently remove blur in the sparse component; a wiener filtering with the Gaussian PSF is used to recover the average image of the low-rank component. And then we get the recovered CT image sequence by combining the recovery low-rank image with all recovery sparse image sequence. Our method achieves restoration results with higher contrast, sharper organ boundaries and richer soft tissue structure information, compared with existing CT image restoration methods. The robustness of our method was assessed with numerical experiments using three different low-rank models: Robust Principle Component Analysis (RPCA), Linearized Alternating Direction Method with Adaptive Penalty (LADMAP) and Go Decomposition (GoDec). Experimental results demonstrated that the RPCA model was the most suitable for the small noise CT images whereas the GoDec model was the best for the large noisy CT images. PMID:24023764

Sparse Source EEG Imaging with the Variational Garrote

DEFF Research Database (Denmark)

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

2013-01-01

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

From recovery values to recovery-oriented practice?

DEFF Research Database (Denmark)

Dalum, Helle; Pedersen, Inge Kryger; Cunningham, Harry

2015-01-01

Introduction: The recovery model has influenced mental health services and fostered new standards for best practice. However, knowledge about how mental health care professionals (HCPs) experience recoveryoriented programs is sparse. Aim/Question: This paper explores HCPs' experiences when...... facilitating a recovery-oriented rehabilitation program. The research question is howdo HCPs experience a change in their attitude and practicewhen applying recovery-oriented programs? Methods: This paper draws on semi-structured in-depth qualitative interviews conducted with 16 HCPs experienced...... in facilitating a recovery-oriented rehabilitation program in either the USA or Denmark. Results: Three themes emerged from the HCPs' reflections on changes in attitudes and practices: “Hopeful Attitude” captures a change in the HCPs' attitude toward a more positive view on the future for clients' living...

Dual-earner couples' weekend recovery support, state of recovery, and work engagement: Work-linked relationship as a moderator.

Science.gov (United States)

Park, YoungAh; Haun, Verena C

2017-10-01

Despite growing recovery research, little is known about couple-dyadic processes of recovery from work. Given that dual-earner couples experience most of their recovery opportunities during nonwork times when they are together, partners in a couple relationship may substantially affect recovery and work engagement. In this study, we propose a couple-dyadic model in which weekend partner recovery support (reported by the recipient partner) is positively related to the recipient partner's state of recovery after the weekend which, in turn, increases the recipient's work engagement the following week (actor-actor mediation effect). We also test the effect of one's state of recovery on the partner's subsequent work engagement (partner effect). Additionally, work-linked relationship status is tested as a moderator of the partner effect. Actor-partner interdependence mediation modeling is used to analyze the data from 167 dual-earner couples who answered surveys on 4 measurement occasions. The results support the indirect effect of partner recovery support on work engagement through the postweekend state of recovery. Multigroup analysis results reveal that the partner effect of state of recovery on work engagement is significant for work-linked couples only and is absent for non-work-linked couples. Theoretical and practical implications, limitations, and future research directions are discussed. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

Life Support Systems: Oxygen Generation and Recovery

Data.gov (United States)

National Aeronautics and Space Administration — The Advanced Exploration Systems (AES) Life Support Systems project Oxygen Generation and Recovery technology development area encompasses several sub-tasks in an...

Tunable Sparse Network Coding for Multicast Networks

DEFF Research Database (Denmark)

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

2014-01-01

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

Optimal deep neural networks for sparse recovery via Laplace techniques

OpenAIRE

Limmer, Steffen; Stanczak, Slawomir

2017-01-01

This paper introduces Laplace techniques for designing a neural network, with the goal of estimating simplex-constraint sparse vectors from compressed measurements. To this end, we recast the problem of MMSE estimation (w.r.t. a pre-defined uniform input distribution) as the problem of computing the centroid of some polytope that results from the intersection of the simplex and an affine subspace determined by the measurements. Owing to the specific structure, it is shown that the centroid ca...

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

Directory of Open Access Journals (Sweden)

YOU Hanxu

2016-04-01

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

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

Directory of Open Access Journals (Sweden)

Chunhui Zhao

2015-09-01

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

Social support in the post-abortion recovery room: evidence from patients, support persons and nurses in a Vancouver clinic.

Science.gov (United States)

Veiga, Mariana B; Lam, Melanie; Gemeinhardt, Carla; Houlihan, Edwina; Fitzsimmons, Brian P; Hodgson, Zoë G

2011-03-01

The benefits of social support in post-surgical recovery are well documented; social support decreases preoperative stress and postoperative recovery time. However, a paucity of studies have examined the effect of social support in the context of pregnancy termination. This study is the first to examine the effect of postoperative accompaniment from the patient, support person and nurses' perspective. This study was carried out in two phases. In Phase I, no accompaniment was allowed in the post-anesthesia recovery room (PAR); in Phase II, accompaniment was permitted. All participants completed pre- and postoperative questionnaires. The perception of accompaniment was overwhelmingly positive in patients and support people. Patients in Phase II demonstrated a high (over 95%) acceptance of accompaniment in the recovery room. It was found that 96.8% reported they would choose to be accompanied in the recovery room again if they had to have another abortion. Support persons felt very strongly that their presence was helpful to the patient. The decrease in pre- to postoperative anxiety levels was significantly greater in those women who were accompanied. However, overall, nurses demonstrated a negative attitude towards accompaniment in the recovery room. In summary, the presence of a support person in the PAR was perceived in a positive manner by patients and support people. However, the reasoning behind the negative opinion of nurses requires further study before PAR accompaniment can be considered a possibility in the context of pregnancy termination. Copyright © 2011 Elsevier Inc. All rights reserved.

Interference-Aware OFDM Receiver for Channels with Sparse Common Supports

DEFF Research Database (Denmark)

Barbu, Oana-Elena; Manchón, Carles Navarro; Badiu, Mihai Alin

2017-01-01

We design an algorithm for OFDM receivers operating in co-channel interference conditions, where the serving and interfering transmitters are synchronized in time. The channel estimation problem is formulated as one of sparse signal reconstruction using multiple measurement vectors. The proposed...

Recovery From Comorbidity

Directory of Open Access Journals (Sweden)

Mathew Carter

2013-11-01

Full Text Available Comorbidity among mood, anxiety, and alcohol disorders is common and burdensome, affecting individuals, families, and public health. A systematic and integrative review of the literature across disciplines and research methodologies was performed. Supradisciplinary approaches were applied to the review and the ensuing critical appraisal. Definitions, measurement, and estimation are controversial and inconstant. Recovery from comorbidity cannot be easily extricated from a sociocultural milieu. Methodological challenges in quantitative and qualitative research and across disciplines are many and are discussed. The evidence supporting current treatments is sparse and short-term, and modalities operating in isolation typically fail. People easily fall into the cracks between mental health and addiction services. Clinicians feel untrained and consumers bear the brunt of this: Judgmental and moralistic interactions persist and comorbidity is unrecognized in high-risk populations. Competing historical paradigms of mental illness and addiction present a barrier to progress and reductionism is an impediment to care and an obstacle to the integration and interpretation of research. What matters to consumers is challenging to quantify but worth considering: Finding employment, safe housing, and meaning are crucial to recovery. Complex social networks and peer support in recovery are important but poorly understood. The focus on modalities of limited evidence or generalizability persists in literature and practice. We need to consider different combinations of comorbidity, transitions as opposed to dichotomies of use or illness, and explore the long-term view and emic perspectives.

Quasi Gradient Projection Algorithm for Sparse Reconstruction in Compressed Sensing

Directory of Open Access Journals (Sweden)

Xin Meng

2014-02-01

Full Text Available Compressed sensing is a novel signal sampling theory under the condition that the signal is sparse or compressible. The existing recovery algorithms based on the gradient projection can either need prior knowledge or recovery the signal poorly. In this paper, a new algorithm based on gradient projection is proposed, which is referred as Quasi Gradient Projection. The algorithm presented quasi gradient direction and two step sizes schemes along this direction. The algorithm doesn’t need any prior knowledge of the original signal. Simulation results demonstrate that the presented algorithm cans recovery the signal more correctly than GPSR which also don’t need prior knowledge. Meanwhile, the algorithm has a lower computation complexity.

Robust nonhomogeneous training samples detection method for space-time adaptive processing radar using sparse-recovery with knowledge-aided

Science.gov (United States)

Li, Zhihui; Liu, Hanwei; Zhang, Yongshun; Guo, Yiduo

2017-10-01

The performance of space-time adaptive processing (STAP) may degrade significantly when some of the training samples are contaminated by the signal-like components (outliers) in nonhomogeneous clutter environments. To remove the training samples contaminated by outliers in nonhomogeneous clutter environments, a robust nonhomogeneous training samples detection method using the sparse-recovery (SR) with knowledge-aided (KA) is proposed. First, the reduced-dimension (RD) overcomplete spatial-temporal steering dictionary is designed with the prior knowledge of system parameters and the possible target region. Then, the clutter covariance matrix (CCM) of cell under test is efficiently estimated using a modified focal underdetermined system solver (FOCUSS) algorithm, where a RD overcomplete spatial-temporal steering dictionary is applied. Third, the proposed statistics are formed by combining the estimated CCM with the generalized inner products (GIP) method, and the contaminated training samples can be detected and removed. Finally, several simulation results validate the effectiveness of the proposed KA-SR-GIP method.

Fast convolutional sparse coding using matrix inversion lemma

Czech Academy of Sciences Publication Activity Database

Šorel, Michal; Šroubek, Filip

2016-01-01

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

Limited-memory trust-region methods for sparse relaxation

Science.gov (United States)

Adhikari, Lasith; DeGuchy, Omar; Erway, Jennifer B.; Lockhart, Shelby; Marcia, Roummel F.

2017-08-01

In this paper, we solve the l2-l1 sparse recovery problem by transforming the objective function of this problem into an unconstrained differentiable function and applying a limited-memory trust-region method. Unlike gradient projection-type methods, which uses only the current gradient, our approach uses gradients from previous iterations to obtain a more accurate Hessian approximation. Numerical experiments show that our proposed approach eliminates spurious solutions more effectively while improving computational time.

Semi-supervised sparse coding

KAUST Repository

Wang, Jim Jing-Yan; Gao, Xin

2014-01-01

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

Semi-supervised sparse coding

KAUST Repository

Wang, Jim Jing-Yan

2014-07-06

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

Personal and clinical recovery with the individual placement and support intervention in Denmark

DEFF Research Database (Denmark)

Nielsen, Iben Gammelgaard; Stenager, Elsebeth; Eplov, Lene

on outcomes often referred to as recovery measures i.e. symptoms and self-esteem is ambiguous. One branch of the recovery literature distinguishes between two kinds of recovery. The one, personal recovery is defined by: what helps the individual move beyond the role of being a patient with a mental illness......Introduction: Individual Placement and Support (IPS) is an evidence-based recovery-oriented intervention where employment specialists (ES) support persons with severe mental illness in achieving competitive employment. IPS is labelled a recovery-oriented intervention; although, the influence of IPS....... The other, clinical recovery is defined as symptom reduction and increased level of functioning. Aim: To investigate how an IPS-intervention influences the personal and clinical recovery in persons with severe mental illness. Method: A qualitative phenomenological study including interview of 12...

In Defense of Sparse Tracking: Circulant Sparse Tracker

KAUST Repository

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

2016-01-01

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

In Defense of Sparse Tracking: Circulant Sparse Tracker

KAUST Repository

Zhang, Tianzhu

2016-12-13

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

Uniform sparse bounds for discrete quadratic phase Hilbert transforms

Science.gov (United States)

Kesler, Robert; Arias, Darío Mena

2017-09-01

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

Efficient collaborative sparse channel estimation in massive MIMO

KAUST Repository

Masood, Mudassir

2015-08-12

We propose a method for estimation of sparse frequency selective channels within MIMO-OFDM systems. These channels are independently sparse and share a common support. The method estimates the impulse response for each channel observed by the antennas at the receiver. Estimation is performed in a coordinated manner by sharing minimal information among neighboring antennas to achieve results better than many contemporary methods. Simulations demonstrate the superior performance of the proposed method.

Efficient collaborative sparse channel estimation in massive MIMO

KAUST Repository

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

2015-01-01

We propose a method for estimation of sparse frequency selective channels within MIMO-OFDM systems. These channels are independently sparse and share a common support. The method estimates the impulse response for each channel observed by the antennas at the receiver. Estimation is performed in a coordinated manner by sharing minimal information among neighboring antennas to achieve results better than many contemporary methods. Simulations demonstrate the superior performance of the proposed method.

Socioeconomic Factors Affecting Local Support for Black Bear Recovery Strategies(AED)

Science.gov (United States)

There is global interest in recovering locally extirpated carnivore species. Successful efforts to recover Louisiana black bear in Louisiana have prompted interest in recovery throughout the species’ historical range. We evaluated support for three potential black bear recovery s...

Development of the REFOCUS intervention to increase mental health team support for personal recovery.

Science.gov (United States)

Slade, Mike; Bird, Victoria; Le Boutillier, Clair; Farkas, Marianne; Grey, Barbara; Larsen, John; Leamy, Mary; Oades, Lindsay; Williams, Julie

2015-12-01

There is an emerging evidence base about best practice in supporting recovery. This is usually framed in relation to general principles, and specific pro-recovery interventions are lacking. To develop a theoretically based and empirically defensible new pro-recovery manualised intervention--called the REFOCUS intervention. Seven systematic and two narrative reviews were undertaken. Identified evidence gaps were addressed in three qualitative studies. The findings were synthesised to produce the REFOCUS intervention, manual and model. The REFOCUS intervention comprises two components: recovery-promoting relationships and working practices. Approaches to supporting relationships comprise coaching skills training for staff, developing a shared team understanding of recovery, exploring staff values, a Partnership Project with people who use the service and raising patient expectations. Working practices comprise the following: understanding values and treatment preferences; assessing strengths; and supporting goal-striving. The REFOCUS model describes the causal pathway from the REFOCUS intervention to improved recovery. The REFOCUS intervention is an empirically supported pro-recovery intervention for use in mental health services. It will be evaluated in a multisite cluster randomised controlled trial (ISRCTN02507940). © The Royal College of Psychiatrists 2015.

Renal Function Recovery with Total Artificial Heart Support.

Science.gov (United States)

Quader, Mohammed A; Goodreau, Adam M; Shah, Keyur B; Katlaps, Gundars; Cooke, Richard; Smallfield, Melissa C; Tchoukina, Inna F; Wolfe, Luke G; Kasirajan, Vigneshwar

2016-01-01

Heart failure patients requiring total artificial heart (TAH) support often have concomitant renal insufficiency (RI). We sought to quantify renal function recovery in patients supported with TAH at our institution. Renal function data at 30, 90, and 180 days after TAH implantation were analyzed for patients with RI, defined as hemodialysis supported or an estimated glomerular filtration rate (eGFR) less than 60 ml/min/1.73 m. Between January 2008 and December 2013, 20 of the 46 (43.5%) TAH recipients (age 51 ± 9 years, 85% men) had RI, mean preoperative eGFR of 48 ± 7 ml/min/1.73 m. Renal function recovery was noted at each follow-up interval: increment in eGFR (ml/min/1.73 m) at 30, 90, and 180 days was 21 ± 35 (p = 0.1), 16.5 ± 18 (p = 0.05), and 10 ± 9 (p = 0.1), respectively. Six patients (30%) required preoperative dialysis. Of these, four recovered renal function, one remained on dialysis, and one died. Six patients (30%) required new-onset dialysis. Of these, three recovered renal function and three died. Overall, 75% (15 of 20) of patients' renal function improved with TAH support. Total artificial heart support improved renal function in 75% of patients with pre-existing significant RI, including those who required preoperative dialysis.

Superresolution radar imaging based on fast inverse-free sparse Bayesian learning for multiple measurement vectors

Science.gov (United States)

He, Xingyu; Tong, Ningning; Hu, Xiaowei

2018-01-01

Compressive sensing has been successfully applied to inverse synthetic aperture radar (ISAR) imaging of moving targets. By exploiting the block sparse structure of the target image, sparse solution for multiple measurement vectors (MMV) can be applied in ISAR imaging and a substantial performance improvement can be achieved. As an effective sparse recovery method, sparse Bayesian learning (SBL) for MMV involves a matrix inverse at each iteration. Its associated computational complexity grows significantly with the problem size. To address this problem, we develop a fast inverse-free (IF) SBL method for MMV. A relaxed evidence lower bound (ELBO), which is computationally more amiable than the traditional ELBO used by SBL, is obtained by invoking fundamental property for smooth functions. A variational expectation-maximization scheme is then employed to maximize the relaxed ELBO, and a computationally efficient IF-MSBL algorithm is proposed. Numerical results based on simulated and real data show that the proposed method can reconstruct row sparse signal accurately and obtain clear superresolution ISAR images. Moreover, the running time and computational complexity are reduced to a great extent compared with traditional SBL methods.

Exploring the effect of organizational culture on consumer perceptions of agency support for mental health recovery.

Science.gov (United States)

Clossey, Laurene; Rheinheimer, David

2014-05-01

This research explores the impact of mental health agency culture on consumers' perceptions of agency support for their recovery. This study hypothesized that a constructive organizational culture must be present for consumers to perceive agency support for recovery. A sample of 12 mental health agencies in rural Pennsylvania participated in the research. Agency administrators completed an instrument called the recovery oriented service environment, which measured the number of recovery model program components offered by the agency. Consumers completed the recovery oriented services indicators, which taps into their perception of agency support for recovery. Direct service staff completed the organizational social context, which measured their agency's culture. Results showed that in this sample stronger consumer perceptions of agency support for recovery were correlated with higher ratings of agency constructive culture. The results suggest that agency culture is an important variable to target when implementing recovery model programming.

Self-efficacy as a mediator of the relationship between social support and recovery in serious mental illness.

Science.gov (United States)

Thomas, Elizabeth C; Muralidharan, Anjana; Medoff, Deborah; Drapalski, Amy L

2016-12-01

The purposes of this research were to assess relationships between social support and objective and subjective recovery in a sample of adults with serious mental illness and to examine self-efficacy as a potential mediator of these relationships. In this cross-sectional study, a sample of 250 individuals completed measures tapping social support network size, satisfaction with social support, perceived support from the mental health system, self-efficacy, objective recovery (i.e., psychiatric symptoms, social functioning), and subjective recovery. Pearson product-moment correlations and multiple linear regression analyses examined relationships among social support, self-efficacy, and recovery. A bootstrapping procedure was used to estimate the magnitude and significance of indirect effects in mediation analyses. All social support domains (i.e., social support network size, satisfaction with support, perceived support from the mental health system) were significantly related to at least 1 objective recovery outcome and to subjective recovery. Self-efficacy was a mediator of all relationships between social support and objective and subjective recovery. The present study aids in better understanding the relationship between social support and recovery in individuals with serious mental illness and paves the way for future research. Particularly relevant to mental health service providers, it highlights the importance of establishing and maintaining an effective therapeutic relationship as well as assisting consumers with developing supportive relationships with others. (PsycINFO Database Record (c) 2016 APA, all rights reserved).

Structural Sparse Tracking

KAUST Repository

Zhang, Tianzhu

2015-06-01

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

Framing U-Net via Deep Convolutional Framelets: Application to Sparse-View CT.

Science.gov (United States)

Han, Yoseob; Ye, Jong Chul

2018-06-01

X-ray computed tomography (CT) using sparse projection views is a recent approach to reduce the radiation dose. However, due to the insufficient projection views, an analytic reconstruction approach using the filtered back projection (FBP) produces severe streaking artifacts. Recently, deep learning approaches using large receptive field neural networks such as U-Net have demonstrated impressive performance for sparse-view CT reconstruction. However, theoretical justification is still lacking. Inspired by the recent theory of deep convolutional framelets, the main goal of this paper is, therefore, to reveal the limitation of U-Net and propose new multi-resolution deep learning schemes. In particular, we show that the alternative U-Net variants such as dual frame and tight frame U-Nets satisfy the so-called frame condition which makes them better for effective recovery of high frequency edges in sparse-view CT. Using extensive experiments with real patient data set, we demonstrate that the new network architectures provide better reconstruction performance.

Development and evaluation of the INSPIRE measure of staff support for personal recovery.

Science.gov (United States)

Williams, Julie; Leamy, Mary; Bird, Victoria; Le Boutillier, Clair; Norton, Sam; Pesola, Francesca; Slade, Mike

2015-05-01

No individualised standardised measure of staff support for mental health recovery exists. To develop and evaluate a measure of staff support for recovery. initial draft of measure based on systematic review of recovery processes; consultation (n = 61); and piloting (n = 20). Psychometric evaluation: three rounds of data collection from mental health service users (n = 92). INSPIRE has two sub-scales. The 20-item Support sub-scale has convergent validity (0.60) and adequate sensitivity to change. Exploratory factor analysis (variance 71.4-85.1 %, Kaiser-Meyer-Olkin 0.65-0.78) and internal consistency (range 0.82-0.85) indicate each recovery domain is adequately assessed. The 7-item Relationship sub-scale has convergent validity 0.69, test-retest reliability 0.75, internal consistency 0.89, a one-factor solution (variance 70.5 %, KMO 0.84) and adequate sensitivity to change. A 5-item Brief INSPIRE was also evaluated. INSPIRE and Brief INSPIRE demonstrate adequate psychometric properties, and can be recommended for research and clinical use.

Sparseness- and continuity-constrained seismic imaging

Science.gov (United States)

Herrmann, Felix J.

2005-04-01

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

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

Directory of Open Access Journals (Sweden)

Ying Chen

2014-05-01

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

Evaluating the INSPIRE measure of staff support for personal recovery in a Swedish psychiatric context.

Science.gov (United States)

Schön, Ulla-Karin; Svedberg, Petra; Rosenberg, David

2015-05-01

Recovery is understood to be an individual process that cannot be controlled, but can be supported and facilitated at the individual, organizational and system levels. Standardized measures of recovery may play a critical role in contributing to the development of a recovery-oriented system. The INSPIRE measure is a 28-item service user-rated measure of recovery support. INSPIRE assesses both the individual preferences of the user in the recovery process and their experience of support from staff. The aim of this study was to evaluate the psychometric properties of the Swedish version of the INSPIRE measure, for potential use in Swedish mental health services and in order to promote recovery in mental illness. The sample consisted of 85 participants from six community mental health services targeting people with a diagnosis of psychosis in a municipality in Sweden. For the test-retest evaluation, 78 participants completed the questionnaire 2 weeks later. The results in the present study indicate that the Swedish version of the INSPIRE measure had good face and content validity, satisfactory internal consistency and some level of instability in test-retest reliability. While further studies that test the instrument in a larger and more diverse clinical context are needed, INSPIRE can be considered a relevant and feasible instrument to utilize in supporting the development of a recovery-oriented system in Sweden.

The Recovery Process When Participating in Cancer Support and Rehabilitation Programs in Sweden

Directory of Open Access Journals (Sweden)

Christina Melin-Johansson

2015-07-01

Full Text Available The aim was to illuminate the meaning of participating in support and rehabilitation programs described by people diagnosed with cancer. Nineteen persons were interviewed in focus groups and face-to-face. Data were analyzed with a qualitative phenomenological hermeneutical method for researching lived experiences. Interpretation proceeded through three phases: naïve reading, structural analysis, and comprehensive understanding. Three themes were disclosed: receiving support for recovery when being most vulnerable, recapturing capabilities through supportive activities, and searching to find stability and well-being in a changed life situation. Participating in the programs was an existential transition from living in an unpredictable situation that was turned into something meaningful. Recovery did not mean the return to a state of normality; rather, it meant a continuing recovery from cancer treatments and symptoms involving recapturing capabilities and searching for a balance in a forever changed life. This study provides new insights about the experiences of participating in cancer support and rehabilitation programs.

Using mobile phone technology to provide recovery support for women offenders.

Science.gov (United States)

Scott, Christy K; Johnson, Kimberly; Dennis, Michael L

2013-10-01

Mobile technology holds promise as a recovery tool for people with substance use disorders. However, some populations who may benefit the most may not have access to or experience with mobile phones. Incarcerated women represent a group at high risk for recidivism and relapse to substance abuse. Cost-effective mechanisms must be in place to support their recovery upon release. This study explores using mobile technology as a recovery management tool for women offenders residing in the community following release from jail. This study surveyed 325 minority women offenders with substance use disorders to determine whether or not they use cell phones, their comfort with texting and search features, and the social networks that they access from mobile phones. We found that 83% of survey subjects had cell phones; 30% of those were smartphones. Seventy-seven percent of the women reported access to supportive friends, and 88% had close family members they contacted regularly using mobile technology. Results indicated that most of the women were comfortable using a mobile phone, although the majority of them had prepaid minutes rather than plans, and most did currently use smartphones or have the capability to download applications or access social networks via their phones. Most women reported that they would be comfortable using a mobile phone to text, e-mail, and answer surveys. The high rate of adoption of mobile technology by women offenders makes them a promising target for recovery support delivered via mobile phone.

A General Sparse Tensor Framework for Electronic Structure Theory.

Science.gov (United States)

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

2017-03-14

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

Sample size reduction in groundwater surveys via sparse data assimilation

KAUST Repository

Hussain, Z.; Muhammad, A.

2013-01-01

In this paper, we focus on sparse signal recovery methods for data assimilation in groundwater models. The objective of this work is to exploit the commonly understood spatial sparsity in hydrodynamic models and thereby reduce the number of measurements to image a dynamic groundwater profile. To achieve this we employ a Bayesian compressive sensing framework that lets us adaptively select the next measurement to reduce the estimation error. An extension to the Bayesian compressive sensing framework is also proposed which incorporates the additional model information to estimate system states from even lesser measurements. Instead of using cumulative imaging-like measurements, such as those used in standard compressive sensing, we use sparse binary matrices. This choice of measurements can be interpreted as randomly sampling only a small subset of dug wells at each time step, instead of sampling the entire grid. Therefore, this framework offers groundwater surveyors a significant reduction in surveying effort without compromising the quality of the survey. © 2013 IEEE.

Sample size reduction in groundwater surveys via sparse data assimilation

KAUST Repository

Hussain, Z.

2013-04-01

In this paper, we focus on sparse signal recovery methods for data assimilation in groundwater models. The objective of this work is to exploit the commonly understood spatial sparsity in hydrodynamic models and thereby reduce the number of measurements to image a dynamic groundwater profile. To achieve this we employ a Bayesian compressive sensing framework that lets us adaptively select the next measurement to reduce the estimation error. An extension to the Bayesian compressive sensing framework is also proposed which incorporates the additional model information to estimate system states from even lesser measurements. Instead of using cumulative imaging-like measurements, such as those used in standard compressive sensing, we use sparse binary matrices. This choice of measurements can be interpreted as randomly sampling only a small subset of dug wells at each time step, instead of sampling the entire grid. Therefore, this framework offers groundwater surveyors a significant reduction in surveying effort without compromising the quality of the survey. © 2013 IEEE.

Selectivity and sparseness in randomly connected balanced networks.

Directory of Open Access Journals (Sweden)

Cengiz Pehlevan

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

Fast Sparse Coding for Range Data Denoising with Sparse Ridges Constraint

Directory of Open Access Journals (Sweden)

Zhi Gao

2018-05-01

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

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

Science.gov (United States)

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

2018-05-06

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

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

KAUST Repository

Wang, Jim Jing-Yan

2017-06-28

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

On-Chip Neural Data Compression Based On Compressed Sensing With Sparse Sensing Matrices.

Science.gov (United States)

Zhao, Wenfeng; Sun, Biao; Wu, Tong; Yang, Zhi

2018-02-01

On-chip neural data compression is an enabling technique for wireless neural interfaces that suffer from insufficient bandwidth and power budgets to transmit the raw data. The data compression algorithm and its implementation should be power and area efficient and functionally reliable over different datasets. Compressed sensing is an emerging technique that has been applied to compress various neurophysiological data. However, the state-of-the-art compressed sensing (CS) encoders leverage random but dense binary measurement matrices, which incur substantial implementation costs on both power and area that could offset the benefits from the reduced wireless data rate. In this paper, we propose two CS encoder designs based on sparse measurement matrices that could lead to efficient hardware implementation. Specifically, two different approaches for the construction of sparse measurement matrices, i.e., the deterministic quasi-cyclic array code (QCAC) matrix and -sparse random binary matrix [-SRBM] are exploited. We demonstrate that the proposed CS encoders lead to comparable recovery performance. And efficient VLSI architecture designs are proposed for QCAC-CS and -SRBM encoders with reduced area and total power consumption.

Music-supported therapy for stroke motor recovery: theoretical and practical considerations.

Science.gov (United States)

Chen, Joyce L

2018-05-08

Music may confer benefits for well-being and health. What is the state of knowledge and evidence for a role of music in supporting the rehabilitation of movements after stroke? In this brief perspective, I provide background context and information about stroke recovery in general, in order to spark reflection and discussion for how we think music may impact motor recovery, given the current clinical milieu. © 2018 New York Academy of Sciences.

Uniform Recovery Bounds for Structured Random Matrices in Corrupted Compressed Sensing

Science.gov (United States)

Zhang, Peng; Gan, Lu; Ling, Cong; Sun, Sumei

2018-04-01

We study the problem of recovering an $s$-sparse signal $\\mathbf{x}^{\\star}\\in\\mathbb{C}^n$ from corrupted measurements $\\mathbf{y} = \\mathbf{A}\\mathbf{x}^{\\star}+\\mathbf{z}^{\\star}+\\mathbf{w}$, where $\\mathbf{z}^{\\star}\\in\\mathbb{C}^m$ is a $k$-sparse corruption vector whose nonzero entries may be arbitrarily large and $\\mathbf{w}\\in\\mathbb{C}^m$ is a dense noise with bounded energy. The aim is to exactly and stably recover the sparse signal with tractable optimization programs. In this paper, we prove the uniform recovery guarantee of this problem for two classes of structured sensing matrices. The first class can be expressed as the product of a unit-norm tight frame (UTF), a random diagonal matrix and a bounded columnwise orthonormal matrix (e.g., partial random circulant matrix). When the UTF is bounded (i.e. $\\mu(\\mathbf{U})\\sim1/\\sqrt{m}$), we prove that with high probability, one can recover an $s$-sparse signal exactly and stably by $l_1$ minimization programs even if the measurements are corrupted by a sparse vector, provided $m = \\mathcal{O}(s \\log^2 s \\log^2 n)$ and the sparsity level $k$ of the corruption is a constant fraction of the total number of measurements. The second class considers randomly sub-sampled orthogonal matrix (e.g., random Fourier matrix). We prove the uniform recovery guarantee provided that the corruption is sparse on certain sparsifying domain. Numerous simulation results are also presented to verify and complement the theoretical results.

On Sparse Multi-Task Gaussian Process Priors for Music Preference Learning

DEFF Research Database (Denmark)

Nielsen, Jens Brehm; Jensen, Bjørn Sand; Larsen, Jan

In this paper we study pairwise preference learning in a music setting with multitask Gaussian processes and examine the effect of sparsity in the input space as well as in the actual judgments. To introduce sparsity in the inputs, we extend a classic pairwise likelihood model to support sparse...... simulation shows the performance on a real-world music preference dataset which motivates and demonstrates the potential of the sparse Gaussian process formulation for pairwise likelihoods....

Sparse structure regularized ranking

KAUST Repository

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

2014-01-01

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

Sparse structure regularized ranking

KAUST Repository

Wang, Jim Jing-Yan

2014-04-17

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

Removing flicker based on sparse color correspondences in old film restoration

Science.gov (United States)

Huang, Xi; Ding, Youdong; Yu, Bing; Xia, Tianran

2018-04-01

In the long history of human civilization, archived film is an indispensable part of it, and using digital method to repair damaged film is also a mainstream trend nowadays. In this paper, we propose a sparse color correspondences based technique to remove fading flicker for old films. Our model, combined with multi frame images to establish a simple correction model, includes three key steps. Firstly, we recover sparse color correspondences in the input frames to build a matrix with many missing entries. Secondly, we present a low-rank matrix factorization approach to estimate the unknown parameters of this model. Finally, we adopt a two-step strategy that divide the estimated parameters into reference frame parameters for color recovery correction and other frame parameters for color consistency correction to remove flicker. Our method combined multi-frames takes continuity of the input sequence into account, and the experimental results show the method can remove fading flicker efficiently.

The Setting is the Service: How the Architecture of Sober Living Residences Supports Community Based Recovery.

Science.gov (United States)

Wittman, Fried; Jee, Babette; Polcin, Douglas L; Henderson, Diane

2014-07-01

The architecture of residential recovery settings is an important silent partner in the alcohol/drug recovery field. The settings significantly support or hinder recovery experiences of residents, and shape community reactions to the presence of sober living houses (SLH) in ordinary neighborhoods. Grounded in the principles of Alcoholics Anonymous, the SLH provides residents with settings designed to support peer based recovery; further, these settings operate in a community context that insists on sobriety and strongly encourages attendance at 12-step meetings. Little formal research has been conducted to show how architectural features of the recovery setting - building appearance, spatial layouts, furnishings and finishes, policies for use of the facilities, physical care and maintenance of the property, neighborhood features, aspects of location in the city - function to promote (or retard) recovery, and to build (or detract from) community support. This paper uses a case-study approach to analyze the architecture of a community-based residential recovery service that has demonstrated successful recovery outcomes for its residents, is popular in its community, and has achieved state-wide recognition. The Environmental Pattern Language (Alexander, Ishikawa, & Silverstein, 1977) is used to analyze its architecture in a format that can be tested, critiqued, and adapted for use by similar programs in many communities, providing a model for replication and further research.

Turbulent flows over sparse canopies

Science.gov (United States)

Sharma, Akshath; García-Mayoral, Ricardo

2018-04-01

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

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

KAUST Repository

Nobile, Fabio

2016-03-18

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

Image fusion via nonlocal sparse K-SVD dictionary learning.

Science.gov (United States)

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

2016-03-01

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

Discriminative sparse coding on multi-manifolds

KAUST Repository

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

2013-01-01

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

Discriminative sparse coding on multi-manifolds

KAUST Repository

Wang, J.J.-Y.

2013-09-26

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

Chemical inhibition of cell recovery after irradiation with sparsely and densely ionizing radiation

Energy Technology Data Exchange (ETDEWEB)

Evastratova, Ekaterina S.; Petin, Vladislav [A. Tsyb Medical Radiological Research Centre-branch of the National Medical Research Radiological Centre of the Ministry of Health of the Russian Federation, Obninsk (Russian Federation); Kim, Jin Hong; Kim, Jin Kyu [Korea Atomic Energy Research Institute, Advanced Radiation Technology Institute (ARTI), Jeongeup (Korea, Republic of); Lim, Youg Khi [Dept. of Radiological Science, Gachon University, Incheon (Korea, Republic of)

2017-02-15

The dependence of cell survival on exposure dose and the duration of the liquid holding recovery (LHR) was obtained for diploid yeast cells irradiated with ionizing radiation of different linear energy transfer (LET) and recovering from radiation damage without and with various concentrations of cisplatin - the most widely used anticancer drug. The ability of yeast cells to recover from radiation damage was less effective after cell exposure to high-LET radiation, when cells were irradiated without drug. The increase in cisplatin concentration resulted in the disappearance of this difference whereas the fraction of irreversible damage was permanently enlarged independently of radiation quality. The probability of cell recovery was shown to be constant for various conditions of irradiation and recovery. A new mechanism of cisplatin action was suggested according with which the inhibition of cell recovery after exposure to ionizing radiations was completely explained by the production of irreversible damage.

Chemical inhibition of cell recovery after irradiation with sparsely and densely ionizing radiation

International Nuclear Information System (INIS)

Evastratova, Ekaterina S.; Petin, Vladislav; Kim, Jin Hong; Kim, Jin Kyu; Lim, Youg Khi

2017-01-01

The dependence of cell survival on exposure dose and the duration of the liquid holding recovery (LHR) was obtained for diploid yeast cells irradiated with ionizing radiation of different linear energy transfer (LET) and recovering from radiation damage without and with various concentrations of cisplatin - the most widely used anticancer drug. The ability of yeast cells to recover from radiation damage was less effective after cell exposure to high-LET radiation, when cells were irradiated without drug. The increase in cisplatin concentration resulted in the disappearance of this difference whereas the fraction of irreversible damage was permanently enlarged independently of radiation quality. The probability of cell recovery was shown to be constant for various conditions of irradiation and recovery. A new mechanism of cisplatin action was suggested according with which the inhibition of cell recovery after exposure to ionizing radiations was completely explained by the production of irreversible damage

Sparse Regression by Projection and Sparse Discriminant Analysis

KAUST Repository

Qi, Xin

2015-04-03

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

Dynamic Representations of Sparse Graphs

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Fagerberg, Rolf

1999-01-01

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

In-place sparse suffix sorting

DEFF Research Database (Denmark)

Prezza, Nicola

2018-01-01

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

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

Science.gov (United States)

Moody, Daniela; Wohlberg, Brendt

2018-01-02

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

"Recovery" in bipolar disorder: how can service users be supported through a self-management intervention? A qualitative focus group study.

Science.gov (United States)

Todd, Nicholas J; Jones, Steven H; Lobban, Fiona A

2012-04-01

Bipolar disorder (BD) is a chronic and recurrent affective disorder. Recovery is defined as the process by which people can live fulfilling lives despite experiencing symptoms. To explore how an opportunistically recruited group of service users with BD experience recovery and self-management to understand more about how a service users' recovery may be supported. Twelve service users with BD took part in a series of focus groups. Service users' responses to questions about their personal experiences of self-management and recovery were analysed. Focus groups were transcribed verbatim and thematic analysis ([ Braun, V., & Clarke, V. (2006). Using thematic analysis in psychology. Qualitative Research in Psychology, 3(2), 77-101]) was employed to identify common themes in the data. Four key themes were identified: (1) Recovery is not about being symptom free; (2) Recovery requires taking responsibility for your own wellness; (3) Self-management: building on existing techniques; (4) Overcoming barriers to recovery: negativity, stigma and taboo. Service users with BD have provided further support for the concept of recovery and have suggested a number of ways recovery can be supported. A self-management approach informed by the recovery literature has been proposed as a way to support service users' recovery.

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

Science.gov (United States)

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

2013-01-01

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

Discrete Sparse Coding.

Science.gov (United States)

Exarchakis, Georgios; Lücke, Jörg

2017-11-01

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

Medical Support for Aircraft Disaster Search and Recovery Operations at Sea: the RSN Experience.

Science.gov (United States)

Teo, Kok Ann Colin; Chong, Tse Feng Gabriel; Liow, Min Han Lincoln; Tang, Kong Choong

2016-06-01

The maritime environment presents a unique set of challenges to search and recovery (SAR) operations. There is a paucity of information available to guide provision of medical support for SAR operations for aircraft disasters at sea. The Republic of Singapore Navy (RSN) took part in two such SAR operations in 2014 which showcased the value of a military organization in these operations. Key considerations in medical support for similar operations include the resultant casualty profile and challenges specific to the maritime environment, such as large distances of area of operations from land, variable sea states, and space limitations. Medical support planning can be approached using well-established disaster management life cycle phases of preparedness, mitigation, response, and recovery, which all are described in detail. This includes key areas of dedicated training and exercises, force protection, availability of air assets and chamber support, psychological care, and the forensic handling of human remains. Relevant lessons learned by RSN from the Air Asia QZ8501 search operation are also included in the description of these key areas. Teo KAC , Chong TFG , Liow MHL , Tang KC . Medical support for aircraft disaster search and recovery operations at sea: the RSN experience. Prehosp Disaster Med. 2016; 31(3):294-299.

Supporting Stroke Motor Recovery Through a Mobile Application: A Pilot Study.

Science.gov (United States)

Lawson, Sonia; Tang, Ziying; Feng, Jinjuan

Neuroplasticity and motor learning are promoted with repetitive movement, appropriate challenge, and performance feedback. ARMStrokes, a smartphone application, incorporates these qualities to support motor recovery. Engaging exercises are easily accessible for improved compliance. In a multiple-case, mixed-methods pilot study, the potential of this technology for stroke motor recovery was examined. Exercises calibrated to the participant's skill level targeted forearm, elbow, and shoulder motions for a 6-wk protocol. Visual, auditory, and vibration feedback promoted self-assessment. Pre- and posttest data from 6 chronic stroke survivors who used the app in different ways (i.e., to measure active or passive motion, to track endurance) demonstrated improvements in accuracy of movements, fatigue, range of motion, and performance of daily activities. Statistically significant changes were not obtained with this pilot study. Further study on the efficacy of this technology is supported. Copyright © 2017 by the American Occupational Therapy Association, Inc.

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

NARCIS (Netherlands)

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

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

The role of extracorporeal life support in acute myocarditis: a bridge to recovery?

Science.gov (United States)

Sanders, D Bradford; Sowell, Steven R; Willis, Brigham; Lane, John; Pierce, Christopher; Pophal, Stephen; Arabia, Francisco A; Nigro, John J

2012-12-01

Acute myocardial failure associated with myocarditis is highly lethal. Left ventricular assist device support for these patients has been advocated to decompress the left ventricle and facilitate myocardial remodeling and recovery. Concerns exist regarding the ability of venoarterial (VA) extracorporeal life support (ECLS) to decompress the left ventricle and allow effective myocardial recovery. ECLS has several advantages, including availability, rapid deployment, and flexibility, as compared with contemporary ventricular assist devices. The objective of this study was to provide a brief review of acute myocarditis and present our series of patients. After Institutional Review Board approval, we conducted a retrospective data analysis of patients on ECLS experiencing rapidly progressive myocardial failure from a normal baseline. Patients with a history of intrinsic heart disease were excluded. All patients were thought to have myocarditis and had failed medical therapy requiring emergent ECLS support. Five patients demographics are detailed in Table 1. Patients experienced life-threatening intractable dysrhythmias or cardiac arrest and were refractory to medical therapy with severe acidosis and impending multisystem organ failure. All patients were stabilized with VA ECLS, and the left ventricle and atrium were decompressed in four of five patients. A left atrial vent was placed in one patient. Myocardial recovery with successful weaning from ECLS was obtained in four of five patients and to a normal ejection fraction in three of the five. One patient failed ECLS weaning and required biventricular VAD support secondary to severe myocardial necrosis from giant cell myocarditis and was transplanted, one died, all others are alive at follow-up. ECLS is safe and effective to treat acute myocardial failure and may be used to obtain myocardial recovery in certain subsets. We devised a decision algorithm for ECLS deployment in this patient cohort and routinely use ECLS.

Bayesian Inference Methods for Sparse Channel Estimation

DEFF Research Database (Denmark)

Pedersen, Niels Lovmand

2013-01-01

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

Sparsity- and continuity-promoting seismic image recovery with curvelet frames

NARCIS (Netherlands)

Herrmann, Felix J.; Moghaddam, Peyman; Stolk, C.C.

2008-01-01

A nonlinear singularity-preserving solution to seismic image recovery with sparseness and continuity constraints is proposed. We observe that curvelets, as a directional frame expansion, lead to sparsity of seismic images and exhibit invariance under the normal operator of the linearized imaging

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

KAUST Repository

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

2017-01-01

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

Improved Sparse Channel Estimation for Cooperative Communication Systems

Directory of Open Access Journals (Sweden)

Guan Gui

2012-01-01

Full Text Available Accurate channel state information (CSI is necessary at receiver for coherent detection in amplify-and-forward (AF cooperative communication systems. To estimate the channel, traditional methods, that is, least squares (LS and least absolute shrinkage and selection operator (LASSO, are based on assumptions of either dense channel or global sparse channel. However, LS-based linear method neglects the inherent sparse structure information while LASSO-based sparse channel method cannot take full advantage of the prior information. Based on the partial sparse assumption of the cooperative channel model, we propose an improved channel estimation method with partial sparse constraint. At first, by using sparse decomposition theory, channel estimation is formulated as a compressive sensing problem. Secondly, the cooperative channel is reconstructed by LASSO with partial sparse constraint. Finally, numerical simulations are carried out to confirm the superiority of proposed methods over global sparse channel estimation methods.

Sparse direct solver for large finite element problems based on the minimum degree algorithm

Czech Academy of Sciences Publication Activity Database

Pařík, Petr; Plešek, Jiří

2017-01-01

Roč. 113, November (2017), s. 2-6 ISSN 0965-9978 R&D Projects: GA ČR(CZ) GA15-20666S; GA MŠk(CZ) EF15_003/0000493 Institutional support: RVO:61388998 Keywords : sparse direct solution * finite element method * large sparse Linear systems Subject RIV: JR - Other Machinery OBOR OECD: Mechanical engineering Impact factor: 3.000, year: 2016 https://www.sciencedirect.com/science/article/pii/S0965997817302582

Virtual Reality Cue Refusal Video Game for Alcohol and Cigarette Recovery Support: Summative Study.

Science.gov (United States)

Metcalf, Mary; Rossie, Karen; Stokes, Katie; Tallman, Christina; Tanner, Bradley

2018-04-16

New technologies such as virtual reality, augmented reality, and video games hold promise to support and enhance individuals in addiction treatment and recovery. Quitting or decreasing cigarette or alcohol use can lead to significant health improvements for individuals, decreasing heart disease risk and cancer risks (for both nicotine and alcohol use), among others. However, remaining in recovery from use is a significant challenge for most individuals. We developed and assessed the Take Control game, a partially immersive Kinect for Windows platform game that allows users to counter substance cues through active movements (hitting, kicking, etc). Formative analysis during phase I and phase II guided development. We conducted a small wait-list control trial using a quasi-random sampling technique (systematic) with 61 participants in recovery from addiction to alcohol or tobacco. Participants used the game 3 times and reported on substance use, cravings, satisfaction with the game experience, self-efficacy related to recovery, and side effects from exposure to a virtual reality intervention and substance cues. Participants found the game engaging and fun and felt playing the game would support recovery efforts. On average, reported substance use decreased for participants during the intervention period. Participants in recovery for alcohol use saw more benefit than those in recovery for tobacco use, with a statistically significant increase in self-efficacy, attitude, and behavior during the intervention. Side effects from the use of a virtual reality intervention were minor and decreased over time; cravings and side effects also decreased during the study. The preliminary results suggest the intervention holds promise as an adjunct to standard treatment for those in recovery, particularly from alcohol use. ©Mary Metcalf, Karen Rossie, Katie Stokes, Christina Tallman, Bradley Tanner. Originally published in JMIR Serious Games (http://games.jmir.org), 16.04.2018.

Sparse Image Reconstruction in Computed Tomography

DEFF Research Database (Denmark)

Jørgensen, Jakob Sauer

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

Sparse Regression by Projection and Sparse Discriminant Analysis

KAUST Repository

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

2015-01-01

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

Speckle suppression via sparse representation for wide-field imaging through turbid media.

Science.gov (United States)

Jang, Hwanchol; Yoon, Changhyeong; Chung, Euiheon; Choi, Wonshik; Lee, Heung-No

2014-06-30

Speckle suppression is one of the most important tasks in the image transmission through turbid media. Insufficient speckle suppression requires an additional procedure such as temporal ensemble averaging over multiple exposures. In this paper, we consider the image recovery process based on the so-called transmission matrix (TM) of turbid media for the image transmission through the media. We show that the speckle left unremoved in the TM-based image recovery can be suppressed effectively via sparse representation (SR). SR is a relatively new signal reconstruction framework which works well even for ill-conditioned problems. This is the first study to show the benefit of using the SR as compared to the phase conjugation (PC) a de facto standard method to date for TM-based imaging through turbid media including a live cell through tissue slice.

Sparse decompositions in 'incoherent' dictionaries

DEFF Research Database (Denmark)

Gribonval, R.; Nielsen, Morten

2003-01-01

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

Positive Peer Support or Negative Peer Influence? the Role of Peers among Adolescents in Recovery High Schools

Science.gov (United States)

Karakos, Holly L.

2014-01-01

Evidence from previous research suggests that peers at times exert negative influence and at other times exert positive influence on drug and alcohol use among adolescents in recovery. This study explores recovery high school staff members' perceptions of peer support among students in recovery high schools using qualitative interview data. Themes…

On Theorem 10 in "On Polar Polytopes and the Recovery of Sparse Representations"

DEFF Research Database (Denmark)

Sturm, Bob L.; Mailhé, Boris; Plumbley, Mark

2013-01-01

It is shown that Theorem 10 (Non-Nestedness of ERC) in [Plumbley, IEEE Trans. Info. Theory, vol. 53, pp. 3188, Sep. 2007] neglects the derivations of the exact recovery conditions (ERCs) of constrained \\(\\ell_1\\)-minimization (BP) and orthogonal matching pursuit (OMP), and thus does not reflect...... the recovery properties of these algorithms. Furthermore, an ERC of BP more general than that in [Tropp, IEEE Trans. Info. Theory, vol. 50, pp. 2231, Oct. 2004] is shown....

Sparse optimization for inverse problems in atmospheric modelling

Czech Academy of Sciences Publication Activity Database

Adam, Lukáš; Branda, Martin

2016-01-01

Roč. 79, č. 3 (2016), s. 256-266 ISSN 1364-8152 R&D Projects: GA MŠk(CZ) 7F14287 Institutional support: RVO:67985556 Keywords : Inverse modelling * Sparse optimization * Integer optimization * Least squares * European tracer experiment * Free Matlab codes Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 4.404, year: 2016 http://library.utia.cas.cz/separaty/2016/MTR/adam-0457037.pdf

A sparse-grid isogeometric solver

KAUST Repository

Beck, Joakim; Sangalli, Giancarlo; Tamellini, Lorenzo

2018-01-01

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

A sparse-grid isogeometric solver

KAUST Repository

Beck, Joakim

2018-02-28

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

Moms Supporting Moms: Digital Storytelling With Peer Mentors in Recovery From Substance Use.

Science.gov (United States)

Paterno, Mary T; Fiddian-Green, Alice; Gubrium, Aline

2018-01-01

Substance use disorder (SUD) is a growing issue nationally, and SUD in pregnancy has significant consequences for mothers and their children. This article describes findings from a pilot project that used digital storytelling as a mechanism for understanding substance use and recovery from the perspective of women in recovery from SUD in pregnancy who worked as peer mentors with pregnant women currently experiencing SUD. Research on peer mentorship has primarily focused on outcomes for mentees but not the experience of the peer mentors themselves. In this qualitative study, a 3-day digital storytelling workshop was conducted with five women in recovery serving as peer mentors in their community. Each mentor also participated in an individual, in-depth interview. The digital storytelling workshop process helped peer mentors make linkages between their past substance use experiences to their present work of recovery, and fostered deep social connections between mentors through the shared experience. The workshop process also elicited a sense of hope among participants, which served as groundwork for developing advocacy-based efforts. Digital storytelling may be therapeutic for women in recovery and has the potential to be integrated into recovery programs to bolster hope and social support among participants.

An integrated decision support system for wastewater nutrient recovery and recycling to agriculture

Science.gov (United States)

Roy, E. D.; Bomeisl, L.; Cornbrooks, P.; Mo, W.

2017-12-01

Nutrient recovery and recycling has become a key research topic within the wastewater engineering and nutrient management communities. Several technologies now exist that can effectively capture nutrients from wastewater, and innovation in this area continues to be an important research pursuit. However, practical nutrient recycling solutions require more than capable nutrient capture technologies. We also need to understand the role that wastewater nutrient recovery and recycling can play within broader nutrient management schemes at the landscape level, including important interactions at the nexus of food, energy, and water. We are developing an integrated decision support system that combines wastewater treatment data, agricultural data, spatial nutrient balance modeling, life cycle assessment, stakeholder knowledge, and multi-criteria decision making. Our goals are to: (1) help guide design decisions related to the implementation of sustainable nutrient recovery technology, (2) support innovations in watershed nutrient management that operate at the interface of the built environment and agriculture, and (3) aid efforts to protect aquatic ecosystems while supporting human welfare in a circular nutrient economy. These goals will be realized partly through the assessment of plausible alternative scenarios for the future. In this presentation, we will describe the tool and focus on nutrient balance results for the New England region. These results illustrate that both centralized and decentralized wastewater nutrient recovery schemes have potential to transform nutrient flows in many New England watersheds, diverting wastewater N and P away from aquatic ecosystems and toward local or regional agricultural soils where they can offset a substantial percentage of imported fertilizer. We will also highlight feasibility criteria and next steps to integrate stakeholder knowledge, economics, and life cycle assessment into the tool.

Space Technology Game Changing Development- Next Generation Life Support: Spacecraft Oxygen Recovery (SCOR)

Science.gov (United States)

Abney, Morgan; Barta, Daniel

2015-01-01

The Next Generation Life Support Spacecraft Oxygen Recovery (SCOR) project element is dedicated to developing technology that enables oxygen recovery from metabolically produced carbon dioxide in space habitats. The state-of-the-art system on the International Space Station uses Sabatier technology to recover (is) approximately 50% oxygen from carbon dioxide. The remaining oxygen required for crew respiration is supplied from Earth. For long duration manned missions beyond low-Earth orbit, resupply of oxygen becomes economically and logistically prohibitive. To mitigate these challenges, the SCOR project element is targeting development of technology to increase the recovery of oxygen to 75% or more, thereby reducing the total oxygen resupply required for future missions.

Supervised Transfer Sparse Coding

KAUST Repository

Al-Shedivat, Maruan

2014-07-27

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

Joint Group Sparse PCA for Compressed Hyperspectral Imaging.

Science.gov (United States)

Khan, Zohaib; Shafait, Faisal; Mian, Ajmal

2015-12-01

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

On A Nonlinear Generalization of Sparse Coding and Dictionary Learning.

Science.gov (United States)

Xie, Yuchen; Ho, Jeffrey; Vemuri, Baba

2013-01-01

Existing dictionary learning algorithms are based on the assumption that the data are vectors in an Euclidean vector space ℝ d , and the dictionary is learned from the training data using the vector space structure of ℝ d and its Euclidean L 2 -metric. However, in many applications, features and data often originated from a Riemannian manifold that does not support a global linear (vector space) structure. Furthermore, the extrinsic viewpoint of existing dictionary learning algorithms becomes inappropriate for modeling and incorporating the intrinsic geometry of the manifold that is potentially important and critical to the application. This paper proposes a novel framework for sparse coding and dictionary learning for data on a Riemannian manifold, and it shows that the existing sparse coding and dictionary learning methods can be considered as special (Euclidean) cases of the more general framework proposed here. We show that both the dictionary and sparse coding can be effectively computed for several important classes of Riemannian manifolds, and we validate the proposed method using two well-known classification problems in computer vision and medical imaging analysis.

Citizen Support for Northern Ohio Community College Funding Initiatives during an Economic Recession Recovery

Science.gov (United States)

Flores, Patricia

2013-01-01

The current research, "Citizen Support for Northern Ohio Community College Funding Initiatives during an Economic Recession Recovery", asks the question: Do the citizens of Northern Ohio support community college funding during difficult economic times? Based on the theory of Stakeholder Analysis, the purpose of this concurrent,…

Parallel Sparse Matrix - Vector Product

DEFF Research Database (Denmark)

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

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

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

KAUST Repository

Nobile, Fabio; Tamellini, Lorenzo; Tesei, Francesco; Tempone, Raul

2016-01-01

In this work we build on the classical adaptive sparse grid algorithm (T. Gerstner and M. Griebel, Dimension-adaptive tensor-product quadrature), obtaining an enhanced version capable of using non-nested collocation points, and supporting quadrature

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

Energy Technology Data Exchange (ETDEWEB)

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

2018-01-01

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

Recovery from schizophrenia and the recovery model.

Science.gov (United States)

Warner, Richard

2009-07-01

The recovery model refers to subjective experiences of optimism, empowerment and interpersonal support, and to a focus on collaborative treatment approaches, finding productive roles for user/consumers, peer support and reducing stigma. The model is influencing service development around the world. This review will assess whether optimism about outcome from serious mental illness and other tenets of the recovery model are borne out by recent research. Remission of symptoms has been precisely defined, but the definition of 'recovery' is a more diffuse concept that includes such factors as being productive and functioning independently. Recent research and a large, earlier body of data suggest that optimism about outcome from schizophrenia is justified. A substantial proportion of people with the illness will recover completely and many more will regain good social functioning. Outcome is better for people in the developing world. Mortality for people with schizophrenia is increasing but is lower in the developing world. Working appears to help people recover from schizophrenia, and recent advances in vocational rehabilitation have been shown to be effective in countries with differing economies and labor markets. A growing body of research supports the concept that empowerment is an important component of the recovery process. Key tenets of the recovery model - optimism about recovery from schizophrenia, the importance of access to employment and the value of empowerment of user/consumers in the recovery process - are supported by the scientific research. Attempts to reduce the internalized stigma of mental illness should enhance the recovery process.

Sparse approximation with bases

CERN Document Server

2015-01-01

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

Efficient convolutional sparse coding

Science.gov (United States)

Wohlberg, Brendt

2017-06-20

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

Hyperspectral Unmixing with Robust Collaborative Sparse Regression

Directory of Open Access Journals (Sweden)

Chang Li

2016-07-01

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

Dynamic Stochastic Superresolution of sparsely observed turbulent systems

International Nuclear Information System (INIS)

Branicki, M.; Majda, A.J.

2013-01-01

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

Uses and abuses of recovery: implementing recovery-oriented practices in mental health systems

Science.gov (United States)

Slade, Mike; Amering, Michaela; Farkas, Marianne; Hamilton, Bridget; O'Hagan, Mary; Panther, Graham; Perkins, Rachel; Shepherd, Geoff; Tse, Samson; Whitley, Rob

2014-01-01

An understanding of recovery as a personal and subjective experience has emerged within mental health systems. This meaning of recovery now underpins mental health policy in many countries. Developing a focus on this type of recovery will involve transformation within mental health systems. Human systems do not easily transform. In this paper, we identify seven mis-uses (“abuses”) of the concept of recovery: recovery is the latest model; recovery does not apply to “my” patients; services can make people recover through effective treatment; compulsory detention and treatment aid recovery; a recovery orientation means closing services; recovery is about making people independent and normal; and contributing to society happens only after the person is recovered. We then identify ten empirically-validated interventions which support recovery, by targeting key recovery processes of connectedness, hope, identity, meaning and empowerment (the CHIME framework). The ten interventions are peer support workers, advance directives, wellness recovery action planning, illness management and recovery, REFOCUS, strengths model, recovery colleges or recovery education programs, individual placement and support, supported housing, and mental health trialogues. Finally, three scientific challenges are identified: broadening cultural understandings of recovery, implementing organizational transformation, and promoting citizenship. PMID:24497237

Sparse signals recovered by non-convex penalty in quasi-linear systems.

Science.gov (United States)

Cui, Angang; Li, Haiyang; Wen, Meng; Peng, Jigen

2018-01-01

The goal of compressed sensing is to reconstruct a sparse signal under a few linear measurements far less than the dimension of the ambient space of the signal. However, many real-life applications in physics and biomedical sciences carry some strongly nonlinear structures, and the linear model is no longer suitable. Compared with the compressed sensing under the linear circumstance, this nonlinear compressed sensing is much more difficult, in fact also NP-hard, combinatorial problem, because of the discrete and discontinuous nature of the [Formula: see text]-norm and the nonlinearity. In order to get a convenience for sparse signal recovery, we set the nonlinear models have a smooth quasi-linear nature in this paper, and study a non-convex fraction function [Formula: see text] in this quasi-linear compressed sensing. We propose an iterative fraction thresholding algorithm to solve the regularization problem [Formula: see text] for all [Formula: see text]. With the change of parameter [Formula: see text], our algorithm could get a promising result, which is one of the advantages for our algorithm compared with some state-of-art algorithms. Numerical experiments show that our method performs much better than some state-of-the-art methods.

Image fusion using sparse overcomplete feature dictionaries

Science.gov (United States)

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

2015-10-06

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

Learning Low-Rank Class-Specific Dictionary and Sparse Intra-Class Variant Dictionary for Face Recognition

Science.gov (United States)

Tang, Xin; Feng, Guo-can; Li, Xiao-xin; Cai, Jia-xin

2015-01-01

Face recognition is challenging especially when the images from different persons are similar to each other due to variations in illumination, expression, and occlusion. If we have sufficient training images of each person which can span the facial variations of that person under testing conditions, sparse representation based classification (SRC) achieves very promising results. However, in many applications, face recognition often encounters the small sample size problem arising from the small number of available training images for each person. In this paper, we present a novel face recognition framework by utilizing low-rank and sparse error matrix decomposition, and sparse coding techniques (LRSE+SC). Firstly, the low-rank matrix recovery technique is applied to decompose the face images per class into a low-rank matrix and a sparse error matrix. The low-rank matrix of each individual is a class-specific dictionary and it captures the discriminative feature of this individual. The sparse error matrix represents the intra-class variations, such as illumination, expression changes. Secondly, we combine the low-rank part (representative basis) of each person into a supervised dictionary and integrate all the sparse error matrix of each individual into a within-individual variant dictionary which can be applied to represent the possible variations between the testing and training images. Then these two dictionaries are used to code the query image. The within-individual variant dictionary can be shared by all the subjects and only contribute to explain the lighting conditions, expressions, and occlusions of the query image rather than discrimination. At last, a reconstruction-based scheme is adopted for face recognition. Since the within-individual dictionary is introduced, LRSE+SC can handle the problem of the corrupted training data and the situation that not all subjects have enough samples for training. Experimental results show that our method achieves the

Learning Low-Rank Class-Specific Dictionary and Sparse Intra-Class Variant Dictionary for Face Recognition.

Science.gov (United States)

Tang, Xin; Feng, Guo-Can; Li, Xiao-Xin; Cai, Jia-Xin

2015-01-01

Face recognition is challenging especially when the images from different persons are similar to each other due to variations in illumination, expression, and occlusion. If we have sufficient training images of each person which can span the facial variations of that person under testing conditions, sparse representation based classification (SRC) achieves very promising results. However, in many applications, face recognition often encounters the small sample size problem arising from the small number of available training images for each person. In this paper, we present a novel face recognition framework by utilizing low-rank and sparse error matrix decomposition, and sparse coding techniques (LRSE+SC). Firstly, the low-rank matrix recovery technique is applied to decompose the face images per class into a low-rank matrix and a sparse error matrix. The low-rank matrix of each individual is a class-specific dictionary and it captures the discriminative feature of this individual. The sparse error matrix represents the intra-class variations, such as illumination, expression changes. Secondly, we combine the low-rank part (representative basis) of each person into a supervised dictionary and integrate all the sparse error matrix of each individual into a within-individual variant dictionary which can be applied to represent the possible variations between the testing and training images. Then these two dictionaries are used to code the query image. The within-individual variant dictionary can be shared by all the subjects and only contribute to explain the lighting conditions, expressions, and occlusions of the query image rather than discrimination. At last, a reconstruction-based scheme is adopted for face recognition. Since the within-individual dictionary is introduced, LRSE+SC can handle the problem of the corrupted training data and the situation that not all subjects have enough samples for training. Experimental results show that our method achieves the

Learning Low-Rank Class-Specific Dictionary and Sparse Intra-Class Variant Dictionary for Face Recognition.

Directory of Open Access Journals (Sweden)

Xin Tang

Full Text Available Face recognition is challenging especially when the images from different persons are similar to each other due to variations in illumination, expression, and occlusion. If we have sufficient training images of each person which can span the facial variations of that person under testing conditions, sparse representation based classification (SRC achieves very promising results. However, in many applications, face recognition often encounters the small sample size problem arising from the small number of available training images for each person. In this paper, we present a novel face recognition framework by utilizing low-rank and sparse error matrix decomposition, and sparse coding techniques (LRSE+SC. Firstly, the low-rank matrix recovery technique is applied to decompose the face images per class into a low-rank matrix and a sparse error matrix. The low-rank matrix of each individual is a class-specific dictionary and it captures the discriminative feature of this individual. The sparse error matrix represents the intra-class variations, such as illumination, expression changes. Secondly, we combine the low-rank part (representative basis of each person into a supervised dictionary and integrate all the sparse error matrix of each individual into a within-individual variant dictionary which can be applied to represent the possible variations between the testing and training images. Then these two dictionaries are used to code the query image. The within-individual variant dictionary can be shared by all the subjects and only contribute to explain the lighting conditions, expressions, and occlusions of the query image rather than discrimination. At last, a reconstruction-based scheme is adopted for face recognition. Since the within-individual dictionary is introduced, LRSE+SC can handle the problem of the corrupted training data and the situation that not all subjects have enough samples for training. Experimental results show that our

Sparse estimation of model-based diffuse thermal dust emission

Science.gov (United States)

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

2018-03-01

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

Manifold regularization for sparse unmixing of hyperspectral images.

Science.gov (United States)

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

2016-01-01

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

Enhancing Scalability of Sparse Direct Methods

International Nuclear Information System (INIS)

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

2007-01-01

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

Regression with Sparse Approximations of Data

DEFF Research Database (Denmark)

Noorzad, Pardis; Sturm, Bob L.

2012-01-01

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

Sparse adaptive filters for echo cancellation

CERN Document Server

Paleologu, Constantin

2011-01-01

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

Parallel sparse direct solver for integrated circuit simulation

CERN Document Server

Chen, Xiaoming; Yang, Huazhong

2017-01-01

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

Biclustering via Sparse Singular Value Decomposition

KAUST Repository

Lee, Mihee

2010-02-16

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

Direction-of-Arrival Estimation Based on Sparse Recovery with Second-Order Statistics

Directory of Open Access Journals (Sweden)

H. Chen

2015-04-01

Full Text Available Traditional direction-of-arrival (DOA estimation techniques perform Nyquist-rate sampling of the received signals and as a result they require high storage. To reduce sampling ratio, we introduce level-crossing (LC sampling which captures samples whenever the signal crosses predetermined reference levels, and the LC-based analog-to-digital converter (LC ADC has been shown to efficiently sample certain classes of signals. In this paper, we focus on the DOA estimation problem by using second-order statistics based on the LC samplings recording on one sensor, along with the synchronous samplings of the another sensors, a sparse angle space scenario can be found by solving an $ell_1$ minimization problem, giving the number of sources and their DOA's. The experimental results show that our proposed method, when compared with some existing norm-based constrained optimization compressive sensing (CS algorithms, as well as subspace method, improves the DOA estimation performance, while using less samples when compared with Nyquist-rate sampling and reducing sensor activity especially for long time silence signal.

Robust Face Recognition Via Gabor Feature and Sparse Representation

Directory of Open Access Journals (Sweden)

Hao Yu-Juan

2016-01-01

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

Sparse Learning with Stochastic Composite Optimization.

Science.gov (United States)

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

2017-06-01

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

Exploring Self-Care and Preferred Supports for Adult Parents in Recovery from Substance Use Disorders: Qualitative Findings from a Feasibility Study.

Science.gov (United States)

Raynor, Phyllis A; Pope, Charlene; York, Janet; Smith, Gigi; Mueller, Martina

2017-11-01

Very little is known about the self-care behaviors (SCB) that adult parents employ and the preferred supports they utilize to maintain their recovery from substance use disorders (SUD) while also parenting their children. This study used a qualitative descriptive approach to explore perceptions of self-care and parenting to inform future self-care interventions for parents in early recovery. Nineteen mothers and fathers of at least one child between the ages of 6-18 were interviewed by telephone about parental self-care practices while in recovery from SUD, recovery management, and preferred supports in the community. Participants described the experience of parenting as challenging, with variations in the level of support and resources. Self-care included meaningful connection with recovery support and children, taking care of physical health, maintaining spirituality, healthy eating, exercise, journaling, continuing education, staying busy, sponsorship, establishing boundaries, self-monitoring, abstinence, and dealing with destructive emotions. Participants reported SCB as being a critical component of their ongoing recovery and their parenting practices, though differences in SCB by gender and for minorities require further exploration. Parental gains were perceived as benefits of SCB that minimized the negative impact of prior parental drug use on their children.

Multilevel sparse functional principal component analysis.

Science.gov (United States)

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

2014-01-29

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

A sparse version of IGA solvers

KAUST Repository

Beck, Joakim; Sangalli, Giancarlo; Tamellini, Lorenzo

2017-01-01

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

A sparse version of IGA solvers

KAUST Repository

Beck, Joakim

2017-07-30

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

Language Recognition via Sparse Coding

Science.gov (United States)

2016-09-08

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

Hybrid sparse blind deconvolution: an implementation of SOOT algorithm to real data

Science.gov (United States)

Pakmanesh, Parvaneh; Goudarzi, Alireza; Kourki, Meisam

2018-06-01

Getting information of seismic data depends on deconvolution as an important processing step; it provides the reflectivity series by signal compression. This compression can be obtained by removing the wavelet effects on the traces. The recently blind deconvolution has provided reliable performance for sparse signal recovery. In this study, two deconvolution methods have been implemented to the seismic data; the convolution of these methods provides a robust spiking deconvolution approach. This hybrid deconvolution is applied using the sparse deconvolution (MM algorithm) and the Smoothed-One-Over-Two algorithm (SOOT) in a chain. The MM algorithm is based on the minimization of the cost function defined by standards l1 and l2. After applying the two algorithms to the seismic data, the SOOT algorithm provided well-compressed data with a higher resolution than the MM algorithm. The SOOT algorithm requires initial values to be applied for real data, such as the wavelet coefficients and reflectivity series that can be achieved through the MM algorithm. The computational cost of the hybrid method is high, and it is necessary to be implemented on post-stack or pre-stack seismic data of complex structure regions.

Sparse seismic imaging using variable projection

NARCIS (Netherlands)

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

2013-01-01

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

Structural Sparse Tracking

KAUST Repository

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

2015-01-01

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

Technique detection software for Sparse Matrices

Directory of Open Access Journals (Sweden)

KHAN Muhammad Taimoor

2009-12-01

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

Associations between the peer support relationship, service satisfaction and recovery-oriented outcomes: a correlational study.

Science.gov (United States)

Thomas, Elizabeth C; Salzer, Mark S

2017-12-18

The working alliance between non-peer providers and mental health consumers is associated with positive outcomes. It is hypothesized that this factor, in addition to other active support elements, is also positively related to peer support service outcomes. This study evaluates correlates of the peer-to-peer relationship and its unique association with service satisfaction and recovery-oriented outcomes. Participants were 46 adults with serious mental illnesses taking part in a peer-brokered self-directed care intervention. Pearson correlation analyses examined associations among peer relationship factors, services-related variables and recovery-oriented outcomes (i.e. empowerment, recovery and quality of life). Hierarchical multiple regression analyses evaluated associations between relationship factors and outcomes over time, controlling for other possible intervention effects. The peer relationship was not related to number of contacts. There were robust associations between the peer relationship and service satisfaction and some recovery-oriented outcomes at 24-months, but not at 12-months. These associations were not explained by other possible intervention effects. This study contributes to a better understanding of the positive, unique association between the peer-to-peer relationship and outcomes, similar to what is found in non-peer-delivered interventions. Implications for program administrators and policymakers seeking to integrate peer specialists into mental health service systems are discussed.

Sparse Representations of Hyperspectral Images

KAUST Repository

Swanson, Robin J.

2015-11-23

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

Sparse Representations of Hyperspectral Images

KAUST Repository

Swanson, Robin J.

2015-01-01

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

Supervised Convolutional Sparse Coding

KAUST Repository

Affara, Lama Ahmed

2018-04-08

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

Recovery strategies implemented by sport support staff of elite rugby players in South Africa

Directory of Open Access Journals (Sweden)

D.V. Van Wyk

2009-01-01

Full Text Available Objective: The main aim of this study was to determine strategies used toaccelerate recovery of elite rugby players after training and matches, asused by medical support staff of rugby teams in South A frica. A  secondaryaim was to focus on specifics of implementing ice/cold water immersion asrecovery strategy. Design: A  Questionnaire-based cross sectional descriptive survey was used.Setting and Participants: Most (n=58 of the medical support staff ofrugby teams (doctors, physiotherapists, biokineticists and fitness trainerswho attended the inaugural Rugby Medical A ssociation conference linked to the South A frican Sports MedicineA ssociation Conference in Pretoria (14-16th November, 2007 participated in the study. Results: Recovery strategies were utilized mostly after matches. Stretching and ice/cold water immersion were utilized the most (83%. More biokineticists and fitness trainers advocated the usage of stretching than their counter-parts (medical doctors and physiotherapists. Ice/Cold water immersion and A ctive Recovery were the top two ratedstrategies. A  summary of the details around implementation of ice/cold water therapy is shown (mean as utilized bythe subjects: (i The time to immersion after matches was 12±9 min; (ii The total duration of one immersion sessionwas 6±6 min; (iii 3 immersion sessions per average training week was utilized by subjects; (iv The average water temperature was 10±3 ºC.; (v Ice cubes were used most frequently to cool water for immersion sessions, and(vi plastic drums were mostly used as the container for water. Conclusion: In this survey the representative group of support staff provided insight to which strategies are utilizedin South A frican elite rugby teams to accelerate recovery of players after training and/or matches.

Water Recovery Project

Data.gov (United States)

National Aeronautics and Space Administration — The AES Water Recovery Project (WRP) is advancing environmental control and life support systems water recovery technologies to support human exploration beyond low...

Structure-aware Local Sparse Coding for Visual Tracking

KAUST Repository

Qi, Yuankai

2018-01-24

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

Sparse Frequency Waveform Design for Radar-Embedded Communication

Directory of Open Access Journals (Sweden)

Chaoyun Mai

2016-01-01

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

Massive Asynchronous Parallelization of Sparse Matrix Factorizations

Energy Technology Data Exchange (ETDEWEB)

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

2018-01-08

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

Exploring Student Service Members/Veterans Social Support and Campus Climate in the Context of Recovery

Directory of Open Access Journals (Sweden)

Susan M. Love

2015-09-01

Full Text Available Now that the financial needs of post 9/11 student service members/veterans have begun to be addressed, the attention has shifted to disabilities and recovery strategies of student service members/veterans. Therefore, in a cross sectional design, this study electronically surveyed 189 enrolled student service members/veterans attending a large urban state university about their experiences of returning to school. Specifically, this study described the students’ rates of Post-Traumatic Stress Disorder (PTSD and alcohol abuse, perceived stress, adaptive and non-adaptive coping strategies, social support, participation in campus activities, and perceived campus climate. Moreover, correlates of recovery were examined. Although the majority of the returning students were doing well, 36.1% reported a high level of stress, 15.1% reported a high level of anger, 17.3% reported active symptoms of PTSD, and 27.1% screened positive for alcohol problems. Social networks were found to be the most salient factor in recovery. The study’s limitations are discussed and specific support strategies are presented that can be employed by disability services, counseling services and college administrators.

Therapy induces widespread reorganization of motor cortex after complete spinal transection that supports motor recovery.

Science.gov (United States)

Ganzer, Patrick D; Manohar, Anitha; Shumsky, Jed S; Moxon, Karen A

2016-05-01

Reorganization of the somatosensory system and its relationship to functional recovery after spinal cord injury (SCI) has been well studied. However, little is known about the impact of SCI on organization of the motor system. Recent studies suggest that step-training paradigms in combination with spinal stimulation, either electrically or through pharmacology, are more effective than step training alone at inducing recovery and that reorganization of descending corticospinal circuits is necessary. However, simpler, passive exercise combined with pharmacotherapy has also shown functional improvement after SCI and reorganization of, at least, the sensory cortex. In this study we assessed the effect of passive exercise and serotonergic (5-HT) pharmacological therapies on behavioral recovery and organization of the motor cortex. We compared the effects of passive hindlimb bike exercise to bike exercise combined with daily injections of 5-HT agonists in a rat model of complete mid-thoracic transection. 5-HT pharmacotherapy combined with bike exercise allowed the animals to achieve unassisted weight support in the open field. This combination of therapies also produced extensive expansion of the axial trunk motor cortex into the deafferented hindlimb motor cortex and, surprisingly, reorganization within the caudal and even the rostral forelimb motor cortex areas. The extent of the axial trunk expansion was correlated to improvement in behavioral recovery of hindlimbs during open field locomotion, including weight support. From a translational perspective, these data suggest a rationale for developing and optimizing cost-effective, non-invasive, pharmacological and passive exercise regimes to promote plasticity that supports restoration of movement after spinal cord injury. Copyright © 2016. Published by Elsevier Inc.

Solving large-scale sparse eigenvalue problems and linear systems of equations for accelerator modeling

International Nuclear Information System (INIS)

Gene Golub; Kwok Ko

2009-01-01

The solutions of sparse eigenvalue problems and linear systems constitute one of the key computational kernels in the discretization of partial differential equations for the modeling of linear accelerators. The computational challenges faced by existing techniques for solving those sparse eigenvalue problems and linear systems call for continuing research to improve on the algorithms so that ever increasing problem size as required by the physics application can be tackled. Under the support of this award, the filter algorithm for solving large sparse eigenvalue problems was developed at Stanford to address the computational difficulties in the previous methods with the goal to enable accelerator simulations on then the world largest unclassified supercomputer at NERSC for this class of problems. Specifically, a new method, the Hemitian skew-Hemitian splitting method, was proposed and researched as an improved method for solving linear systems with non-Hermitian positive definite and semidefinite matrices.

Storage of sparse files using parallel log-structured file system

Science.gov (United States)

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

2017-11-07

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

Image understanding using sparse representations

CERN Document Server

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

2014-01-01

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

Sparse regularization for force identification using dictionaries

Science.gov (United States)

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

2016-04-01

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

Picturing recovery: a photovoice exploration of recovery dimensions among people with serious mental illness.

Science.gov (United States)

Cabassa, Leopoldo J; Nicasio, Andel; Whitley, Rob

2013-09-01

Recovery from mental disorders encompasses multiple interrelated dimensions. This study used photovoice to explore how individuals with serious mental illness and a history of substance abuse and homelessness envisioned their recovery. A dimensional recovery model was applied to examine how the interrelationships between recovery dimensions supported consumers' recovery journeys. Photovoice is a participatory research method that empowers people by giving them cameras to document their experiences and inform social action. Sixteen consumers recruited from two supported housing agencies participated in six weekly sessions to which they brought photographs that they took of persons and events in their lives that reflected recovery and wellness and discussed the meaning of the photographs in individual interviews and group sessions. The authors used pile-sorting, grounded theory, and a deductive template-analytic technique to analyze narrative and visual data. Spirituality, life achievements, and receiving and providing support were the most salient themes that emerged from the analysis and illustrate beneficial interrelationships between recovery dimensions. Participants discussed how they relied on their spirituality to support their sobriety and cope with addictions-aspects of clinical recovery. Educational and vocational achievements represented gains in functioning that contributed to increasing self-esteem and self-agency and reducing self-stigma. Social dimensions of recovery, such as receiving and giving support to loved ones, rippled through consumers' lives reducing isolation and enhancing their self-worth. The findings illustrate the value of participatory methods to understand what recovery signified to people with serious mental illness and how understanding the interrelationships between recovery dimensions can inform recovery-oriented services.

Sparse inpainting and isotropy

Energy Technology Data Exchange (ETDEWEB)

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

2014-01-01

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

Progressive recovery of osseoperception as a function of the combination of implant-supported prostheses.

Science.gov (United States)

Batista, Mauro; Bonachela, Wellington; Soares, Janir

2008-06-01

The extraction of teeth involves the elimination of extremely sensitive periodontal mechanoreceptors, which play an important role in oral sensory perception. The aim of this study was to evaluate the recovery of interocclusal sensory perception for micro-thickness in individuals with different types of implant-supported prostheses. Wearers of complete dentures (CDs) comprised the negative control group (group A, n=17). The experimental group consisted of wearers of prostheses supported by osseointegrated implants (Group B, n=29), which was subsequently divided into 4 subgroups: B(1) (n=5)--implant supported overdentures (ISO) occluding with CD; B(2) (n=6)--implant-supported fixed prostheses (ISFP) occluding with CD; B(3) (n=8)--wearers of maxillary and mandibular ISFP, and B(4) (n=10)--ISFP occluding with natural dentition (ND). Individuals with ND represented the positive control group (Group C, n=24). Aluminum foils measuring 10 microm, 24 microm, 30 microm, 50 microm, 80 microm, and 104 microm thickness were placed within the premolar area, adding up to 120 tests for each individual. The mean tactile thresholds of groups A, B1, B2, B3, B4, and C were 92 microm, 27 microm, 27 microm, 14 microm, 10 microm, and 10 microm, respectively. [Correction added after publication online 18 April 2008: in the preceding sentence 92 microm, 27 microm, 14 microm, 10 microm and 10 microm, was corrected to 92 microm, 27 microm, 27 microm, 14 microm, 10 microm and 10 microm]. The Kruskal-Wallis test revealed significant difference among groups (P<0.05). The Dunn test revealed that group A was statistically different from groups C, B(3), and B(4), and that B(1) and B(2) were statistically different from group C. Progressive recovery of osseoperception as a function of the combination of implant-supported prostheses could be observed. Moreover, ISO and/or ISFP combinations may similarly maximize the recovery of osseoperception.

Progressing recovery-oriented care in psychiatric inpatient units: Occupational therapy’s role in supporting a stronger peer workforce

Directory of Open Access Journals (Sweden)

Chris Lloyd

2017-10-01

Full Text Available Purpose - Initiated by the service user movement, recovery-oriented practices are one of the keystones of modern mental health care. Over the past two decades, substantial gains have been made with introducing recovery-oriented practice in many areas of mental health practice, but there remain areas where progress is delayed, notably, the psychiatric inpatient environment. The peer support workforce can play a pivotal role in progressing recovery-oriented practices. The purpose of this paper is to provide a pragmatic consideration of how occupational therapists can influence mental health systems to work proactively with a peer workforce. Design/methodology/approach - The authors reviewed current literature and considered practical approaches to building a peer workforce in collaboration with occupational therapists. Findings - It is suggested that the peer support workforce should be consciously enhanced in the inpatient setting to support culture change as a matter of priority. Occupational therapists working on inpatient units should play a key role in promoting and supporting the growth in the peer support workforce. Doing so will enrich the Occupational Therapy profession as well as improving service user outcomes. Originality/value - This paper seeks to provide a pragmatic consideration of how occupational therapists can influence mental health systems to work proactively with a peer workforce.

Object tracking by occlusion detection via structured sparse learning

KAUST Repository

Zhang, Tianzhu

2013-06-01

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

Enhanced recovery of subsurface geological structures using compressed sensing and the Ensemble Kalman filter

KAUST Repository

Sana, Furrukh

2015-07-26

Recovering information on subsurface geological features, such as flow channels, holds significant importance for optimizing the productivity of oil reservoirs. The flow channels exhibit high permeability in contrast to low permeability rock formations in their surroundings, enabling formulation of a sparse field recovery problem. The Ensemble Kalman filter (EnKF) is a widely used technique for the estimation of subsurface parameters, such as permeability. However, the EnKF often fails to recover and preserve the channel structures during the estimation process. Compressed Sensing (CS) has shown to significantly improve the reconstruction quality when dealing with such problems. We propose a new scheme based on CS principles to enhance the reconstruction of subsurface geological features by transforming the EnKF estimation process to a sparse domain representing diverse geological structures. Numerical experiments suggest that the proposed scheme provides an efficient mechanism to incorporate and preserve structural information in the estimation process and results in significant enhancement in the recovery of flow channel structures.

Enhanced recovery of subsurface geological structures using compressed sensing and the Ensemble Kalman filter

KAUST Repository

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

2015-01-01

Recovering information on subsurface geological features, such as flow channels, holds significant importance for optimizing the productivity of oil reservoirs. The flow channels exhibit high permeability in contrast to low permeability rock formations in their surroundings, enabling formulation of a sparse field recovery problem. The Ensemble Kalman filter (EnKF) is a widely used technique for the estimation of subsurface parameters, such as permeability. However, the EnKF often fails to recover and preserve the channel structures during the estimation process. Compressed Sensing (CS) has shown to significantly improve the reconstruction quality when dealing with such problems. We propose a new scheme based on CS principles to enhance the reconstruction of subsurface geological features by transforming the EnKF estimation process to a sparse domain representing diverse geological structures. Numerical experiments suggest that the proposed scheme provides an efficient mechanism to incorporate and preserve structural information in the estimation process and results in significant enhancement in the recovery of flow channel structures.

Exhaustive Search for Sparse Variable Selection in Linear Regression

Science.gov (United States)

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

2018-04-01

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

Recovery of Terephthalic Acid by employing magnetic nanoparticles as a solid support

Directory of Open Access Journals (Sweden)

Elmira Ghamary

2018-03-01

Full Text Available Abstract The aim of this research work is focused on the improvement of Terephthalic acid recovery from PET wastes by using organically modified nano-Fe3O4@Cyanuric Chloride as the solid support. The performance of organically modified nano magnetic was examined in detail and the obtained results were compared with the unsupported reaction data. Required reaction time for complete glycolysis of the wastes, consumption of the solvent as well as catalyst decreases up 99%, 37.5% and 40% respectively. Result showed that nano-Fe 3O4@Cyanuric Chloride delivered good performance as solid support in depolymerizing of PET to the terephthalic acid.

Fault Diagnosis of Complex Industrial Process Using KICA and Sparse SVM

Directory of Open Access Journals (Sweden)

Jie Xu

2013-01-01

Full Text Available New approaches are proposed for complex industrial process monitoring and fault diagnosis based on kernel independent component analysis (KICA and sparse support vector machine (SVM. The KICA method is a two-phase algorithm: whitened kernel principal component analysis (KPCA. The data are firstly mapped into high-dimensional feature subspace. Then, the ICA algorithm seeks the projection directions in the KPCA whitened space. Performance monitoring is implemented through constructing the statistical index and control limit in the feature space. If the statistical indexes exceed the predefined control limit, a fault may have occurred. Then, the nonlinear score vectors are calculated and fed into the sparse SVM to identify the faults. The proposed method is applied to the simulation of Tennessee Eastman (TE chemical process. The simulation results show that the proposed method can identify various types of faults accurately and rapidly.

Assessment of modularity architecture for recovery process of electric vehicle in supporting sustainable design

Science.gov (United States)

Baroroh, D. K.; Alfiah, D.

2018-05-01

The electric vehicle is one of the innovations to reduce the pollution of the vehicle. Nevertheless, it still has a problem, especially for disposal stage. In supporting product design and development strategy, which is the idea of sustainable design or problem solving of disposal stage, assessment of modularity architecture from electric vehicle in recovery process needs to be done. This research used Design Structure Matrix (DSM) approach to deciding interaction of components and assessment of modularity architecture using the calculation of value from 3 variables, namely Module Independence (MI), Module Similarity (MS), and Modularity for End of Life Stage (MEOL). The result of this research shows that existing design of electric vehicles has the architectural design which has a high value of modularity for recovery process on disposal stage. Accordingly, so it can be reused and recycled in component level or module without disassembly process to support the product that is environmentally friendly (sustainable design) and able reduce disassembly cost.

A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems

Czech Academy of Sciences Publication Activity Database

Benzi, M.; Tůma, Miroslav

1998-01-01

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

The Train Driver Recovery Problem - Solution Method and Decision Support System Framework

DEFF Research Database (Denmark)

Rezanova, Natalia Jurjevna

2009-01-01

the proposed model and solution method is suitable for solving in real-time. Recovery duties are generated as resource constrained paths in duty networks, and the set partitioning problem is solved with a linear programming based branch-and-price algorithm. Dynamic column generation and problem space expansion...... driver decision support system in their operational environment. Besides solving a particular optimization problem, this thesis contributes with a description of the railway planning process, tactical crew scheduling and the real-time dispatching solutions, taking a starting point in DSB S....... Rezanova NJ, Ryan DM. The train driver recovery problem–A set partitioning based model and solution method. Computers and Operations Research, in press, 2009. doi: 10.1016/j.cor.2009.03.023. 2. Clausen J, Larsen A, Larsen J, Rezanova NJ. Disruption management in the airline industry–Concepts, models...

Enhancement of snow cover change detection with sparse representation and dictionary learning

Science.gov (United States)

Varade, D.; Dikshit, O.

2014-11-01

Sparse representation and decoding is often used for denoising images and compression of images with respect to inherent features. In this paper, we adopt a methodology incorporating sparse representation of a snow cover change map using the K-SVD trained dictionary and sparse decoding to enhance the change map. The pixels often falsely characterized as "changes" are eliminated using this approach. The preliminary change map was generated using differenced NDSI or S3 maps in case of Resourcesat-2 and Landsat 8 OLI imagery respectively. These maps are extracted into patches for compressed sensing using Discrete Cosine Transform (DCT) to generate an initial dictionary which is trained by the K-SVD approach. The trained dictionary is used for sparse coding of the change map using the Orthogonal Matching Pursuit (OMP) algorithm. The reconstructed change map incorporates a greater degree of smoothing and represents the features (snow cover changes) with better accuracy. The enhanced change map is segmented using kmeans to discriminate between the changed and non-changed pixels. The segmented enhanced change map is compared, firstly with the difference of Support Vector Machine (SVM) classified NDSI maps and secondly with a reference data generated as a mask by visual interpretation of the two input images. The methodology is evaluated using multi-spectral datasets from Resourcesat-2 and Landsat-8. The k-hat statistic is computed to determine the accuracy of the proposed approach.

Multi-information fusion sparse coding with preserving local structure for hyperspectral image classification

Science.gov (United States)

Wei, Xiaohui; Zhu, Wen; Liao, Bo; Gu, Changlong; Li, Weibiao

2017-10-01

The key question of sparse coding (SC) is how to exploit the information that already exists to acquire the robust sparse representations (SRs) of distinguishing different objects for hyperspectral image (HSI) classification. We propose a multi-information fusion SC framework, which fuses the spectral, spatial, and label information in the same level, to solve the above question. In particular, pixels from disjointed spatial clusters, which are obtained by cutting the given HSI in space, are individually and sparsely encoded. Then, due to the importance of spatial structure, graph- and hypergraph-based regularizers are enforced to motivate the obtained representations smoothness and to preserve the local consistency for each spatial cluster. The latter simultaneously considers the spectrum, spatial, and label information of multiple pixels that have a great probability with the same label. Finally, a linear support vector machine is selected as the final classifier with the learned SRs as input. Experiments conducted on three frequently used real HSIs show that our methods can achieve satisfactory results compared with other state-of-the-art methods.

Substance Abuse Counselors' Recovery Status and Self-Schemas: Preliminary Implications for Empirically Supported Treatment Implementation.

Science.gov (United States)

Nielson, Elizabeth M

2016-01-01

The purpose of this paper is to better understand the relationship between substance abuse counselors' personal recovery status, self-schemas, and willingness to use empirically supported treatments for substance use disorders. A phenomenological qualitative study enrolled 12 practicing substance abuse counselors. Within this sample, recovering counselors tended to see those who suffer from addiction as qualitatively different from those who do not and hence themselves as similar to their patients, while nonrecovering counselors tended to see patients as experiencing a specific variety of the same basic human struggles everyone experiences, and hence also felt able to relate to their patients' struggles. Since empirically supported treatments may fit more or less neatly within one or the other of these viewpoints, this finding suggests that counselors' recovery status and corresponding self-schemas may be related to counselor willingness to learn and practice specific treatments.

Accelerated dynamic cardiac MRI exploiting sparse-Kalman-smoother self-calibration and reconstruction (k  −  t SPARKS)

International Nuclear Information System (INIS)

Park, Suhyung; Park, Jaeseok

2015-01-01

Accelerated dynamic MRI, which exploits spatiotemporal redundancies in k  −  t space and coil dimension, has been widely used to reduce the number of signal encoding and thus increase imaging efficiency with minimal loss of image quality. Nonetheless, particularly in cardiac MRI it still suffers from artifacts and amplified noise in the presence of time-drifting coil sensitivity due to relative motion between coil and subject (e.g. free breathing). Furthermore, a substantial number of additional calibrating signals is to be acquired to warrant accurate calibration of coil sensitivity. In this work, we propose a novel, accelerated dynamic cardiac MRI with sparse-Kalman-smoother self-calibration and reconstruction (k  −  t SPARKS), which is robust to time-varying coil sensitivity even with a small number of calibrating signals. The proposed k  −  t SPARKS incorporates Kalman-smoother self-calibration in k  −  t space and sparse signal recovery in x  −   f space into a single optimization problem, leading to iterative, joint estimation of time-varying convolution kernels and missing signals in k  −  t space. In the Kalman-smoother calibration, motion-induced uncertainties over the entire time frames were included in modeling state transition while a coil-dependent noise statistic in describing measurement process. The sparse signal recovery iteratively alternates with the self-calibration to tackle the ill-conditioning problem potentially resulting from insufficient calibrating signals. Simulations and experiments were performed using both the proposed and conventional methods for comparison, revealing that the proposed k  −  t SPARKS yields higher signal-to-error ratio and superior temporal fidelity in both breath-hold and free-breathing cardiac applications over all reduction factors. (paper)

Greedy vs. L1 convex optimization in sparse coding

DEFF Research Database (Denmark)

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

2015-01-01

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

A sparse matrix based full-configuration interaction algorithm

International Nuclear Information System (INIS)

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

2008-01-01

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

An in-depth study of sparse codes on abnormality detection

DEFF Research Database (Denmark)

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

2016-01-01

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

Sparse Principal Component Analysis in Medical Shape Modeling

DEFF Research Database (Denmark)

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

2006-01-01

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

Recovery from cannabis use disorders: Abstinence versus moderation and treatment-assisted recovery versus natural recovery.

Science.gov (United States)

Stea, Jonathan N; Yakovenko, Igor; Hodgins, David C

2015-09-01

The present study of recovery from cannabis use disorders was undertaken with 2 primary objectives that address gaps in the literature. The first objective was to provide an exploratory portrait of the recovery process from cannabis use disorders, comparing individuals who recovered naturally with those who were involved in treatment. The second objective was to explore systematically the similarities and differences between abstinence and moderation recoveries. Adults who have recovered from a cannabis use disorder were recruited in the community (N = 119). The abstinence and treatment-assisted participants exhibited higher levels of lifetime cannabis problem severity than the moderation and natural recovery participants, respectively. As well, cognitive factors were identified as the most useful strategies for recovery (e.g., thinking about benefits and negative consequences of cannabis), followed by behavioral factors (e.g., avoidance of triggers for use and high-risk situations). Findings lend further support to the effectiveness of cognitive, motivational, and behavioral strategies as helpful actions and maintenance factors involved in the recovery process. The findings also generally support the idea that cannabis use disorders lie on a continuum of problem severity, with moderation and natural recoveries more likely to occur at the lower end of the continuum and abstinence and treatment-assisted recoveries more likely to occur at the upper end. (c) 2015 APA, all rights reserved).

Deploying temporary networks for upscaling of sparse network stations

Science.gov (United States)

Coopersmith, Evan J.; Cosh, Michael H.; Bell, Jesse E.; Kelly, Victoria; Hall, Mark; Palecki, Michael A.; Temimi, Marouane

2016-10-01

Soil observations networks at the national scale play an integral role in hydrologic modeling, drought assessment, agricultural decision support, and our ability to understand climate change. Understanding soil moisture variability is necessary to apply these measurements to model calibration, business and consumer applications, or even human health issues. The installation of soil moisture sensors as sparse, national networks is necessitated by limited financial resources. However, this results in the incomplete sampling of the local heterogeneity of soil type, vegetation cover, topography, and the fine spatial distribution of precipitation events. To this end, temporary networks can be installed in the areas surrounding a permanent installation within a sparse network. The temporary networks deployed in this study provide a more representative average at the 3 km and 9 km scales, localized about the permanent gauge. The value of such temporary networks is demonstrated at test sites in Millbrook, New York and Crossville, Tennessee. The capacity of a single U.S. Climate Reference Network (USCRN) sensor set to approximate the average of a temporary network at the 3 km and 9 km scales using a simple linear scaling function is tested. The capacity of a temporary network to provide reliable estimates with diminishing numbers of sensors, the temporal stability of those networks, and ultimately, the relationship of the variability of those networks to soil moisture conditions at the permanent sensor are investigated. In this manner, this work demonstrates the single-season installation of a temporary network as a mechanism to characterize the soil moisture variability at a permanent gauge within a sparse network.

On the role of sparseness in the evolution of modularity in gene regulatory networks.

Science.gov (United States)

Espinosa-Soto, Carlos

2018-05-01

Modularity is a widespread property in biological systems. It implies that interactions occur mainly within groups of system elements. A modular arrangement facilitates adjustment of one module without perturbing the rest of the system. Therefore, modularity of developmental mechanisms is a major factor for evolvability, the potential to produce beneficial variation from random genetic change. Understanding how modularity evolves in gene regulatory networks, that create the distinct gene activity patterns that characterize different parts of an organism, is key to developmental and evolutionary biology. One hypothesis for the evolution of modules suggests that interactions between some sets of genes become maladaptive when selection favours additional gene activity patterns. The removal of such interactions by selection would result in the formation of modules. A second hypothesis suggests that modularity evolves in response to sparseness, the scarcity of interactions within a system. Here I simulate the evolution of gene regulatory networks and analyse diverse experimentally sustained networks to study the relationship between sparseness and modularity. My results suggest that sparseness alone is neither sufficient nor necessary to explain modularity in gene regulatory networks. However, sparseness amplifies the effects of forms of selection that, like selection for additional gene activity patterns, already produce an increase in modularity. That evolution of new gene activity patterns is frequent across evolution also supports that it is a major factor in the evolution of modularity. That sparseness is widespread across gene regulatory networks indicates that it may have facilitated the evolution of modules in a wide variety of cases.

Substance Abuse Counselors’ Recovery Status and Self-Schemas: Preliminary Implications for Empirically Supported Treatment Implementation

Science.gov (United States)

Nielson, Elizabeth M.

2016-01-01

Purpose The purpose of this paper is to better understand the relationship between substance abuse counselors’ personal recovery status, self-schemas, and willingness to use empirically supported treatments for substance use disorders. Methods A phenomenological qualitative study enrolled 12 practicing substance abuse counselors. Results Within this sample, recovering counselors tended to see those who suffer from addiction as qualitatively different from those who do not and hence themselves as similar to their patients, while nonrecovering counselors tended to see patients as experiencing a specific variety of the same basic human struggles everyone experiences, and hence also felt able to relate to their patients’ struggles. Discussion Since empirically supported treatments may fit more or less neatly within one or the other of these viewpoints, this finding suggests that counselors’ recovery status and corresponding self-schemas may be related to counselor willingness to learn and practice specific treatments. PMID:28626597

Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions

Energy Technology Data Exchange (ETDEWEB)

Huan, Xun; Safta, Cosmin; Sargsyan, Khachik; Vane, Zachary Phillips; Lacaze, Guilhem; Oefelein, Joseph C.; Najm, Habib N.

2017-07-01

Compressive sensing is a powerful technique for recovering sparse solutions of underdetermined linear systems, which is often encountered in uncertainty quanti cation analysis of expensive and high-dimensional physical models. We perform numerical investigations employing several com- pressive sensing solvers that target the unconstrained LASSO formulation, with a focus on linear systems that arise in the construction of polynomial chaos expansions. With core solvers of l1 ls, SpaRSA, CGIST, FPC AS, and ADMM, we develop techniques to mitigate over tting through an automated selection of regularization constant based on cross-validation, and a heuristic strategy to guide the stop-sampling decision. Practical recommendations on parameter settings for these tech- niques are provided and discussed. The overall method is applied to a series of numerical examples of increasing complexity, including large eddy simulations of supersonic turbulent jet-in-cross flow involving a 24-dimensional input. Through empirical phase-transition diagrams and convergence plots, we illustrate sparse recovery performance under structures induced by polynomial chaos, accuracy and computational tradeoffs between polynomial bases of different degrees, and practi- cability of conducting compressive sensing for a realistic, high-dimensional physical application. Across test cases studied in this paper, we find ADMM to have demonstrated empirical advantages through consistent lower errors and faster computational times.

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

Science.gov (United States)

Reddy, C. J.

2000-01-01

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

Efficient Model Selection for Sparse Least-Square SVMs

Directory of Open Access Journals (Sweden)

Xiao-Lei Xia

2013-01-01

Full Text Available The Forward Least-Squares Approximation (FLSA SVM is a newly-emerged Least-Square SVM (LS-SVM whose solution is extremely sparse. The algorithm uses the number of support vectors as the regularization parameter and ensures the linear independency of the support vectors which span the solution. This paper proposed a variant of the FLSA-SVM, namely, Reduced FLSA-SVM which is of reduced computational complexity and memory requirements. The strategy of “contexts inheritance” is introduced to improve the efficiency of tuning the regularization parameter for both the FLSA-SVM and the RFLSA-SVM algorithms. Experimental results on benchmark datasets showed that, compared to the SVM and a number of its variants, the RFLSA-SVM solutions contain a reduced number of support vectors, while maintaining competitive generalization abilities. With respect to the time cost for tuning of the regularize parameter, the RFLSA-SVM algorithm was empirically demonstrated fastest compared to FLSA-SVM, the LS-SVM, and the SVM algorithms.

Parallel transposition of sparse data structures

DEFF Research Database (Denmark)

Wang, Hao; Liu, Weifeng; Hou, Kaixi

2016-01-01

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

Numerical solution of large sparse linear systems

International Nuclear Information System (INIS)

Meurant, Gerard; Golub, Gene.

1982-02-01

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

On complex-valued deautoconvolution of compactly supported functions with sparse Fourier representation

International Nuclear Information System (INIS)

Bürger, Steven; Flemming, Jens; Hofmann, Bernd

2016-01-01

Convergence rates results for the Tikhonov regularization of nonlinear ill-posed operator equations are missing, even for a Hilbert space setting, if a range type source condition fails and if moreover nonlinearity conditions of tangential cone type cannot be shown. This situation applies for a deautoconvolution problem in complex-valued L 2 -spaces over finite real intervals, occurring in a slightly generalized version in laser optics. For this problem we show that the lack of applicable convergence rates results can be overcome under the assumption that the solution of the operator equation has a sparse Fourier representation. Precisely, we derive a variational source condition for that case, which implies a convergence rate immediately. The surprising observation is that a sparsity assumption imposed on the solution leads to success, although the used norm square is not known to be a sparsity promoting penalty in the Tikhonov functional. (paper)

Contracts for field projects and supporting research on enhanced oil recovery. Progress review No. 71, quarter ending June 30, 1992

Energy Technology Data Exchange (ETDEWEB)

1993-06-01

Progress reports are presented for the following tasks: chemical flooding--supporting research; gas displacement--supporting research; thermal recovery--supporting research; geoscience technology; resource assessment technology; microbial technology; and novel technology. A list of available publication is also provided.

Low-count PET image restoration using sparse representation

Science.gov (United States)

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

2018-04-01

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

X-ray computed tomography using curvelet sparse regularization.

Science.gov (United States)

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

2015-04-01

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

Improving sample recovery

International Nuclear Information System (INIS)

Blanchard, R.J.

1995-09-01

This Engineering Task Plan (ETP) describes the tasks, i.e., tests, studies, external support and modifications planned to increase the recovery of the recovery of the waste tank contents using combinations of improved techniques, equipment, knowledge, experience and testing to better the recovery rates presently being experienced

Robust Pedestrian Tracking and Recognition from FLIR Video: A Unified Approach via Sparse Coding

Directory of Open Access Journals (Sweden)

Xin Li

2014-06-01

Full Text Available Sparse coding is an emerging method that has been successfully applied to both robust object tracking and recognition in the vision literature. In this paper, we propose to explore a sparse coding-based approach toward joint object tracking-and-recognition and explore its potential in the analysis of forward-looking infrared (FLIR video to support nighttime machine vision systems. A key technical contribution of this work is to unify existing sparse coding-based approaches toward tracking and recognition under the same framework, so that they can benefit from each other in a closed-loop. On the one hand, tracking the same object through temporal frames allows us to achieve improved recognition performance through dynamical updating of template/dictionary and combining multiple recognition results; on the other hand, the recognition of individual objects facilitates the tracking of multiple objects (i.e., walking pedestrians, especially in the presence of occlusion within a crowded environment. We report experimental results on both the CASIAPedestrian Database and our own collected FLIR video database to demonstrate the effectiveness of the proposed joint tracking-and-recognition approach.

Single-Trial Decoding of Bistable Perception Based on Sparse Nonnegative Tensor Decomposition

Science.gov (United States)

Wang, Zhisong; Maier, Alexander; Logothetis, Nikos K.; Liang, Hualou

2008-01-01

The study of the neuronal correlates of the spontaneous alternation in perception elicited by bistable visual stimuli is promising for understanding the mechanism of neural information processing and the neural basis of visual perception and perceptual decision-making. In this paper, we develop a sparse nonnegative tensor factorization-(NTF)-based method to extract features from the local field potential (LFP), collected from the middle temporal (MT) visual cortex in a macaque monkey, for decoding its bistable structure-from-motion (SFM) perception. We apply the feature extraction approach to the multichannel time-frequency representation of the intracortical LFP data. The advantages of the sparse NTF-based feature extraction approach lies in its capability to yield components common across the space, time, and frequency domains yet discriminative across different conditions without prior knowledge of the discriminating frequency bands and temporal windows for a specific subject. We employ the support vector machines (SVMs) classifier based on the features of the NTF components for single-trial decoding the reported perception. Our results suggest that although other bands also have certain discriminability, the gamma band feature carries the most discriminative information for bistable perception, and that imposing the sparseness constraints on the nonnegative tensor factorization improves extraction of this feature. PMID:18528515

Sparse dictionary for synthetic transmit aperture medical ultrasound imaging.

Science.gov (United States)

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

2017-07-01

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

A sparse electromagnetic imaging scheme using nonlinear landweber iterations

KAUST Repository

Desmal, Abdulla; Bagci, Hakan

2015-01-01

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

Scalable group level probabilistic sparse factor analysis

DEFF Research Database (Denmark)

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

2017-01-01

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

Fast wavelet based sparse approximate inverse preconditioner

Energy Technology Data Exchange (ETDEWEB)

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

1996-12-31

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

Local posterior concentration rate for multilevel sparse sequences

NARCIS (Netherlands)

Belitser, E.N.; Nurushev, N.

2017-01-01

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

Role of self-efficacy and social support in short-term recovery after total hip replacement: a prospective cohort study.

Science.gov (United States)

Brembo, Espen Andreas; Kapstad, Heidi; Van Dulmen, Sandra; Eide, Hilde

2017-04-11

Despite the overall success of total hip replacement (THR) in patients with symptomatic osteoarthritis (OA), up to one-quarter of patients report suboptimal recovery. The aim of this study was to determine whether social support and general self-efficacy predict variability in short-term recovery in a Norwegian cohort. We performed secondary analysis of a prospective multicenter study of 223 patients who underwent THR for OA in 2003-2004. The total score of the Western Ontario and McMaster Universities Osteoarthritis Index (WOMAC) at 3 months after surgery was used as the recovery variable. We measured self-efficacy using the General Self-Efficacy Scale (GSES) and social support with the Social Provisions Scale (SPS). Preoperative and postoperative scores were compared using Wilcoxon tests. The Mann-Whitney U test compared scores between groups that differed in gender and age. Spearman's rho correlation coefficients were used to evaluate associations between selected predictor variables and the recovery variable. We performed univariate and multiple linear regression analyses to identify independent variables and their ability to predict short-term recovery after THR. The median preoperative WOMAC score was 58.3 before and 23.9 after surgery. The mean absolute change was 31.9 (standard deviation [SD] 17.0) and the mean relative change was 54.8% (SD 26.6). Older age, female gender, higher educational level, number of comorbidities, baseline WOMAC score, self-efficacy, and three of six individual provisions correlated significantly with short-term recovery after THR and predicted the variability in recovery in the univariate regression model. In multiple regression models, baseline WOMAC was the most consistent predictor of short-term recovery: a higher preoperative WOMAC score predicted worse short-term recovery (β = 0.44 [0.29, 0.59]). Higher self-efficacy predicted better recovery (β = -0.44 [-0.87, -0.02]). Reliable alliance was a significant predictor

Sparse modeling of spatial environmental variables associated with asthma.

Science.gov (United States)

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

2015-02-01

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

Analog system for computing sparse codes

Science.gov (United States)

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

2010-08-24

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

Matching pursuit and source deflation for sparse EEG/MEG dipole moment estimation.

Science.gov (United States)

Wu, Shun Chi; Swindlehurst, A Lee

2013-08-01

In this paper, we propose novel matching pursuit (MP)-based algorithms for EEG/MEG dipole source localization and parameter estimation for multiple measurement vectors with constant sparsity. The algorithms combine the ideas of MP for sparse signal recovery and source deflation, as employed in estimation via alternating projections. The source-deflated matching pursuit (SDMP) approach mitigates the problem of residual interference inherent in sequential MP-based methods or recursively applied (RAP)-MUSIC. Furthermore, unlike prior methods based on alternating projection, SDMP allows one to efficiently estimate the dipole orientation in addition to its location. Simulations show that the proposed algorithms outperform existing techniques under various conditions, including those with highly correlated sources. Results using real EEG data from auditory experiments are also presented to illustrate the performance of these algorithms.

Efficient Pseudorecursive Evaluation Schemes for Non-adaptive Sparse Grids

KAUST Repository

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

2014-01-01

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

Sadhana | Indian Academy of Sciences

Indian Academy of Sciences (India)

We consider the recovery of sparse signals that share a common support from multiple measurement vectors. The performance of several algorithms developed for this task depends on parameters like dimension of the sparse signal, dimension of measurement vector, sparsity level, measurement noise. We propose a ...

Occlusion detection via structured sparse learning for robust object tracking

KAUST Repository

Zhang, Tianzhu

2014-01-01

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

Sparse Representation Based SAR Vehicle Recognition along with Aspect Angle

Directory of Open Access Journals (Sweden)

Xiangwei Xing

2014-01-01

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

Contracts for field projects and supporting research on enhanced oil recovery. Progress review No. 82, quarterly report, January--March 1995

Energy Technology Data Exchange (ETDEWEB)

NONE

1996-06-01

This document consists of a list of projects supporting work on oil recovery programs. A publications list and index of companies and institutions is provided. The remaining portion of the document provides brief descriptions on projects in chemical flooding, gas displacement, thermal recovery, geoscience, resource assessment, and reservoir class field demonstrations.

Tensor completion and low-n-rank tensor recovery via convex optimization

International Nuclear Information System (INIS)

Gandy, Silvia; Yamada, Isao; Recht, Benjamin

2011-01-01

In this paper we consider sparsity on a tensor level, as given by the n-rank of a tensor. In an important sparse-vector approximation problem (compressed sensing) and the low-rank matrix recovery problem, using a convex relaxation technique proved to be a valuable solution strategy. Here, we will adapt these techniques to the tensor setting. We use the n-rank of a tensor as a sparsity measure and consider the low-n-rank tensor recovery problem, i.e. the problem of finding the tensor of the lowest n-rank that fulfills some linear constraints. We introduce a tractable convex relaxation of the n-rank and propose efficient algorithms to solve the low-n-rank tensor recovery problem numerically. The algorithms are based on the Douglas–Rachford splitting technique and its dual variant, the alternating direction method of multipliers

Learning sparse generative models of audiovisual signals

OpenAIRE

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

2008-01-01

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

Preconditioned Inexact Newton for Nonlinear Sparse Electromagnetic Imaging

KAUST Repository

Desmal, Abdulla

2014-05-04

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

Preconditioned Inexact Newton for Nonlinear Sparse Electromagnetic Imaging

KAUST Repository

Desmal, Abdulla

2014-01-06

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

Electromagnetic Formation Flight (EMFF) for Sparse Aperture Arrays

Science.gov (United States)

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

2004-01-01

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

Preconditioned Inexact Newton for Nonlinear Sparse Electromagnetic Imaging

KAUST Repository

Desmal, Abdulla; Bagci, Hakan

2014-01-01

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

A comprehensive study of sparse codes on abnormality detection

DEFF Research Database (Denmark)

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

2017-01-01

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

Sparse calibration of subsurface flow models using nonlinear orthogonal matching pursuit and an iterative stochastic ensemble method

KAUST Repository

Elsheikh, Ahmed H.

2013-06-01

We introduce a nonlinear orthogonal matching pursuit (NOMP) for sparse calibration of subsurface flow models. Sparse calibration is a challenging problem as the unknowns are both the non-zero components of the solution and their associated weights. NOMP is a greedy algorithm that discovers at each iteration the most correlated basis function with the residual from a large pool of basis functions. The discovered basis (aka support) is augmented across the nonlinear iterations. Once a set of basis functions are selected, the solution is obtained by applying Tikhonov regularization. The proposed algorithm relies on stochastically approximated gradient using an iterative stochastic ensemble method (ISEM). In the current study, the search space is parameterized using an overcomplete dictionary of basis functions built using the K-SVD algorithm. The proposed algorithm is the first ensemble based algorithm that tackels the sparse nonlinear parameter estimation problem. © 2013 Elsevier Ltd.

On-campus programs to support college students in recovery.

Science.gov (United States)

Misch, Donald A

2009-01-01

The author argues that referral of alcohol-abusing college students to off-campus treatment services, although necessary for some, is not optimal for many. He advocates the implementation of comprehensive on-campus services for students committed to recovery in order to optimize their treatment while allowing them to remain in school and work towards their degree. The author suggests that such on-campus recovery services provide additional benefits to the college or university as well as to other students, and he proposes that on-campus alcohol-abusing students in recovery can serve as important opinion leaders and role models for their peers.

SPARSE ELECTROMAGNETIC IMAGING USING NONLINEAR LANDWEBER ITERATIONS

KAUST Repository

Desmal, Abdulla

2015-07-29

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

Vector sparse representation of color image using quaternion matrix analysis.

Science.gov (United States)

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

2015-04-01

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

Contracts for field projects and supporting research on enhanced oil recovery: Progress review No. 74, Quarter ending March 31, 1993

Energy Technology Data Exchange (ETDEWEB)

1994-03-01

Accomplishments for the past quarter are presented for the following tasks: chemical flooding--supporting research; gas displacement--supporting research; thermal recovery--supporting research; geoscience technology; resource assessment technology; microbial technology; field demonstrations in high-priority reservoir classes; and novel technology. A list of available publication is also provided.

"That's what you do for people you love": A qualitative study of social support and recovery from a musculoskeletal injury.

Science.gov (United States)

Prang, Khic-Houy; Newnam, Sharon; Berecki-Gisolf, Janneke

2018-01-01

Social support has been identified as a significant factor in facilitating better health outcomes following injury. However, research has primarily focused on the role of social support from the perspective of the person experiencing an injury. Limited research has examined the experiences of the family members and friends of a person with injury. This study aims to explore the perceptions and experiences of social support and recovery following a transport-related musculoskeletal injury (MSI) in a population of injured persons and their family members and friends. This study was conducted using a phenomenological qualitative research design. In-depth semi-structured interviews were conducted with ten persons with MSI, recruited via the Transport Accident Commission (TAC) in Victoria, Australia. Seven family members and friends were also interviewed. The data was analysed using constant comparative method and thematic analysis. Several themes were identified including: (1) key sources and types of support received, (2) relationship development and (3) challenges of providing and receiving support. Participants with MSI reported stories about how the social network provided emotional and tangible support. Family members and friends confirmed the supportive acts provided to the participants with MSI. Positive iterative changes in relationships were reported by the participants with MSI. Participants with MSI, their family members and friends described several difficulties including loss of independence, feeling like a burden, and the impact of caring on health and well-being. The role of social support is complex given the multitude of people involved in the recovery process. The findings of this study suggest that persons with MSI may benefit from support groups and maintenance of existing support networks. Furthermore, family members and friends engaged in the recovery process may benefit from support in this role.

Cloud-In-Cell modeling of shocked particle-laden flows at a ``SPARSE'' cost

Science.gov (United States)

Taverniers, Soren; Jacobs, Gustaaf; Sen, Oishik; Udaykumar, H. S.

2017-11-01

A common tool for enabling process-scale simulations of shocked particle-laden flows is Eulerian-Lagrangian Particle-Source-In-Cell (PSIC) modeling where each particle is traced in its Lagrangian frame and treated as a mathematical point. Its dynamics are governed by Stokes drag corrected for high Reynolds and Mach numbers. The computational burden is often reduced further through a ``Cloud-In-Cell'' (CIC) approach which amalgamates groups of physical particles into computational ``macro-particles''. CIC does not account for subgrid particle fluctuations, leading to erroneous predictions of cloud dynamics. A Subgrid Particle-Averaged Reynolds-Stress Equivalent (SPARSE) model is proposed that incorporates subgrid interphase velocity and temperature perturbations. A bivariate Gaussian source distribution, whose covariance captures the cloud's deformation to first order, accounts for the particles' momentum and energy influence on the carrier gas. SPARSE is validated by conducting tests on the interaction of a particle cloud with the accelerated flow behind a shock. The cloud's average dynamics and its deformation over time predicted with SPARSE converge to their counterparts computed with reference PSIC models as the number of Gaussians is increased from 1 to 16. This work was supported by AFOSR Grant No. FA9550-16-1-0008.

A trial essay about studies of Grief Toward to recovery support for mothers who abuse their children

OpenAIRE

遠藤, 野ゆり

2016-01-01

This paper is a short essay about studies of Grief which are written by Sigmund Freud, Melanie Klein, John Bowlby, and Keigo Okonogi. The final aim is to describe parents’, mainly mother’s mechanism of recovery process from their abusing of children. This paper is one piece of this aim. The lag of support for abusing mother seems to be caused by the complexity and difficulty of their mechanism. They often have been abused in their childhood and can’t remember it. The process of recovery is pa...

Social biases determine spatiotemporal sparseness of ciliate mating heuristics.

Science.gov (United States)

Clark, Kevin B

2012-01-01

Ciliates become highly social, even displaying animal-like qualities, in the joint presence of aroused conspecifics and nonself mating pheromones. Pheromone detection putatively helps trigger instinctual and learned courtship and dominance displays from which social judgments are made about the availability, compatibility, and fitness representativeness or likelihood of prospective mates and rivals. In earlier studies, I demonstrated the heterotrich Spirostomum ambiguum improves mating competence by effecting preconjugal strategies and inferences in mock social trials via behavioral heuristics built from Hebbian-like associative learning. Heuristics embody serial patterns of socially relevant action that evolve into ordered, topologically invariant computational networks supporting intra- and intermate selection. S. ambiguum employs heuristics to acquire, store, plan, compare, modify, select, and execute sets of mating propaganda. One major adaptive constraint over formation and use of heuristics involves a ciliate's initial subjective bias, responsiveness, or preparedness, as defined by Stevens' Law of subjective stimulus intensity, for perceiving the meaningfulness of mechanical pressures accompanying cell-cell contacts and additional perimating events. This bias controls durations and valences of nonassociative learning, search rates for appropriate mating strategies, potential net reproductive payoffs, levels of social honesty and deception, successful error diagnosis and correction of mating signals, use of insight or analysis to solve mating dilemmas, bioenergetics expenditures, and governance of mating decisions by classical or quantum statistical mechanics. I now report this same social bias also differentially affects the spatiotemporal sparseness, as measured with metric entropy, of ciliate heuristics. Sparseness plays an important role in neural systems through optimizing the specificity, efficiency, and capacity of memory representations. The present

Social biases determine spatiotemporal sparseness of ciliate mating heuristics

Science.gov (United States)

2012-01-01

Ciliates become highly social, even displaying animal-like qualities, in the joint presence of aroused conspecifics and nonself mating pheromones. Pheromone detection putatively helps trigger instinctual and learned courtship and dominance displays from which social judgments are made about the availability, compatibility, and fitness representativeness or likelihood of prospective mates and rivals. In earlier studies, I demonstrated the heterotrich Spirostomum ambiguum improves mating competence by effecting preconjugal strategies and inferences in mock social trials via behavioral heuristics built from Hebbian-like associative learning. Heuristics embody serial patterns of socially relevant action that evolve into ordered, topologically invariant computational networks supporting intra- and intermate selection. S. ambiguum employs heuristics to acquire, store, plan, compare, modify, select, and execute sets of mating propaganda. One major adaptive constraint over formation and use of heuristics involves a ciliate’s initial subjective bias, responsiveness, or preparedness, as defined by Stevens’ Law of subjective stimulus intensity, for perceiving the meaningfulness of mechanical pressures accompanying cell-cell contacts and additional perimating events. This bias controls durations and valences of nonassociative learning, search rates for appropriate mating strategies, potential net reproductive payoffs, levels of social honesty and deception, successful error diagnosis and correction of mating signals, use of insight or analysis to solve mating dilemmas, bioenergetics expenditures, and governance of mating decisions by classical or quantum statistical mechanics. I now report this same social bias also differentially affects the spatiotemporal sparseness, as measured with metric entropy, of ciliate heuristics. Sparseness plays an important role in neural systems through optimizing the specificity, efficiency, and capacity of memory representations. The

Structure-based bayesian sparse reconstruction

KAUST Repository

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

2012-01-01

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

Contracts for field projects and supporting research on enhanced oil recovery. Progress review No. 89

Energy Technology Data Exchange (ETDEWEB)

NONE

1998-04-01

Summaries are presented for the DOE contracts related to supported research for thermal recovery of petroleum, geoscience technology, and field demonstrations in high-priority reservoir classes. Data included for each project are: title, contract number, principal investigator, research organization, beginning date, expected completion date, amount of award, objectives of the research, and summary of technical progress.

Confidence of model based shape reconstruction from sparse data

DEFF Research Database (Denmark)

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

2010-01-01

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

Proportionate Minimum Error Entropy Algorithm for Sparse System Identification

Directory of Open Access Journals (Sweden)

Zongze Wu

2015-08-01

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

Sparse PDF Volumes for Consistent Multi-Resolution Volume Rendering

KAUST Repository

Sicat, Ronell Barrera

2014-12-31

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

Ordering sparse matrices for cache-based systems

International Nuclear Information System (INIS)

Biswas, Rupak; Oliker, Leonid

2001-01-01

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

A flexible framework for sparse simultaneous component based data integration

Directory of Open Access Journals (Sweden)

Van Deun Katrijn

2011-11-01

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

A flexible framework for sparse simultaneous component based data integration.

Science.gov (United States)

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

2011-11-15

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

Seismic data two-step recovery approach combining sparsity-promoting and hyperbolic Radon transform methods

International Nuclear Information System (INIS)

Wang, Hanchuang; Chen, Shengchang; Ren, Haoran; Liang, Donghui; Zhou, Huamin; She, Deping

2015-01-01

In current research of seismic data recovery problems, the sparsity-promoting method usually produces an insufficient recovery result at the locations of null traces. The HRT (hyperbolic Radon transform) method can be applied to problems of seismic data recovery with approximately hyperbolic events. Influenced by deviations of hyperbolic characteristics between real and ideal travel-time curves, some spurious events are usually introduced and the recovery effect of intermediate and far-offset traces is worse than that of near-offset traces. Sparsity-promoting recovery is primarily dependent on the sparsity of seismic data in the sparse transform domain (i.e. on the local waveform characteristics), whereas HRT recovery is severely affected by the global characteristics of the seismic events. Inspired by the above conclusion, a two-step recovery approach combining sparsity-promoting and time-invariant HRT methods is proposed, which is based on both local and global characteristics of the seismic data. Two implementation strategies are presented in detail, and the selection criteria of the relevant strategies is also discussed. Numerical examples of synthetic and real data verify that the new approach can achieve a better recovery effect by simultaneously overcoming the shortcomings of sparsity-promoting recovery and HRT recovery. (paper)

P-SPARSLIB: A parallel sparse iterative solution package

Energy Technology Data Exchange (ETDEWEB)

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

1994-12-31

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

Building addiction recovery capital through online participation in a recovery community.

Science.gov (United States)

Bliuc, Ana-Maria; Best, David; Iqbal, Muhammad; Upton, Katie

2017-11-01

This study examines how online participation in a community of recovery contributes to personal journeys of recovery. It investigates whether recovery capital building - as indicated by increased levels and quality of online social interactions - and markers of positive identity development predict retention in a recovery program designed around fostering community involvement for early stage recovery addicts. It was predicted that online participation on the group's Facebook page and positive identity development are associated to retention in the program. To map how participants interact online, social network analysis (SNA) based on naturally occurring online data (N = 609) on the Facebook page of a recovery community was conducted. Computerised linguistic analyses evaluated sentiment of the textual data (capturing social identity markers). Linear regression analyses evaluated whether indicators of recovery capital predict program retention. To illustrate the findings in the context of the specific recovery community, presented are two case studies of key participants who moved from the periphery to the centre of the social network. By conducting in-depth interviews with these participants, personal experiences of engagement in the online community of group members who have undergone the most significant changes since joining the community are explored. Retention in the program was determined by a) the number of comment 'likes' and all 'likes' received on the Facebook page; b) position in the social network (degree of centrality); and c) linguistic content around group identity and achievement. Positive online interactions between members of recovery communities support the recovery process through helping participants to develop recovery capital that binds them to groups supportive of positive change. Copyright © 2017 Elsevier Ltd. All rights reserved.

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

KAUST Repository

Wang, Jim Jing-Yan

2014-03-01

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

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

Science.gov (United States)

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

2014-03-01

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

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

Directory of Open Access Journals (Sweden)

Valeria Cardellini

2014-01-01

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

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

DEFF Research Database (Denmark)

Liu, Weifeng; Vinter, Brian

2014-01-01

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

Comparison of Methods for Sparse Representation of Musical Signals

DEFF Research Database (Denmark)

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

2005-01-01

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

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

Directory of Open Access Journals (Sweden)

Dong Zhang

2017-01-01

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

Discussion of CoSA: Clustering of Sparse Approximations

Energy Technology Data Exchange (ETDEWEB)

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

2017-03-07

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

Fast method of sparse acquisition and reconstruction of view and illumination dependent datasets

Czech Academy of Sciences Publication Activity Database

Filip, Jiří; Vávra, Radomír

2013-01-01

Roč. 37, č. 5 (2013), s. 376-388 ISSN 0097-8493 R&D Projects: GA ČR GAP103/11/0335 Grant - others:EC ERG (European Reintegration Grant) FP7(BE) 239294 Institutional support: RVO:67985556 Keywords : apparent BRDF * measurement * reconstruction * sparse sampling * portable setup Subject RIV: BD - Theory of Information Impact factor: 1.029, year: 2013 http://library.utia.cas.cz/separaty/2013/RO/filip-0392214.pdf

A Smartphone Application Supporting Recovery from Heroin Addiction: Perspectives of Patients and Providers in China, Taiwan, and the USA.

Science.gov (United States)

Schulte, Marya; Liang, Di; Wu, Fei; Lan, Yu-Ching; Tsay, Wening; Du, Jiang; Zhao, Min; Li, Xu; Hser, Yih-Ing

2016-09-01

Smartphone-based interventions are increasingly used to support self-monitoring, self-management, and treatment and medication compliance in order to improve overall functioning and well-being. In attempting to develop a smartphone application (S-Health) that assists heroin-dependent patients in recovery, a series of focus groups (72 patients, 22 providers) were conducted in China, Taiwan, and the USA to obtain their perspectives on its acceptance and potential adoption. Data were analyzed according to the Diffusion of Innovation (DOI) theory of characteristics important to the adoption of innovation. Important to Relative Advantage, USA participants cited S-Health's potential ability to overcome logistical barriers, while those in China and Taiwan valued its potential to supplement currently limited services. In terms of Compatibility, participants across sites reported recovery needs and goals that such an application could be helpful in supporting; however, its utility during strong craving was questioned in China and Taiwan. Important factors relevant to Complexity included concerns about smartphone access and familiarity, individualization of content, and particularly in China and Taiwan, participants wanted assurance of privacy and security. The study results suggest a general acceptance, but also indicate cultural variations in access to therapeutic and other social support systems, legal repercussions of substance use, societal perceptions of addiction, and the role of family and other social support in recovery. Taking these factors into consideration is likely to increase diffusion as well as effectiveness of these smartphone-based interventions.

Using smartphones to decrease substance use via self-monitoring and recovery support: study protocol for a randomized control trial.

Science.gov (United States)

Scott, Christy K; Dennis, Michael L; Gustafson, David H

2017-08-10

Alcohol abuse, other substance use disorders, and risk behaviors associated with the human immunodeficiency virus (HIV) represent three of the top 10 modifiable causes of mortality in the US. Despite evidence that continuing care is effective in sustaining recovery from substance use disorders and associated behaviors, patients rarely receive it. Smartphone applications (apps) have been effective in delivering continuing care to patients almost anywhere and anytime. This study tests the effectiveness of two components of such apps: ongoing self-monitoring through Ecological Momentary Assessments (EMAs) and immediate recovery support through Ecological Momentary Interventions (EMIs). The target population, adults enrolled in substance use disorder treatment (n = 400), are being recruited from treatment centers in Chicago and randomly assigned to one of four conditions upon discharge in a 2 × 2 factorial design. Participants receive (1) EMAs only, (2) EMIs only, (3) combined EMAs + EMIs, or (4) a control condition without EMA or EMI for 6 months. People in the experimental conditions receive smartphones with the apps (EMA and/or EMI) specific to their condition. Phones alert participants in the EMA and EMA + EMI conditions at five random times per day and present participants with questions about people, places, activities, and feelings that they experienced in the past 30 min and whether these factors make them want to use substances, support their recovery, or have no impact. Those in the EMI and EMA + EMI conditions have continual access to a suite of support services. In the EMA + EMI condition, participants are prompted to use the EMI(s) when responses to the EMA(s) indicate risk. All groups have access to recovery support as usual. The primary outcome is days of abstinence from alcohol and other drugs. Secondary outcomes are number of HIV risk behaviors and whether abstinence mediates the effects of EMA, EMI, or EMA + EMI on HIV

the dutch crisis and recovery act: economic recovery and legal crisis

African Journals Online (AJOL)

Jonathan

THE DUTCH CRISIS AND RECOVERY ACT: ECONOMIC RECOVERY AND. LEGAL CRISIS? J Verschuuren. 1 Introduction. Throughout the world, governments are responding to the financial and economic crisis. Such responses vary from supporting the banking system to adopting economic stimulus packages. The latter ...

Sparse Recovery via l1 and L1 Optimization

Science.gov (United States)

2014-11-01

of China 1.1 (Mar. 2013), pp. 79–105. [13] H. Brezis. “Solutions with compact sup- port of variational inequalities ”. In: Rus- sian Mathematical...Surveys 29.2 (Apr. 30, 1974), pp. 103–108. [14] H. Brezis and A. Friedman. “Estimates on the support of solutions of parabolic varia- tional inequalities ...ized inverse problems (e.g., total variation image reconstruction [4]) have made `1 optimization a central tool in data processing problems. As the

Hyperspectral Image Classification Based on the Combination of Spatial-spectral Feature and Sparse Representation

Directory of Open Access Journals (Sweden)

YANG Zhaoxia

2015-07-01

Full Text Available In order to avoid the problem of being over-dependent on high-dimensional spectral feature in the traditional hyperspectral image classification, a novel approach based on the combination of spatial-spectral feature and sparse representation is proposed in this paper. Firstly, we extract the spatial-spectral feature by reorganizing the local image patch with the first d principal components(PCs into a vector representation, followed by a sorting scheme to make the vector invariant to local image rotation. Secondly, we learn the dictionary through a supervised method, and use it to code the features from test samples afterwards. Finally, we embed the resulting sparse feature coding into the support vector machine(SVM for hyperspectral image classification. Experiments using three hyperspectral data show that the proposed method can effectively improve the classification accuracy comparing with traditional classification methods.

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

Directory of Open Access Journals (Sweden)

Lu Bing

2017-01-01

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

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

Science.gov (United States)

Bing, Lu; Wang, Wei

2017-01-01

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

Joint sparse representation for robust multimodal biometrics recognition.

Science.gov (United States)

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

2014-01-01

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

Robust Visual Tracking Via Consistent Low-Rank Sparse Learning

KAUST Repository

Zhang, Tianzhu

2014-06-19

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

Sparse dictionary learning of resting state fMRI networks.

Science.gov (United States)

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

2012-07-02

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

Low-Rank Sparse Coding for Image Classification

KAUST Repository

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

2013-01-01

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

Low-Rank Sparse Coding for Image Classification

KAUST Repository

Zhang, Tianzhu

2013-12-01

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

An ensemble based nonlinear orthogonal matching pursuit algorithm for sparse history matching of reservoir models

KAUST Repository

Fsheikh, Ahmed H.

2013-01-01

A nonlinear orthogonal matching pursuit (NOMP) for sparse calibration of reservoir models is presented. Sparse calibration is a challenging problem as the unknowns are both the non-zero components of the solution and their associated weights. NOMP is a greedy algorithm that discovers at each iteration the most correlated components of the basis functions with the residual. The discovered basis (aka support) is augmented across the nonlinear iterations. Once the basis functions are selected from the dictionary, the solution is obtained by applying Tikhonov regularization. The proposed algorithm relies on approximate gradient estimation using an iterative stochastic ensemble method (ISEM). ISEM utilizes an ensemble of directional derivatives to efficiently approximate gradients. In the current study, the search space is parameterized using an overcomplete dictionary of basis functions built using the K-SVD algorithm.

Online sparse representation for remote sensing compressed-sensed video sampling

Science.gov (United States)

Wang, Jie; Liu, Kun; Li, Sheng-liang; Zhang, Li

2014-11-01

Most recently, an emerging Compressed Sensing (CS) theory has brought a major breakthrough for data acquisition and recovery. It asserts that a signal, which is highly compressible in a known basis, can be reconstructed with high probability through sampling frequency which is well below Nyquist Sampling Frequency. When applying CS to Remote Sensing (RS) Video imaging, it can directly and efficiently acquire compressed image data by randomly projecting original data to obtain linear and non-adaptive measurements. In this paper, with the help of distributed video coding scheme which is a low-complexity technique for resource limited sensors, the frames of a RS video sequence are divided into Key frames (K frames) and Non-Key frames (CS frames). In other words, the input video sequence consists of many groups of pictures (GOPs) and each GOP consists of one K frame followed by several CS frames. Both of them are measured based on block, but at different sampling rates. In this way, the major encoding computation burden will be shifted to the decoder. At the decoder, the Side Information (SI) is generated for the CS frames using traditional Motion-Compensated Interpolation (MCI) technique according to the reconstructed key frames. The over-complete dictionary is trained by dictionary learning methods based on SI. These learning methods include ICA-like, PCA, K-SVD, MOD, etc. Using these dictionaries, the CS frames could be reconstructed according to sparse-land model. In the numerical experiments, the reconstruction performance of ICA algorithm, which is often evaluated by Peak Signal-to-Noise Ratio (PSNR), has been made compared with other online sparse representation algorithms. The simulation results show its advantages in reducing reconstruction time and robustness in reconstruction performance when applying ICA algorithm to remote sensing video reconstruction.

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

DEFF Research Database (Denmark)

Han, Xixuan; Clemmensen, Line Katrine Harder

2015-01-01

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

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

Science.gov (United States)

Zubair, M.; Ghose, M.

1992-01-01

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

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

Science.gov (United States)

Kim, Sang-Yoon; Lim, Woochang

2015-08-01

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

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

Science.gov (United States)

Kim, Sang-Yoon; Lim, Woochang

2015-08-01

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

Heart Attack Recovery FAQs

Science.gov (United States)

... recommendations to make a full recovery. View an animation of a heart attack . Heart Attack Recovery Questions ... Support Network Popular Articles 1 Understanding Blood Pressure Readings 2 Sodium and Salt 3 Heart Attack Symptoms ...

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

Directory of Open Access Journals (Sweden)

Chanzi Liu

2016-01-01

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

Detection of Pitting in Gears Using a Deep Sparse Autoencoder

Directory of Open Access Journals (Sweden)

Yongzhi Qu

2017-05-01

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

In-Storage Embedded Accelerator for Sparse Pattern Processing

OpenAIRE

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

2016-01-01

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

Process Knowledge Discovery Using Sparse Principal Component Analysis

DEFF Research Database (Denmark)

Gao, Huihui; Gajjar, Shriram; Kulahci, Murat

2016-01-01

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

Massively parallel sparse matrix function calculations with NTPoly

Science.gov (United States)

Dawson, William; Nakajima, Takahito

2018-04-01

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

Deformable segmentation via sparse representation and dictionary learning.

Science.gov (United States)

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

2012-10-01

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

Combinatorial Algorithms for Computing Column Space Bases ThatHave Sparse Inverses

Energy Technology Data Exchange (ETDEWEB)

Pinar, Ali; Chow, Edmond; Pothen, Alex

2005-03-18

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

Contracts for field projects and supporting research on enhanced oil recovery, October--December 1992. Progress review No. 73, quarter ending December 31, 1992

Energy Technology Data Exchange (ETDEWEB)

1993-12-01

Accomplishments for this quarter ending December 31, 1992 are presented for the following tasks: chemical flooding--supporting research; gas displacement--supporting research; thermal recovery--supporting research; geoscience technology; resource assessment technology; microbial technology; reservoir classes; and novel technology.

Image Super-Resolution Algorithm Based on an Improved Sparse Autoencoder

Directory of Open Access Journals (Sweden)

Detian Huang

2018-01-01

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

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

DEFF Research Database (Denmark)

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

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

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

International Nuclear Information System (INIS)

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

2000-01-01

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

RECIPROCAL RESPONSIBILITY AND SOCIAL SUPPORT AMONG WOMEN IN SUBSTANCE USE RECOVERY.

Science.gov (United States)

Brereton, Kate L; Alvarez, Josefina; Jason, Leonard A; Stevens, Edward B; Dyson, Vida B; McNeilly, Catherine; Ferrari, Joseph R

2014-01-01

This study sought to identify individual- and house-level predictors of women's employment, education, and retention in self-run recovery homes. Data from a national study of 292 women in Oxford House, an international organization of recovery homes grounded on self-help/mutual aid and 12-step principles were analyzed. Results indicated that the house's Reciprocal Responsibility predicted number of days of paid work. Individual and house variables did not predict participation in education. The presence of recovery home members in personal social networks was statistically significant in predicting retention in the recovery home. Lastly, results indicated that number of days of paid work were not predictive of likelihood of substance use in the next 12 months. The findings of this study indicate that the ability to develop social networks and Reciprocal Responsibility in recovery homes can contribute to positive outcomes for women.

A Projected Conjugate Gradient Method for Sparse Minimax Problems

DEFF Research Database (Denmark)

Madsen, Kaj; Jonasson, Kristjan

1993-01-01

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

Identification of MIMO systems with sparse transfer function coefficients

Science.gov (United States)

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

2012-12-01

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

MULTISCALE SPARSE APPEARANCE MODELING AND SIMULATION OF PATHOLOGICAL DEFORMATIONS

Directory of Open Access Journals (Sweden)

Rami Zewail

2017-08-01

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

Sparse principal component analysis in medical shape modeling

Science.gov (United States)

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

2006-03-01

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

Inference algorithms and learning theory for Bayesian sparse factor analysis

International Nuclear Information System (INIS)

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

2009-01-01

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

Inference algorithms and learning theory for Bayesian sparse factor analysis

Energy Technology Data Exchange (ETDEWEB)

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

2009-12-01

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

Contracts for field projects and supporting research on enhanced oil recovery, July--September 1992. Progress review No. 72, quarter ending September 30, 1992

Energy Technology Data Exchange (ETDEWEB)

1993-09-01

Accomplishments for the past quarter are presented for the following tasks: Chemical flooding--supporting research; gas displacement--supporting research; thermal recovery--supporting research; geoscience technology; resource assessment technology; microbial technology; and novel technology. A list of available publication is also provided.

Universal Regularizers For Robust Sparse Coding and Modeling

OpenAIRE

Ramirez, Ignacio; Sapiro, Guillermo

2010-01-01

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

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

Science.gov (United States)

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

2017-04-01

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

Hierarchical Bayesian sparse image reconstruction with application to MRFM.

Science.gov (United States)

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

2009-09-01

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

Contracts for field projects and supporting research on enhanced oil recovery. Progress review number 86, quarter ending March 31, 1996

Energy Technology Data Exchange (ETDEWEB)

NONE

1997-05-01

Summaries are presented for 37 enhanced oil recovery contracts being supported by the Department of Energy. The projects are grouped into gas displacement methods, thermal recovery methods, geoscience technology, reservoir characterization, and field demonstrations in high-priority reservoir classes. Each summary includes the objectives of the project and a summary of the technical progress, as well as information on contract dates, size of award, principal investigator, and company or facility doing the research.

BOES: Building Occupancy Estimation System using sparse ambient vibration monitoring

Science.gov (United States)

Pan, Shijia; Bonde, Amelie; Jing, Jie; Zhang, Lin; Zhang, Pei; Noh, Hae Young

2014-04-01

In this paper, we present a room-level building occupancy estimation system (BOES) utilizing low-resolution vibration sensors that are sparsely distributed. Many ubiquitous computing and building maintenance systems require fine-grained occupancy knowledge to enable occupant centric services and optimize space and energy utilization. The sensing infrastructure support for current occupancy estimation systems often requires multiple intrusive sensors per room, resulting in systems that are both costly to deploy and difficult to maintain. To address these shortcomings, we developed BOES. BOES utilizes sparse vibration sensors to track occupancy levels and activities. Our system has three major components. 1) It extracts features that distinguish occupant activities from noise prone ambient vibrations and detects human footsteps. 2) Using a sequence of footsteps, the system localizes and tracks individuals by observing changes in the sequences. It uses this tracking information to identify when an occupant leaves or enters a room. 3) The entering and leaving room information are combined with detected individual location information to update the room-level occupancy state of the building. Through validation experiments in two different buildings, our system was able to achieve 99.55% accuracy for event detection, less than three feet average error for localization, and 85% accuracy in occupancy counting.

Robust Fringe Projection Profilometry via Sparse Representation.

Science.gov (United States)

Budianto; Lun, Daniel P K

2016-04-01

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

Role of spared pathways in locomotor recovery after body-weight-supported treadmill training in contused rats.

Science.gov (United States)

Singh, Anita; Balasubramanian, Sriram; Murray, Marion; Lemay, Michel; Houle, John

2011-12-01

Body-weight-supported treadmill training (BWSTT)-related locomotor recovery has been shown in spinalized animals. Only a few animal studies have demonstrated locomotor recovery after BWSTT in an incomplete spinal cord injury (SCI) model, such as contusion injury. The contribution of spared descending pathways after BWSTT to behavioral recovery is unclear. Our goal was to evaluate locomotor recovery in contused rats after BWSTT, and to study the role of spared pathways in spinal plasticity after BWSTT. Forty-eight rats received a contusion, a transection, or a contusion followed at 9 weeks by a second transection injury. Half of the animals in the three injury groups were given BWSTT for up to 8 weeks. Kinematics and the Basso-Beattie-Bresnahan (BBB) test assessed behavioral improvements. Changes in Hoffmann-reflex (H-reflex) rate depression property, soleus muscle mass, and sprouting of primary afferent fibers were also evaluated. BWSTT-contused animals showed accelerated locomotor recovery, improved H-reflex properties, reduced muscle atrophy, and decreased sprouting of small caliber afferent fibers. BBB scores were not improved by BWSTT. Untrained contused rats that received a transection exhibited a decrease in kinematic parameters immediately after the transection; in contrast, trained contused rats did not show an immediate decrease in kinematic parameters after transection. This suggests that BWSTT with spared descending pathways leads to neuroplasticity at the lumbar spinal level that is capable of maintaining locomotor activity. Discontinuing training after the transection in the trained contused rats abolished the improved kinematics within 2 weeks and led to a reversal of the improved H-reflex response, increased muscle atrophy, and an increase in primary afferent fiber sprouting. Thus continued training may be required for maintenance of the recovery. Transected animals had no effect of BWSTT, indicating that in the absence of spared pathways this

Learning dictionaries of sparse codes of 3D movements of body joints for real-time human activity understanding.

Science.gov (United States)

Qi, Jin; Yang, Zhiyong

2014-01-01

Real-time human activity recognition is essential for human-robot interactions for assisted healthy independent living. Most previous work in this area is performed on traditional two-dimensional (2D) videos and both global and local methods have been used. Since 2D videos are sensitive to changes of lighting condition, view angle, and scale, researchers begun to explore applications of 3D information in human activity understanding in recently years. Unfortunately, features that work well on 2D videos usually don't perform well on 3D videos and there is no consensus on what 3D features should be used. Here we propose a model of human activity recognition based on 3D movements of body joints. Our method has three steps, learning dictionaries of sparse codes of 3D movements of joints, sparse coding, and classification. In the first step, space-time volumes of 3D movements of body joints are obtained via dense sampling and independent component analysis is then performed to construct a dictionary of sparse codes for each activity. In the second step, the space-time volumes are projected to the dictionaries and a set of sparse histograms of the projection coefficients are constructed as feature representations of the activities. Finally, the sparse histograms are used as inputs to a support vector machine to recognize human activities. We tested this model on three databases of human activities and found that it outperforms the state-of-the-art algorithms. Thus, this model can be used for real-time human activity recognition in many applications.

Learning dictionaries of sparse codes of 3D movements of body joints for real-time human activity understanding.

Directory of Open Access Journals (Sweden)

Jin Qi

Full Text Available Real-time human activity recognition is essential for human-robot interactions for assisted healthy independent living. Most previous work in this area is performed on traditional two-dimensional (2D videos and both global and local methods have been used. Since 2D videos are sensitive to changes of lighting condition, view angle, and scale, researchers begun to explore applications of 3D information in human activity understanding in recently years. Unfortunately, features that work well on 2D videos usually don't perform well on 3D videos and there is no consensus on what 3D features should be used. Here we propose a model of human activity recognition based on 3D movements of body joints. Our method has three steps, learning dictionaries of sparse codes of 3D movements of joints, sparse coding, and classification. In the first step, space-time volumes of 3D movements of body joints are obtained via dense sampling and independent component analysis is then performed to construct a dictionary of sparse codes for each activity. In the second step, the space-time volumes are projected to the dictionaries and a set of sparse histograms of the projection coefficients are constructed as feature representations of the activities. Finally, the sparse histograms are used as inputs to a support vector machine to recognize human activities. We tested this model on three databases of human activities and found that it outperforms the state-of-the-art algorithms. Thus, this model can be used for real-time human activity recognition in many applications.

Sparse DOA estimation with polynomial rooting

DEFF Research Database (Denmark)

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

2015-01-01

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

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

Science.gov (United States)

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

2014-02-01

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

Activities of the Oil Implementation Task Force, reporting period March--August 1991; Contracts for field projects and supporting research on enhanced oil recovery, reporting period October--December 1990

Energy Technology Data Exchange (ETDEWEB)

1991-10-01

Activities of DOE's Oil Implementation Task Force for the period March--August 1991 are reviewed. Contracts for fields projects and supporting research on enhanced oil recovery are discussed, with a list of related publications given. Enhanced recovery processes covered include chemical flooding, gas displacement, thermal recovery, and microbial recovery.

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

Science.gov (United States)

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

2016-12-01

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

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

Science.gov (United States)

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

2015-04-01

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

A Discussion of Oxygen Recovery Definitions and Key Performance Parameters for Closed-Loop Atmosphere Revitalization Life Support Technology Development

Science.gov (United States)

Abney, Morgan B.; Perry, Jay L.

2016-01-01

Over the last 55 years, NASA has evolved life support for crewed space exploration vehicles from simple resupply during Project Mercury to the complex and highly integrated system of systems aboard the International Space Station. As NASA targets exploration destinations farther from low Earth orbit and mission durations of 500 to 1000 days, life support systems must evolve to meet new requirements. In addition to having more robust, reliable, and maintainable hardware, limiting resupply becomes critical for managing mission logistics and cost. Supplying a crew with the basics of food, water, and oxygen become more challenging as the destination ventures further from Earth. Aboard ISS the Atmosphere Revitalization Subsystem (ARS) supplies the crew's oxygen demand by electrolyzing water. This approach makes water a primary logistics commodity that must be managed carefully. Chemical reduction of metabolic carbon dioxide (CO2) provides a method of recycling oxygen thereby reducing the net ARS water demand and therefore minimizing logistics needs. Multiple methods have been proposed to achieve this recovery and have been reported in the literature. However, depending on the architecture and the technology approach, "oxygen recovery" can be defined in various ways. This discontinuity makes it difficult to compare technologies directly. In an effort to clarify community discussions of Oxygen Recovery, we propose specific definitions and describe the methodology used to arrive at those definitions. Additionally, we discuss key performance parameters for Oxygen Recovery technology development including challenges with comparisons to state-of-the-art.

Library designs for generic C++ sparse matrix computations of iterative methods

Energy Technology Data Exchange (ETDEWEB)

Pozo, R.

1996-12-31

A new library design is presented for generic sparse matrix C++ objects for use in iterative algorithms and preconditioners. This design extends previous work on C++ numerical libraries by providing a framework in which efficient algorithms can be written *independent* of the matrix layout or format. That is, rather than supporting different codes for each (element type) / (matrix format) combination, only one version of the algorithm need be maintained. This not only reduces the effort for library developers, but also simplifies the calling interface seen by library users. Furthermore, the underlying matrix library can be naturally extended to support user-defined objects, such as hierarchical block-structured matrices, or application-specific preconditioners. Utilizing optimized kernels whenever possible, the resulting performance of such framework can be shown to be competitive with optimized Fortran programs.

Low-rank sparse learning for robust visual tracking

KAUST Repository

Zhang, Tianzhu

2012-01-01

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

A little goes a long way: the impact of distal social support on community integration and recovery of individuals with psychiatric disabilities.

Science.gov (United States)

Townley, Greg; Miller, Henry; Kloos, Bret

2013-09-01

Although an extensive body of literature highlights the important role of social support for individuals with psychiatric disabilities, definitions of support tend to be restricted-focusing on intimate relationships such as friend and family networks and ignoring the role of casual relationships existing naturally in the community. This mixed-methods study of 300 consumers of mental health services in the Southeastern US aims to better understand the impact of community supports, termed distal supports, on community integration and recovery from mental illness. Qualitative content analysis, tests of group mean differences, and hierarchical linear regression analyses revealed the following: (1) participants primarily reported receiving tangible support (e.g., free medication/discounted goods) from distal supports rather than emotional support (e.g., displays of warmth/affection) or informational support (e.g., provision of advice); (2) women and older participants reported more distal supports than men or younger participants; and (3) distal supports played a unique role in predicting community integration and recovery even after accounting for the influence of traditional support networks. Results highlight the importance of considering diverse types of social support in naturally occurring settings when designing treatment plans and interventions aimed at encouraging community participation and adaptive functioning for individuals with psychiatric disabilities.

Sparse Reconstruction of Regional Gravity Signal Based on Stabilized Orthogonal Matching Pursuit (SOMP)

Science.gov (United States)

Saadat, S. A.; Safari, A.; Needell, D.

2016-06-01

The main role of gravity field recovery is the study of dynamic processes in the interior of the Earth especially in exploration geophysics. In this paper, the Stabilized Orthogonal Matching Pursuit (SOMP) algorithm is introduced for sparse reconstruction of regional gravity signals of the Earth. In practical applications, ill-posed problems may be encountered regarding unknown parameters that are sensitive to the data perturbations. Therefore, an appropriate regularization method needs to be applied to find a stabilized solution. The SOMP algorithm aims to regularize the norm of the solution vector, while also minimizing the norm of the corresponding residual vector. In this procedure, a convergence point of the algorithm that specifies optimal sparsity-level of the problem is determined. The results show that the SOMP algorithm finds the stabilized solution for the ill-posed problem at the optimal sparsity-level, improving upon existing sparsity based approaches.

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

Science.gov (United States)

Li, Shutao; Yin, Haitao; Fang, Leyuan

2012-12-01

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

Sparse electromagnetic imaging using nonlinear iterative shrinkage thresholding

KAUST Repository

Desmal, Abdulla; Bagci, Hakan

2015-01-01

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

Sparse electromagnetic imaging using nonlinear iterative shrinkage thresholding

KAUST Repository

Desmal, Abdulla

2015-04-13

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

On the Automatic Parallelization of Sparse and Irregular Fortran Programs

Directory of Open Access Journals (Sweden)

Yuan Lin

1999-01-01

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

Split-Bregman-based sparse-view CT reconstruction

Energy Technology Data Exchange (ETDEWEB)

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

2011-07-01

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

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

DEFF Research Database (Denmark)

Liu, Weifeng; Vinter, Brian

2015-01-01

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

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

Science.gov (United States)

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

2017-08-29

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

Bridge to recovery in two cases of dilated cardiomyopathy after long-term mechanical circulatory support

OpenAIRE

Pacholewicz, Jerzy; Zakliczy?ski, Micha?; Kowalik, Violetta; Nadziakiewicz, Pawe?; Kowalski, Oskar; Kalarus, Zbigniew; Zembala, Marian

2014-01-01

Ventricular assist devices (VADs) have become an established therapeutic option for patients with end-stage heart failure. Achieving the potential for recovery of native heart function using VADs is an established form of treatment in a selected group of patients with HF. We report two cases of VAD patients with different types of pump used for mechanical circulatory support, a continuous flow pump (Heart-Ware?) and a pulsatile pump (POLVAD MEV?), which allow regeneration of the native heart....

Sparse matrix test collections

Energy Technology Data Exchange (ETDEWEB)

Duff, I.

1996-12-31

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

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

KAUST Repository

Labschutz, Matthias

2015-08-12

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

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

KAUST Repository

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

2015-01-01

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

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

Science.gov (United States)

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

2016-01-01

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

Uncovering Transcriptional Regulatory Networks by Sparse Bayesian Factor Model

Directory of Open Access Journals (Sweden)

Qi Yuan(Alan

2010-01-01

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

30 CFR 75.207 - Pillar recovery.

Science.gov (United States)

2010-07-01

... SAFETY STANDARDS-UNDERGROUND COAL MINES Roof Support § 75.207 Pillar recovery. Pillar recovery shall be... be left in place. (b) Before mining is started in a pillar split or lift— (1) At least two rows of breaker posts or equivalent support shall be installed— (i) As close to the initial intended breakline as...

Houston Recovery Initiative: A Rich Case Study of Building Recovery Communities One Voice at a Time.

Science.gov (United States)

Bitting, Sara; Nash, Angela; Ochoa, Ashley

2016-01-01

Recovery from alcohol and drug problems is a process of change through which an individual achieves control and improved quality of life. Recovery is a primary goal for individuals with substance use disorder as it provides hope that treatment and overall health are possible for every individual. More than 23 million Americans are in recovery from addiction to alcohol and other drugs.Recovery-oriented systems of care (ROSC) are networks of community services and peer support that help individuals and families achieve recovery from substances and improve overall health. ROSC is a strengths-based and person-centered model that leverages existing community resources to address the needs of individuals and families as they progress through the journey of recovery. The ROSC model serves as the foundation of the Houston Recovery Initiative (HRI).The purpose of this article is to describe the history, development, and infrastructure of the HRI, which is a volunteer collaboration whose main goal is to educate the community on recovery and broaden the recovery safety net for people with substance use disorder in Houston, Texas. Since 2010, the HRI has grown to include more than 200 agencies across the spectrum of treatment and recovery support services in Houston so as to provide a resource for the community. Herein, we detail efforts to grow the HRI, lessons learned, future plans, and resources needed to move the HRI forward.

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

Directory of Open Access Journals (Sweden)

Li Jun-Bao

2017-06-01

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

Compact data structure and scalable algorithms for the sparse grid technique

KAUST Repository

Murarasu, Alin

2011-01-01

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

Multisnapshot Sparse Bayesian Learning for DOA

DEFF Research Database (Denmark)

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

2016-01-01

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

Continuous speech recognition with sparse coding

CSIR Research Space (South Africa)

Smit, WJ

2009-04-01

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

A density functional for sparse matter

DEFF Research Database (Denmark)

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

2009-01-01

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

Sparse learning of stochastic dynamical equations

Science.gov (United States)

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

2018-06-01

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

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

Science.gov (United States)

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

2006-12-22

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

Multiple instance learning tracking method with local sparse representation

KAUST Repository

Xie, Chengjun

2013-10-01

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

Sparse linear models: Variational approximate inference and Bayesian experimental design

International Nuclear Information System (INIS)

Seeger, Matthias W

2009-01-01

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

Sparse linear models: Variational approximate inference and Bayesian experimental design

Energy Technology Data Exchange (ETDEWEB)

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

2009-12-01

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

Discriminative object tracking via sparse representation and online dictionary learning.

Science.gov (United States)

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

2014-04-01

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

Recovery High Schools: Opportunities for Support and Personal Growth for Students in Recovery

Science.gov (United States)

Finch, Andrew; Wegman, Holly

2012-01-01

The time right after treatment for substance abuse is a particularly vulnerable time for adolescents; a time made more difficult by the expectation that they will return to their high school. Traditional high schools are often a high-risk environment for students who are working on maintaining their sobriety. Recovery schools offer an alternative…

Role of self-efficacy and social support in short-term recovery after total hip replacement: a prospective cohort study.

NARCIS (Netherlands)

Brembo, E.A.; Kapstad, H.; Dulmen, S. van; Eide, H.

2017-01-01

Background: Despite the overall success of total hip replacement (THR) in patients with symptomatic osteoarthritis (OA), up to one-quarter of patients report suboptimal recovery. The aim of this study was to determine whether social support and general self-efficacy predict variability in short-term

Recovery in soccer : part ii-recovery strategies.

Science.gov (United States)

Nédélec, Mathieu; McCall, Alan; Carling, Chris; Legall, Franck; Berthoin, Serge; Dupont, Gregory

2013-01-01

now do not significantly accelerate the return to initial levels of performance in comparison with a control condition. In conclusion, scientific evidence to support the use of strategies commonly used during recovery is lacking. Additional research is required in this area in order to help practitioners establish an efficient recovery protocol immediately after matchplay, but also for the following days. Future studies could focus on the chronic effects of recovery strategies, on combinations of recovery protocols and on the effects of recovery strategies inducing an anti-inflammatory or a pro-inflammatory response.

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

KAUST Repository

Murarasu, Alin; Weidendorfer, Josef

2012-01-01

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

Jointly-check iterative decoding algorithm for quantum sparse graph codes

International Nuclear Information System (INIS)

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

2010-01-01

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

Rotational image deblurring with sparse matrices

DEFF Research Database (Denmark)

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

2014-01-01

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

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

Science.gov (United States)

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

2011-05-06

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

Ecosystem Considerations for Postdisaster Recovery: Lessons from China, Pakistan, and Elsewhere for Recovery Planning in Haiti

Directory of Open Access Journals (Sweden)

Susan A. Mainka

2011-03-01

Full Text Available As the world joins forces to support the people of Haiti on their long road of recovery following the January 2010 earthquake, plans and strategies should take into consideration past experiences from other postdisaster recovery efforts with respect to integrating ecosystem considerations. Sound ecosystem management can both support the medium and long-term needs for recovery as well as help to buffer the impacts of future extreme natural events, which for Haiti are likely to include both hurricanes and earthquakes. An additional challenge will be to include the potential impacts of climate change into ecosystem management strategies.

Disaster recovery using VMware vSphere Replication and vCenter Site Recovery Manager

CERN Document Server

GB, Abhilash

2014-01-01

This is a step-by-step guide that will help you understand disaster recovery using VMware vSphere Replication 5.5 and VMware vCenter Site Recovery Manager (SRM) 5.5. The topics and configuration procedures are accompanied with relevant screenshots, flowcharts, and logical diagrams that makes grasping the concepts easier. This book is a guide for anyone who is keen on using vSphere Replication or vCenter Site Recovery Manager as a disaster recovery solution. This is an excellent handbook for solution architects, administrators, on-field engineers, and support professionals. Although the book as

Sparse Representation Denoising for Radar High Resolution Range Profiling

Directory of Open Access Journals (Sweden)

Min Li

2014-01-01

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

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

Directory of Open Access Journals (Sweden)

Tao Chen

2016-05-01

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

Automatic Camera Orientation and Structure Recovery with Samantha

Science.gov (United States)

Gherardi, R.; Toldo, R.; Garro, V.; Fusiello, A.

2011-09-01

SAMANTHA is a software capable of computing camera orientation and structure recovery from a sparse block of casual images without human intervention. It can process both calibrated images or uncalibrated, in which case an autocalibration routine is run. Pictures are organized into a hierarchical tree which has single images as leaves and partial reconstructions as internal nodes. The method proceeds bottom up until it reaches the root node, corresponding to the final result. This framework is one order of magnitude faster than sequential approaches, inherently parallel, less sensitive to the error accumulation causing drift. We have verified the quality of our reconstructions both qualitatively producing compelling point clouds and quantitatively, comparing them with laser scans serving as ground truth.

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

Directory of Open Access Journals (Sweden)

Dongdong eLin

2014-10-01

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

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

Science.gov (United States)

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

2018-03-01

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

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

OpenAIRE

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

2017-01-01

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

Development of Support Service for Prevention and Recovery from Dementia and Science of Lethe

Science.gov (United States)

Otake, Mihoko

Purpose of this study is to explore service design method through the development of support service for prevention and recovery from dementia towards science of lethe. We designed and implemented conversation support service via coimagination method based on multiscale service design method, both were proposed by the author. Multiscale service model consists of tool, event, human, network, style and rule. Service elements at different scales are developed according to the model. Interactive conversation supported by coimagination method activates cognitive functions so as to prevent progress of dementia. This paper proposes theoretical bases for science of lethe. Firstly, relationship among coimagination method and three cognitive functions including division of attention, planning, episodic memory which decline at mild cognitive imparement. Secondly, thought state transition model during conversation which describes cognitive enhancement via interactive communication. Thirdly, Set Theoretical Measure of Interaction is proposed for evaluating effectiveness of conversation to cognitive enhancement. Simulation result suggests that the ideas which cannot be explored by each speaker are explored during interactive conversation. Finally, coimagination method compared with reminiscence therapy and its possibility for collaboration is discussed.

Fast Solution in Sparse LDA for Binary Classification

Science.gov (United States)

Moghaddam, Baback

2010-01-01

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

Experience of Wellness Recovery Action Planning in Self-Help and Mutual Support Groups for People with Lived Experience of Mental Health Difficulties

Directory of Open Access Journals (Sweden)

Rebekah Pratt

2013-01-01

Full Text Available The main aim of this research was to assess the relevance and impact of wellness recovery action planning (WRAP as a tool for self-management and wellness planning by individuals with mental health problems from pre-existing and newly formed groups, where the possibilities for continued mutual support in the development of WRAPs could be explored. Interviews and focus groups were conducted and pre-post recovery outcome measures completed (Recovery Assessment Scale and Warwick Edinburgh Mental Well Being Scale. 21 WRAP group participants took part in the research. The WRAP approach, used in groups and delivered by trained facilitators who could also share their lived experience, was very relevant and appeared to have a positive impact on many of the participants. The impact on participants varied from learning more about recovery and developing improved self-awareness to integrating a WRAP approach into daily life. The apparent positive impact of WRAP delivered in the context of mutual support groups indicates that it should be given serious consideration as a unique and worthwhile option for improving mental health. WRAP groups could make a significant contribution to the range of self-management options that are available for improving mental health and well-being.

Robust visual tracking via multiscale deep sparse networks

Science.gov (United States)

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

2017-04-01

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

Efficient MATLAB computations with sparse and factored tensors.

Energy Technology Data Exchange (ETDEWEB)

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

2006-12-01

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

Subspace Based Blind Sparse Channel Estimation

DEFF Research Database (Denmark)

Hayashi, Kazunori; Matsushima, Hiroki; Sakai, Hideaki

2012-01-01

The paper proposes a subspace based blind sparse channel estimation method using 1–2 optimization by replacing the 2–norm minimization in the conventional subspace based method by the 1–norm minimization problem. Numerical results confirm that the proposed method can significantly improve...

Fabric defect detection based on visual saliency using deep feature and low-rank recovery

Science.gov (United States)

Liu, Zhoufeng; Wang, Baorui; Li, Chunlei; Li, Bicao; Dong, Yan

2018-04-01

Fabric defect detection plays an important role in improving the quality of fabric product. In this paper, a novel fabric defect detection method based on visual saliency using deep feature and low-rank recovery was proposed. First, unsupervised training is carried out by the initial network parameters based on MNIST large datasets. The supervised fine-tuning of fabric image library based on Convolutional Neural Networks (CNNs) is implemented, and then more accurate deep neural network model is generated. Second, the fabric images are uniformly divided into the image block with the same size, then we extract their multi-layer deep features using the trained deep network. Thereafter, all the extracted features are concentrated into a feature matrix. Third, low-rank matrix recovery is adopted to divide the feature matrix into the low-rank matrix which indicates the background and the sparse matrix which indicates the salient defect. In the end, the iterative optimal threshold segmentation algorithm is utilized to segment the saliency maps generated by the sparse matrix to locate the fabric defect area. Experimental results demonstrate that the feature extracted by CNN is more suitable for characterizing the fabric texture than the traditional LBP, HOG and other hand-crafted features extraction method, and the proposed method can accurately detect the defect regions of various fabric defects, even for the image with complex texture.

Practical security and privacy attacks against biometric hashing using sparse recovery

Science.gov (United States)

Topcu, Berkay; Karabat, Cagatay; Azadmanesh, Matin; Erdogan, Hakan

2016-12-01

Biometric hashing is a cancelable biometric verification method that has received research interest recently. This method can be considered as a two-factor authentication method which combines a personal password (or secret key) with a biometric to obtain a secure binary template which is used for authentication. We present novel practical security and privacy attacks against biometric hashing when the attacker is assumed to know the user's password in order to quantify the additional protection due to biometrics when the password is compromised. We present four methods that can reconstruct a biometric feature and/or the image from a hash and one method which can find the closest biometric data (i.e., face image) from a database. Two of the reconstruction methods are based on 1-bit compressed sensing signal reconstruction for which the data acquisition scenario is very similar to biometric hashing. Previous literature introduced simple attack methods, but we show that we can achieve higher level of security threats using compressed sensing recovery techniques. In addition, we present privacy attacks which reconstruct a biometric image which resembles the original image. We quantify the performance of the attacks using detection error tradeoff curves and equal error rates under advanced attack scenarios. We show that conventional biometric hashing methods suffer from high security and privacy leaks under practical attacks, and we believe more advanced hash generation methods are necessary to avoid these attacks.

Sparse grid techniques for particle-in-cell schemes

Science.gov (United States)

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

2017-02-01

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

Service users' expectations of treatment and support at the Community Mental Health Centre in their recovery.

Science.gov (United States)

Biringer, Eva; Davidson, Larry; Sundfør, Bengt; Ruud, Torleif; Borg, Marit

2017-09-01

Focus on service users' needs, coping and empowerment, user involvement, and comprehensiveness are supposed to be key elements of the Community Mental Health Centres in Norway. Taking a user-oriented approach means acknowledging the individual's own expectations, aims and hopes. However, studies that have investigated service users' expectations of treatment and support at Community Mental Health Centres are hard to find. The aim of the study was therefore to explore service users' expectations at the start of treatment at a Community Mental Health Centre. Within a collaborative framework, taking a hermeneutic-phenomenological approach, ten service users participated in in-depth interviews about their expectations, hopes and aims for treatment and recovery. The participants sought help due to various mental health issues that had interfered with their lives and created disability and suffering. A data-driven stepwise approach in line with thematic analysis was used. The study was approved by the Norwegian Social Science Data Services. The following four main themes representing participants' expectations at the start of treatment were elicited: hope for recovery, developing understanding, finding tools for coping and receiving counselling and practical assistance. Participants' expectations about treatment were tightly interwoven with their personal aims and hopes for their future life, and expectations were often related to practical and financial problems, the solution of which being deemed necessary to gain a safe basis for recovery in the long run. The transferability of the results may be limited by the small number of participants. The study emphasises how important it is that service users' personal aims and expectations guide the collaborative treatment process. In addition to providing treatment aimed at improving symptoms, Community Mental Health Centres should take a more comprehensive approach than today by providing more support with family issues

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

KAUST Repository

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

2014-01-01

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

In Dogs With a European Adder Bite, Does the Use of Antivenom With Supportive Treatment Compared to Supportive Treatment Alone Improve Time to Recovery?

Directory of Open Access Journals (Sweden)

Lindsay Hodgson

2017-11-01

Full Text Available The current literature does not offer convincing evidence for the positive effect of antivenom on time to recovery in dogs envenomated by the European adder. It appears that the use of antivenom in addition to supportive treatment may positively affect local swelling if given within 24 hours of the bite, but the evidence is low quality and further studies are required before a more definitive answer can be reached.

Group sparse canonical correlation analysis for genomic data integration.

Science.gov (United States)

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

2013-08-12

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

Mixing in 3D Sparse Multi-Scale Grid Generated Turbulence

Science.gov (United States)

Usama, Syed; Kopec, Jacek; Tellez, Jackson; Kwiatkowski, Kamil; Redondo, Jose; Malik, Nadeem

2017-04-01

from the 3DSGT by the time of the conference. {Acknowledgements}: This work has been supported partly by the EuHIT grant, 'Turbulence Generated by Sparse 3D Multi-Scale Grid (M3SG)', 2017. {References} [1] S. Laizet, J. C. Vassilicos. DNS of Fractal-Generated Turbulence. Flow Turbulence Combust 87:673705, (2011). [2] N. A. Malik. Sparse 3D Multi-Scale Grid Turbulence Generator. USPTO Application no. 14/710,531, Patent Pending, (2015). [3] J. Tellez, M. Gomez, B. Russo, J.M. Redondo. Surface Flow Image Velocimetry (SFIV) for hydraulics applications. 18th Int. Symposium on the Application of Laser Imaging Techniques in Fluid Mechanics, Lisbon, Portugal (2016).

Codesign of Beam Pattern and Sparse Frequency Waveforms for MIMO Radar

Directory of Open Access Journals (Sweden)

Chaoyun Mai

2015-01-01

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

Battleground Energy Recovery Project

Energy Technology Data Exchange (ETDEWEB)

Bullock, Daniel [USDOE Gulf Coast Clean Energy Application Center, Woodlands, TX (United States)

2011-12-31

In October 2009, the project partners began a 36-month effort to develop an innovative, commercial-scale demonstration project incorporating state-of-the-art waste heat recovery technology at Clean Harbors, Inc., a large hazardous waste incinerator site located in Deer Park, Texas. With financial support provided by the U.S. Department of Energy, the Battleground Energy Recovery Project was launched to advance waste heat recovery solutions into the hazardous waste incineration market, an area that has seen little adoption of heat recovery in the United States. The goal of the project was to accelerate the use of energy-efficient, waste heat recovery technology as an alternative means to produce steam for industrial processes. The project had three main engineering and business objectives: Prove Feasibility of Waste Heat Recovery Technology at a Hazardous Waste Incinerator Complex; Provide Low-cost Steam to a Major Polypropylene Plant Using Waste Heat; and Create a Showcase Waste Heat Recovery Demonstration Project.

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

Science.gov (United States)

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

2017-12-01

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

Comparison of sparse point distribution models

DEFF Research Database (Denmark)

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

2010-01-01

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

Galaxy redshift surveys with sparse sampling

International Nuclear Information System (INIS)

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

2013-01-01

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

A Multiobjective Sparse Feature Learning Model for Deep Neural Networks.

Science.gov (United States)

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

2015-12-01

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

Sparse Matrix for ECG Identification with Two-Lead Features

Directory of Open Access Journals (Sweden)

Kuo-Kun Tseng

2015-01-01

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

Image Fusion of CT and MR with Sparse Representation in NSST Domain

Directory of Open Access Journals (Sweden)

Chenhui Qiu

2017-01-01

Full Text Available Multimodal image fusion techniques can integrate the information from different medical images to get an informative image that is more suitable for joint diagnosis, preoperative planning, intraoperative guidance, and interventional treatment. Fusing images of CT and different MR modalities are studied in this paper. Firstly, the CT and MR images are both transformed to nonsubsampled shearlet transform (NSST domain. So the low-frequency components and high-frequency components are obtained. Then the high-frequency components are merged using the absolute-maximum rule, while the low-frequency components are merged by a sparse representation- (SR- based approach. And the dynamic group sparsity recovery (DGSR algorithm is proposed to improve the performance of the SR-based approach. Finally, the fused image is obtained by performing the inverse NSST on the merged components. The proposed fusion method is tested on a number of clinical CT and MR images and compared with several popular image fusion methods. The experimental results demonstrate that the proposed fusion method can provide better fusion results in terms of subjective quality and objective evaluation.

PERIOD ESTIMATION FOR SPARSELY SAMPLED QUASI-PERIODIC LIGHT CURVES APPLIED TO MIRAS

Energy Technology Data Exchange (ETDEWEB)

He, Shiyuan; Huang, Jianhua Z.; Long, James [Department of Statistics, Texas A and M University, College Station, TX (United States); Yuan, Wenlong; Macri, Lucas M., E-mail: lmacri@tamu.edu [George P. and Cynthia W. Mitchell Institute for Fundamental Physics and Astronomy, Department of Physics and Astronomy, Texas A and M University, College Station, TX (United States)

2016-12-01

We develop a nonlinear semi-parametric Gaussian process model to estimate periods of Miras with sparsely sampled light curves. The model uses a sinusoidal basis for the periodic variation and a Gaussian process for the stochastic changes. We use maximum likelihood to estimate the period and the parameters of the Gaussian process, while integrating out the effects of other nuisance parameters in the model with respect to a suitable prior distribution obtained from earlier studies. Since the likelihood is highly multimodal for period, we implement a hybrid method that applies the quasi-Newton algorithm for Gaussian process parameters and search the period/frequency parameter space over a dense grid. A large-scale, high-fidelity simulation is conducted to mimic the sampling quality of Mira light curves obtained by the M33 Synoptic Stellar Survey. The simulated data set is publicly available and can serve as a testbed for future evaluation of different period estimation methods. The semi-parametric model outperforms an existing algorithm on this simulated test data set as measured by period recovery rate and quality of the resulting period–luminosity relations.

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

KAUST Repository

Buse, Gerrit

2012-06-01

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

Support of enhanced oil recovery to independent producers in Texas. Quarterly technical progress report, July 1, 1995--September 30, 1995

Energy Technology Data Exchange (ETDEWEB)

Fotouh, K.H.

1995-09-30

The main objective of this project is to support independent oil producers in Texas and to improve the productivity of marginal wells utilizing enhanced oil recovery techniques. The main task carried out this quarter was the generation of an electronic data base.

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

Science.gov (United States)

Jakeman, J. D.; Wildey, T.

2015-01-01

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

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

International Nuclear Information System (INIS)

Jakeman, J.D.; Wildey, T.

2015-01-01

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

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

Science.gov (United States)

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

2015-01-01

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

Messages of Hope: Using Positive Stories of Survival to Assist Recovery in Rwanda

Directory of Open Access Journals (Sweden)

Girish Lala

2014-08-01

Full Text Available For the past twenty years, the overriding story of Rwanda has been centred around the events and consequences of the genocide. In Rwanda, public expressions of that story have occurred in the gacaca courts, where survivors and perpetrators testified about their experiences and actions, during ongoing annual remembrance and mourning commemorations, and in memorial sites across the country that act as physical reminders of the genocide. While important as mechanisms for justice, testimony, and commemoration, on their own such events and installations also have the potential to re-traumatise. Accordingly, Rwandan agencies have encouraged a focus on the future as the overarching theme of recent national commemorations. Yet, opportunities for Rwandans to recount and disseminate positive, future-oriented stories of survival and healing remain sparse. Creation and awareness of positive stories have the potential to assist in recovery by increasing feelings of hope and efficacy; and recent research has demonstrated the value of hopefulness, well-being, and social support for vulnerable people. The Messages of Hope program seeks to leverage those ideas into a framework for generating positive messages by Rwandan survivors, providing an opportunity for everyday Rwandans to record and transmit their own positive stories of survival to demonstrate recovery and growth after the genocide, and to reinforce connectedness by sharing their challenges and aspirations. We describe the development and early implementation of this initiative and its potential longer-term application in other contexts of vulnerability.

Many-core graph analytics using accelerated sparse linear algebra routines

Science.gov (United States)

Kozacik, Stephen; Paolini, Aaron L.; Fox, Paul; Kelmelis, Eric

2016-05-01

Graph analytics is a key component in identifying emerging trends and threats in many real-world applications. Largescale graph analytics frameworks provide a convenient and highly-scalable platform for developing algorithms to analyze large datasets. Although conceptually scalable, these techniques exhibit poor performance on modern computational hardware. Another model of graph computation has emerged that promises improved performance and scalability by using abstract linear algebra operations as the basis for graph analysis as laid out by the GraphBLAS standard. By using sparse linear algebra as the basis, existing highly efficient algorithms can be adapted to perform computations on the graph. This approach, however, is often less intuitive to graph analytics experts, who are accustomed to vertex-centric APIs such as Giraph, GraphX, and Tinkerpop. We are developing an implementation of the high-level operations supported by these APIs in terms of linear algebra operations. This implementation is be backed by many-core implementations of the fundamental GraphBLAS operations required, and offers the advantages of both the intuitive programming model of a vertex-centric API and the performance of a sparse linear algebra implementation. This technology can reduce the number of nodes required, as well as the run-time for a graph analysis problem, enabling customers to perform more complex analysis with less hardware at lower cost. All of this can be accomplished without the requirement for the customer to make any changes to their analytics code, thanks to the compatibility with existing graph APIs.

Pedestrian detection from thermal images: A sparse representation based approach

Science.gov (United States)

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

2016-05-01

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

Multi-Objective Validation of SWAT for Sparsely-Gauged West African River Basins—A Remote Sensing Approach

Directory of Open Access Journals (Sweden)

Thomas Poméon

2018-04-01

Full Text Available Predicting freshwater resources is a major concern in West Africa, where large parts of the population depend on rain-fed subsistence agriculture. However, a steady decline in the availability of in-situ measurements of climatic and hydrologic variables makes it difficult to simulate water resource availability with hydrological models. In this study, a modeling framework was set up for sparsely-gauged catchments in West Africa using the Soil and Water Assessment Tool (SWAT, whilst largely relying on remote sensing and reanalysis inputs. The model was calibrated using two different strategies and validated using discharge measurements. New in this study is the use of a multi-objective validation conducted to further investigate the performance of the model, where simulated actual evapotranspiration, soil moisture, and total water storage were evaluated using remote sensing data. Results show that the model performs well (R2 calibration: 0.52 and 0.51; R2 validation: 0.63 and 0.61 and the multi-objective validation reveals good agreement between predictions and observations. The study reveals the potential of using remote sensing data in sparsely-gauged catchments, resulting in good performance and providing data for evaluating water balance components that are not usually validated. The modeling framework presented in this study is the basis for future studies, which will address model response to extreme drought and flood events and further examine the coincidence with Gravity Recovery and Climate Experiment (GRACE total water storage retrievals.

SPARSE ELECTROMAGNETIC IMAGING USING NONLINEAR LANDWEBER ITERATIONS

KAUST Repository

Desmal, Abdulla; Bagci, Hakan

2015-01-01

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

Multiuser TOA Estimation Algorithm in DS-CDMA Sparse Channel for Radiolocation

Science.gov (United States)

Kim, Sunwoo

This letter considers multiuser time delay estimation in a sparse channel environment for radiolocation. The generalized successive interference cancellation (GSIC) algorithm is used to eliminate the multiple access interference (MAI). To adapt GSIC to sparse channels the alternating maximization (AM) algorithm is considered, and the continuous time delay of each path is estimated without requiring a priori known data sequences.

Ethnicity and cultural models of recovery from breast cancer.

Science.gov (United States)

Coreil, Jeannine; Corvin, Jaime A; Nupp, Rebecca; Dyer, Karen; Noble, Charlotte

2012-01-01

Recovery narratives describe the culturally shared understandings about the ideal or desirable way to recover from an illness experience. This paper examines ethnic differences in recovery narratives among women participating in breast cancer support groups in Central Florida, USA. It compares groups serving African-American, Latina, and European American women, with the objective of better understanding the appeal of ethnic-specific illness support groups for culturally diverse populations. A mixed-method study design combined qualitative and quantitative measures, including in-depth interviews, participant observation at support group meetings, collection of printed documents, and a structured survey. Core elements of the recovery narrative drew from the dominant societal cancer discourse of optimism and personal transformation through adversity; however, important ethnic differences were evident in the meaning assigned to these themes. Groups gave distinctive salience to themes of faith and spirituality, empowerment through the migration experience, and becoming a better person through the journey of recovery. The findings suggest that ethnic cancer support groups draw upon dominant societal discourses about cancer, but they espouse distinctive recovery narratives that are consonant with the groups' cultural models of illness. Similarity between ethnic members' individual recovery narratives and that of the group may contribute to the appeal of ethnic illness support groups for culturally diverse populations.

Changing practice to support self-management and recovery in mental illness: application of an implementation model.

Science.gov (United States)

Harris, Melanie; Jones, Phil; Heartfield, Marie; Allstrom, Mary; Hancock, Janette; Lawn, Sharon; Battersby, Malcolm

2015-01-01

Health services introducing practice changes need effective implementation methods. Within the setting of a community mental health service offering recovery-oriented psychosocial support for people with mental illness, we aimed to: (i) identify a well-founded implementation model; and (ii) assess its practical usefulness in introducing a new programme for recovery-oriented self-management support. We reviewed the literature to identify implementation models applicable to community mental health organisations, and that also had corresponding measurement tools. We used one of these models to inform organisational change strategies. The literature review showed few models with corresponding tools. The Promoting Action on Research Implementation in Health Services (PARIHS) model and the related Organisational Readiness to Change Assessment (ORCA) tool were used. The PARIHS proposes prerequisites for health service change and the ORCA measures the extent to which these prerequisites are present. Application of the ORCA at two time points during implementation of the new programme showed strategy-related gains for some prerequisites but not for others, reflecting observed implementation progress. Additional strategies to address target prerequisites could be drawn from the PARIHS model. The PARIHS model and ORCA tool have potential in designing and monitoring practice change strategies in community mental health organisations. Further practical use and testing of implementation models appears justified in overcoming barriers to change.

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

International Nuclear Information System (INIS)

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

2013-01-01

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

Applying Strengths Model principles to build a rural community-based mental health support service and achieve recovery outcomes.

Science.gov (United States)

Dunstan, Debra; Anderson, Donnah

2018-02-01

The Personal Helpers and Mentors (PHaMs) service is a non-clinical, community-based Australian Government initiative aimed at increasing opportunities for recovery for people whose lives are severely affected by mental illness. Using a strengths-based recovery model, PHaMs caseworkers support and mentor people 'at risk of falling through the gaps' between state funded clinical treatment services and federally funded social services (such as supported housing, education and employment). While there is evidence that PHaMs realises its aim in metropolitan areas, little is known about how services are developed and function in low resource rural settings and what outcomes are achieved. These questions were addressed in a case study of a PHaMs service in a rural town in the state of New South Wales, Australia. Data were collected from two sources: local service documents prepared for staff orientation and operational purposes, and records and reports of service participants\\' performance and achievements. Participants\\' gains in wellbeing, recovery goals, and the target outcome areas of increased access to services, increased personal capacity and self-reliance, and increased community participation, were gathered from self-reports. The Role Functioning Scale was used as a measure of caseworker ratings of participants\\' adaptive functioning. The qualitative data were examined for semantic content and underlying themes. The quantitative analyses involved repeated measures and between-groups comparisons of uncontrolled pre-test–post-test and retrospective pre-test data. From commencement of the service in October 2009 to June 2014, an estimated 31% of the people living with severe mental illness in the local government area had accessed the PHaMs service (N=126; mean age 31.9 years; 42% male, 27% Aboriginal). The document analysis revealed that despite a lack of detail on how a PHaMs service should be developed or delivered, by focusing on the goal of client recovery

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

DEFF Research Database (Denmark)

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

2007-01-01

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

Quantification of localized vertebral deformities using a sparse wavelet-based shape model.

Science.gov (United States)

Zewail, R; Elsafi, A; Durdle, N

2008-01-01

Medical experts often examine hundreds of spine x-ray images to determine existence of various pathologies. Common pathologies of interest are anterior osteophites, disc space narrowing, and wedging. By careful inspection of the outline shapes of the vertebral bodies, experts are able to identify and assess vertebral abnormalities with respect to the pathology under investigation. In this paper, we present a novel method for quantification of vertebral deformation using a sparse shape model. Using wavelets and Independent component analysis (ICA), we construct a sparse shape model that benefits from the approximation power of wavelets and the capability of ICA to capture higher order statistics in wavelet space. The new model is able to capture localized pathology-related shape deformations, hence it allows for quantification of vertebral shape variations. We investigate the capability of the model to predict localized pathology related deformations. Next, using support-vector machines, we demonstrate the diagnostic capabilities of the method through the discrimination of anterior osteophites in lumbar vertebrae. Experiments were conducted using a set of 150 contours from digital x-ray images of lumbar spine. Each vertebra is labeled as normal or abnormal. Results reported in this work focus on anterior osteophites as the pathology of interest.

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

Directory of Open Access Journals (Sweden)

Jacquelyn A Shelton

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

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

Science.gov (United States)

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

2016-10-01

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

Compressed sensing & sparse filtering

CERN Document Server

Carmi, Avishy Y; Godsill, Simon J

2013-01-01

This book is aimed at presenting concepts, methods and algorithms ableto cope with undersampled and limited data. One such trend that recently gained popularity and to some extent revolutionised signal processing is compressed sensing. Compressed sensing builds upon the observation that many signals in nature are nearly sparse (or compressible, as they are normally referred to) in some domain, and consequently they can be reconstructed to within high accuracy from far fewer observations than traditionally held to be necessary. Apart from compressed sensing this book contains other related app

Example-Based Image Colorization Using Locality Consistent Sparse Representation.

Science.gov (United States)

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

2017-11-01

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

Dose-shaping using targeted sparse optimization

International Nuclear Information System (INIS)

Sayre, George A.; Ruan, Dan

2013-01-01

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

Dose-shaping using targeted sparse optimization.

Science.gov (United States)

Sayre, George A; Ruan, Dan

2013-07-01

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

Signal Sampling for Efficient Sparse Representation of Resting State FMRI Data

Science.gov (United States)

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

2015-01-01

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

Feature based omnidirectional sparse visual path following

OpenAIRE

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

2005-01-01

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

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

KAUST Repository

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

2012-01-01

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

Recovery and money management.

Science.gov (United States)

Rowe, Michael; Serowik, Kristin L; Ablondi, Karen; Wilber, Charles; Rosen, Marc I

2013-06-01

Social recovery and external money management are important approaches in contemporary mental health care, but little research has been done on the relationship between the two or on application of recovery principles to money management for people at risk of being assigned a representative payee or conservator. Out of 49 total qualitative interviews, 25 transcripts with persons receiving Social Security insurance or Social Security disability insurance who were at risk of being assigned a money manager were analyzed to assess the presence of recognized recovery themes. The recovery principles of self-direction and responsibility were strong themes in participant comments related to money management. Money management interventions should incorporate peoples' recovery-related motivations to acquire financial management skills as a means to direct and assume responsibility for one's finances. Staff involved in money management should receive training to support client's recovery-related goals. (PsycINFO Database Record (c) 2013 APA, all rights reserved).

New methods for sampling sparse populations

Science.gov (United States)

Anna Ringvall

2007-01-01

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

Recovery of cesium from nuclear waste using hollow fibre supported liquid membrane containing calix[4]arene-bis-(2,3-naphtho)-crown-6

International Nuclear Information System (INIS)

Kandwal, P.; Mohapatra, P.K.; Ansari, S.A.; Manchanda, Vijay K.

2011-01-01

Transport behaviour of cesium through hollow fibre supported liquid membrane (HFSLM) containing calix[4]arenebis-(2,3-naphtho)-crown-6 (CNC) as carrier extractant, has been investigated under various experimental conditions. At tracer concentration of cesium, > 99% recovery of cesium was achieved from 3M HNO 3 solution to distilled water with 1 mM of CNC in 80% NPOE + 20 % n-dodecane mixture. Effect of feed phase acidity, ligand concentration, metal ion concentration etc. has been investigated. Recovery of cesium from Pressurized Heavy Water Reactor Simulated High Level Waste (PHWR-SHLW) using 1 mM CNC dissolved proposed diluent as the extractant, was carried out and it was found that it takes 12 hours of continuous operation for 88% recovery of metal ion. Nevertheless, the complete recovery of cesium from SHLW was possible after neutralization of strip phase acidity with NaOH. (author)

AUTOMATIC CAMERA ORIENTATION AND STRUCTURE RECOVERY WITH SAMANTHA

Directory of Open Access Journals (Sweden)

R. Gherardi

2012-09-01

Full Text Available SAMANTHA is a software capable of computing camera orientation and structure recovery from a sparse block of casual images without human intervention. It can process both calibrated images or uncalibrated, in which case an autocalibration routine is run. Pictures are organized into a hierarchical tree which has single images as leaves and partial reconstructions as internal nodes. The method proceeds bottom up until it reaches the root node, corresponding to the final result. This framework is one order of magnitude faster than sequential approaches, inherently parallel, less sensitive to the error accumulation causing drift. We have verified the quality of our reconstructions both qualitatively producing compelling point clouds and quantitatively, comparing them with laser scans serving as ground truth.

Dynamical analysis of Schrodinger operators with growing sparse potentials

CERN Document Server

Tcheremchantsev, S

2003-01-01

We consider Scr\\"odinger operators in l^2(Z^+) with potentials of the form V(n)=S(n)+Q(n). Here S is a sparse potential: S(n)=n^{1-\\eta \\over 2 \\eta}, 0<\\eta <1, for n=L_N and S(n)=0 else, where L_N is a very fast growing sequence. The real function Q(n) is compactly supported. We give a rather complete description of the (time-averaged) dynamics exp(-itH) \\psi for different initial states \\psi. In particular, for some \\psi we calculate explicitely the "intermittency function" \\beta_\\psi^- (p) which turns out to be nonconstant. As a particular corollary of obtained results, we show that the spectral measure restricted to (-2,2) has exact Hausdorff dimension \\eta for all boundary conditions, improving the result of Jitomirskaya and Last.

Balanced and sparse Tamo-Barg codes

KAUST Repository

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

2017-01-01

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

Balanced and sparse Tamo-Barg codes

KAUST Repository

Halbawi, Wael

2017-08-29

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

Relaxations to Sparse Optimization Problems and Applications

Science.gov (United States)

Skau, Erik West

Parsimony is a fundamental property that is applied to many characteristics in a variety of fields. Of particular interest are optimization problems that apply rank, dimensionality, or support in a parsimonious manner. In this thesis we study some optimization problems and their relaxations, and focus on properties and qualities of the solutions of these problems. The Gramian tensor decomposition problem attempts to decompose a symmetric tensor as a sum of rank one tensors.We approach the Gramian tensor decomposition problem with a relaxation to a semidefinite program. We study conditions which ensure that the solution of the relaxed semidefinite problem gives the minimal Gramian rank decomposition. Sparse representations with learned dictionaries are one of the leading image modeling techniques for image restoration. When learning these dictionaries from a set of training images, the sparsity parameter of the dictionary learning algorithm strongly influences the content of the dictionary atoms.We describe geometrically the content of trained dictionaries and how it changes with the sparsity parameter.We use statistical analysis to characterize how the different content is used in sparse representations. Finally, a method to control the structure of the dictionaries is demonstrated, allowing us to learn a dictionary which can later be tailored for specific applications. Variations of dictionary learning can be broadly applied to a variety of applications.We explore a pansharpening problem with a triple factorization variant of coupled dictionary learning. Another application of dictionary learning is computer vision. Computer vision relies heavily on object detection, which we explore with a hierarchical convolutional dictionary learning model. Data fusion of disparate modalities is a growing topic of interest.We do a case study to demonstrate the benefit of using social media data with satellite imagery to estimate hazard extents. In this case study analysis we

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

Directory of Open Access Journals (Sweden)

Tamar Friedlander

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

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

Science.gov (United States)

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

2013-11-06

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

The Roles of Sparse Direct Methods in Large-scale Simulations

Energy Technology Data Exchange (ETDEWEB)

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

2005-06-27

Sparse systems of linear equations and eigen-equations arise at the heart of many large-scale, vital simulations in DOE. Examples include the Accelerator Science and Technology SciDAC (Omega3P code, electromagnetic problem), the Center for Extended Magnetohydrodynamic Modeling SciDAC(NIMROD and M3D-C1 codes, fusion plasma simulation). The Terascale Optimal PDE Simulations (TOPS)is providing high-performance sparse direct solvers, which have had significant impacts on these applications. Over the past several years, we have been working closely with the other SciDAC teams to solve their large, sparse matrix problems arising from discretization of the partial differential equations. Most of these systems are very ill-conditioned, resulting in extremely poor convergence deployed our direct methods techniques in these applications, which achieved significant scientific results as well as performance gains. These successes were made possible through the SciDAC model of computer scientists and application scientists working together to take full advantage of terascale computing systems and new algorithms research.

The Roles of Sparse Direct Methods in Large-scale Simulations

International Nuclear Information System (INIS)

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

2005-01-01

Sparse systems of linear equations and eigen-equations arise at the heart of many large-scale, vital simulations in DOE. Examples include the Accelerator Science and Technology SciDAC (Omega3P code, electromagnetic problem), the Center for Extended Magnetohydrodynamic Modeling SciDAC(NIMROD and M3D-C1 codes, fusion plasma simulation). The Terascale Optimal PDE Simulations (TOPS)is providing high-performance sparse direct solvers, which have had significant impacts on these applications. Over the past several years, we have been working closely with the other SciDAC teams to solve their large, sparse matrix problems arising from discretization of the partial differential equations. Most of these systems are very ill-conditioned, resulting in extremely poor convergence deployed our direct methods techniques in these applications, which achieved significant scientific results as well as performance gains. These successes were made possible through the SciDAC model of computer scientists and application scientists working together to take full advantage of terascale computing systems and new algorithms research

Sparse logistic principal components analysis for binary data

KAUST Repository

Lee, Seokho

2010-09-01

We develop a new principal components analysis (PCA) type dimension reduction method for binary data. Different from the standard PCA which is defined on the observed data, the proposed PCA is defined on the logit transform of the success probabilities of the binary observations. Sparsity is introduced to the principal component (PC) loading vectors for enhanced interpretability and more stable extraction of the principal components. Our sparse PCA is formulated as solving an optimization problem with a criterion function motivated from a penalized Bernoulli likelihood. A Majorization-Minimization algorithm is developed to efficiently solve the optimization problem. The effectiveness of the proposed sparse logistic PCA method is illustrated by application to a single nucleotide polymorphism data set and a simulation study. © Institute ol Mathematical Statistics, 2010.

Perceptions about recovery needs and drug-avoidance recovery behaviors among youth in substance abuse treatment.

Science.gov (United States)

Gonzales, Rachel; Anglin, M Douglas; Glik, Deborah C; Zavalza, Christina

2013-01-01

This study used mixed methods to explore youth attitudes about recovery-related needs and important drug-avoidance behaviors after treatment. Focus groups were conducted with 118 substance using youth in treatment (four residential and 10 outpatient settings) throughout Los Angeles County. The average age was 17.4 (SD = 2.9); 78.3% were male, 66.1% Latino; and most were in treatment for primary marijuana (40.9%) or methamphetamine (30.4%) abuse. Quantitatve results from the drug-avoidance activity survey identified the following factors youth rated as important to their recovery after treatment: lifestyle improvement activities (95.7%); changing personal drug behaviors (89.6%); drug environment/culture change activities (82.5%); with the least important being therapeutic activities (78.5%). Qualitative findings from focus groups that asked what youth think are important for recovery programs to address after treatment revealed the following four areas: (1) recovery promotion to developmentally appropriate activities (95%); (2) facilitating the use of coping skills to deal with stress (85%); (3) offering alternative recovery support options (not just abstinence only) (75%); and (4) continuing to provide substance use education (65%). Findings highlight essential aspects of recovery in terms of need and drug-avoidance behaviors considered important to youth in treatment. Such information will help to better address clinical and recovery support models aimed at relapse prevention to ensure that the perceived problems of substance-abusing youth are adequately met.

The Stigma of Mental Illness and Recovery.

Science.gov (United States)

Avdibegović, Esmina; Hasanović, Mevludin

2017-12-01

Stigma and recovery "from" and "in" mental illness are associated in many various ways. While recovery gives opportunities, makes person stronger, gives purpose and meaning to their lives and leads to social inclusion, in the same time stigma reduces opportunities, reduces self-esteem and self-efficacy, reduces the belief in own abilities and contributes to social exclusion through discrimination. The recovery of a person with mental illness means to get and keep hope, to understand their own possibilities and impossibilities, active living, to be autonomous, to have a social identity and to give meaning and purpose of our own lives. The care system, recovery-oriented, provides help and support to people with mental disorders in his/her recovery, which contributes to reduction of self-stigma, to the elimination of stigmatizing attitudes and beliefs in mental health services which consequently may have a positive reflection in reducing the stigma of mental illness in the community. It is important to look at the stigma and recovery from the perspective of individual experience of each person with a mental illness in the process of recovery. A support to the recovery concept and the development of a recovery-oriented system of care should be one of the key segments of any strategy to combat the stigma of mental illness. Also, the cultural and the social stigma aspects of stigma would be taken into account in the developing of the recovery concept and on the recovery-oriented care system.

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

Energy Technology Data Exchange (ETDEWEB)

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

2015-11-30

In this paper we propose the theory of decomposition, methods, technologies, applications and implementation in Wol-fram Mathematica for the constructing the solutions of the sparse linear systems. One of the applications is the Sensor Location Problem for the symmetric graph in the case when split ratios of some arc flows can be zeros. The objective of that application is to minimize the number of sensors that are assigned to the nodes. We obtain a sparse system of linear algebraic equations and research its matrix rank. Sparse systems of these types appear in generalized network flow programming problems in the form of restrictions and can be characterized as systems with a large sparse sub-matrix representing the embedded network structure.

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

International Nuclear Information System (INIS)

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

2015-01-01

In this paper we propose the theory of decomposition, methods, technologies, applications and implementation in Wol-fram Mathematica for the constructing the solutions of the sparse linear systems. One of the applications is the Sensor Location Problem for the symmetric graph in the case when split ratios of some arc flows can be zeros. The objective of that application is to minimize the number of sensors that are assigned to the nodes. We obtain a sparse system of linear algebraic equations and research its matrix rank. Sparse systems of these types appear in generalized network flow programming problems in the form of restrictions and can be characterized as systems with a large sparse sub-matrix representing the embedded network structure

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

Directory of Open Access Journals (Sweden)

Qi Jia

2015-03-01

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

Face recognition via sparse representation of SIFT feature on hexagonal-sampling image

Science.gov (United States)

Zhang, Daming; Zhang, Xueyong; Li, Lu; Liu, Huayong

2018-04-01

This paper investigates a face recognition approach based on Scale Invariant Feature Transform (SIFT) feature and sparse representation. The approach takes advantage of SIFT which is local feature other than holistic feature in classical Sparse Representation based Classification (SRC) algorithm and possesses strong robustness to expression, pose and illumination variations. Since hexagonal image has more inherit merits than square image to make recognition process more efficient, we extract SIFT keypoint in hexagonal-sampling image. Instead of matching SIFT feature, firstly the sparse representation of each SIFT keypoint is given according the constructed dictionary; secondly these sparse vectors are quantized according dictionary; finally each face image is represented by a histogram and these so-called Bag-of-Words vectors are classified by SVM. Due to use of local feature, the proposed method achieves better result even when the number of training sample is small. In the experiments, the proposed method gave higher face recognition rather than other methods in ORL and Yale B face databases; also, the effectiveness of the hexagonal-sampling in the proposed method is verified.

Low-rank sparse learning for robust visual tracking

KAUST Repository

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

2012-01-01

In this paper, we propose a new particle-filter based tracking algorithm that exploits the relationship between particles (candidate targets). By representing particles as sparse linear combinations of dictionary templates, this algorithm

An algorithm for 3D target scatterer feature estimation from sparse SAR apertures

Science.gov (United States)

Jackson, Julie Ann; Moses, Randolph L.

2009-05-01

We present an algorithm for extracting 3D canonical scattering features from complex targets observed over sparse 3D SAR apertures. The algorithm begins with complex phase history data and ends with a set of geometrical features describing the scene. The algorithm provides a pragmatic approach to initialization of a nonlinear feature estimation scheme, using regularization methods to deconvolve the point spread function and obtain sparse 3D images. Regions of high energy are detected in the sparse images, providing location initializations for scattering center estimates. A single canonical scattering feature, corresponding to a geometric shape primitive, is fit to each region via nonlinear optimization of fit error between the regularized data and parametric canonical scattering models. Results of the algorithm are presented using 3D scattering prediction data of a simple scene for both a densely-sampled and a sparsely-sampled SAR measurement aperture.

An Improved Information Hiding Method Based on Sparse Representation

Directory of Open Access Journals (Sweden)

Minghai Yao

2015-01-01

Full Text Available A novel biometric authentication information hiding method based on the sparse representation is proposed for enhancing the security of biometric information transmitted in the network. In order to make good use of abundant information of the cover image, the sparse representation method is adopted to exploit the correlation between the cover and biometric images. Thus, the biometric image is divided into two parts. The first part is the reconstructed image, and the other part is the residual image. The biometric authentication image cannot be restored by any one part. The residual image and sparse representation coefficients are embedded into the cover image. Then, for the sake of causing much less attention of attackers, the visual attention mechanism is employed to select embedding location and embedding sequence of secret information. Finally, the reversible watermarking algorithm based on histogram is utilized for embedding the secret information. For verifying the validity of the algorithm, the PolyU multispectral palmprint and the CASIA iris databases are used as biometric information. The experimental results show that the proposed method exhibits good security, invisibility, and high capacity.

The recovery paradigm - a model of hope and change for alcohol and drug addiction.

Science.gov (United States)

Best, David W; Lubman, Dan I

2012-08-01

Alcohol and drug disorders remain major health and social problems in Australia, contributing enormously to the global burden of disease and the everyday practice of primary care. A recent growth in recovery research and recovery focused policies are starting to have an impact in Australia, with implications for how we attempt to resolve these problems. In this article we discuss recent international findings in recovery research, and explore their implications for primary care. Research indicates that over half of dependent substance users will eventually achieve stable recovery. Key predictors of recovery are active engagement in the community and immersion in peer support groups and activities. Recovery requires a twin track approach: enabling and supporting individual recovery journeys, while creating environmental conditions that enable and support a 'social contagion' of recovery, in which recovery is transmitted through supportive social networks and dedicated recovery groups, such as mutual aid.

Sparse reconstruction by means of the standard Tikhonov regularization

International Nuclear Information System (INIS)

Lu Shuai; Pereverzev, Sergei V

2008-01-01

It is a common belief that Tikhonov scheme with || · ||L 2 -penalty fails in sparse reconstruction. We are going to show, however, that this standard regularization can help if the stability measured in L 1 -norm will be properly taken into account in the choice of the regularization parameter. The crucial point is that now a stability bound may depend on the bases with respect to which the solution of the problem is assumed to be sparse. We discuss how such a stability can be estimated numerically and present the results of computational experiments giving the evidence of the reliability of our approach.

Sparse modeling applied to patient identification for safety in medical physics applications

Science.gov (United States)

Lewkowitz, Stephanie

Every scheduled treatment at a radiation therapy clinic involves a series of safety protocol to ensure the utmost patient care. Despite safety protocol, on a rare occasion an entirely preventable medical event, an accident, may occur. Delivering a treatment plan to the wrong patient is preventable, yet still is a clinically documented error. This research describes a computational method to identify patients with a novel machine learning technique to combat misadministration. The patient identification program stores face and fingerprint data for each patient. New, unlabeled data from those patients are categorized according to the library. The categorization of data by this face-fingerprint detector is accomplished with new machine learning algorithms based on Sparse Modeling that have already begun transforming the foundation of Computer Vision. Previous patient recognition software required special subroutines for faces and different tailored subroutines for fingerprints. In this research, the same exact model is used for both fingerprints and faces, without any additional subroutines and even without adjusting the two hyperparameters. Sparse modeling is a powerful tool, already shown utility in the areas of super-resolution, denoising, inpainting, demosaicing, and sub-nyquist sampling, i.e. compressed sensing. Sparse Modeling is possible because natural images are inherently sparse in some bases, due to their inherent structure. This research chooses datasets of face and fingerprint images to test the patient identification model. The model stores the images of each dataset as a basis (library). One image at a time is removed from the library, and is classified by a sparse code in terms of the remaining library. The Locally Competitive Algorithm, a truly neural inspired Artificial Neural Network, solves the computationally difficult task of finding the sparse code for the test image. The components of the sparse representation vector are summed by ℓ1 pooling

Sparse logistic principal components analysis for binary data

KAUST Repository

Lee, Seokho; Huang, Jianhua Z.; Hu, Jianhua

2010-01-01

with a criterion function motivated from a penalized Bernoulli likelihood. A Majorization-Minimization algorithm is developed to efficiently solve the optimization problem. The effectiveness of the proposed sparse logistic PCA method is illustrated

Early enteral immune nutrition support after radical operation for gastric cancer on promoting the recovery of gastrointestinal function and immune function

Directory of Open Access Journals (Sweden)

Zhi-Gang Li

2016-05-01

Full Text Available Objective: To analyze the effect of early enteral immune nutrition support after radical operation for gastric cancer on the recovery of gastrointestinal function and immune function. Methods: A total of 106 cases of patients received radical operation for gastric cancer in our hospital were selected as research subjects, and according to different ways of postoperative nutrition intervention, all patients were divided into observation group (n=50 and control group (n=56. Control group received conventional enteral nutrition intervention, observation group received postoperative early enteral immune nutrition support, and then differences in postoperative intestinal mucosa barrier function, gastrointestinal hormone levels, immune function levels and nutrition-related indicator values were compared between two groups. Results: After observation group received enteral immune nutrition intervention, serum DAO, PS and D-lactate levels as well as urine L/M ratio were lower than those of control group; serum GAS, CCK, MTL and SP values of observation group after intervention were higher than those of control group, and GLU, VIP, GIP and SS values were lower than those of control group; CD4, IgG, NK cell, C3, C4, CH50 and S-IgA levels of observation group after intervention were higher than those of control group; serum ALB, PRE, TRF and RBP levels of observation group after intervention were higher than those of control group. Conclusion: Early enteral immune nutrition support after radical operation for gastric cancer is conducive to the recovery of gastrointestinal function and the promotion of immune state, eventually promotes patients’ postoperative overall recovery and has active clinical significance.

Mindfulness-Based Cancer Recovery (MBCR) versus Supportive Expressive Group Therapy (SET) for distressed breast cancer survivors: evaluating mindfulness and social support as mediators.

Science.gov (United States)

Schellekens, Melanie P J; Tamagawa, Rie; Labelle, Laura E; Speca, Michael; Stephen, Joanne; Drysdale, Elaine; Sample, Sarah; Pickering, Barbara; Dirkse, Dale; Savage, Linette Lawlor; Carlson, Linda E

2017-06-01

Despite growing evidence in support of mindfulness as an underlying mechanism of mindfulness-based interventions (MBIs), it has been suggested that nonspecific therapeutic factors, such as the experience of social support, may contribute to the positive effects of MBIs. In the present study, we examined whether change in mindfulness and/or social support mediated the effect of Mindfulness-Based Cancer Recovery (MBCR) compared to another active intervention (i.e. Supportive Expressive Group Therapy (SET)), on change in mood disturbance, stress symptoms and quality of life. A secondary analysis was conducted of a multi-site randomized clinical trial investigating the impacts of MBCR and SET on distressed breast cancer survivors (MINDSET). We applied the causal steps approach with bootstrapping to test mediation, using pre- and post-intervention questionnaire data of the participants who were randomised to MBCR (n = 69) or SET (n = 70). MBCR participants improved significantly more on mood disturbance, stress symptoms and social support, but not on quality of life or mindfulness, compared to SET participants. Increased social support partially mediated the impact of MBCR versus SET on mood disturbance and stress symptoms. Because no group differences on mindfulness and quality of life were observed, no mediation analyses were performed on these variables. Findings showed that increased social support was related to more improvement in mood and stress after MBCR compared to support groups, whereas changes in mindfulness were not. This suggests a more important role for social support in enhancing outcomes in MBCR than previously thought.

Surviving ICU: Stories of recovery.

Science.gov (United States)

Ewens, Beverley A; Hendricks, Joyce M; Sundin, Deborah

2018-02-28

The aim of this study was to investigate stories of recovery through the lens of intensive care unit (ICU) survivors. Survival from ICUs is increasing, as are associated physical and psychological complications. Despite the significant impact on survivors, there is inadequate support provision in Australia and world-wide for this population. An interpretive biographical approach of intensive care survivors' experiences of recovery. Data were collected during 2014-2015 from diaries, face to face interviews, memos and field notes. Six participants diarized for 3 months commencing 2 months after hospital discharge. At 5 months, participants were interviewed about the content of their diaries and symbols and signifiers in them to create a shared meaning. Analysis of diaries and interviews were undertaken using two frameworks to identify themes throughout participants' stories and provides a unique portrait of recovery through their individual lens. Participants considered their lives had irreparably changed and yet felt unsupported by a healthcare system that had "saved" them. This view through their lens identified turmoil, which existed between their surface and inner worlds as they struggled to conform to what recovery "should be". The novel biographical methods provided a safe and creative way to reveal survivors' inner thoughts and feelings. Participants' considered creating their stories supported their recovery process and in particular enabled them to reflect on their progress. Findings from this study may lead to increased awareness among health care providers about problems survivors face and improved support services more broadly, based on frameworks appropriate for this population. © 2018 John Wiley & Sons Ltd.

Sparse-View Ultrasound Diffraction Tomography Using Compressed Sensing with Nonuniform FFT

Directory of Open Access Journals (Sweden)

Shaoyan Hua

2014-01-01

Full Text Available Accurate reconstruction of the object from sparse-view sampling data is an appealing issue for ultrasound diffraction tomography (UDT. In this paper, we present a reconstruction method based on compressed sensing framework for sparse-view UDT. Due to the piecewise uniform characteristics of anatomy structures, the total variation is introduced into the cost function to find a more faithful sparse representation of the object. The inverse problem of UDT is iteratively resolved by conjugate gradient with nonuniform fast Fourier transform. Simulation results show the effectiveness of the proposed method that the main characteristics of the object can be properly presented with only 16 views. Compared to interpolation and multiband method, the proposed method can provide higher resolution and lower artifacts with the same view number. The robustness to noise and the computation complexity are also discussed.

Un-bundling payments for radioisotopes from radiopharmaceuticals and from diagnostic procedures: A tool to support the implementation of full-cost recovery - NEA discussion document

International Nuclear Information System (INIS)

2012-09-01

The objective of the NEA's HLG-MR policy approach is to ensure a long-term secure supply. The HLG-MR has determined that to attain that objective, a necessary (but not sufficient) requirement is that irradiation services in the 99 Mo/' 99m Tc supply chain must be provided on a full-cost recovery (FCR) basis (OECD-NEA, 2011). The HLG-MR policy approach also recommended that supply chain participants should implement payment reforms that promote full-cost recovery within their reimbursement systems. Reforms might include separate radioisotope pricing or auditing, separate radioisotope payment, differential radioisotope payment for FCR, or other approaches to promote a complete transition to full-cost recovery. This paper is written to provide a basis for further discussion on the use of separate reimbursement to encourage the move to full-cost recovery. Separate reimbursement is one tool that could be used by public and private health insurance to support the move to ensuring sufficient reimbursement rates (or payments) for 99 Mo/' 99m Tc while the industry moves to full-cost recovery for irradiation services, paying for outage reserve capacity and transitioning to using LEU targets. Other tools are available (such as differential payments, separate radioisotope payments, auditing) that could lead to similar outcomes that support the changes necessary in the 99 Mo/' 99m Tc supply chain to ensure a long-term reliable supply of these important medical isotopes

Optimizing spatial patterns with sparse filter bands for motor-imagery based brain-computer interface.

Science.gov (United States)

Zhang, Yu; Zhou, Guoxu; Jin, Jing; Wang, Xingyu; Cichocki, Andrzej

2015-11-30

Common spatial pattern (CSP) has been most popularly applied to motor-imagery (MI) feature extraction for classification in brain-computer interface (BCI) application. Successful application of CSP depends on the filter band selection to a large degree. However, the most proper band is typically subject-specific and can hardly be determined manually. This study proposes a sparse filter band common spatial pattern (SFBCSP) for optimizing the spatial patterns. SFBCSP estimates CSP features on multiple signals that are filtered from raw EEG data at a set of overlapping bands. The filter bands that result in significant CSP features are then selected in a supervised way by exploiting sparse regression. A support vector machine (SVM) is implemented on the selected features for MI classification. Two public EEG datasets (BCI Competition III dataset IVa and BCI Competition IV IIb) are used to validate the proposed SFBCSP method. Experimental results demonstrate that SFBCSP help improve the classification performance of MI. The optimized spatial patterns by SFBCSP give overall better MI classification accuracy in comparison with several competing methods. The proposed SFBCSP is a potential method for improving the performance of MI-based BCI. Copyright © 2015 Elsevier B.V. All rights reserved.

Linear Regression on Sparse Features for Single-Channel Speech Separation

DEFF Research Database (Denmark)

Schmidt, Mikkel N.; Olsson, Rasmus Kongsgaard

2007-01-01

In this work we address the problem of separating multiple speakers from a single microphone recording. We formulate a linear regression model for estimating each speaker based on features derived from the mixture. The employed feature representation is a sparse, non-negative encoding of the speech...... mixture in terms of pre-learned speaker-dependent dictionaries. Previous work has shown that this feature representation by itself provides some degree of separation. We show that the performance is significantly improved when regression analysis is performed on the sparse, non-negative features, both...

Receiver-based recovery of clipped ofdm signals for papr reduction: A bayesian approach

KAUST Repository

Ali, Anum

2014-01-01

Clipping is one of the simplest peak-to-average power ratio reduction schemes for orthogonal frequency division multiplexing (OFDM). Deliberately clipping the transmission signal degrades system performance, and clipping mitigation is required at the receiver for information restoration. In this paper, we acknowledge the sparse nature of the clipping signal and propose a low-complexity Bayesian clipping estimation scheme. The proposed scheme utilizes a priori information about the sparsity rate and noise variance for enhanced recovery. At the same time, the proposed scheme is robust against inaccurate estimates of the clipping signal statistics. The undistorted phase property of the clipped signal, as well as the clipping likelihood, is utilized for enhanced reconstruction. Furthermore, motivated by the nature of modern OFDM-based communication systems, we extend our clipping reconstruction approach to multiple antenna receivers and multi-user OFDM.We also address the problem of channel estimation from pilots contaminated by the clipping distortion. Numerical findings are presented that depict favorable results for the proposed scheme compared to the established sparse reconstruction schemes.

Sparsity-based multi-height phase recovery in holographic microscopy

KAUST Repository

Rivenson, Yair

2016-11-30

High-resolution imaging of densely connected samples such as pathology slides using digital in-line holographic microscopy requires the acquisition of several holograms, e.g., at >6–8 different sample-to-sensor distances, to achieve robust phase recovery and coherent imaging of specimen. Reducing the number of these holographic measurements would normally result in reconstruction artifacts and loss of image quality, which would be detrimental especially for biomedical and diagnostics-related applications. Inspired by the fact that most natural images are sparse in some domain, here we introduce a sparsity-based phase reconstruction technique implemented in wavelet domain to achieve at least 2-fold reduction in the number of holographic measurements for coherent imaging of densely connected samples with minimal impact on the reconstructed image quality, quantified using a structural similarity index. We demonstrated the success of this approach by imaging Papanicolaou smears and breast cancer tissue slides over a large field-of-view of ~20 mm2 using 2 in-line holograms that are acquired at different sample-to-sensor distances and processed using sparsity-based multi-height phase recovery. This new phase recovery approach that makes use of sparsity can also be extended to other coherent imaging schemes, involving e.g., multiple illumination angles or wavelengths to increase the throughput and speed of coherent imaging.

Sparsity-based multi-height phase recovery in holographic microscopy

Science.gov (United States)

Rivenson, Yair; Wu, Yichen; Wang, Hongda; Zhang, Yibo; Feizi, Alborz; Ozcan, Aydogan

2016-11-01

High-resolution imaging of densely connected samples such as pathology slides using digital in-line holographic microscopy requires the acquisition of several holograms, e.g., at >6-8 different sample-to-sensor distances, to achieve robust phase recovery and coherent imaging of specimen. Reducing the number of these holographic measurements would normally result in reconstruction artifacts and loss of image quality, which would be detrimental especially for biomedical and diagnostics-related applications. Inspired by the fact that most natural images are sparse in some domain, here we introduce a sparsity-based phase reconstruction technique implemented in wavelet domain to achieve at least 2-fold reduction in the number of holographic measurements for coherent imaging of densely connected samples with minimal impact on the reconstructed image quality, quantified using a structural similarity index. We demonstrated the success of this approach by imaging Papanicolaou smears and breast cancer tissue slides over a large field-of-view of ~20 mm2 using 2 in-line holograms that are acquired at different sample-to-sensor distances and processed using sparsity-based multi-height phase recovery. This new phase recovery approach that makes use of sparsity can also be extended to other coherent imaging schemes, involving e.g., multiple illumination angles or wavelengths to increase the throughput and speed of coherent imaging.

A new strategy for weak events in sparse networks: the first-motion polarity solutions constrained by single-station waveform inversion

Czech Academy of Sciences Publication Activity Database

Fojtíková, Lucia; Zahradník, J.

2014-01-01

Roč. 85, č. 6 (2014), s. 1265-1274 ISSN 0895-0695 R&D Projects: GA ČR GAP210/12/2336 Institutional support: RVO:67985891 Keywords : weak events * sparse networks * focal mechanism * waveform inversion Subject RIV: DC - Siesmology, Volcanology, Earth Structure Impact factor: 2.156, year: 2014 http://srl.geoscienceworld.org/content/85/6/1265.full

Quasi optimal and adaptive sparse grids with control variates for PDEs with random diffusion coefficient

KAUST Repository

Tamellini, Lorenzo

2016-01-05

In this talk we discuss possible strategies to minimize the impact of the curse of dimensionality effect when building sparse-grid approximations of a multivariate function u = u(y1, ..., yN ). More precisely, we present a knapsack approach , in which we estimate the cost and the error reduction contribution of each possible component of the sparse grid, and then we choose the components with the highest error reduction /cost ratio. The estimates of the error reduction are obtained by either a mixed a-priori / a-posteriori approach, in which we first derive a theoretical bound and then tune it with some inexpensive auxiliary computations (resulting in the so-called quasi-optimal sparse grids ), or by a fully a-posteriori approach (obtaining the so-called adaptive sparse grids ). This framework is very general and can be used to build quasi-optimal/adaptive sparse grids on bounded and unbounded domains (e.g. u depending on uniform and normal random distributions for yn), using both nested and non-nested families of univariate collocation points. We present some theoretical convergence results as well as numerical results showing the efficiency of the proposed approach for the approximation of the solution of elliptic PDEs with random diffusion coefficients. In this context, to treat the case of rough permeability fields in which a sparse grid approach may not be suitable, we propose to use the sparse grids as a control variate in a Monte Carlo simulation.

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

DEFF Research Database (Denmark)

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

2014-01-01

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

Sparse data structure design for wavelet-based methods

Directory of Open Access Journals (Sweden)

Latu Guillaume

2011-12-01

Full Text Available This course gives an introduction to the design of efficient datatypes for adaptive wavelet-based applications. It presents some code fragments and benchmark technics useful to learn about the design of sparse data structures and adaptive algorithms. Material and practical examples are given, and they provide good introduction for anyone involved in the development of adaptive applications. An answer will be given to the question: how to implement and efficiently use the discrete wavelet transform in computer applications? A focus will be made on time-evolution problems, and use of wavelet-based scheme for adaptively solving partial differential equations (PDE. One crucial issue is that the benefits of the adaptive method in term of algorithmic cost reduction can not be wasted by overheads associated to sparse data management.

Preconditioned Inexact Newton for Nonlinear Sparse Electromagnetic Imaging

KAUST Repository

Desmal, Abdulla; Bagci, Hakan

2014-01-01

with smoothness promoting optimization/regularization schemes. However, this type of regularization schemes are known to perform poorly when applied in imagining domains with sparse content or sharp variations. In this work, an inexact Newton algorithm

Spatially Dispersed Employee Recovery

DEFF Research Database (Denmark)

Hvass, Kristian Anders; Torfadóttir, Embla

2014-01-01

Employee recovery addresses either employee well-being or management's practices in aiding employees in recovering themselves following a service failure. This paper surveys the cabin crew at a small, European, low-cost carrier and investigates employees' perceptions of management practices to aid...... personnel achieve service recovery. Employee recovery within service research often focuses on front-line employees that work in a fixed location, however a contribution to the field is made by investigating the recovery of spatially dispersed personnel, such as operational personnel in the transport sector......, who have a work place away from a fixed or central location and have minimal management contact. Results suggest that the support employees receive from management, such as recognition, information sharing, training, and strategic awareness are all important for spatially dispersed front...

Nutrition to Support Recovery from Endurance Exercise: Optimal Carbohydrate and Protein Replacement.

Science.gov (United States)

Moore, Daniel R

2015-01-01

Proper nutrition is vital to optimize recovery after endurance exercise. Dietary carbohydrate and protein provide the requisite substrates to enhance glycogen resynthesis and remodel skeletal muscle proteins, respectively, both of which would be important to rapidly restore muscle function and performance. With short recovery windows (optimal ingestion of both carbohydrate and protein.

Long-Term Social Reintegration Outcomes for Burn Survivors With and Without Peer Support Attendance: A Life Impact Burn Recovery Evaluation (LIBRE) Study.

Science.gov (United States)

Grieve, Brian; Shapiro, Gabriel D; Wibbenmeyer, Lucy; Acton, Amy; Lee, Austin; Marino, Molly; Jette, Alan; Schneider, Jeffrey C; Kazis, Lewis E; Ryan, Colleen M

2017-10-31

To examine differences in long-term social reintegration outcomes for burn survivors with and without peer support attendance. Cross-sectional survey. Community-dwelling burn survivors. Burn survivors (N=601) aged ≥18 years with injuries to ≥5% total body surface area (TBSA) or burns to critical areas (hands, feet, face, or genitals). Not applicable. The Life Impact Burn Recovery Evaluation Profile was used to examine the following previously validated 6 scale scores of social participation: Family and Friends, Social Interactions, Social Activities, Work and Employment, Romantic Relationships, and Sexual Relationships. Burn support group attendance was reported by 330 (55%) of 596 respondents who responded to this item. Attendees had larger burn size (43.4%±23.6% vs 36.8%±23.4% TBSA burned, P10 years from injury (50% vs 42.5%, Preintegration in burn survivors. This cross-sectional study prompts further exploration into the potential benefits of peer support groups on burn recovery with future intervention studies. Copyright © 2017 American Congress of Rehabilitation Medicine. Published by Elsevier Inc. All rights reserved.

Good recovery from aphasia is also supported by right basal ganglia: a longitudinal controlled PET study. EJPRM-ESPRM 2008 award winner.