检索结果-内蒙古大学图书馆

Optical Character Recognition using YOLO4, Tesseract and Paddleocr for Text Extraction 3

Optical Character Recognition using YOLO4, Tesseract and Pad...

3rd International Conference on Intelligent and Innovative Technologies in Computing, Electrical and Electronics, IITCEE 2025

作者： Kusuma, T. Jyothi, S. Shruthi, G. Sheela, S. Naveen Kumar, C. Ramaiah Institute of Technology Department of Artificial Intelligence & Data Science Bangalore India Global Academy of Technology Department of Computer Science & Engg Bangalore India Ramaiah Institute of Technology Department of Information Science Bangalore India

ISBN: (数字)9798331515911

ISBN: (纸本)9798331515911

The recent advancement Tesseract OCR engine and the YOLO4 (You Only Look Once version 4) object detection framework provide an innovative approach to optical character recognition (OCR) with a focus on table extraction. Because of their complicated layouts, traditional OCR algorithms frequently have difficulty accurately retrieving tabular data from photos. The suggested technique successfully extracts tables from photos by utilizing Tesseract for precise character recognition and YOLO4 for reliable object detection. Table borders, cell boundaries, and text sections inside tables are all recognized by the YOLO4 model after it has been trained. The textual information inside these areas is then identified using Tesseract. The suggested solution outperforms conventional OCR techniques in experimental results that show how well it extracts tables from photos with different layouts and levels of complexity. © 2025 IEEE.

关键词： data Analytics

来源：评论

学校读者我要写书评

暂无评论

Innovative Video Classification Method based on Deep Learning Approach

引用

Recent Patents on Engineering 2025年第2期19卷 95-107页

作者： Hemamalini, V. Jayasutha, D. Vinothini, V.R. Devi, R. Manjula Kumar, A. Anitha, E. Department of Networking and Communications School of Computing SRM Institute of Science and Technology Chennai India Department of Computer Science and Engineering Arjun College of Technology Coimbatore Thamaraikulam India Department of Mathematics Bannari Amman Institute of Technology Sathyamangalam Erode638401 India Department of Computer Science and Design Kongu Engineering College Perundurai Erode638060 India Department of Civil Engineering University Institute of Engineering & Technology Maharshi Dayanand University Rohtak124001 India Department of Artificial Intelligence and Data Science Sri Eshwar College of Engineering Coimbatore641202 India

Background: The automated classification of videos through artificial neural networks is addressed in this work. To explore the concepts and measure the results, the data set UCF101 is used, consisting of video clips taken from YouTube to recognize actions. The study is carried out with the authors' resources to determine the feasibility of independent research in the area. Methods: This work was developed in the Python programming language using the Keras library with Tensorflow as the back-end. The objective is to develop a network that presents performance compatible with the state of the art in terms of classifying videos according to the actions taken. Results: Given the hardware limitations, there is considerable distance between the implementation possibilities in this work and what is known as the state-of-the-art. Conclusion: Throughout the work, some aspects in which this limitation influenced the development are presented, but it is shown that this realization is feasible and that obtaining expressive results is possible 98.6% accuracy is obtained in the UCF101 data set, compared to the 98 percentage points of the best result ever reported, using, however, considerably fewer resources. In addition, the importance of transfer learning in achieving expressive results as well as the different performances of each architecture are reviewed. Thus, this work may open doors to carry patent-based outcomes. © 2025 Bentham science Publishers.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Relational Approach Toward Stock Price Prediction and Profitability

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第11期5卷 5844-5854页

作者： Patel, Manali Jariwala, Krupa Chattopadhyay, Chiranjoy Sardar Vallabhbhai National Institute of Technology Department of Computer Science and Engineering Surat395007 India FLAME University School of Computing and Data Sciences Pune412115 India

An accurate estimation of future stock prices can help investors maximize their profits. The current advancements in the area of artificial intelligence (AI) have proven prevalent in the financial sector. Besides, stock market prediction is difficult owing to the considerable volatility and unpredictability induced by numerous factors. Recent approaches have considered fundamental, technical, or macroeconomic variables to find hidden complex patterns in financial data. At the macro level, there exists a spillover effect between stock pairs that can explain the variance present in the data and boost the prediction performance. To address this interconnectedness defined by intrasector stocks, we propose a hybrid relational approach to predict the future price of stocks in the American, Indian, and Korean economies. We collected market data of large-, mid-, and small-capitalization peer companies in the same industry as the target firm, considering them as relational features. To ensure efficient feature selection, we have utilized a data-driven approach, i.e., random forest feature permutation (RF2P), to remove noise and instability. A hybrid prediction module consisting of temporal convolution and linear model (TCLM) is proposed that considers irregularities and linear trend components of the financial data. We found that RF2P-TCLM gave the superior performance. To demonstrate the real-world applicability of our approach in terms of profitability, we created a trading method based on the predicted results. This technique generates a higher profit than the existing approaches. © 2024 IEEE.

