Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
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.
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 )