Title: New fast algorithm to sparsely decompose images
Abstract:Sparse representation of images is very suitable for image processing,but the computational burden in image sparse decomposition process is huge. A new fast algorithm was presented based on Matching P...Sparse representation of images is very suitable for image processing,but the computational burden in image sparse decomposition process is huge. A new fast algorithm was presented based on Matching Pursuit(MP) image sparse decomposition. At first Genetic Algorithms(GA) was applied to effectively search in the dictionary of atoms for the best atom at each step of MP. A faster algorithm was then put forward by using the property of GA. Experiment results show that the performance of the proposed algorithm is very good.Read More
Publication Year: 2004
Publication Date: 2004-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot