自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(125)
  • 资源 (6)
  • 收藏
  • 关注

原创 LeetCode 1232. Check If It Is a Straight Line

  You are given an array coordinates, coordinates[i] = [x, y], where [x, y] represents the coordinate of a point. Check if these points make a straight line in the XY plane.Example 1:Input: coordinates = [[1,2],[2,3],[3,4],[4,5],[5,6],[6,7]]Output: tru

2020-07-07 22:41:29 66

原创 深度学习之卷积:如果卷积核被初始化为0

前言  这几天面试遇到了这样一个问题,如果卷积层的权重被赋值为0,会发生什么?  解决这个问题我们首先定义一下在神经网络中的基本权重和偏置的初始化情况,在TensorFlow中,权重一般由用户初始化,可选择很多初始化方式,如glorot_normal_initializer()等,但是偏置在默认的情况下一般初始化为0,具体可以参考tf.layers.conv2d和tf.layers.dense...

2019-09-21 13:42:49 2530 2

原创 卷积可视化:特征图的可视化

import kerasimport matplotlib.pyplot as pltfrom keras.applications.vgg16 import VGG16from keras.preprocessing import imagefrom keras.applications.vgg16 import preprocess_inputimport numpy as np...

2019-09-10 20:54:16 1349

原创 机器学习复习:Adaboost算法

前言  提升方法(boosting)是一种常用的机器学习方法,应用十分广泛,而且效果非常好,近几年的很多比赛的优胜选手都或多或少使用了提升方法用以提高自己的成绩。  提升方法的本质是通过对每一个训练样本赋予一个权重,并通过改变这些样本的权重,来学习多个分类器,并按照一定的算法将这些分类器组合在一起,通常是线性组合,因为单个分类器往往效果有限,因此组合多个分类器往往会提高模型的性能。 一、提...

2019-09-09 17:34:44 108

原创 LeetCode解题报告:498. Diagonal Traverse

