Synthetic aperture imaging using pixel labeling via energy minimization

被引:48
作者
Pei, Zhao [1 ,2 ]
Zhang, Yanning [1 ]
Chen, Xida [2 ]
Yang, Yee-Hong [2 ]
机构
[1] Northwestern Polytech Univ, Sch Comp Sci, Xian 710072, Shaanxi, Peoples R China
[2] Univ Alberta, Dept Comp Sci, Edmonton, AB, Canada
基金
加拿大自然科学与工程研究理事会; 中国国家自然科学基金; 中国博士后科学基金;
关键词
Energy minimization; Graph cuts; Labeling; Synthetic aperture imaging; BACKGROUND ESTIMATION; SEGMENTATION;
D O I
10.1016/j.patcog.2012.06.014
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Synthetic aperture imaging using an array of cameras, which has become popular recently, can easily handle the occlusion problem by "seeing through" occluders. Unfortunately, the resulting image is still blurry because it combines information not only from the region of interest but also from the occluding regions. Removing the blurriness of synthetic aperture images has become a challenging task for many computer vision applications. In this paper, we propose a novel method to improve the image quality of synthetic aperture imaging using energy minimization. Unlike the conventional synthetic aperture imaging method, which averages images from all the camera views, we reformulate the problem as a labeling problem. In particular, we use the energy minimization method to label each pixel in each camera view to decide whether or not it belongs to an occluder. After that, the focusing at the desired depth is by averaging pixels that are not labeled as occluder. The experimental results show that the proposed method outperforms the traditional synthetic aperture imaging method as well as its improved versions, which are simply dim and blur occluders in the resulting image. To the best of our knowledge, our proposed method is the first one for improving the results of synthetic aperture image without using a training set from the input sequence. As well, it is the first method that makes no assumptions on whether or not the objects in the scenes are static. (C) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:174 / 187
页数:14
相关论文
共 28 条
[1]  
[Anonymous], P ACM IEEE INT C DIS
[2]   Fast approximate energy minimization via graph cuts [J].
Boykov, Y ;
Veksler, O ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) :1222-1239
[3]   An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision [J].
Boykov, Y ;
Kolmogorov, V .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (09) :1124-1137
[4]  
Boykov Y., 2010, Advances in Markov Random Fields
[5]  
Boykov YY, 2001, EIGHTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOL I, PROCEEDINGS, P105, DOI 10.1109/ICCV.2001.937505
[6]  
Cohen S, 2005, IEEE I CONF COMP VIS, P1034
[7]  
Gao Y, 2010, PROCEEDINGS OF 2010 INTERNATIONAL WORKSHOP ON DIFFUSE POLLUTION-MANAGEMENT MEASURES AND CONTROL TECHNIQUE, P97
[8]   EXACT MAXIMUM A-POSTERIORI ESTIMATION FOR BINARY IMAGES [J].
GREIG, DM ;
PORTEOUS, BT ;
SEHEULT, AH .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1989, 51 (02) :271-279
[9]   Clothing segmentation using foreground and background estimation based on the constrained Delaunay triangulation [J].
Hu, Zhilan ;
Yan, Hong ;
Lin, Xinggang .
PATTERN RECOGNITION, 2008, 41 (05) :1581-1592
[10]  
Joshi N., 2007, 11 INT C COMPUTER VI, P1, DOI DOI 10.1109/ICCV.2007.4409032