Pub Date : 2017-05-01DOI: 10.1109/CCDC.2017.7978769
Li Shu-ting, Gao Xian-wen
Aiming at the parameter identification problem of catalyst protected region in the process of propylene oxidation, a novel parameter identification method has been proposed for catalyst protected region using an adaptive simulated annealing particle swarm optimization (ASAPSO) algorithm. Synchronous change learning factors and linear decrease progressively inertia weights are embedded in the simulated annealing particle swarm optimization algorithm. The information exchange capacity is enhanced by the synchronous change learning factors. The overall search ability and local improved ability are balanced by the linear decrease progressively inertia weights. The proposed algorithm has some advantages in the aspect of good stability, strong information exchange capacity and fast convergence. Meanwhile, the shortcoming of local minimum valve is solved by the proposed algorithm. Simulation results show that the algorithm is feasible and accurate. The catalyst protected region of propylene oxidation from 6.35% to 11.25% is determined. Finally, the proposed ASAPSO algorithm is efficient.
{"title":"Adaptive simulated annealing particle swarm optimization for catalyst protected region parameter identification","authors":"Li Shu-ting, Gao Xian-wen","doi":"10.1109/CCDC.2017.7978769","DOIUrl":"https://doi.org/10.1109/CCDC.2017.7978769","url":null,"abstract":"Aiming at the parameter identification problem of catalyst protected region in the process of propylene oxidation, a novel parameter identification method has been proposed for catalyst protected region using an adaptive simulated annealing particle swarm optimization (ASAPSO) algorithm. Synchronous change learning factors and linear decrease progressively inertia weights are embedded in the simulated annealing particle swarm optimization algorithm. The information exchange capacity is enhanced by the synchronous change learning factors. The overall search ability and local improved ability are balanced by the linear decrease progressively inertia weights. The proposed algorithm has some advantages in the aspect of good stability, strong information exchange capacity and fast convergence. Meanwhile, the shortcoming of local minimum valve is solved by the proposed algorithm. Simulation results show that the algorithm is feasible and accurate. The catalyst protected region of propylene oxidation from 6.35% to 11.25% is determined. Finally, the proposed ASAPSO algorithm is efficient.","PeriodicalId":6588,"journal":{"name":"2017 29th Chinese Control And Decision Conference (CCDC)","volume":"36 1","pages":"1580-1585"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77473782","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-05-01DOI: 10.1109/CCDC.2017.7978369
Wen Fei, Zhuo Su, C. Zhou
Localization and landing are of fundamental importance for Unmanned Aerial Vehicles (UAVs), and with the research on compute vision information processing, artificial landmark detection, a more efficient and accurate method, becomes a hot topic. In this paper, in order to provide sufficient information for localization, we design an artificial landmark with an annulus and some circles inside with specific positions and colors. We firstly use color and hierarchy information to find possible patter, then calculate its cross-ratio to check this pattern, localize our UAV at last. To prove our landmark and detection-recognition algorithm, two kinds of experiments are conducted and the results demonstrate our feasibility and accuracy. One is putting our landmark on random backgrounds to imitate complex environment, another is on real environments with different projection and distance. With those experimental results, we get the conclusion that our landmark and algorithm are robust and feasibility under various environments.
{"title":"Artificial landmark design and detection using hierarchy information for UAV localization and landing","authors":"Wen Fei, Zhuo Su, C. Zhou","doi":"10.1109/CCDC.2017.7978369","DOIUrl":"https://doi.org/10.1109/CCDC.2017.7978369","url":null,"abstract":"Localization and landing are of fundamental importance for Unmanned Aerial Vehicles (UAVs), and with the research on compute vision information processing, artificial landmark detection, a more efficient and accurate method, becomes a hot topic. In this paper, in order to provide sufficient information for localization, we design an artificial landmark with an annulus and some circles inside with specific positions and colors. We firstly use color and hierarchy information to find possible patter, then calculate its cross-ratio to check this pattern, localize our UAV at last. To prove our landmark and detection-recognition algorithm, two kinds of experiments are conducted and the results demonstrate our feasibility and accuracy. One is putting our landmark on random backgrounds to imitate complex environment, another is on real environments with different projection and distance. With those experimental results, we get the conclusion that our landmark and algorithm are robust and feasibility under various environments.","PeriodicalId":6588,"journal":{"name":"2017 29th Chinese Control And Decision Conference (CCDC)","volume":"108 1","pages":"6631-6636"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77476816","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}
Geo-distributed mobile cloud computing takes location information into consideration in mobile cloud computing. Users can access cloud resources that are geographically close to their mobile devices in Geo-distributed mobile cloud computing to reduce communication delay. Considering the uncertainty requirement of mobile users, in this paper, we focus on resource sharing through cooperation among cloud providers. A coalitional game based mechanism is proposed for resource sharing to optimize the resources usage and reduce the cost of cloud service providers. The coalition game is adopted to form the coalition of cloud service providers and the stability of its structure is guaranteed. The cost distribution of resource usage by cloud service providers participating in coalition game is analyzed according to Shapley value method. Besides, the coalition resource sharing problem is transformed into the problem of resource cost minimization in the coalition, and the solution is obtained by the dual decomposition and the subgradient method. Simulation results validate the effectiveness of the proposed mechanism.
{"title":"A coalitional game based mechanism for resource sharing in geo-distributed mobile cloud computing","authors":"Yeru Zhao, Zhiwu Huang, Xiaoyong Zhang, Weirong Liu, Qianqian Zhang, Zhengfa Zhu","doi":"10.1109/CCDC.2017.7979158","DOIUrl":"https://doi.org/10.1109/CCDC.2017.7979158","url":null,"abstract":"Geo-distributed mobile cloud computing takes location information into consideration in mobile cloud computing. Users can access cloud resources that are geographically close to their mobile devices in Geo-distributed mobile cloud computing to reduce communication delay. Considering the uncertainty requirement of mobile users, in this paper, we focus on resource sharing through cooperation among cloud providers. A coalitional game based mechanism is proposed for resource sharing to optimize the resources usage and reduce the cost of cloud service providers. The coalition game is adopted to form the coalition of cloud service providers and the stability of its structure is guaranteed. The cost distribution of resource usage by cloud service providers participating in coalition game is analyzed according to Shapley value method. Besides, the coalition resource sharing problem is transformed into the problem of resource cost minimization in the coalition, and the solution is obtained by the dual decomposition and the subgradient method. Simulation results validate the effectiveness of the proposed mechanism.","PeriodicalId":6588,"journal":{"name":"2017 29th Chinese Control And Decision Conference (CCDC)","volume":"36 1","pages":"3758-3763"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77807179","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-05-01DOI: 10.1109/CCDC.2017.7978370
He Sun, Shumei Zhang, Chunhui Zhao, Youxian Sun
It is very important to isolate the faulty variables after a fault is detected. However, it is challenging to isolate the faulty variables due to the nonstationarity which widely exists in the industry processes. The statistical properties of nonstationary process variables are time-variant, i.e., these variables are time-dependent. This paper proposes an effective faulty variable isolation method for the nonstationary industrial processes using the cointegration method. In the nonstationary industrial processes, not all the variables are nonstationary. The nonstationary variables should be distinguished from the stationary ones. Then, the nonstationary variables are used to build the cointegration model to describe the long-run equilibrium relation among those nonstationary variables. Finally, the least absolute shrinkage and selection operator method is integrated to the cointegration model for selecting the faulty variables that are mainly responsible for the fault. The proposed faulty variable isolation method can deal with the nonstationary issue in the industrial processes and isolate multiple faulty variables simultaneously. Its feasibility and performance are illustrated with a real industrial process of the thermal power plant.
{"title":"Fault isolation method for nonstationary industrial processes","authors":"He Sun, Shumei Zhang, Chunhui Zhao, Youxian Sun","doi":"10.1109/CCDC.2017.7978370","DOIUrl":"https://doi.org/10.1109/CCDC.2017.7978370","url":null,"abstract":"It is very important to isolate the faulty variables after a fault is detected. However, it is challenging to isolate the faulty variables due to the nonstationarity which widely exists in the industry processes. The statistical properties of nonstationary process variables are time-variant, i.e., these variables are time-dependent. This paper proposes an effective faulty variable isolation method for the nonstationary industrial processes using the cointegration method. In the nonstationary industrial processes, not all the variables are nonstationary. The nonstationary variables should be distinguished from the stationary ones. Then, the nonstationary variables are used to build the cointegration model to describe the long-run equilibrium relation among those nonstationary variables. Finally, the least absolute shrinkage and selection operator method is integrated to the cointegration model for selecting the faulty variables that are mainly responsible for the fault. The proposed faulty variable isolation method can deal with the nonstationary issue in the industrial processes and isolate multiple faulty variables simultaneously. Its feasibility and performance are illustrated with a real industrial process of the thermal power plant.","PeriodicalId":6588,"journal":{"name":"2017 29th Chinese Control And Decision Conference (CCDC)","volume":"363 1","pages":"6637-6642"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80297290","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-05-01DOI: 10.1109/CCDC.2017.7978292
Hongmei Zhang, Weining Wang, Guangyan Xu
The formation reconfiguration problem of the multiple unmanned aerial vehicles (Multi-UAVs) is described as an optimal control problem in this paper. Firstly, the control model of formation flight is constructed with the three-dimensional elastic distance vector, which describes the relationship between the speed and distance of adjacent UAVs in the leader-follower type. Furthermore, the constraints of communication distance and the security anti-collision distance are taken into account, and the formation is modeled to a fuel optimal problem with terminal state restrictions. Then, the optimal control problem of UAV formation flight is transformed into a nonlinear programming problem based on Legendre Pseudospectrum Method. The advantage of LPM is to obtain a higher accuracy with fewer nodes in the process of discretization. Finally, the formation with three UAVs is simulated in Matlab and solved by Tomlab toolkit. The simulation results show that the formation can be well achieved the desired new shape with minor position error and optimal fuel. The effectiveness and feasibility of the method is verified.
{"title":"Optimal control of formation reconfiguration for multiple UAVs based on Legendre Pseudospectral Method","authors":"Hongmei Zhang, Weining Wang, Guangyan Xu","doi":"10.1109/CCDC.2017.7978292","DOIUrl":"https://doi.org/10.1109/CCDC.2017.7978292","url":null,"abstract":"The formation reconfiguration problem of the multiple unmanned aerial vehicles (Multi-UAVs) is described as an optimal control problem in this paper. Firstly, the control model of formation flight is constructed with the three-dimensional elastic distance vector, which describes the relationship between the speed and distance of adjacent UAVs in the leader-follower type. Furthermore, the constraints of communication distance and the security anti-collision distance are taken into account, and the formation is modeled to a fuel optimal problem with terminal state restrictions. Then, the optimal control problem of UAV formation flight is transformed into a nonlinear programming problem based on Legendre Pseudospectrum Method. The advantage of LPM is to obtain a higher accuracy with fewer nodes in the process of discretization. Finally, the formation with three UAVs is simulated in Matlab and solved by Tomlab toolkit. The simulation results show that the formation can be well achieved the desired new shape with minor position error and optimal fuel. The effectiveness and feasibility of the method is verified.","PeriodicalId":6588,"journal":{"name":"2017 29th Chinese Control And Decision Conference (CCDC)","volume":"9 1","pages":"6230-6235"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79011912","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-05-01DOI: 10.1109/CCDC.2017.7978703
Chengyuan Sun, Xinrui Shen, Jian Hou, Zhiyong She
The particle filter (PF) is an effective technique for state estimation in the nonlinear and non-Gaussian systems. However, one serious problem of PF is resampling. In this study, a weights PF (WPF) is proposed to mitigate the particle impoverishment problem common in PF. The WPF is inspired by the selection operator of genetic algorithm (GA). The weights of WPF are divided into two parts, and the large weights are used to replace the small ones. In this strategy, more particles are able to participate in the approximation of the posterior distribution after the procedure of resampling. Consequently, the results of state estimation can be more accurate. Meanwhile, the WPF has fairly low computational burden. Finally, the effectiveness of the proposed technique is verified by two simulation examples.
{"title":"A weights particle filter for state estimation","authors":"Chengyuan Sun, Xinrui Shen, Jian Hou, Zhiyong She","doi":"10.1109/CCDC.2017.7978703","DOIUrl":"https://doi.org/10.1109/CCDC.2017.7978703","url":null,"abstract":"The particle filter (PF) is an effective technique for state estimation in the nonlinear and non-Gaussian systems. However, one serious problem of PF is resampling. In this study, a weights PF (WPF) is proposed to mitigate the particle impoverishment problem common in PF. The WPF is inspired by the selection operator of genetic algorithm (GA). The weights of WPF are divided into two parts, and the large weights are used to replace the small ones. In this strategy, more particles are able to participate in the approximation of the posterior distribution after the procedure of resampling. Consequently, the results of state estimation can be more accurate. Meanwhile, the WPF has fairly low computational burden. Finally, the effectiveness of the proposed technique is verified by two simulation examples.","PeriodicalId":6588,"journal":{"name":"2017 29th Chinese Control And Decision Conference (CCDC)","volume":"1 1","pages":"1214-1219"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79069022","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-05-01DOI: 10.1109/CCDC.2017.7978484
Xiaofeng Zong, Tao Li
This paper studies mean square and almost sure consensus of discrete-time second-order multi-agent systems with time-delays and multiplicative noises in the information exchange with neighbors. By using the stochastic stability theorem of discrete-time stochastic delay systems, we find sufficient conditions for mean square and almost sure consensus explicitly related to the network and control parameters. It is shown that if the network graph is balanced and strongly connected, then the weighted-average type control protocol can be properly designed to ensure mean square and almost sure consensus for any given time-delays and noise intensity coefficients.
{"title":"Consensus of discrete-time second-order multi-agent systems with delayed and noisy measurements under balanced digraphs","authors":"Xiaofeng Zong, Tao Li","doi":"10.1109/CCDC.2017.7978484","DOIUrl":"https://doi.org/10.1109/CCDC.2017.7978484","url":null,"abstract":"This paper studies mean square and almost sure consensus of discrete-time second-order multi-agent systems with time-delays and multiplicative noises in the information exchange with neighbors. By using the stochastic stability theorem of discrete-time stochastic delay systems, we find sufficient conditions for mean square and almost sure consensus explicitly related to the network and control parameters. It is shown that if the network graph is balanced and strongly connected, then the weighted-average type control protocol can be properly designed to ensure mean square and almost sure consensus for any given time-delays and noise intensity coefficients.","PeriodicalId":6588,"journal":{"name":"2017 29th Chinese Control And Decision Conference (CCDC)","volume":"86 1","pages":"7208-7213"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79403530","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-05-01DOI: 10.1109/CCDC.2017.7978572
Li Fu, Jinxin Fu, Yu Guo, Jianhui Xi
A K-means clustering RBF neural network modeling method is introduced in this paper, this model is for infrared target spectral emissivity estimation. Part of the transmission of infrared radiation in the atmosphere is absorbed by the atmosphere, the use of RBF neural network measurement samples for analysis and learning. An infrared energy model of 3–14 μ m was established to estimate the spectral emissivity of the target at different wavelengths. The experiment results show that the maximum relative error is less than 1% compared with the theoretical emissivity calculated by the RBF network. Finally, that method is a good way to learn the spectral emissivity and it is verified by the aerospace aluminum alloy.
{"title":"Spectral emissivity estimation based on K — means clustering RBF neural network","authors":"Li Fu, Jinxin Fu, Yu Guo, Jianhui Xi","doi":"10.1109/CCDC.2017.7978572","DOIUrl":"https://doi.org/10.1109/CCDC.2017.7978572","url":null,"abstract":"A K-means clustering RBF neural network modeling method is introduced in this paper, this model is for infrared target spectral emissivity estimation. Part of the transmission of infrared radiation in the atmosphere is absorbed by the atmosphere, the use of RBF neural network measurement samples for analysis and learning. An infrared energy model of 3–14 μ m was established to estimate the spectral emissivity of the target at different wavelengths. The experiment results show that the maximum relative error is less than 1% compared with the theoretical emissivity calculated by the RBF network. Finally, that method is a good way to learn the spectral emissivity and it is verified by the aerospace aluminum alloy.","PeriodicalId":6588,"journal":{"name":"2017 29th Chinese Control And Decision Conference (CCDC)","volume":"7 1","pages":"7639-7642"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81555955","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-05-01DOI: 10.1109/CCDC.2017.7978786
Yuehui Ji, Hailiang Zhou, Xianggui Guo
A nonlinear tracking control based on Immersion and Invariance-based(I&I) technology, is addressed to achieve asymptotic tracking for 3-D position and yaw motion of an underactuated quadrotor. In the underlying control scheme, an inner/outer-loop construction is designed to handle the underactuated property. The I&I technology is constructed for stable tracking for the inner-loop and outer-loop. Lyapunov Theorem is exploited to guarantee the asymptotic tracking stability of resulting closed-loop system. Numerical simulations on Matlab/Simulink environment are included to illustrate the effectiveness of proposed I&I control scheme.
{"title":"Asymptotic tracking control for an underactuated quadrotor via immersion and invariance technology","authors":"Yuehui Ji, Hailiang Zhou, Xianggui Guo","doi":"10.1109/CCDC.2017.7978786","DOIUrl":"https://doi.org/10.1109/CCDC.2017.7978786","url":null,"abstract":"A nonlinear tracking control based on Immersion and Invariance-based(I&I) technology, is addressed to achieve asymptotic tracking for 3-D position and yaw motion of an underactuated quadrotor. In the underlying control scheme, an inner/outer-loop construction is designed to handle the underactuated property. The I&I technology is constructed for stable tracking for the inner-loop and outer-loop. Lyapunov Theorem is exploited to guarantee the asymptotic tracking stability of resulting closed-loop system. Numerical simulations on Matlab/Simulink environment are included to illustrate the effectiveness of proposed I&I control scheme.","PeriodicalId":6588,"journal":{"name":"2017 29th Chinese Control And Decision Conference (CCDC)","volume":"27 1","pages":"1674-1679"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81570862","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-05-01DOI: 10.1109/CCDC.2017.7979340
L. Yuxin, Ma Xianmin
The detection of fire on mine belt conveyor is very difficult in traditional image processing method, a novel image processing method is proposed in this paper, which integrates Artificial Bee Colony algorithm, gray scale morphology and information entropy. In Artificial Bee Colony algorithm the best threshold is approached in parallel via the division of labor, cooperation and information sharing of employed bees, onlookers and scouts. The fitness function of Artificial Bee Colony algorithm is designed by 2D maximum entropy method and fire image thresholds are regarded as nectar source. In order to reduce image noise the close operation is applied based on gray scale morphology. Theory analysis and simulation experimental results indicate that the proposed method is useful to detect fire of mine belt conveyor in complex coal under ground environment.
{"title":"Fire detection method of mine belt conveyor based on Artificial Bee Colony algorithm","authors":"L. Yuxin, Ma Xianmin","doi":"10.1109/CCDC.2017.7979340","DOIUrl":"https://doi.org/10.1109/CCDC.2017.7979340","url":null,"abstract":"The detection of fire on mine belt conveyor is very difficult in traditional image processing method, a novel image processing method is proposed in this paper, which integrates Artificial Bee Colony algorithm, gray scale morphology and information entropy. In Artificial Bee Colony algorithm the best threshold is approached in parallel via the division of labor, cooperation and information sharing of employed bees, onlookers and scouts. The fitness function of Artificial Bee Colony algorithm is designed by 2D maximum entropy method and fire image thresholds are regarded as nectar source. In order to reduce image noise the close operation is applied based on gray scale morphology. Theory analysis and simulation experimental results indicate that the proposed method is useful to detect fire of mine belt conveyor in complex coal under ground environment.","PeriodicalId":6588,"journal":{"name":"2017 29th Chinese Control And Decision Conference (CCDC)","volume":"33 1","pages":"4778-4782"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81717646","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
扫码关注我们
求助内容：
应助结果提醒方式：