I am working on a content-based image retrieval system on a distributed environment, I need an algorithm that takes as input an image and gives me a code for the image, this code should be such that it can be used to match visually similar images.

有帮助吗?

解决方案 2

It depends on kind of images, one workable alternative would be invariant moments ( either hu, or zernike )

We use this method in javaocr library, feel free to grab code from there.

Main advantage of invariant moments with cluster mathing is that it provides distance from cluster centers ( like: this is 90% cucumber but 20% apple )

其他提示

you can create an Image Hash as described here

I guess, you are talking about face recognition. If itś then these are few algorithms which are used on image processing.

  1. Eigenface
  2. Elastic Bunch Graph Matching
  3. Principal Component Analysis

You can use locally aware bloom hash, this is an implementation of phash in java by Elliot Shepherd: http://pastebin.com/Pj9d8jt5

许可以下: CC-BY-SA归因
不隶属于 StackOverflow
scroll top