M. Kinishi, T. Okada, M. Hori, Yenwei Chen, Yoshinobu Sato
{"title":"Analysis of Centerline Extraction in Three-Dimensional Scale Space - Extracting Centerline of Vessels in Hepatic Artery","authors":"M. Kinishi, T. Okada, M. Hori, Yenwei Chen, Yoshinobu Sato","doi":"10.1109/ICNC.2009.654","DOIUrl":"https://doi.org/10.1109/ICNC.2009.654","url":null,"abstract":"Recent developments in medical imaging technology have enabled us to acquire high-resolution datasets within a few minutes. It is important for a physician to recognize three-dimensional structure of vessels prior to any vascular treatments. However, extracting this structure is not a simple image processing task. In this paper, we propose an algorithm to extract hepatic artery from CT datasets through exhaustive searching method. The results for both simulated vessels and real datasets are presented. We also compared our method with two other methods regarding centerline extraction of vessels.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132941116","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}
{"title":"Extended Kernel Self-Organizing Map Clustering Algorithm","authors":"Ning Chen, Hongyi Zhang","doi":"10.1109/ICNC.2009.682","DOIUrl":"https://doi.org/10.1109/ICNC.2009.682","url":null,"abstract":"The self-Organizing Map allows to visualize the underlying structure of high dimensional data. However, the original relies on the use of Euclidean distances which often becomes a serious drawback for number of real problems. Donald and others map the data in input space into a high 2-dimension feature space, here SOM algorithm are performed. However, its disadvantage lies in lack of direct descriptions about the clustering’s center and result .In this paper, we extend of SOM, a novel kernel SOM algorithm is proposed from energy function. The idea of kernel Self-Organizing Map is applied to kernel trick. The inner product of the mapping value of the original data in feature space is replaced by a kernel function, the winner neuron and weights of each neuron can be initialized and updated by kernel Euclidean norm in the feature space. This trick resolve the non-liners can’t clustering in the input space and can’t direct descriptions about the clustering’s center and result. In this paper, some data are applied to test KSOM and SOM algorithm,The result of the experiments show KSOM algorithm has better performance than SOM.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132998053","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}
{"title":"A Novel Clustering Method Combining Heuristics and Information Theorem","authors":"Zeng-Shun Zhao, Z. Hou, M. Tan","doi":"10.1109/ICNC.2009.571","DOIUrl":"https://doi.org/10.1109/ICNC.2009.571","url":null,"abstract":"Many data mining tasks require the unsupervised partitioning of a data set into clusters. However, in many case we do not really know any prior knowledge about the clusters, for example, the density or the shape. This paper addresses two major issues associated with conventional competitive learning, namely, sensitivity to initialization and difficulty in determining the number of clusters. Many methods exist for such clustering, but most of then have assumed hyper-ellipsoidal clusters. Many heuristically proposed competitive learning methods and its variants, are somewhat ad hoc without any theoretical support. Under above considerations, we propose an algorithm named as Entropy guided Splitting Competitive Learning (ESCL) in the information theorem framework. Simulations show that minimization of partition entropy can be used to guide the competitive learning process, so to estimate the number and structure of probable data generators.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133370842","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}
Chunhua Jin, Min Huang, Fei Liu, Yong He, Xiaoli Li
{"title":"Estimating Nitrogen Status of Plant by Vis/NIR Spectroscopy and Mathematical Model","authors":"Chunhua Jin, Min Huang, Fei Liu, Yong He, Xiaoli Li","doi":"10.1109/ICNC.2009.490","DOIUrl":"https://doi.org/10.1109/ICNC.2009.490","url":null,"abstract":"This paper investigated the potential of Vis/NIR spectroscopy and chemometrics to estimate N status of plant. Chemometrics was used as Vis/NIR spectroscopy analysis method to establish models to estimate N status of rapeseed and tea plant. In the research of rapeseed plant, a hybrid estimation model, artificial neural network (ANN) combined with partial least square regression (PLS) method, has been developed for diagnosis of nitrogen nutrition of rapeseed plant. 5 optimal PLS principal components were were selected as the input of BP neural network to establish the prediction model. The result showed that the prediction performance was excellent with r=0.95405, and the accuracy of prediction reached 95%. In the research of tea plant, PLS method was used to look for the fingerprint wavelengths (488, 695 and 931 nm). The PLS model for predicting the N status with r=0.908, SEP=0.21 and bias=0.138, showed an excellent prediction performance. Thus, it was concluded that chemometrics was a good tool for the spectroscopic estimation of plant N status based on Vis/NIRS.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133562775","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}
{"title":"A Discrete Particle Swarm Optimization for Solving Multiple Knapsack Problems","authors":"Z. Ren, Jian Wang","doi":"10.1109/ICNC.2009.80","DOIUrl":"https://doi.org/10.1109/ICNC.2009.80","url":null,"abstract":"A new discrete particle swarm optimization (DPSO) is proposed to solve the multiple knapsack problems (MKP). In the DPSO, the position and velocity of the particles are redefined and the rules and athletic equations of algorithm are also renewed. The multiple knapsack problems are 0-1 programming. The 0-1 programming will be transformed to the integer programming. Then we use the DPSO to solve several multiple knapsack problems. The experimental results show that the DPSO algorithm is feasible to solve the multiple knapsack problems, especially effectively to large scale multiple knapsack problems.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132178627","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}
{"title":"Electric Heating Cable Fault Locating System Based on Neural Network","authors":"Bing Li, Yilin Shen, Li Li","doi":"10.1109/ICNC.2009.339","DOIUrl":"https://doi.org/10.1109/ICNC.2009.339","url":null,"abstract":"A new method for electric heating cable fault testing based on BP algorithm was proposed in this paper. The design process of a useful neural network was described and the principle chart of the detecting system was given. Experimental results showed that the method based on the neural network could be used to improve the effectiveness of locating the fault point of the electric heating cable.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132712285","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}
{"title":"Quadratic Form Innovation to Blind Source Separation","authors":"Zhenwei Shi, Zhanxing Zhu, X. Tan, Zhi-guo Jiang","doi":"10.1109/ICNC.2009.328","DOIUrl":"https://doi.org/10.1109/ICNC.2009.328","url":null,"abstract":"This paper proposes a blind source separation (BSS) method based on the quadratic form innovation of original sources, which includes linear predictability and energy (square) predictability as special cases. A simple algorithm is presented by minimizing a loss function of the quadratic form innovation. Simulations by source signals with linear or square temporal autocorrelations verify the efficient implementation of the proposed method.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"12 31","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133205169","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}
{"title":"Optimal Reactive Power Optimization by Ant Colony Search Algorithm","authors":"Ibrahim Oumarou, Daozhuo Jiang, Cao Yijia","doi":"10.1109/ICNC.2009.602","DOIUrl":"https://doi.org/10.1109/ICNC.2009.602","url":null,"abstract":"The paper presents an Ant Colony Search Algorithm(ACSA) for Optimal Reactive Power Optimization and voltage control of power systems. ACSA is a new co-operative agents’ approach, which is inspired by the observation of the behavior of real ant colonies on the topic of ant trial formation and foraging methods. Hence, in the ACSA a set of co-operative agents called “Ants” co-operates to find better solution for Reactive Power Optimization problem. To analyze the efficiency and effectiveness of this search algorithms,the proposed methods is applied to the IEEE 30, 57, 191(practical) test bus system and the results are compared to those of conventional mathematical methods, Genetic Algorithm and Adaptive Genetic Algorithm.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115913700","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}
{"title":"An Immune Algorithm for Optional Selection Problem of Investment Projects","authors":"Qu Bin","doi":"10.1109/ICNC.2009.697","DOIUrl":"https://doi.org/10.1109/ICNC.2009.697","url":null,"abstract":"Firstly, an optional selection problem of investment projects is introduced, and a chance-constrained programming model is set up based on probability measure, where investment outlays, annual net cash flows and bank loans are all considered as stochastic variables. Secondly, an immune clonal selection algorithm is designed based on stochastic simulation to provide a general solution for the proposed optimization model, where stochastic simulation procedure, chromosome code, affinity function and mutation operator are studied. Lastly, an example is provided to illustrate the effectiveness of the model and algorithm in the paper.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124223717","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}
{"title":"A Block Cipher Based on a Hybrid of Chaotic System and Feistel Network","authors":"Jun Peng, Shangzhu Jin, Hailing Liu, Yongguo Liu","doi":"10.1109/ICNC.2009.663","DOIUrl":"https://doi.org/10.1109/ICNC.2009.663","url":null,"abstract":"Based on the hybrid of piecewise linear chaotic map (PWLCM) and Feistel network, a block cipher algorithm with a 128-bit length key is proposed. Within the algorithm, an 8x8 S-Box generated by chaotic map is used to realize the round function F, and PWLCM is employed to determine the input of the S-Boxes. The algorithm operates on 32-bit plaintext blocks through 16 rounds computing. The experiment results and differential and linear cryptanalysis indicate that the proposed cipher has excellent diffusion and confusion properties, and it is very sensitive to the keys and the plaintexts. The inherent properties of chaos will greatly increase the complicated and unpredictability of the ciphertexts. Some future works are also considered in this paper.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124531707","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}