ProblemGiven a matrix of M x N elements (M rows, N columns), return all elements of the matrix in diagonal order as shown in the below image.Example:Input:[[ 1, 2, 3 ],[ 4, 5, 6 ],[ 7, 8, 9 ]...

2019-09-03 19:42:20 218

原创 YOLOv3源码阅读之七:data_utils.py

一、YOLO简介  YOLO(You Only Look Once)是一个高效的目标检测算法,属于One-Stage大家族,针对于Two-Stage目标检测算法普遍存在的运算速度慢的缺点,YOLO创造性的提出了One-Stage。也就是将物体分类和物体定位在一个步骤中完成。YOLO直接在输出层回归bounding box的位置和bounding box所属类别,从而实现one-stage。  ...

2019-09-03 15:35:44 693

原创 YOLOv3源码阅读之六:train.py

一、YOLO简介  YOLO(You Only Look Once)是一个高效的目标检测算法,属于One-Stage大家族,针对于Two-Stage目标检测算法普遍存在的运算速度慢的缺点,YOLO创造性的提出了One-Stage。也就是将物体分类和物体定位在一个步骤中完成。YOLO直接在输出层回归bounding box的位置和bounding box所属类别,从而实现one-stage。  ...

2019-09-03 15:34:49 1417

原创 YOLOv3源码阅读之五:nms_utils.py

一、YOLO简介  YOLO(You Only Look Once)是一个高效的目标检测算法,属于One-Stage大家族,针对于Two-Stage目标检测算法普遍存在的运算速度慢的缺点,YOLO创造性的提出了One-Stage。也就是将物体分类和物体定位在一个步骤中完成。YOLO直接在输出层回归bounding box的位置和bounding box所属类别,从而实现one-stage。  ...

2019-09-03 15:34:03 1284 2

原创 YOLOv3源码阅读之四:layer_utils.py

一、YOLO简介  YOLO(You Only Look Once)是一个高效的目标检测算法,属于One-Stage大家族,针对于Two-Stage目标检测算法普遍存在的运算速度慢的缺点,YOLO创造性的提出了One-Stage。也就是将物体分类和物体定位在一个步骤中完成。YOLO直接在输出层回归bounding box的位置和bounding box所属类别,从而实现one-stage。  ...

2019-09-03 15:32:58 573

原创 YOLOv3源码阅读之三:model.py

一、YOLO简介  YOLO(You Only Look Once)是一个高效的目标检测算法,属于One-Stage大家族,针对于Two-Stage目标检测算法普遍存在的运算速度慢的缺点,YOLO创造性的提出了One-Stage。也就是将物体分类和物体定位在一个步骤中完成。YOLO直接在输出层回归bounding box的位置和bounding box所属类别,从而实现one-stage。  ...

2019-09-03 15:32:04 1334

原创 YOLOv3源码阅读之二:get_kmeans.py

一、YOLO简介  YOLO(You Only Look Once)是一个高效的目标检测算法,属于One-Stage大家族,针对于Two-Stage目标检测算法普遍存在的运算速度慢的缺点,YOLO创造性的提出了One-Stage。也就是将物体分类和物体定位在一个步骤中完成。YOLO直接在输出层回归bounding box的位置和bounding box所属类别,从而实现one-stage。  ...

2019-09-03 15:30:40 902 1

原创 YOLOv3源码阅读之一:test_single_image.py

一、YOLO简介  YOLO(You Only Look Once)是一个高效的目标检测算法,属于One-Stage大家族,针对于Two-Stage目标检测算法普遍存在的运算速度慢的缺点,YOLO创造性的提出了One-Stage。也就是将物体分类和物体定位在一个步骤中完成。YOLO直接在输出层回归bounding box的位置和bounding box所属类别,从而实现one-stage。  ...

2019-09-03 15:29:27 1023

原创 LeetCode解题报告:309. Best Time to Buy and Sell Stock with Cooldown

ProblemSay you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, b...

2019-08-31 14:53:52 196

原创 LeetCode解题报告:714. Best Time to Buy and Sell Stock with Transaction Fee

ProblemYour are given an array of integers prices, for which the i-th element is the price of a given stock on day i; and a non-negative integer fee representing a transaction fee.You may complete a...

2019-08-31 14:36:12 205

原创 LeetCode解题报告:121. Best Time to Buy and Sell Stock

ProblemSay you have an array for which the ithi^{th}ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (i.e., buy one and sell one shar...

2019-08-31 14:02:06 149

原创 LeetCode解题分享:1011. Capacity To Ship Packages Within D Days

ProblemA conveyor belt has packages that must be shipped from one port to another within D days.The i-th package on the conveyor belt has a weight of weights[i]. Each day, we load the ship with pac...

2019-08-30 15:14:41 88

原创 LeetCode解题分享:82. Remove Duplicates from Sorted List II

ProblemGiven a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.Example 1:Input: 1->2->3->3->4->4->5Output:...

2019-08-29 16:38:51 60

原创 LeetCode解题分享:430. Flatten a Multilevel Doubly Linked List

ProblemYou are given a doubly linked list which in addition to the next and previous pointers, it could have a child pointer, which may or may not point to a separate doubly linked list. These child ...

2019-08-29 16:15:44 200

原创 LeetCode解题分享:117. Populating Next Right Pointers in Each Node II

problemGiven a binary treestruct Node {int val;Node *left;Node *right;Node *next;}Populate each next pointer to point to its next right node. If there is no next right node, the next pointer...

2019-08-29 14:16:25 203

原创 LeetCode解题分享:684. Redundant Connection

ProblemIn this problem, a tree is an undirected graph that is connected and has no cycles.The given input is a graph that started as a tree with N nodes (with distinct values 1, 2, …, N), with one a...

2019-08-29 14:05:08 60

原创 LeetCode解题分享:863. All Nodes Distance K in Binary Tree

ProblemWe are given a binary tree (with root node root), a target node, and an integer value K.Return a list of the values of all nodes that have a distance K from the target node. The answer can b...

2019-08-28 23:40:09 179

原创 LeetCode解题分享:1013. Partition Array Into Three Parts With Equal Sum

ProblemGiven an array A of integers, return true if and only if we can partition the array into three non-empty parts with equal sums.Formally, we can partition the array if we can find indexes i+1 ...

2019-08-27 15:02:55 74

原创 LeetCode解题分享:1029. Two City Scheduling

ProblemThere are 2N people a company is planning to interview. The cost of flying the i-th person to city A is costs[i][0], and the cost of flying the i-th person to city B is costs[i][1].Return the...

2019-08-27 14:44:31 94

原创 LeetCode解题分享:372. Super Pow

ProblemYour task is to calculate aba^bab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.Example 1:Input: a = 2, b = [3]Output: 8...

2019-08-26 21:30:55 57

原创 LeetCode解题分享:475. Heaters

ProblemWinter is coming! Your first job during the contest is to design a standard heater with fixed warm radius to warm all the houses.Now, you are given positions of houses and heaters on a horizo...

2019-08-26 20:49:54 79

原创 LeetCode解题分享:1073. Adding Two Negabinary Numbers

ProblemGiven two numbers arr1 and arr2 in base -2, return the result of adding them together.Each number is given in array format: as an array of 0s and 1s, from most significant bit to least signi...

2019-08-26 15:33:38 409

原创 LeetCode解题分享:1093. Statistics from a Large Sample

ProblemWe sampled integers between 0 and 255, and stored the results in an array count: count[k] is the number of integers we sampled equal to k.Return the minimum, maximum, mean, median, and mode ...

2019-08-25 17:04:20 188

原创 LeetCode解题分享:1054. Distant Barcodes

ProblemIn a warehouse, there is a row of barcodes, where the i-th barcode is barcodes[i].Rearrange the barcodes so that no two adjacent barcodes are equal. You may return any answer, and it is guar...

2019-08-25 16:01:33 222

原创 LeetCode解题分享:238. Product of Array Except Self

ProblemGiven an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Example:Input: [1,2,3,4]Ou...

2019-08-25 15:18:41 54

原创 LeetCode解题分享:1104. Path In Zigzag Labelled Binary Tree

ProblemIn an infinite binary tree where every node has two children, the nodes are labelled in row order.In the odd numbered rows (ie., the first, third, fifth,…), the labelling is left to right, wh...

2019-08-24 14:01:41 476

原创 LeetCode解题分享:137. Single Number II

ProblemGiven a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one.Note:Your algorithm should have a linear runtime comp...

2019-08-23 14:51:47 44

原创 LeetCode解题分享:215. Kth Largest Element in an Array

ProblemFind the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.Example 1:Input: [3,2,1,5,6,4] and k = 2Output:...

2019-08-23 13:31:23 134

原创 LeetCode解题分享:36. Valid Sudoku

ProblemDetermine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:Each row must contain the digits 1-9 without repetition.Each column mus...

2019-08-22 15:51:53 34

原创 LeetCode解题分享:16. 3Sum Closest

ProblemGiven an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each inpu...

2019-08-22 15:29:20 49

原创 LeetCode解题分享:73. Set Matrix Zeroes

ProblemGiven a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in-place.Example 1:Input:[[1,1,1],[1,0,1],[1,1,1]]Output:[[1,0,1],[0,0,0],[1,0,1]]Example 2:...

2019-08-22 15:24:28 76

原创 LeetCode解题分享:78. Subsets

ProblemGiven a set of distinct integers, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.Example:Input: nums = [1,2,3]Output:[[3],[...

2019-08-22 14:23:33 53

原创 LeetCode解题分享:547. Friend Circles

ProblemThere are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct friend of B, and B is a direct friend of ...

2019-08-20 21:06:01 53

原创 LeetCode解题分享:911. Online Election

ProblemIn an election, the i-th vote was cast for persons[i] at time times[i].Now, we would like to implement the following query function: TopVotedCandidate.q(int t) will return the number of the p...

2019-08-20 19:50:35 80

原创 LeetCode解题分享:692. Top K Frequent Words

ProblemGiven a non-empty list of words, return the k most frequent elements.Your answer should be sorted by frequency from highest to lowest. If two words have the same frequency, then the word with...

2019-08-20 17:10:02 182

原创 LeetCode解题分享:17. Letter Combinations of a Phone Number

ProblemGiven a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons)...

2019-08-20 13:26:39 72

Single-Shot Refinement Neural Network for Object Detection论文翻译

Single-Shot Refinement Neural Network for Object Detection论文翻译,纯手工

2018-06-27

CIFAR10的label信息

CIFAR10数据集的label信息文件,分别为train-label和test-label,请使用numpy读取。

2018-06-13

cvxopt_py36_win64.zip

64位win平台下python3.6的cvxopt包。包含numpy+mkl包和cvxopt包。

2018-05-13

VGG19预训练模型(不包括全连接层)

VGG19预训练模型(不包括全连接层),是一个字典结构,请使用numpy读取。

2018-01-17

keras2.0中文文档

keras2.0中文文档官方,由浅入深介绍keras深度学习框架

2017-10-31

Pydicom用法简介

对Python操作DICOM文件进行介绍

2017-08-22

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人 TA的粉丝

提示
确定要删除当前文章?
取消 删除