Robustnesstochangesinilluminationconditionsaswellas viewing perspectives is an important requirement formany computer vision applications. One of the key fac-ors in enhancing the robustness of dynamic scene analy-sis that of accurate and reliable means for shadow de-ection. Shadowdetectioniscriticalforcorrectobjectde-ection in image sequences. Many algorithms have beenproposed in the literature that deal with shadows. How-ever,acomparativeevaluationoftheexistingapproachesisstill lacking. In this paper, the full range of problems un-derlyingtheshadowdetectionareidenti?edanddiscussed.Weclassifytheproposedsolutionstothisproblemusingaaxonomyoffourmainclasses, calleddeterministicmodeland non-model based and statistical parametric and non-parametric. Novelquantitative(detectionanddiscrimina-ionaccuracy)andqualitativemetrics(sceneandobjectin-dependence,?exibilitytoshadowsituationsandrobustnesso noise) are proposed to evaluate these classes of algo-rithms on a benchmark suite of indoor and outdoor videosequences.
标签： Robustnesstochangesinillumination conditionsaswellas perspectives requirement
上传时间： 2014-01-23
上传用户：whenfly
//Basic packet sending test at the MAC level, used for internal testing only. //This packet test has one node sending out a variety of //differently formatted packets to two assumed destination nodes.
标签： packet test internal sending
上传时间： 2014-08-21
上传用户：CSUSheep
Verilog and VHDL状态机设计，英文pdf格式 State machine design techniques for Verilog and VHDL Abstract : Designing a synchronous finite state Another way of organizing a state machine (FSM) is a common task for a digital logic only one logic block as shown in engineer. This paper will discuss a variety of issues regarding FSM design using Synopsys Design Compiler . Verilog and VHDL coding styles will be 2.0 Basic HDL coding presented. Different methodologies will be compared using real-world examples.
上传时间： 2013-12-19
上传用户：change0329
This a A* pathfinding example to illustrate how to implement a A* pathfinding algorithm into your program. It s a port from Patrick Lesters example in BlitzBasic to VB.Net. It uses a Binary Heap class I made to sort the score values.
标签： pathfinding illustrate algorithm implement
上传时间： 2013-12-25
上传用户：shawvi
This prj demonstrates how to use the SROM memory classes for the Dallas DS80C400. This example uses the memcpy function to copy a function in the SROM memory class (which is located in CODE memory) to von Neumann mapped XDATA (starting at 0x110000) for execution.
标签： This demonstrates the classes
上传时间： 2013-12-22
上传用户：tuilp1a
About WepDecrypt: Wepdecrypt is a Wireless LAN Tool written in c which guesses WEP Keys based on a active dictionary attack, key generator, distributed network attack and some other methods, it s based on wepattack and GPL licensed. WepDecrypt highlights: - Implemented packet filters. - Only one crypted packet is enough to start cracking - Has its own key generator. - Can crack a dumpfile over a network. - Can act as a server and client. - Also works in windows. - Has an fltk gui.
标签： WepDecrypt Wepdecrypt Wireless guesses
上传时间： 2013-12-25
上传用户：6546544
c语言程序，将阿拉伯数字翻译成英文。如输入：792677321 输出：seven hundred ninety-two million six hundred seventy-seven thousand three hundred twenty-one
上传时间： 2014-01-03
上传用户：yyyyyyyyyy
AT90PWM3关于PSC功能的控制，PLL、FOUR、ONE、TWO、LAMP控制
上传时间： 2014-01-22
上传用户：fnhhs
软件开发工程是有趣的、多产的，甚至是大胆的。同时，它也能源源不断地带来商业价值，并保持在我们的掌控之下。 极限编程(XP)的构思和发展是针对小型团队进行软件开发时，在面对不确知的、变化的需求时所产生的特定需要的。这一新的、轻量级的方法学对许多传统思维提出了挑战，这其中包括一个一直以来的假设，即在软件开发过程中，对软件进行一个小小的改动就必然会使其开发成本大大增加。极限编程认可软件开发工程应该节约成本，而且一旦实现了某种节约就应该加以开发利用。 你可以喜欢XP，也可以恨它，但是本书将会使你对如何开发软件有一个全新的认识。KentBeck拥有并经营着First Class软件公司，在这里他把主要精力放在两个最大的兴趣上——模式和极限编程。他一直在研究软件开发的先驱模式、CRC卡、HotDraw画图编辑器框架、xUnit单元测试框架以及测试为先的编程。他发表了五十多篇关于编程的文章，并出版了《The Smalltalk Best Practice Patterns》(Prentice-Hall出版社)和《Kent Beck’s Guide to Better Smalltalk：A Sorted Collection》(剑桥大学出版社)两本著作，同时他还是超级畅销书《重构——改善既有代码的设计》(中英文版皆由中国电力出版社出版)的特约撰稿人。
上传时间： 2015-10-02
上传用户：邶刖
American Gladiator,You are consulting for a game show in which n contestants are pitted against n gladiators in order to see which contestants are the best. The game show aims to rank the contestants in order of strength this is done via a series of 1-on-1 matches between contestants and gladiators. If the contestant is stronger than the gladiator, then the contestant wins the match otherwise, the gladiator wins the match. If the contestant and gladiator have equal strength, then they are “perfect equals” and a tie is declared. We assume that each contestant is the perfect equal of exactly one gladiator, and each gladiator is the perfect equal of exactly one contestant. However, as the gladiators sometimes change from one show to another, we do not know the ordering of strength among the gladiators.
标签： contestants consulting Gladiator are
上传时间： 2013-12-18
上传用户：windwolf2000
