<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[GoJawee的博客]]></title><description><![CDATA[OpenCV、C/C++]]></description><link>https://blog.csdn.net/GoJawee</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; GoJawee]]></copyright><item><title><![CDATA[透视变换——鸟瞰图]]></title><link>https://blog.csdn.net/GoJawee/article/details/78347133</link><guid>https://blog.csdn.net/GoJawee/article/details/78347133</guid><author>GoJawee</author><pubDate>Wed, 25 Oct 2017 21:43:56 +0800</pubDate><description><![CDATA[http://www.cnblogs.com/liekkas0626/p/5262942.html#include <iostream> #include "highgui.h" 
#include "opencv2/imgproc/imgproc.hpp" int main() 
{ 
    // get original image. 
    cv::Mat originalImage =]]></description><category></category></item><item><title><![CDATA[MP4转.JPG]]></title><link>https://blog.csdn.net/GoJawee/article/details/78341648</link><guid>https://blog.csdn.net/GoJawee/article/details/78341648</guid><author>GoJawee</author><pubDate>Wed, 25 Oct 2017 15:02:48 +0800</pubDate><description><![CDATA[#include<opencv2\opencv.hpp>
#include <iostream>
#include <stdio.h>
#include<fstream> using namespace std;
using namespace cv;//获取视频中的人脸int main()
{
    //打开视频文件：其实就是建立一个VideoCapture结构  
    VideoCaptu]]></description><category></category></item><item><title><![CDATA[获取最大轮廓  opencv]]></title><link>https://blog.csdn.net/GoJawee/article/details/78338213</link><guid>https://blog.csdn.net/GoJawee/article/details/78338213</guid><author>GoJawee</author><pubDate>Wed, 25 Oct 2017 10:27:00 +0800</pubDate><description><![CDATA[http://blog.csdn.net/davebobo/article/details/52583167#include<iostream>    
#include <opencv2/core/core.hpp>      
#include <opencv2/highgui/highgui.hpp>   
#include<imgproc/imgproc.hpp>    using name]]></description><category></category></item><item><title><![CDATA[VideoCapture类]]></title><link>https://blog.csdn.net/GoJawee/article/details/78318630</link><guid>https://blog.csdn.net/GoJawee/article/details/78318630</guid><author>GoJawee</author><pubDate>Mon, 23 Oct 2017 14:37:31 +0800</pubDate><description><![CDATA[#include <opencv2/core/core.hpp>
#include <opencv2/highgui/highgui.hpp>
#include <opencv2/imgproc/imgproc.hpp>
#include <iostream>using namespace std;
using namespace cv;int main()
{
    //打开视频文件：其实就是建]]></description><category></category></item><item><title><![CDATA[FPS]]></title><link>https://blog.csdn.net/GoJawee/article/details/78226487</link><guid>https://blog.csdn.net/GoJawee/article/details/78226487</guid><author>GoJawee</author><pubDate>Fri, 13 Oct 2017 15:20:45 +0800</pubDate><description><![CDATA[#include <stdlib.h>
#include <iostream>
#include <opencv2/core/core.hpp>
#include <opencv2/highgui/highgui.hpp>
using namespace std;void main()
{
    cv::Mat frame;
    // 可从摄像头输入视频流或直接播放视频文件
    //cv:]]></description><category></category></item><item><title><![CDATA[VS2013导入opencv320配置属性文件]]></title><link>https://blog.csdn.net/GoJawee/article/details/78178185</link><guid>https://blog.csdn.net/GoJawee/article/details/78178185</guid><author>GoJawee</author><pubDate>Sun, 08 Oct 2017 22:34:26 +0800</pubDate><description><![CDATA[1.环境变量
D:\Libraries\OpenCV320\msvc2013_64\x64\vc12\binopencv320.props 配置文件<?xml version="1.0" encoding="utf-8"?>  
<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003]]></description><category></category></item><item><title><![CDATA[[2] SSD配置+训练VOC0712+训练自己的数据集]]></title><link>https://blog.csdn.net/GoJawee/article/details/78136430</link><guid>https://blog.csdn.net/GoJawee/article/details/78136430</guid><author>GoJawee</author><pubDate>Fri, 29 Sep 2017 18:32:01 +0800</pubDate><description><![CDATA[GitHub https://github.com/weiliu89/caffe/tree/ssdhttp://blog.csdn.net/u010733679/article/details/52125597一、安装配置sudo apt-get install -y liblapack-dev liblapack3 libopenblas-base libopenblas-dev---------]]></description><category></category></item><item><title><![CDATA[大津法python]]></title><link>https://blog.csdn.net/GoJawee/article/details/78043950</link><guid>https://blog.csdn.net/GoJawee/article/details/78043950</guid><author>GoJawee</author><pubDate>Wed, 20 Sep 2017 18:25:37 +0800</pubDate><description><![CDATA[http://blog.csdn.net/u012771236/article/details/44975831import numpy as np  def OTSU_enhance(img_gray, th_begin=0, th_end=256, th_step=1):  
    assert img_gray.ndim == 2, "must input a gary_img"]]></description><category></category></item><item><title><![CDATA[判断是否是平衡二叉树]]></title><link>https://blog.csdn.net/GoJawee/article/details/78015315</link><guid>https://blog.csdn.net/GoJawee/article/details/78015315</guid><author>GoJawee</author><pubDate>Mon, 18 Sep 2017 08:40:54 +0800</pubDate><description><![CDATA[#include<math.h>
