%?使用自適應(yīng)路徑搜索法計(jì)算運(yùn)動(dòng)向量（Adaptive?Rood?Pattern?Search）
%
%?輸入
%???imgP?:?原圖像
%???imgI?:?參考圖像
%???mbSize?:?宏塊大小
%???p?:?搜索參數(shù)
%
%?輸出
%???motionVect?:?原圖像的運(yùn)動(dòng)向量
%???ARPScomputations:?宏塊搜索點(diǎn)的平均數(shù)


function?[motionVect?ARPScomputations]?=?ARPS（imgP?imgI?mbSize?p）

[row?col]?=?size（imgI）;

vectors?=?zeros（2row*col/mbSize^2）;
costs?=?ones（1?6）?*?65537;

%?小鉆石搜索圖樣的格點(diǎn)
SDSP（1:）?=?[?0?-1];????%????????????
SDSP（2:）?=?[-1??0];????%??????????????1
SDSP（3:）?=?[?0??0];????%???????????2??3??4
SDSP（4:）?=?[?1??0];????%??????????????5
SDSP（5:）?=?[?0??1];????%

%?我們將會(huì)在一個(gè)初始為零的檢驗(yàn)矩陣中標(biāo)記除已完成檢驗(yàn)的點(diǎn)的位置，并且標(biāo)志為1

checkMatrix?=?zeros（2*p+12*p+1）;

computations?=?0;

%?從圖像左上角開(kāi)始
%?以宏塊邊長(zhǎng)為單位步長(zhǎng)
%?在每個(gè)宏塊的上下左右四個(gè)方向上，尋找其最吻合的分塊

mbCount?=?1;
for?i?=?1?:?mbSize?:?row-mbSize+1
????for?j?=?1?:?mbSize?:?col-mbSize+1
????????
????????%?自適應(yīng)路徑搜索法（ARPS）從這里開(kāi)始
????????
????????x?=?j;
????????y?=?i;
????????
????????costs（3）?=?costFuncMAD（imgP（i:i+mbSize-1j:j+mbSize-1）?...
????????????????????????????????????imgI（i:i+mbSize-1j:j+mbSize-1）mbSize）;
????????
????????checkMatrix（p+1p+1）?=?1;
????????computations?=??computations?+?1;
????????
????????%?如果在最左邊一列，則進(jìn)行大菱形搜索LDSP（步長(zhǎng)為2）
????????if?（j-1?????????????stepSize?=?2;
????????????maxIndex?=?5;
????????else
????????????stepSize?=?max（abs（vectors（1mbCount-1））?abs（vectors（2mbCount-1）））;
????????????
????????????%?如果運(yùn)動(dòng)矢量指向的點(diǎn)為大菱形圖樣上面的點(diǎn)，無(wú)需重復(fù)計(jì)算
????????????if?（?（abs（vectors（1mbCount-1））?==?stepSize?&&?vectors（2mbCount-1）?==?0）?...
?????????????????||?（abs（vectors（2mbCount-1））?==?stepSize?&&?vectors（1mbCount-1）?==?0））?...
?????????????????
????????????????maxIndex?=?5;?%?只需檢查路徑上的5個(gè)點(diǎn)
????????????????
????????????else
????????????????maxIndex?=?6;?%?檢查路徑上的6個(gè)點(diǎn)
????????????????LDSP（6:）?=?[?vectors（2?mbCount-1）??vectors（1?mbCount-1）];
????????????end
????????end
????????
????????%?一開(kāi)始只能用大菱形搜索
????????
????????LDSP（1:）?=?[?0?-stepSize];
????????LDSP（2:）?=?[-stepSize?0];?
????????LDSP（3:）?=?[?0??0];
????????LDSP（4:）?=?[stepSize??0];
????????LDSP（5:）?=?[?0??stepSize];
????????
????????for?k?=?1:maxIndex
????????????refBlkVer?=?y?+?LDSP（k2）;???%?行
????????????refBlkHor?=?x?+?LDSP（k1）;???%?列
????????????if?（?refBlkVer??row?...
?????????????????||?refBlkHor??col）
?????????????
????????????????continue;?%?超出圖像邊界
????????????end
????????????
????????????if?（k?==?3?||?stepSize?==?0）
????????????????continue;?%?已計(jì)算中心點(diǎn)
????????????end
????????????costs（k）?=?costFuncMAD（imgP（i:i+mbSize-1j:j+mbSize-1）?...
??????????????????imgI（refBlkVer:refBlkVer+mbSize-1?refBlkHor:refBlkHor+mbSize-1）?mbSize）;
????????????computations?=??computations?+?1;
????????????checkMatrix（LDSP（k2）?+?p+1?LDSP（k1）?+?p+1）?=?1;

