<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[LouYihang的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/LouYihang</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; LouYihang]]></copyright><item><title><![CDATA[Hog SVM 车辆识别]]></title><link>https://blog.youkuaiyun.com/LouYihang/article/details/46954017</link><guid>https://blog.youkuaiyun.com/LouYihang/article/details/46954017</guid><author>LouYihang</author><pubDate>Sun, 19 Jul 2015 12:37:02 +0800</pubDate><description><![CDATA[HOG SVM 车辆检测　　近期需要对卡口车辆的车脸进行检测，首先选用一个常规的检测方法即是hog特征与SVM，Hog特征是由dalal在2005年提出的用于道路中行人检测的方法，并且取的了不错的识别效果。在人脸检测方面目前主流的方法，先不考虑复杂的深度学习，大多采用Haar和Adaboost的手段来实现。我接下来将会用着两种方法来实现对卡口的车辆检测。 
　　首先引出 Hog特征，Hog特征是梯度]]></description><category></category></item><item><title><![CDATA[视频标注工具]]></title><link>https://blog.youkuaiyun.com/LouYihang/article/details/46406219</link><guid>https://blog.youkuaiyun.com/LouYihang/article/details/46406219</guid><author>LouYihang</author><pubDate>Sun, 07 Jun 2015 23:43:49 +0800</pubDate><description><![CDATA[视频标注工具由于实验室里面需要做CDVA的标准，CDVA（compact descriptor for video analysis），主要是基于CDVS中的紧凑视觉描述子来做视频分析，之前是紧凑视觉描述子主要应用在图像检索领域。需要制作新的数据集，对视频帧进行标注，所以根据网上一个博主的标注工具进行了一定的修改，实现的功能是在每一帧中将需要标注的区域用鼠标选取4个点，顺序是顺时针。因为四边形的范围]]></description><category></category></item><item><title><![CDATA[LeetCode 3 Longest String]]></title><link>https://blog.youkuaiyun.com/LouYihang/article/details/46406173</link><guid>https://blog.youkuaiyun.com/LouYihang/article/details/46406173</guid><author>LouYihang</author><pubDate>Sun, 07 Jun 2015 23:40:21 +0800</pubDate><description><![CDATA[#LeetCode 3 Longest Substring Without Repeating Characters  解题报告 
 LeetCode 第3题3 Longest Substring Without Repeating Characters 首先我们看题目要求： 
Given a string, find the length of the longest substring with]]></description><category></category></item><item><title><![CDATA[LeetCodeOJ2 Add Two Sum]]></title><link>https://blog.youkuaiyun.com/LouYihang/article/details/46406157</link><guid>https://blog.youkuaiyun.com/LouYihang/article/details/46406157</guid><author>LouYihang</author><pubDate>Sun, 07 Jun 2015 23:38:59 +0800</pubDate><description><![CDATA[LeetCode 2 Add Two Sum 解题报告LeetCode第二题 Add Two Sum 首先我们看题目要求：You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain]]></description><category></category></item><item><title><![CDATA[LeetCodeOJ1 Two Sum]]></title><link>https://blog.youkuaiyun.com/LouYihang/article/details/46406151</link><guid>https://blog.youkuaiyun.com/LouYihang/article/details/46406151</guid><author>LouYihang</author><pubDate>Sun, 07 Jun 2015 23:38:11 +0800</pubDate><description><![CDATA[LeetCode 1 Two Sum 解题报告偶然间听见leetcode这个平台，这里面题量也不是很多200多题，打算平时有空在研究生期间就刷完，跟跟多的练习算法的人进行交流思想，一定的ACM算法积累可以对以后在对算法中优化带来好处。Ok，今天是我做的第一题Add Two Sum。 
题目要求 
Given an array of integers, find two numbers such th]]></description><category></category></item></channel></rss>