关键词： Profitability

来源：评论

学校读者我要写书评

暂无评论

Guest Editorial: Special Issue on Evolutionary Computation for Games

引用

IEEE Transactions on Games 2023年第1期15卷 1-4页

作者： Schrum, Jacob Liu, Jialin Browne, Cameron Ekart, Aniko Gallagher, Marcus Southwestern University Department of Mathematics and Computer Science GeorgetownTX United States Southern University of Science and Technology Department of Computer Science and Engineering Shenzhen China Maastricht University Department of Data Science and Knowledge Engineering Maastricht Netherlands Aston University Department of Computer Science United Kingdom The University of Queensland School of Information Technology and Electrical Engineering Australia

The eight papers in this special section focus on applications of evolutionary computation to games to demonstrate several ways in which evolution can push boundaries and explore new areas of what is possible in the realm of games research, with a focus on game-playing, automatic agent parameter tuning, automatic game testing, and procedural content generation.

关键词： Special issues and sections Evolutionary computation Games

来源：评论

学校读者我要写书评

暂无评论

Multi-Stage Predict+Optimize for (Mixed Integer) Linear Programs 38

Multi-Stage Predict+Optimize for (Mixed Integer) Linear Prog...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Hu, Xinyi Lee, Jasper C.H. Lee, Jimmy H.M. Stuckey, Peter J. Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin N.T. Hong Kong Department of Computer Science University of California Davis United States Department of Data Science and AI Monash University Clayton Australia

The recently-proposed framework of Predict+Optimize tackles optimization problems with parameters that are unknown at solving time, in a supervised learning setting. Prior frameworks consider only the scenario where all unknown parameters are (eventually) revealed at the same time. In this work, we propose Multi-Stage Predict+Optimize, a novel extension catering to applications where unknown parameters are instead revealed in sequential stages, with optimization decisions made in between. We further develop three training algorithms for neural networks (NNs) for our framework as proof of concept, all of which can handle mixed integer linear programs. The first baseline algorithm is a natural extension of prior work, training a single NN which makes a single prediction of unknown parameters. The second and third algorithms instead leverage the possibility of updating parameter predictions between stages, and trains one NN per stage. To handle the interdependency between the NNs, we adopt a sequential and parallelized versions of coordinate descent for training. Experimentation on three benchmarks demonstrates the superior learning performance of our methods over classical approaches. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Enhance Efficient of Support Vector Machine with CNN and PSO for solving Handwritten Digits Recognition 28

Enhance Efficient of Support Vector Machine with CNN and PSO...

引用

28th International computer science and Engineering Conference, ICSEC 2024

作者： Janprasit, Siwach Punkong, Narong Ratanavilisagul, Chiabwoot Kosolsombat, Somkiat Faculty of Applied Science Department of Computer and Information Science Bangkok Thailand Digital Technology for Business Faculty of Management Science Kanchanaburi Thailand Faculty of Applied Science Department of Computer and Information Sciences Bangkok Thailand Thammasat University Data Science and Innovation College of Interdisciplinary Studies Thailand

ISBN: (纸本)9798350366860

handwritten digit recognition is a crucial task in various fields such as postal mail sorting, bank check processing, and digitizing handwritten documents. This research aims to compare the effectiveness of using Convolutional Neural Network (CNN) for feature extraction combined with Support Vector Machine (SVM) for classification, against the traditional method of using Discrete Wavelet Transform (DWT) and Discrete Cosine Transform (DCT) for feature extraction. Additionally, Particle Swarm Optimization (PSO) is applied to optimize SVM parameters to further enhance model performance. The experiments are conducted on two datasets: The MNIST dataset and an individual handwriting dataset from 50 participants. The results indicate that the proposed method of using CNN for feature extraction and PSO-optimized SVM achieves superior accuracy compared to traditional DWT and DCT methods. Specifically, the proposed method achieved an accuracy of 99.05% on the MNIST dataset and 67.79% on the individual handwriting dataset, demonstrating its robustness and effectiveness in handwritten digit recognition. © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Time and performance comparison on suicide detection using various feature engineering and machine learning models 15

Time and performance comparison on suicide detection using v...

引用

15th International Conference on Knowledge and Smart Technology, KST 2023

作者： Thongsi, Kittisak Booncherd, Nannaphas Songmuang, Pokpong Thammasat Univesity Department of Data Science and Technology Pathumthani Thailand Thammasat Univesity Department of Computer Science Pathumthani Thailand

ISBN: (纸本)9781665477123

