08-06-2013, 11:28 AM
Mosaicing
TExt Mosaicing.pptx (Size: 130.28 KB / Downloads: 18)
Algorithms
Unidirectional
Bidirectional
Improved Bidirectional
Bidirectional
Step 1 – Determine the distance (D1) between the first column and the beginning position of OR in S1 by employing algorithm 1.
Step 2 – Determine the distance (D2) between the first column and the beginning position of OR in S1 by employing algorithm 1 and by changing pointer positions i and j of S1 start from the nth column in S1, and i and j of S2 starting from the nth column of S2.
Step 3 – If (D2 < D1) then the D2th position is the beginning position of actual OR in S1.
Step 4 – Translate the split image 2 such that the overlapping regions of both the images match each other with respect to their coordinates
Improved Unidirectional
Step 1 – For each column invoke algorithm 1 to identify the overlapping region in the split images.
(a) If the column of S1 does not match with the column of S2. Then note down the values of count and i.
(b) If count ≠ 0 and j = n then ( where count is number of matches) overlapping region is found
Else go to next column For end