On blind separability based on the temporal predictability method

This letter discusses blind separability based on temporal predictability (Stone, 2001; Xie, He, & Fu, 2005). Our results show that the sources are separable using the temporal predictability method if and only if they have different temporal structures (i.e., autocorrelations). Consequently, the applicability and limitations of the temporal predictability method are clarified. In addition, instead of using generalized eigendecomposition, we suggest using joint approximate diagonalization algorithms to improve the robustness of the method. A new criterion is presented to evaluate the separation results. Numerical simulations are performed to demonstrate the validity of the theoretical results.

Optimal tax mix with merit goods

This paper deals with optimal taxation in a two‐class economy with two private commodities and labour. We derive optimal non‐linear income and linear commodity taxes in the presence of merit goods. We formulate merit good arguments via a pathology of individual choice. We assume weak separability between consumption and leisure and show how the standard optimal tax results are modified due to merit good considerations.

Blind source separation using second-order cyclostationary statistics

This paper studies the blind source separation (BSS) problem with the assumption that the source signals are cyclostationary. Identifiability and separability criteria based on second-order cyclostationary statistics (SOCS) alone are derived. The identifiability condition is used to define an appropriate contrast function. An iterative algorithm (ATH2) is derived to minimize this contrast function. This algorithm separates the sources even when they do not have distinct cycle frequencies .

Marine benthic habitat mapping using multibeam data, georeferenced video and image classification techniques in Victoria, Australia

This paper contributes to a better understanding of geophysical characteristics and benthic communities in the Hopkins site in Victoria, Australia. An automated decision tree classification system was used to classify substrata and dominant biota communities. Geophysical sampling and underwater video data collected in this study reveals a complex bathymetry and biological structure which complements the limited information of benthic marine ecosystems in coastal waters of Victoria. The technique of combining derivative products from the backscatter and the bathymetry datasets was found to improve separability for broad biota and substrata categories over the use of either of these datasets alone.

Robust single-hidden layer feedforward network-based pattern classifier

In this paper, a new robust single-hidden layer feedforward network (SLFN)-based pattern classifier is developed. It is shown that the frequency spectrums of the desired feature vectors can be specified in terms of the discrete Fourier transform (DFT) technique. The input weights of the SLFN are then optimized with the regularization theory such that the error between the frequency components of the desired feature vectors and the ones of the feature vectors extracted from the outputs of the hidden layer is minimized. For the linearly separable input patterns, the hidden layer of the SLFN plays the role of removing the effects of the disturbance from the noisy input data and providing the linearly separable feature vectors for the accurate classification. However, for the nonlinearly separable input patterns, the hidden layer is capable of assigning the DFTs of all feature vectors to the desired positions in the frequencydomain such that the separability of all nonlinearly separable patterns are maximized. In addition, the output weights of the SLFN are also optimally designed so that both the empirical and the structural risks are well balanced and minimized in a noisy environment. Two simulation examples are presented to show the excellent performance and effectiveness of the proposed classification scheme.

Multi-view subspace clustering for face images

In many real-world computer vision applications, such as multi-camera surveillance, the objects of interest are captured by visual sensors concurrently, resulting in multi-view data. These views usually provide complementary information to each other. One recent and powerful computer vision method for clustering is sparse subspace clustering (SSC); however, it was not designed for multi-view data, which break down its linear separability assumption. To integrate complementary information between views, multi-view clustering algorithms are required to improve the clustering performance. In this paper, we propose a novel multi-view subspace clustering by searching for an unified latent structure as a global affinity matrix in subspace clustering. Due to the integration of affinity matrices for each view, this global affinity matrix can best represent the relationship between clusters. This could help us achieve better performance on face clustering. We derive a provably convergent algorithm based on the alternating direction method of multipliers (ADMM) framework, which is computationally efficient, to solve the formulation. We demonstrate that this formulation outperforms other alternatives based on state-of-The-Arts on challenging multi-view face datasets.