Today more people use social media to express their opinion and their emotions. There are many types of text in social media including text that convey a tendency to be depressed or suicidal. We use sentiment analysis to detect suicidal texts, because if detected, it could save many lives and many families. In this research, we have an objective to explore a method that is both high performance and less time-using. We design experiments that have 30 combinations between five machine learning models with six feature engineering methods. All experiments use accuracy and total time for model generation as metrics. We use deep neural networks with glove embedding as a comparator because this combination performed well in this dataset on Kaggle competition. From the experimental results, we find that the suitable combination that generates fast and has good accuracy is Random Forest with TF-IDF with 0.897 and 145 seconds. © 2023 IEEE.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Statistical assessment of Indian classical music’s role in diabetes, thyroid, hypertension management

引用

International Journal of Information Technology (Singapore) 2025年第1期17卷 423-429页

作者： Pingle, Yogesh Prabhakar Ragha, Lakshmappa K. Research Scholar at Department of Computer Engineering Terna Engineering College Assistant Professor at Department of Computer Science and Engineering (Data Science) Vidyavardhinis College of Engineering and Technology University of Mumbai Maharashtra Mumbai India Department of Computer Engineering Terna Engineering College University of Mumbai Maharashtra Mumbai India

This multi-center randomized controlled trial explores the therapeutic benefits of Indian classical music, specifically “Raga Therapy,” for managing diabetes, thyroid disorders, and hypertension—prevalent global health issues. The study examines how specific Ragas can enhance traditional treatments: Bhimpalas and Chhanayat for hypertension, Malkauns and Bhupal Todi for diabetes, and Shyam Kalyan and Yaman for thyroid disorders. Results show significant health improvements in patients integrating Raga Therapy into their care, highlighting its holistic benefits. The study underscores the profound connection between music and healing, positioning Indian classical music as a valuable complementary therapy. By addressing a critical gap in the literature, it advocates for further research to understand the mechanisms involved and refine Raga selection for optimal therapeutic outcomes. © Bharati Vidyapeeth's Institute of computer Applications and Management 2024.

关键词： Paired t-test Patient satisfaction survey Raga Therapy Wilcoxon signed-rank test

来源：评论

学校读者我要写书评

暂无评论

Structured Sampling for Robust Euclidean Distance Geometry 59

Structured Sampling for Robust Euclidean Distance Geometry

引用

59th Annual Conference on Information sciences and Systems, CISS 2025

作者： Kundu, Chandra Tasissa, Abiy Cai, HanQin University of Central Florida Department of Statistics and Data Science OrlandoFL32816 United States Tufts University Department of Mathematics MedfordMA02155 United States University of Central Florida Department of Statistics and Data Science Department of Computer Science OrlandoFL32816 United States

ISBN: (纸本)9798331513269

This paper addresses the problem of estimating the positions of points from distance measurements corrupted by sparse outliers. Specifically, we consider a setting with two types of nodes: anchor nodes, for which exact distances to each other are known, and target nodes, for which complete but corrupted distance measurements to the anchors are available. To tackle this problem, we propose a novel algorithm powered by Nystro m method and robust principal component analysis. Our method is computationally efficient as it processes only a localized subset of the distance matrix and does not require distance measurements between target nodes. Empirical evaluations on synthetic datasets, designed to mimic sensor localization, and on molecular experiments, demonstrate that our algorithm achieves accurate recovery with a modest number of anchors, even in the presence of high levels of sparse outliers. © 2025 IEEE.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

Refined Coreset Selection: Towards Minimal Coreset Size under Model Performance Constraints 41

Refined Coreset Selection: Towards Minimal Coreset Size unde...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Xia, Xiaobo Liu, Jiale Zhang, Shaokun Wu, Qingyun Wei, Hongxin Liu, Tongliang School of Computer Science The University of Sydney Australia College of Information Science and Technology Penn State University United States Department of Statistics and Data Science Southern University of Science and Technology China

Coreset selection is powerful in reducing computational costs and accelerating data processing for deep learning algorithms. It strives to identify a small subset from large-scale data, so that training only on the subset practically performs on par with full data. Practitioners regularly desire to identify the smallest possible coreset in realistic scenes while maintaining comparable model performance, to minimize costs and maximize acceleration. Motivated by this desideratum, for the first time, we pose the problem of refined coreset selection, in which the minimal coreset size under model performance constraints is explored. Moreover, to address this problem, we propose an innovative method, which maintains optimization priority order over the model performance and coreset size, and efficiently optimizes them in the coreset selection procedure. Theoretically, we provide the convergence guarantee of the proposed method. Empirically, extensive experiments confirm its superiority compared with previous strategies, often yielding better model performance with smaller coreset sizes. The implementation is available at https://***/xiaoboxia/LBCS. Copyright 2024 by the author(s)

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：