Shuying Zhao, Dan Zhang, Xiangman Song, Wenjun Tan
For hippocampus of MRI demonstrating the low contrast, low signal to noise ratio(SNR), boundary discrete, intensity in homogeneities features, this paper proposed an improved level set model that based on regional and edge information. Refer to the intensity in homogeneities image, the global image information of external energy item is joined, to optimize the segmentation result, adopt edge information that is extracted by wavelet, which is used as an edge constraint stop item. Experimental results of many times segmentation of the hippocampus of MRI image show that this algorithm can precisely segment intensity in homogeneities image and improve the segmentation speed, so this algorithm can be applied to the complex structure segmentation, such as the hippocampus.
{"title":"Segmentation of Hippocampus in MRI Images Based on the Improved Level Set","authors":"Shuying Zhao, Dan Zhang, Xiangman Song, Wenjun Tan","doi":"10.1109/ISCID.2011.39","DOIUrl":"https://doi.org/10.1109/ISCID.2011.39","url":null,"abstract":"For hippocampus of MRI demonstrating the low contrast, low signal to noise ratio(SNR), boundary discrete, intensity in homogeneities features, this paper proposed an improved level set model that based on regional and edge information. Refer to the intensity in homogeneities image, the global image information of external energy item is joined, to optimize the segmentation result, adopt edge information that is extracted by wavelet, which is used as an edge constraint stop item. Experimental results of many times segmentation of the hippocampus of MRI image show that this algorithm can precisely segment intensity in homogeneities image and improve the segmentation speed, so this algorithm can be applied to the complex structure segmentation, such as the hippocampus.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124857565","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, an efficient feature extraction method based on the discrete contour let transform using fast independent component analysis (FastICA) and the angle similarity coefficient(cosine) as the distance measure is proposed. Firstly, each face is decomposed using the contour let transform. The contour let coefficients of low and high frequency in different scales and various angles are obtained. The frequency coefficients are used as a feature vector for further processing. Secondly, considering the specificity of face images, we adopt the FastICA algorithm based on negentropy to extract the face feature information. Finally, we according to the distance to classify face feature. Experiments are carried out using the ORL databases. Preliminary experimental results show that the recognition rate and robustness of the proposed algorithm is acceptable and very promising, and confirm the success of the proposed face feature extraction approach.
{"title":"An Efficient Method for Face Feature Extraction Based on Contourlet Transform and Fast Independent Component Analysis","authors":"Baozhu Wang, Qian Yang, Cuixiang Liu, Meiqiao Cui","doi":"10.1109/ISCID.2011.93","DOIUrl":"https://doi.org/10.1109/ISCID.2011.93","url":null,"abstract":"In this paper, an efficient feature extraction method based on the discrete contour let transform using fast independent component analysis (FastICA) and the angle similarity coefficient(cosine) as the distance measure is proposed. Firstly, each face is decomposed using the contour let transform. The contour let coefficients of low and high frequency in different scales and various angles are obtained. The frequency coefficients are used as a feature vector for further processing. Secondly, considering the specificity of face images, we adopt the FastICA algorithm based on negentropy to extract the face feature information. Finally, we according to the distance to classify face feature. Experiments are carried out using the ORL databases. Preliminary experimental results show that the recognition rate and robustness of the proposed algorithm is acceptable and very promising, and confirm the success of the proposed face feature extraction approach.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125154782","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we present an association rule-based bilateral multi-issue negotiation model which uses association rules to describe the interdependence of issues. Moreover, we propose a novel time-dependent negotiation strategy which based on association rules. In the negotiation process, agent can adjust the associated issues' value intervals and negotiation time dynamically according to the corresponding association rules, thus reducing the number of interactions appropriately to improve the flexibility and efficiency of negotiation process. The experimental results show that the model can improve the overall utility and efficiency.
{"title":"An Association Rule-Based Bilateral Multi-Issue Negotiation Model","authors":"Jun Hu, Lei Deng","doi":"10.1109/ISCID.2011.160","DOIUrl":"https://doi.org/10.1109/ISCID.2011.160","url":null,"abstract":"In this paper, we present an association rule-based bilateral multi-issue negotiation model which uses association rules to describe the interdependence of issues. Moreover, we propose a novel time-dependent negotiation strategy which based on association rules. In the negotiation process, agent can adjust the associated issues' value intervals and negotiation time dynamically according to the corresponding association rules, thus reducing the number of interactions appropriately to improve the flexibility and efficiency of negotiation process. The experimental results show that the model can improve the overall utility and efficiency.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124392859","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 aesthetic aspect plays a crucial role in human choice, thus studies dealing with subjective (called kansei in Japanese) evaluation and decision support by focusing on customers' psychological needs and personal taste became very essential. The purpose of the study is to illustrate two similar aggregation methods for multi-criteria analysis of a problem characterized by attributes of heterogeneous types which could be numerical, categorical, or descriptive, respectively. In this specific issue of supporting choice from a given set of traditional crafts in Japan, we are dealing with kansei attributes and kansei data (values of attributes) rather than the normal ones. Our primary purpose is to develop a web-based interactive system to support salesman in a shop or to support internet based selling by recognizing and proposing alternatives which fit the preferences of customers.
{"title":"Kansei Feature Analysis for Traditional Crafts","authors":"Hongli Ju, Y. Nakamori","doi":"10.1109/ISCID.2011.125","DOIUrl":"https://doi.org/10.1109/ISCID.2011.125","url":null,"abstract":"The aesthetic aspect plays a crucial role in human choice, thus studies dealing with subjective (called kansei in Japanese) evaluation and decision support by focusing on customers' psychological needs and personal taste became very essential. The purpose of the study is to illustrate two similar aggregation methods for multi-criteria analysis of a problem characterized by attributes of heterogeneous types which could be numerical, categorical, or descriptive, respectively. In this specific issue of supporting choice from a given set of traditional crafts in Japan, we are dealing with kansei attributes and kansei data (values of attributes) rather than the normal ones. Our primary purpose is to develop a web-based interactive system to support salesman in a shop or to support internet based selling by recognizing and proposing alternatives which fit the preferences of customers.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131541168","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}
particle filter is a probabilistic multi-hypothesis algorithm under the Bayesian framework. In order to establish a robust observing model, in this paper, a novel method which uses a more effective color feature with contour information integrated adaptively is proposed. Experimental results verified that, our approach was efficient.
{"title":"Particle Filter Based on Color Feature with Contour Information Adaptively Integrated for Object Tracking","authors":"Bing Pu, F. Zhou, X. Bai","doi":"10.1109/ISCID.2011.192","DOIUrl":"https://doi.org/10.1109/ISCID.2011.192","url":null,"abstract":"particle filter is a probabilistic multi-hypothesis algorithm under the Bayesian framework. In order to establish a robust observing model, in this paper, a novel method which uses a more effective color feature with contour information integrated adaptively is proposed. Experimental results verified that, our approach was efficient.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129919187","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 rapid increase of flight flow and density has caused serious congestions and potential operation risks for busy airport, so how to avoid the aircraft taxiing conflicts of airport surface management system is a urgent problem to be solved. In this paper, the aircraft taxi path optimization model with three kinds of conflict constraints is presented to solve the aircraft safe taxiing problems by using the ant colony algorithm. Unlike the re-routing strategy of conflict resolution in our previous works, the waiting strategy is applied in the improved ant colony algorithm. The simulations are made by using the realistic data of Chengdu Shuangliu airport and an illustrative example is given to show the superiority of waiting strategy of conflict resolution.
{"title":"Aircraft Taxi Path Optimization Based on Ant Colony Algorithm","authors":"Changyou Liu, Yongcheng Wang","doi":"10.1109/ISCID.2011.158","DOIUrl":"https://doi.org/10.1109/ISCID.2011.158","url":null,"abstract":"The rapid increase of flight flow and density has caused serious congestions and potential operation risks for busy airport, so how to avoid the aircraft taxiing conflicts of airport surface management system is a urgent problem to be solved. In this paper, the aircraft taxi path optimization model with three kinds of conflict constraints is presented to solve the aircraft safe taxiing problems by using the ant colony algorithm. Unlike the re-routing strategy of conflict resolution in our previous works, the waiting strategy is applied in the improved ant colony algorithm. The simulations are made by using the realistic data of Chengdu Shuangliu airport and an illustrative example is given to show the superiority of waiting strategy of conflict resolution.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133975315","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}
Designing software to connect a relational database in an object-oriented business system is a tedious task. This paper proposed a data access framework based on design patterns, analyzed the Template Pattern, Proxy Pattern, and Factory patterns in the application of data access framework layer, encapsulated the underlying data access through the variable mechanism independently which kept independence of the object model And the relational database. Similarly, system increased greatly the efficiency of data access through buffer mechanisms.
{"title":"Research and Implementation of Data Access Framework Based on Design Patterns","authors":"Xia Sun, Chang Yao","doi":"10.1109/ISCID.2011.49","DOIUrl":"https://doi.org/10.1109/ISCID.2011.49","url":null,"abstract":"Designing software to connect a relational database in an object-oriented business system is a tedious task. This paper proposed a data access framework based on design patterns, analyzed the Template Pattern, Proxy Pattern, and Factory patterns in the application of data access framework layer, encapsulated the underlying data access through the variable mechanism independently which kept independence of the object model And the relational database. Similarly, system increased greatly the efficiency of data access through buffer mechanisms.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131105785","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, a spectral clustering ensemble algorithm based on synthetic similarity (SCEBSS) is proposed to improve the performance of clustering. Multiple methods of vector similarity measurement are adopted to produce diverse similarity matrices of objects. Every similarity matrix is given a weight and then added as a synthetic similarity matrix. A spectral clustering algorithm is employed on the synthetic similarity matrix, and then a particle swarm optimization using normalized mutual information (NMI) as evaluation function is adopted to optimize the weights of similarity matrices to obtain the best clusters. Comparisons with other related clustering schemes demonstrate the better performance of SCEBSS in clustering data tasks and robustness to noise.
{"title":"Spectral Clustering Ensemble Based on Synthetic Similarity","authors":"Tong Zhang, Binghan Liu","doi":"10.1109/ISCID.2011.165","DOIUrl":"https://doi.org/10.1109/ISCID.2011.165","url":null,"abstract":"In this paper, a spectral clustering ensemble algorithm based on synthetic similarity (SCEBSS) is proposed to improve the performance of clustering. Multiple methods of vector similarity measurement are adopted to produce diverse similarity matrices of objects. Every similarity matrix is given a weight and then added as a synthetic similarity matrix. A spectral clustering algorithm is employed on the synthetic similarity matrix, and then a particle swarm optimization using normalized mutual information (NMI) as evaluation function is adopted to optimize the weights of similarity matrices to obtain the best clusters. Comparisons with other related clustering schemes demonstrate the better performance of SCEBSS in clustering data tasks and robustness to noise.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133387089","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}
OpenGL is a commonly used modeling tool in the virtual scene modeling. However, OpenGL graphics library does not provide advanced modeling commands, in this case, it is difficult to create complicated scene models and the models which it created are less realistic. The professional three-dimensional modeling software has strong modeling capabilities, modeling vivid, but it can not meet the interoperability requirements. Through research proposed to use the 3dsMAX to create complex three-dimensional models and export the models created in 3ds file format, then import the models into OpenGL program for interactive controlling and rendering, and accomplish the creation of the virtual scene together. In Visual C++6.0 environment, this method has been used to create a virtual classroom and implemented roaming. It achieved very good results.
OpenGL是虚拟场景建模中常用的建模工具。然而，OpenGL图形库没有提供高级的建模命令，在这种情况下，很难创建复杂的场景模型，并且它创建的模型不太真实。专业的三维建模软件建模能力强，建模逼真，但不能满足互操作性要求。通过研究提出利用3dsMAX创建复杂的三维模型，并将以3ds文件格式创建的模型导出，再将模型导入OpenGL程序进行交互控制和渲染，共同完成虚拟场景的创建。在Visual c++ 6.0环境下，利用该方法创建了虚拟教室并实现了漫游。它取得了很好的效果。
{"title":"Virtual Scene Modeling Technology Based on OpenGL and 3dsMAX","authors":"Zhanwei Wu, Heng Wang, Hua Zhang","doi":"10.1109/ISCID.2011.144","DOIUrl":"https://doi.org/10.1109/ISCID.2011.144","url":null,"abstract":"OpenGL is a commonly used modeling tool in the virtual scene modeling. However, OpenGL graphics library does not provide advanced modeling commands, in this case, it is difficult to create complicated scene models and the models which it created are less realistic. The professional three-dimensional modeling software has strong modeling capabilities, modeling vivid, but it can not meet the interoperability requirements. Through research proposed to use the 3dsMAX to create complex three-dimensional models and export the models created in 3ds file format, then import the models into OpenGL program for interactive controlling and rendering, and accomplish the creation of the virtual scene together. In Visual C++6.0 environment, this method has been used to create a virtual classroom and implemented roaming. It achieved very good results.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"515 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132525451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
As the potential hazards that the data stored in USB storage devices is very easily been stolen between transmission, one kind of USB filter driver based on WDM device model is proposed, which is loading kernel driver between disk driver and USB devices driver. Experimental results show that the filter driver can implement transparent encryption and decryption with all sectors.
{"title":"Design and Implementation of Encryption Filter Driver for USB Storage Devices","authors":"Yamin Li, Lin Shi","doi":"10.1109/ISCID.2011.96","DOIUrl":"https://doi.org/10.1109/ISCID.2011.96","url":null,"abstract":"As the potential hazards that the data stored in USB storage devices is very easily been stolen between transmission, one kind of USB filter driver based on WDM device model is proposed, which is loading kernel driver between disk driver and USB devices driver. Experimental results show that the filter driver can implement transparent encryption and decryption with all sectors.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115151431","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
扫码关注我们
求助内容：
应助结果提醒方式：