{"id":491,"date":"2019-06-29T22:01:43","date_gmt":"2019-06-29T22:01:43","guid":{"rendered":"http:\/\/funfacts.104.42.120.246.xip.io\/?page_id=491"},"modified":"2019-11-20T22:04:11","modified_gmt":"2019-11-20T22:04:11","slug":"face-derivatives-and-computer-vision","status":"publish","type":"page","link":"https:\/\/math.hmc.edu\/funfacts\/face-derivatives-and-computer-vision\/","title":{"rendered":"Face Derivatives and Computer Vision"},"content":{"rendered":"\n
\n
\n

One challenge in robotics is the problem of computer vision<\/em>: how do you program a computer to interpret and “understand” the data it receives from some visual sensor? For example, one aspect of this problem is object\u00a0recognition<\/em>, and another is object\u00a0tracking<\/em>.<\/p>\n\n\n\n

While recognition is a very hard problem (that won’t concern us here), if you know what an object looks like, it can be tracked using some interesting mathematical ideas.<\/p>\n<\/div>\n\n\n\n

\n
\"\"<\/figure><\/div>\n\n\n\n
\"\"<\/figure><\/div>\n\n\n\n
\"\"<\/figure><\/div>\n<\/div>\n<\/div>\n\n\n\n

Suppose you are trying to track the face in Figure 1 as it moves in a sequence of frames. The visual data in each frame is an array of numbers (pixel intensities). Naively, you might track the face by searching each frame for an pattern of numbers similar to the one in Figure 1. But this can be very computationally intensive.<\/p>\n\n\n\n

Here is a better method used by computer scientists. The key idea is linearization<\/em>— while an object’s motion may not be linear, for small time steps it is approximately linear. So we would expect that the frames alter in approximately linear ways. <\/p>\n\n\n\n

And they do! In the first row of Figure 2, we see a face moving left in a sequence of frames (look at them right-to-left). We can approximate the motion by looking at the frame in the first row labeled “+1 pix” and “subtracting” the original frame. This difference is shown in Figure 3. (If you like, you can think of it as a “derivative” representing the face’s motion!) If we assume that the face’s true motion is just the motion in Figure 3 repeated over and over, we get the approximation in the second row of Figure 2! As you can see, it remains a pretty good approximation for small numbers of steps. So we can “track” the face using this idea, as described below.<\/p>\n\n\n\n

The Math Behind the Fact:<\/strong>
In practice, the array of pixel intensities is encoded as a (very long) vector of numbers. The space of all possible pictures forms a vector space, and the vector associated with Figure 2 forms a vector V. Tracking an object then correponds to finding the component of a given vector (picture) in the direction of V, and the multiple of V tells us the amount of the translation! Other motions can also be treated in this way, such as shifts up\/down, rotation, scalings, etc. These correspond to vector components in other directions. (Thanks to Zach Dodds for providing the pictures, and Ran Libeskind-Hadas for providing his face!)<\/p>\n\n\n\n

You can study linearity and vector spaces in a linear algebra course.<\/p>\n\n\n\n

How to Cite this Page:<\/strong> 
Su, Francis E., et al. “Face Derivatives and Computer Vision.” Math Fun Facts<\/em>. <http:\/\/www.math.hmc.edu\/funfacts>.<\/p>\n\n\n\n

Fun Fact suggested by:<\/strong>
Zach Dodds <\/p>\n","protected":false},"excerpt":{"rendered":"

One challenge in robotics is the problem of computer vision: how do you program a computer to interpret and “understand”...<\/p>\n","protected":false},"author":7,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"tags":[20,7,6,101,4,12],"class_list":["post-491","page","type-page","status-publish","hentry","tag-analysis","tag-calculus","tag-hard","tag-linear-algebra","tag-medium","tag-other"],"jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/pages\/491","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/users\/7"}],"replies":[{"embeddable":true,"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/comments?post=491"}],"version-history":[{"count":4,"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/pages\/491\/revisions"}],"predecessor-version":[{"id":1435,"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/pages\/491\/revisions\/1435"}],"wp:attachment":[{"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/media?parent=491"}],"wp:term":[{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/math.hmc.edu\/funfacts\/wp-json\/wp\/v2\/tags?post=491"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}