Blind Source Separation by Nonnegative Matrix Factorization with Minimum-Volume Constraint

Recently, nonnegative matrix factorization (NMF) attracts more and more attentions for the promising of wide applications. A problem that still remains is that, however, the factors resulted from it may not necessarily be realistically interpretable. Some constraints are usually added to the standard NMF to generate such interpretive results. In this paper, a minimum-volume constrained NMF is proposed and an efficient multiplicative update algorithm is developed based on the natural gradient optimization. The proposed method can be applied to the blind source separation (BSS) problem, a hot topic with many potential applications, especially if the sources are mutually dependent. Simulation results of BSS for images show the superiority of the proposed method.

Blind source separation by fully nonnegative constrained iterative volume maximization

Blind source separation (BSS) has been widely discussed in many real applications. Recently, under the assumption that both of the sources and the mixing matrix are nonnegative, Wang develop an amazing BSS method by using volume maximization. However, the algorithm that they have proposed can guarantee the nonnegativities of the sources only, but cannot obtain a nonnegative mixing matrix necessarily. In this letter, by introducing additional constraints, a method for fully nonnegative constrained iterative volume maximization (FNCIVM) is proposed. The result is with more interpretation, while the algorithm is based on solving a single linear programming problem. Numerical experiments with synthetic signals and real-world images are performed, which show the effectiveness of the proposed method.

Nonnegative Blind Source Separation by Sparse Component Analysis Based on Determinant Measure

The problem of nonnegative blind source separation (NBSS) is addressed in this paper, where both the sources and the mixing matrix are nonnegative. Because many real-world signals are sparse, we deal with NBSS by sparse component analysis. First, a determinant-based sparseness measure, named D-measure, is introduced to gauge the temporal and spatial sparseness of signals. Based on this measure, a new NBSS model is derived, and an iterative sparseness maximization (ISM) approach is proposed to solve this model. In the ISM approach, the NBSS problem can be cast into row-to-row optimizations with respect to the unmixing matrix, and then the quadratic programming (QP) technique is used to optimize each row. Furthermore, we analyze the source identifiability and the computational complexity of the proposed ISM-QP method. The new method requires relatively weak conditions on the sources and the mixing matrix, has high computational efficiency, and is easy to implement. Simulation results demonstrate the effectiveness of our method.

Online blind source separation using incremental nonnegative matrix factorization with volume constraint

Online blind source separation (BSS) is proposed to overcome the high computational cost problem, which limits the practical applications of traditional batch BSS algorithms. However, the existing online BSS methods are mainly used to separate independent or uncorrelated sources. Recently, nonnegative matrix factorization (NMF) shows great potential to separate the correlative sources, where some constraints are often imposed to overcome the non-uniqueness of the factorization. In this paper, an incremental NMF with volume constraint is derived and utilized for solving online BSS. The volume constraint to the mixing matrix enhances the identifiability of the sources, while the incremental learning mode reduces the computational cost. The proposed method takes advantage of the natural gradient based multiplication updating rule, and it performs especially well in the recovery of dependent sources. Simulations in BSS for dual-energy X-ray images, online encrypted speech signals, and high correlative face images show the validity of the proposed method.

Hydrograph separation and development of empirical relationships using single-parameter digital filters

A reliable hydrograph separation method is necessary for surface runoff modeling and hydrological studies. This paper investigates and compares the separation characteristics of two single-parameter digital filters, which are herein referred to as the one-parameter algorithm and the conceptual method. The application of the one-parameter algorithm was found to be restricted to low and medium baseflow separations, with a maximum separation limit of 50% of the total runoff hydrograph. The one-parameter algorithm was also observed to produce unrealistic sharp peaks under the peaks of the measured hydrograph when recession constant is smaller than 0.96. On the other hand, the conceptual method is applicable even for catchments fed largely by groundwater discharge. However, a reliable estimation of recession constant is a prerequisite for applying the conceptual method for large baseflow separations. Based on the hydrograph separation results, useful empirical relationships were developed for a partially urbanized watershed to estimate total runoff and direct runoff from the measured rainfall depth. The relationships between rainfall depth and total runoff depth and rainfall depth and direct runoff depth were found to be well represented by linear equations. The empirical relationships were then applied to estimate the long-term contribution of baseflow and surface runoff to total runoff at the study site. Baseflow was found to contribute about 58–61% of the annual total runoff.

Cluster identification and separation in the growing self-organizing map: application in protein sequence classification

Growing self-organizing map (GSOM) has been introduced as an improvement to the self-organizing map (SOM) algorithm in clustering and knowledge discovery. Unlike the traditional SOM, GSOM has a dynamic structure which allows nodes to grow reflecting the knowledge discovered from the input data as learning progresses. The spread factor parameter (SF) in GSOM can be utilized to control the spread of the map, thus giving an analyst a flexibility to examine the clusters at different granularities. Although GSOM has been applied in various areas and has been proven effective in knowledge discovery tasks, no comprehensive study has been done on the effect of the spread factor parameter value to the cluster formation and separation. Therefore, the aim of this paper is to investigate the effect of the spread factor value towards cluster separation in the GSOM. We used simple k-means algorithm as a method to identify clusters in the GSOM. By using Davies–Bouldin index, clusters formed by different values of spread factor are obtained and the resulting clusters are analyzed. In this work, we show that clusters can be more separated when the spread factor value is increased. Hierarchical clusters can then be constructed by mapping the GSOM clusters at different spread factor values.

Australian Unity Wellbeing Index survey 28.0 : The wellbeing of Australians - The impact of marriage : Report

The Australian Unity Wellbeing Index monitors the subjective wellbeing of the Australian population. Our first survey was conducted in April 2001 and this report concerns the 28 th survey, undertaken in September 2012. Our previous survey had been conducted six months earlier in April. This intervening period corresponded to the 5 th year of the Labor Government, elected in November 2007. It was also marked by continuing apprehension at the unstable international financial situation, with serious problems in Europe. The Australian economy, however, appeared stable. 

The development and evaluation of a post-separation parenting program

In response to the detrimental impact of post-separation parental conflict on children and families, an empirically-based post-separation parenting program targeting separated parents in high conflict was developed. Following its implementation into Victorian-based Family Mediation Centres, the program was then evaluated for effectiveness across various parenting, psychological adjustment and conflict-related domains.

Dielectrophoretic separation of Lactobacillus acidophillus bacteria from Saccharomyces cerevisiae yeasts

We show the size-based separation of model Saccharomyces cerevisiae yeast cells from a background of Lactobacillus acidophillus bacteria under the combined effect of dielectrophoretic (DEP) and hydrodynamic forces. © 2012 IEEE.

Recycling textiles : The use of ionic liquids in the separation of cotton polyester blends

Textiles are commonly made from intimate blends of polyester and cotton, which makes recycling very difficult. We report for the first time the use of ionic liquid in the separation of polyester cotton blends. By selective dissolution of the cotton component, the polyester component can be separated and recovered in high yield. This finding presents an environmentally benign approach to recycling textile waste. © 2014 The Royal Society of Chemistry.