用于通过哈希进行图像搜索的.Net 库？
我想将图像与图像数据库进行比较，以找到具有定义的容差标准的任何“相似”图像（可能是相同的图像，但调整了大小、有损压缩、稍微裁剪）。
大小（要比较的数十万张图像）和标准（调整大小、裁剪）都排除了使用任何类型的像素到像素比较。我要做的是计算并存储每个图像的“哈希”，然后当我想要比较新图像时，我计算它的哈希并用它进行搜索。
我了解通常如何完成此操作的基础知识 - 您识别图像中的少量独特“特征”（我已经玩过识别角点）并将该信息存储为散列。然而，这不会是我正在从事的项目的主要组成部分，因此我无法花时间从头开始开发和测试这种规模的东西。
是否有任何（最好是.NET）库用于生成和比较视觉图像哈希？类似于 string ComputeHash(Image) 和 int GetHashDifference(string, string) 的东西
I want to compare an image against a database of images to find any "similar" images (it could be the same image but resized, lossy compressed, slightly cropped) with a defined tolerance criteria.
Both the size (hundreds of thousands of images to compare against) and the criteria (resizing, cropping) rule out using any kind of pixel to pixel comparison. What I have to do is compute and store a "hash" of each image, and then when I want to compare a new image, I calculate its hash and do a search with that.
I understand the basics for how this is generally done - you identify a small number of unique "features" in an image (I've played a bit with identifying corners) and store that information as the hash. However this will not be a major component of the project I'm working on, so I can't take the time to develop and test something of this scale from scratch.
Are there any (.NET preferably) libraries for generating and comparing visual image hashes? Something along the line of string ComputeHash(Image) and int GetHashDifference(string, string)
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（1）
看一下这个 SourceForge 项目：图像相似度工具。它是一个命令行 Linux 工具，但其中使用的一些技术也许对您有用。
imgSeek，一个免费（开源）图像相似性项目的集合，也可能对您有用。
不幸的是，我无法找到任何能够完全满足您需要的 .NET 库，但也许其他人能够为您提供帮助。
祝你好运！
Take a look at this SourceForge project: Image Similarity Tool. It's a command-line Linux tool, but perhaps some of the techniques used in it might be useful to you.
imgSeek, a collection of free (open source) image similarity projects, may also be of use to you.
Unfortunately I wasn't able to find any .NET libraries that do exactly what you need, but maybe someone else will be able to help you there.
Good luck!