Determination of the Optimal Seam-Lines in Image Mosaicking with the Dynamic Programming (DP) on the Converted Cost Space
A novel algorithm to determine the optimal seam-line in image mosacking is proposed to establish the best borderline among neighboring images. The algorithm is based on the utilization of the dynamic programming algorithm on the converted cost field. The converting function is created adaptively based on the distribution of the pixel difference values. The path found with this algorithm runs along the smaller cost regions regardless its length.
KeywordsDynamic Programming Algorithm Image Mosaic Overlap Area Histogram Match Neighboring Image
Unable to display preview. Download preview PDF.
- 2.Uyttendaele, M., Eden, A., Szeliski, R.: Eliminating ghosting and exposure artifacts in image mosaics. In: CVPR II, pp. 1144–1154 (2001)Google Scholar
- 3.Adelson, E.H., Anderson, C.H., Bergen, J.R., Burt, P.J., Ogden, J.M.: Pyramid method in image processing. RCA Engineer 29(5), 33–41 (1984)Google Scholar