Greedy vs. L1 convex optimization in sparse coding: comparative study in abnormal event detection

Research output: Contribution to journalConference articleResearchpeer-review


Sparse representation has been applied successfully in many image analysis applications, including abnormal event detection, in which a baseline is to learn a dictionary from the training data and detect anomalies from its sparse codes.
During this procedure, sparse codes which can be achieved through finding the L0-norm solution of the problem: min ||Y -D_{alpfa}||–2^2 +||alpha||_0, is crucial. Note that D refers to the dictionary and refers to the sparse codes. This L0-norm solution, however, is known as a NP-hard problem. Despite of the research achievements in some classification fields, such as face and action recognition, a comparative study of codes in abnormal event detection is less studied and hence no conclusion is gained on the effect of codes in detecting abnormalities. We constrict our comparison in two types of the above L0-norm solutions: greedy algorithms and convex L1-norm solutions. Considering
the property of abnormal event detection, i.e., only normal videos are used as training data due to practical reasons, effective codes in classification
application may not perform well in abnormality detection. Therefore, we compare the sparse codes and comprehensively evaluate their performance from various aspects to better understand their applicability, including computation
time, reconstruction error, sparsity, detection
Original languageEnglish
JournalJournal of Machine Learning Research
Number of pages6
Publication statusPublished - 2015
EventInternational Conference on Machine Learning 2015 - Lille, France
Duration: 1 Jun 2015 → …
Conference number: 31


ConferenceInternational Conference on Machine Learning 2015
Period01/06/2015 → …

Number of downloads are based on statistics from Google Scholar and

No data available

ID: 159671790