DP for stitching

Theory

1. At each p(r, c),
2. for each shift d(dr, dc), there are
   
1. a corr score with the image being compared
2. a global cost value: the gap(row(i-1), row(i)). We want the gap < 0
   
3. #2 is under the assumptions:
1. after shift, for all rows, gap(row(i-1), row(i)) < 0;
   
2. from current FOV on, everything goes with 20% overlap, meaning a global corresponding d(dr, dc) shift for all of them.
3. maximize overall correlation
4. minimize cost
   

hello flock

hello!

1. clause 1
1. clause 1.1
2. clause 2.
   

Prepare for 1st of Work: Outline

Condition

1. Midomi
2. Goto's work
3. Intimacy through voice recognition
4. Microphone technique
5. Game audio vs. audio game
   

Analysis

1. Benoit interested in Midomi: what's in there?
   
2. Query by humming: problematic direction.
3. Other than QyH, what's useful? Goto
   
4. Don't just destroy the plan, give constructive
   

What to do

1. Figure out what part in Midomi that we can benifit from: based on game big picture.
2. Prepare a material to convince people that QBH is not working.
3. Prepare Goto's stuff that proves voice recognition in responses.
4. Some basic idea in development: platform, audio usecase.
   

groove unwarp: resume

Use case

1. Resume mode: default
2. Always start with the last win of the last ring
   
3. If there is resume.dat, load i_ring, rci_fov_1st, i_win, they are all most recent (innermost)
4. else, i_ring = ring_max, rci_fov_1st = rc_samp.rci_fov_focus, i_win = 1

Rethinking

1. Auto mode vs. manual mode
2. with while loop, i_rings, and CC needs to be continuously updated upon subroutine's termination, yet we need random assignments to these vars, therefore, it is better divided into two distinct processes: continuous / discrete, or auto / manual.

Imp

1. Use a b_auto flag in main.m
   

phase unwrapping

Condition

1. Wins.FOVs
2. A single 2pi drop in the tail FOVs of Win
3. Previously, in a 2pi-drop FOV, FOV.a have been unwrapped, but all suc-FOVs have not.

Requirement

1. Given an unwarp-point P(win, aa), a = va_win(aa), all P(win, aa+), in which va_win(aa+) > a, should now = va_win(aa+) + 2pi.
   

Imp

1. Change original code to this recursion.