Many clustering algorithms are not applicable to high-dimensional feature spaces, because the clusters often exist only in specific subspaces of the original feature space. Those clusters are also called subspace clusters. In this paper, we propose the algorithm HiSC (Hierarchical Subspace Clustering) that can detect hierarchies of nested subspace clusters, i.e. the relationships of lowerdimens...

This paper presents a color matching technique using weighted subspace on medicine package recognition. The proposed method is more compact and lowercomplex than scalable color descriptor and dominant color descriptor, which are employed by MPEG-7. Our method is based on subspace matching: A color object is treated as a subspace derived from its color distribution. Unlike mutual subspace method...

Subspace detection and processing is receivingmore attention nowadays as a method to speed up searchand reduce processing overload. Subspace Learningalgorithms try to detect low dimensional subspaces in thedata which minimize the intra-class separation whilemaximizing the inter-class separation. In this paper wepresent a novel technique using the maximum significance...

In this article we present a new method for visual face tracking that is carried out in wavelet subspace. Firstly, a wavelet representation for the face template is created, which spans a low dimensional subspace of the image space. The wavelet representation of the face is a point in this wavelet subspace. The video sequence frames in which the face is tracked are orthogonally projected into t...

We study geometrically finite one-dimensional mappings. These are a subspace of C one-dimensional mappings with finitely many, critically finite critical points. We study some geometric properties of a mapping in this subspace. We prove that this subspace is closed under quasisymmetrical conjugacy. We also prove that if two mappings in this subspace are topologically conjugate, they are then qu...

Nuisance attribute projection (NAP) and within-class covariance normalization (WCCN) are two effective techniques for intersession variability compensation in SVM based speaker verification systems. However, by normalizing or removing the nuisance subspace containing the session variability can not guarantee to enlarge the distance between speakers. In this paper, we investigated the probabilit...

We prove the existence of a non-trivial hyperinvariant subspace for several sets polynomially compact operators. The main results paper are: (i) norm closed algebra $$\mathcal {A}\subseteq \mathcal {B}(\mathscr {X})$$ which consists quasinilpotent operators has subspace; (ii) if there exists non-zero operator in closure generated by an band {S}$$ , then subspace.

The central subspace and central mean subspace are two important targets of sufficient dimension reduction. We propose a weighted chi-squared test to determine their dimensions based on matrices whose column spaces are exactly equal to the central subspace or the central mean subspace. The asymptotic distribution of the test statistic is obtained. Simulation examples are used to demonstrate the...