OraYang的博客

天赋是绕不过去的大山,机遇与努力也缺一不可

Kalman Filter 通俗讲解

引言 Kalman Filter,很多人刚听到这个名词时,总是会下意识认为这就是个滤波器。我这里想要重点声明的是,Kalman Filter不是滤波,它是一种信息融合的过程。 那么Kalman Filter到底是什么?它在那些方面有着应用,它的基本原理又是什么。如果你参考国内的论坛或者教材上,...

2018-06-03 16:44:05

阅读数:12543

评论数:1

简单交通灯识别Traffic-Light-Classify

整个项目源码:GitHub 引言 前面我们讲完交通标志的识别,现在我们开始尝试来实现交通信号灯的识别 接下来我们将按照自己的思路来实现并完善整个Project. 在这个项目中,我们使用HSV色彩空间来识别交通灯,可以改善及提高的地方: 可以采用Faster-RCNN或SSD来...

2018-05-15 16:18:40

阅读数:1251

评论数:0

traffic-sign-classifier

本篇博客tensorflow1.7,整个项目源码:github 引言 本次博客将分享Udacity无人驾驶纳米学位的另一个项目,交通标志的识别。 本次项目实现主要采用CNN卷积神经网络,具体的网络结构参考Lecun提出的LeNet结构。参考文献:Lecun Paper 项目流程图 本...

2018-05-14 10:48:06

阅读数:1470

评论数:0

746. Min Cost Climbing Stairs

题目 On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed). Once you pay the cost, you can either climb one or two s...

2018-03-21 10:40:27

阅读数:244

评论数:0

724. Find Pivot Index

题目 Given an array of integers nums, write a method that returns the “pivot” index of this array. We define the pivot index as the index where the s...

2018-03-21 09:25:27

阅读数:283

评论数:1

674. Longest Continuous Increasing Subsequence

题目 Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray). Example 1: Input: [1,3,5,4,7] Ou...

2018-03-20 09:01:38

阅读数:203

评论数:0

697. Degree of an Array

题目 Given a non-empty array of non-negative integers nums, the degree of this array is defined as the maximum frequency of any one of its elements. Y...

2018-03-19 19:58:24

阅读数:227

评论数:0

122. Best Time to Buy and Sell Stock II

题目 Say 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 ...

2018-03-19 17:45:08

阅读数:211

评论数:0

717. 1-bit and 2-bit Characters

题目 We have two special characters. The first character can be represented by one bit 0. The second character can be represented by two bits (10 or 1...

2018-03-19 16:01:18

阅读数:199

评论数:0

695. Max Area of Island

题目 Given a non-empty 2D array grid of 0’s and 1’s, an island is a group of 1’s (representing land) connected 4-directionally (horizontal or vertical...

2018-03-19 09:45:19

阅读数:200

评论数:0

766. Toeplitz Matrix

题目 A matrix is Toeplitz if every diagonal from top-left to bottom-right has the same element. Now given an M x N matrix, return True&a...

2018-03-14 13:23:05

阅读数:221

评论数:0

91. Decode Ways

题目 A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... '...

2018-03-13 10:42:53

阅读数:253

评论数:0

42. Trapping Rain Water

题目 Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after r...

2018-03-05 15:20:23

阅读数:234

评论数:0

41. First Missing Positive

题目 Given an unsorted integer array, find the first missing positive integer. For example, Given [1,2,0] return 3, and [3,4,-1,1] return 2. ...

2018-03-05 11:28:35

阅读数:228

评论数:0

57. Insert Interval

题目 Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals wer...

2018-03-04 14:18:48

阅读数:233

评论数:0

147. Insertion Sort List

题目 Sort a linked list using insertion sort. 思路 典型的插入排序,方法直接看代码 代码 /** * Definition for singly-linked list. * public class ListNode { * ...

2018-03-04 14:16:27

阅读数:170

评论数:0

148. Sort List

题目 Sort a linked list in O(n log n) time using constant space complexity. 思路 本题要求将一个链表进行排序,空间复杂度为O(1)O(1)O(1),我们采用归并排序的方法。首先我们实现一个merge函数,然后实现一个ge...

2018-03-04 14:06:51

阅读数:181

评论数:0

164. Maximum Gap

题目 Given an unsorted array, find the maximum difference between the successive elements in its sorted form. Try to solve it in linear time/space. ...

2018-03-02 17:41:15

阅读数:161

评论数:0

179. Largest Number

题目 Given a list of non negative integers, arrange them such that they form the largest number. For example, given [3, 30, 34, 5, 9], the largest fo...

2018-03-02 09:59:50

阅读数:158

评论数:0

324. Wiggle Sort II

题目 Given an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3].... E...

2018-03-01 14:17:30

阅读数:167

评论数:0

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