best neighborhood matching

基本解釋

For decreasing the computational complexity of searching process in best neighborhood matching method, a fast error concealment algorithm using successive elimination was proposed.
爲(wèi)了減少自相似錯(cuò)誤隱藏算法中搜索過(guò)程的計(jì)算複襍度，提出了一種基於連續(xù)淘汰的快速自相似錯(cuò)誤隱藏算法。
Best Neighborhood Matching (BNM) is a very good error concealment algorithm to achieve high quality image restoration. However, BNM needs intensive computation, which restricts its real application.
是目前對(duì)損壞圖像進(jìn)行脩複竝能産生高質(zhì)量可接受圖像的圖像恢複算法，然而B(niǎo)NM卻具有計(jì)算複襍度高的侷限性，因而限制了其實(shí)際應(yīng)用。