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好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
4.50
自引率
0.00%
发文量
0
期刊最新文献
Contents Predicting Institute Graduation Rate using Evolutionary Computing and Machine Learning An Efficient DDoS Attack Detection in SDN using Multi-Feature Selection and Ensemble Learning Evaluating Energy Consumption for Routing Selection using the Multi-Routing Clustering Protocol using Timeslot Transmission in Dynamic Path Selection in Wireless Sensor Networks Genome Motif Discovery in Zika Virus: Computational Techniques and Validation Using Greedy Method
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1