| Lukas-Kanade flow |
| Prob: we have more equations than unknowns |
| Solution: solve least squares problem |
|
|
|
| • | minimum least
squares solution given by solution (in d) of: |
|
|
|
|
|
|
|
|
|
| • | The summations
are over all pixels in the K x K window |
||||||
| • | This technique
was first proposed by Lukas & Kanade (1981) |
||||||
| – | described in
Trucco & Verri reading |
||||||