The problem of image registration subsumes a number of problems and techniques in multiframe image analysis, including the computation of optic flow (general pixel-based motion), stereo correspondence, structure from motion, and feature tracking. We present a new registration algorithm based on spline representations of the displacement field which can be specialized to solve all of the above mentioned problems. In particular, we show how to compute local flow, global (parametric) flow, rigid flow resulting from camera egomotion, and multiframe versions of the above problems. Using a spline-based description of the flow removes the need for overlapping correlation windows, and produces an explicit measure of the correlation between adjacent flow estimates. We demonstrate our algorithm on multiframe image registration and the recovery of 3D projective scene geometry. We also provide results on a number of standard motion sequences.
標(biāo)簽： image registration multiframe techniques
上傳時(shí)間： 2016-01-20
上傳用戶：520
Data Abstraction & Problem Solving with C++源碼
標(biāo)簽： Abstraction Problem Solving Data
上傳時(shí)間： 2013-12-24
上傳用戶：離殤
LCD EDID dump reader and diaplay
標(biāo)簽： diaplay reader EDID dump
上傳時(shí)間： 2014-01-25
上傳用戶：1966640071
Phonix EDID reader and write
標(biāo)簽： Phonix reader write EDID
上傳時(shí)間： 2016-01-25
上傳用戶：jackgao
chm reader源代碼 evc下使用 pocket pc 2003 能夠閱讀chm格式
標(biāo)簽： chm reader pocket 2003
上傳時(shí)間： 2013-12-03
上傳用戶：hullow
source codes to solve Hexpuzzle problem
標(biāo)簽： Hexpuzzle problem source codes
上傳時(shí)間： 2016-01-29
上傳用戶：cmc_68289287
Winbond isp writer
上傳時(shí)間： 2016-02-05
上傳用戶：xuanchangri
這是一個(gè)用遺傳算法來求解旅行商問題（TSP問題：Travelling Salesman Problem）的源代碼，學(xué)習(xí)遺傳算法，演化計(jì)算的很值得一看！
標(biāo)簽： Travelling Salesman Problem TSP
上傳時(shí)間： 2016-02-05
上傳用戶：hj_18
Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: Given a number of cities to visit and their distances from all other cities know, an optimal travel route has to be found so that each city is visited one and only once with the least possible distance traveled. This is a simple problem with handful of cities but becomes complicated as the number increases.
標(biāo)簽： interesting Traveling classical Salesman
上傳時(shí)間： 2016-02-06
上傳用戶：rocwangdp
RFID reader 原始碼 CF2E
上傳時(shí)間： 2013-12-17
上傳用戶：1101055045
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
