Maximum Entropy Regularization and Chinese Text Recognition

9 Jul 2020 Changxu Cheng Wuheng Xu Xiang Bai Bin Feng Wenyu Liu

Chinese text recognition is more challenging than Latin text due to the large amount of fine-grained Chinese characters and the great imbalance over classes, which causes a serious overfitting problem. We propose to apply Maximum Entropy Regularization to regularize the training process, which is to simply add a negative entropy term to the canonical cross-entropy loss without any additional parameters and modification of a model... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper


METHOD TYPE
LINE
Graph Embeddings
Entropy Regularization
Regularization