Pub Date : 2018-12-01DOI: 10.6025/jic/2018/9/4/133-143
J. Khan, M. Mahmood
{"title":"Posture Recognition and Imitation using Haar Wavelet Transform and Neural Networks","authors":"J. Khan, M. Mahmood","doi":"10.6025/jic/2018/9/4/133-143","DOIUrl":"https://doi.org/10.6025/jic/2018/9/4/133-143","url":null,"abstract":"","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":"58 1","pages":""},"PeriodicalIF":4.3,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87888022","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.6025/jic/2018/9/4/144-156
Jhimli Adhikari
Pattern with time period is more valuable because it can better describe objective knowledge. Previous studies on periodic patterns from market basket data focus on patterns without considering the items with their purchased quantities. But in real-life transactions, an item could be purchased multiple times in a transaction and different items may have different quantity in the transactions. To solve this problem, we incorporate the concept of transaction frequency (TF) and database frequency (DF) of an item in a time interval. Our algorithm works in two phases. In first phase we mined locally frequent item sets along with the set of intervals and their database frequency range and second phase mines the two types of periodic patterns (cyclic and acyclic) from the list of intervals. Experimental results are provided to validate the study.
{"title":"Mining Periodic Patterns from Non-binary Transactions","authors":"Jhimli Adhikari","doi":"10.6025/jic/2018/9/4/144-156","DOIUrl":"https://doi.org/10.6025/jic/2018/9/4/144-156","url":null,"abstract":"Pattern with time period is more valuable because it can better describe objective knowledge. Previous studies on periodic patterns from market basket data focus on patterns without considering the items with their purchased quantities. But in real-life transactions, an item could be purchased multiple times in a transaction and different items may have different quantity in the transactions. To solve this problem, we incorporate the concept of transaction frequency (TF) and database frequency (DF) of an item in a time interval. Our algorithm works in two phases. In first phase we mined locally frequent item sets along with the set of intervals and their database frequency range and second phase mines the two types of periodic patterns (cyclic and acyclic) from the list of intervals. Experimental results are provided to validate the study.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":"1 1","pages":""},"PeriodicalIF":4.3,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87878826","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-10-01DOI: 10.6025/jic/2019/10/1/15-33
Youssef Tounsi, L. Hassouni, H. Anoun
One of the most important aspects of financial risk is credit risk management. Effective credit rating models are crucial for the credit institution in assessing credit applications, they have been widely studied in the field of statistics and machine learning. Given that small improvements in credit rating systems can generate significant profits, any improvement is of high interest to banks and financial institutions. The ensemble methods are a set of algorithms whose individual decisions are combined to perform classification tasks. In this work, we propose an enhanced experimental comparative study of five ensemble methods associated with seven base classifiers using six public credit scoring datasets. Four popular evaluation metrics, including area under the curve (AUC), accuracy, false positive rate (FPR) and Time taken to build the model, are employed to measure the performance of models. The experimental results and statistical tests show that Pegasos model has a better overall performance than the other methods analyzed her for Boosting and Credal Decision Tree (CDT) model has a better overall performance than the other algorithms in the case of Bagging, Random Subspace, DECORATE and Rotation Forest.
金融风险最重要的一个方面是信用风险管理。有效的信用评级模型是信用机构评估信用申请的关键，在统计学和机器学习领域得到了广泛的研究。鉴于信用评级体系的微小改进可以产生可观的利润，任何改进都是银行和金融机构的高度兴趣所在。集成方法是一组算法，其单个决策被组合起来执行分类任务。在这项工作中，我们提出了一个增强的实验比较研究，使用六个公共信用评分数据集，与七个基本分类器相关的五种集成方法。采用四种常用的评价指标，包括曲线下面积(AUC)、准确率、假阳性率(FPR)和构建模型所需的时间，来衡量模型的性能。实验结果和统计测试表明，Pegasos模型在Boosting情况下具有较好的综合性能，而Credal Decision Tree (CDT)模型在Bagging、Random Subspace、装饰和Rotation Forest情况下具有较好的综合性能。
{"title":"An Enhanced Comparative Assessment of Ensemble Learning for Credit Scoring","authors":"Youssef Tounsi, L. Hassouni, H. Anoun","doi":"10.6025/jic/2019/10/1/15-33","DOIUrl":"https://doi.org/10.6025/jic/2019/10/1/15-33","url":null,"abstract":"One of the most important aspects of financial risk is credit risk management. Effective credit rating models are crucial for the credit institution in assessing credit applications, they have been widely studied in the field of statistics and machine learning. Given that small improvements in credit rating systems can generate significant profits, any improvement is of high interest to banks and financial institutions. The ensemble methods are a set of algorithms whose individual decisions are combined to perform classification tasks. In this work, we propose an enhanced experimental comparative study of five ensemble methods associated with seven base classifiers using six public credit scoring datasets. Four popular evaluation metrics, including area under the curve (AUC), accuracy, false positive rate (FPR) and Time taken to build the model, are employed to measure the performance of models. The experimental results and statistical tests show that Pegasos model has a better overall performance than the other methods analyzed her for Boosting and Credal Decision Tree (CDT) model has a better overall performance than the other algorithms in the case of Bagging, Random Subspace, DECORATE and Rotation Forest.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":"2013 1","pages":""},"PeriodicalIF":4.3,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87740259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In spite of the fact that modeling and verification of the Multi-Agent Systems (MASs) have been since long under study, there are several related challenges that should still be addressed. In effect, several frameworks have been established for modeling and verifying the MASs with regard to communicative commitments. A bulky volume of research has been conducted for defining semantics of these systems. Though, formal verification of these systems is still unresolved research problem. Within this context, this paper presents the CTL com that reforms the CTLC, i.e., the temporal logic of the commitments, so as to enable reasoning about the commitments and fulfillment. Moreover, the paper introduces a fully-automated method for verification of the logic by means of trimming down the problem of a model that checks the CTLcom to a problem of a model that checks the GCTL*, which is a generalized version of the CTL* with action formulae. By so doing, we take advantage of the CWB-NC automata-based model checker as a tool for verification. Lastly, this paper presents a case study drawn from the business field, that is, the NetBill protocol, illustrates its implementation, and discusses the associated experimental results in order to illustrate the efficiency and effectiveness of the suggested technique. Keywords: Multi-Agent Systems, Model Checking, Communicative commitment's, Reduction.
{"title":"Automatic Verification of Communicative Commitments using Reduction","authors":"Mofleh Al-Diabat, Faisal Al-Saqqar, Ashraf Al-Saggar","doi":"10.6025/JIC/2018/9/3/114-128","DOIUrl":"https://doi.org/10.6025/JIC/2018/9/3/114-128","url":null,"abstract":"In spite of the fact that modeling and verification of the Multi-Agent Systems (MASs) have been since long under study, there are several related challenges that should still be addressed. In effect, several frameworks have been established for modeling and verifying the MASs with regard to communicative commitments. A bulky volume of research has been conducted for defining semantics of these systems. Though, formal verification of these systems is still unresolved research problem. Within this context, this paper presents the CTL com that reforms the CTLC, i.e., the temporal logic of the commitments, so as to enable reasoning about the commitments and fulfillment. Moreover, the paper introduces a fully-automated method for verification of the logic by means of trimming down the problem of a model that checks the CTLcom to a problem of a model that checks the GCTL*, which is a generalized version of the CTL* with action formulae. By so doing, we take advantage of the CWB-NC automata-based model checker as a tool for verification. Lastly, this paper presents a case study drawn from the business field, that is, the NetBill protocol, illustrates its implementation, and discusses the associated experimental results in order to illustrate the efficiency and effectiveness of the suggested technique. Keywords: Multi-Agent Systems, Model Checking, Communicative commitment's, Reduction.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":"13 1","pages":""},"PeriodicalIF":4.3,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90507972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.6025/JIC/2018/9/3/93-101
Jianli Ding, Li Fu
{"title":"A Hybrid Feature Selection Algorithm Based on Information Gain and Sequential Forward Floating Search","authors":"Jianli Ding, Li Fu","doi":"10.6025/JIC/2018/9/3/93-101","DOIUrl":"https://doi.org/10.6025/JIC/2018/9/3/93-101","url":null,"abstract":"","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":"50 1","pages":""},"PeriodicalIF":4.3,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78266599","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.6025/jic/2018/9/3/102-113
Xian-Ping Jiang
In this paper, we investigate the interval intuitionistic trapezoidal fuzzy multiple attribute decision making (MADM) problems in which the attributes are in different priority level. Motivated by the ideal of prioritized aggregation operators bu R.R. Yager, we developed some prioritized aggregation operators for aggregating interval intuitionistic trapezoidal fuzzy information, and then apply them to develop some models for interval intuitionistic trapezoidal fuzzy multiple attribute decision making (MADM) problems in which the attributes are in different priority level. Finally, a practical example about talent introduction is given to verify the developed approaches and to demonstrate its practicality and effectiveness.
{"title":"Interval Intuitionistic Trapezoidal Fuzzy Prioritized Aggregating Operators and their Application to Multiple Attribute Decision Making","authors":"Xian-Ping Jiang","doi":"10.6025/jic/2018/9/3/102-113","DOIUrl":"https://doi.org/10.6025/jic/2018/9/3/102-113","url":null,"abstract":"In this paper, we investigate the interval intuitionistic trapezoidal fuzzy multiple attribute decision making (MADM) problems in which the attributes are in different priority level. Motivated by the ideal of prioritized aggregation operators bu R.R. Yager, we developed some prioritized aggregation operators for aggregating interval intuitionistic trapezoidal fuzzy information, and then apply them to develop some models for interval intuitionistic trapezoidal fuzzy multiple attribute decision making (MADM) problems in which the attributes are in different priority level. Finally, a practical example about talent introduction is given to verify the developed approaches and to demonstrate its practicality and effectiveness.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":"22 1","pages":""},"PeriodicalIF":4.3,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91123825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-30DOI: 10.22266/IJIES2017.0630.41
K. Umapathy, Neelu Khare
Preservation of privacy is a significant aspect of data mining and as the secrecy of sensitive information must be maintained while sharing the data among different untrusted parties. There are many application is suffering from vulnerable, data leakage, data misuse, and sensitive data disclosure issues. To protect the privacy of sensitive data without losing the usability of data, various techniques have been used in privacy-preserving data mining (PPDM). Some of the approaches are available to maintain the tight privacy, but they fail to minimize the execution time and error rate. The main objective of the article is to contribute and retrieve the data with minimal classification error and execution time with enhanced privacy. To overcome the issues, the paper introduces the Secure Data Contribution Retrieval algorithm (SDCRA) to fulfill the current issues. Proposed algorithms define a privacy policy and arrange the security based on requirements. This design applies the privacy based on the compatibility of applications. This approach is capable of satisfying the accuracy constraints for multiple datasets. It also considers the efficient data extraction with a good ranking of attributes in tables. Here, proposed SDCRA is compared with existing approaches namely as Perturbation, singular value decomposition (SVD), Singular Value Decomposition data Perturbation (SVD+DP), K-anonymity with Decision Tree (KA+DT)[] for Cancer, HIV, Diabetes dataset. Based on experimental result proposed approach performs well regarding success rate, error rate and system execution time compare than existing methods. Proposed approach improves Success Rate 1.83% reduces the Error Rate 2.33% and minimizes the system execution time 2 seconds.
{"title":"A Credential Data Privacy Preserving in web Environment using Secure Data Contribution Retrieval Algorithm","authors":"K. Umapathy, Neelu Khare","doi":"10.22266/IJIES2017.0630.41","DOIUrl":"https://doi.org/10.22266/IJIES2017.0630.41","url":null,"abstract":"Preservation of privacy is a significant aspect of data mining and as the secrecy of sensitive information must be maintained while sharing the data among different untrusted parties. There are many application is suffering from vulnerable, data leakage, data misuse, and sensitive data disclosure issues. To protect the privacy of sensitive data without losing the usability of data, various techniques have been used in privacy-preserving data mining (PPDM). Some of the approaches are available to maintain the tight privacy, but they fail to minimize the execution time and error rate. The main objective of the article is to contribute and retrieve the data with minimal classification error and execution time with enhanced privacy. To overcome the issues, the paper introduces the Secure Data Contribution Retrieval algorithm (SDCRA) to fulfill the current issues. Proposed algorithms define a privacy policy and arrange the security based on requirements. This design applies the privacy based on the compatibility of applications. This approach is capable of satisfying the accuracy constraints for multiple datasets. It also considers the efficient data extraction with a good ranking of attributes in tables. Here, proposed SDCRA is compared with existing approaches namely as Perturbation, singular value decomposition (SVD), Singular Value Decomposition data Perturbation (SVD+DP), K-anonymity with Decision Tree (KA+DT)[] for Cancer, HIV, Diabetes dataset. Based on experimental result proposed approach performs well regarding success rate, error rate and system execution time compare than existing methods. Proposed approach improves Success Rate 1.83% reduces the Error Rate 2.33% and minimizes the system execution time 2 seconds.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":"8 1","pages":""},"PeriodicalIF":4.3,"publicationDate":"2017-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85625296","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-11-09DOI: 10.1108/IJICC-05-2015-0016
X. Liu, Xiaohuan Ren, Y. Sheng
Purpose – The purpose of this paper is to design a disturbance observer-based finite-time global sliding mode control scheme for the attitude tracking control problem of the reentry vehicle with parameter uncertainties and disturbances. Design/methodology/approach – Feedback linearization is first introduced to transform vehicle model into three independent second order uncertain subsystems. Then a finite-time controller (FTC) is proposed for the nominal system on the basis of the homogeneity theory. Thereafter the integral sliding mode method is introduced for the vehicle with disturbances. The finite time convergence is achieved and global robustness is also assured by the combination of finite time control method and integral sliding mode strategy. Furthermore, to improve the attitude angle tracking accuracy a novel finite time disturbance observer (DO) is constructed. Findings – Simulation is made for the reentry vehicle with disturbances involved. And the results show the finite-time convergence, tra...
{"title":"Observer-based finite-time sliding mode control for reentry vehicle","authors":"X. Liu, Xiaohuan Ren, Y. Sheng","doi":"10.1108/IJICC-05-2015-0016","DOIUrl":"https://doi.org/10.1108/IJICC-05-2015-0016","url":null,"abstract":"Purpose – The purpose of this paper is to design a disturbance observer-based finite-time global sliding mode control scheme for the attitude tracking control problem of the reentry vehicle with parameter uncertainties and disturbances. Design/methodology/approach – Feedback linearization is first introduced to transform vehicle model into three independent second order uncertain subsystems. Then a finite-time controller (FTC) is proposed for the nominal system on the basis of the homogeneity theory. Thereafter the integral sliding mode method is introduced for the vehicle with disturbances. The finite time convergence is achieved and global robustness is also assured by the combination of finite time control method and integral sliding mode strategy. Furthermore, to improve the attitude angle tracking accuracy a novel finite time disturbance observer (DO) is constructed. Findings – Simulation is made for the reentry vehicle with disturbances involved. And the results show the finite-time convergence, tra...","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":"8 1","pages":"345-362"},"PeriodicalIF":4.3,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1108/IJICC-05-2015-0016","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"62692657","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-01DOI: 10.1108/17563781211231552
Yin Li-li, Zhang Rubo, Gu Hengwen
Purpose – The purpose of this paper is to provide a more capable and holistic adjustable autonomy system, involving situation reasoning among all involved information sources, to make an adjustable autonomy system which knows what the situation is currently, what needs to be done in the present situation, and how risky the task is in the present situation. This will enhance efficiency for calculating the level of autonomy.Design/methodology/approach – Situation reasoning methodologies are present in many autonomous systems which are called situation awareness. Situation awareness in autonomous systems is divided into three levels, situation perception, situation comprehension and situation projection. Situation awareness in these systems aims to make the tactical plans cognitive, but situation reasoning in adjustable autonomous systems aim to communicate mission assessments to unmanned vehicle or humans. Thus, in solving this problem, it is important to design a new situation reasoning module for the adju...
{"title":"Situation reasoning for an adjustable autonomy system","authors":"Yin Li-li, Zhang Rubo, Gu Hengwen","doi":"10.1108/17563781211231552","DOIUrl":"https://doi.org/10.1108/17563781211231552","url":null,"abstract":"Purpose – The purpose of this paper is to provide a more capable and holistic adjustable autonomy system, involving situation reasoning among all involved information sources, to make an adjustable autonomy system which knows what the situation is currently, what needs to be done in the present situation, and how risky the task is in the present situation. This will enhance efficiency for calculating the level of autonomy.Design/methodology/approach – Situation reasoning methodologies are present in many autonomous systems which are called situation awareness. Situation awareness in autonomous systems is divided into three levels, situation perception, situation comprehension and situation projection. Situation awareness in these systems aims to make the tactical plans cognitive, but situation reasoning in adjustable autonomous systems aim to communicate mission assessments to unmanned vehicle or humans. Thus, in solving this problem, it is important to design a new situation reasoning module for the adju...","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":"5 1","pages":"226-238"},"PeriodicalIF":4.3,"publicationDate":"2012-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1108/17563781211231552","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"62171662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-01-01DOI: 10.1108/17563780910939282
Nikolaos Ntogas, D. Ventzas
Purpose – The purpose of this paper is to introduce an innovative procedure for digital historical documents image binarization based on image pre-processing and image condition classification. The estimated results for each class of images and each method have shown improved image quality for the six categories of document images described by their separate characteristics. Design/methodology/approach – The applied technique consists of five stages, i.e. text image acquisition, image preparation, denoising, image type classification in six categories according to image condition, image thresholding and final refinement, a very effective approach to binarize document images. The results achieved by the authors’ method require minimal pre-processing steps for best quality of the image and increased text readability. This methodology performs better compared to current state-of-the-art adaptive thresholding techniques. Findings – An innovative procedure for digital historical documents image binarization based on image pre-processing, image type classification in categories according to image condition and further enhancement. This methodology is robust and simple, with minimal pre-processing steps for best quality of the image, increased text readability and it performs better compared to available thresholding techniques. Research limitations/implications – The technique consists of limited but optimized pre-processing sequential steps, and attention should be given in document image preparation and denoising, and on image condition classification for thresholding and refinement, since bad results in a single stage corrupt the final document image quality and text readability. Originality/value – The paper contributes in digital image binarization of text images suggesting a procedure based on image preparation, image type classification and thresholding and image refinement with applicability on Byzantine historical documents.
{"title":"Binarization of pre-filtered historical manuscripts images","authors":"Nikolaos Ntogas, D. Ventzas","doi":"10.1108/17563780910939282","DOIUrl":"https://doi.org/10.1108/17563780910939282","url":null,"abstract":"Purpose – The purpose of this paper is to introduce an innovative procedure for digital historical documents image binarization based on image pre-processing and image condition classification. The estimated results for each class of images and each method have shown improved image quality for the six categories of document images described by their separate characteristics. Design/methodology/approach – The applied technique consists of five stages, i.e. text image acquisition, image preparation, denoising, image type classification in six categories according to image condition, image thresholding and final refinement, a very effective approach to binarize document images. The results achieved by the authors’ method require minimal pre-processing steps for best quality of the image and increased text readability. This methodology performs better compared to current state-of-the-art adaptive thresholding techniques. Findings – An innovative procedure for digital historical documents image binarization based on image pre-processing, image type classification in categories according to image condition and further enhancement. This methodology is robust and simple, with minimal pre-processing steps for best quality of the image, increased text readability and it performs better compared to available thresholding techniques. Research limitations/implications – The technique consists of limited but optimized pre-processing sequential steps, and attention should be given in document image preparation and denoising, and on image condition classification for thresholding and refinement, since bad results in a single stage corrupt the final document image quality and text readability. Originality/value – The paper contributes in digital image binarization of text images suggesting a procedure based on image preparation, image type classification and thresholding and image refinement with applicability on Byzantine historical documents.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":"2 1","pages":"148-174"},"PeriodicalIF":4.3,"publicationDate":"2009-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1108/17563780910939282","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"62171651","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：