Interactive Image Matting using Optimization

نویسندگان

  • Jian Guan
  • Guoping Qiu
چکیده

In this paper, we formulate interactive image matting as a constrained optimization problem. We first make some simple and reasonable assumptions about the alpha matte and assume that, geometrically, the closer two pixels are, the more likely they will have similar alpha values, conversely, the farther apart two pixels are, the more likely they will have different alpha values; photometrically, the more similar two pixels are, the more likely they will have similar alpha values, conversely, the more different two pixels are, the more likely they will have different alpha values. We then formulate these assumptions in a quadratic matting cost function and obtain the alpha matte by minimizing the matting cost function. User interaction in the form of a few scribbles indicating a few definite background and foreground pixels is used to provide constraints to make the problem well posed. For a given set of constraints the matting cost function has a unique global minimum and can be solved efficiently using standard methods. With the computed alpha matte we then estimate the background and foreground pixels. Results show that the new method works effectively and provides an alternative computational algorithm for building interactive image editing tools.

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

ثبت نام

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

منابع مشابه

Confidence-driven image co-matting

Single image matting, the task of estimating accurate foreground opacity from a given image, is a severely ill-posed and challenging problem. Inspired by recent advances in image co-segmentation, in this paper, we present a novel framework for a new task called co-matting, which aims to simultaneously extract alpha mattes in multiple images that contain slightly-deformed instances of the same f...

متن کامل

A Literature Review of Image Segmentation Techniques and Matting for the Purpose of Implementing “Grab-Cut”

This literature review attempts to provide a brief overview of some of the most common segmentation techniques, and a comparison between them. It discusses the “Grab-Cut” technique, and reviews some some of the common matting techniques. The graph cut approaches to segmentation can be extended to 3-D data and can be used for segmenting 3-D volumes. Other segmentation techniques use either conto...

متن کامل

Random Walks for Interactive Alpha-matting

Interactive, efficient, methods of foreground extraction and alpha-matting are of increasing practical importance for digital image editing. Although several new approaches to this problem have recently been developed, many challenges remain. We propose a new technique based on random walks that has the following advantages: First, by leveraging a recent technique from manifold learning theory,...

متن کامل

Scalable Matting: A Sub-linear Approach

Natural image matting, which separates foreground from background, is a very important intermediate step in recent computer vision algorithms. However, it is severely underconstrained and difficult to solve. State-of-the-art approaches include matting by graph Laplacian, which significantly improves the underconstrained nature by reducing the solution space. However, matting by graph Laplacian ...

متن کامل

A Convex Image Segmentation: Extending Graph Cuts and Closed-Form Matting

Image matting and segmentation are two closely related topics that concern extracting the foreground and background of an image. While the methods based on global optimization are popular in both fields, the cost functions and the optimization methods have been developed independently due to the different interests of the fields: graph cuts optimize combinatorial functions yielding hard segment...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2006