Intrinsic dimension estimation of the fMRI space via sparsity-promoting matrix factorization

Author(s):  
Harris V. Georgiou
2009 ◽  
Vol 42 (5) ◽  
pp. 780-787 ◽  
Author(s):  
Mingyu Fan ◽  
Hong Qiao ◽  
Bo Zhang

2019 ◽  
Vol 9 (1) ◽  
Author(s):  
Vittorio Erba ◽  
Marco Gherardi ◽  
Pietro Rotondo

AbstractIdentifying the minimal number of parameters needed to describe a dataset is a challenging problem known in the literature as intrinsic dimension estimation. All the existing intrinsic dimension estimators are not reliable whenever the dataset is locally undersampled, and this is at the core of the so called curse of dimensionality. Here we introduce a new intrinsic dimension estimator that leverages on simple properties of the tangent space of a manifold and extends the usual correlation integral estimator to alleviate the extreme undersampling problem. Based on this insight, we explore a multiscale generalization of the algorithm that is capable of (i) identifying multiple dimensionalities in a dataset, and (ii) providing accurate estimates of the intrinsic dimension of extremely curved manifolds. We test the method on manifolds generated from global transformations of high-contrast images, relevant for invariant object recognition and considered a challenge for state-of-the-art intrinsic dimension estimators.


2010 ◽  
Vol 58 (2) ◽  
pp. 650-663 ◽  
Author(s):  
K.M. Carter ◽  
R. Raich ◽  
A.O. Hero

2011 ◽  
Vol 32 (14) ◽  
pp. 1706-1713 ◽  
Author(s):  
Charles Bouveyron ◽  
Gilles Celeux ◽  
Stéphane Girard

2014 ◽  
Vol 47 (3) ◽  
pp. 1485-1493 ◽  
Author(s):  
Liang Liao ◽  
Yanning Zhang ◽  
Stephen John Maybank ◽  
Zhoufeng Liu

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Yuanhong Liu ◽  
Zhiwei Yu ◽  
Ming Zeng ◽  
Shun Wang

Dimension reduction is an important tool for feature extraction and has been widely used in many fields including image processing, discrete-time systems, and fault diagnosis. As a key parameter of the dimension reduction, intrinsic dimension represents the smallest number of variables which is used to describe a complete dataset. Among all the dimension estimation methods, correlation dimension (CD) method is one of the most popular ones, which always assumes that the effect of every point on the intrinsic dimension estimation is identical. However, it is different when the distribution of a dataset is nonuniform. Intrinsic dimension estimated by the high density area is more reliable than the ones estimated by the low density or boundary area. In this paper, a novel weighted correlation dimension (WCD) approach is proposed. The vertex degree of an undirected graph is invoked to measure the contribution of each point to the intrinsic dimension estimation. In order to improve the adaptability of WCD estimation,k-means clustering algorithm is adopted to adaptively select the linear portion of the log-log sequence(log⁡δk,log⁡C(n,δk)). Various factors that affect the performance of WCD are studied. Experiments on synthetic and real datasets show the validity and the advantages of the development of technique.


Sign in / Sign up

Export Citation Format

Share Document