To process an image is to treat the images properly, such as in the applications of image noise reduction. The goal of noise reduction is to reduce the damage to the image detail and blur. Many researches are to determine the content of images from pixels. Some researches focus on reducing the noise by the image classification and estimation. The thresholds of these classification algorithms are always depending on their experimental results, or on the fixed form of filtering method. This paper presents a method of classification and estimation for impulse noise to reduce the damage to the image detail and blur. Firstly, we get the standard deviation as the threshold for each pixel in the image. After that, we compare the center pixel to the neighbor pixels of four directions with vertical and horizontal extent. If the difference is greater than the threshold, we judge the center pixel as a noise. The experimental results show that the proposed algorithm can reduce the erroneous judgment and enhance the performance of image restoration.
{"title":"Classification and Estimation of Image Impulse-Noise Based on Analysis of the Spatial Relations","authors":"Tsong-Yi Chen, Chao-Ho Chen, Ching-Yueh Wang, Da-Jinn Wang, Johng-Chern Chern","doi":"10.1109/IBICA.2011.6","DOIUrl":"https://doi.org/10.1109/IBICA.2011.6","url":null,"abstract":"To process an image is to treat the images properly, such as in the applications of image noise reduction. The goal of noise reduction is to reduce the damage to the image detail and blur. Many researches are to determine the content of images from pixels. Some researches focus on reducing the noise by the image classification and estimation. The thresholds of these classification algorithms are always depending on their experimental results, or on the fixed form of filtering method. This paper presents a method of classification and estimation for impulse noise to reduce the damage to the image detail and blur. Firstly, we get the standard deviation as the threshold for each pixel in the image. After that, we compare the center pixel to the neighbor pixels of four directions with vertical and horizontal extent. If the difference is greater than the threshold, we judge the center pixel as a noise. The experimental results show that the proposed algorithm can reduce the erroneous judgment and enhance the performance of image restoration.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134552416","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}
A cost effective and user-friendly indoor air quality (IAQ) monitoring system based on ZigBee wireless sensor network implemented with the TI CC2430 ZigBee chip is described. In this proposed system, a temperature and relative humidity sensing module and a carbon dioxide sensing module were integrated in each ensor node which was placed in different indoor environment to monitor the IAQ parameters or indoor environment ubiquitously.
{"title":"Design and Implement a Cost Effective and Ubiquitous Air Quality Monitoring System Based on ZigBee Wireless Sensor Network","authors":"C. Tzeng, T. Wey","doi":"10.1109/IBICA.2011.64","DOIUrl":"https://doi.org/10.1109/IBICA.2011.64","url":null,"abstract":"A cost effective and user-friendly indoor air quality (IAQ) monitoring system based on ZigBee wireless sensor network implemented with the TI CC2430 ZigBee chip is described. In this proposed system, a temperature and relative humidity sensing module and a carbon dioxide sensing module were integrated in each ensor node which was placed in different indoor environment to monitor the IAQ parameters or indoor environment ubiquitously.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134235918","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}
Zhong Zhang, Q. Ding, Kefa Liu, H Zhao, Guanjun Liu
Array manifold error is the key factor which influences the performance of DOA algorithm. In ship borne radar, after distance and velocity resolution, the corresponding spatial azimuth of first-order sea echo can be computed. The first-order sea echo on the fixed frequency can be considered as scale source. After array covariance matrix's eigen value decomposition, the vector corresponding to the biggest eigen value can be considered as the actual manifold vector so as to apply DOA algorithm effectively. In ship born radar, through source calibration, the performance of DOA algorithm is enhanced and the inadequacy of compensation from different influencing factors such as the discrepancy of amplitude and phase, and the coupling between array elements are also avoided.
{"title":"Array Manifold Calibration in Shipborne Radar","authors":"Zhong Zhang, Q. Ding, Kefa Liu, H Zhao, Guanjun Liu","doi":"10.1109/IBICA.2011.43","DOIUrl":"https://doi.org/10.1109/IBICA.2011.43","url":null,"abstract":"Array manifold error is the key factor which influences the performance of DOA algorithm. In ship borne radar, after distance and velocity resolution, the corresponding spatial azimuth of first-order sea echo can be computed. The first-order sea echo on the fixed frequency can be considered as scale source. After array covariance matrix's eigen value decomposition, the vector corresponding to the biggest eigen value can be considered as the actual manifold vector so as to apply DOA algorithm effectively. In ship born radar, through source calibration, the performance of DOA algorithm is enhanced and the inadequacy of compensation from different influencing factors such as the discrepancy of amplitude and phase, and the coupling between array elements are also avoided.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134305488","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}
We analyze the application problems of the Primavera software in the overhaul schedule management of nuclear power plant firstly, and then elaborate the research program of nuclear power overhaul multi-project management based on Primavera software in order to address these issues. In this paper, we focus on the implementation of nuclear power overhaul schedule management assistant system based on Primavera software as well as the main components of the system. What's more, we demonstrate the business process of the total solution by the application examples. Finally, we illustrate the program has a good reference and promotion of significance for the domestic nuclear power industry overhaul.
{"title":"The Solution of Nuclear Power Overhaul Multi-project Management Based on Primavera Software","authors":"Yanhua Wu, Shushun Lin, Zheng Zhang","doi":"10.1109/IBICA.2011.71","DOIUrl":"https://doi.org/10.1109/IBICA.2011.71","url":null,"abstract":"We analyze the application problems of the Primavera software in the overhaul schedule management of nuclear power plant firstly, and then elaborate the research program of nuclear power overhaul multi-project management based on Primavera software in order to address these issues. In this paper, we focus on the implementation of nuclear power overhaul schedule management assistant system based on Primavera software as well as the main components of the system. What's more, we demonstrate the business process of the total solution by the application examples. Finally, we illustrate the program has a good reference and promotion of significance for the domestic nuclear power industry overhaul.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130488206","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}
With the integration of heterogeneous network protocols, roaming among different networks becomes feasible. The subjects with most attention are the guaranteed quality of services (QoS) and the handoffs without disconnections. This paper proposes a roaming node encoding algorithm in wireless communications, in order to define nested network nodes, without duplicate encodings, and to rapidly confirm the existence of the surrounding base stations and the amount of their resources. It also proposes four resource reservation methods -- Random Destined, Direction Destined, Walking Path Destined, and Historical Path Destined -- to predict the walking path and provide resource reservation services. To solve the problems of resource waste and low utilization due to resource reservation at mobile nodes, we give each direction a competition weight based on its fan-shaped walking patterns, and through this weight a resource reservation competition is performed. In this way, resource utilization is increased and the goal of QoS-guaranteed roaming provided with path prediction and resource reservation is achieved. The paper also verifies the performance of the proposed methods by means of constructing a simulated environment of Taiwan¡¦s national highways and county highways.
{"title":"Seamless Roaming Architecture","authors":"Yu-Chang Chen, Y. Liao, Po-Ting Chen","doi":"10.1109/IBICA.2011.21","DOIUrl":"https://doi.org/10.1109/IBICA.2011.21","url":null,"abstract":"With the integration of heterogeneous network protocols, roaming among different networks becomes feasible. The subjects with most attention are the guaranteed quality of services (QoS) and the handoffs without disconnections. This paper proposes a roaming node encoding algorithm in wireless communications, in order to define nested network nodes, without duplicate encodings, and to rapidly confirm the existence of the surrounding base stations and the amount of their resources. It also proposes four resource reservation methods -- Random Destined, Direction Destined, Walking Path Destined, and Historical Path Destined -- to predict the walking path and provide resource reservation services. To solve the problems of resource waste and low utilization due to resource reservation at mobile nodes, we give each direction a competition weight based on its fan-shaped walking patterns, and through this weight a resource reservation competition is performed. In this way, resource utilization is increased and the goal of QoS-guaranteed roaming provided with path prediction and resource reservation is achieved. The paper also verifies the performance of the proposed methods by means of constructing a simulated environment of Taiwan¡¦s national highways and county highways.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"342 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124228792","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}
Encoding information using DNA words is an essential part in DNA computing.These DNA words should hybridize only as desired otherwise false negatives and/or false positives may result. Therefore,words should be chosen properly to encode problem instances.Several features affect the hybridization property and some of these are the word content,the free energy,and melting temperature.This paper presents a study of DNA space from which DNA words are chosen for problem solving.A DNA space is the collection of all possible DNA words of a specific length. Full DNA spaces of lengths that range from 5 to 11 and samples of laonger lengths were anglyzed.The analysis focuses on the free energy,melting temperature,entropy,and enthalpy values.The ability of prediciton of these features for large spaces helps researchers estimat the number of good DNA words that might be used for encoding.Results show that the distribution of the free energy approximates a normal distribution.
{"title":"Analyzing Thermodynamics of DNA Spaces","authors":"M. Nuser","doi":"10.1109/IBICA.2011.90","DOIUrl":"https://doi.org/10.1109/IBICA.2011.90","url":null,"abstract":"Encoding information using DNA words is an essential part in DNA computing.These DNA words should hybridize only as desired otherwise false negatives and/or false positives may result. Therefore,words should be chosen properly to encode problem instances.Several features affect the hybridization property and some of these are the word content,the free energy,and melting temperature.This paper presents a study of DNA space from which DNA words are chosen for problem solving.A DNA space is the collection of all possible DNA words of a specific length. Full DNA spaces of lengths that range from 5 to 11 and samples of laonger lengths were anglyzed.The analysis focuses on the free energy,melting temperature,entropy,and enthalpy values.The ability of prediciton of these features for large spaces helps researchers estimat the number of good DNA words that might be used for encoding.Results show that the distribution of the free energy approximates a normal distribution.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127336051","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}
Jian-Hui Chen, W. Tsai, M. Sheu, K. Lin, Ho-En Liao
This paper proposes a new object model and a similarity measure method for particle filter. Based on cluster color histogram concept and similarity measure method, we analyze color ingredient and measure similarity using Euclidean distance, such that our approach can decrease memory consumption and increase processing speed effectively. Furthermore, in order to increase processing speed, we select the candidate particles based on the previous object segmentation. This can reduce the particle amount and speed up tracking operation. Comparing with the existing approaches, the experiments demonstrate that our method has batter performance even when moving objects go across complex scene. The proposed method can run comfortably in real time with 58 frames per second, and 4428 bytes memory consumption in average.
{"title":"Efficient Color-Ingredient Particle Filter for Video Object Tracking","authors":"Jian-Hui Chen, W. Tsai, M. Sheu, K. Lin, Ho-En Liao","doi":"10.1109/IBICA.2011.17","DOIUrl":"https://doi.org/10.1109/IBICA.2011.17","url":null,"abstract":"This paper proposes a new object model and a similarity measure method for particle filter. Based on cluster color histogram concept and similarity measure method, we analyze color ingredient and measure similarity using Euclidean distance, such that our approach can decrease memory consumption and increase processing speed effectively. Furthermore, in order to increase processing speed, we select the candidate particles based on the previous object segmentation. This can reduce the particle amount and speed up tracking operation. Comparing with the existing approaches, the experiments demonstrate that our method has batter performance even when moving objects go across complex scene. The proposed method can run comfortably in real time with 58 frames per second, and 4428 bytes memory consumption in average.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126352843","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}
Chaoli Sun, J. Zeng, S. Chu, J. Roddick, Jeng-Shyang Pan
Constrained optimization problems compose a large part of real-world applications. More and more attentions have gradually been paid to solve this kind of problems. An improved particle swarm optimization (IPSO) algorithm based on feasibility rules is presented in this paper to solve constrained optimization problems. The average velocity of the swarm and the best history position in the particle's neighborhood are introduced as two turbulence factors, which are considered to influence the fly directions of particles, into the algorithm so as not to converge prematurely. The performance of IPSO algorithm is tested on 13 well-known benchmark functions. The experimental results show that the proposed IPSO algorithm is simple, effective and highly competitive.
{"title":"Solving Constrained Optimization Problems by an Improved Particle Swarm Optimization","authors":"Chaoli Sun, J. Zeng, S. Chu, J. Roddick, Jeng-Shyang Pan","doi":"10.1109/IBICA.2011.35","DOIUrl":"https://doi.org/10.1109/IBICA.2011.35","url":null,"abstract":"Constrained optimization problems compose a large part of real-world applications. More and more attentions have gradually been paid to solve this kind of problems. An improved particle swarm optimization (IPSO) algorithm based on feasibility rules is presented in this paper to solve constrained optimization problems. The average velocity of the swarm and the best history position in the particle's neighborhood are introduced as two turbulence factors, which are considered to influence the fly directions of particles, into the algorithm so as not to converge prematurely. The performance of IPSO algorithm is tested on 13 well-known benchmark functions. The experimental results show that the proposed IPSO algorithm is simple, effective and highly competitive.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126420498","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}
Spot detection is an important step in 2D-GE image analysis. The results of Spot detection may substantially influence subsequent stages of gel image analysis. However, in current suggested methods, the detection of spot in complex regions are far from satisfactory. This paper provides an effective method to raise the accuracy of spot detection in complex regions where many protein spots are overlapped. The proposed method firstly employs the Euclidean distance transform to estimate the spot centroids in complex regions and locates new centroids using the geodesic distance measure, then split the spot regions based on geodesic distances according the estimated spot centroids. compared with the existing method, experiments indicated the suggested method has good and efficient performance in the gel detection task.
{"title":"Detection of Spot from Complex Regions Based on Geodesic Distance","authors":"Yu-Han Huang, Cheng-li Sun, Bangshu Xiong","doi":"10.1109/IBICA.2011.27","DOIUrl":"https://doi.org/10.1109/IBICA.2011.27","url":null,"abstract":"Spot detection is an important step in 2D-GE image analysis. The results of Spot detection may substantially influence subsequent stages of gel image analysis. However, in current suggested methods, the detection of spot in complex regions are far from satisfactory. This paper provides an effective method to raise the accuracy of spot detection in complex regions where many protein spots are overlapped. The proposed method firstly employs the Euclidean distance transform to estimate the spot centroids in complex regions and locates new centroids using the geodesic distance measure, then split the spot regions based on geodesic distances according the estimated spot centroids. compared with the existing method, experiments indicated the suggested method has good and efficient performance in the gel detection task.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125373974","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}
A novel subspace learning algorithm named neighborhood discriminant nearest feature line analysis (NDNFLA) is proposed in this paper. NDNFLA aims to find the discriminant feature of samples by maximizing the between-class feature line (FL) distances and minimizing the within-class FL distance. At the same time, theneighborhood is preserved in the feature space. Experimental results demonstrate the efficiency of the proposed algorithm.
{"title":"Neighborhood Discriminant Nearest Feature Line Analysis for Face Recognition","authors":"Lijun Yan, Jeng-Shyang Pan, S. Chu, J. Roddick","doi":"10.1109/IBICA.2011.91","DOIUrl":"https://doi.org/10.1109/IBICA.2011.91","url":null,"abstract":"A novel subspace learning algorithm named neighborhood discriminant nearest feature line analysis (NDNFLA) is proposed in this paper. NDNFLA aims to find the discriminant feature of samples by maximizing the between-class feature line (FL) distances and minimizing the within-class FL distance. At the same time, theneighborhood is preserved in the feature space. Experimental results demonstrate the efficiency of the proposed algorithm.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129099766","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
扫码关注我们
求助内容：
应助结果提醒方式：