محبوبترین نویسندگان :
نویسندگان مقالات پربازدید :
مجله بین المللی بینایی کامپیوتر 2013
جزئیات رویداد
همایش ، رویداد ، ژورنال
اینستاگرام تی پی بین
حوزه های تحت پوشش رویداد

  • multi-label moves for mrfs with truncated convex priors

    نویسندگان :
    کلمات کلیدی :
    جزئیات بیشتر مقاله
    • تاریخ ارائه: 1392/07/24
    • تاریخ انتشار در تی پی بین: 1392/07/24
    • تعداد بازدید: 1122
    • تعداد پرسش و پاسخ ها: 0
    • شماره تماس دبیرخانه رویداد: -
     optimization with graph cuts became very popular in recent years. while exact optimization is possible in a few cases, many useful energy functions are np hard to optimize. one approach to approximate optimization is the so-called move making algorithms. at each iteration, a move-making algorithm makes a proposal (move) for a pixel p to either keep its old label or switch to a new label. two move-making algorithms based on graph cuts are in wide use, namely the swap and expansion. both of these moves are binary in nature, that is they give each pixel a choice of only two labels. an evaluation of optimization techniques shows that the expansion and swap algorithms perform very well for energies where the underlying mrf has the potts prior. however for more general priors, the swap and expansion algorithms do not perform as well. the main contribution of this paper is to develop multi-label moves. a multi-label move, unlike expansion and swap, gives each pixel has a choice of more than two labels to switch to. in particular, we develop several multi-label moves for truncated convex priors. we evaluate our moves on image restoration, inpainting, and stereo correspondence. we get better results than expansion and swap algorithms, both in terms of the energy value and accuracy.

سوال خود را در مورد این مقاله مطرح نمایید :

با انتخاب دکمه ثبت پرسش، موافقت خود را با قوانین انتشار محتوا در وبسایت تی پی بین اعلام می کنم
مقالات جدیدترین رویدادها
مقالات جدیدترین ژورنال ها