Pub Date : 2009-12-04DOI: 10.1109/CCPR.2009.5343960
Jinglei Liu, Zhenrong Zhang, Wei Zhang
This paper is concerned with optimal coalition structure generation in multi-agent systems. For characteristic function game representations, we propose a branch and bound technique presented in the form of possible bipartite partitions and upper bound of coalition structure value, these techniques can be incorporated into many potential coalition structure generation algorithms. In order to test the effectiveness of our approach, we compare the sequential application of DP (Dynamic Programming) algorithm of Rothkopf with and without the branch and bound technique. Following the multi agent system, we show that for uniform distributions of coalition values, BBDP (Branch and Bound Dynamic Programming) can reduce the number of bipartite partition need to be evaluated. For example, in a system of 21 agents, fewer than 58.2% of bipartite partitions need not to be evaluated in BBDP algorithm than in DP algorithm. Because anytime algorithm is to evaluate all the k part partition, so branch and bound technique, which we proposed will be applied in any kind of anytime in future.
研究了多智能体系统中最优联盟结构的生成问题。对于特征函数博弈表示，我们提出了以可能二部划分和联盟结构值上界形式表示的分支定界技术，这些技术可以被纳入许多潜在的联盟结构生成算法中。为了测试我们的方法的有效性，我们比较了DP(动态规划)的Rothkopf算法的顺序应用有和没有分支定界技术。在多智能体系统中，我们证明了对于联盟值的均匀分布，BBDP (Branch and Bound Dynamic Programming，分支定界动态规划)可以减少需要评估的二部划分的数量。例如，在21个智能体的系统中，BBDP算法不需要评估的二部分区比DP算法少58.2%。由于任意时刻算法是对所有的k部分划分求值，所以我们提出的分支定界技术在未来的任意时刻都可以应用。
{"title":"Optimal Coalition Structure Generation Algorithm with Branch and Bound Technique","authors":"Jinglei Liu, Zhenrong Zhang, Wei Zhang","doi":"10.1109/CCPR.2009.5343960","DOIUrl":"https://doi.org/10.1109/CCPR.2009.5343960","url":null,"abstract":"This paper is concerned with optimal coalition structure generation in multi-agent systems. For characteristic function game representations, we propose a branch and bound technique presented in the form of possible bipartite partitions and upper bound of coalition structure value, these techniques can be incorporated into many potential coalition structure generation algorithms. In order to test the effectiveness of our approach, we compare the sequential application of DP (Dynamic Programming) algorithm of Rothkopf with and without the branch and bound technique. Following the multi agent system, we show that for uniform distributions of coalition values, BBDP (Branch and Bound Dynamic Programming) can reduce the number of bipartite partition need to be evaluated. For example, in a system of 21 agents, fewer than 58.2% of bipartite partitions need not to be evaluated in BBDP algorithm than in DP algorithm. Because anytime algorithm is to evaluate all the k part partition, so branch and bound technique, which we proposed will be applied in any kind of anytime in future.","PeriodicalId":354468,"journal":{"name":"2009 Chinese Conference on Pattern Recognition","volume":"684 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133522940","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-04DOI: 10.1109/CCPR.2009.5344121
Xin Wang, F. Da, Shaoyan Gai
The three-dimensional measurement based on fringe projection technology is a significant method for acquiring objects' shape information and one of its key problems is to get the phase variety. To solve the complex computation and poor precision problems occurring in the phase unwrapping, a new algorithm consisted of temporal and spatial phase unwrapping methods is proposed. By obtaining the distribution of the fringe order from an assistant image, this new algorithm can distinguish the defective area and eliminate the error extension phenomenon deriving from the scan-line method. Experiments show that this algorithm, which could get better precision and save the time, works well in three-dimensional measurement.
{"title":"A Novel Algorithm for Phase Unwrapping Based on Sign Line","authors":"Xin Wang, F. Da, Shaoyan Gai","doi":"10.1109/CCPR.2009.5344121","DOIUrl":"https://doi.org/10.1109/CCPR.2009.5344121","url":null,"abstract":"The three-dimensional measurement based on fringe projection technology is a significant method for acquiring objects' shape information and one of its key problems is to get the phase variety. To solve the complex computation and poor precision problems occurring in the phase unwrapping, a new algorithm consisted of temporal and spatial phase unwrapping methods is proposed. By obtaining the distribution of the fringe order from an assistant image, this new algorithm can distinguish the defective area and eliminate the error extension phenomenon deriving from the scan-line method. Experiments show that this algorithm, which could get better precision and save the time, works well in three-dimensional measurement.","PeriodicalId":354468,"journal":{"name":"2009 Chinese Conference on Pattern Recognition","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133553211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-04DOI: 10.1109/CCPR.2009.5344029
Tao Liu, HongXiang Tian, Jinling Chen, Wenyong Guo
Abstract: Testing by RDE type AE spectrometer for wear metal analysis, the performance of lubricating oil was studied based on Principal Component Analysis and Notability Analysis. Wear particle debris derived from a Diesel engine components, coolant additives and seawater were added into hydraulic oils and diesel engine oils including CD40 and CF40. Thirty-three blend oils were obtained and analyzed by Spectroil M Instrument made in U. S. American which is the most employed method for wear element determination at present. Principal Component Analysis (PCA) was applied to analyzing Ba, P, Zn additive elements in 33 oil samples and clustering oil samples perfectly based on principal component scores. Thus 117 oil routine samples divided into four different lubricating oils A, B, C and D by the same method. Based on Notability Analysis Fe, Cr, Pb, Cu, Al spectrometric oil data from same and different lubricating oils were analyzed. The results indicate that lubricating oils B and D hold the most effective performance of resisting wear with insignificant difference, lubricating oil C takes a second place while lubricating oil A performs worst.
{"title":"Evaluation on the Performance of Lubricating Oil Based on Principal Component Analysis and Notability Analysis","authors":"Tao Liu, HongXiang Tian, Jinling Chen, Wenyong Guo","doi":"10.1109/CCPR.2009.5344029","DOIUrl":"https://doi.org/10.1109/CCPR.2009.5344029","url":null,"abstract":"Abstract: Testing by RDE type AE spectrometer for wear metal analysis, the performance of lubricating oil was studied based on Principal Component Analysis and Notability Analysis. Wear particle debris derived from a Diesel engine components, coolant additives and seawater were added into hydraulic oils and diesel engine oils including CD40 and CF40. Thirty-three blend oils were obtained and analyzed by Spectroil M Instrument made in U. S. American which is the most employed method for wear element determination at present. Principal Component Analysis (PCA) was applied to analyzing Ba, P, Zn additive elements in 33 oil samples and clustering oil samples perfectly based on principal component scores. Thus 117 oil routine samples divided into four different lubricating oils A, B, C and D by the same method. Based on Notability Analysis Fe, Cr, Pb, Cu, Al spectrometric oil data from same and different lubricating oils were analyzed. The results indicate that lubricating oils B and D hold the most effective performance of resisting wear with insignificant difference, lubricating oil C takes a second place while lubricating oil A performs worst.","PeriodicalId":354468,"journal":{"name":"2009 Chinese Conference on Pattern Recognition","volume":"411 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124385287","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-04DOI: 10.1109/CCPR.2009.5344078
N. Zhu, G. Wang, Gaobo Yang, Weiming Dai
Otsu adaptive thresholding is widely used in classic image segmentation. Two-dimensional Otsu thresholding algorithm is regarded as an effective improvement of the original Otsu method. To reduce the high computational complexity of 2D Otsu method, a fast algorithm is proposed based on improved histogram. Two-dimensional histogram is projected onto the diagonal, which forms 1D histgram with obvious peak and valley distribution. Then two-dimensional Otsu method is applied on a line that is vertical to the diagonal to find the optimal threshold. Furthermore, three look-up tables are utlilized to improve the computational speed by eliminating the redundant computation in original two-dimensional Otsu method. Theoretical analysis and experimental simulation show that the proposed approach greatly enhances the speed of thresholding and has better immunity to Salt and Pepper Noise.
{"title":"A Fast 2D Otsu Thresholding Algorithm Based on Improved Histogram","authors":"N. Zhu, G. Wang, Gaobo Yang, Weiming Dai","doi":"10.1109/CCPR.2009.5344078","DOIUrl":"https://doi.org/10.1109/CCPR.2009.5344078","url":null,"abstract":"Otsu adaptive thresholding is widely used in classic image segmentation. Two-dimensional Otsu thresholding algorithm is regarded as an effective improvement of the original Otsu method. To reduce the high computational complexity of 2D Otsu method, a fast algorithm is proposed based on improved histogram. Two-dimensional histogram is projected onto the diagonal, which forms 1D histgram with obvious peak and valley distribution. Then two-dimensional Otsu method is applied on a line that is vertical to the diagonal to find the optimal threshold. Furthermore, three look-up tables are utlilized to improve the computational speed by eliminating the redundant computation in original two-dimensional Otsu method. Theoretical analysis and experimental simulation show that the proposed approach greatly enhances the speed of thresholding and has better immunity to Salt and Pepper Noise.","PeriodicalId":354468,"journal":{"name":"2009 Chinese Conference on Pattern Recognition","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122061721","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-04DOI: 10.1109/CCPR.2009.5344097
Ssu-Han Chen, D. Perng
A new global image restoration scheme using discrete cosine transform (DCT) is proposed in this paper. This DCT-based image restoration scheme can be used for inspecting the defects in directional texture surfaces automatically. The input spatial domain image is first transformed into DCT domain. The dominating directions of the textures in the input image will be compacted to orthogonal straight lines, respectively, throughout the direct current (DC) component in the spectrum. The linear primitives associated with high-energy frequency components in the DCT domain are eliminated by reducing them to zero and then transformed back to the spatial domain. This procedure will have all directional textures be blurred and will preserve only local defects if they are initially embedded in the input image. Experiments on a variety of product surfaces with directional texture such as straight, slant, orthogonal, and slant orthogonal linear primitives are given to demonstrate the effectiveness and robustness of the proposed method.
{"title":"Automatic Surface Inspection for Directional Textures Using Discrete Cosine Transform","authors":"Ssu-Han Chen, D. Perng","doi":"10.1109/CCPR.2009.5344097","DOIUrl":"https://doi.org/10.1109/CCPR.2009.5344097","url":null,"abstract":"A new global image restoration scheme using discrete cosine transform (DCT) is proposed in this paper. This DCT-based image restoration scheme can be used for inspecting the defects in directional texture surfaces automatically. The input spatial domain image is first transformed into DCT domain. The dominating directions of the textures in the input image will be compacted to orthogonal straight lines, respectively, throughout the direct current (DC) component in the spectrum. The linear primitives associated with high-energy frequency components in the DCT domain are eliminated by reducing them to zero and then transformed back to the spatial domain. This procedure will have all directional textures be blurred and will preserve only local defects if they are initially embedded in the input image. Experiments on a variety of product surfaces with directional texture such as straight, slant, orthogonal, and slant orthogonal linear primitives are given to demonstrate the effectiveness and robustness of the proposed method.","PeriodicalId":354468,"journal":{"name":"2009 Chinese Conference on Pattern Recognition","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117140044","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-04DOI: 10.1109/CCPR.2009.5344129
Xinzhu Yang, Bo Yuan, Wenhuang Liu
This paper investigates an interesting question of solving incremental learning problems using ensemble algorithms. The motivation is to help classifiers learn additional information from new batches of data incrementally while preserving previously acquired knowledge. Experimental results show that the proposed dynamic weighting scheme can achieve better performance compared to the fixed weighting scheme on a variety of standard UCI benchmark datasets.
{"title":"Dynamic Weighting Ensembles for Incremental Learning","authors":"Xinzhu Yang, Bo Yuan, Wenhuang Liu","doi":"10.1109/CCPR.2009.5344129","DOIUrl":"https://doi.org/10.1109/CCPR.2009.5344129","url":null,"abstract":"This paper investigates an interesting question of solving incremental learning problems using ensemble algorithms. The motivation is to help classifiers learn additional information from new batches of data incrementally while preserving previously acquired knowledge. Experimental results show that the proposed dynamic weighting scheme can achieve better performance compared to the fixed weighting scheme on a variety of standard UCI benchmark datasets.","PeriodicalId":354468,"journal":{"name":"2009 Chinese Conference on Pattern Recognition","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124461483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-04DOI: 10.1109/CCPR.2009.5344084
Yunyang Yan, Zhibo Guo, Hongyan Wang
Color and its distribution are important features of a flame image. Fire detection based on sequences of images is more suitable for the need in big room or badly environment. A new color model used to detect flame in an image is found. The model is based on the features that were linear transformed from RGB of the image color. Flames in video sequences are detected by using the features of color and its distribution. Experiments show that the fire detection system is able to work well and get high detection rate with a low false positive rate.
{"title":"Fire Detection Based on Feature of Flame Color","authors":"Yunyang Yan, Zhibo Guo, Hongyan Wang","doi":"10.1109/CCPR.2009.5344084","DOIUrl":"https://doi.org/10.1109/CCPR.2009.5344084","url":null,"abstract":"Color and its distribution are important features of a flame image. Fire detection based on sequences of images is more suitable for the need in big room or badly environment. A new color model used to detect flame in an image is found. The model is based on the features that were linear transformed from RGB of the image color. Flames in video sequences are detected by using the features of color and its distribution. Experiments show that the fire detection system is able to work well and get high detection rate with a low false positive rate.","PeriodicalId":354468,"journal":{"name":"2009 Chinese Conference on Pattern Recognition","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124739639","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-04DOI: 10.1109/CCPR.2009.5344046
Jianguo Wang, Wankou Yang, Hui Yan
Non-locality preserving projection (NLPP) is a kind of feature extraction technique based on the characterization of the non-local scatter. Due to NLPP is a linear algorithm in nature, it cannot address nonlinear problem in recognition, so a novel subspace method, called Kernel Non-locality Preserving Projection (KNLPP) discriminant analysis, is proposed for face recognition. Experimental results on two popular benchmark databases, FERET and Yale, demonstrate the effectiveness of the proposed method.
{"title":"Kernel Non-Locality Preserving Projection and Its Application to Face Recognition","authors":"Jianguo Wang, Wankou Yang, Hui Yan","doi":"10.1109/CCPR.2009.5344046","DOIUrl":"https://doi.org/10.1109/CCPR.2009.5344046","url":null,"abstract":"Non-locality preserving projection (NLPP) is a kind of feature extraction technique based on the characterization of the non-local scatter. Due to NLPP is a linear algorithm in nature, it cannot address nonlinear problem in recognition, so a novel subspace method, called Kernel Non-locality Preserving Projection (KNLPP) discriminant analysis, is proposed for face recognition. Experimental results on two popular benchmark databases, FERET and Yale, demonstrate the effectiveness of the proposed method.","PeriodicalId":354468,"journal":{"name":"2009 Chinese Conference on Pattern Recognition","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129764197","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-04DOI: 10.1109/CCPR.2009.5344006
Haiping Ma, Shengdong Lin, Baogen Jin
In order to improve the real time of aircraft engine fault diagnosis, particle swarm optimization (PSO) is applied to select feature parameters of fault monitor. To tackle the slow nature of PSO, an oppositional particle swarm optimization (OPSO) algorithm is presented in this paper. Utilizing the acceleration performance of opposition-based learning (OBL), it employs OBL for population initialization and also for generation updating to accelerate the evolutionary process, improve the searching capability, and shorten the computing time. Also it has some merits including simpleness and easy implement. Through the benchmark functions and feature parameters selection problem, it demonstrates that the proposed algorithm is effective and superior.
{"title":"Oppositional Particle Swarm Optimization Algorithm and Its Application to Fault Monitor","authors":"Haiping Ma, Shengdong Lin, Baogen Jin","doi":"10.1109/CCPR.2009.5344006","DOIUrl":"https://doi.org/10.1109/CCPR.2009.5344006","url":null,"abstract":"In order to improve the real time of aircraft engine fault diagnosis, particle swarm optimization (PSO) is applied to select feature parameters of fault monitor. To tackle the slow nature of PSO, an oppositional particle swarm optimization (OPSO) algorithm is presented in this paper. Utilizing the acceleration performance of opposition-based learning (OBL), it employs OBL for population initialization and also for generation updating to accelerate the evolutionary process, improve the searching capability, and shorten the computing time. Also it has some merits including simpleness and easy implement. Through the benchmark functions and feature parameters selection problem, it demonstrates that the proposed algorithm is effective and superior.","PeriodicalId":354468,"journal":{"name":"2009 Chinese Conference on Pattern Recognition","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130670995","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-04DOI: 10.1109/CCPR.2009.5344064
Xianglin Zeng, Li Li, Xi Li, Weiming Hu
Scene is the semantic unit in video. Video scene segmentation is a difficult task in content based video structure analysis. This paper proposes a new approach for scene boundary detection. We first construct shot content coherence signal using Normalized Cut criterion and then use a heuristic algorithm to detect scene boundary. Because the Normalized Cut criterion simultaneously emphasizes on the inhomogeneity of shots in different scenes and the homogeneity of shots in the same scene, the continuous signal reflects the coherence of shot content well. Experiments on different kinds of video clips demonstrate our approach performs well in scene segmentation.
{"title":"A New Approach for Video Scene Boundary Detection","authors":"Xianglin Zeng, Li Li, Xi Li, Weiming Hu","doi":"10.1109/CCPR.2009.5344064","DOIUrl":"https://doi.org/10.1109/CCPR.2009.5344064","url":null,"abstract":"Scene is the semantic unit in video. Video scene segmentation is a difficult task in content based video structure analysis. This paper proposes a new approach for scene boundary detection. We first construct shot content coherence signal using Normalized Cut criterion and then use a heuristic algorithm to detect scene boundary. Because the Normalized Cut criterion simultaneously emphasizes on the inhomogeneity of shots in different scenes and the homogeneity of shots in the same scene, the continuous signal reflects the coherence of shot content well. Experiments on different kinds of video clips demonstrate our approach performs well in scene segmentation.","PeriodicalId":354468,"journal":{"name":"2009 Chinese Conference on Pattern Recognition","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132406062","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
扫码关注我们
求助内容：
应助结果提醒方式：