2017 14th IAPR International Conference on Document Analysis and Recognition (ICDAR) 2017
DOI: 10.1109/icdar.2017.89
|View full text |Cite
|
Sign up to set email alerts
|

A Compact CNN-DBLSTM Based Character Model for Offline Handwriting Recognition with Tucker Decomposition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 30 publications
(9 citation statements)
references
References 17 publications
0
9
0
Order By: Relevance
“…A new very deep architecture [13] called VGG network was introduced for offline handwriting recognition [45], [77]. Although it is deeper as shown in Figure 13, yet it is simpler than the previous architecture [70].…”
Section: ) Vgg-16mentioning
confidence: 99%
“…A new very deep architecture [13] called VGG network was introduced for offline handwriting recognition [45], [77]. Although it is deeper as shown in Figure 13, yet it is simpler than the previous architecture [70].…”
Section: ) Vgg-16mentioning
confidence: 99%
“…Significant advances in handwritten text recognition were realised by the description of the multidimensional recurrent neural networks (MD-RNN) in Graves et al [7] and the Connectionist Temporal Classification (CTC) loss. A number of advances based on the MD-RNN were reported including using attribute embeddings [8], dropout [9], Tucker decomposition [10] etc. Recent works conducted by Puigcerver [11] suggest that the multidimensional aspects of the MD-RNN can be replaced with feeding image-features (from a CNN) into a one-dimensional LSTM to significantly reduce the memory requirements of the systems.…”
Section: B Text Recognitionmentioning
confidence: 99%
“…Except for distillation based approaches, many other acceleration and compression algorithms have also been widely investigated such as low-rank decomposition [38], [39], [40], [41], [42],…”
Section: B Acceleration and Compressionmentioning
confidence: 99%
“…A representative work comes from [40], where the authors take the nonlinear units into account in their decomposition algorithm based on the assumption that the filter response lies on a low-rank subspace. The authors in [41], [42] use Tucker decomposition to achieve compression. Such algorithms need to be conducted layer by layer.…”
Section: B Acceleration and Compressionmentioning
confidence: 99%