-
Notifications
You must be signed in to change notification settings - Fork 0
/
index.html
88 lines (87 loc) · 34.1 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
<!doctype html>
<html lang="zh"><head><meta charset="utf-8"><meta name="generator" content="Hexo 4.2.0"><meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=1"><meta><title>Digital Shiyu</title><meta description="Trying to be everything about me"><meta property="og:type" content="blog"><meta property="og:title" content="Digital Shiyu"><meta property="og:url" content="http://yoursite.com/"><meta property="og:site_name" content="Digital Shiyu"><meta property="og:description" content="Trying to be everything about me"><meta property="og:locale" content="zh_CN"><meta property="og:image" content="http://yoursite.com/img/og_image.png"><meta property="article:author" content="shiyu AllRightsReserved"><meta property="article:tag" content="work"><meta property="article:tag" content=" life"><meta property="article:tag" content=" thoughts"><meta property="twitter:card" content="summary"><meta property="twitter:image" content="/img/og_image.png"><script type="application/ld+json">{"@context":"https://schema.org","@type":"BlogPosting","mainEntityOfPage":{"@type":"WebPage","@id":"http://yoursite.com"},"headline":"Digital Shiyu","image":["http://yoursite.com/img/og_image.png"],"author":{"@type":"Person","name":"shiyu AllRightsReserved"},"description":"Trying to be everything about me"}</script><link rel="icon" href="/img/digitalpre.png"><link rel="stylesheet" href="https://use.fontawesome.com/releases/v5.12.0/css/all.css"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/highlight.js@9.12.0/styles/atom-one-light.css"><link rel="stylesheet" href="https://fonts.googleapis.com/css2?family=Ubuntu:wght@400;600&family=Source+Code+Pro"><link rel="stylesheet" href="/css/default.css"><!--!--><!--!--><script src="//busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js" defer></script><!--!--><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/lightgallery@1.6.8/dist/css/lightgallery.min.css"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/justifiedGallery@3.7.0/dist/css/justifiedGallery.min.css"><script src="https://www.googletagmanager.com/gtag/js?id=UA-165282104-1" async></script><script>window.dataLayer = window.dataLayer || [];
function gtag(){dataLayer.push(arguments);}
gtag('js', new Date());
gtag('config', 'UA-165282104-1');</script><!--!--><!--!--><script src="https://cdn.jsdelivr.net/npm/pace-js@1.0.2/pace.min.js"></script></head><body class="is-2-column"><nav class="navbar navbar-main"><div class="container"><div class="navbar-brand justify-content-center"><a class="navbar-item navbar-logo" href="/"><img src="/img/Digital.png" alt="Digital Shiyu" height="28"></a></div><div class="navbar-menu"><div class="navbar-start"><a class="navbar-item is-active" href="/">主页</a><a class="navbar-item" href="/archives">存档</a><a class="navbar-item" href="/categories">分类</a><a class="navbar-item" href="/tags">标签</a><a class="navbar-item" href="/about">关于</a></div><div class="navbar-end"><a class="navbar-item search" title="搜索" href="javascript:;"><i class="fas fa-search"></i></a></div></div></div></nav><section class="section"><div class="container"><div class="columns"><div class="column order-2 column-main is-8-tablet is-8-desktop is-8-widescreen"><div class="card"><div class="card-image"><a class="image is-7by3" href="/2020/12/17/CPP/12_%E5%AE%9A%E4%B9%89%E6%8A%BD%E8%B1%A1%E6%95%B0%E6%8D%AE%E7%B1%BB%E5%9E%8B/"><img class="thumbnail" src="/gallery/cpp.png" alt="【Accelerated C++】 -- 12/16 定义抽象数据类型"></a></div><article class="card-content article" role="article"><div class="article-meta size-small is-uppercase level is-mobile"><div class="level-left"><time class="level-item" dateTime="2020-12-17T01:08:01.000Z" title="2020-12-17T01:08:01.000Z">2020-12-17</time><span class="level-item"><a class="link-muted" href="/categories/cpp/">cpp</a></span><span class="level-item">24 分钟 读完 (大约 3575 个字)</span></div></div><h1 class="title is-3 is-size-4-mobile"><a class="link-muted" href="/2020/12/17/CPP/12_%E5%AE%9A%E4%B9%89%E6%8A%BD%E8%B1%A1%E6%95%B0%E6%8D%AE%E7%B1%BB%E5%9E%8B/">【Accelerated C++】 -- 12/16 定义抽象数据类型</a></h1><div class="content"><p>学习要点：</p>
<ol>
<li>Vec 抽象类的基本要素</li>
<li>三位一体—构造函数，析构函数，复制构造函数<br> 1.1 复制构造函数<br> 1.2 赋值运算符函数<br> 1.3 析构函数<br> 1.4 编译器合成构造函数等</li>
<li>类的内存管理<br> 2.1 类的扩展<br> 2.2 allocator 库</li>
</ol></div><a class="article-more button is-small size-small" href="/2020/12/17/CPP/12_%E5%AE%9A%E4%B9%89%E6%8A%BD%E8%B1%A1%E6%95%B0%E6%8D%AE%E7%B1%BB%E5%9E%8B/#more">阅读更多</a></article></div><div class="card"><div class="card-image"><a class="image is-7by3" href="/2020/12/15/CPP/11_%E7%AE%A1%E7%90%86%E5%86%85%E5%AD%98%E5%92%8C%E4%BD%8E%E7%BA%A7%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/"><img class="thumbnail" src="/gallery/cpp.png" alt="【Accelerated C++】 -- 11/16 管理内存和低级数据结构"></a></div><article class="card-content article" role="article"><div class="article-meta size-small is-uppercase level is-mobile"><div class="level-left"><time class="level-item" dateTime="2020-12-15T12:40:14.000Z" title="2020-12-15T12:40:14.000Z">2020-12-15</time><span class="level-item"><a class="link-muted" href="/categories/cpp/">cpp</a></span><span class="level-item">17 分钟 读完 (大约 2483 个字)</span></div></div><h1 class="title is-3 is-size-4-mobile"><a class="link-muted" href="/2020/12/15/CPP/11_%E7%AE%A1%E7%90%86%E5%86%85%E5%AD%98%E5%92%8C%E4%BD%8E%E7%BA%A7%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/">【Accelerated C++】 -- 11/16 管理内存和低级数据结构</a></h1><div class="content"><p>学习要点：</p>
<ol>
<li>指针和数组</li>
<li>字符串常量—常量字符数组<br> 1.1 字符串指针数组<br> 1.2 指向字符指针的指针作为 main 函数参数<br> 1.3 字符指针初始化文件输入输出流</li>
<li>三种内存分配方法</li>
</ol></div><a class="article-more button is-small size-small" href="/2020/12/15/CPP/11_%E7%AE%A1%E7%90%86%E5%86%85%E5%AD%98%E5%92%8C%E4%BD%8E%E7%BA%A7%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/#more">阅读更多</a></article></div><div class="card"><div class="card-image"><a class="image is-7by3" href="/2020/12/14/CPP/10_%E5%AE%9A%E4%B9%89%E6%96%B0%E7%B1%BB%E5%9E%8B/"><img class="thumbnail" src="/gallery/cpp.png" alt="【Accelerated C++】 -- 10/16 自定义新类"></a></div><article class="card-content article" role="article"><div class="article-meta size-small is-uppercase level is-mobile"><div class="level-left"><time class="level-item" dateTime="2020-12-14T08:35:29.000Z" title="2020-12-14T08:35:29.000Z">2020-12-14</time><span class="level-item"><a class="link-muted" href="/categories/cpp/">cpp</a></span><span class="level-item">10 分钟 读完 (大约 1563 个字)</span></div></div><h1 class="title is-3 is-size-4-mobile"><a class="link-muted" href="/2020/12/14/CPP/10_%E5%AE%9A%E4%B9%89%E6%96%B0%E7%B1%BB%E5%9E%8B/">【Accelerated C++】 -- 10/16 自定义新类</a></h1><div class="content"><p>学习要点：</p>
<ol>
<li>新类型</li>
<li>新类型的封装和数据保护<br>1.1 成员函数、存取器<br>1.2 private/public</li>
<li>新类型的初始化</li>
</ol></div><a class="article-more button is-small size-small" href="/2020/12/14/CPP/10_%E5%AE%9A%E4%B9%89%E6%96%B0%E7%B1%BB%E5%9E%8B/#more">阅读更多</a></article></div><div class="card"><div class="card-image"><a class="image is-7by3" href="/2020/11/27/%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/NIPs_SpcL/"><img class="thumbnail" src="/gallery/SpcL.png" alt="Domain adaptation - SpcL"></a></div><article class="card-content article" role="article"><div class="article-meta size-small is-uppercase level is-mobile"><div class="level-left"><time class="level-item" dateTime="2020-11-27T02:08:24.000Z" title="2020-11-27T02:08:24.000Z">2020-11-27</time><span class="level-item"><a class="link-muted" href="/categories/%E9%A2%86%E5%9F%9F%E8%87%AA%E9%80%82%E5%BA%94/">领域自适应</a></span><span class="level-item">12 分钟 读完 (大约 1789 个字)</span></div></div><h1 class="title is-3 is-size-4-mobile"><a class="link-muted" href="/2020/11/27/%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/NIPs_SpcL/">Domain adaptation - SpcL</a></h1><div class="content"><p><img src="/Pics/spcltitile.png" alt="Title"></p>
<h3 id="1-问题背景："><a href="#1-问题背景：" class="headerlink" title="1. 问题背景："></a>1. 问题背景：</h3><p> 解决行人重识别任务中的领域自适应问题，在源域行人重识别数据集中学习的知识，在新的数据集下应用。即给定数据集 A 下行人/车辆的标签，在没有标签的数据集 B 的测试集中进行检索的测试—给定一个监控行人图像，检索跨设备下的该行人图像。注意到，数据集 A 和数据集 B 中往往是不同的行人，即源域和目标域的标签不重叠</p>
<ul>
<li><p>对比方法： 使用源域数据进行模型预训练，随后使用目标域聚类生成的伪标签来促使模型分类边界适应目标域。</p>
</li>
<li><p>对比方法缺点： 1. 只有预训练没有充分利用源域信息； 2. 目标域聚类中最后的 outlier 难样本被抛弃，削弱了目标域中有用的信息 </p></div><a class="article-more button is-small size-small" href="/2020/11/27/%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/NIPs_SpcL/#more">阅读更多</a></article></div><div class="card"><div class="card-image"><a class="image is-7by3" href="/2020/11/19/CPP/09_%E7%BC%96%E5%86%99%E6%B3%9B%E5%9E%8B%E5%87%BD%E6%95%B0/"><img class="thumbnail" src="/gallery/cpp.png" alt="【Accelerated C++】 -- 09/16 编写泛型函数"></a></div><article class="card-content article" role="article"><div class="article-meta size-small is-uppercase level is-mobile"><div class="level-left"><time class="level-item" dateTime="2020-11-19T09:06:08.000Z" title="2020-11-19T09:06:08.000Z">2020-11-19</time><span class="level-item"><a class="link-muted" href="/categories/cpp/">cpp</a></span><span class="level-item">13 分钟 读完 (大约 1909 个字)</span></div></div><h1 class="title is-3 is-size-4-mobile"><a class="link-muted" href="/2020/11/19/CPP/09_%E7%BC%96%E5%86%99%E6%B3%9B%E5%9E%8B%E5%87%BD%E6%95%B0/">【Accelerated C++】 -- 09/16 编写泛型函数</a></h1><div class="content"><p>学习要点：</p>
<ol>
<li>泛型函数：定义和示例<br>1.1 泛型函数：模板实例化的要求<br>1.2 泛型函数：泛型函数对参数的约束</li>
<li>迭代器实现数据结构的独立性<br>2.1 五种迭代器<br>2.2 泛型函数加迭代器生成多种输出—split 函数示例</li>
<li>迭代器其他：<br>3.1 输入输出迭代器<br>3.2 迭代器区间和越界值</li>
</ol></div><a class="article-more button is-small size-small" href="/2020/11/19/CPP/09_%E7%BC%96%E5%86%99%E6%B3%9B%E5%9E%8B%E5%87%BD%E6%95%B0/#more">阅读更多</a></article></div><div class="card"><div class="card-image"><a class="image is-7by3" href="/2020/11/18/CPP/08_%E4%BD%BF%E7%94%A8%E5%85%B3%E8%81%94%E5%AE%B9%E5%99%A8/"><img class="thumbnail" src="/gallery/cpp.png" alt="【Accelerated C++】 -- 08/16 使用关联容器"></a></div><article class="card-content article" role="article"><div class="article-meta size-small is-uppercase level is-mobile"><div class="level-left"><time class="level-item" dateTime="2020-11-18T01:22:34.000Z" title="2020-11-18T01:22:34.000Z">2020-11-18</time><span class="level-item"><a class="link-muted" href="/categories/cpp/">cpp</a></span><span class="level-item">8 分钟 读完 (大约 1244 个字)</span></div></div><h1 class="title is-3 is-size-4-mobile"><a class="link-muted" href="/2020/11/18/CPP/08_%E4%BD%BF%E7%94%A8%E5%85%B3%E8%81%94%E5%AE%B9%E5%99%A8/">【Accelerated C++】 -- 08/16 使用关联容器</a></h1><div class="content"><p>学习要点：</p>
<ol>
<li>关联容器：依赖元素本身值进行排序的容器—快速元素定位</li>
<li>常用的关联数组—映射表map</li>
<li>计算单词数</li>
<li>建立交叉引用表</li>
<li>生成句子</li>
</ol></div><a class="article-more button is-small size-small" href="/2020/11/18/CPP/08_%E4%BD%BF%E7%94%A8%E5%85%B3%E8%81%94%E5%AE%B9%E5%99%A8/#more">阅读更多</a></article></div><div class="card"><div class="card-image"><a class="image is-7by3" href="/2020/11/15/CPP/07_%E4%BD%BF%E7%94%A8%E5%BA%93%E7%AE%97%E6%B3%95/"><img class="thumbnail" src="/gallery/cpp.png" alt="【Accelerated C++】 -- 07/16 使用库算法"></a></div><article class="card-content article" role="article"><div class="article-meta size-small is-uppercase level is-mobile"><div class="level-left"><time class="level-item" dateTime="2020-11-15T12:59:03.000Z" title="2020-11-15T12:59:03.000Z">2020-11-15</time><span class="level-item"><a class="link-muted" href="/categories/cpp/">cpp</a></span><span class="level-item">10 分钟 读完 (大约 1544 个字)</span></div></div><h1 class="title is-3 is-size-4-mobile"><a class="link-muted" href="/2020/11/15/CPP/07_%E4%BD%BF%E7%94%A8%E5%BA%93%E7%AE%97%E6%B3%95/">【Accelerated C++】 -- 07/16 使用库算法</a></h1><div class="content"><p>学习要点：</p>
<ol>
<li>类型修饰符 static</li>
<li>类型 void</li>
<li>迭代器适配器 back_inserter, front_inseter, inseter</li>
<li>库算法： 求和，查找，复制，批量作用，分隔（满足条件/不满足条件分开）</li>
<li>讨论：库算法设计中的分离思想 — 灵活，高复用度；函数作为参数时，重载带来的困难</li>
<li>其他：使用迭代器构造vector/string；如果容器支持索引，那么它的迭代器也支持；向量的成员函数 empty — 比统计大小更有效率</li>
</ol></div><a class="article-more button is-small size-small" href="/2020/11/15/CPP/07_%E4%BD%BF%E7%94%A8%E5%BA%93%E7%AE%97%E6%B3%95/#more">阅读更多</a></article></div><div class="card"><div class="card-image"><a class="image is-7by3" href="/2020/11/11/%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/ChangeDetection_Unet++/"><img class="thumbnail" src="/gallery/UNETPP.png" alt="Change Detection - End-to-End Change Detection for High Resolution Satellite Images Using Improved UNet++"></a></div><article class="card-content article" role="article"><div class="article-meta size-small is-uppercase level is-mobile"><div class="level-left"><time class="level-item" dateTime="2020-11-11T05:48:14.000Z" title="2020-11-11T05:48:14.000Z">2020-11-11</time><span class="level-item"><a class="link-muted" href="/categories/%E5%8F%98%E5%8C%96%E6%A3%80%E6%B5%8B/">变化检测</a></span><span class="level-item">5 分钟 读完 (大约 772 个字)</span></div></div><h1 class="title is-3 is-size-4-mobile"><a class="link-muted" href="/2020/11/11/%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/ChangeDetection_Unet++/">Change Detection - End-to-End Change Detection for High Resolution Satellite Images Using Improved UNet++</a></h1><div class="content"><h2 id="主要思想"><a href="#主要思想" class="headerlink" title="主要思想"></a>主要思想</h2><p>基于 Unet++ 的网络结构，设计了多输出采用Sigmoid 融合的方式提升不同层次信息的利用，并使用 dice loss 减少变化检测中样本不均衡的影响</p>
<ul>
<li><p>Unet++：和 Unet 同样采用了即在上采样下采样的方式，增加感受野提取更多信息，随后采用跳接的方式将抽象的信息和对应的低层的信息融合，不同的是，在 Unet++ 中，跳接采用了类似 densenet 的想法，将上采样相同大小的输出特征和之前的 concatenate，而之前层次是下采样到更浅尺度就上采样的结果，因此在另一个角度实现了多层信息融合，并累加的短路连接促使梯度更方便传播和网络训练的收敛。</p>
</li>
<li><p>MSOF：基于之前提到了多尺度下上采样，我们会获得多个最终特征，作者将多个特征经过Sigmoid得到的结果 concatenate 并最后使用 Sigmoid 融合，一定程度上提升了效果。</p>
</li>
</ul>
<ul>
<li>Dice Loss: dice loss 仅仅关注每个像素真值和对应输出概率的相似性，而不考虑样本的正负性，从而减少了变化检测中样本不均衡的影响</li>
</ul></div><a class="article-more button is-small size-small" href="/2020/11/11/%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/ChangeDetection_Unet++/#more">阅读更多</a></article></div><div class="card"><div class="card-image"><a class="image is-7by3" href="/2020/11/10/%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/ChangeDetection_FullyConvolutionSiameseNetworkforChangeDetection/"><img class="thumbnail" src="/gallery/CD_siamres.png" alt="Change Detection - Fully Convolution Siamese Network for Change Detection"></a></div><article class="card-content article" role="article"><div class="article-meta size-small is-uppercase level is-mobile"><div class="level-left"><time class="level-item" dateTime="2020-11-10T07:50:42.000Z" title="2020-11-10T07:50:42.000Z">2020-11-10</time><span class="level-item"><a class="link-muted" href="/categories/%E5%8F%98%E5%8C%96%E6%A3%80%E6%B5%8B/">变化检测</a></span><span class="level-item">2 分钟 读完 (大约 325 个字)</span></div></div><h1 class="title is-3 is-size-4-mobile"><a class="link-muted" href="/2020/11/10/%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/ChangeDetection_FullyConvolutionSiameseNetworkforChangeDetection/">Change Detection - Fully Convolution Siamese Network for Change Detection</a></h1><div class="content"><h2 id="主要思想"><a href="#主要思想" class="headerlink" title="主要思想"></a>主要思想</h2><p>设计三种略有差异的网络，对<a href="https://rcdaudt.github.io/oscd/">OSCD</a> 使用基于 Unet 的结构进行变化检测<br><img src="/Pics/CD_net.png" alt="网络结构"><br></div><a class="article-more button is-small size-small" href="/2020/11/10/%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/ChangeDetection_FullyConvolutionSiameseNetworkforChangeDetection/#more">阅读更多</a></article></div><div class="card"><div class="card-image"><a class="image is-7by3" href="/2020/11/05/CPP/06_%E4%BD%BF%E7%94%A8%E9%A1%BA%E5%BA%8F%E5%AE%B9%E5%99%A8%E5%92%8C%E5%88%86%E6%9E%90%E5%AD%97%E7%AC%A6%E4%B8%B2/"><img class="thumbnail" src="/gallery/cpp.png" alt="【Accelerated C++】 -- 06/16 使用顺序容器和分析字符串"></a></div><article class="card-content article" role="article"><div class="article-meta size-small is-uppercase level is-mobile"><div class="level-left"><time class="level-item" dateTime="2020-11-05T08:59:13.000Z" title="2020-11-05T08:59:13.000Z">2020-11-05</time><span class="level-item"><a class="link-muted" href="/categories/cpp/">cpp</a></span><span class="level-item">7 分钟 读完 (大约 1045 个字)</span></div></div><h1 class="title is-3 is-size-4-mobile"><a class="link-muted" href="/2020/11/05/CPP/06_%E4%BD%BF%E7%94%A8%E9%A1%BA%E5%BA%8F%E5%AE%B9%E5%99%A8%E5%92%8C%E5%88%86%E6%9E%90%E5%AD%97%E7%AC%A6%E4%B8%B2/">【Accelerated C++】 -- 06/16 使用顺序容器和分析字符串</a></h1><div class="content"><p>学习要点：</p>
<ol>
<li>容器和迭代器</li>
<li>list 表和 vector 向量的对比</li>
<li>顺序容器和字符串的成员和创建方法</li>
<li>字符串的有用方法和cctype文件中对字符的判定</li>
</ol></div><a class="article-more button is-small size-small" href="/2020/11/05/CPP/06_%E4%BD%BF%E7%94%A8%E9%A1%BA%E5%BA%8F%E5%AE%B9%E5%99%A8%E5%92%8C%E5%88%86%E6%9E%90%E5%AD%97%E7%AC%A6%E4%B8%B2/#more">阅读更多</a></article></div><nav class="pagination is-centered mt-4" role="navigation" aria-label="pagination"><div class="pagination-previous is-invisible is-hidden-mobile"><a href="/page/0/">上一页</a></div><div class="pagination-next"><a href="/page/2/">下一页</a></div><ul class="pagination-list is-hidden-mobile"><li><a class="pagination-link is-current" href="/">1</a></li><li><a class="pagination-link" href="/page/2/">2</a></li><li><a class="pagination-link" href="/page/3/">3</a></li></ul></nav></div><div class="column column-left is-4-tablet is-4-desktop is-4-widescreen order-1"><div class="card widget"><div class="card-content"><nav class="level"><div class="level-item has-text-centered flex-shrink-1"><div><figure class="image is-128x128 mx-auto mb-2"><img class="is-rounded" src="/img/avatar_new.jpg" alt="Daisy"></figure><p class="title is-size-4 is-block line-height-inherit">Daisy</p><p class="is-size-6 is-block">计算机视觉研究</p><p class="is-size-6 is-flex justify-content-center"><i class="fas fa-map-marker-alt mr-1"></i><span>地球, 银河系</span></p></div></div></nav><nav class="level is-mobile"><div class="level-item has-text-centered is-marginless"><div><p class="heading">文章</p><a href="/archives"><p class="title">25</p></a></div></div><div class="level-item has-text-centered is-marginless"><div><p class="heading">分类</p><a href="/categories"><p class="title">8</p></a></div></div><div class="level-item has-text-centered is-marginless"><div><p class="heading">标签</p><a href="/tags"><p class="title">20</p></a></div></div></nav><div class="level"><a class="level-item button is-primary is-rounded" href="https://github.com/shiyutang" target="_blank" rel="noopener">关注我</a></div><div class="level is-mobile"><a class="level-item button is-transparent is-marginless" target="_blank" rel="noopener" title="Email" href="/shiyu00daisy@gmail.com"><i class="fab fa-envelope-square"></i></a><a class="level-item button is-transparent is-marginless" target="_blank" rel="noopener" title="Notion" href="https://www.notion.so/shiyu00daisy/20b9186805954f9fb5c7560b73147c74"><i class="fab book"></i></a></div></div></div><!--!--><div class="card widget"><div class="card-content"><div class="menu"><h3 class="menu-label">分类</h3><ul class="menu-list"><li><a class="level is-mobile is-marginless" href="/categories/cpp/"><span class="level-start"><span class="level-item">cpp</span></span><span class="level-end"><span class="level-item tag">12</span></span></a></li><li><a class="level is-mobile is-marginless" href="/categories/%E5%8F%98%E5%8C%96%E6%A3%80%E6%B5%8B/"><span class="level-start"><span class="level-item">变化检测</span></span><span class="level-end"><span class="level-item tag">2</span></span></a></li><li><a class="level is-mobile is-marginless" href="/categories/%E6%80%9D%E8%80%83/"><span class="level-start"><span class="level-item">思考</span></span><span class="level-end"><span class="level-item tag">1</span></span></a></li><li><a class="level is-mobile is-marginless" href="/categories/%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0/"><span class="level-start"><span class="level-item">机器学习</span></span><span class="level-end"><span class="level-item tag">1</span></span></a></li><li><a class="level is-mobile is-marginless" href="/categories/%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/"><span class="level-start"><span class="level-item">深度学习</span></span><span class="level-end"><span class="level-item tag">1</span></span></a></li><li><a class="level is-mobile is-marginless" href="/categories/%E8%A7%81%E9%97%BB/"><span class="level-start"><span class="level-item">见闻</span></span><span class="level-end"><span class="level-item tag">1</span></span></a></li><li><a class="level is-mobile is-marginless" href="/categories/%E9%9F%B3%E4%B9%90/"><span class="level-start"><span class="level-item">音乐</span></span><span class="level-end"><span class="level-item tag">3</span></span></a></li><li><a class="level is-mobile is-marginless" href="/categories/%E9%A2%86%E5%9F%9F%E8%87%AA%E9%80%82%E5%BA%94/"><span class="level-start"><span class="level-item">领域自适应</span></span><span class="level-end"><span class="level-item tag">4</span></span></a></li></ul></div></div></div><div class="card widget"><div class="card-content"><h3 class="menu-label">最新文章</h3><article class="media"><a class="media-left" href="/2020/12/17/CPP/12_%E5%AE%9A%E4%B9%89%E6%8A%BD%E8%B1%A1%E6%95%B0%E6%8D%AE%E7%B1%BB%E5%9E%8B/"><p class="image is-64x64"><img class="thumbnail" src="/gallery/cpp.png" alt="【Accelerated C++】 -- 12/16 定义抽象数据类型"></p></a><div class="media-content size-small"><p><time dateTime="2020-12-17T01:08:01.000Z">2020-12-17</time></p><p class="title is-6"><a class="link-muted" href="/2020/12/17/CPP/12_%E5%AE%9A%E4%B9%89%E6%8A%BD%E8%B1%A1%E6%95%B0%E6%8D%AE%E7%B1%BB%E5%9E%8B/">【Accelerated C++】 -- 12/16 定义抽象数据类型</a></p><p class="is-uppercase"><a class="link-muted" href="/categories/cpp/">cpp</a></p></div></article><article class="media"><a class="media-left" href="/2020/12/15/CPP/11_%E7%AE%A1%E7%90%86%E5%86%85%E5%AD%98%E5%92%8C%E4%BD%8E%E7%BA%A7%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/"><p class="image is-64x64"><img class="thumbnail" src="/gallery/cpp.png" alt="【Accelerated C++】 -- 11/16 管理内存和低级数据结构"></p></a><div class="media-content size-small"><p><time dateTime="2020-12-15T12:40:14.000Z">2020-12-15</time></p><p class="title is-6"><a class="link-muted" href="/2020/12/15/CPP/11_%E7%AE%A1%E7%90%86%E5%86%85%E5%AD%98%E5%92%8C%E4%BD%8E%E7%BA%A7%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/">【Accelerated C++】 -- 11/16 管理内存和低级数据结构</a></p><p class="is-uppercase"><a class="link-muted" href="/categories/cpp/">cpp</a></p></div></article><article class="media"><a class="media-left" href="/2020/12/14/CPP/10_%E5%AE%9A%E4%B9%89%E6%96%B0%E7%B1%BB%E5%9E%8B/"><p class="image is-64x64"><img class="thumbnail" src="/gallery/cpp.png" alt="【Accelerated C++】 -- 10/16 自定义新类"></p></a><div class="media-content size-small"><p><time dateTime="2020-12-14T08:35:29.000Z">2020-12-14</time></p><p class="title is-6"><a class="link-muted" href="/2020/12/14/CPP/10_%E5%AE%9A%E4%B9%89%E6%96%B0%E7%B1%BB%E5%9E%8B/">【Accelerated C++】 -- 10/16 自定义新类</a></p><p class="is-uppercase"><a class="link-muted" href="/categories/cpp/">cpp</a></p></div></article><article class="media"><a class="media-left" href="/2020/11/27/%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/NIPs_SpcL/"><p class="image is-64x64"><img class="thumbnail" src="/gallery/SpcL.png" alt="Domain adaptation - SpcL"></p></a><div class="media-content size-small"><p><time dateTime="2020-11-27T02:08:24.000Z">2020-11-27</time></p><p class="title is-6"><a class="link-muted" href="/2020/11/27/%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/NIPs_SpcL/">Domain adaptation - SpcL</a></p><p class="is-uppercase"><a class="link-muted" href="/categories/%E9%A2%86%E5%9F%9F%E8%87%AA%E9%80%82%E5%BA%94/">领域自适应</a></p></div></article><article class="media"><a class="media-left" href="/2020/11/19/CPP/09_%E7%BC%96%E5%86%99%E6%B3%9B%E5%9E%8B%E5%87%BD%E6%95%B0/"><p class="image is-64x64"><img class="thumbnail" src="/gallery/cpp.png" alt="【Accelerated C++】 -- 09/16 编写泛型函数"></p></a><div class="media-content size-small"><p><time dateTime="2020-11-19T09:06:08.000Z">2020-11-19</time></p><p class="title is-6"><a class="link-muted" href="/2020/11/19/CPP/09_%E7%BC%96%E5%86%99%E6%B3%9B%E5%9E%8B%E5%87%BD%E6%95%B0/">【Accelerated C++】 -- 09/16 编写泛型函数</a></p><p class="is-uppercase"><a class="link-muted" href="/categories/cpp/">cpp</a></p></div></article></div></div><div class="card widget"><div class="card-content"><div class="menu"><h3 class="menu-label">标签</h3><div class="field is-grouped is-grouped-multiline"><div class="control"><a class="tags has-addons" href="/tags/Unet/"><span class="tag">Unet++</span><span class="tag is-grey-lightest">1</span></a></div><div class="control"><a class="tags has-addons" href="/tags/%E4%B9%90%E7%90%86/"><span class="tag">乐理</span><span class="tag is-grey-lightest">1</span></a></div><div class="control"><a class="tags has-addons" href="/tags/%E4%BA%94%E7%BA%BF%E8%B0%B1/"><span class="tag">五线谱</span><span class="tag is-grey-lightest">1</span></a></div><div class="control"><a class="tags has-addons" href="/tags/%E5%85%B3%E8%81%94%E5%AE%B9%E5%99%A8map/"><span class="tag">关联容器map</span><span class="tag is-grey-lightest">1</span></a></div><div class="control"><a class="tags has-addons" href="/tags/%E5%A4%B4%E6%96%87%E4%BB%B6%E4%B9%A6%E5%86%99/"><span class="tag">头文件书写</span><span class="tag is-grey-lightest">1</span></a></div><div class="control"><a class="tags has-addons" href="/tags/%E5%AD%97%E7%AC%A6%E4%B8%B2/"><span class="tag">字符串</span><span class="tag is-grey-lightest">1</span></a></div><div class="control"><a class="tags has-addons" href="/tags/%E5%AD%AA%E7%94%9F%E7%BD%91%E7%BB%9C/"><span class="tag">孪生网络</span><span class="tag is-grey-lightest">1</span></a></div><div class="control"><a class="tags has-addons" href="/tags/%E5%BA%93%E7%AE%97%E6%B3%95/"><span class="tag">库算法</span><span class="tag is-grey-lightest">1</span></a></div><div class="control"><a class="tags has-addons" href="/tags/%E5%BE%AA%E7%8E%AF/"><span class="tag">循环</span><span class="tag is-grey-lightest">2</span></a></div><div class="control"><a class="tags has-addons" href="/tags/%E6%8A%BD%E8%B1%A1%E7%B1%BB%EF%BC%8C%E6%9E%84%E9%80%A0%E6%9E%90%E6%9E%84%E5%87%BD%E6%95%B0%EF%BC%8C%E5%86%85%E5%AD%98%E7%AE%A1%E7%90%86/"><span class="tag">抽象类，构造析构函数，内存管理</span><span class="tag is-grey-lightest">1</span></a></div><div class="control"><a class="tags has-addons" href="/tags/%E6%95%B0%E7%BB%84%E3%80%81%E6%8C%87%E9%92%88%E3%80%81%E5%88%86%E9%85%8D%E5%86%85%E5%AD%98/"><span class="tag">数组、指针、分配内存</span><span class="tag is-grey-lightest">1</span></a></div><div class="control"><a class="tags has-addons" href="/tags/%E6%96%B0%E7%B1%BB%E5%9E%8B%E7%9A%84%E6%95%B0%E6%8D%AE%E5%88%9D%E5%A7%8B%E5%8C%96%E3%80%81%E5%B0%81%E8%A3%85%E5%92%8C%E4%BF%9D%E6%8A%A4/"><span class="tag">新类型的数据初始化、封装和保护</span><span class="tag is-grey-lightest">1</span></a></div><div class="control"><a class="tags has-addons" href="/tags/%E6%9C%80%E5%B0%8F%E4%BA%8C%E4%B9%98%E6%B3%95/"><span class="tag">最小二乘法</span><span class="tag is-grey-lightest">1</span></a></div><div class="control"><a class="tags has-addons" href="/tags/%E6%B3%9B%E5%9E%8B%E5%87%BD%E6%95%B0/"><span class="tag">泛型函数</span><span class="tag is-grey-lightest">1</span></a></div><div class="control"><a class="tags has-addons" href="/tags/%E6%B3%A8%E6%84%8F%E5%8A%9B%E6%9C%BA%E5%88%B6/"><span class="tag">注意力机制</span><span class="tag is-grey-lightest">1</span></a></div><div class="control"><a class="tags has-addons" href="/tags/%E7%BB%BC%E8%BF%B0/"><span class="tag">综述</span><span class="tag is-grey-lightest">1</span></a></div><div class="control"><a class="tags has-addons" href="/tags/%E8%A1%A8%E8%BE%BE%E5%BC%8F/"><span class="tag">表达式</span><span class="tag is-grey-lightest">1</span></a></div><div class="control"><a class="tags has-addons" href="/tags/%E8%AE%BA%E6%96%87%E9%98%85%E8%AF%BB/"><span class="tag">论文阅读</span><span class="tag is-grey-lightest">3</span></a></div><div class="control"><a class="tags has-addons" href="/tags/%E8%BF%AD%E4%BB%A3%E5%99%A8%E5%92%8C%E9%A1%BA%E5%BA%8F%E5%AE%B9%E5%99%A8/"><span class="tag">迭代器和顺序容器</span><span class="tag is-grey-lightest">1</span></a></div><div class="control"><a class="tags has-addons" href="/tags/%E9%94%AE%E7%9B%98/"><span class="tag">键盘</span><span class="tag is-grey-lightest">1</span></a></div></div></div></div></div></div><!--!--></div></div></section><footer class="footer"><div class="container"><div class="level"><div class="level-start"><a class="footer-logo is-block mb-2" href="/"><img src="/img/Digital.png" alt="Digital Shiyu" height="28"></a><p class="size-small"><span>© 2020 shiyu AllRightsReserved</span> Powered by <a href="https://hexo.io/" target="_blank" rel="noopener">Hexo</a> & <a href="https://github.com/ppoffice/hexo-theme-icarus" target="_blank" rel="noopener">Icarus</a><br><span id="busuanzi_container_site_uv">共<span id="busuanzi_value_site_uv">0</span>个访客</span></p></div><div class="level-end"></div></div></div></footer><script src="https://cdn.jsdelivr.net/npm/jquery@3.3.1/dist/jquery.min.js"></script><script src="https://cdn.jsdelivr.net/npm/moment@2.22.2/min/moment-with-locales.min.js"></script><script>moment.locale("zh-CN");</script><script>var IcarusThemeSettings = {
site: {
url: 'http://yoursite.com',
external_link: {"enable":true,"exclude":[]}
},
article: {
highlight: {
clipboard: true,
fold: 'unfolded'
}
}
};</script><script src="https://cdn.jsdelivr.net/npm/clipboard@2.0.4/dist/clipboard.min.js" defer></script><a id="back-to-top" title="回到顶端" href="javascript:;"><i class="fas fa-chevron-up"></i></a><script src="/js/back_to_top.js" defer></script><!--!--><!--!--><!--!--><script src="https://cdn.jsdelivr.net/npm/lightgallery@1.6.8/dist/js/lightgallery.min.js" defer></script><script src="https://cdn.jsdelivr.net/npm/justifiedGallery@3.7.0/dist/js/jquery.justifiedGallery.min.js" defer></script><script>window.addEventListener("load", () => {
if (typeof $.fn.lightGallery === 'function') {
$('.article').lightGallery({ selector: '.gallery-item' });
}
if (typeof $.fn.justifiedGallery === 'function') {
if ($('.justified-gallery > p > .gallery-item').length) {
$('.justified-gallery > p > .gallery-item').unwrap();
}
$('.justified-gallery').justifiedGallery();
}
});</script><!--!--><!--!--><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/katex@0.11.1/dist/katex.min.css"><script src="https://cdn.jsdelivr.net/npm/katex@0.11.1/dist/katex.min.js" defer></script><script src="https://cdn.jsdelivr.net/npm/katex@0.11.1/dist/contrib/auto-render.min.js" defer></script><script>window.addEventListener("load", function() {
document.querySelectorAll('[role="article"] > .content').forEach(function(element) {
renderMathInElement(element);
});
});</script><!--!--><script src="/js/main.js" defer></script><div class="searchbox"><div class="searchbox-container"><div class="searchbox-header"><div class="searchbox-input-container"><input class="searchbox-input" type="text" placeholder="想要查找什么..."></div><a class="searchbox-close" href="javascript:;">×</a></div><div class="searchbox-body"></div></div></div><script src="/js/insight.js" defer></script><script>document.addEventListener('DOMContentLoaded', function () {
loadInsight({"contentUrl":"/content.json"}, {"hint":"想要查找什么...","untitled":"(无标题)","posts":"文章","pages":"页面","categories":"分类","tags":"标签"});
});</script></body></html>