Pub Date : 2001-10-30DOI: 10.1109/ICCIMA.2001.970507
S. Subramanya, C. Sabharwal
Image compression techniques are necessary for the storage of huge amounts of digital images using reasonable amounts of space, and for their transmission with limited bandwidth. Several techniques such as predictive coding, transform coding, subband coding, wavelet coding, and vector quantization have been used in image coding. While each technique has some advantages, most practical systems use hybrid techniques which incorporate more than one scheme. They combine the advantages of the individual schemes and enhance the coding effectiveness. This paper proposes and evaluates a hybrid coding scheme for images using wavelet transforms and predictive coding. The performance evaluation is done using a variety of different parameters such as kinds of wavelets, decomposition levels, types of quantizers, predictor coefficients, and quantization levels. The results of evaluation are presented.
{"title":"Performance evaluation of hybrid coding of images using wavelet transform and predictive coding","authors":"S. Subramanya, C. Sabharwal","doi":"10.1109/ICCIMA.2001.970507","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970507","url":null,"abstract":"Image compression techniques are necessary for the storage of huge amounts of digital images using reasonable amounts of space, and for their transmission with limited bandwidth. Several techniques such as predictive coding, transform coding, subband coding, wavelet coding, and vector quantization have been used in image coding. While each technique has some advantages, most practical systems use hybrid techniques which incorporate more than one scheme. They combine the advantages of the individual schemes and enhance the coding effectiveness. This paper proposes and evaluates a hybrid coding scheme for images using wavelet transforms and predictive coding. The performance evaluation is done using a variety of different parameters such as kinds of wavelets, decomposition levels, types of quantizers, predictor coefficients, and quantization levels. The results of evaluation are presented.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117175672","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970446
A. Marostica
This paper presents the definition of a filter (i.e., a logical-semiotic detector that produces a cutoff in the amount of distorted information), and an algorithm for a first-order formal framework that would evaluate and check whether grounded formulas which predicates, involved in semiotic trees, are ambiguous terms in economics. A toy example in financial economics illustrates this heuristic-semiotic procedure.
{"title":"A logical-semiotic filtering for economic data","authors":"A. Marostica","doi":"10.1109/ICCIMA.2001.970446","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970446","url":null,"abstract":"This paper presents the definition of a filter (i.e., a logical-semiotic detector that produces a cutoff in the amount of distorted information), and an algorithm for a first-order formal framework that would evaluate and check whether grounded formulas which predicates, involved in semiotic trees, are ambiguous terms in economics. A toy example in financial economics illustrates this heuristic-semiotic procedure.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126221297","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970449
S. Konno, G. Kitagata, T. Suganuma, T. Kinoshitata, K. Sugawara, N. Shiratori
In this paper, we propose anew architecture of the global communication networks, the dynamic networking architecture. The dynamic functions enhance the capabilities of communication networks to deal with various changes detected by human users, applications and networked environment. In this architecture, a new functional layer called flexible network layer (FNL) is introduced between the application layer and the transport layer of the global communication networks. To realize the FNL, we adopt an agent framework to develop and manage various components and related knowledge of agent-based middleware of FNL. We explain the experimental applications of the FNL to discuss the characteristics of the proposed architecture.
{"title":"Dynamic networking: architecture and prototype systems","authors":"S. Konno, G. Kitagata, T. Suganuma, T. Kinoshitata, K. Sugawara, N. Shiratori","doi":"10.1109/ICCIMA.2001.970449","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970449","url":null,"abstract":"In this paper, we propose anew architecture of the global communication networks, the dynamic networking architecture. The dynamic functions enhance the capabilities of communication networks to deal with various changes detected by human users, applications and networked environment. In this architecture, a new functional layer called flexible network layer (FNL) is introduced between the application layer and the transport layer of the global communication networks. To realize the FNL, we adopt an agent framework to develop and manage various components and related knowledge of agent-based middleware of FNL. We explain the experimental applications of the FNL to discuss the characteristics of the proposed architecture.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130470409","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970461
M. Nakatsugawa, Satoshi Kashiwamura, A. Ohuchi, Masahito Yamamoto, Toshikazu Shiba
Polymerase Chain Reaction (PCR) is the most important process in DNA computing. When the concentration of a DNA sequence is too little to investigate, PCR could amplify the sequence with a polymerase. PCR is frequently applied to obtain a result in DNA computing, because the result is generally shown by a little amount of DNA sequence. Therefore, the reliability of PCR must be assured for DNA computing. The authors define the reproducibility of PCR as the reliability. Similarly, the reaction time is defined as a reaction cost, and other parameters are defined as control factors in quality engineering. By adjusting the factors, we improve a PCR performance shown by the reproducibility and reaction cost.
{"title":"Towards a high reliability of the PCR amplification process in DNA computing","authors":"M. Nakatsugawa, Satoshi Kashiwamura, A. Ohuchi, Masahito Yamamoto, Toshikazu Shiba","doi":"10.1109/ICCIMA.2001.970461","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970461","url":null,"abstract":"Polymerase Chain Reaction (PCR) is the most important process in DNA computing. When the concentration of a DNA sequence is too little to investigate, PCR could amplify the sequence with a polymerase. PCR is frequently applied to obtain a result in DNA computing, because the result is generally shown by a little amount of DNA sequence. Therefore, the reliability of PCR must be assured for DNA computing. The authors define the reproducibility of PCR as the reliability. Similarly, the reaction time is defined as a reaction cost, and other parameters are defined as control factors in quality engineering. By adjusting the factors, we improve a PCR performance shown by the reproducibility and reaction cost.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133413187","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970480
B. Kusumoputro, A. Triyanto, M. I. Fanany, W. Jatmiko
The paper describes the application of a neural processing for extracting bispectrum feature of speech data, and the use of probabilistic neural network as a classifier in an automatic speech recognition system. The usually used feature extraction paradigm in the early development of the speech recognition system is power spectrum analysis, however, the recognition rate of this system is not high enough, especially when a Gaussian noise is added to the utterance speech data. In this paper, we developed a speaker identification system using bispectrum feature analysis. To analyse the distribution of the bispectrum data along its two dimensional representation, we developed an adaptive feature extraction mechanism of the bispectrum speech data based on cascade neural network. A cascade configuration of SOFM (Self-Organizing Feature Map) and LVQ (Learning Vector Quantization) is used as an adaptive codebook generation algorithm for determining the feature distribution of the bispectrum speech data. The K-L transformation (K-LT) technique is then used as a preprocessing element before the neural classifier is utilized. This K-LT has shown as an effective procedure for orthogonalization and dimensionality reduction of the codebook vectors generated from bispectrum data. Experimental results show that our system could perform with high recognition rate on the undirected utterance speech, especially when a higher number of codebook vectors are utilized. It is also shown that the use of PNN could increase the recognition rate significantly, even using speech data with additional Gaussian noise.
{"title":"Speaker identification in noisy environment using bispectrum analysis and probabilistic neural network","authors":"B. Kusumoputro, A. Triyanto, M. I. Fanany, W. Jatmiko","doi":"10.1109/ICCIMA.2001.970480","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970480","url":null,"abstract":"The paper describes the application of a neural processing for extracting bispectrum feature of speech data, and the use of probabilistic neural network as a classifier in an automatic speech recognition system. The usually used feature extraction paradigm in the early development of the speech recognition system is power spectrum analysis, however, the recognition rate of this system is not high enough, especially when a Gaussian noise is added to the utterance speech data. In this paper, we developed a speaker identification system using bispectrum feature analysis. To analyse the distribution of the bispectrum data along its two dimensional representation, we developed an adaptive feature extraction mechanism of the bispectrum speech data based on cascade neural network. A cascade configuration of SOFM (Self-Organizing Feature Map) and LVQ (Learning Vector Quantization) is used as an adaptive codebook generation algorithm for determining the feature distribution of the bispectrum speech data. The K-L transformation (K-LT) technique is then used as a preprocessing element before the neural classifier is utilized. This K-LT has shown as an effective procedure for orthogonalization and dimensionality reduction of the codebook vectors generated from bispectrum data. Experimental results show that our system could perform with high recognition rate on the undirected utterance speech, especially when a higher number of codebook vectors are utilized. It is also shown that the use of PNN could increase the recognition rate significantly, even using speech data with additional Gaussian noise.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133667565","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970451
Takeo Takeno, Y. Tsujimura, G. Yamazaki
This paper is concerned with a transportation system in which vehicles deliver a piece of luggage to customers distributed on a service area. An important problem of operating such a system is to determine an assignment of the luggage into each vehicle. Problem to obtain the assignment is called vehicle routing problem (VRP) and it is one of hard combinatorial optimization problems. And VRP is characterized with two properties, geometrical and time structures. The main purpose of this work is to propose an evolution calculation method for VRP. In the method, four search operators that utilize geometrical and time structures are introduced. Numerical experiments for an actual system are presented to examine the method.
{"title":"A single-phase method based on evolution calculation for vehicle routing problem","authors":"Takeo Takeno, Y. Tsujimura, G. Yamazaki","doi":"10.1109/ICCIMA.2001.970451","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970451","url":null,"abstract":"This paper is concerned with a transportation system in which vehicles deliver a piece of luggage to customers distributed on a service area. An important problem of operating such a system is to determine an assignment of the luggage into each vehicle. Problem to obtain the assignment is called vehicle routing problem (VRP) and it is one of hard combinatorial optimization problems. And VRP is characterized with two properties, geometrical and time structures. The main purpose of this work is to propose an evolution calculation method for VRP. In the method, four search operators that utilize geometrical and time structures are introduced. Numerical experiments for an actual system are presented to examine the method.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128374387","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970488
S. Kulkarni, B. Verma
This paper presents an autoassociator neural network for texture feature extraction. Texture features are extracted through the hidden layer of an autoassociator. The Resilient Propagation (RP) algorithm was employed to train the autoassociator with the texture input and output patterns. The performance of the feature extractor was evaluated on Brodatz benchmark database. A detail analysis of the results is included. The results and analysis showed that the autoassociator is capable of extracting texture features better than the other traditional techniques.
{"title":"An autoassociator for automatic texture feature extraction","authors":"S. Kulkarni, B. Verma","doi":"10.1109/ICCIMA.2001.970488","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970488","url":null,"abstract":"This paper presents an autoassociator neural network for texture feature extraction. Texture features are extracted through the hidden layer of an autoassociator. The Resilient Propagation (RP) algorithm was employed to train the autoassociator with the texture input and output patterns. The performance of the feature extractor was evaluated on Brodatz benchmark database. A detail analysis of the results is included. The results and analysis showed that the autoassociator is capable of extracting texture features better than the other traditional techniques.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122977490","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970485
T. Beaubouf, F. Petry
Uncertainty management is necessary for spatial data and GIS applications. This paper focuses on topological relationships and uncertainty in spatial data regions. We discuss the representation of vague regions using the RCC-8 theory and show how rough sets can improve on this methodology through the use of its indiscernibility relation and approximation regions.
{"title":"Vague regions and spatial relationships: a rough set approach","authors":"T. Beaubouf, F. Petry","doi":"10.1109/ICCIMA.2001.970485","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970485","url":null,"abstract":"Uncertainty management is necessary for spatial data and GIS applications. This paper focuses on topological relationships and uncertainty in spatial data regions. We discuss the representation of vague regions using the RCC-8 theory and show how rough sets can improve on this methodology through the use of its indiscernibility relation and approximation regions.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116639116","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970433
Y. Fujiwara
Price fluctuations in speculative market dynamics have interesting statistical properties. Temporal properties include: (i) vanishing autocorrelation of return, (ii) intermittency and long-memory in the magnitude of return called volatility, (iii) self-similarity of volatilities for different time-scales ("volatility cascade"). These properties in a strongly correlated regime from minutes to months are crucial for understanding markets and to control risk. The author briefly reviews how one can characterize the statistical properties of such a non-equilibrium nature. Next, adaptive agent models with opinion-epidemics and speculative bubbles are considered, including T. Lux's (1998) stochastic model. The origin of volatility clustering and cascade might be understood as aggregate behavior of human speculations, and the dynamics might be regarded as a kind of on-off intermittency.
{"title":"Volatility cascade and market dynamics","authors":"Y. Fujiwara","doi":"10.1109/ICCIMA.2001.970433","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970433","url":null,"abstract":"Price fluctuations in speculative market dynamics have interesting statistical properties. Temporal properties include: (i) vanishing autocorrelation of return, (ii) intermittency and long-memory in the magnitude of return called volatility, (iii) self-similarity of volatilities for different time-scales (\"volatility cascade\"). These properties in a strongly correlated regime from minutes to months are crucial for understanding markets and to control risk. The author briefly reviews how one can characterize the statistical properties of such a non-equilibrium nature. Next, adaptive agent models with opinion-epidemics and speculative bubbles are considered, including T. Lux's (1998) stochastic model. The origin of volatility clustering and cascade might be understood as aggregate behavior of human speculations, and the dynamics might be regarded as a kind of on-off intermittency.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133543639","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970469
H. Akimoto, K. Ono, K. Kayama, K. Kawano, M. Yoshida
Nowadays military training needs effective techniques, especially in a country that has fewer opportunities to train the forces using real entities (i.e., Japan). Considering this situation, a virtual training system is one of the solutions to bringing up military skill. The virtual training is based on simulation techniques to cope with varying battle situations. The paper introduces CGF (Computer Generated Forces) which gives trainers varying situations in combat training. In the simulation, CGF acts as a self-adjusting force against the trainer's entity control action, where the entity expresses weapons. A construction of CGF applied simulation is discussed and some examples are introduced.
{"title":"Consideration to computer generated force for defence systems","authors":"H. Akimoto, K. Ono, K. Kayama, K. Kawano, M. Yoshida","doi":"10.1109/ICCIMA.2001.970469","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970469","url":null,"abstract":"Nowadays military training needs effective techniques, especially in a country that has fewer opportunities to train the forces using real entities (i.e., Japan). Considering this situation, a virtual training system is one of the solutions to bringing up military skill. The virtual training is based on simulation techniques to cope with varying battle situations. The paper introduces CGF (Computer Generated Forces) which gives trainers varying situations in combat training. In the simulation, CGF acts as a self-adjusting force against the trainer's entity control action, where the entity expresses weapons. A construction of CGF applied simulation is discussed and some examples are introduced.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115256892","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
扫码关注我们
求助内容：
应助结果提醒方式：