????????end

????????[cost?point]?=?min（costs）;
????????
????????%?如果最小值為菱形的中心點(diǎn)，則doneFlag置1

????????x?=?x?+?LDSP（point?1）;
????????y?=?y?+?LDSP（point?2）;
????????costs?=?ones（15）?*?655

?屬性????????????大小?????日期????時(shí)間???名稱
-----------?---------??----------?-----??----

?????文件???????5213??2010-07-22?17:14??運(yùn)動(dòng)估計(jì)基本算法\ARPS.m

?????文件????????519??2004-04-25?21:46??運(yùn)動(dòng)估計(jì)基本算法\costFuncMAD.m

?????文件??????18418??2010-07-22?17:14??運(yùn)動(dòng)估計(jì)基本算法\DS.m

?????文件???????5573??2010-07-20?11:30??運(yùn)動(dòng)估計(jì)基本算法\FourSS.m

?????文件???????1798??2010-07-11?20:24??運(yùn)動(dòng)估計(jì)基本算法\FullSearch.m

?????文件????????487??2010-07-07?12:45??運(yùn)動(dòng)估計(jì)基本算法\imgPSNR.m

?????文件???????3033??2010-07-22?17:13??運(yùn)動(dòng)估計(jì)基本算法\main.m

?????文件????????700??2004-04-14?22:25??運(yùn)動(dòng)估計(jì)基本算法\minCost.m

?????文件???????1094??2004-04-10?14:09??運(yùn)動(dòng)估計(jì)基本算法\motionComp.m

?????文件???????8129??2010-07-17?20:23??運(yùn)動(dòng)估計(jì)基本算法\NewTSS.m

?????文件??????10924??2010-07-20?11:30??運(yùn)動(dòng)估計(jì)基本算法\SESTSS.m

?????文件???????2767??2010-07-20?11:18??運(yùn)動(dòng)估計(jì)基本算法\ThreeStepSearch.m

?????文件????????865??2010-07-22?18:12??運(yùn)動(dòng)估計(jì)基本算法\必讀.txt

?????文件?????122444??2005-10-20?12:51??運(yùn)動(dòng)估計(jì)基本算法\運(yùn)動(dòng)估計(jì)塊匹配算法（英文原版）.PDF

?????文件??????77878??2010-07-07?12:59??運(yùn)動(dòng)估計(jì)基本算法\car\car000.bmp

?????文件??????77878??2010-07-07?12:59??運(yùn)動(dòng)估計(jì)基本算法\car\car001.bmp

?????文件??????77878??2010-07-07?12:59??運(yùn)動(dòng)估計(jì)基本算法\car\car002.bmp

?????文件??????77878??2010-07-07?12:59??運(yùn)動(dòng)估計(jì)基本算法\car\car003.bmp

?????文件??????77878??2010-07-07?12:59??運(yùn)動(dòng)估計(jì)基本算法\car\car004.bmp

?????文件??????77878??2010-07-07?12:59??運(yùn)動(dòng)估計(jì)基本算法\car\car005.bmp

?????文件??????77878??2010-07-07?12:59??運(yùn)動(dòng)估計(jì)基本算法\car\car006.bmp

?????文件??????77878??2010-07-07?12:59??運(yùn)動(dòng)估計(jì)基本算法\car\car007.bmp

?????文件??????77878??2010-07-07?12:59??運(yùn)動(dòng)估計(jì)基本算法\car\car008.bmp

?????文件??????77878??2010-07-07?12:59??運(yùn)動(dòng)估計(jì)基本算法\car\car009.bmp

?????文件??????77878??2010-07-07?12:59??運(yùn)動(dòng)估計(jì)基本算法\car\car010.bmp

?????文件??????77878??2010-07-07?12:59??運(yùn)動(dòng)估計(jì)基本算法\car\car011.bmp

?????文件??????77878??2010-07-07?12:59??運(yùn)動(dòng)估計(jì)基本算法\car\car012.bmp

?????文件??????77878??2010-07-07?12:59??運(yùn)動(dòng)估計(jì)基本算法\car\car013.bmp

?????文件??????77878??2010-07-07?12:59??運(yùn)動(dòng)估計(jì)基本算法\car\car014.bmp

?????文件??????77878??2010-07-07?12:59??運(yùn)動(dòng)估計(jì)基本算法\car\car015.bmp

............此處省略90個(gè)文件信息