tailieunhanh - Skiena - The Algorithm Design Manual [Springer-Verlag 1997] Episode 9

Tham khảo tài liệu 'skiena - the algorithm design manual [springer-verlag 1997] episode 9', kỹ thuật - công nghệ, cơ khí - chế tạo máy phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả | Lecture 13 - dynamic programming applications The key problem is establishing a correspondence between features in the two images. You want to morph an eye to an eye not an ear to an ear. We can do this matching on a line-by-line basis This should sound like string matching but with a different set of operations Full run match We may match run i on top to run j on bottom for a cost which is a function of the difference in the lengths of the two runs and their positions. Merging runs We may match a string of consecutive runs on top to a run on bottom. The cost will be a function of the number of runs their relative positions and lengths. Listen To Part 14-11 Splitting runs We may match a big run on top to a string of consecutive runs on the bottom. This is just the converse of the merge. Again the cost will be a function of the number of runs their relative positions and lengths. This algorithm was incorported into a morphing system with the following results file E LEC LECTUR16 6 of 7 19 1 2003 1 35 01 Lecture 13 - dynamic programming applications Next Lecture 14 - data Up No Title Previous Lecture 12 - introduction Algorithms Mon Jun 2 09 21 39 EDT1997 file E LEC LECTUR16 7 of 7 19 1 2003 1 35 01