Fast M-fold matching pursuit algorithm for image approximation

(整期优先)网络出版时间:2009-04-14
/ 1
Asimpleandeffectivegreedyalgorithmforimageapproximationisproposed.Basedonthematchingpursuitapproach,itischaracterizedbyareducedcomputationalcomplexitybenefitingfromtwomajormodifications.First,ititerativelyfindsanapproximationbyselectingMatomsinsteadofoneatatime.Second,theinnerproductcomputationsareconfinedwithinonlyafractionofdictionaryatomsateachiteration.Themodificationsareimplementedveryefficientlyduetothespatialincoherenceofthedictionary.Experimentalresultsshowthatcomparedwithfullsearchmatchingpursuit,theproposedalgorithmachievesaspeed-upgainof14.4~36.7timeswhilemaintainingtheapproximationquality.