content-based-retrieval

Similar image search software (like TinEye)

阅读更多关于 Similar image search software (like TinEye)

问题 In one of our community sites, we allow users to upload images. These images are approved or rejected by our moderators. To limit the work needed by our administrators, we want to 'log' each picture that is rejected to some kind of database, and do a lookup in this database prior to submitting an image for approval. If a similar image already has been rejected, the uploaded image won't be submitted for approval. We can of course just log stuff like filename, size and MD5 of the picture for

Confusion about (Mean) Average Precision

阅读更多关于 Confusion about (Mean) Average Precision

问题 In this question I asked clarifications about the precision-recall curve. In particular, I asked if we have to consider a fixed number of rankings to draw the curve or we can reasonably choose ourselves. According to the answer, the second one is correct. However now I have a big doubt about the Average Precision (AP) value: AP is used to estimate numerically how good is our algorithm given a certain query. Mean Average Precision (MAP) is average precision on multiple queries. My doubt is: if

Good way to identify similar images? [closed]

阅读更多关于 Good way to identify similar images? [closed]

问题 Closed . This question needs to be more focused. It is not currently accepting answers. Want to improve this question? Update the question so it focuses on one problem only by editing this post. Closed 3 months ago . I've developed a simple and fast algorithm in PHP to compare images for similarity. Its fast (~40 per second for 800x600 images) to hash and a unoptimised search algorithm can go through 3,000 images in 22 mins comparing each one against the others (3/sec). The basic overview is

How is google search by image possible?

阅读更多关于 How is google search by image possible?

问题 Recently google launched its new feature in image search by image means we can search other images by uploading a image in the google search box. How is this possible? http://images.google.com 回答1: Look at WP:Content-based image retrieval. An example of open-source implementation that you can study internal working of is for example GNU Image Finding Tool. 回答2: If you click on the "Learn more" link on the page you are referring to, you'll find this explanation How it works Google uses

How is google search by image possible?

阅读更多关于 How is google search by image possible?

Recently google launched its new feature in image search by image means we can search other images by uploading a image in the google search box. How is this possible? http://images.google.com Look at WP:Content-based image retrieval . An example of open-source implementation that you can study internal working of is for example GNU Image Finding Tool . If you click on the "Learn more" link on the page you are referring to, you'll find this explanation How it works Google uses computer vision techniques to match your image to other images in the Google Images index and additional image

Does Mahout provide a way to determine similarity between content (for content-based recommendations)?

阅读更多关于 Does Mahout provide a way to determine similarity between content (for content-based recommendations)?

Does Mahout provide a way to determine similarity between content? I would like to produce content-based recommendations as part of a web application. I know Mahout is good at taking user-ratings matrices and producing recommendations based off of them, but I am not interested in collaborative (ratings-based) recommendations. I want to score how well two pieces of text match and then recommend items that match most closely to text that I store for users in their user profile... I've read Mahout's documentation, and it looks like it facilitates mainly the collaborative (ratings-based)

Does Mahout provide a way to determine similarity between content (for content-based recommendations)?

阅读更多关于 Does Mahout provide a way to determine similarity between content (for content-based recommendations)?

问题 Does Mahout provide a way to determine similarity between content? I would like to produce content-based recommendations as part of a web application. I know Mahout is good at taking user-ratings matrices and producing recommendations based off of them, but I am not interested in collaborative (ratings-based) recommendations. I want to score how well two pieces of text match and then recommend items that match most closely to text that I store for users in their user profile... I've read

Confusion about (Mean) Average Precision

阅读更多关于 Confusion about (Mean) Average Precision

In this question I asked clarifications about the precision-recall curve. In particular, I asked if we have to consider a fixed number of rankings to draw the curve or we can reasonably choose ourselves. According to the answer , the second one is correct. However now I have a big doubt about the Average Precision (AP) value: AP is used to estimate numerically how good is our algorithm given a certain query. Mean Average Precision (MAP) is average precision on multiple queries. My doubt is: if AP changes according to how many objects we retrieve then we can tune this parameter to our advantage

Are there any API's that'll let me search by image?

阅读更多关于 Are there any API's that'll let me search by image?

问题 I have an image and I want to search to see what it is. Any API's available for that? 回答1: I believe there are quite a few. You want to search for Content-based Image Retrieval (CBIR). Wikipedia has a page of CBIR engines, including an extensive list of open source ones. For example, isk-daemon and LIRE are both open source CBIR libraries: isk-daemon is an open source standalone server and library capable of adding content-based (visual) image searching to any image related website or

Good way to identify similar images?

阅读更多关于 Good way to identify similar images?

I've developed a simple and fast algorithm in PHP to compare images for similarity. Its fast (~40 per second for 800x600 images) to hash and a unoptimised search algorithm can go through 3,000 images in 22 mins comparing each one against the others (3/sec). The basic overview is you get a image, rescale it to 8x8 and then convert those pixels for HSV. The Hue, Saturation and Value are then truncated to 4 bits and it becomes one big hex string. Comparing images basically walks along two strings, and then adds the differences it finds. If the total number is below 64 then its the same image.