- 博客(136)
- 收藏
- 关注
![](https://csdnimg.cn/release/blogv2/dist/pc/img/listFixedTop.png)
原创 论文笔记--ActionVLAD: Learning spatio-temporal aggregation for action classification
介绍这是去年CVPR2017的一篇动作分类的文章,代码链接如下: http://rohitgirdhar.github.io/ActionVLAD 这篇文章在时空上分别独立提取特征,然后做pooling聚合,采用了一种VLAD的pooling方法,端到端的训练,主要解决两个疑惑:1.如何聚合视频帧之间的特征来表示整个视频。2.在多流网络中(例如two-stream)里面如何整合不同流(双流...
2018-05-17 18:58:51
3095
![](https://csdnimg.cn/release/blogv2/dist/pc/img/listFixedTop.png)
原创 论文笔记--ConvNet Architecture Search for Spatiotemporal Feature Learning
这是Du Tran在Learning Spatiotemporal Features with 3D Convolutional Networks之后发表的续篇,相当于C3D的第二个版本,C3D-resnet.我个人觉得这篇文章除了主要探讨C3D-resnet以外,更重要的是对CNN卷积结构在时空特征表现上的一个深入探讨。大部分工作还是基于UCF-101,而且从头训练,很利于在硬件条件有限的情况下
2018-01-28 17:07:08
1393
![](https://csdnimg.cn/release/blogv2/dist/pc/img/listFixedTop.png)
原创 Pytorch--分布式训练(下)
看过 Pytorch–分布式训练(上)的朋友肯定有一个疑问,怎么才能实现多节点多gpu中的分布式训练呢? 同样是在官网,找到这样一个imagenet分布式训练的例子 https://github.com/pytorch/examples/tree/master/imagenet 然后可能是由于pytorch版本更新问题,我一开始并没有跑通程序,后来修改了一下就可以了。 修改版本 http
2018-01-14 17:50:04
18251
17
![](https://csdnimg.cn/release/blogv2/dist/pc/img/listFixedTop.png)
原创 Pytorch--分布式训练(上)
本人出于对分布式训练的需求和兴趣,研究了各种框架的分布式实现,感觉pytorch的资料比较少,在这里和大家分享一下。 首先讲一下官网的教程 Writing Distributed Applications with PyTorch 这个教程实现的是用一个机器的多个进程模拟集群的分布式部署。后端使用的是gloo,默认支持GPU,TCP只支持CPU,MPI需要从源码重新编译。通信方式采用的不是P
2018-01-14 17:38:13
9223
5
![](https://csdnimg.cn/release/blogv2/dist/pc/img/listFixedTop.png)
原创 Tensorflow--分布式训练
实验任务:集群上多节点多GPU分布式训练CUDA_VISIBLE_DEVICES=” python distributed.py –job_name=ps –task_index=0CUDA_VISIBLE_DEVICES=’0’ python distributed.py –job_name=worker –task_index=0CUDA_VISIBLE_DEVICES=’1’ python d
2017-12-28 16:13:44
830
![](https://csdnimg.cn/release/blogv2/dist/pc/img/listFixedTop.png)
原创 论文笔记--Appearance-and-Relation Networks for Video Classification
Appearance-and-Relation Networks for Video Classification是王利民组2017年底的发表的一篇工作。 主要工作是在3D卷积的基础上,提升了action recognition的准确率,而且没有像目前主流的two-stream方法那样使用使用光流信息,因为光流的提取速度特别慢,这是一个未来的研究趋势,更不会像IDT那套方法一样计算复杂。 虽然目
2017-12-20 18:02:20
1909
![](https://csdnimg.cn/release/blogv2/dist/pc/img/listFixedTop.png)
原创 Label Shuffing
由于场景数据集不均匀的类别分布,给模型训练带来了困难。海康威视提出了Label Shuffling的类别平衡策略。在Class-Aware Sampling方法中,定义了2种列表,一是类别列表,一是每个类别的图像列表,对于80类的分类问题来说,就需要事先定义80个列表,很不方便。对此进行了改进,只需要原始的图像列表就可以完成同样的均匀采样任务。以图中的例子来说,步骤如下:首先对原始的图像列表,按照标
2017-10-15 16:12:13
3546
5
![](https://csdnimg.cn/release/blogv2/dist/pc/img/listFixedTop.png)
原创 Tensorflow--正弦序列预测
Tensorflow对RNN模型的基础结构单元RNN单元和LSTM模型的基础结构单元LSTM单元提供了实现和封装,使用Tensorflow可以轻松的实现一个序列预测模型。 在这里以正弦序列预测为例学习. 运行环境是ubuntu14.04+tensorflow0.10+python2.7. 详细注释过程见代码#coding=utf-8#Tensorflow实现正弦序列预测import rand
2017-08-10 18:35:36
2009
2
![](https://csdnimg.cn/release/blogv2/dist/pc/img/listFixedTop.png)
原创 RANSAC算法应用及opencv实现
一、概述 RANSAC算法的输入是一组观测数据(往往含有较大的噪声或无效点),一个用于解释观测数据的参数化模型以及一些可信的参数。RANSAC通过反复选择数据中的一组随机子集来达成目标。被选取的子集被假设为局内点,并用下述方法进行验证: 1.有一个模型适应于假设的局内点,即所有的未知参数都能从假设的局内点计算得出。 2.用1中得到的模型去测试所有的其它数据,如果某个点适用于估计的模型,认为它
2017-07-17 15:09:53
6164
2
![](https://csdnimg.cn/release/blogv2/dist/pc/img/listFixedTop.png)
原创 SFM算法流程
SFM算法流程1. 算法简介SFM算法是一种基于各种收集到的无序图片进行三维重建的离线算法。在进行核心的算法structure-from-motion之前需要一些准备工作,挑选出合适的图片。首先从图片中提取焦距信息(之后初始化BA需要),然后利用SIFT等特征提取算法去提取图像特征,用kd-tree模型去计算两张图片特征点之间的欧式距离进行特征点的匹配,从而找到特征点匹配个数达到要
2017-07-10 20:44:10
50870
16
转载 [深度学习论文笔记][arxiv 1711] Non-local Neural Networks
[arxiv 1711] Non-local Neural NetworksXiaolong Wang, Ross Girshick, Abhinav Gupta, Kaiming Hefrom CMU, FAIRpaper linkMotivation“Non-local”直译为“非局部”。个人的理解是指特征提取时,当前输入数据的特征计算要考虑其它输入数据的信息。举例来说,...
2018-05-03 17:58:53
534
转载 ORB特征提取详解
网上虽然出现了很多讲解ORB特征提取和描述的方法,但都不够详尽。为了搞明白到底是怎么回事,只能结合别人的博客和原著对ORB的详细原理做一个研究和学习。哪里有不对的地方,请多多指教1、算法介绍ORB(Oriented FAST and Rotated BRIEF)是一种快速特征点提取和描述的算法。这个算法是由Ethan Rublee, Vincent Rabaud, Kurt Konol...
2018-05-03 10:49:06
29313
1
原创 回文问题合集
最长回文子串 https://blog.csdn.net/qq_20791919/article/details/74999999 最长回文子序列 最长公共子序列 最长递增子序列 最长公共子串 https://blog.csdn.net/qq_20791919/article/details/75041809 回文子序列个数 设字符串为str,长度为n,dp[i][j]表示第i到...
2018-04-20 10:47:25
671
原创 归并排序
归并操作(merge),也叫归并算法,指的是将两个已经排序的序列合并成一个序列的操作。归并排序算法依赖归并操作。 递归法(Top-down) 1.申请空间,使其大小为两个已经排序序列之和,该空间用来存放合并后的序列 2.设定两个指针,最初位置分别为两个已经排序序列的起始位置 3.比较两个指针所指向的元素,选择相对小的元素放入到合并空间,并移动指针到下一位置 4.重复步骤3直到某一指针到达...
2018-03-09 16:57:52
195
转载 Xception算法详解
论文:Xception: Deep Learning with Depthwise Separable Convolutions 论文链接:https://arxiv.org/abs/1610.02357算法详解: Xception是google继Inception后提出的对Inception v3的另一种改进...
2018-03-08 14:26:18
526
转载 机器学习中的算法:决策树模型组合之随机森林(Random Forest)
基础知识[关于决策树的基础知识参考:http://blog.csdn.net/holybin/article/details/22914417]在机器学习中,随机森林由许多的决策树组成,因为这些决策树的形成采用了随机的方法,所以叫做随机森林。随机森林中的决策树之间是没有关联的,当测试数据进入随机森林时,其实就是让每一颗决策树进行分类看看这个样本应该属于哪一类,最后取所有决策树中分类结果最多的
2018-01-28 12:30:17
792
转载 DenseNet算法详解
转自http://blog.csdn.net/u014380165/article/details/75142664 论文:Densely Connected Convolutional Networks 论文链接:https://arxiv.org/pdf/1608.06993.pdf 代码的github链接:https://github.com/liuzhuang13
2018-01-28 12:12:44
545
2
原创 LeetCode--Flatten Binary Tree to Linked List
Given a binary tree, flatten it to a linked list in-place.For example, Given 1 / \ 2 5 / \ \ 3 4 6The flattened tree should look like: 1 \ 2
2017-12-08 22:21:17
261
原创 LeetCode--Path Sum II
Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.For example: Given the below binary tree and sum = 22, 5 / \
2017-12-07 14:45:35
388
原创 LeetCode--Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example: Given the below binary tree and sum = 2
2017-12-06 13:34:01
334
1
原创 LeetCode--Minimum Depth of Binary Tree
Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.思路:递归。这个题目相比求最大深度有些巧妙,它通过判断有没有兄弟节点来计算离根节点最近
2017-12-05 16:49:48
363
原创 LeetCode--Balanced Binary Tree
Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by
2017-12-04 17:10:15
447
原创 LeetCode-- Convert Sorted List to Binary Search Tree
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.For this problem, a height-balanced binary tree is defined as a binary tree in which the dep
2017-12-03 10:51:15
420
原创 LeetCode--Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the tw
2017-12-02 11:19:02
532
原创 LeetCode--Binary Tree Level Order Traversal II
Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).For example: Given binary tree [3,9,20,null,null,15,...
2017-12-01 14:12:33
207
原创 LeetCode--Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree.Note: You may assume that duplicates do not exist in the tree.思路:这道题的思路基本和上一题一样,不同之处在于后序遍历根节点在最后面。/** * Definition for a bin
2017-11-30 15:24:53
387
原创 LeetCode--Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree.Note: You may assume that duplicates do not exist in the tree.思路: 这道题是树中比较有难度的题目,需要根据先序遍历和中序遍历来构造出树来。这道题看似毫无头绪,其实梳理一下还是有章可循的。
2017-11-29 20:07:35
440
原创 LeetCode--Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.思路:递归。二叉树最大深度经典结论,左右分别递归下去,每层深度加1,求最大值。/**
2017-11-23 11:04:46
381
原创 LeetCode--Binary Tree Zigzag Level Order Traversal
Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate between).For example: Given binary tr...
2017-11-22 11:39:45
365
原创 LeetCode--Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).For example: Given binary tree [3,9,20,null,null,15,7], 3 / \ 9 20 ...
2017-11-21 12:12:49
422
原创 LeetCode--Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the
2017-11-20 15:12:10
349
原创 LeetCode--Recover Binary Search Tree
Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note: A solution using O(n) space is pretty straight forward. Could you devise a const
2017-11-16 10:28:35
481
原创 LeetCode--Same Tree
Given two binary trees, write a function to check if they are the same or not.Two binary trees are considered the same if they are structurally identical and the nodes have the same value.Example 1:Inp
2017-11-15 10:55:24
478
原创 LeetCode--Validate Binary Search Tree
Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node’s key. The right
2017-11-14 10:43:58
455
原创 LeetCode--Interleaving String
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example, Given: s1 = “aabcc”, s2 = “dbbca”,When s3 = “aadbbcbcac”, return true. When s3 = “aadbbbaccc”, return false
2017-11-13 10:40:18
404
原创 LeetCode--Unique Binary Search Trees II
Given an integer n, generate all structurally unique BST’s (binary search trees) that store values 1…n.For example, Given n = 3, your program should return all 5 unique BST’s shown below. 1
2017-11-12 17:02:50
457
原创 LeetCode--Unique Binary Search Trees
Given n, how many structurally unique BST’s (binary search trees) that store values 1…n?For example, Given n = 3, there are a total of 5 unique BST’s.1 3 3 2 1 \ /
2017-11-11 17:17:40
305
原创 Leetcode--Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes’ values.For example: Given binary tree [1,null,2,3], 1 \ 2 / 3 return [1,3,2].Note: Recursive solution is t
2017-11-10 12:40:24
234
原创 Leetcode--Restore IP Addresses
Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example: Given “25525511135”,return [“255.255.11.135”, “255.255.111.35”]. (Order does not
2017-11-09 21:44:10
225
原创 LeetCode--Reverse Linked List II
Reverse a linked list from position m to n. Do it in-place and in one-pass.For example: Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL.Note: Given m, n satisfy the following co
2017-11-08 18:22:03
341
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人