In this paper, a new method of image enhancement, which only depends on the difference of grey values of adjacency flat zones of an image, is proposed according to the theory of morphological reconstruction. First of all, a non-idempotent connected operator which can be the criterion for multi-scale enhancement is defined and the criterion is a key to enhancement of an image. Subsequently, the grey values in same the simple connected zones of an image are enhanced overall so the way can keep the immovability of the image contour. At last the connected zones of an image and their relations are described and the way of the multi-scale morphological reconstruction enhancement for an image is implemented by using maximum tree or minimum tree structure. Lots of experimental results indicate that this method can not only stretch the contrast according to the character of gray level of connected zones of an image, but also protect the relations of gray level of connected zones. It’s an effective enhancement method of an image.
{"title":"A new Approach of Image Enhancement Based on Multi-scale Morphological Reconstruction","authors":"Shu Yang, Cairong Wang, Liguo Deng","doi":"10.1109/HIS.2009.30","DOIUrl":"https://doi.org/10.1109/HIS.2009.30","url":null,"abstract":"In this paper, a new method of image enhancement, which only depends on the difference of grey values of adjacency flat zones of an image, is proposed according to the theory of morphological reconstruction. First of all, a non-idempotent connected operator which can be the criterion for multi-scale enhancement is defined and the criterion is a key to enhancement of an image. Subsequently, the grey values in same the simple connected zones of an image are enhanced overall so the way can keep the immovability of the image contour. At last the connected zones of an image and their relations are described and the way of the multi-scale morphological reconstruction enhancement for an image is implemented by using maximum tree or minimum tree structure. Lots of experimental results indicate that this method can not only stretch the contrast according to the character of gray level of connected zones of an image, but also protect the relations of gray level of connected zones. It’s an effective enhancement method of an image.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116425444","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}
Abstract—In the framework of AFS(Axiomatic Fuzzy Sets) theory,We propose A novel weight fuzzy clustering algorithm, which is totally different from the traditional clustering algorithm based approaches. The novel weighted fuzzy clustering algorithm has three main advantages: Firstly, the procedures of the proposed algorithm are more transparent and understandable, and the clustering results not only have definite linguistic interpretation,but also have a weight assigned to each attribute in the cluster description to make the weight’s effect on the clustering reflect the importance of the attribute. Secondly, the predefined distance function and objective function are not required, and the cluster number need not be given in advance. Last, the data types of the features can be various data types or sub-preference relations,even human intuition descriptions. To evaluate the performance of the proposed weighted fuzzy clustering algorithm, we consider three well-known benchmark clustering problems–Iris data,Wine data and Wisconsin diagnostic breast cancer data.
{"title":"A Novel Weighted Fuzzy Clustering Analysis Based on AFS Theory","authors":"Yanli Zhang, Xiaodong Liu, Xueying Wang","doi":"10.1109/HIS.2009.283","DOIUrl":"https://doi.org/10.1109/HIS.2009.283","url":null,"abstract":"Abstract—In the framework of AFS(Axiomatic Fuzzy Sets) theory,We propose A novel weight fuzzy clustering algorithm, which is totally different from the traditional clustering algorithm based approaches. The novel weighted fuzzy clustering algorithm has three main advantages: Firstly, the procedures of the proposed algorithm are more transparent and understandable, and the clustering results not only have definite linguistic interpretation,but also have a weight assigned to each attribute in the cluster description to make the weight’s effect on the clustering reflect the importance of the attribute. Secondly, the predefined distance function and objective function are not required, and the cluster number need not be given in advance. Last, the data types of the features can be various data types or sub-preference relations,even human intuition descriptions. To evaluate the performance of the proposed weighted fuzzy clustering algorithm, we consider three well-known benchmark clustering problems–Iris data,Wine data and Wisconsin diagnostic breast cancer data.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115346777","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}
Robin K. Chou, M. Huang, Jun-Biao Lin, Jen Tsung Hsu
We try to reconcile the findings of prior size effect studies by re-examining the issue with different time periods, regression methods, and database selection. We test whether the size effect varies in relation to the time period, whether extreme observations cause the size effect, by experimenting with different regression methods, and whether the survivorship bias in the COMPUSTAT database induces the size effect. It is found that the size effect is highly significant for data from the earlier time period, but its significance is noticeably reduced for the later time period. Extreme returns cannot fully account for the size effect, because the effect remains strong in the earlier time period even when the extreme observations are trimmed. Finally, we do not find any evidence indicating that the survivorship bias in the COMPUSTAT database is responsible for the size effect.
{"title":"The Consistency of Size Effect: Time Periods, Regression Methods, and Database Selection","authors":"Robin K. Chou, M. Huang, Jun-Biao Lin, Jen Tsung Hsu","doi":"10.1109/HIS.2009.24","DOIUrl":"https://doi.org/10.1109/HIS.2009.24","url":null,"abstract":"We try to reconcile the findings of prior size effect studies by re-examining the issue with different time periods, regression methods, and database selection. We test whether the size effect varies in relation to the time period, whether extreme observations cause the size effect, by experimenting with different regression methods, and whether the survivorship bias in the COMPUSTAT database induces the size effect. It is found that the size effect is highly significant for data from the earlier time period, but its significance is noticeably reduced for the later time period. Extreme returns cannot fully account for the size effect, because the effect remains strong in the earlier time period even when the extreme observations are trimmed. Finally, we do not find any evidence indicating that the survivorship bias in the COMPUSTAT database is responsible for the size effect.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121647929","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 new design of HDB3 encoder / decoder based on FPGA is proposed to deal with the high complexity and long output delay of the encoder and no error correction function of the decoder which have been implemented so far. The encoder has the function of converting a NRZ code sequence to a HDB3 sequence and the decoder, vice versa. Meanwhile the decoder can correct the errors in the received HDB3 sequence according to a certain rule. Synthesis reports show that the encoder and decoder are both simple–structured; Simulation results show that the encoder has a shorter output delay and the decoder has a better function of error detecting and correcting which greatly improves the reliability of the system.
{"title":"A New Design of HDB3 Encoder and Decoder Based on FPGA","authors":"Yang Zhang, Xiumin Wang, Yuduo Wang","doi":"10.1109/HIS.2009.48","DOIUrl":"https://doi.org/10.1109/HIS.2009.48","url":null,"abstract":"A new design of HDB3 encoder / decoder based on FPGA is proposed to deal with the high complexity and long output delay of the encoder and no error correction function of the decoder which have been implemented so far. The encoder has the function of converting a NRZ code sequence to a HDB3 sequence and the decoder, vice versa. Meanwhile the decoder can correct the errors in the received HDB3 sequence according to a certain rule. Synthesis reports show that the encoder and decoder are both simple–structured; Simulation results show that the encoder has a shorter output delay and the decoder has a better function of error detecting and correcting which greatly improves the reliability of the system.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124485682","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}
Singular rough sets is defined by R-element equivalence class, which has dynamic characteristic. By engrafting, crossing, and penetrating between information security theory and singular rough sets, singular rough decision is given, furthermore secure transmission of decision conclusion is also presented in this paper. The fusion and share between singular rough sets and information security theory is a new research direction of the application in information system.
{"title":"Singular Rough Decision and Secure Transmission of Decision Conclusion","authors":"Haiqing Hu, Chong Li, Chunmei Li","doi":"10.1109/HIS.2009.136","DOIUrl":"https://doi.org/10.1109/HIS.2009.136","url":null,"abstract":"Singular rough sets is defined by R-element equivalence class, which has dynamic characteristic. By engrafting, crossing, and penetrating between information security theory and singular rough sets, singular rough decision is given, furthermore secure transmission of decision conclusion is also presented in this paper. The fusion and share between singular rough sets and information security theory is a new research direction of the application in information system.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129233210","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 soybean image noise smoothing method using multi-scale morphology is presented in this paper. The method is based on manipulating the intensity of scale-specific features present in the noisy image. Features at various scales are extracted by means of morphological filtering. The proposed scheme has been implemented by using morphological towers to smooth noise in images. The algorithm has been tested on sample images corrupted with various kinds of noise. The results have been compared with those of other standard methods. It is found that the performance of the proposed method is satisfactory and superior to other methods referred in this paper.
{"title":"A Soybean Image Noise Smoothing Method Using Multi-scale Morphology","authors":"Yuhua Chai, Danting Zhao, Rong Wang","doi":"10.1109/HIS.2009.302","DOIUrl":"https://doi.org/10.1109/HIS.2009.302","url":null,"abstract":"A soybean image noise smoothing method using multi-scale morphology is presented in this paper. The method is based on manipulating the intensity of scale-specific features present in the noisy image. Features at various scales are extracted by means of morphological filtering. The proposed scheme has been implemented by using morphological towers to smooth noise in images. The algorithm has been tested on sample images corrupted with various kinds of noise. The results have been compared with those of other standard methods. It is found that the performance of the proposed method is satisfactory and superior to other methods referred in this paper.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130989557","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 order to users be able to find their own favorite resources quickly and accurately, this paper presents a personalized service which recommends resources for users at massive education resources net. On the basis of analyzing the characteristics of users and resources, this paper discusses the model of resource’s description and user’s interest, and the treatment of user’s interest drift, then designs and describes the personalized service model and implementation. The service is applied to Basic Education Resources Net of Liaoning Province. The effectiveness of such service is proved.
{"title":"Research on Personalized Services for Users of Education Resources Net","authors":"Yongjun Jing, Xin Li, S. Zhong","doi":"10.1109/HIS.2009.253","DOIUrl":"https://doi.org/10.1109/HIS.2009.253","url":null,"abstract":"In order to users be able to find their own favorite resources quickly and accurately, this paper presents a personalized service which recommends resources for users at massive education resources net. On the basis of analyzing the characteristics of users and resources, this paper discusses the model of resource’s description and user’s interest, and the treatment of user’s interest drift, then designs and describes the personalized service model and implementation. The service is applied to Basic Education Resources Net of Liaoning Province. The effectiveness of such service is proved.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131087519","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 JPEG compression method is one of the most popular compression schemes. There are many hardware and software systems based on the JPEG compression standard.This is an indication that the format is still very important before these systems become outdate. This paper presents an adaptive regression method applied to the standard JPEG compression for archiving higher compression ratios. Besides,an interesting coding scheme, Golomb-Rice coding, is introduced also for improve the JPEG standard. Since the coding scheme is not based on frequency analysis from certain of images to gain a codebook, the decoded images that are encoded with this scheme are assured in average quality. The standard JPEG compression scheme can import these two for higher compression rates or wider application fields.
{"title":"An Enhancement of JPEG Still Image Compression with Adaptive Linear Regression and Golomb-Rice Coding","authors":"Chinchen Chang, Y. Lai","doi":"10.1109/HIS.2009.220","DOIUrl":"https://doi.org/10.1109/HIS.2009.220","url":null,"abstract":"The JPEG compression method is one of the most popular compression schemes. There are many hardware and software systems based on the JPEG compression standard.This is an indication that the format is still very important before these systems become outdate. This paper presents an adaptive regression method applied to the standard JPEG compression for archiving higher compression ratios. Besides,an interesting coding scheme, Golomb-Rice coding, is introduced also for improve the JPEG standard. Since the coding scheme is not based on frequency analysis from certain of images to gain a codebook, the decoded images that are encoded with this scheme are assured in average quality. The standard JPEG compression scheme can import these two for higher compression rates or wider application fields.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130593590","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 THz Image edge detection approach based on wavelet and Neural Network is proposed in this paper. First, the source image is decomposed by wavelet, the edges in the low-frequency sub-image are detected using Neural Network method and the edges in the high-frequency sub-images are detected using wavelet transform method on the coarsest level of the wavelet decomposition, the two edge images are fused according to some fusion rules to obtain the edge image of this level, it then is projected to the next level. Afterwards the final edge image of L-1 level is got according to some fusion rule. This process is repeated until reaching the 0 level thus to get the final integrated and clear edge image. The experimental results show that our approach based on fusion technique is superior to Canny operator method and wavelet transform method alone.
{"title":"A THz Image Edge Detection Method Based on Wavelet and Neural Network","authors":"Rong Wang, Lihua Li, Weijun Hong, N. Yang","doi":"10.1109/HIS.2009.298","DOIUrl":"https://doi.org/10.1109/HIS.2009.298","url":null,"abstract":"A THz Image edge detection approach based on wavelet and Neural Network is proposed in this paper. First, the source image is decomposed by wavelet, the edges in the low-frequency sub-image are detected using Neural Network method and the edges in the high-frequency sub-images are detected using wavelet transform method on the coarsest level of the wavelet decomposition, the two edge images are fused according to some fusion rules to obtain the edge image of this level, it then is projected to the next level. Afterwards the final edge image of L-1 level is got according to some fusion rule. This process is repeated until reaching the 0 level thus to get the final integrated and clear edge image. The experimental results show that our approach based on fusion technique is superior to Canny operator method and wavelet transform method alone.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127894681","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}
Alignment particle swarm optimization (APSO) is a novel variant of particle swarm optimization aiming to improve the population diversity. The topology structure of APSO is gbest model. Since the small-world model is more suit for the natural animal communication network, in this paper, it is incorporated into the methodology of APSO to further improve the performance. Simulation results show this strategy may provide well balance between exploration and exploitation capabilities.
{"title":"Using Small-World Model to Improve the Performance of Alignment Particle Swarm Optimization","authors":"Xingjuan Cai","doi":"10.1109/HIS.2009.81","DOIUrl":"https://doi.org/10.1109/HIS.2009.81","url":null,"abstract":"Alignment particle swarm optimization (APSO) is a novel variant of particle swarm optimization aiming to improve the population diversity. The topology structure of APSO is gbest model. Since the small-world model is more suit for the natural animal communication network, in this paper, it is incorporated into the methodology of APSO to further improve the performance. Simulation results show this strategy may provide well balance between exploration and exploitation capabilities.","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123189075","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
扫码关注我们
求助内容：
应助结果提醒方式：