Ethan Blog

Raise the bar

身体知道答案-读书简记

心理学

身体知道答案-读书简记 写在前面 这本书是武志红老师2012年出版的一本心理学书籍，书中主要剖析了身体与心灵，意识与潜意识的关系，指出人的头脑很多时候是复杂的，头脑会自欺。但是身体不会，提倡回归身体，把身体与心灵链接起来。书中很多内容也出现在了武志红老师的得到专栏上，都是非常引人思考的案例。这是一本让人感动的好书，推荐对心理学感兴趣朋友们读一读，开启自己的觉知之旅 Part 1 回归你...

Posted by baiyf on December 7, 2018

轻量级卷积神经网络(一)：MobileNets: V1 & V2

论文阅读笔记

MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications MobileNets是为移动端和嵌入式设备提出的一种轻量级模型，文章使用了深度分离卷积(depthwise separable convolutions)，并且引入了两个超参数：width multiplier, resolut...

Posted by baiyf on December 7, 2018

Deep Residual Learning for Image Recognition

论文阅读笔记

Deep Residual Learning for Image Recognition 论文阅读简记 写在前面 本篇介绍一下Computer Vision领域乃至整个Deep Learning领域的mile stone：ResNet. ResNet在2015年的ImageNet和Coco比赛上都获得了冠军. ResNet参数量相比VGG有所降低，而且性能更好，这种结构也被证明可以加速...

Posted by baiyf on December 5, 2018

Densely Connected Convolutional Networks

论文阅读笔记

Densely Connected Convolutional Networks 论文阅读简记 写在前面 这篇文章是CVPR2017的最佳论文，文中提出DenseNet相比于ResNet不仅参数量更少，而且性能也更好。 文中提出的Dense Connection,作者将它的好处总结为：缓解了梯度消失的问题，加强了特征传播和特征复用，并且可观的减少了参数量 主要思想 文章首先提到了之...

Posted by baiyf on December 4, 2018

Rethinking ImageNet Pre-training

论文阅读笔记

Rethinking ImageNet Pre-training 论文阅读简记 写在前面 本篇主要介绍了对在CV领域尤其是Object Detection方向经常使用的ImageNet pre-training这种方法的重新思考，并且证明了在一些情况下直接Train From Scratch(TOS)也可以取得与pretrain方法相当的结果, 甚至在一些位置敏感的任务中(Object D...

Posted by baiyf on December 3, 2018

使用virtualenv搭建Python虚拟环境

virtualenv, virtualenvwrapper

使用virtualenv搭建Python虚拟环境 工作的时候，经常会需要用到一些包的不同版本，总是uninstall/install效率必然很低，所以需要使用virtualenv来隔离python环境，解决包冲突的问题 下面以centos系统为例介绍一下virtualenv及其管理工具virtualenvwrapper的使用方法 virtualenv 安装 可以使用pip安装也可以...

Posted by baiyf on October 12, 2018

LeetCode 198&213&337. House Robber I&II&III

Dynamic Programming

198. House Robber You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them ...

Posted by baiyf on October 7, 2018

LeetCode 64. Minimum Path Sum

Dynamic Programming

64. Minimum Path Sum Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. Note: You can only move ...

Posted by baiyf on October 5, 2018

LeetCode 33&81. Search in Rotated Sorted Array I&II

Array, Binary Search

33. Search in Rotated Sorted Array Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). You are gi...

Posted by baiyf on October 4, 2018

LeetCode 17. Letter Combinations of a Phone Number

String, Backtracking

17. Letter Combinations of a Phone Number Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. A mapping of digit to lette...

Posted by baiyf on October 2, 2018

FEATURED TAGS
工具 公开课 LeetCode Papers 读书
ABOUT ME

Ever tried. Ever failed.
No matter.
Try Again. Fail again
Fail better.