Determining the blur factor of handwritten characters using a convolutional neural network

Dina Tuliabaeva , Dmitrii Tumakov , Leonid Elshin
{"title":"Determining the blur factor of handwritten characters using a convolutional neural network","authors":"Dina Tuliabaeva ,&nbsp;Dmitrii Tumakov ,&nbsp;Leonid Elshin","doi":"10.1016/j.procs.2024.12.030","DOIUrl":null,"url":null,"abstract":"<div><div>The images of handwritten digits and Latin letters from the MNIST and EMNIST datasets are considered. Each image, which has a size of 28x28 pixels, is convolved with a 3x3 matrix. The convolution matrices are symmetric with respect to the central element and are normalized so that all elements are non-negative and their sum is equal to one. Each convolution matrix is ​​characterized by a central element whose value varies from zero to one, indicating the blur factor. The blur matrices are formed randomly according to the uniform distribution of a random variable. Thus, all images of the training and test sets of both datasets have different blur factors. In the next step, a LeNet-5 neural convolutional network is trained to find the blur factor of an image. In cases where the training and test sets are from the same dataset, the accuracy of determining the blur factor is 99.92% for MNIST and 97.95% for EMNIST. The accuracy deteriorates to 90.2% and 85.9% when the training and test sets are from different datasets. The accuracy of predicting the blur factor depending on blur amount is analyzed. It is concluded that the minimum and maximum blur factor values are determined best.</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"252 ","pages":"Pages 279-288"},"PeriodicalIF":0.0000,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Procedia Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1877050924034628","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The images of handwritten digits and Latin letters from the MNIST and EMNIST datasets are considered. Each image, which has a size of 28x28 pixels, is convolved with a 3x3 matrix. The convolution matrices are symmetric with respect to the central element and are normalized so that all elements are non-negative and their sum is equal to one. Each convolution matrix is ​​characterized by a central element whose value varies from zero to one, indicating the blur factor. The blur matrices are formed randomly according to the uniform distribution of a random variable. Thus, all images of the training and test sets of both datasets have different blur factors. In the next step, a LeNet-5 neural convolutional network is trained to find the blur factor of an image. In cases where the training and test sets are from the same dataset, the accuracy of determining the blur factor is 99.92% for MNIST and 97.95% for EMNIST. The accuracy deteriorates to 90.2% and 85.9% when the training and test sets are from different datasets. The accuracy of predicting the blur factor depending on blur amount is analyzed. It is concluded that the minimum and maximum blur factor values are determined best.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用卷积神经网络确定手写字符的模糊系数
本文考虑了来自MNIST和EMNIST数据集的手写数字和拉丁字母图像。每个图像的大小为28x28像素,与3x3矩阵进行卷积。卷积矩阵相对于中心元素是对称的,并且是标准化的,所以所有的元素都是非负的,它们的和等于1。每个卷积矩阵都有一个中心元素,其值从0到1不等,表示模糊因子。模糊矩阵是根据随机变量的均匀分布随机形成的。因此,两个数据集的训练集和测试集的所有图像具有不同的模糊因子。下一步,训练LeNet-5神经卷积网络来找到图像的模糊因子。在训练集和测试集来自同一数据集的情况下,确定模糊因子的准确率MNIST为99.92%,EMNIST为97.95%。当训练集和测试集来自不同的数据集时,准确率分别下降到90.2%和85.9%。分析了模糊系数随模糊量变化的预测精度。结果表明,最小和最大模糊系数值的确定效果最好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
4.50
自引率
0.00%
发文量
0
期刊最新文献
Contents Contents Contents Preface Contents
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1