#include <iostream>
#include<queue>
#include <string>
using namespace std;typedef struct TreeNode
{
    string data;
    struct TreeNode* lchild;
    struct TreeNode* rchild;
}TreeNode]]></description><category></category></item><item><title><![CDATA[反序列化（层序）]]></title><link>https://blog.csdn.net/GoJawee/article/details/78006298</link><guid>https://blog.csdn.net/GoJawee/article/details/78006298</guid><author>GoJawee</author><pubDate>Sat, 16 Sep 2017 20:35:31 +0800</pubDate><description><![CDATA[将序列生成层序遍历的二叉树]]></description><category></category></item><item><title><![CDATA[序列化（层序遍历）]]></title><link>https://blog.csdn.net/GoJawee/article/details/78006274</link><guid>https://blog.csdn.net/GoJawee/article/details/78006274</guid><author>GoJawee</author><pubDate>Sat, 16 Sep 2017 20:31:22 +0800</pubDate><description><![CDATA[使用层序遍历去遍历每一个节点，
当该结点为NULL时，str = str+"#!"
当该结点非NULL时，str = str+该节点的data+"!"
#include <iostream>
#include <vector>
#include<queue>
#include <string>
using namespace std;typedef struct TreeNode
{
    str]]></description><category></category></item><item><title><![CDATA[序列化（先序）]]></title><link>https://blog.csdn.net/GoJawee/article/details/77985048</link><guid>https://blog.csdn.net/GoJawee/article/details/77985048</guid><author>GoJawee</author><pubDate>Thu, 14 Sep 2017 20:47:09 +0800</pubDate><description><![CDATA[先序遍历的序列化操作：
使用先序遍历遍历每一个节点，
(1)当该结点的值为NULL时，返回"#!"
(2)当该结点的值不为NULL时，str = 当前节点的data + "!"；
(3)递归遍历左子树、右子树，最后返回T
string preSerialize(TreeNode* T)  //序列化
{
    if (!T)
        return "#!";    string str =]]></description><category></category></item><item><title><![CDATA[反序列化（先序）]]></title><link>https://blog.csdn.net/GoJawee/article/details/77984784</link><guid>https://blog.csdn.net/GoJawee/article/details/77984784</guid><author>GoJawee</author><pubDate>Thu, 14 Sep 2017 20:19:57 +0800</pubDate><description><![CDATA[要求：将vector<string> str容器中的字符串生成二叉树
解答：
    依次获取每一个字符串str[index]，进行序列化操作：
        先用str[index]生成根节点T
        再递归生成左子树T->lchild
        再递归生成右子树T->rchile
        最后返回生成的整棵树的根节点T#include <iostream>
