{"title":"链接傅里叶和PCA方法的图像查找","authors":"Daniel Lichtblau","doi":"10.1109/SYNASC.2016.028","DOIUrl":null,"url":null,"abstract":"We show a simple, yet effective, method for storing images, such that retrieval of nearby images is both fast and accurate. The main ingredients are discrete Fourier transforms to extract low frequency components, principal components analysis (PCA) for further compression, and storage in k-D trees. We illustrate the quality of results on the MNIST digit suite and also apply it to chromosome segments.","PeriodicalId":268635,"journal":{"name":"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Linking Fourier and PCA Methods for Image Look-Up\",\"authors\":\"Daniel Lichtblau\",\"doi\":\"10.1109/SYNASC.2016.028\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show a simple, yet effective, method for storing images, such that retrieval of nearby images is both fast and accurate. The main ingredients are discrete Fourier transforms to extract low frequency components, principal components analysis (PCA) for further compression, and storage in k-D trees. We illustrate the quality of results on the MNIST digit suite and also apply it to chromosome segments.\",\"PeriodicalId\":268635,\"journal\":{\"name\":\"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2016.028\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2016.028","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We show a simple, yet effective, method for storing images, such that retrieval of nearby images is both fast and accurate. The main ingredients are discrete Fourier transforms to extract low frequency components, principal components analysis (PCA) for further compression, and storage in k-D trees. We illustrate the quality of results on the MNIST digit suite and also apply it to chromosome segments.