![个人头像照片](https://ucc.alicdn.com/avatar/img_60c584082a968fe12a12dd02159956fc.jpg)
大数据生态圈,计算机视觉,机器学习,高端技术的爱好者,话不多说,上代码!!!
暂时未有相关通用技术能力~
阿里云技能认证
详细说明讨论帖: http://bbs.csdn.net/topics/391542633 在Matlab下,使用imfill可以很容易的完成孔洞填充操作,感觉这是一个极为常用的方法,然而不知道为什么Opencv里面却没有集成这个函数。
Contains Duplicate Total Accepted: 26477 Total Submissions: 73478 My Submissions Given an array of integers, find if the array contains any duplicates.
深度有限遍历记录层数:增加一个level //深度优先遍历 void depthFirstSearch(Tree root){ stack nodeStack; //使用C++的STL标准模板库 nodeStack.
Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, Return [ [1], [1,1], [1,2,1], ...
内推阿里电话面试中面试官给我出的一个题: 我想的头一个解决方案,就是放到stl 的map里面对出现的频率作为pair的第二个字段进行排序,之后按照排序结果返回: 下面口说无凭,show your code,当然在讨论帖子中遭遇了工程界大牛的sql代码在技术上的碾压。
Balanced Binary Tree Total Accepted: 63288 Total Submissions: 198315 My Submissions Given a binary tree, determine if it is height-balanced.
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
Symmetric Tree Total Accepted: 61440 Total Submissions: 194643 My Submissions Given a binary tree, ch...
ios swift 实现饼状图进度条 // // ProgressControl.swift // L02MyProgressControl // // Created by plter on 7/29/14.
Add Binary Total Accepted: 46815 Total Submissions: 189215 My Submissions Given two binary strings, return their sum (also a binary string).
Given a string containing just the characters '(', ')', '{', '}', '[' and']', determine if the input string is valid. The brackets must close in the correct order, "()" and "()[]{}" are all valid but "(]" and "([)]" are not. 写了一个0ms 的代码: // 20150630.cpp : 定义控制台应用程序的入口点。
Write a function to find the longest common prefix string amongst an array of strings. 我的解决方案: class Solution { public: string longes...
编辑部的主页:好像没啥用 http://shop.oreilly.com/product/0636920022923.do 每章的代码,github上面的:中文版 https://github.
Determine whether an integer is a palindrome. Do this without extra space. click to show spoilers.
给大家推荐两个学习的地址: 极客学院的视频:http://www.jikexueyuan.com/path/ios/ 一个博客:http://blog.csdn.net/lizhongfu2013/article/details/29210015 主要想要实现一个模仿的登陆界面 代码: // // LoginViewController.
Remove Duplicates from Sorted ArrayTotal Accepted: 66627 Total Submissions: 212739 My Submissions Given a ...
Given two sorted integer arrays nums1 and nums2, merge nums2 intonums1 as one sorted array.
代码: #include #include #include #include #include #pragma comment(lib, "gdiplus.lib") using namespace std; using namespace Gdiplus; in...
Remove Element Total Accepted: 60351 Total Submissions: 187833 My Submissions Given an array and a valu...
String to Integer (atoi)Total Accepted:52232 Total Submissions:401038 My Submissions Implement atoi to convert a string to an integer.
大牛没有能做出来的题,我们要好好做一做 Invert a binary tree. 4 / \ 2 7 / \ / \ 1 3 6 9 to 4 / \ 7 2 / \ / \ 9...
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
Easy OpenCL with Python 原文 http://www.drdobbs.com/open-source/easy-opencl-with-python/240162614 OpenCL与python联合工作:与CUDA的前景分析 http://www.opengpu.org/forum.php?mod=viewthread&tid=16571 如果你对python熟,可以用 PyOpenCL, 兼顾 host 端的简洁与 device 端的高效。
项目主页:http://grinninglizard.com/tinyxml2docs/index.html tinyxml2.h /* Original code by Lee Thomason (www.
Given a sorted linked list, delete all duplicates such that each element appear only once.
Maximum Depth of Binary Tree Total Accepted: 63668 Total Submissions: 141121 My Submissions Question Solution Given a binary tree, find its maximum depth.
Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 click to show spoilers.
The string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a ...
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
Write a program to find the node at which the intersection of two singly linked lists begins.
Compare two version numbers version1 and version2. If version1 > version2 return 1, if version1 < version2 return -1, otherwise return 0.
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.
Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2.
Given an integer n, return the number of trailing zeroes in n!. Note: Your solution should be in logarithmic time complexity. 解决思路: 决定阶乘末尾零的个数其实是数列中5出现的次数,比如5的阶乘一个零。
Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].
Reverse bits of a given 32 bits unsigned integer. For example, given input 43261596 (represented in binary as 0000001010010100000111101001...
实现效果: 这个其实是一个非常常见的功能,大家都会考虑给自己简单的工程做一个背景界面。其实只要在view类中重载OnEraseBkgnd()这个函数就好了。 代码如下: BOOL CdddView::OnEraseBkgnd(CDC* pDC) { // ...
今天看了一个华为西安研究院的一个女生代码大神的总结很有感悟,下面这句话送给大家: 只有好的程序员才能写出人类可以理解的代码 You are a professional robber planning to rob houses along a street.
Climbing Stairs You are climbing a stair case. It takes n steps to reach to the top.
Write an algorithm to determine if a number is "happy". A happy number is a number defined by the following process: Starting with any positiv...
Remove all elements from a linked list of integers that have valueval. ExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6Return: 1 ...
Description: Count the number of prime numbers less than a non-negative number, n 提示晒数法: http://en.
一直找不到opencv stereo matching的根据和原理出处,下面这个文章贴了个链接,有时间看看: Basically OpenCV provides 2 methods to calculate a dense disparity ...
就是几个动物,自动排列生成什么的 class Animal(object): def __init__(self,name,weight): self.name = name self.
上面是没有调用cleaned_data的提交结果,可见模版直接把form里面的整个标签都接收过来了 下面是调用cleaned_data 的结果 django 的表单,提交上来之后是这样的: #coding: gb2312 from django import forms class ContactForm(forms.
1.python 的安装 网上很多关于django跟python 开发的资料,这块我正在实习准备用这个两个合起来搞一个基于web 的东西出来现在开始学习,写点东西记录一下心得。 开发环境是windows的,所以我们到python官网下载64位的windows操作系统的安装包: https://www.python.org/ftp/python/3.4.3/python-3.4.3.amd64.msi 这个版本直接添加了系统的环境变量非常的方面(吐槽一下各种开发环境环境变量的配置)。
论文下载地址:http://research.microsoft.com/en-us/um/people/jiansun/papers/GuidedFilter_ECCV10.pdf 本文主要介绍导向滤波,但是在网上看这算法还能去雾,不知道是具体是怎么利用导向滤波实现去雾的,希望过来人指点迷津,这块主要是重写了导向滤波应用于彩色图像的部分代码,希望与大家共同交流。
识别算法概述: SIFT/SURF基于灰度图, 一、首先建立图像金字塔,形成三维的图像空间,通过Hessian矩阵获取每一层的局部极大值,然后进行在极值点周围26个点进行NMS,从而得到粗略的特征点,再使用二次插值法得到精确特征点所在的层(尺度),即完成了尺度不变。
ORB算法 ORB是是ORiented Brief的简称。ORB的描述在下面文章中: Ethan Rublee and Vincent Rabaud and Kurt Konolige and Gary Bradski, ORB: an efcient alternative to SIFT or SURF, ICCV 2011 没有加上链接是因为作者确实还没有放出论文,不过OpenCV2.3RC中已经有了实现,WillowGarage有一个talk也提到了这个算法,因此我不揣浅陋,在这里总结一下。
image算法测试iteratoralgorithmfeatures 原创文章,转载请注明出处:http://blog.csdn.net/crzy_sparrow/article/details/7391511 文章目录: 一、Harris角点检测基本理论 二、opencv代码...