using]]></description><category></category></item><item><title><![CDATA[反序列化（先序）——split : string-->vector<string>]]></title><link>https://blog.csdn.net/GoJawee/article/details/77984100</link><guid>https://blog.csdn.net/GoJawee/article/details/77984100</guid><author>GoJawee</author><pubDate>Thu, 14 Sep 2017 19:08:34 +0800</pubDate><description><![CDATA[反序列化：将string生成二叉树先序反序列化操作具体步骤：
（1）先将string字符串进行分割，生成多个string构成的集合保存在vector<string>中；
（2）将vec<string>中的每一个元素存入到queue<string>中/*****************************************************/（3）对queue<string>队列进行序]]></description><category></category></item><item><title><![CDATA[二叉树的先序/中序/后序（递归、非递归）+层序遍历]]></title><link>https://blog.csdn.net/GoJawee/article/details/77979133</link><guid>https://blog.csdn.net/GoJawee/article/details/77979133</guid><author>GoJawee</author><pubDate>Thu, 14 Sep 2017 13:01:44 +0800</pubDate><description><![CDATA[#include<iostream>
#include<stack>
#include<vector>using namespace std;typedef struct TreeNode
{
    int data;
    struct TreeNode* lchild;
    struct TreeNode* rchild;
}TreeNode;
void pretravel(TreeNo]]></description><category></category></item><item><title><![CDATA[获取视频的每一帧，并保存为.jpg图片]]></title><link>https://blog.csdn.net/GoJawee/article/details/77963223</link><guid>https://blog.csdn.net/GoJawee/article/details/77963223</guid><author>GoJawee</author><pubDate>Wed, 13 Sep 2017 10:55:40 +0800</pubDate><description><![CDATA[#include<opencv2\opencv.hpp>
#include <iostream>
#include <stdio.h>
#include<fstream> using namespace std;
using namespace cv;//获取视频中的人脸int main()
{
    //打开视频文件：其实就是建立一个VideoCapture结构  
    VideoCaptu]]></description><category></category></item><item><title><![CDATA[反转链表]]></title><link>https://blog.csdn.net/GoJawee/article/details/77962640</link><guid>https://blog.csdn.net/GoJawee/article/details/77962640</guid><author>GoJawee</author><pubDate>Wed, 13 Sep 2017 10:21:34 +0800</pubDate><description><![CDATA[#include<iostream>
using namespace std;typedef struct TNode
{
    int data;
    struct TNode* next;
}TNode;TNode* createL(int n) //创建链表
{
    TNode* head = NULL;
    TNode* tial = NULL;
    for (int i]]></description><category></category></item><item><title><![CDATA[链表划分为左小、中相等、右大]]></title><link>https://blog.csdn.net/GoJawee/article/details/77961452</link><guid>https://blog.csdn.net/GoJawee/article/details/77961452</guid><author>GoJawee</author><pubDate>Wed, 13 Sep 2017 08:36:08 +0800</pubDate><description><![CDATA[解题思路：将一个链表分成三个链表，最后重新连接三个链表
（1）分成三个链表的过程是一致的：以左小链表为例
    依次遍历原链表的每一个节点cur，当cur->data<pivot时，把cur取出，
添加到左小链表末尾，直到遍历完整个原链表为止。
（2）生成左小、中相等、右大链表后，怎么连接三个链表并返回头结点是难点！
    （因为不知道三个链表是否为空）#include<iostream>
us]]></description><category></category></item><item><title><![CDATA[往有序单循环链表的插入元素使原链表依旧有序]]></title><link>https://blog.csdn.net/GoJawee/article/details/77948837</link><guid>https://blog.csdn.net/GoJawee/article/details/77948837</guid><author>GoJawee</author><pubDate>Tue, 12 Sep 2017 19:42:07 +0800</pubDate><description><![CDATA[解题思路：与有序单链表类似，只不过加了尾指针指向链表头部#include<iostream>
using namespace std;typedef struct TNode
{
    int data;
    struct TNode* next;
}TNode;TNode* insertNum(TNode* head, int num)
{
    TNode* node = new TNo]]></description><category></category></item><item><title><![CDATA[往有序链表的插入元素使原链表依旧有序]]></title><link>https://blog.csdn.net/GoJawee/article/details/77948477</link><guid>https://blog.csdn.net/GoJawee/article/details/77948477</guid><author>GoJawee</author><pubDate>Tue, 12 Sep 2017 18:56:34 +0800</pubDate><description><![CDATA[在有序链表中插入元素时，最好设置两个指针，一前一后，
cur指针负责比较大小，pre指针负责定位插入位置的前驱。
#include<iostream>
using namespace std;typedef struct TNode
{
    int data;
    struct TNode *next;
}TNode;TNode* insertNum(TNode* head, int dat]]></description><category></category></item></channel></rss>