2009 International Conference on Electrical Engineering and Informatics 2009
DOI: 10.1109/iceei.2009.5254757
|View full text |Cite
|
Sign up to set email alerts
|

Motion detection using Lucas Kanade algorithm and application enhancement

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(3 citation statements)
references
References 1 publication
0
3
0
Order By: Relevance
“…In our case, f x and f y are both directional derivatives with θ = 0 and θ = 90 • We use the Lucas and Kanades methods [27][28] using small windows (in our case, we used a 3 by 3 window in the region ρ), and the least squares method.…”
Section: B Temporal Modeling Using the Optical Flow Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…In our case, f x and f y are both directional derivatives with θ = 0 and θ = 90 • We use the Lucas and Kanades methods [27][28] using small windows (in our case, we used a 3 by 3 window in the region ρ), and the least squares method.…”
Section: B Temporal Modeling Using the Optical Flow Methodsmentioning
confidence: 99%
“…In this context, we use the Lucas-Kanade algorithm[27][28] derivatives.For each frame, f (x; y; t) denotes the pixel value at (x; y) position at time t. The new position of this pixel moves to f (x + δx; y + δy; t + δt) in time δt.…”
mentioning
confidence: 99%
“…The LK-OFE algorithm finds the flow vector of features by minimizing the sum of squared error between two images. It exhibits excellent performance and has been used in many applications [13][14][15][16][17][18]. However, there is a tradeoff between local accuracy and robustness when choosing the window size.…”
Section: Introductionmentioning
confidence: 99%