Fast M-fold matching pursuit algorithm for image approximation

在线阅读 下载PDF 导出详情
摘要 Asimpleandeffectivegreedyalgorithmforimageapproximationisproposed.Basedonthematchingpursuitapproach,itischaracterizedbyareducedcomputationalcomplexitybenefitingfromtwomajormodifications.First,ititerativelyfindsanapproximationbyselectingMatomsinsteadofoneatatime.Second,theinnerproductcomputationsareconfinedwithinonlyafractionofdictionaryatomsateachiteration.Themodificationsareimplementedveryefficientlyduetothespatialincoherenceofthedictionary.Experimentalresultsshowthatcomparedwithfullsearchmatchingpursuit,theproposedalgorithmachievesaspeed-upgainof14.4~36.7timeswhilemaintainingtheapproximationquality.
机构地区 不详
出版日期 2009年04月14日(中国期刊网平台首次上网日期,不代表论文的发表时间)
  • 相关文献