Pub Date : 2014-12-15DOI: 10.1109/SPAC.2014.6982693
Weijiang Feng, Naiyang Guan, Xiang Zhang, Xuhui Huang, Zhigang Luo
Image defogging (IDF) removes influences of fogs from an image to improve its quality. Since defogged images can significantly boost the performance of subsequent processing, IDF has attracted many attentions from the computer vision community. However, existing IDF algorithms are built on the assumption that light is scattered once by a grain. Since such assumption is violated if images are contaminated by dense haze or heavy fog, traditional IDF algorithms often fail in this situation. In this paper, we propose a hybrid image defogging (HIDF) algorithm to overcome this deficiency. In particular, HIDF applies the single scattering physics model (SSPM) to pixels dominated by single scattering of light, and applies the multiple scattering physics model (MSPM) to remaining pixels. To distinguish two types of pixels, HIDF utilizes the optical thickness of corresponding pixels. If optical thickness is smaller than a threshold that determines whether the single scattering or the multiple scattering dominates, HIDF applies the SSPM, and HIDF applies the MSPM otherwise. Experimental results on several popular foggy images demonstrate that HIDF competes with the state-of-the-art algorithms, and show the promise of HIDF for defogging heavily foggy images.
{"title":"Single image defogging with single and multiple hybrid scattering model","authors":"Weijiang Feng, Naiyang Guan, Xiang Zhang, Xuhui Huang, Zhigang Luo","doi":"10.1109/SPAC.2014.6982693","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982693","url":null,"abstract":"Image defogging (IDF) removes influences of fogs from an image to improve its quality. Since defogged images can significantly boost the performance of subsequent processing, IDF has attracted many attentions from the computer vision community. However, existing IDF algorithms are built on the assumption that light is scattered once by a grain. Since such assumption is violated if images are contaminated by dense haze or heavy fog, traditional IDF algorithms often fail in this situation. In this paper, we propose a hybrid image defogging (HIDF) algorithm to overcome this deficiency. In particular, HIDF applies the single scattering physics model (SSPM) to pixels dominated by single scattering of light, and applies the multiple scattering physics model (MSPM) to remaining pixels. To distinguish two types of pixels, HIDF utilizes the optical thickness of corresponding pixels. If optical thickness is smaller than a threshold that determines whether the single scattering or the multiple scattering dominates, HIDF applies the SSPM, and HIDF applies the MSPM otherwise. Experimental results on several popular foggy images demonstrate that HIDF competes with the state-of-the-art algorithms, and show the promise of HIDF for defogging heavily foggy images.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115405272","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 : 2014-12-15DOI: 10.1109/SPAC.2014.6982679
Bin Mao, Naiyang Guan, D. Tao, Xuhui Huang, Zhigang Luo
Non-negative matrix factorization (NMF) is an efficient dimension reduction method and plays an important role in many pattern recognition and computer vision tasks. However, conventional NMF methods are not robust since the objective functions are sensitive to outliers and do not consider the geometric structure in datasets. In this paper, we proposed a correntropy graph regularized NMF (CGNMF) to overcome the aforementioned problems. CGNMF maximizes the correntropy between data matrix and its reconstruction to filter out the noises of large magnitudes, and expects the coefficients to preserve the intrinsic geometric structure of data. We also proposed a modified version of our CGNMF which construct the adjacent graph by using sparse representation to enhance its reliability. Experimental results on popular image datasets confirm the effectiveness of CGNMF.
{"title":"Correntropy induced metric based graph regularized non-negative matrix factorization","authors":"Bin Mao, Naiyang Guan, D. Tao, Xuhui Huang, Zhigang Luo","doi":"10.1109/SPAC.2014.6982679","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982679","url":null,"abstract":"Non-negative matrix factorization (NMF) is an efficient dimension reduction method and plays an important role in many pattern recognition and computer vision tasks. However, conventional NMF methods are not robust since the objective functions are sensitive to outliers and do not consider the geometric structure in datasets. In this paper, we proposed a correntropy graph regularized NMF (CGNMF) to overcome the aforementioned problems. CGNMF maximizes the correntropy between data matrix and its reconstruction to filter out the noises of large magnitudes, and expects the coefficients to preserve the intrinsic geometric structure of data. We also proposed a modified version of our CGNMF which construct the adjacent graph by using sparse representation to enhance its reliability. Experimental results on popular image datasets confirm the effectiveness of CGNMF.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115606124","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 : 2014-12-15DOI: 10.1109/SPAC.2014.6982672
Qiang Wang, An Zhang, H. Sun
This paper proposed a method of real-time path planning for UAV based on model predictive control and self adaptive differential evolutionary algorithm First the model of three-dimensional path planning of UAV was built by model predictive control Then the encoding method based on deflection angle was given. The constraints were combined with the self adaptive differential evolutionary algorithm to make the path more rational and the searching more efficiently. The simulation analyses showed that the method of path planning is available and efficient, that could satisfy the requirements of terrain following and threat avoidance.
{"title":"MPC and SADE for UAV real-time path planning in 3D environment","authors":"Qiang Wang, An Zhang, H. Sun","doi":"10.1109/SPAC.2014.6982672","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982672","url":null,"abstract":"This paper proposed a method of real-time path planning for UAV based on model predictive control and self adaptive differential evolutionary algorithm First the model of three-dimensional path planning of UAV was built by model predictive control Then the encoding method based on deflection angle was given. The constraints were combined with the self adaptive differential evolutionary algorithm to make the path more rational and the searching more efficiently. The simulation analyses showed that the method of path planning is available and efficient, that could satisfy the requirements of terrain following and threat avoidance.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126603955","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 : 2014-12-15DOI: 10.1109/SPAC.2014.6982708
Ze Lei, Zhaohui Gan, Min Jiang, Ke Dong
Human-computer interaction is a hot topic in artificial intelligence. Artificial navigation is an interesting application of human-computer interaction, which control the action of the target device by speech or gestures information. The main virtue of artificial navigation is that it can control target device within a distance without any remote control device. This technology can be used in the areas of robot navigation, vehicle navigation in the industrial site and virtual reality. This paper proposed an algorithm for robot navigation which combining gesture recognition with speech recognition. Firstly, use nine gesture instructions and nine voice commands to establish reference models. Secondly, extract real-time Skeleton information and the current speech messages by Kinect. Thirdly, evaluate the fitness of the current gesture and speech information of the reference model. Finally, deduce the navigation control instructions to command the robot's movement. Gestures and speech can compensate for each other's deficiencies, improve the recognition rate and robustness of the algorithm, reduce the computational complexity of algorithm, makes the human-computer interaction more simple, clear and natural.
{"title":"Artificial robot navigation based on gesture and speech recognition","authors":"Ze Lei, Zhaohui Gan, Min Jiang, Ke Dong","doi":"10.1109/SPAC.2014.6982708","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982708","url":null,"abstract":"Human-computer interaction is a hot topic in artificial intelligence. Artificial navigation is an interesting application of human-computer interaction, which control the action of the target device by speech or gestures information. The main virtue of artificial navigation is that it can control target device within a distance without any remote control device. This technology can be used in the areas of robot navigation, vehicle navigation in the industrial site and virtual reality. This paper proposed an algorithm for robot navigation which combining gesture recognition with speech recognition. Firstly, use nine gesture instructions and nine voice commands to establish reference models. Secondly, extract real-time Skeleton information and the current speech messages by Kinect. Thirdly, evaluate the fitness of the current gesture and speech information of the reference model. Finally, deduce the navigation control instructions to command the robot's movement. Gestures and speech can compensate for each other's deficiencies, improve the recognition rate and robustness of the algorithm, reduce the computational complexity of algorithm, makes the human-computer interaction more simple, clear and natural.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122716889","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 : 2014-12-15DOI: 10.1109/SPAC.2014.6982660
Yingyi Liang, Zhenyu He, Yi Li
In this paper, a video vertical search engine is designed and implemented based on the theory of vertical search engine. Firstly, we introduce the vertical search engine and its research situation at home and abroad, analyze the principle of implementing the vertical search engine, and introduce the key technology used in this paper, such as subject information acquisition method, Chinese segmentation algorithm, and the search result re-sorting. We provide the video resource acquisition process and the video resources storage, and repeat video resources exclusion. Then, we analyze an information retrieval tool library, Lucene, which is with a advanced design and superior performance. Based on this library, a Chinese segmentation algorithm and a result sorting method are added. Unlike current other studies, a variable length matching strategy is taken for designing Chinese word with bidirectional matching method for disambiguation. Compared with the latest open source word segmentation algorithm, our segmentation algorithm designed in this paper outperforms better. With the video resources fetching from the internet and the Chinese word segmentation of VKAnalyzer extending from Lucene designed and implemented in the paper, we design related video re-sorting methods by different ways, such as length, times and comments, and implement the sorting method for search results according to users' various requirements. The experiments shows that the recall rate of the search engine is 90% and the accuracy is 97%, as are satisfactory.
{"title":"Design and implementation of one vertical video search engine","authors":"Yingyi Liang, Zhenyu He, Yi Li","doi":"10.1109/SPAC.2014.6982660","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982660","url":null,"abstract":"In this paper, a video vertical search engine is designed and implemented based on the theory of vertical search engine. Firstly, we introduce the vertical search engine and its research situation at home and abroad, analyze the principle of implementing the vertical search engine, and introduce the key technology used in this paper, such as subject information acquisition method, Chinese segmentation algorithm, and the search result re-sorting. We provide the video resource acquisition process and the video resources storage, and repeat video resources exclusion. Then, we analyze an information retrieval tool library, Lucene, which is with a advanced design and superior performance. Based on this library, a Chinese segmentation algorithm and a result sorting method are added. Unlike current other studies, a variable length matching strategy is taken for designing Chinese word with bidirectional matching method for disambiguation. Compared with the latest open source word segmentation algorithm, our segmentation algorithm designed in this paper outperforms better. With the video resources fetching from the internet and the Chinese word segmentation of VKAnalyzer extending from Lucene designed and implemented in the paper, we design related video re-sorting methods by different ways, such as length, times and comments, and implement the sorting method for search results according to users' various requirements. The experiments shows that the recall rate of the search engine is 90% and the accuracy is 97%, as are satisfactory.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114054423","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 : 2014-12-15DOI: 10.1109/SPAC.2014.6982721
Minghua Chen
Based on the research on Vehicle Routing Problems (VRP), vehicle scheduling and operating work can be more rational, which consequently reduces the logistical cost on the condition of meeting the timeliness requirement of emergency logistics. In this paper, we give an analysis of the characteristics of VRP in emergency logistics. According to the practical situations of VRP, an improved genetic algorithm (GA) is proposed and applied to a general mathematical model established for VRP in emergency logistics in this paper. Simulation results show that the algorithm is feasible and effective.
{"title":"Improved genetic algorithm for emergency logistics distribution vehicle routing problems","authors":"Minghua Chen","doi":"10.1109/SPAC.2014.6982721","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982721","url":null,"abstract":"Based on the research on Vehicle Routing Problems (VRP), vehicle scheduling and operating work can be more rational, which consequently reduces the logistical cost on the condition of meeting the timeliness requirement of emergency logistics. In this paper, we give an analysis of the characteristics of VRP in emergency logistics. According to the practical situations of VRP, an improved genetic algorithm (GA) is proposed and applied to a general mathematical model established for VRP in emergency logistics in this paper. Simulation results show that the algorithm is feasible and effective.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134577477","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 : 2014-12-15DOI: 10.1109/SPAC.2014.6982685
Hongli Liu, Weifeng Liu, Dapeng Tao, Yanjiang Wang
With exploiting a small number of labeled images and a large number of unlabeled images, semi-supervised learning has attracted centralized attention in recent years. The representative works are Laplacian and Hessian regularization methods. However, Laplacian method tends to a constant value and poor generalization in the process of classification. Although Hessian energy can properly forecast the data points beyond the range of the domain, its regularizer probably leads to useless results in the process of regression. So the Laplacian-Hessian regression method for image classification is proposed, which can both predict the data points and enhance the stability of Hessian regularizer. To evaluate the Laplacian-Hessian method, Columbia Consumer Video database is employed in the paper. Experimental results demonstrate that the proposed method perform better than Laplacian or Hessian method in the matter of classification and stability.
{"title":"Laplacian-Hessian regularization for semi-supervised classification","authors":"Hongli Liu, Weifeng Liu, Dapeng Tao, Yanjiang Wang","doi":"10.1109/SPAC.2014.6982685","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982685","url":null,"abstract":"With exploiting a small number of labeled images and a large number of unlabeled images, semi-supervised learning has attracted centralized attention in recent years. The representative works are Laplacian and Hessian regularization methods. However, Laplacian method tends to a constant value and poor generalization in the process of classification. Although Hessian energy can properly forecast the data points beyond the range of the domain, its regularizer probably leads to useless results in the process of regression. So the Laplacian-Hessian regression method for image classification is proposed, which can both predict the data points and enhance the stability of Hessian regularizer. To evaluate the Laplacian-Hessian method, Columbia Consumer Video database is employed in the paper. Experimental results demonstrate that the proposed method perform better than Laplacian or Hessian method in the matter of classification and stability.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133963170","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 visual tracker based on phase correlation is always failure, because the response is dirac δ function disturbed by the noise and clutter. Recently, the desired correlated output distribution is adopted in ASEF, which obtains the excellent filtered result. Inspired by the above method, spatial phase correlation is proposed in this paper, which designs the response related with the object spatial position to replace the dirac δ function, which can achieve a robust filter. The phase difference is embedded into the response frequency spectrum to obtain the coarse location of the object. Then the phase saliency is exploited to finely track the object for the excellent performance. To avoid the drifting problem, adaptive template is updated by the peak-sidelobe ratio(PSR), which evaluates the tracking results. Numerical experiments show that the proposed algorithm performs favorably against the state-of-the-art trackers in speed, accuracy and robustness.
{"title":"Robust visual tracking with spatial phase correlation","authors":"Yufei Zha, Lichao Zhang, Yuan Yang, Bing Qin, Hao Li, Huanyu Li","doi":"10.1109/SPAC.2014.6982652","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982652","url":null,"abstract":"The visual tracker based on phase correlation is always failure, because the response is dirac δ function disturbed by the noise and clutter. Recently, the desired correlated output distribution is adopted in ASEF, which obtains the excellent filtered result. Inspired by the above method, spatial phase correlation is proposed in this paper, which designs the response related with the object spatial position to replace the dirac δ function, which can achieve a robust filter. The phase difference is embedded into the response frequency spectrum to obtain the coarse location of the object. Then the phase saliency is exploited to finely track the object for the excellent performance. To avoid the drifting problem, adaptive template is updated by the peak-sidelobe ratio(PSR), which evaluates the tracking results. Numerical experiments show that the proposed algorithm performs favorably against the state-of-the-art trackers in speed, accuracy and robustness.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116370079","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 : 2014-12-15DOI: 10.1109/SPAC.2014.6982707
Hu Mao-Lin
We study the online transportation problem with the sudden traffic congestions where the running time of online vehicles is our optimization objective. We consider an optimal combination of the Greedy Strategy, the Reposition Strategy and the Waiting strategy for the online scheduling of vehicles, as result a Harmonic Strategy with online algorithm model is given in compensation of the disadvantages of the three basic strategy. By analyzing the competitive ratio and competitive performance of the Harmonic Strategy, the result comes clearly to show that the Harmonic Strategy harmonizes well the three strategies and makes some progress towards the competitive performance.
{"title":"The online transportation problem with the sudden traffic congestions","authors":"Hu Mao-Lin","doi":"10.1109/SPAC.2014.6982707","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982707","url":null,"abstract":"We study the online transportation problem with the sudden traffic congestions where the running time of online vehicles is our optimization objective. We consider an optimal combination of the Greedy Strategy, the Reposition Strategy and the Waiting strategy for the online scheduling of vehicles, as result a Harmonic Strategy with online algorithm model is given in compensation of the disadvantages of the three basic strategy. By analyzing the competitive ratio and competitive performance of the Harmonic Strategy, the result comes clearly to show that the Harmonic Strategy harmonizes well the three strategies and makes some progress towards the competitive performance.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123531274","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 : 2014-12-15DOI: 10.1109/SPAC.2014.6982716
Yihui Luo, Shuchu Xiong
A new improved approximate dynamic programming for multi-document summarization is presented. Our proposed algorithm improves the state-of-art approximate dynamic programming algorithm for multi-document summarization in [1]. The improvement of our method is attributed to the adding search in the backward direction at each sequential step of the dynamic programming procedure. The experimental results for multi-document summarization tasks on DUC2002 and DUC2004 data sets validate the effectiveness of our proposed method.
{"title":"An improvement on approximate dynamic programming for multi-document summarization","authors":"Yihui Luo, Shuchu Xiong","doi":"10.1109/SPAC.2014.6982716","DOIUrl":"https://doi.org/10.1109/SPAC.2014.6982716","url":null,"abstract":"A new improved approximate dynamic programming for multi-document summarization is presented. Our proposed algorithm improves the state-of-art approximate dynamic programming algorithm for multi-document summarization in [1]. The improvement of our method is attributed to the adding search in the backward direction at each sequential step of the dynamic programming procedure. The experimental results for multi-document summarization tasks on DUC2002 and DUC2004 data sets validate the effectiveness of our proposed method.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130074223","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
扫码关注我们
求助内容：
应助结果提醒方式：