<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[喵喵喵]]></title><description><![CDATA[Don't be pushed by your problems. Be led by your dreams.]]></description><link>https://blog.youkuaiyun.com/renzijing</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; renzijing]]></copyright><item><title><![CDATA[gdal加入ecw支持（暂未解决）]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/121272896</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/121272896</guid><author>renzijing</author><pubDate>Thu, 11 Nov 2021 17:49:50 +0800</pubDate><description><![CDATA[由于数据格式为ecw，直接安装gdal库不支持该格式的读取，所以需要在gdal库中下载编译支持ecw的插件。
先通过运行 conda search gdal查看版本号，接着conda install gdal=版本号 下载对应版本的gdal，再按照trac网站的教程加入ecw的支持时，但运行命令 apt-get install gdal-ecw-src由于无法定位到libgdal-ecw-src包，无法继续下载。
后通过conda卸载gdal，下载gdal和ERDAS ECW JP2 SDK v5.4 Li]]></description><category></category></item><item><title><![CDATA[Digging into Detectron2 个人总结]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/121019420</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/121019420</guid><author>renzijing</author><pubDate>Thu, 28 Oct 2021 17:37:42 +0800</pubDate><description><![CDATA[个人对[Digging into Detectron2]的不完全总结(https://medium.com/@hirotoschwert/digging-into-detectron-2-47b2e794fabd)


]]></description><category></category></item><item><title><![CDATA[目标检测tricks（基于detectron2）]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/121019127</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/121019127</guid><author>renzijing</author><pubDate>Thu, 28 Oct 2021 17:24:24 +0800</pubDate><description><![CDATA[目标检测tricks（基于detectron2）
正确尝试
裁剪
由于目标相对于整张图片来说过小，所以对数据进行裁剪（除了裁剪尺寸还需要关注重叠尺寸，重叠尺寸稍微大一些，尽量保持每个目标有完整的存在，不至于因裁剪而破坏目标，这里设置裁剪512，重叠256）
参考代码：DOTA_devkit
改变anchor size和aspect_ratio
由于数据目标较小，所以需要更改detectron2里默认的anchor.size和aspect_ratio
cfg.MODEL.ANCHOR_GENERATOR.SI]]></description><category></category></item><item><title><![CDATA[错误记录帖(持续更新)]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/120885454</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/120885454</guid><author>renzijing</author><pubDate>Thu, 21 Oct 2021 14:31:57 +0800</pubDate><description><![CDATA[错误记录帖]]></description><category></category></item><item><title><![CDATA[关于数据增强]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/119059624</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/119059624</guid><author>renzijing</author><pubDate>Sun, 25 Jul 2021 19:14:52 +0800</pubDate><description><![CDATA[数据增强
线下：事先执行所有转换，实质上会增加的数据集的大小，适用于较小的数据集。
线上：在送入机器学习之前，在小批量（mini-batch）上执行这些转换，适用于较大的数据集，一些机器学习框架支持在线增强，可以在GPU上加速。
主要有以下几类：

几何变换：例如平移、旋转、翻转、缩放等。（有小目标，必须裁剪
颜色变换：①噪声：为了让模型更加鲁棒，可以考虑在训练集内加入高斯噪声、椒盐噪声等对模型进行干扰。② 颜色扰动：改变亮度、灰度、饱和度、对比度等，色调归一化
类别不平衡（待补充）：重采样；实例平衡增强
]]></description><category></category></item><item><title><![CDATA[Nested Lists  set dict以及sorted的使用]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/100008899</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/100008899</guid><author>renzijing</author><pubDate>Thu, 22 Aug 2019 10:09:32 +0800</pubDate><description><![CDATA[链接在这里

Given the names and grades for each student in a Physics class of Nstudents, store them in a nested list and print the name(s) of any student(s) having the second lowest grade.

Note: If ther...]]></description><category></category></item><item><title><![CDATA[2019杭电多校第二场 H  Harmonious Army 网络流最小割]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/97750729</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/97750729</guid><author>renzijing</author><pubDate>Tue, 30 Jul 2019 09:20:34 +0800</pubDate><description><![CDATA[问题 H: Harmonious Army

时间限制:1 Sec内存限制:128 MB
提交:63解决:20
[提交] [状态] [命题人:admin]

题目描述

Now, Bob is playing an interesting game in which he is a general of a harmonious army. There are n soldiers...]]></description><category></category></item><item><title><![CDATA[2019牛客第四场 J free  分层图最短路]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/97549553</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/97549553</guid><author>renzijing</author><pubDate>Sat, 27 Jul 2019 20:08:17 +0800</pubDate><description><![CDATA[链接：https://ac.nowcoder.com/acm/contest/884/J
来源：牛客网


时间限制：C/C++ 1秒，其他语言2秒
空间限制：C/C++ 524288K，其他语言1048576K
64bit IO Format: %lld

题目描述

Your are given an undirect connected graph.Every edge has a cos...]]></description><category></category></item><item><title><![CDATA[2019杭电多校第一场 B Operation]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/97491815</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/97491815</guid><author>renzijing</author><pubDate>Sat, 27 Jul 2019 10:40:01 +0800</pubDate><description><![CDATA[问题 B: Operation

时间限制:5 Sec内存限制:256 MB
提交:218解决:43
[提交] [状态] [命题人:admin]

题目描述

There is an integer sequence a of length n and there are two kinds of operations:
0 l r: select some numbers fro...]]></description><category></category></item><item><title><![CDATA[2019杭电多校第二场  K  Keen On Everything But Triangle 主席树]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/97300648</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/97300648</guid><author>renzijing</author><pubDate>Thu, 25 Jul 2019 21:06:16 +0800</pubDate><description><![CDATA[问题 K: Keen On Everything But Triangle

时间限制:3 Sec内存限制:128 MB
提交:155解决:34
[提交] [状态] [命题人:admin]

题目描述

N sticks are arranged in a row, and their lengths are a1,a2,...,aN.
There are Q querys. Fo...]]></description><category></category></item><item><title><![CDATA[UPC12770 小L的有向图 拓扑序个数]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/95528648</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/95528648</guid><author>renzijing</author><pubDate>Thu, 11 Jul 2019 22:34:45 +0800</pubDate><description><![CDATA[问题 H: 小L的有向图

时间限制:1 Sec内存限制:128 MB
提交:19解决:10
[提交] [状态] [命题人:admin]

题目描述

小L有一个n个点m条边有向图，定义一个图的价值为合法的拓扑序个数。
一天，小L想知道她的这个图的价值，小D想烤烤小L，她对图施了魔法，图中的每条边都有可能消失，小L想知道所有可能的情况的图的价值和，即2^m种图的价值和，答案对998...]]></description><category></category></item><item><title><![CDATA[矩阵求斐波那契数列第n项]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/94465124</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/94465124</guid><author>renzijing</author><pubDate>Tue, 02 Jul 2019 18:16:30 +0800</pubDate><description><![CDATA[记一个板子原博客在这


​
#include&lt;bits/stdc++.h&gt;

using namespace std;
const int MAX = 10;
#define __int64 long long
#define Bit(n) 1&lt;&lt;n
#define CLR(arr, val) memset(arr,val,sizeof(arr))
const int ...]]></description><category></category></item><item><title><![CDATA[2019上海市高校大学生程序设计邀请赛（华东理工） C 小花梨判连通 并查集+map]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/90488972</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/90488972</guid><author>renzijing</author><pubDate>Thu, 23 May 2019 22:06:05 +0800</pubDate><description><![CDATA[问题 C: 小花梨判连通

时间限制:1 Sec内存限制:128 MB
提交:71解决:33
[提交] [状态] [命题人:admin]

题目描述

小花梨给出n个点，让k位同学对这n个点任意添加无向边，构成k张图。小花梨想知道对于每个点i，存在多少个点j（包括i本身），使得i和j在这k张图中都是连通的。



输入

第一行输入两个正整数n和k，分别表示点的个数和同学数。
接...]]></description><category></category></item><item><title><![CDATA[洛谷p5300  与或和  求全1/0矩阵个数 单调栈]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/90287716</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/90287716</guid><author>renzijing</author><pubDate>Fri, 17 May 2019 10:33:26 +0800</pubDate><description><![CDATA[问题 C: 与或和

时间限制:4 Sec内存限制:512 MB
提交:275解决:76
[提交] [状态] [命题人:admin]

题目描述

Freda 学习了位运算和矩阵以后，决定对这种简洁而优美的运算，以及蕴含深邃空间的结构进行更加深入的研究。
对于一个由非负整数构成的矩阵，她定义矩阵的AND值为矩阵中所有数二进制AND（&amp;）的运算结果；定义矩阵的OR值为矩阵中所...]]></description><category></category></item><item><title><![CDATA[2019山东省赛 zoj 4117 E BaoBao Loves Reading  思维+树状数组]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/90239988</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/90239988</guid><author>renzijing</author><pubDate>Wed, 15 May 2019 17:06:42 +0800</pubDate><description><![CDATA[BaoBao Loves Reading

Time Limit:1 Second Memory Limit:65536 KB

BaoBao is a good student who loves reading, but compared with his huge bookshelf containing lots and lots of books, his reading ...]]></description><category></category></item><item><title><![CDATA[2019山东省赛总结]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/90230550</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/90230550</guid><author>renzijing</author><pubDate>Wed, 15 May 2019 10:17:54 +0800</pubDate><description><![CDATA[一. 省赛总结

   这次省赛前三个小时非常顺，顺到我们不约而同的想到了不会是没有加数据吧，前期题目几乎都是一遍过，也就是因为罚时几乎没有，所以我们侥幸成为唯一一个7题拿金的队，但是后两个小时还是出现了一些问题。

  ①首先是出现了贪多的心理，没有及时三个人抓一道题，而是让另外一个人去看我们都没什么思路且不是他主要负责范围的题；

  ②有一点问题在我，在队友提出一个结论时...]]></description><category></category></item><item><title><![CDATA[poj 2451 半平面交　板子]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/89763453</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/89763453</guid><author>renzijing</author><pubDate>Thu, 02 May 2019 18:02:30 +0800</pubDate><description><![CDATA[poj 2451

半平面，一条直线可以把平面分成两部分，即称为半平面

半平面交，即多条直线划分出的相交的平面的面积

学习大佬的代码，清晰易懂，打算当成以后的模板用了

代码(基于poj 2451)：


#include &lt;bits/stdc++.h&gt;
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;c...]]></description><category></category></item><item><title><![CDATA[UPC Segment Tree 找规律　二进制]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/89740866</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/89740866</guid><author>renzijing</author><pubDate>Wed, 01 May 2019 21:40:37 +0800</pubDate><description><![CDATA[问题 G: Segment Tree

时间限制:1 Sec内存限制:512 MB
提交:74解决:17
[提交] [状态] [命题人:admin]

题目描述

Mcginn opens the code which he wrote 25 years ago.
Clever Mcginn wants to know how many positive interger n sa...]]></description><category></category></item><item><title><![CDATA[UPC Game Night  思维]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/89527363</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/89527363</guid><author>renzijing</author><pubDate>Thu, 25 Apr 2019 22:08:46 +0800</pubDate><description><![CDATA[问题 G: Game Night

时间限制:1 Sec内存限制:128 MB
提交:42解决:16
[提交] [状态] [命题人:admin]

题目描述

It is finally Bobby’s birthday, and all of his Acquaintances,Buddies and Colleagues have gathered for a board ga...]]></description><category></category></item><item><title><![CDATA[CH6202　黑暗城堡　最短路径生成树]]></title><link>https://blog.youkuaiyun.com/renzijing/article/details/89438350</link><guid>https://blog.youkuaiyun.com/renzijing/article/details/89438350</guid><author>renzijing</author><pubDate>Sun, 21 Apr 2019 20:20:18 +0800</pubDate><description><![CDATA[问题 G: 黑暗城堡

时间限制:1 Sec内存限制:128 MB
提交:30解决:11
[提交] [状态] [命题人:admin]

题目描述

在顺利攻破Lord lsp的防线之后，lqr一行人来到了Lord lsp的城堡下方。Lord lsp黑化之后虽然拥有了强大的超能力，能够用意念力制造建筑物，但是智商水平却没怎么增加。现在lqr已经搞清楚黑暗城堡有N个房间 (1≤N≤10...]]></description><category></category></item></channel></rss>