{"title":"基于Bhattacharyya距离的高光谱图像边缘检测","authors":"S. Youn, Chulhee Lee","doi":"10.1109/ICPADS.2013.127","DOIUrl":null,"url":null,"abstract":"In this paper, we proposed a new edge detection algorithm for hyper spectral images using the Bhattacharyya distance. First, the principal component analysis is applied to hyper spectral images and then dominant eigenimages are selected. To compute the Bhattacharyya distance, four block pairs of each pixel are extracted: up-down, left-right, diagonal-left down and diagonal-right-down. From each pair of blocks, we compute the Bhattacharyya distance, which was used as edge information. Experiments show promising results compared to the conventional Sobel filter.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Edge Detection for Hyperspectral Images Using the Bhattacharyya Distance\",\"authors\":\"S. Youn, Chulhee Lee\",\"doi\":\"10.1109/ICPADS.2013.127\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we proposed a new edge detection algorithm for hyper spectral images using the Bhattacharyya distance. First, the principal component analysis is applied to hyper spectral images and then dominant eigenimages are selected. To compute the Bhattacharyya distance, four block pairs of each pixel are extracted: up-down, left-right, diagonal-left down and diagonal-right-down. From each pair of blocks, we compute the Bhattacharyya distance, which was used as edge information. Experiments show promising results compared to the conventional Sobel filter.\",\"PeriodicalId\":160979,\"journal\":{\"name\":\"2013 International Conference on Parallel and Distributed Systems\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Parallel and Distributed Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPADS.2013.127\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Parallel and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPADS.2013.127","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Edge Detection for Hyperspectral Images Using the Bhattacharyya Distance
In this paper, we proposed a new edge detection algorithm for hyper spectral images using the Bhattacharyya distance. First, the principal component analysis is applied to hyper spectral images and then dominant eigenimages are selected. To compute the Bhattacharyya distance, four block pairs of each pixel are extracted: up-down, left-right, diagonal-left down and diagonal-right-down. From each pair of blocks, we compute the Bhattacharyya distance, which was used as edge information. Experiments show promising results compared to the conventional Sobel filter.