3 Wayne2019

尚未进行身份认证

暂无相关简介

等级
TA的排名 2w+

LeetCode: 16 回溯

Letter Combinations of a Phone Number"""这种题就是DFS,递归+一堆传引用。迭代解法见http://www.cnblogs.com/grandyang/p/4452220.html,也可以用队列实现。"""class Solution {public: void helper(const string& digits, vecto...

2018-05-08 12:01:12

LeetCode: 15 sum

Longest Substring Without Repeating Characters""""""class Solution {public: int lengthOfLongestSubstring(string s) { unordered_map<char,int> map; int i=0, j=0, ans=0, ...

2018-05-06 23:59:56

LeetCode: 14

Count Binary Substrings"""简单,但是需要判断啥时候计数“清零”"""class Solution {public: int countBinarySubstrings(string s) { if(s.size()<=1) return 0; int zero = 0, one = 0, ...

2018-04-19 10:57:11

UNet

kaggle上的常客(医学图像领域比较常用,也是car分割的冠军模型): https://www.kaggle.com/c/data-science-bowl-2018/discussion/54426 U-Net: Convolutional Networks for Biomedical Image SegmentationVALID padding not SAME paddi...

2018-04-15 23:24:23

HyperNet, RON, FPN

HyperNet: Towards Accurate Region Proposal Generation and Joint Object Detection 主要是融合了不同层级的特征,比较容易理解,参考: https://blog.csdn.net/u012905422/article/details/52614192 https://blog.csdn.net/u01236121...

2018-04-15 09:39:44

Learning Region Features for Object Detection

图像特征提取,候选区域生成,候选区域特征提取(roi pooling),区域识别,去重fm x: Cf, H, W RoI b y(b) = RegionFeat(x, b) y(b): K, Cf. K比如是bin的数目 y_k(b): 第k个bin内的特征一般表述: 将y_k(b)的支持区域由roi pooling的一个bin内部扩展到整个fm x。权重依赖于位置p,fm x...

2018-04-15 07:18:07

LeetCode: 13

Second Minimum Node In a Binary Tree/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), l...

2018-04-15 05:01:42

LeetCode: 继续easy题12

Subtree of Another Treeclass Solution {public: bool isSame(TreeNode* s, TreeNode* t){ if(!s && !t) return true; if(s && t) return (s-&g...

2018-03-21 06:41:22

LeetCode: 继续easy题11

Find Mode in Binary Search Tree"""二叉树的递归,迭代中序遍历。Morris 遍历: https://www.zhihu.com/question/21556707"""Base 7""""""class Solution {public: string convertToBase7(int num) {

2018-03-16 04:50:30

LeetCode: 继续easy题10

Assign Cookies"""简单"""class Solution {public: int findContentChildren(vector<int>& g, vector<int>& s) { sort(g.begin(), g.end()); sort(s.begin(), s.end()..

2018-03-12 08:40:45

LeetCode: 继续easy题9

Escape The Ghosts""""""class Solution {public: int distance(vector<int>& s1, vector<int>& s2){ return abs(s1[0]-s2[0])+abs(s1[1]-s2[1]); } bool escapeGho..

2018-02-27 06:10:19

LeetCode: 继续easy题8

Nth Digit"""蛋疼,老Time Limit Exceeded,结果最后是两个long的地方越界"""class Solution {public: int findNthDigit(int n) { /* i=1: 1,...,9: 9 num_i i=2: 10,...,99: 90 ...

2018-02-25 12:35:12

LeetCode: 继续easy题7

Reverse Vowels of a String """"""class Solution {public: bool isVowel(char a){ if(a=='a'||a=='e'||a=='i'||a=='o'||a=='u') return true; if(a=='A'||a=='E'||a=='...

2018-02-16 04:33:48

LeetCode: 继续easy题6

Lowest Common Ancestor of a Binary Search Tree"""递归解法,想好边界条件,简单"""/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * ...

2018-02-12 10:51:11

LeetCode: 继续easy题5

Contains Duplicate"""简单O(n), O(n)"""class Solution {public: bool containsDuplicate(vector<int>& nums) { unordered_map<int,int> map; for (int i=0; i<nums...

2018-02-11 21:35:43

LeetCode: 继续easy题4

Rotate Array"""Cyclic Replacements,这个思路还是挺难写对的==O(n)"""class Solution {public: void rotate(vectorint>& nums, int k) { int current = 0; int next; int buffer, buffer_

2018-01-29 21:50:08

FCN: 卷积和转置卷积等

各种卷积的动态图这里y是下一层(i,j)处的值,k是kernel size, s是stride,f泛指卷积层,池化层和激活函数。这些操作都具有局部性,限定在x的delta邻域中。这里是说两个这样的操作可以进行复合,复合后的“等效”kernel size和stride在右下角。 如上图,若第一层的k=3,第二层的k=1,则等效k=3;若第一层的k=3,第二层的k=2,则等效k=

2018-01-15 10:07:37

视频物体检测文献阅读笔记

Impression Network for Video Object Detection 基于印象机制的高效多帧特征融合,解决defocus and motion blur等问题(即视频中某帧的质量低的问题),同时提高速度和性能。 类似TSN,每个segment选一个key frame(注意,TSN做视频分类是在cnn最后才融合不同的segments)。特征融合前需要用Optical

2018-01-06 11:03:39

AlignedReID

旷视的AlignedReID,很有意思。 The end-to-end learning with structure prior is more powerful than a “blind” end-to-end learning.reid难点: 目前triplet loss等用的比较多。Combining softmax loss with metric learning

2018-01-05 09:36:03

LeetCode: 继续easy题3

Best Time to Buy and Sell Stock"""扫描,time n, space 19 ms, beats 10.54%"""class Solution {public: int maxProfit(vectorint>& prices) { int small_id = 0; int value = 0;

2018-01-05 01:30:43

查看更多

勋章 我的勋章
  • 持之以恒
    持之以恒
    授予每个自然月内发布4篇或4篇以上原创或翻译IT博文的用户。不积跬步无以至千里,不积小流无以成江海,程序人生的精彩需要坚持不懈地积累!