Pub Date : 2018-11-01DOI: 10.1109/ICSAI.2018.8599384
H. Cheng, Jing Huang
Aiming at the problem of neutral point potential fluctuation and three phase current zero crossing distortion in Vienna rectifier. A high performance Vienna rectifier with small midpoint potential fluctuation and small distortion at zero current is designed. The midpoint voltage balance control is achieved by adjusting the action time of the positive and negative small vector. A seven-segment and five-segment combination vector synthesis method is used to suppress the three-phase current zero-crossing distortion. In order to simplify the control process, the target vector is first rotated into the first large sector, then the three-level space vector plane is converted into a two-level space vector plane, and then SVPWM modulation is performed on the two-level space vector plane. The simulation model of the system is built on the Matlab/Simulink software platform. The simulation results show that the control strategy has good stability and dynamics, the PF value is above 0.99, the THD is 3.53%, the midpoint potential fluctuation is small and the current zero distortion is suppressed obviously.
{"title":"Research on SVPWM Control Strategy of Three Phase VIENNA Rectifier","authors":"H. Cheng, Jing Huang","doi":"10.1109/ICSAI.2018.8599384","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599384","url":null,"abstract":"Aiming at the problem of neutral point potential fluctuation and three phase current zero crossing distortion in Vienna rectifier. A high performance Vienna rectifier with small midpoint potential fluctuation and small distortion at zero current is designed. The midpoint voltage balance control is achieved by adjusting the action time of the positive and negative small vector. A seven-segment and five-segment combination vector synthesis method is used to suppress the three-phase current zero-crossing distortion. In order to simplify the control process, the target vector is first rotated into the first large sector, then the three-level space vector plane is converted into a two-level space vector plane, and then SVPWM modulation is performed on the two-level space vector plane. The simulation model of the system is built on the Matlab/Simulink software platform. The simulation results show that the control strategy has good stability and dynamics, the PF value is above 0.99, the THD is 3.53%, the midpoint potential fluctuation is small and the current zero distortion is suppressed obviously.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134295588","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-11-01DOI: 10.1109/ICSAI.2018.8599489
Zhurong Wang, Mingfang Du, Qindong Sun, Haining Meng
Considering that different types of jobs are required to be assigned to corresponding types of machines at a given time, job scheduling problem is solved to find the optimal processing sequences with two optimization objectives, i.e., minimal required time and lowest cost of consumption. The mathematical optimization model of job scheduling problem is established, and a crowding mechanism genetic algorithm (CMGA) is proposed to solve the model. The normalization method and the preference weight coefficient are used to deal with the optimization objectives, so as to determine the fitness function of the algorithm. Meanwhile, in order to find a better feasible solution that is hidden around the unfeasible solution, the penalty item is added to the fitness function to deal with the constraint conflict. Heuristic crossover is used to the growth of the optimal pattern of the individual, and selection based on the crowding mechanism is introduced to maintain the diversity of the population. Furthermore a local search process is adopted to perform searches for neighborhoods, and improve the quality of the solution. Finally, test data verify the correctness and validity of the proposed algorithm; and the proposed algorithm and the model have been applied to practical project.
{"title":"The Crowding Mechanism Genetic Algorithm for Solving Job Scheduling Problem","authors":"Zhurong Wang, Mingfang Du, Qindong Sun, Haining Meng","doi":"10.1109/ICSAI.2018.8599489","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599489","url":null,"abstract":"Considering that different types of jobs are required to be assigned to corresponding types of machines at a given time, job scheduling problem is solved to find the optimal processing sequences with two optimization objectives, i.e., minimal required time and lowest cost of consumption. The mathematical optimization model of job scheduling problem is established, and a crowding mechanism genetic algorithm (CMGA) is proposed to solve the model. The normalization method and the preference weight coefficient are used to deal with the optimization objectives, so as to determine the fitness function of the algorithm. Meanwhile, in order to find a better feasible solution that is hidden around the unfeasible solution, the penalty item is added to the fitness function to deal with the constraint conflict. Heuristic crossover is used to the growth of the optimal pattern of the individual, and selection based on the crowding mechanism is introduced to maintain the diversity of the population. Furthermore a local search process is adopted to perform searches for neighborhoods, and improve the quality of the solution. Finally, test data verify the correctness and validity of the proposed algorithm; and the proposed algorithm and the model have been applied to practical project.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133579200","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-11-01DOI: 10.1109/ICSAI.2018.8599473
M. Nie, Kun Wang
With the rapid development of highway construction in China, more and more attention has been paid to highway maintenance. The traditional manual detection and recognition methods cannot meet the needs of highway development, so the research of detection and recognition technology based on road image has become particularly important. In recent years, deep learning has shown very high performance in target detection. Based on transfer learning, this paper reuses part of the network of pavement crack detection based on Faster R-CNN to improve the performance of pavement distress detection.
{"title":"Pavement Distress Detection Based on Transfer Learning","authors":"M. Nie, Kun Wang","doi":"10.1109/ICSAI.2018.8599473","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599473","url":null,"abstract":"With the rapid development of highway construction in China, more and more attention has been paid to highway maintenance. The traditional manual detection and recognition methods cannot meet the needs of highway development, so the research of detection and recognition technology based on road image has become particularly important. In recent years, deep learning has shown very high performance in target detection. Based on transfer learning, this paper reuses part of the network of pavement crack detection based on Faster R-CNN to improve the performance of pavement distress detection.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127808656","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-11-01DOI: 10.1109/ICSAI.2018.8599478
Yunfei Ma, Hanxu Sun, Ping Ye, Chang Li
The mobile robot can independently run the core as SLAM and path planning [1]. In the grid method drawing, high-precision positioning requires a high-resolution grid. When a mobile robot covers a certain working area, since the coverage width is constant each time, when high-efficiency coverage is required, a low-resolution grid is required for path planning, and a multi-resolution raster problem occurs. For the full coverage path planning problem of multi-resolution mobile robots, this paper proposes the use of high-precision grid positioning, low-resolution raster path planning coverage. In the normal grid traversal process, this paper adopts a mobile robot full coverage path planning algorithm based on bio-excitation network, which can be autonomous exploration traversal. This paper actually models its algorithm, and increases direction guidance and robot into dead zone. When escaping from the dead zone as soon as possible according to greedy thoughts, the algorithm has good real-time performance, can automatically avoid obstacles and escape from the dead zone, and there will be no large-scale folding back. Especially in the field of cleaning, the follow-on mobile robot can effectively clean the narrow area. It can make the cleaning car recycle garbage and has high cleaning efficiency. In the process of high resolution to low resolution, there are both moving obstacles and movable motion grids. This paper uses quadtree segmentation and Hilbert curve to traverse the motion grid to improve coverage and efficiency. The edge of the rule explores the purpose of reciprocating the entire region by reciprocating the unknown environment. In the experiment, it is proved that the algorithm of this paper has higher coverage efficiency by comparing with the original biological excitation network algorithm.
{"title":"Mobile robot multi-resolution full coverage path planning algorithm","authors":"Yunfei Ma, Hanxu Sun, Ping Ye, Chang Li","doi":"10.1109/ICSAI.2018.8599478","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599478","url":null,"abstract":"The mobile robot can independently run the core as SLAM and path planning [1]. In the grid method drawing, high-precision positioning requires a high-resolution grid. When a mobile robot covers a certain working area, since the coverage width is constant each time, when high-efficiency coverage is required, a low-resolution grid is required for path planning, and a multi-resolution raster problem occurs. For the full coverage path planning problem of multi-resolution mobile robots, this paper proposes the use of high-precision grid positioning, low-resolution raster path planning coverage. In the normal grid traversal process, this paper adopts a mobile robot full coverage path planning algorithm based on bio-excitation network, which can be autonomous exploration traversal. This paper actually models its algorithm, and increases direction guidance and robot into dead zone. When escaping from the dead zone as soon as possible according to greedy thoughts, the algorithm has good real-time performance, can automatically avoid obstacles and escape from the dead zone, and there will be no large-scale folding back. Especially in the field of cleaning, the follow-on mobile robot can effectively clean the narrow area. It can make the cleaning car recycle garbage and has high cleaning efficiency. In the process of high resolution to low resolution, there are both moving obstacles and movable motion grids. This paper uses quadtree segmentation and Hilbert curve to traverse the motion grid to improve coverage and efficiency. The edge of the rule explores the purpose of reciprocating the entire region by reciprocating the unknown environment. In the experiment, it is proved that the algorithm of this paper has higher coverage efficiency by comparing with the original biological excitation network algorithm.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114417755","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-11-01DOI: 10.1109/ICSAI.2018.8599320
Xiaojunwu, Qiyingcao, Juanjin, Hongzhang
The Narrowband Internet of Things (NB-IoT) is a main stream technology based on mobile communication system. The combination of NB-IoT and WSNs can active the application of WSNs. In order to evaluate the influence of node heterogeneity on malware propagation in NB-IoT based Heterogeneous Wireless Sensor Networks, we propose a node heterogeneity model based on node distribution and vulnerability differences, which can be used to analyze the availability of nodes. We then establish the node state transition model by epidemic theory and Markov chain. Further, we obtain the dynamic equations of the transition between nodes and the calculation formula of node availability. The simulation result is that when the degree of node is small and the node vulnerability function is a power function, the node availability is the highest; when the degree of node is large and the node vulnerability function satisfies the exponential function and the power function, the node availability is high. Therefore, when constructing a NBIOT-HWSNs network, node protection is implemented according to the degree of node, so that when the node vulnerability function satisfies the power function, all nodes can maintain high availability, thus making the entire network more stable.
{"title":"Nodes Availability Analysis of Heterogeneous Wireless Sensor Networks Based on NB-IoT Under Malware Infection","authors":"Xiaojunwu, Qiyingcao, Juanjin, Hongzhang","doi":"10.1109/ICSAI.2018.8599320","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599320","url":null,"abstract":"The Narrowband Internet of Things (NB-IoT) is a main stream technology based on mobile communication system. The combination of NB-IoT and WSNs can active the application of WSNs. In order to evaluate the influence of node heterogeneity on malware propagation in NB-IoT based Heterogeneous Wireless Sensor Networks, we propose a node heterogeneity model based on node distribution and vulnerability differences, which can be used to analyze the availability of nodes. We then establish the node state transition model by epidemic theory and Markov chain. Further, we obtain the dynamic equations of the transition between nodes and the calculation formula of node availability. The simulation result is that when the degree of node is small and the node vulnerability function is a power function, the node availability is the highest; when the degree of node is large and the node vulnerability function satisfies the exponential function and the power function, the node availability is high. Therefore, when constructing a NBIOT-HWSNs network, node protection is implemented according to the degree of node, so that when the node vulnerability function satisfies the power function, all nodes can maintain high availability, thus making the entire network more stable.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114533305","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-11-01DOI: 10.1109/ICSAI.2018.8599299
Qianyu Yang, Lei Wang, Yang Jiang
Taking a three-pressure reheated gas-steam combined cycle unit as the research object, the detailed efficiency calculation model of gas turbine and heat recovery steam generator was established, and the influence of various thermal parameters of gas turbine and heat recovery steam generator on efficiency was analyzed. Using MATLAB software programming, the relationship between the efficiency of gas turbine and heat recovery steam generator with various thermal parameters is obtained, and the sensitivity of gas turbine and heat recovery steam generator efficiency to various thermal parameters is analyzed, and the thermal parameters that have the greatest impact on efficiency are found. Optimized operation of power plant parameters plays a guiding role.
{"title":"Operation parameters analysis of gas steam combined cycle","authors":"Qianyu Yang, Lei Wang, Yang Jiang","doi":"10.1109/ICSAI.2018.8599299","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599299","url":null,"abstract":"Taking a three-pressure reheated gas-steam combined cycle unit as the research object, the detailed efficiency calculation model of gas turbine and heat recovery steam generator was established, and the influence of various thermal parameters of gas turbine and heat recovery steam generator on efficiency was analyzed. Using MATLAB software programming, the relationship between the efficiency of gas turbine and heat recovery steam generator with various thermal parameters is obtained, and the sensitivity of gas turbine and heat recovery steam generator efficiency to various thermal parameters is analyzed, and the thermal parameters that have the greatest impact on efficiency are found. Optimized operation of power plant parameters plays a guiding role.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114943361","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-11-01DOI: 10.1109/ICSAI.2018.8599477
Lu Wang, Xiaosong Li
ESB as the code component of SOA implementation has a much higher impact on the whole system performance. This study is to zoom into investigations on ESB applications under SOA architect, evaluate the performance for different ESB applications under different SOAP/XML message routing tasks, to gain an understanding of the factors that influence the performance of SOAP/XML message routing tasks in ESB applications. Comparing with the existing ESB performance evaluations, the federated ESB evaluations, as well as performance factors comparison are the main contributions of this study. Both of the single ESB experiments and federated ESB experiments had been conducted. Four ESBs, Tibco, BizTalk, Fuse, and Mule, were tested. Three tasks were used in the single ESB experiments. Sixteen test cases were involved in the federated ESB experiments; the same task was used for all the sixteen test cases. The single ESB experiment results showed that Mule ESB applications had the best performance and Fuse ESB applications had the lowest performance. The federated experiment results showed three good performance cases with Mule ESB involved, which is consistent with the single ESB experiment results. The federated experiment results also suggested that the combination of the two good performance single ESBs are not necessary to result in good performance ESB applications. Overall, Response Time could be the factor that has the most indication of ESB performance. In the future, not only more ESB applications but also more test cases could be included for the federated ESB experiments. Further statistical analysis and result verification would bring a more comprehensive understanding of ESB performance.
{"title":"An Empirical Study on the Performance of ESB Applications","authors":"Lu Wang, Xiaosong Li","doi":"10.1109/ICSAI.2018.8599477","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599477","url":null,"abstract":"ESB as the code component of SOA implementation has a much higher impact on the whole system performance. This study is to zoom into investigations on ESB applications under SOA architect, evaluate the performance for different ESB applications under different SOAP/XML message routing tasks, to gain an understanding of the factors that influence the performance of SOAP/XML message routing tasks in ESB applications. Comparing with the existing ESB performance evaluations, the federated ESB evaluations, as well as performance factors comparison are the main contributions of this study. Both of the single ESB experiments and federated ESB experiments had been conducted. Four ESBs, Tibco, BizTalk, Fuse, and Mule, were tested. Three tasks were used in the single ESB experiments. Sixteen test cases were involved in the federated ESB experiments; the same task was used for all the sixteen test cases. The single ESB experiment results showed that Mule ESB applications had the best performance and Fuse ESB applications had the lowest performance. The federated experiment results showed three good performance cases with Mule ESB involved, which is consistent with the single ESB experiment results. The federated experiment results also suggested that the combination of the two good performance single ESBs are not necessary to result in good performance ESB applications. Overall, Response Time could be the factor that has the most indication of ESB performance. In the future, not only more ESB applications but also more test cases could be included for the federated ESB experiments. Further statistical analysis and result verification would bring a more comprehensive understanding of ESB performance.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117283994","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-11-01DOI: 10.1109/ICSAI.2018.8599413
Jan Busse, Cornelius Rüther, Julia Rieck
Energy as a major cost factor has become increasingly important for manufacturing companies. Due to current developments, such as smart metering, internet of things, and varying pricing schemes, companies can increase energy efficiency and reduce energy costs. In order to realize benefits, we introduce a mixed-integer linear scheduling model providing the feature of maximizing the gross profit of prioritized jobs. The underlying production environment consists of three stages, where jobs have to be passed in the same order. A computational analysis shows that energy costs can be significantly decreased and the prioritization of jobs opens excellent degrees of freedom for a decision maker.
{"title":"Energy Cost-Oriented Scheduling With Job Prioritization","authors":"Jan Busse, Cornelius Rüther, Julia Rieck","doi":"10.1109/ICSAI.2018.8599413","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599413","url":null,"abstract":"Energy as a major cost factor has become increasingly important for manufacturing companies. Due to current developments, such as smart metering, internet of things, and varying pricing schemes, companies can increase energy efficiency and reduce energy costs. In order to realize benefits, we introduce a mixed-integer linear scheduling model providing the feature of maximizing the gross profit of prioritized jobs. The underlying production environment consists of three stages, where jobs have to be passed in the same order. A computational analysis shows that energy costs can be significantly decreased and the prioritization of jobs opens excellent degrees of freedom for a decision maker.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127429238","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-11-01DOI: 10.1109/ICSAI.2018.8599437
Jianfeng Tao
The result of maneuvering target tracking based on theory of kalman filter depends on the state model of target and the measurement model. When the state model of target is imprecise or is not described by liner space model of state, the result will be volatilization. However, the establishment of mathematical models is complex and difficult. Sometimes, it is impossible to establish accurate mathematical models. If the established model is adaptive to more situation, the filter will not be volatilization, even if the target is maneuvering. This paper provides a new algorithm by introducing grey model into kalman filter. In course of kalman filter, the forecasting value depends on the state model of target no longer. It forecasts next value by using a few forward estimated values with grey differential equation. It gets the current estimated value by using the forecasting value of previous moment and the observed value of current moment. Not only its accuracy is higher, but also its performance is better. Especially, during target maneuvering, the result of filter is better than the traditional method. Experiment results indicate that the way of maneuver target tracking is feasible.
{"title":"Maneuver Target Tracking Based on Grey System Theory","authors":"Jianfeng Tao","doi":"10.1109/ICSAI.2018.8599437","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599437","url":null,"abstract":"The result of maneuvering target tracking based on theory of kalman filter depends on the state model of target and the measurement model. When the state model of target is imprecise or is not described by liner space model of state, the result will be volatilization. However, the establishment of mathematical models is complex and difficult. Sometimes, it is impossible to establish accurate mathematical models. If the established model is adaptive to more situation, the filter will not be volatilization, even if the target is maneuvering. This paper provides a new algorithm by introducing grey model into kalman filter. In course of kalman filter, the forecasting value depends on the state model of target no longer. It forecasts next value by using a few forward estimated values with grey differential equation. It gets the current estimated value by using the forecasting value of previous moment and the observed value of current moment. Not only its accuracy is higher, but also its performance is better. Especially, during target maneuvering, the result of filter is better than the traditional method. Experiment results indicate that the way of maneuver target tracking is feasible.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127835903","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-11-01DOI: 10.1109/ICSAI.2018.8599428
Wenhao Li
The triangular mesh model obtained from the measured data in reverse engineering often contains a large amount of noise, disturbance and irregular triangles, which need to be smoothed to meet the requirements of subsequent processing. This paper analyzes the advantages and disadvantages of Laplacian smoothing method and Taubin method in terms of processing effect and operation efficiency. A smoothing method based on vertex classification and distance equalization is proposed in this paper to avoid the drawbacks of Laplace smoothing method and Taubin method. Vertex classification divides the vertices in the mesh model into feature vertices and normal vertices, so that different smoothing methods can be used for different vertices. The smoothing method based on distance equalization starts from the distance between the vertices of the mesh and the average plane of its neighbors, and takes the difference of the average plane distance from the adjacent vertices to its neighborhood as the weight to control the moving direction of the vertices, effectively maintaining the surface features of the model.
{"title":"3D Mesh Smoothing Method Based on Vertex Classification and Distance Equalization","authors":"Wenhao Li","doi":"10.1109/ICSAI.2018.8599428","DOIUrl":"https://doi.org/10.1109/ICSAI.2018.8599428","url":null,"abstract":"The triangular mesh model obtained from the measured data in reverse engineering often contains a large amount of noise, disturbance and irregular triangles, which need to be smoothed to meet the requirements of subsequent processing. This paper analyzes the advantages and disadvantages of Laplacian smoothing method and Taubin method in terms of processing effect and operation efficiency. A smoothing method based on vertex classification and distance equalization is proposed in this paper to avoid the drawbacks of Laplace smoothing method and Taubin method. Vertex classification divides the vertices in the mesh model into feature vertices and normal vertices, so that different smoothing methods can be used for different vertices. The smoothing method based on distance equalization starts from the distance between the vertices of the mesh and the average plane of its neighbors, and takes the difference of the average plane distance from the adjacent vertices to its neighborhood as the weight to control the moving direction of the vertices, effectively maintaining the surface features of the model.","PeriodicalId":375852,"journal":{"name":"2018 5th International Conference on Systems and Informatics (ICSAI)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126367597","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
扫码关注我们
求助内容：
应助结果提醒方式：