Using Bounded Diameter Minimum Spanning Trees to Build Dense Active Appearance Models

被引:6
|
作者
Anderson, Robert [1 ]
Stenger, Bjoern [2 ]
Cipolla, Roberto [1 ]
机构
[1] Univ Cambridge, Dept Engn, Cambridge CB2 1PZ, England
[2] Toshiba Res Europe Ltd, Cambridge CB4 0GZ, England
关键词
Active appearance models; Groupwise registration; Minimum spanning trees; IMAGE REGISTRATION;
D O I
10.1007/s11263-013-0661-9
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present a method for producing dense active appearance models (AAMs), suitable for video-realistic synthesis. To this end we estimate a joint alignment of all training images using a set of pairwise registrations and ensure that these pairwise registrations are only calculated between similar images. This is achieved by defining a graph on the image set whose edge weights correspond to registration errors and computing a bounded diameter minimum spanning tree. Dense optical flow is used to compute pairwise registration and a flow refinement method to align small scale texture is introduced. Further, given the registration of training images, vertices are added to the AAM to minimise the error between the observed flow fields and the flow fields interpolated between the AAM mesh points. We demonstrate a significant improvement in model compactness.
引用
收藏
页码:48 / 57
页数:10
相关论文
共 32 条
  • [1] Using Bounded Diameter Minimum Spanning Trees to Build Dense Active Appearance Models
    Robert Anderson
    Björn Stenger
    Roberto Cipolla
    International Journal of Computer Vision, 2014, 110 : 48 - 57
  • [2] Dense Active Appearance Models Using a Bounded Diameter Minimum Spanning Tree
    Anderson, Robert
    Stenger, Bjorn
    Cipolla, Roberto
    PROCEEDINGS OF THE BRITISH MACHINE VISION CONFERENCE 2012, 2012,
  • [3] Degree-bounded minimum spanning trees
    Jothi, Raja
    Raghavachari, Balaji
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (05) : 960 - 970
  • [4] A local search heuristic for bounded-degree minimum spanning trees
    Zahrani, M. S.
    Loomes, M. J.
    Malcolm, J. A.
    Albrecht, A. A.
    ENGINEERING OPTIMIZATION, 2008, 40 (12) : 1115 - 1135
  • [5] 2D image segmentation using minimum spanning trees
    Xu, Y
    Uberbacher, EC
    IMAGE AND VISION COMPUTING, 1997, 15 (01) : 47 - 57
  • [6] An Improved Algorithm for Clustering Gene Expression Data Using Minimum Spanning Trees
    Zhao, Weili
    Zhang, Zhiguo
    APPLIED MECHANICS AND MECHANICAL ENGINEERING, PTS 1-3, 2010, 29-32 : 2656 - +
  • [7] Construction of minimum spanning trees from financial returns using rank correlation
    Millington, Tristan
    Niranjan, Mahesan
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2021, 566
  • [8] Globally Optimal Deformable Registration on a Minimum Spanning Tree Using Dense Displacement Sampling
    Heinrich, Mattias P.
    Jenkinson, Mark
    Brady, Michael
    Schnabel, Julia A.
    MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2012, PT III, 2012, 7512 : 115 - 122
  • [9] ON VISUAL OBJECT TRACKING USING ACTIVE APPEARANCE MODELS
    Hoffmann, M. R.
    Herbst, B. M.
    Hunter, K. M.
    SAIEE AFRICA RESEARCH JOURNAL, 2007, 98 (02): : 52 - 58
  • [10] Visual detection of knives in security applications using Active Appearance Models
    Glowacz, Andrzej
    Kmiec, Marcin
    Dziech, Andrzej
    MULTIMEDIA TOOLS AND APPLICATIONS, 2015, 74 (12) : 4253 - 4267