System and sub-system maintenance is a significant task for every dynamic system. A plethora of approaches, both quantitative and qualitative, have been proposed to ensure the system safety and to minimize the system downtime. The rapid progress of computing technologies and different machine learning approaches makes it possible to integrate complex machine learning techniques with maintenance strategies to predict system maintenance in advance. The present work analyzes different methods of integrating an Artificial Neural Network (ANN) and ANN with Principle Component Analysis (PCA) to model and predict compressor decay state coefficient and turbine decay state coefficient of a Gas Turbine (GT) mounted on a frigate characterized by a Combined Diesel-Electric and Gas (CODLAG) propulsion plant used in naval vessels. The input parameters are GT parameters and the outputs are GT compressor and turbine decay state coefficients. Due to the presence of a large number of inputs, more hidden layers are required, and as a result a deep neural network is found appropriate. The simulation results confirm that most of the proposed models accomplish the prediction of the decay state coefficients of the gas turbine of the naval propulsion. The results show that a consistently declining hidden layers size which is proportional to the input and to the output outperforms the other neural network architectures. In addition, the results of ANN outperforms hybrid PCAANN in most cases. The ANN architecture design might be relevant to other predictive maintenance systems.
{"title":"CONDITION BASED MAINTENANCE OF TURBINE AND COMPRESSOR OF A CODLAG NAVAL PROPULSION SYSTEM USING DEEP NEURAL NETWORK","authors":"Palash Pal, Rituparna Datta, Aviv Segev, Alec Yasinsac","doi":"10.5121/CSIT.2019.90601","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90601","url":null,"abstract":"System and sub-system maintenance is a significant task for every dynamic system. A plethora of approaches, both quantitative and qualitative, have been proposed to ensure the system safety and to minimize the system downtime. The rapid progress of computing technologies and different machine learning approaches makes it possible to integrate complex machine learning techniques with maintenance strategies to predict system maintenance in advance. The present work analyzes different methods of integrating an Artificial Neural Network (ANN) and ANN with Principle Component Analysis (PCA) to model and predict compressor decay state coefficient and turbine decay state coefficient of a Gas Turbine (GT) mounted on a frigate characterized by a Combined Diesel-Electric and Gas (CODLAG) propulsion plant used in naval vessels. The input parameters are GT parameters and the outputs are GT compressor and turbine decay state coefficients. Due to the presence of a large number of inputs, more hidden layers are required, and as a result a deep neural network is found appropriate. The simulation results confirm that most of the proposed models accomplish the prediction of the decay state coefficients of the gas turbine of the naval propulsion. The results show that a consistently declining hidden layers size which is proportional to the input and to the output outperforms the other neural network architectures. In addition, the results of ANN outperforms hybrid PCAANN in most cases. The ANN architecture design might be relevant to other predictive maintenance systems.","PeriodicalId":372948,"journal":{"name":"Computer Science & Information Technology (CS & IT )","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114448063","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}
As technology becomes more advanced and saturated in various industries, the role of design becomes equally significant. Traditionally, human-centered design (HCD) has been the main creative approach for the design decisions in numerous applications. However, the role of HCD within the technology raises concerns. This paper examines the design philosophy of the HCD in parallel with rising technologies, specifically artificial intelligence and machine learning systems, and explores the implications of utilizing a more dynamic approach. With HCD, much of the considerations are determined through user research; the dynamic HCD approach is introduced to accommodate the different units of analysis presented by advanced technologies to create more streamlined designs that support and accelerate technological innovation.
{"title":"Dynamic Human-Centered Design:Reinventing Design Philosophies for Advanced Technologies","authors":"Te-Wei Ho, Timothy Wei, Jing-Ming Wu, F. Lai","doi":"10.5121/CSIT.2019.90505","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90505","url":null,"abstract":"As technology becomes more advanced and saturated in various industries, the role of design becomes equally significant. Traditionally, human-centered design (HCD) has been the main creative approach for the design decisions in numerous applications. However, the role of HCD within the technology raises concerns. This paper examines the design philosophy of the HCD in parallel with rising technologies, specifically artificial intelligence and machine learning systems, and explores the implications of utilizing a more dynamic approach. With HCD, much of the considerations are determined through user research; the dynamic HCD approach is introduced to accommodate the different units of analysis presented by advanced technologies to create more streamlined designs that support and accelerate technological innovation.","PeriodicalId":372948,"journal":{"name":"Computer Science & Information Technology (CS & IT )","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127406726","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}
Guilherme Bonfim De Sousa, Janes V. R.Lima, Patrícia Helena M. Rêgo, Alain G.Souza, J. V. FonsecaNeto
This paper presents the design and investigation of performance of a 3-DOF Quanser helicopter system using a learning optimal control approach that is grounded on approximate dynamic programming paradigms, specifically action-dependent heuristic dynamic programming (ADHDP). This approach results in an algorithm that is embedded in the actor-critic reinforcement learning architecture, that characterizes this design as a model-free structure. The developed methodology aims at implementing an optimal controller that acts in real-time in the plant control, using only the input and output signals and states measured along the system trajectories. The feedback control design technique is capable of an online tuning of the controller parameters according to the plant dynamics, which is subject to the model uncertainties and external disturbances. The experimental results demonstrate the desired performance of the proposed controller implemented on the 3-DOF Quanser helicopter.
{"title":"A Learning Controller Design Approach for A 3-DOF Helicopter System with Online Optimal Control","authors":"Guilherme Bonfim De Sousa, Janes V. R.Lima, Patrícia Helena M. Rêgo, Alain G.Souza, J. V. FonsecaNeto","doi":"10.5121/CSIT.2019.90502","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90502","url":null,"abstract":"This paper presents the design and investigation of performance of a 3-DOF Quanser helicopter system using a learning optimal control approach that is grounded on approximate dynamic programming paradigms, specifically action-dependent heuristic dynamic programming (ADHDP). This approach results in an algorithm that is embedded in the actor-critic reinforcement learning architecture, that characterizes this design as a model-free structure. The developed methodology aims at implementing an optimal controller that acts in real-time in the plant control, using only the input and output signals and states measured along the system trajectories. The feedback control design technique is capable of an online tuning of the controller parameters according to the plant dynamics, which is subject to the model uncertainties and external disturbances. The experimental results demonstrate the desired performance of the proposed controller implemented on the 3-DOF Quanser helicopter.","PeriodicalId":372948,"journal":{"name":"Computer Science & Information Technology (CS & IT )","volume":"6 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123267836","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}
Thomas Hieninger, F. Goppelt, Ronald Schmidt-Vollus
This contribution presents a Nelder-Mead based on-line optimization algorithm for centrifugal pumps to decrease the energy demand for filling tasks during operation. This method works with power and filling level data, which adapts the rotational speed to the current filling level. During optimization, rotational speed constraints have to be regarded to fulfill a steadily filling within a maximum permitted time. To develop and to test the algorithm, a model of a pump system is used, which is implemented in Matlab/Simulink. The tuning method achieves energy savings at the permitted filling time.
{"title":"ON-LINE OPTIMIZATION METHOD FOR ENERGY EFFICIENT PUMP-STORAGE OPERATION WITH INTEGRATED FILLING TIME CONSTRAINT","authors":"Thomas Hieninger, F. Goppelt, Ronald Schmidt-Vollus","doi":"10.5121/CSIT.2019.90506","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90506","url":null,"abstract":"This contribution presents a Nelder-Mead based on-line optimization algorithm for centrifugal pumps to decrease the energy demand for filling tasks during operation. This method works with power and filling level data, which adapts the rotational speed to the current filling level. During optimization, rotational speed constraints have to be regarded to fulfill a steadily filling within a maximum permitted time. To develop and to test the algorithm, a model of a pump system is used, which is implemented in Matlab/Simulink. The tuning method achieves energy savings at the permitted filling time.","PeriodicalId":372948,"journal":{"name":"Computer Science & Information Technology (CS & IT )","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114912392","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}
The method for the detection of Carrier-in-Carrier signals based on the calculation of fourthorder cumulants is proposed. In accordance with the methodology based on the “Area under the curve” (AUC) parameter, a threshold value for the decision rule is established. It was found that the proposed method provides the correct detection of the sum of QPSK signals for a wide range of signal-to-noise ratios. The obtained AUC value indicates the high efficiency of the proposed detection method. The advantage of the proposed detection method over the “radiuses” method is also shown.
{"title":"Method for the Detection of Carrierin-Carrier Signals Based on Fourth-Order Cumulants","authors":"V. Semenov, P. Omelchenko, O. Kruhlyk","doi":"10.5121/CSIT.2019.90503","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90503","url":null,"abstract":"The method for the detection of Carrier-in-Carrier signals based on the calculation of fourthorder cumulants is proposed. In accordance with the methodology based on the “Area under the curve” (AUC) parameter, a threshold value for the decision rule is established. It was found that the proposed method provides the correct detection of the sum of QPSK signals for a wide range of signal-to-noise ratios. The obtained AUC value indicates the high efficiency of the proposed detection method. The advantage of the proposed detection method over the “radiuses” method is also shown.","PeriodicalId":372948,"journal":{"name":"Computer Science & Information Technology (CS & IT )","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115241728","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}
Geetha Madadevaiah, R. Prasad, Amogh Hiremath, M. Dumontier, A. Dekker
In this paper, we use Semantic Web Technologies to store and share the sensitive medical data in a secure manner. The framework builds on the advantages of the Semantic Web technologies and makes it secure and robust for sharing sensitive information in a controlled environment. The framework uses a combination of Role-Based and Rule-Based Access Policies to provide security to a medical data repository. To support the framework, we built a lightweight ontology to collect consent from the users indicating which part of their data they want to share with another user having a particular role. Here, we have considered the scenario of sharing the medical data by the owner of data, say the patient, with relevant people such as physicians, researchers, pharmacist, etc. We developed a prototype,which is validated using Sesame Open RDF Workbench with 202,908 triples and a consent graph stating consents per patient.
本文采用语义Web技术对敏感的医疗数据进行安全的存储和共享。该框架建立在语义Web技术的优势之上，使其在受控环境中共享敏感信息时既安全又健壮。该框架结合使用基于角色和基于规则的访问策略，为医疗数据存储库提供安全性。为了支持该框架，我们构建了一个轻量级本体来收集用户的同意，表明他们希望与具有特定角色的另一个用户共享其数据的哪一部分。在这里，我们考虑了数据所有者(比如患者)与相关人员(如医生、研究人员、药剂师等)共享医疗数据的场景。我们开发了一个原型，该原型使用Sesame Open RDF Workbench进行验证，其中包含202,908个三元组和一个表示每个患者同意的同意图。
{"title":"Consent Based Access Policy Framework","authors":"Geetha Madadevaiah, R. Prasad, Amogh Hiremath, M. Dumontier, A. Dekker","doi":"10.5121/CSIT.2019.90504","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90504","url":null,"abstract":"In this paper, we use Semantic Web Technologies to store and share the sensitive medical data in a secure manner. The framework builds on the advantages of the Semantic Web technologies and makes it secure and robust for sharing sensitive information in a controlled environment. The framework uses a combination of Role-Based and Rule-Based Access Policies to provide security to a medical data repository. To support the framework, we built a lightweight ontology to collect consent from the users indicating which part of their data they want to share with another user having a particular role. Here, we have considered the scenario of sharing the medical data by the owner of data, say the patient, with relevant people such as physicians, researchers, pharmacist, etc. We developed a prototype,which is validated using Sesame Open RDF Workbench with 202,908 triples and a consent graph stating consents per patient.","PeriodicalId":372948,"journal":{"name":"Computer Science & Information Technology (CS & IT )","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115872491","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 present-day physics we may assume space as a perfect continuum describable by discrete mathematics or a set of discrete elements described by a programmed probabilistic process or find alternative models that grasp real conditions better as they more closely simulate real behaviour. Clustering logic based on evolutionary algorithms is able to give meaning to unlimited amounts of data that enterprises generate and that contain valuable hidden knowledge. Evolutionary algorithms are useful to make sense of this hidden knowledge, as they are very close to nature and the mind. However, most known applications of evolutionary algorithms cluster data points to one group, thereby leaving key aspects to understand the data out and thus hardening simulations of biological processes. Fuzzy clustering methods divide data points into groups based on item similarity and detects patterns between items in a set, whereby data points can belong to more than one group. Evolutionary algorithm fuzzy clustering inspired multivariate mechanism allows for changes at each iteration of the algorithm and improves performance from one feature to another and from one cluster to another. It is applicable to real life objects that are neither circular nor elliptical and thereby allows for clusters of any predefined shape. In this paper we explain the philosophical concept of evolutionary algorithms for production of fuzzy clustering methods that produce good quality of clustering in the fields of virtual reality, augmented reality and gaming applications and in industrial manufacturing, robotic assistants, product development, law and forensics as well as parameterless body model extraction from CCTV camera images.
{"title":"Evolutionary Algorithms to Simulate Real Conditions in Artificial Intelligence as Basis for Mathematical Fuzzy Clustering","authors":"Ness","doi":"10.5121/CSIT.2019.90501","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90501","url":null,"abstract":"In present-day physics we may assume space as a perfect continuum describable by discrete mathematics or a set of discrete elements described by a programmed probabilistic process or find alternative models that grasp real conditions better as they more closely simulate real behaviour. Clustering logic based on evolutionary algorithms is able to give meaning to unlimited amounts of data that enterprises generate and that contain valuable hidden knowledge. Evolutionary algorithms are useful to make sense of this hidden knowledge, as they are very close to nature and the mind. However, most known applications of evolutionary algorithms cluster data points to one group, thereby leaving key aspects to understand the data out and thus hardening simulations of biological processes. Fuzzy clustering methods divide data points into groups based on item similarity and detects patterns between items in a set, whereby data points can belong to more than one group. Evolutionary algorithm fuzzy clustering inspired multivariate mechanism allows for changes at each iteration of the algorithm and improves performance from one feature to another and from one cluster to another. It is applicable to real life objects that are neither circular nor elliptical and thereby allows for clusters of any predefined shape. \u0000In this paper we explain the philosophical concept of evolutionary algorithms for production of fuzzy clustering methods that produce good quality of clustering in the fields of virtual reality, augmented reality and gaming applications and in industrial manufacturing, robotic assistants, product development, law and forensics as well as parameterless body model extraction from CCTV camera images.","PeriodicalId":372948,"journal":{"name":"Computer Science & Information Technology (CS & IT )","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132422138","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 recent years, problem solving, automatic proof and human-like test-tasking have become a hot spot of research. This paper focus on the study of solving physical problem in Chinese. Based on the analysis of physical corpus, it is found that the physical problem are made up of n-tuples which contain concepts and relations between concepts, and the n-tuples can be expressed in the form of UP-graph (The graph of understanding problem), which is the semantic expression of physical problem. UP-graph is the base of problem solving which is generated by using physical knowledge graph (PKG). However, current knowledge graph is hard to be used in problem solving, because it cannot store methods for solving problem. So this paper presents a model of PKG which contains concepts and relations, in the model, concepts and relations are split into terms and unique IDs, and methods can be easily stored in the PKG as concepts. Based on the PKG, DKP-solving is proposed which is a novel approach for solving physical problem. The approach combines rules, statistical methods and knowledge reasoning effectively by integrating the deep learning and knowledge graph. The experimental results over the data set of real physical text indicate that DKP-solving is effective in physical problem solving.
{"title":"SOLVING THE CHINESE PHYSICAL PROBLEM BASED ON DEEP LEARNING AND KNOWLEDGE GRAPH","authors":"Mingchen Li, Zili Zhou, Yanna Wang","doi":"10.5121/CSIT.2019.90310","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90310","url":null,"abstract":"In recent years, problem solving, automatic proof and human-like test-tasking have become a hot spot of research. This paper focus on the study of solving physical problem in Chinese. Based on the analysis of physical corpus, it is found that the physical problem are made up of n-tuples which contain concepts and relations between concepts, and the n-tuples can be expressed in the form of UP-graph (The graph of understanding problem), which is the semantic expression of physical problem. UP-graph is the base of problem solving which is generated by using physical knowledge graph (PKG). However, current knowledge graph is hard to be used in problem solving, because it cannot store methods for solving problem. So this paper presents a model of PKG which contains concepts and relations, in the model, concepts and relations are split into terms and unique IDs, and methods can be easily stored in the PKG as concepts. Based on the PKG, DKP-solving is proposed which is a novel approach for solving physical problem. The approach combines rules, statistical methods and knowledge reasoning effectively by integrating the deep learning and knowledge graph. The experimental results over the data set of real physical text indicate that DKP-solving is effective in physical problem solving.","PeriodicalId":372948,"journal":{"name":"Computer Science & Information Technology (CS & IT )","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116857981","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}
The operation of substitution in 𝜆-calculus is treated as an atomic operation. It makes that substitution operation is complex to be analyzed. To overcome this drawback, explicit substitution systems are proposed. They bridge the gap between the theory of the 𝜆-calculus and its implementation in programming languages and proof assistants. 𝜆𝑜-calculus is a name-free explicit substitution. Intersection type systems for various explicit substitution calculi, not including λo-calculus, have been studied by researchers. In this paper, we put our attention to 𝜆𝑜-calculus. We present an intersection type system for 𝜆𝑜-calculus and show it satisfies the subject reduction property.
{"title":"INTERSECTION TYPE SYSTEM AND LAMBDA CALCULUS WITH DIRECTOR STRINGS","authors":"X. Shen, Kougen Zheng","doi":"10.5121/CSIT.2019.90313","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90313","url":null,"abstract":"The operation of substitution in 𝜆-calculus is treated as an atomic operation. It makes that substitution operation is complex to be analyzed. To overcome this drawback, explicit substitution systems are proposed. They bridge the gap between the theory of the 𝜆-calculus and its implementation in programming languages and proof assistants. 𝜆𝑜-calculus is a name-free explicit substitution. Intersection type systems for various explicit substitution calculi, not including λo-calculus, have been studied by researchers. In this paper, we put our attention to 𝜆𝑜-calculus. We present an intersection type system for 𝜆𝑜-calculus and show it satisfies the subject reduction property.","PeriodicalId":372948,"journal":{"name":"Computer Science & Information Technology (CS & IT )","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132771281","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}
Jisu Kim, Cheolhyeong Park, Ju O. Kim, Deokwoo Lee
This paper chiefly deals with techniques of stereo vision, particularly focuses on the procedure of stereo matching. In addition, the proposed approach deals with detection of the regions of occlusion. Prior to carrying out stereo matching, image segmentation is conducted in order to achieve precise matching results. In practice, in stereo vision, matching algorithm sometimes suffers from insufficient accuracy if occlusion is inherent with the scene of interest. Searching the matching regions is conducted based on cross correlation and based on finding a region of the minimum mean square error of the difference between the areas of interest defined in matching window. Middlebury dataset is used for experiments, comparison with the existed results, and the proposed algorithm shows better performance than the existed matching algorithms. To evaluate the proposed algorithm, we compare the result of disparity to the existed ones.
{"title":"OCCLUSION HANDLED BLOCK-BASED STEREO MATCHING WITH IMAGE SEGMENTATION","authors":"Jisu Kim, Cheolhyeong Park, Ju O. Kim, Deokwoo Lee","doi":"10.5121/CSIT.2019.90303","DOIUrl":"https://doi.org/10.5121/CSIT.2019.90303","url":null,"abstract":"This paper chiefly deals with techniques of stereo vision, particularly focuses on the procedure of stereo matching. In addition, the proposed approach deals with detection of the regions of occlusion. Prior to carrying out stereo matching, image segmentation is conducted in order to achieve precise matching results. In practice, in stereo vision, matching algorithm sometimes suffers from insufficient accuracy if occlusion is inherent with the scene of interest. Searching the matching regions is conducted based on cross correlation and based on finding a region of the minimum mean square error of the difference between the areas of interest defined in matching window. Middlebury dataset is used for experiments, comparison with the existed results, and the proposed algorithm shows better performance than the existed matching algorithms. To evaluate the proposed algorithm, we compare the result of disparity to the existed ones.","PeriodicalId":372948,"journal":{"name":"Computer Science & Information Technology (CS & IT )","volume":"53 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130331058","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
扫码关注我们
求助内容：
应助结果提醒方式：