CVPR14年关于图像检索方面的papers,汇总成一个list,方便阅读。


图像检索

  1. Triangulation embedding and democratic aggregation for image search (Orals)
  2. Collaborative Hashing (post)
  3. Packing and Padding: Coupled Multi-index for Accurate Image Retrieval (post) technical report
  4. Bayes Merging of Multiple Vocabularies for Scalable Image Retrieval (post) technical report
  5. Fast Supervised Hashing with Decision Trees for High-Dimensional Data (post)
  6. Learning Fine-grained Image Similarity with Deep Ranking (post)
  7. Congruency-Based Reranking (post)可能
  8. Fisher and VLAD with FLAIR (post)可能
  9. Locality in Generic Instance Search from One Example (post)
  10. Asymmetric sparse kernel approximations for large-scale visual search (post)
  11. Locally Linear Hashing for Extracting Non-Linear Manifolds (post)
  12. Adaptive Object Retrieval with Kernel Reconstructive Hashing (post)
  13. Hierarchical Feature Hashing for Fast Dimensionality Reduction (post)

视频检索与事件检测

  1. Temporal Sequence Modeling For Video Event Detection (Orals)
  2. Visual Semantic Search: Retrieving Videos via Complex Textual Queries (post)

感兴趣文章

  • Robust Orthonormal Subspace Learning: Efficient Recovery of Corrupted Low-rank Matrices (Orals)

  • Fast and Accurate Image Matching with Cascade Hashing for 3D Reconstruction (Orals)

  • Large-scale Video Classification using Convolutional Neural Networks (Orals)

  • Locally Optimized Product Quantization (post)

  • Product Sparse Coding (post)

  • Distance Encoded Product Quantization (post)

  • Covariance descriptors for 3D shape matching and retrieval (post)

  • Turning Mobile Phones into 3D Scanners (post)

  • Linear Ranking Analysis (post)

from: http://yongyuan.name/blog/cvpr14-reading-list.html

CVPR14 图像检索papers的更多相关文章

  1. 哈希学习(2)—— Hashing图像检索资源

    CVPR14 图像检索papers——图像检索 1.  Triangulation embedding and democratic aggregation for imagesearch (Oral ...

  2. 图像检索中为什么仍用BOW和LSH

    原文链接:http://blog.csdn.net/jwh_bupt/article/details/27713453 去年年底的时候在一篇博客中,用ANN的框架解释了BOW模型[1],并与LSH[2 ...

  3. International Conference for Smart Health 2015 Call for Papers

    Advancing Informatics for healthcare and healthcare applications has become an international researc ...

  4. IEEE/ACM ASONAM 2014 Industry Track Call for Papers

    IEEE/ACM International Conference on Advances in Social Network Analysis and Mining (ASONAM) 2014 In ...

  5. Call for Papers IEEE/ACM International Conference on Advances in Social Network Analysis and Mining (ASONAM)

    IEEE/ACM International Conference on Advances in Social Network Analysis and Mining (ASONAM) 2014 In ...

  6. Call for Papers International Conference for Smart Health (ICSH) 2014

    Call for PapersInternational Conference for Smart Health (ICSH) 2014 Beijing, China July 10-11, 2014 ...

  7. ICML历年Best Papers

    作者:我爱机器学习原文链接:ICML历年Best Papers ICML (Machine Learning)(1999-2016) 2016 Dueling Network Architecture ...

  8. CVPR历年Best Papers

    作者:我爱机器学习原文链接:CVPR历年Best Papers CVPR (Computer Vision)(2000-2016) 年份 标题 一作 一作单位 2016 Deep Residual L ...

  9. SIGKDD历年Best Papers

    作者:我爱机器学习原文链接:SIGKDD历年Best Papers SIGKDD(Data Mining)(1997-2016) 年份 标题 一作 一作单位 2016 FRAUDAR: Boundin ...

随机推荐

  1. Educational Codeforces Round 45 (Rated for Div. 2) G - GCD Counting

    G - GCD Counting 思路:我猜测了一下gcd的个数不会很多,然后我就用dfs回溯的时候用map暴力合并就好啦. 终判被卡了MLE.....  需要每次清空一下子树的map... #inc ...

  2. 安卓逆向之基于Xposed-ZjDroid脱壳

    http://bbs.pediy.com/thread-218798.htm     前言 之前介绍了普通常见的反编译模式 但对于使用了 360加固 棒棒 爱加密 等等的加固应用就没办法了. 你会发现 ...

  3. vue 父子间组件传值

    1.父组件向子组件传值: 实例截图: 实例代码: /*子组件代码*/ //child.vue <template> <div style="border: 1px soli ...

  4. Java工具类之浮点精确计算

    public class Arith { // 默认除法运算精度 private static final int DEF_DIV_SCALE = 10; // 构造器私有,让这个类不能实例化 pri ...

  5. 美团外卖Android Crash治理之路

    Crash率是衡量一个App好坏的重要指标之一,如果你忽略了它的存在,它就会愈演愈烈,最后造成大量用户的流失,进而给公司带来无法估量的损失.本文讲述美团外卖Android客户端团队在将App的Cras ...

  6. alpha冲刺阶段博客集合

    作业格式 课程名称:软件工程1916|W(福州大学) 作业要求:项目Alpha冲刺(团队) 团队名称: 那周余嘉熊掌将得队 作业目标:作业集合 团队信息: 队员学号 队员姓名 博客地址 备注 2216 ...

  7. 数据准备<5>:变量筛选-实战篇

    在上一篇文章<数据准备<4>:变量筛选-理论篇>中,我们介绍了变量筛选的三种方法:基于经验的方法.基于统计的方法和基于机器学习的方法,本文将介绍后两种方法在Python(skl ...

  8. vijos p1768 数学

    链接:点我 预处理:b[i][j]表示a[1] ... a[j]中比a[i]小的数的数量. 设 int get_lower_count(int b[], int l, int r) { return ...

  9. poj 3164

    朱刘算法 步骤: 1.计算出每个点边权最小的边的权(如果除根以外有其他的点没有入边,则不存在最小树形图),并记下边的另一个端点(称其为这个点的前趋) 2.沿着每个点向上走,如果在走到根或环上的点之前, ...

  10. the elements of computing systems 的读书笔记2

    懒癌发作,本来计划是两到三天就一个unit的,没想到一直拖到今天才完成第二部分(6-8章). 第6章,介绍了hack汇编到二进制,也就是用翻译到01来表示.从课后习题来看,这一章目的就是设计一个程序( ...