OpenCV  3.1.0 Open Source Computer Vision
Optical Flow

## Goal

In this chapter,

• We will understand the concepts of optical flow and its estimation using Lucas-Kanade method.
• We will use functions like cv2.calcOpticalFlowPyrLK() to track feature points in a video.

## Optical Flow

Optical flow is the pattern of apparent motion of image objects between two consecutive frames caused by the movemement of object or camera. It is 2D vector field where each vector is a displacement vector showing the movement of points from first frame to second. Consider the image below (Image Courtesy: Wikipedia article on Optical Flow).

image

It shows a ball moving in 5 consecutive frames. The arrow shows its displacement vector. Optical flow has many applications in areas like :

• Structure from Motion
• Video Compression
• Video Stabilization ...

Optical flow works on several assumptions:

1. The pixel intensities of an object do not change between consecutive frames.
2. Neighbouring pixels have similar motion.

Consider a pixel $$I(x,y,t)$$ in first frame (Check a new dimension, time, is added here. Earlier we were working with images only, so no need of time). It moves by distance $$(dx,dy)$$ in next frame taken after $$dt$$ time. So since those pixels are the same and intensity does not change, we can say,

$I(x,y,t) = I(x+dx, y+dy, t+dt)$

Then take taylor series approximation of right-hand side, remove common terms and divide by $$dt$$ to get the following equation:

$f_x u + f_y v + f_t = 0 \;$

where:

$f_x = \frac{\partial f}{\partial x} \; ; \; f_y = \frac{\partial f}{\partial y}$

$u = \frac{dx}{dt} \; ; \; v = \frac{dy}{dt}$

Above equation is called Optical Flow equation. In it, we can find $$f_x$$ and $$f_y$$, they are image gradients. Similarly $$f_t$$ is the gradient along time. But $$(u,v)$$ is unknown. We cannot solve this one equation with two unknown variables. So several methods are provided to solve this problem and one of them is Lucas-Kanade.

We have seen an assumption before, that all the neighbouring pixels will have similar motion. Lucas-Kanade method takes a 3x3 patch around the point. So all the 9 points have the same motion. We can find $$(f_x, f_y, f_t)$$ for these 9 points. So now our problem becomes solving 9 equations with two unknown variables which is over-determined. A better solution is obtained with least square fit method. Below is the final solution which is two equation-two unknown problem and solve to get the solution.

$\begin{bmatrix} u \\ v \end{bmatrix} = \begin{bmatrix} \sum_{i}{f_{x_i}}^2 & \sum_{i}{f_{x_i} f_{y_i} } \\ \sum_{i}{f_{x_i} f_{y_i}} & \sum_{i}{f_{y_i}}^2 \end{bmatrix}^{-1} \begin{bmatrix} - \sum_{i}{f_{x_i} f_{t_i}} \\ - \sum_{i}{f_{y_i} f_{t_i}} \end{bmatrix}$

( Check similarity of inverse matrix with Harris corner detector. It denotes that corners are better points to be tracked.)

So from user point of view, idea is simple, we give some points to track, we receive the optical flow vectors of those points. But again there are some problems. Until now, we were dealing with small motions. So it fails when there is large motion. So again we go for pyramids. When we go up in the pyramid, small motions are removed and large motions becomes small motions. So applying Lucas-Kanade there, we get optical flow along with the scale.

## Lucas-Kanade Optical Flow in OpenCV

OpenCV provides all these in a single function, cv2.calcOpticalFlowPyrLK(). Here, we create a simple application which tracks some points in a video. To decide the points, we use cv2.goodFeaturesToTrack(). We take the first frame, detect some Shi-Tomasi corner points in it, then we iteratively track those points using Lucas-Kanade optical flow. For the function cv2.calcOpticalFlowPyrLK() we pass the previous frame, previous points and next frame. It returns next points along with some status numbers which has a value of 1 if next point is found, else zero. We iteratively pass these next points as previous points in next step. See the code below:

