- 博客(208)
- 资源 (23)
- 收藏
- 关注
原创 C语言 异步回调
本文主要讲解如果实现回调,特别是在封装接口的时候,回调显得特别重要,我们首先假设有两个程序员在写代码,A程序员写底层驱动接口,B程序员写上层应用程序,然而此时底层驱动接口A有一个数据d需要传输给B,此时有两种方式: 1、A将数据d存储好放在接口函数中,B自己想什么时候去读就什么时候去读,这就是我们经常使用的函数调用,此时主动权是B。 2、A实现回调机制,当数据变化的时候才将通知B,你
2015-08-26 10:17:48 21222 17
转载 Makefile经典教程(掌握这些足够)
makefile很重要 什么是makefile?或许很多Winodws的程序员都不知道这个东西,因为那些Windows的IDE都为你做了这个工作,但我觉得要作一个好的和professional的程序员,makefile还是要懂。这就好像现在有这么多的HTML的编辑器,但如果你想成为一个专业人士,你还是要了解HTML的标识的含义。特别在Unix下的软件编译,你就不能不自己写make
2015-08-21 22:02:31 1648
原创 [设计模式] - 创建型模式
本文按照GOF书中的例子做实验。 创建型模式包含了5种设计模式,书中已创建迷宫的例子讲解了这5个例子,将这5种设计模式都运用到了创建迷宫当中。 这5种创建型模式包含: 1. Factory Method(工厂方法) 2. Abstract Factory(抽象工厂) 3. Builder(建造者) 4. Prototype(原型) 5. Singleton(单例)
2015-08-21 12:20:42 1001
原创 在线人脸检测与识别
//////////////////////////////////////////////////////////////////////////////////////// OnlineFaceRec.cpp, by Shervin Emami (www.shervinemami.info) on 30th Dec 2011.// Online Face Recognition from a
2015-08-18 10:04:33 3092
转载 主成分分析(Principal components analysis)-最小平方误差解释
接上篇3.2 最小平方误差理论 假设有这样的二维样本点(红色点),回顾我们前面探讨的是求一条直线,使得样本点投影到直线上的点的方差最大。本质是求直线,那么度量直线求的好不好,不仅仅只有方差最大化的方法。再回想我们最开始学习的线性回归等,目的也是求一个线性函数使得直线能够最佳拟合样本点,那么我们能不能认为最佳的直线就是回归后的直线呢?回归时我们的最小二乘法度
2015-08-18 09:54:01 601
转载 主成分分析(Principal components analysis)-最大方差解释
在这一篇之前的内容是《Factor Analysis》,由于非常理论,打算学完整个课程后再写。在写这篇之前,我阅读了PCA、SVD和LDA。这几个模型相近,却都有自己的特点。本篇打算先介绍PCA,至于他们之间的关系,只能是边学边体会了。PCA以前也叫做Principal factor analysis。1. 问题 真实的训练数据总是存在各种各样的问题:1、 比如拿到
2015-08-18 09:51:11 690
转载 协方差矩阵
统计学里最基本的概念就是样本的均值、方差、标准差。首先,我们给定一个含有n个样本的集合,下面给出这些概念的公式描述:均值:标准差:方差:
2015-08-18 09:38:09 592
转载 Introduction to Face Detection and Face Recognition
Introduction to Face Detection and Face RecognitionNOTE: This page was written in 2010 and describes Face Detection & Face Recognition using OpenCV’s old C interface. But in June 2012, OpenCV v2.4.1 ca
2015-08-17 12:32:18 3008
原创 Google编码规范
Google C++ 编程规范 目录 一、头文件……………………………………………………………………………………………………………………….4 1. #define 的保护……………………………………………………………………………………………………….. 4 2. 头文件依赖………………………………………………………………………………………………………….. 4 3. 内联函数………………
2015-08-15 16:02:37 4473
原创 [设计模式]-UML类图的各符号含义
UML类图的各符号含义类图基本符号可拆分为虚线,箭头,实线,空心右三角,实心右三角,空心菱形和实心菱形。由这些基本的图形进行组合构成了类图的基本符号。这里要注意这几个符号的顺序,代表了类与类之间关系的耦合程 度。越向右耦合度越高。 其中虚线+箭头是表示即依赖的关系,实线+箭头表示关联的关系,虚线+空心右三角表示implements,实线+空心右三角表示的是泛化,即类的继承关系。实线+空
2015-08-15 15:37:42 6595
转载 计算机视觉领域的一些牛人博客,超有实力的研究机构等的网站链接
计算机视觉领域的一些牛人博客,超有实力的研究机构等的网站链接 分类: CV相关 2011-07-12 19:53 17966人阅读 评论(30) 收藏 举报 交通人脸识别图像处理微软生物 提示:本文为笔者原创,转载请注明出处:blog.csdn.net/carson2005 以下链接是本人整理的关于计算机视觉(ComputerVision, CV)相关领域的网站链接,其中
2015-08-13 15:03:31 2780
转载 国内从事机器视觉领域的公司
经常碰到朋友问我国内从事计算机视觉(CV)领域的公司的发展情况,产品情况,甚至找工作等问题,这里,我给出自己收集的国内从事CV相关领域的公司网址及其主要产品,有兴趣的朋友可以去看看。另外,资料整理的不是很完善,后续我会继续更新和添加,并及时在我博客进行更新(blog.csdn.net/carson2005)。(1) 北京北方猎波科技有限公司:http://www.northwh.com/beifan
2015-08-13 15:02:04 10160 2
转载 机器视觉开源代码集合
一、特征提取Feature Extraction:SIFT [1] [Demo program][SIFT Library] [VLFeat]PCA-SIFT [2] [Project]Affine-SIFT [3] [Project]SURF [4] [OpenSURF] [Matlab Wrapper]Affine Covariant Features [5] [O
2015-08-13 14:59:53 1781
原创 MFC-控件大全-Slider Control
MFC-控件大全-Slider Con 所有的控件的创建基本都是同一套道路; 第一步:.h中创建一个CSliderCtrl 类的对象 ; CSliderCtrl m_ctrlSlider; 第二步:.cpp中的void CMyDlg::DoDataExchange(CDataExchange* pDX)函数进行初始化控件;//初始化控件 void CMyDlg::DoData
2015-08-05 19:30:20 865
原创 [Leetcode]-Unique Paths II
Follow up for “Unique Paths”:Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in the grid.For ex
2015-07-22 20:41:45 392
原创 [Leetcode]-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 either down or right at any
2015-07-22 20:30:29 594
原创 [Leetcode]-Unique Paths
A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the botto
2015-07-22 20:11:15 439
原创 [Leetcode]-Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [−2,1,−3,4,−1,2,1,−5,4], the contiguous subarray [4,−1,2,1] has the
2015-07-22 20:03:51 497
原创 [Leetcode]-Gas Station
There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to its nex
2015-07-22 19:40:11 670
原创 [Leetcode] - Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine if you are
2015-07-22 19:20:37 520
原创 [Leetcode]-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 complete as many transactions as you like (ie, buy one and
2015-07-22 19:09:50 579
原创 [Leetcode]-Best Time to Buy and Sell Stock
Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), desi
2015-07-22 19:02:59 639
翻译 [Zedboard u-boot Linux系统移植]-Embedded Linux® Hands-on Tutorial for the ZedBoard™
本文翻译自Embedded Linux® Hands-on Tutorial for the ZedBoard™ 本文主要是详细讲解zedboard硬件系统搭建,u-boot,linux-kernel移植,linaro文件系统移植。过程中需要生成的文件有system.bit,fsbl.elf,u-boot.elf,devicetree.dtb,uImage(zImage和uImage区别请看),l
2015-07-16 11:28:48 2407
翻译 [Zybo u-boot Linux系统移植]-ZYBO Zync-7000 Development Board Work Booting Linux on the ZYBO
ZYBO Zync-7000 Development Board Work Booting Linux on the ZYBO本文翻译自:http://www.dbrss.org/zybo/tutorial4.html 本文主要是详细讲解zybo硬件系统搭建,u-boot,linux-kernel移植,linaro文件系统移植。Introduction If you are new to lin
2015-07-13 13:00:54 4943
原创 [Zedboard Linux系统移植]-从MACHINE_START开始
修改自:http://www.cnblogs.com/lknlfy/archive/2012/05/06/2486479.html 内核的启动过程? 3)内核的启动过程? arch/arm/kernel/head.S —> 内核的启动汇编 r0 = 0 , r1 = machine nr, r2 = atags pointer. 机器
2015-07-10 22:44:50 3525
原创 [Leetcode]-Contains Duplicate HashTbale重解
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is
2015-07-07 21:54:23 911
原创 哈希表(散列)HashTable实现
最近刷Leetcode发现凡是找字符串中重复字符或者数组中找重复数据的时候就不知道从何下手了。 所以决定学习一下哈希表解题,哈希表的原理主要是解决分类问题,hash表是介于链表和二叉树之间的一种中间结构。链表使用十分方便,但是数据查找十分麻烦;二叉树中的数据严格有序,但是这是以多一个指针作为代价的结果。hash表既满足了数据的查找方便,同时不占用太多的内容空间,使用也十分方便。 定义ha
2015-07-07 21:04:19 1237
原创 哈希表(散列)HashTable实现
最近刷Leetcode发现凡是找字符串中重复字符或者数组中找重复数据的时候就不知道从何下手了。 所以决定学习一下哈希表解题,哈希表的原理主要是解决分类问题,hash表是介于链表和二叉树之间的一种中间结构。链表使用十分方便,但是数据查找十分麻烦;二叉树中的数据严格有序,但是这是以多一个指针作为代价的结果。hash表既满足了数据的查找方便,同时不占用太多的内容空间,使用也十分方便。 定义ha
2015-07-07 21:03:55 1053
原创 [Leetcode]-Add Binary
Given two binary strings, return their sum (also a binary string).For example, a = “11” b = “1” Return “100”.Hide Tags : Math, String 题目:输入两个字符串,字符串中只有0和1,0和1表示二进制的0,1,把他当作二进制来作加法。 思路: 1、二进制全加器表达
2015-07-06 11:04:28 540 1
原创 [Leetcode]-Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?Hide Tags: Dynamic Programming 题目:爬楼
2015-07-06 10:57:06 596
原创 [Leetcode]-Remove Duplicates from Sorted List
Given a sorted linked list, delete all duplicates such that each element appear only once.For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3.题目:输入一个排序好的链表,其中可能有元素是重复的,找出重复数据
2015-07-06 10:53:34 809
原创 [Leetcode]-Merge Sorted Array
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note: You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional
2015-07-06 10:45:14 656
原创 [Leetcode]-Same Tree
Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.Hide Tags :Tree ,De
2015-07-06 10:21:36 777
原创 [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
2015-07-06 10:14:04 632
原创 [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.Hide Tags: Tree ,Depth-first Search/** * D
2015-07-06 10:06:33 875
原创 [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.Hide Tags :Tree , Depth-first Search 题目:求取
2015-07-04 14:58:37 723
原创 [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
2015-07-04 14:44:32 749
原创 [Leetcode]-Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with cons
2015-07-04 14:19:09 650
原创 [Leetcode]-Pascal's Triangle II
Given an index k, return the kth row of the Pascal’s triangle.For example, given k = 3, Return [1,3,3,1].Note: Could you optimize your algorithm to use only O(k) extra space?Hide Tags : Array 题目:返回帕
2015-07-04 14:08:08 663
原创 [Leetcode]-Pascal's Triangle
Given numRows, generate the first numRows of Pascal’s triangle.For example, given numRows = 5, Return[ ——-[1], ——[1,1], —-[1,2,1], —[1,3,3,1], –[1,4,6,4,1] ]题目:根据numRows生成帕斯卡三角形。帕
2015-07-03 19:46:09 1076
TCP网络调试助手
2014-07-19
VESA and Industry Standards and Guidelines for Computer Display Monitor Timing
2014-06-12
color space 颜色空间
2014-06-12
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人