{"title":"VTK的均值偏移聚类实现","authors":"D. Doria","doi":"10.54294/pgbh5i","DOIUrl":null,"url":null,"abstract":"Mean shift clustering is an excellent technique for clustering points when the number of clusters is not known. We present a implementation (vtkMeanShiftClustering) of the simplest version of the algorithm written in a VTK context.The code is currently hosted at http://github.com/daviddoria/vtkMeanShiftClustering .","PeriodicalId":251524,"journal":{"name":"The VTK Journal","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Mean Shift Clustering Implementation for VTK\",\"authors\":\"D. Doria\",\"doi\":\"10.54294/pgbh5i\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mean shift clustering is an excellent technique for clustering points when the number of clusters is not known. We present a implementation (vtkMeanShiftClustering) of the simplest version of the algorithm written in a VTK context.The code is currently hosted at http://github.com/daviddoria/vtkMeanShiftClustering .\",\"PeriodicalId\":251524,\"journal\":{\"name\":\"The VTK Journal\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The VTK Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.54294/pgbh5i\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The VTK Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.54294/pgbh5i","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Mean shift clustering is an excellent technique for clustering points when the number of clusters is not known. We present a implementation (vtkMeanShiftClustering) of the simplest version of the algorithm written in a VTK context.The code is currently hosted at http://github.com/daviddoria/vtkMeanShiftClustering .
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
