资 源 简 介
它是MeanShift算法的改进，称为连续自适应的MeanShift算法，CamShift算法的全称是"Continuously Adaptive Mean-SHIFT"，它的基本思想是视频图像的所有帧作MeanShift运算，并将上一帧的结果（即Search Window的中心和大小）作为下一帧MeanShift算法的Search Window的初始值，如此迭代下去。
Camshift 是由Meanshift 推导而来 Meanshift主要是用在单张影像上，但
是独立一张影像分析对追踪而言并无意义，Camshift 就是利用MeanShift的方
请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报 打分 发表评论 暂无评论
文 件 列 表
DeleteBST.CPP
InsertBST.CPP
R_L_Rotate.CPP
SearchBST.CPP
Search_Seq_1.CPP
Search_Seq_2.CPP
AddPolyn.cpp
Contray.cpp
CreateList.CPP
CreateList_L.cpp
GetElem_L.cpp
InitList_Sq.cpp
ListDelete_Dul.CPP
ListDelete_L.cpp
ListDelete_Sq.cpp
ListInsert_Dul.CPP
ListInsert_L.CPP
ListInsert_Sq.CPP
LocateElem_Sq.CPP
MergeList_L.CPP
Merge_Sq.cpp
BubbleSort.CPP
HeapSort.CPP
InsertSort.CPP
MergeSort.cpp
QuickSort.CPP
RadixSort.cpp
SelectSort.CPP
Shellinsert.CPP
Build.CPP
CreateBiTree.CPP
HuffmanCoding.CPP
InOrderThreading.CPP
InOrderTraverse_1.CPP
InOrderTraverse_2.CPP
InOrderTraverse_Thr.CPP
Insert_Thr1.CPP
Insert_Thr2.CPP
Next_Thr.CPP
Parent_Judge.CPP
PostOrderTraverse_1.CPP
PostOrderTraverse_2.CPP
PreOrderTraverse_1.CPP
PreOrderTraverse_2.CPP
Prior_Thr.CPP
Restore.cpp
BFSTraverse.CPP
CreateDG_1.CPP
CreateDG_2.CPP
CreatGraph.CPP
CriticalPath.cpp
DFSTraverse.CPP
DFSTree.CPP
MiniSpanTree_Kruskal.CPP
MiniSpanTree_Prim.CPP
ShortestPath_DIJ.cpp
ShortestPath_FLOYD.cpp
TopologicalSort.cpp
Check.cpp
Conversion.cpp
DeQueue_1.CPP
DeQueue_2.CPP
DestroyQueue.CPP
DuSqStack.cpp
EnQueue_1.CPP
EnQueue_2.CPP
GetTop.CPP
GetTop_L.CPP
InitQueue_1.CPP
InitQueue_2.CPP
InitStack.CPP
LinkQueue.CPP
OutQueue.CPP
Pop.CPP
Pop_L.CPP
Push.CPP
Push_L.CPP
QueueLength.CPP
ClearString.cpp
Compare.cpp
Concat.cpp
HStrConcat.cpp
Index_BF.cpp
Index_KMP.cpp
Replace.cpp
StrAssign.cpp
StrCompare.cpp
StrInsert.cpp
StrLength.cpp
SubHString.cpp
SubString.cpp
Assign.cpp
CreateSMatrix_OL.cpp
DestroyArray.cpp
InitArray.cpp
Locate.cpp
TransposeSMatrix.cpp
Value.cpp
