{"title":"改进N-Finder端元提取技术","authors":"Mahmoud Maghrbay, R. Ammar, S. Rajasekaran","doi":"10.1109/ISSPIT.2011.6151533","DOIUrl":null,"url":null,"abstract":"N-FINDER algorithm is widely used for endmember extraction. One of the disadvantages of N-FINDER is that its implementations take long run time due to the relatively large computational complexity of N-FINDER. Successfully reducing the size of the input data set -the hyperspectral image - that the algorithm works on can reduce the overall run time of the algorithm. A method for successfully selecting the proper sample of the data set to work on is provided in this paper. Using this reduction technique, a faster and statistically more accurate version of N-FINDER is presented.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Improving N-Finder technique for extracting endmembers\",\"authors\":\"Mahmoud Maghrbay, R. Ammar, S. Rajasekaran\",\"doi\":\"10.1109/ISSPIT.2011.6151533\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"N-FINDER algorithm is widely used for endmember extraction. One of the disadvantages of N-FINDER is that its implementations take long run time due to the relatively large computational complexity of N-FINDER. Successfully reducing the size of the input data set -the hyperspectral image - that the algorithm works on can reduce the overall run time of the algorithm. A method for successfully selecting the proper sample of the data set to work on is provided in this paper. Using this reduction technique, a faster and statistically more accurate version of N-FINDER is presented.\",\"PeriodicalId\":288042,\"journal\":{\"name\":\"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSPIT.2011.6151533\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPIT.2011.6151533","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Improving N-Finder technique for extracting endmembers
N-FINDER algorithm is widely used for endmember extraction. One of the disadvantages of N-FINDER is that its implementations take long run time due to the relatively large computational complexity of N-FINDER. Successfully reducing the size of the input data set -the hyperspectral image - that the algorithm works on can reduce the overall run time of the algorithm. A method for successfully selecting the proper sample of the data set to work on is provided in this paper. Using this reduction technique, a faster and statistically more accurate version of N-FINDER is presented.