An evolutionary self-expressive model for clustering a collection of evolving data points that lie on a union of low-dimensional evolving subspaces is proposed. A parsimonious representation of data points at each tim...
详细信息
ISBN:
(纸本)9781479981311
An evolutionary self-expressive model for clustering a collection of evolving data points that lie on a union of low-dimensional evolving subspaces is proposed. A parsimonious representation of data points at each time step is learned via a non-convex optimization framework that exploits the self-expressiveness property of the evolving data while taking into account data representation from the preceding time step. The resulting scheme adaptively learns an innovation matrix that captures changes in self-representation of data in consecutive time steps as well as a smoothing parameter reflective of the rate of data evolution. Extensive experiments demonstrate superiority of the proposed framework overs state-of-the-art static subspace clustering algorithms and existing evolutionary clustering schemes.
Recent advances in technology have led to easy data acquisition mechanisms in many fields, leading to massive datasets. It is often of interest to understand the inherent structure and learn the best representation of...
详细信息
ISBN:
(纸本)9781728135939
Recent advances in technology have led to easy data acquisition mechanisms in many fields, leading to massive datasets. It is often of interest to understand the inherent structure and learn the best representation of the given dataset. Graphs are a powerful way to model interrelationships between data features - well constructed meaningful graphs help in representing and processing the data effectively. The graph topology needs to be inferred from the observed data. In this survey, we briefly explore signalprocessing based graph learning approaches that have been proposed in the literature and propose new research directions.
Estimating the number of correlated components between two data sets is a challenging task in the case of small sample support. Typically, a rank-reduction preprocessing step based on principal component analysis (PCA...
详细信息
ISBN:
(纸本)9781479981311
Estimating the number of correlated components between two data sets is a challenging task in the case of small sample support. Typically, a rank-reduction preprocessing step based on principal component analysis (PCA) is carried out on each data set individually to reduce the dimensionality before analyzing correlation between the data sets. However, PCA retains the components with the largest variance within a data set, and therefore fails when these components are not the ones that account for the correlation between the data sets. To overcome this, we propose an alternative technique that, instead of projecting the data into a single subspace, uses a large number of random projections.
We propose a learning-based approach for estimating the spectrum of a multisinusoidal signal from a finite number of samples. A neural-network is trained to approximate the spectra of such signals on simulated data. T...
详细信息
ISBN:
(纸本)9781479981311
We propose a learning-based approach for estimating the spectrum of a multisinusoidal signal from a finite number of samples. A neural-network is trained to approximate the spectra of such signals on simulated data. The proposed methodology is very flexible: adapting to different signal and noise models only requires modifying the training data accordingly. Numerical experiments show that the approach performs competitively with classical methods designed for additive Gaussian noise at a range of noise levels, and is also effective in the presence of impulsive noise.
Most current machine learning algorithms make highly confident yet incorrect classifications when faced with unexpected test samples from an unknown distribution different from training;such epistemic uncertainty (unk...
详细信息
ISBN:
(纸本)9781479981311
Most current machine learning algorithms make highly confident yet incorrect classifications when faced with unexpected test samples from an unknown distribution different from training;such epistemic uncertainty (unknown unknowns) can have catastrophic safety implications. In this conceptual paper, we propose a method to leverage engineering science knowledge to control epistemic uncertainty and maintain decision safety. The basic idea is an algorithm fusion approach that combines data-driven learned models with physical system knowledge, to operate between the extremes of purely data-driven classifiers and purely engineering science rules. This facilitates the safe operation of data-driven engineering systems, such as wastewater treatment plants.
Linear adaptive systems are a well-known staple in numerous signalprocessing applications. Recently, significant activity and performance gains have been achieved in multilayer neural networks for deep learning appli...
详细信息
ISBN:
(纸本)9781479981311
Linear adaptive systems are a well-known staple in numerous signalprocessing applications. Recently, significant activity and performance gains have been achieved in multilayer neural networks for deep learning applied to practical dataprocessing applications. In this paper, we describe the important relationships and significant differences between the procedures and methods used in linear adaptive systems and those used in multilayer neural networks for deep learning tasks. Input-output structures, cost functions and training criteria, adaptive algorithms, and dataprocessing and optimization strategies are considered. It is the hope of the authors that this discussion will spur further crossover between the two fields, and in particular allow knowledge to be shared and further progress to be made.
We propose an adaptive signal sampling approach that dynamically adjusts the sampling rate to approximate the local Nyquist rate of the signal. The proposed adaptive sampling approach consists of a recurrent neural ne...
详细信息
ISBN:
(纸本)9781728108582
We propose an adaptive signal sampling approach that dynamically adjusts the sampling rate to approximate the local Nyquist rate of the signal. The proposed adaptive sampling approach consists of a recurrent neural network-based change detector that detects the point of frequency change and a local Nyquist rate estimator based on a multi-rate signalprocessing scheme. We empirically demonstrate that our adaptive sampling approach significantly reduces the overall sampling rate for various types of signals and therefore improves the computational efficiency of subsequent signalprocessing.
Wireless sensor network (WSN), as a key provider of big data, will generate a large amount of data, which requires sufficient spectrum and energy resources to transmit. Cognitive radio sensor networks (CRSNs) solve th...
详细信息
ISBN:
(纸本)9781728135557
Wireless sensor network (WSN), as a key provider of big data, will generate a large amount of data, which requires sufficient spectrum and energy resources to transmit. Cognitive radio sensor networks (CRSNs) solve the problem of increasing shortage of spectrum resources in big data environment by using dynamic spectrum access technology, while energy consumption is still the main task of current research. Therefore, in this paper, considering the characteristics of big data, that is, the difference in the amount of data to be transmitted by each node, we propose a dynamic channel access scheme based on data priority and energy consumption minimization, which first allocates transmission power according to the data priority of each node, and then allocates transmission time reasonably to each node aiming at minimizing energy consumption. Finally, the effectiveness of the proposed scheme is proved by simulation results.
The discrete cosine transform is a valuable tool in analysis of data on undirected rectangular grids, like images. In this paper it is shown how one can define an analogue of the discrete cosine transform on triangles...
详细信息
ISBN:
(纸本)9781479981311
The discrete cosine transform is a valuable tool in analysis of data on undirected rectangular grids, like images. In this paper it is shown how one can define an analogue of the discrete cosine transform on triangles. This is done by combining algebraic signalprocessing theory with a specific kind of multivariate Chebyshev polynomials. Using a multivariate Christoffel-Darboux formula it is shown how to derive an orthogonal version of the transform.
The subspace clustering problem arises in many applications that involve processing high-dimensional data, i.e. images and videos. In many of these applications, high dimensional data is often well approximated by uni...
详细信息
ISBN:
(纸本)9781479981311
The subspace clustering problem arises in many applications that involve processing high-dimensional data, i.e. images and videos. In many of these applications, high dimensional data is often well approximated by union of low-dimensional subspaces. This motivated the development of various algorithms to cluster high dimensional data based on the underlying intrinsic low-dimensional subspaces. However, the existing approaches are based on global representation of data whereas this representation can be easily affected by errors, occlusions and severe illumination conditions. Here, we propose a multi-scale approach based on extracting local patches from different scales and then merging the shared information using a weighted scheme based on Grassmann manifolds. This approach not only benefits from the discriminative information from global representation of data but also makes the clustering task more robust using the information from local representations. Numerical results show that the proposed approach significantly outperforms existing subspace clustering algorithms.
暂无评论