arrow
Return

Sparse representation over learned dictionary for symbol recognition

delete2016-08-01
delete13
PRE
AI
T
Thanh Ha
S
Salvatore Tabbone
O
Oriol Ramos Terrades *
DOI:10.1016/j.sigpro.2015.12.020delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper we propose an original sparse vector model for symbol retrieval task. More specifically, we apply the K-SVD algorithm for learning a visual dictionary based on symbol descriptors locally computed around interest points. Results on benchmark datasets show that the obtained sparse representation is competitive related to state-of-the-art methods. Moreover, our sparse representation is invariant to rotation and scale transforms and also robust to degraded images and distorted symbols. Thereby, the learned visual dictionary is able to represent instances of unseen classes of symbols. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
Symbol recognition
Sparse representation
Learned dictionary
Shape context
Interest points
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Signal Processing cover
Signal Processing
IF:
3.6
Papers:
9.9K
Citations:
1.7W

Organization

C
centre national de la recherche scientifique (cnrs)
Scholars:
24.5W
Papers: 18.2W
Citations: 279
V
vietnam national university hanoi (vnu hanoi) system
Scholars:
4.0K
Papers: 2.5K
Citations: 2
V
vnu university of science (vnu-hus)
Scholars:
643
Papers: 470
Citations: 1
researcher View more organizations