Similarity matrix framework for data from union of subspaces

2018-09-01
Aldroubi, Akram
Sekmen, Ali
Koku, Ahmet Buğra
Cakmak, Ahmet Faruk
This paper presents a framework for finding similarity matrices for the segmentation of data W = [w(1)...w(N)] subset of R-D drawn from a union U = boolean OR(M)(i=1) S-i, of independent subspaces {S-i}(i=1)(M), of dimensions {d(i)}(i=1)(M). It is shown that any factorization of W = BP, where columns of B form a basis for data W and they also come from U, can be used to produce a similarity matrix Xi w. In other words, Xi w(i, j) not equal 0, when the columns w(i) and w(j) of W come from the same subspace, and Xi w(i, j) = 0, when the columns w(i) and w(j), of W come from different subspaces. Furthermore, Xi w = Q(dmax), where d(max) = max {d(i)}(i=1)(M), and Q is an element of R-NxN with Q(i, j) = vertical bar P-T(i, j)vertical bar. It is shown that a similarity matrix obtained from the reduced row echelon form of W is a special case of the theory. It is also proven that the Shape Interaction Matrix defined as VVT, where W = U Sigma V-T is the skinny singular value decomposition of W, is not necessarily a similarity matrix. But, taking powers of its absolute value always generates a similarity matrix. An interesting finding of this research is that a similarity matrix can be obtained using a skeleton decomposition of W. First, a square sub-matrix A is an element of R-rxr of W with the same rank r as W is found. Then, the matrix R corresponding to the rows of W that contain A is constructed. Finally, a power of the matrix (PP)-P-T where P = A(-1) R provides a similarity matrix Xi w. Since most of the data matrices are low-rank in many subspace segmentation problems, this is computationally efficient compared to other constructions of similarity matrices.
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS

Suggestions

Skeleton Decomposition Analysis for Subspace Clustering
Sekmen, Ali; Aldroubi, Akram; Koku, Ahmet Buğra (2016-12-08)
This paper provides a comprehensive analysis of skeleton decomposition used for segmentation of data W = [w(1) center dot center dot center dot w(N)] subset of R-D drawn from a union u = U-i=1(M) S-i of linearly independent subspaces {Si}(M)(i=1) of dimensionsof {di}(M)(i=1). Our previous work developed a generalized theoretical framework for computing similarity matrices by matrix factorization. Skeleton decomposition is a special case of this general theory. First, a square sub-matrix A is an element of R...
Comparison of regression techniques via Monte Carlo simulation
Mutan, Oya Can; Ayhan, Hüseyin Öztaş; Department of Statistics (2004)
The ordinary least squares (OLS) is one of the most widely used methods for modelling the functional relationship between variables. However, this estimation procedure counts on some assumptions and the violation of these assumptions may lead to nonrobust estimates. In this study, the simple linear regression model is investigated for conditions in which the distribution of the error terms is Generalised Logistic. Some robust and nonparametric methods such as modified maximum likelihood (MML), least absolut...
Physical subspace identification for helicopters
Avcıoğlu, Sevil; Kutay, Ali Türker; Department of Aerospace Engineering (2019)
Subspace identification is a powerful tool due to its well-understood techniques based on linear algebra (orthogonal projections and intersections of subspaces) and numerical methods like QR and singular value decomposition. However, the state space model matrices which are obtained from conventional subspace identification algorithms are not necessarily associated with the physical states. This can be an important deficiency when physical parameter estimation is essential. This holds for the area of helico...
Principal Coordinate Clustering
SEKMEN, ali; ALDROUBİ, Akram; HAMM, Keaton; Koku, Ahmet Buğra (2017-12-14)
This paper introduces a clustering algorithm, called principal coordinate clustering. It takes in a similarity matrix SW of a data matrix W and computes the singular value decomposition of SW to determine the principal coordinates to convert the clustering problem to a simpler domain. It is a relative of spectral clustering, however, principal coordinate clustering is easier to interpret, and gives a clear understanding of why it performs well. In a fashion, this gives intuition behind why spectral clusteri...
Interacting multiple model probabilistic data association filter using random matrices for extended target tracking
Özpak, Ezgi; Orguner, Umut; Department of Electrical and Electronics Engineering (2018)
In this thesis, an Interacting Multiple Model – Probabilistic Data Association (IMM-PDA) filter for tracking extended targets using random matrices is proposed. Unlike the extended target trackers in the literature which use multiple alternative partitionings/clusterings of the set of measurements, the algorithm proposed here considers a single partitioning/clustering of the measurement data which makes it suitable for applications with low computational resources. When the IMM-PDA filter uses clustered mea...
Citation Formats
A. Aldroubi, A. Sekmen, A. B. Koku, and A. F. Cakmak, “Similarity matrix framework for data from union of subspaces,” APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, pp. 425–435, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/42591.