Eternity的博客

Opencv3.2+opencv_contrib+VS2015配置问题汇总

《Object localization by efficient subwindow search》论文中的Efficient Subwindow Search高效的子窗口搜索算法， Christoph H.Lampert 提出的efficient sub window search 从另一个角度加速检测效率。作者提出Branch-and-Bound Search，其主要思想便是不

这段时间我主要完成了： 一、研读《Selective Search for Object Recognition》论文解析（重点学习）：          1、在博客上找关于SelectiveSearch算法的基本原理并理解阅读。          2、查阅关于SelectiveSearch算法前提知识的学习。          3、利用OpenCV2.4.13+VS2015实现Selec

这段时间我主要完成了： 一、《Selective Search for Object Recognition》（重点学习）：        1、对代码每一步，甚至每一个变量含义都看懂。        2、修改源代码，使其能够在自己建立的环境下运行。        3、对代码进行单步调试，对照论文中介绍的算法再次加深理解。        4、获得实验结果。 二、bag of visual

There are two sorted arraysnums1andnums2of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). You may assumenums1andn...

You are given twonon-emptylinked lists representing two non-negative integers. The digits are stored inreverse orderand each of their nodes contain a single digit. Add the two numbers and return i...

Given an array of integers, returnindicesof the two numbers such that they add up to a specific target. You may assume that each input would haveexactlyone solution, and you may not use thesame...

Given a string, find the length of thelongest substringwithout repeating characters. Example 1: Input: "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3. Example 2: ...

Givennnon-negative integersa1,a2, ...,an, where each represents a point at coordinate (i,ai).nvertical lines are drawn such that the two endpoints of lineiis at (i,ai) and (i, 0). Find two...