{"title":"Virtual dimensionality estimation for hyperspectral imagery with a fractal-based method","authors":"Q. Du","doi":"10.1109/WHISPERS.2010.5594955","DOIUrl":null,"url":null,"abstract":"The Grassberger-Procaccia (GP) algorithm is investigated in estimating ID of hyperspectral imagery. Due to the high data dimensionality and large pairwise pixel distance, data dimensionality may need to be pre-reduced such that the trade-off can be achieved between taking the scale r small enough to have an accurate estimate and taking the r sufficiently large to reduce statistical errors due to lack of data counts. Since random projection can preserve volumes and distances to affine spaces, it is a good choice to run the GP algorithm on the random projected data points. Based on real data experiments, the GP algorithm provides estimates that are close to virtual dimensionality (VD) estimates from other VD estimation approaches.","PeriodicalId":193944,"journal":{"name":"2010 2nd Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 2nd Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WHISPERS.2010.5594955","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
The Grassberger-Procaccia (GP) algorithm is investigated in estimating ID of hyperspectral imagery. Due to the high data dimensionality and large pairwise pixel distance, data dimensionality may need to be pre-reduced such that the trade-off can be achieved between taking the scale r small enough to have an accurate estimate and taking the r sufficiently large to reduce statistical errors due to lack of data counts. Since random projection can preserve volumes and distances to affine spaces, it is a good choice to run the GP algorithm on the random projected data points. Based on real data experiments, the GP algorithm provides estimates that are close to virtual dimensionality (VD) estimates from other VD estimation approaches.