1 import numpy as np
2 import cv2
3
4 cap = cv2.VideoCapture('slow.flv')
5
6 # params for ShiTomasi corner detection
7 feature_params = dict( maxCorners = 100,
8  qualityLevel = 0.3,
9  minDistance = 7,
10  blockSize = 7 )
11
12 # Parameters for lucas kanade optical flow
13 lk_params = dict( winSize = (15,15),
14  maxLevel = 2,
15  criteria = (cv2.TERM_CRITERIA_EPS | cv2.TERM_CRITERIA_COUNT, 10, 0.03))
16
17 # Create some random colors
18 color = np.random.randint(0,255,(100,3))
19
20 # Take first frame and find corners in it
22 old_gray = cv2.cvtColor(old_frame, cv2.COLOR_BGR2GRAY)
23 p0 = cv2.goodFeaturesToTrack(old_gray, mask = None, **feature_params)
24
25 # Create a mask image for drawing purposes
27
28 while(1):
30  frame_gray = cv2.cvtColor(frame, cv2.COLOR_BGR2GRAY)
31
32  # calculate optical flow
33  p1, st, err = cv2.calcOpticalFlowPyrLK(old_gray, frame_gray, p0, None, **lk_params)
34
35  # Select good points
36  good_new = p1[st==1]
37  good_old = p0[st==1]
38
39  # draw the tracks
40  for i,(new,old) in enumerate(zip(good_new,good_old)):
41  a,b = new.ravel()
42  c,d = old.ravel()
44  frame = cv2.circle(frame,(a,b),5,color[i].tolist(),-1)
46
47  cv2.imshow('frame',img)
48  k = cv2.waitKey(30) & 0xff
49  if k == 27:
50  break
51
52  # Now update the previous frame and previous points
53  old_gray = frame_gray.copy()
54  p0 = good_new.reshape(-1,1,2)
55
56 cv2.destroyAllWindows()
57 cap.release()

(This code doesn't check how correct are the next keypoints. So even if any feature point disappears in image, there is a chance that optical flow finds the next point which may look close to it. So actually for a robust tracking, corner points should be detected in particular intervals. OpenCV samples comes up with such a sample which finds the feature points at every 5 frames. It also run a backward-check of the optical flow points got to select only good ones. Check samples/python/lk_track.py).

See the results we got:

image

## Dense Optical Flow in OpenCV

Lucas-Kanade method computes optical flow for a sparse feature set (in our example, corners detected using Shi-Tomasi algorithm). OpenCV provides another algorithm to find the dense optical flow. It computes the optical flow for all the points in the frame. It is based on Gunner Farneback's algorithm which is explained in "Two-Frame Motion Estimation Based on Polynomial Expansion" by Gunner Farneback in 2003.

Below sample shows how to find the dense optical flow using above algorithm. We get a 2-channel array with optical flow vectors, $$(u,v)$$. We find their magnitude and direction. We color code the result for better visualization. Direction corresponds to Hue value of the image. Magnitude corresponds to Value plane. See the code below:

1 import cv2
2 import numpy as np
3 cap = cv2.VideoCapture("vtest.avi")
4
6 prvs = cv2.cvtColor(frame1,cv2.COLOR_BGR2GRAY)
7 hsv = np.zeros_like(frame1)
8 hsv[...,1] = 255
9
10 while(1):
12  next = cv2.cvtColor(frame2,cv2.COLOR_BGR2GRAY)
13
14  flow = cv2.calcOpticalFlowFarneback(prvs,next, None, 0.5, 3, 15, 3, 5, 1.2, 0)
15
16  mag, ang = cv2.cartToPolar(flow[...,0], flow[...,1])
17  hsv[...,0] = ang*180/np.pi/2
18  hsv[...,2] = cv2.normalize(mag,None,0,255,cv2.NORM_MINMAX)
19  bgr = cv2.cvtColor(hsv,cv2.COLOR_HSV2BGR)
20
21  cv2.imshow('frame2',bgr)
22  k = cv2.waitKey(30) & 0xff
23  if k == 27:
24  break
25  elif k == ord('s'):
26  cv2.imwrite('opticalfb.png',frame2)
27  cv2.imwrite('opticalhsv.png',bgr)
28  prvs = next
29
30 cap.release()
31 cv2.destroyAllWindows()

See the result below:

image

OpenCV comes with a more advanced sample on dense optical flow, please see samples/python/opt_flow.py.