Practical background estimation for mosaic blending with patch-based Markov random fields |
| |
| Authors: | Dae-Woong Kim Ki-Sang Hong |
| |
| Affiliation: | 1. Department of Electrical Engineering, Asansol Engineering College, Asansol, West Bengal, India;2. Department of Electrical Engineering, Indian Institute of Technology (Indian School of Mines), Dhanbad, Jharkhand, India;1. Department of Computer Engineering, The University of Jordan, Amman 11942, Jordan;2. Department of Electrical Engineering, The University of Jordan, Amman 11942, Jordan |
| |
| Abstract: | In this paper, we present a new background estimation algorithm which effectively represents both background and foreground. The problem is formulated with a labeling problem over a patch-based Markov random field (MRF) and solved with a graph-cuts algorithm. Our method is applied to the problem of mosaic blending considering the moving objects and exposure variations of rotating and zooming camera. Also, to reduce seams in the estimated boundaries, we propose a simple exposure correction algorithm using intensities near the estimated boundaries. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
