Welcome![Sign In][Sign Up]
Location:
Search - Winner Take All

Search list

[Special Effectsstereo_modefilt

Description: 基于SAD(square absolutely differences)的新的图像相关算法,并且最后使用WTA(winner take all)作为评估算法-Based on SAD (square absolutely differences) of the new image correlation algorithm, and the final use of WTA (winner take all) for evaluating the algorithm
Platform: | Size: 366592 | Author: jacky | Hits:

[Data structsWinnerTree

Description: 常见的实现方法是使用两个数组, t[n-1]和e[n],数组e存放所有的参加排序的元素,在完全二叉树中是叶子结点,t[]存放 的是比赛的阶段性胜者的编号,再进行n趟比赛排序结束,时间复杂度是O(n*log2(n)), 其实我觉得也可以只通过一个数组A[2*n-1]也可以实现,只是标号的换算有点复杂而已. -Common implementation approach is to use two array, t [n-1] and e [n], the array storage of all e sort of take part in the elements, are in complete binary tree in leaf nodes, t [] are stored stage game winner serial number and then sort the end of n times a game, time complexity is O (n* log2 (n)), in fact I think it is only through an array A [2* n-1] can also be implementation, but labeling it a bit complicated conversion.
Platform: | Size: 2048 | Author: liyuansong | Hits:

[AI-NN-PRSOM-logistic

Description: SOM网络即自组织特征映射网络,采用竞争学习规则——Winner-Take-All 。网络的输出神经元之间相互竞争以求被激活,结果在每一时刻只有一个输出神经元被激活。这个被激活的神经元称为竞争获胜神经元,而其它神经元的状态被抑制,故称为Winner Take All。SOM网络是以生物学为基础,其运行分为训练和工作两个阶段。-SOM network self- organizing feature map network, competitive learning rule- Winner- Take-All . Competition between the output neurons of the network in order to be activated, results in every moment only one output neuron is activated . This activation of neurons called the competition winning neuron , while the other neuron s state is suppressed , it is known as Winner Take All . The SOM network is biologically based , the run is divided into training and work in two stages .
Platform: | Size: 112640 | Author: 迪文 | Hits:

[JSP/JavaAlgorithm2

Description: 利用程序求出实例的结果。 1、火柴棍游戏:2堆火柴棍,2人轮流拿。拿的规则如下:1、每次至少拿一根;2、只能从一堆里拿;3、第一堆火柴棍最多拿3根;4、第二堆火柴棍最多拿当前所有火柴棍的一半。谁拿完以后只剩一根火柴棍为赢家。问开始2堆都是20根火柴棍,你想赢,你先拿还是后拿?-The use of procedures results obtained instance. 1, matchstick game: 2 heap of matchsticks, take turns. Take the rules are as follows: 1, each to take at least one 2, can only get from a pile 3, a pile of matchstick up to get 3 4, the second pile of matchstick up to take all matchstick half. Who get finished after only a matchstick winner. 2 heap are asked to start 20 matchstick, you want to win, you acquire or take?
Platform: | Size: 1024 | Author: 刘昭强 | Hits:

[Software EngineeringVisual-saliency--tracking

Description: 针对突变运动下的目标跟踪问题,提出一种基于视觉显著性的粒子滤波跟踪算法. 该算 法将基于视觉注意机制的视觉显著图引入粒子滤波框架中,根据视觉显著图的显著性区域,按 胜者为王和返回抑制机制进行目标检测-Aimingat solvingthetrackingproblemsunder thecircumstancesof abrupt motion,aparticlefilter trackerisproposedbasedonvisual saliencymodel. Thistrackerdetectsobject fromthesalient regionsinthesaliencymapby theway of winner-take-all andinhibition-of-return. Thedetectingresult istakenasaglobal proposal distributionandthenparticlesaresampledfromit therefore, theglobal statespacecanbesearchedinorder toavoidsuffering fromthelocal minimumproblem. Moreover,inorder toincreasethesaliencyof theobject regioninthesaliency map,thebottom-up andtop-downcomputational modelsarecombinedtogether. Thentheweightsof thefeaturemapsare calculatedaccordingto thetarget templateandsaliency maps arefusedadaptively. Comparedwith several other trackingalgorithms,
Platform: | Size: 548864 | Author: 陈云 | Hits:

[GUI DevelopNIMJ

Description: Nim取子游戏是由两个人面对若干堆硬币(或石子)进行的游戏。设有k> 1堆硬币,各堆分别含有N1,N2,……NK枚硬币。游戏的目的就是选择最后剩下的硬币。游戏法则如下: 1.两个游戏人交替进行游戏(游戏人I和游戏人II); 2.当轮到每个游戏人取子时,选择这些堆中的一堆,并从所选的堆中取走至少一枚硬币(游戏人可以取走他所选堆中的全部硬币); 3.当所有的堆都变成空堆时,最后取子的游戏人即为胜者。-Nim game is to take the child by two people face a number of heap of coins (or stones) in a game. With k> 1 stack of coins, each stack containing respectively N1, N2, ...... NK coins. The purpose of the game is to choose the last remaining coins. Rules of the game are as follows: 1. Game two people alternately games (games and people who I II) 2. When it came time to take each game one at midnight, choose a bunch of these heap, and remove at least one coin the selected stack (one can take his game all the selected coin stack) 3. When all have become empty heap heap, the final game to take the child who is the winner.
Platform: | Size: 6144 | Author: pickJ | Hits:

CodeBus www.codebus.net