Location:
Search - counting
Search list
Description: This paper describes a vision based pedestrian detection and tracking system which is able to count people in very crowded situations like escalator entrances in underground stations. The proposed system uses motion to compute regions of interest and prediction of movements, extracts shape information from the video frames to detect individuals, and applies texture features to recognize people. A search strategy creates trajectories and new pedestrian hypotheses and then filters and combines those into accurate counting events. We show that counting accuracies up to 98 % can be achieved.
Platform: |
Size: 2122036 |
Author: harleych |
Hits:
Description: Merge, Insertion, Radix, Heap, Bucket, Quick, Counting排序算法-Sort Algorithm about Merge, Insertion, Radix, Heap, Bucket, Quick, Counting
Platform: |
Size: 5120 |
Author: 站长 |
Hits:
Description: C++ 对象计数 实例计数-C object count example Counting
Platform: |
Size: 2048 |
Author: 敏 |
Hits:
Description: 一个在图象处理中用得比较多的canny算子程序-an image processing used in more canny than counting Subroutine
Platform: |
Size: 4096 |
Author: wrm |
Hits:
Description: 去找工作时经常会有人问我已编过多少行代码的程序，
当真把每个程序都整理处理数一下行数实在太麻烦了，
因此我就自己编了一个小程序专门用来数文本格式的
文件的行数，小巧好用-find work often when someone asked me how many series have lines of code procedures each type of procedure to address a number of collating several firms about too much trouble. Therefore, I would own a small part of the procedures used for a few specialized text format of the document but a few, a small handy
Platform: |
Size: 140288 |
Author: ysh |
Hits:
Description: Josephus 排列问题定义如下：假设n 个竞赛者排成一个环形。给定一个正整数m，从某
个指定的第1 个人开始，沿环计数，每遇到第m 个人就让其出列，且计数继续进行下去。这
个过程一直进行到所有的人都出列为止。最后出列者为优胜者。每个人出列的次序定义了整
数1，2，…，n 的一个排列。这个排列称为一个(n,m)Josephus 排列。
例如，(7,3)Josephus 排列为3，6，2，7，5，1，4。-Josephus problem with the definition is as follows : Suppose n race who formed a ring. Given a positive integer m, from a certain section of a designated individual, along the Central Counting that every individual section m let out its out and count continue. This process continues until all the people from far out. Finally out of the winners were shown. Everyone out in the order shown in the definition of integers 1, 2, ..., n an order. With this as a (n, m), with Josephus. For example, (7,3) Josephus, were 3,6,2,7,5,1,4.
Platform: |
Size: 1024 |
Author: 李飞飞 |
Hits:
Description: User Defined Functions for FP Counting
Platform: |
Size: 16384 |
Author: Wladimir |
Hits:
Description: 基于Verilog-HDL的硬件电路的实现
9.3 脉冲计数与显示
9.3.1 脉冲计数器的工作原理
9.3.2 计数模块的设计与实现
9.3.3 parameter的使用方法
9.3.4 repeat循环语句的使用方法
9.3.5 系统函数$random的使用方法
9.3.6 脉冲计数器的Verilog-HDL描述
9.3.7 特定脉冲序列的发生
9.3.8 脉冲计数器的硬件实现
-based on Verilog-HDL hardware Circuit of 9.3 pulse count and showed 9.3 .1 pulse counter the principle 9.3.2 Counting Module Design and Implementation para 9.3.3 meter usage 9.3.4 repeat cycle statement on the use 9.3.5- EC $ random function of the use of pulse counter 9.3.6 Verilog-HDL depiction 9.3.7 to specific pulse sequences occurred pulse counter 9.3.8 Hardware Implementation
Platform: |
Size: 4096 |
Author: 宁宁 |
Hits:
Description: 自动售货机，投币记数，判断是否已答商品价格，再出货指令发出后，出货。-vending machines, coin counting, to decide whether or not to have answered commodity prices, export orders issued again after shipment.
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 算十万的阶乘,对于计算机和程序员都是一个挑战,本源程序实现了求大数的阶乘,是用汇编写的,相对速度很快,算十万的阶乘在我赛扬2.4,内存256的神舟笔记本上,用了20多分钟.算出得数写在一个TXT文件下,十万的阶乘结果,用记事本打开,都要好一会儿.-Count of thousands of factorial, for computers and programmers is a challenge to realize the source of the order of the factorial of large numbers, is written in the compilation of a relatively quick, and counting of thousands of factorial in my 2.4 Celeron, memory 256 Shenzhou notebook, spent more than 20 minutes.得数calculated to write in a TXT file, the thousands of factorial results, use Notepad to open, should a good moment.
Platform: |
Size: 210944 |
Author: 郭事业 |
Hits:
Description: 求盒维数的matlab程序，可以计算维度，用盒子维度的方法-Box-counting dimension for the matlab procedure, can calculate the dimensions, using the box dimension method
Platform: |
Size: 1024 |
Author: 李松 |
Hits:
Description: 这是一个求盒维数的Matlab程序，具有简单易求的功能-This is a box-counting dimension for the Matlab program, with simple and easy for the function of
Platform: |
Size: 3072 |
Author: wliqun |
Hits:
Description: ％求输入一维信号的计盒分形维数
％y是一维信号
％cellmax:方格子的最大边长,可以取2的偶数次幂次(1,2,4,8...),取大于数据长度的偶数
％D是y的计盒维数（一般情况下D>=1）,D=lim(log(N(e))/log(k/e)),- For the importation of one-dimensional signal box fractal dimension y is one-dimensional signal cellmax: Lattice of the largest side length, you can take 2 dual power several (1,2,4,8 ...), check data length greater than the even-numbered D is the y of the box-counting dimension (generally D> = 1), D = lim (log (N (e))/log (k/e)),
Platform: |
Size: 1024 |
Author: zhu |
Hits:
Description: matlab雨流算法。The rain flow algorithm code has been prepared according to the ASTM standard (Standard practices for cycle counting in fatigue analysis) and optimized considering the calculation time.
-rain-flow algorithm matlab. The rain flow algorithm code has been prepared according to the ASTM standard (Standard practices for cycle counting in fatigue analysis) and optimized considering the calculation time.
Platform: |
Size: 109568 |
Author: wang an |
Hits:
Description: Fractal dimension using the box-counting method for 1D, 2D and 3D sets
Platform: |
Size: 1630208 |
Author: 林海 |
Hits:
Description: 对低质量图像分割和计数，以大米照片为例。-Of low-quality image segmentation and counting to rice as an example photo.
Platform: |
Size: 56320 |
Author: 杨大 |
Hits:
Description: 基于matlab的图像纹理处理，用盒维分形算法实现。-Matlab image texture based on the treatment, using box-counting dimension of fractal algorithm.
Platform: |
Size: 222208 |
Author: 张雪 |
Hits:
Description: 计数排序的源代码，大家可参照思考，哎还要上传-Counting sort of the source code
Platform: |
Size: 1024 |
Author: david |
Hits:
Description: is the Java implementation of the Lossy Counting Algorithm that you can find at:
http://www-db.stanford.edu/~manku/papers/02vldb-freq.pdf
The LossyCountingAnalyzer program takes an input stream made of text and compute the words with the highest frequency.
The results displayed are not exact but they are in a range of error (epsilon) set up by the user.
-is the Java implementation of the Lossy Counting Algorithm that you can find at:
http://www-db.stanford.edu/~manku/papers/02vldb-freq.pdf
The LossyCountingAnalyzer program takes an input stream made of text and compute the words with the highest frequency.
The results displayed are not exact but they are in a range of error (epsilon) set up by the user.
Platform: |
Size: 147456 |
Author: yani |
Hits:
Description: Counting radix just try it
Platform: |
Size: 60416 |
Author: neo123456789
|
Hits:
« 12
3
4
5
6
7
8
9
10
...
50
»