Homework #4                Due 10/4


Read  Book, Ch.8.

 

 

  1. Return to the chart above, from HW#3, pictured above, and recall problem 4 of that homework:

 

“Use rows 1 and 2 of your completed table above in order to find Dxc  Dyc  Dqpan  Dqtilt

 

     in the following approximation:

 

Dxc = J11Dqpan+ J12Dqtilt

Dyc = J21Dqpan+ J22Dqtilt

 

 

Similarly, use rows 1 and 3 to find other values of Dxc  Dyc  Dqpan  Dqtilt

 in

 

 

Dxc = J11Dqpan + J12Dqtilt

Dyc = J21Dqpan + J22Dqtilt

 

 

Use the four equations above to solve for approximate elements of the Jacobian of interest, [J].”

 

Referring to the chart below, note that the above exercise entailed identification of the fourth and sixth rows, based on information you collected in the lab 9/17. 

This was just enough to solve for the four elements of the Jacobian, i.e. it is four equations for four unknowns.  In an effort to use all of the collected data, fill in

all 24 places in this table, using the data you collected in the table at the top.  Note that the ordering of the differences won’t actually matter to the eventual

estimates of elements of [J]; for the top left slot, for instance, it doesn’t matter whether you base Dqpan on “q4pan - q1pan or “ q1pan - q4pan ”.   It is important to

preserve whichever order you choose in the remaining elements in that first row:  Dqtilt, Dxc, Dyc.

 

2        With the redundancy that this affords, we seek a least-squares best resolution of our four Jacobian elements.   Thus we seek to minimize over all b :

 

J(b)  = ˝  r T [W] r   =  ˝ Si Wi ri2,     i=1, 2, 3 … 12

 

where

 

r2i-1 = Dxci  - [ b1 Dqipan+ b2 Dqitilt ]

r2i  = Dyic - [ b3 Dqipan+ b4 Dqitilt ]

 

i = 1, 2, 3, 4, 5, 6 (i.e. each corresponding with a row of your table)

 

and where we have defined

 

J11 = b1     J12 = b2

J21 = b3     J22 = b4

 

Begin with an initial guess of  b= [1 1 1 1]T, and show that application of

 

Db = [ATWA]-1ATWr(bo)

 

, with W=I, results in the correct b with just one iteration.  (Note that, this being a linear model, we would not ordinarily go to the trouble of applying Newton-Gauss, with its attendant “initial guess”.)

 

 

 

3        Please come to the lab at the usual times September 24 -- this time to acquire two images with the multiple spot at two different pan/tilt angles.  

Be sure the camera remains in a fixed location, not moving between the acquisitions of the two pictures. 

 

Difference image two from image 1, then apply the mask of HW 3 in order to condition this differenced image, replacing all pixel values,

except those in the rightmost, leftmost, uppermost, and lowermost 3 columns/rows with a new integer, based upon the mask formulation. 

 

Write a simple program that will find most/all of the laser-spot centers in both images from this single differenced image. 

 

Returning to your two initial images, replace the pixel center of each found spot in the respective images with a “zero”, and print out the

 two consequent pictures. 

Discuss in 100 words or so the way in which your program uses the conditioned/differenced image, as well as methods

 you might apply to reduce the number of false negatives and/or false positives.