Multi-image Interpolation based on Graph-Cuts and Symmetric Optic Flow

نویسندگان

  • Christian Linz
  • Christian Lipski
  • Marcus A. Magnor
چکیده

Multi-image interpolation in space and time has recently received considerable attention. Typically, the interpolated image is synthesized by adaptively blending several forward-warped images. Blending itself is a low-pass filtering operation: the interpolated images are prone to blurring, even if correspondences are perfect. Furthermore, ghosting artifacts appear as soon as the underlying correspondence fields are imperfect. We address both issues and propose a multi-image interpolation algorithm that avoids blending. Instead, we cast multi-image interpolation as a labeling problem and decide for each pixel in the synthesized view from which input image to sample. Combined with a symmetrical long-range optical flow formulation for correspondence field estimation, our approach yields crisp interpolated images without ghosting artifacts.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-image Interpolation based on Graph-cuts and Symmetric Optical Flow Technical details

Our correspondence estimation algorithm is based on the approach presented by Steinbruecker et al. [Steinbruecker et al. 2009a]. This approach separates the data-term, i.e. the brightness constancy assumption I1 − I2(x + w1,2) ≈ 0, and the smoothness-term, i.e. ∇w1,2 ≈ ~0, that are the basis for the estimation of the correspondence map w1,2. It hence allows for the integration of arbitrary data...

متن کامل

A comparative performance of gray level image thresholding using normalized graph cut based standard S membership function

In this research paper, we use a normalized graph cut measure as a thresholding principle to separate an object from the background based on the standard S membership function. The implementation of the proposed algorithm known as fuzzy normalized graph cut method. This proposed algorithm compared with the fuzzy entropy method [25], Kittler [11], Rosin [21], Sauvola [23] and Wolf [33] method. M...

متن کامل

A Parallel Framework for Parametric Maximum Flow Problems in Image Segmentation

This paper presents a framework that supports the implementation of parallel solutions for the widespread parametric maximum flow computational routines used in image segmentation algorithms. The framework is based on supergraphs, a special construction combining several image graphs into a larger one, and works on various architectures (multi-core or GPU), either locally or remotely in a clust...

متن کامل

Processing Research Based on Multi-scale Analysis of Image Segmentation Surface Reconstruction Algorithm

In order to improve the cutting surface reconstruction algorithm, which needs a large amount of calculation, and to obtain higher quality of reconstruction surface, processing research of image segmentation surface reconstruction algorithm is proposed based on multi-scale analysis. Through the analysis of the surface reconstruction algorithm and process steps based on multi-scale graph cut, the...

متن کامل

Graph Cuts for Image Segmentation

In computer vision, segmentation is the process of partitioning digital image into multiple regions (sets of pixels), according to some homogeneity criterion. The problem of segmentation is a well-studied one in literature and there are a wide variety of approaches that are used. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems such as Image Segmenta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010