Final Report of Implementing Large Scale Image Annotation精选.doc

Final Report of Implementing Large Scale Image Annotation精选.doc

  1. 1、本文档共7页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Final Report of Implementing Large Scale Image Annotation精选

Final Report of Implementing the Efficient Large-Scale Image Annotation by Probabilistic Collaborative Multi-Label Propagation 0. Introduction Our implementation includes three major parts: 1. A gradient histogram calculation that marks the feature of an image. 2. A local-sensitive hashing algorithm that maps similar images into same buckets. 3. A l1-norm optimization algorithm that calculate the weighted edge of a KNN graph. 4. A series of optimization that calculates the probability of a tag belongs to an untagged image. 1. A gradient histogram calculation that marks the feature of an image. In this section we found some papers and documents that explain how gradient histogram works on marking the main feature of an image, such as [1]. In implementation we first used Canny algorithm in OpenCV to recognize major gradient changes in an image, so the pixels that belongs to an edge are stored (see variable canny and canny_m in get_features() in HammingLSH.cpp). Then we used Sobel algorithm in OpenCV to measure the gradient drop intensity in both direction x and y, so that we can calculate all the gradient drop direction vectors. After that, a histogram that records how frequently those vectors appear in a certain angle range. In these steps a feature vector of an image is acquired. How to calculate the gradient drop angle Actually how gradient histogram of edges works on identifying an image from the others is a little vague. But we can indicate a major gradient change often mean there are edges around, and Canny algorithm is such a well-performed method recognizing edges. To our knowledge a gradient histogram records shapes of the objects, e.g., a circle distribute equally in a histogram while a square have only two angles of gradient drop. The global variable ‘dimention’(misspelled) defined in HammingLSH.cpp can be modified to change the columns in histograms , the same to feature vector dimension, so it can yield different results. If the histogram contains more co

文档评论(0)

pfenejiarz + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档