{"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}
引用次数: 5

摘要

我们展示了一种简单而有效的图像存储方法,使得附近图像的检索既快速又准确。主要成分是离散傅里叶变换提取低频成分,主成分分析(PCA)进一步压缩,并存储在k-D树。我们说明了MNIST数字套件结果的质量,并将其应用于染色体片段。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Linking Fourier and PCA Methods for Image Look-Up
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Hybrid CPU/GPU Approach for the Parallel Algebraic Recursive Multilevel Solver pARMS Continuation Semantics of a Language Inspired by Membrane Computing with Symport/Antiport Interactions Parallel Integer Polynomial Multiplication A Numerical Method for Analyzing the Stability of Bi-Parametric Biological Systems Comparing Different Term Weighting Schemas for Topic Modeling
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1