Pub Date : 1999-08-22DOI: 10.1109/PACRIM.1999.799509
E. Moyano, P. Gonzalez, L. Orozco-Barbosa, F. Quiles
In this paper, we undertake the development and performance evaluation of a parallel system for the compression of medical images. The system under study consists of a network of workstations running a parallel implementation of a wavelets compression software. Different data distribution and synchronization strategies are evaluated aiming to minimize the system response time. Numerical results of the different strategies under investigation are provided.
{"title":"Experimental study of a parallel wavelets compression system for medical applications","authors":"E. Moyano, P. Gonzalez, L. Orozco-Barbosa, F. Quiles","doi":"10.1109/PACRIM.1999.799509","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799509","url":null,"abstract":"In this paper, we undertake the development and performance evaluation of a parallel system for the compression of medical images. The system under study consists of a network of workstations running a parallel implementation of a wavelets compression software. Different data distribution and synchronization strategies are evaluated aiming to minimize the system response time. Numerical results of the different strategies under investigation are provided.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121797758","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799539
T. Hinamoto, T. Maeda
This paper treats noise reduction in state-space digital filters using high-order error feedback. A technique is developed for obtaining the optimal error feedback coefficients that minimize the variance at the filter output. This is done by minimizing a quadratic form subject to the coefficients of the error feedback being symmetric or antisymmetric. The optimal solution can be characterized in a closed form by applying the Lagrange multiplier method. In an unconstrained case, the optimal error feedback corresponds to a special case of the above optimal solution. Finally, a numerical example is given to illustrate the utility of the proposed technique.
{"title":"Noise reduction in state-space digital filters using high-order error feedback","authors":"T. Hinamoto, T. Maeda","doi":"10.1109/PACRIM.1999.799539","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799539","url":null,"abstract":"This paper treats noise reduction in state-space digital filters using high-order error feedback. A technique is developed for obtaining the optimal error feedback coefficients that minimize the variance at the filter output. This is done by minimizing a quadratic form subject to the coefficients of the error feedback being symmetric or antisymmetric. The optimal solution can be characterized in a closed form by applying the Lagrange multiplier method. In an unconstrained case, the optimal error feedback corresponds to a special case of the above optimal solution. Finally, a numerical example is given to illustrate the utility of the proposed technique.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116742648","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799583
Ke Li, Ju Liu, Luxi Yang, Zhenya He
In this paper we propose a novel digital secure communication scheme based on sporadic coupling chaos synchronization. Compared with a conventional chaos masking method, it has higher noise-resistibility, better security and frequency efficiency, etc. Simulation results illustrate the effectiveness and efficiency of this method. Finally, we analyze factors which affect system ability and give some conclusions.
{"title":"A robust chaotic digital secure communication scheme","authors":"Ke Li, Ju Liu, Luxi Yang, Zhenya He","doi":"10.1109/PACRIM.1999.799583","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799583","url":null,"abstract":"In this paper we propose a novel digital secure communication scheme based on sporadic coupling chaos synchronization. Compared with a conventional chaos masking method, it has higher noise-resistibility, better security and frequency efficiency, etc. Simulation results illustrate the effectiveness and efficiency of this method. Finally, we analyze factors which affect system ability and give some conclusions.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129917340","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799487
Shengli Wu, N. Hamada
To estimate moving objects velocity in an image sequence is useful for a variety of applications, such as computer vision and monitoring systems. An effective way is to approach it in the transform/spatiotemporal mixed domain (MixeD), but it remains a problem how to select several 2-D spatial frequency points in MixeD domain which may influence the accuracy of velocity estimation and object detection. We propose a method to approach the velocity estimation problem by automatically selecting only two appropriate points in 2-D spatial frequency domain, the selection is achieved by using the established evaluation function together with a threshold. The simulation results show that the proposed method is effective on the selection of spatial frequency points.
{"title":"Moving object velocity estimation by appropriately choosing spatial frequencies in the MixeD domain","authors":"Shengli Wu, N. Hamada","doi":"10.1109/PACRIM.1999.799487","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799487","url":null,"abstract":"To estimate moving objects velocity in an image sequence is useful for a variety of applications, such as computer vision and monitoring systems. An effective way is to approach it in the transform/spatiotemporal mixed domain (MixeD), but it remains a problem how to select several 2-D spatial frequency points in MixeD domain which may influence the accuracy of velocity estimation and object detection. We propose a method to approach the velocity estimation problem by automatically selecting only two appropriate points in 2-D spatial frequency domain, the selection is achieved by using the established evaluation function together with a threshold. The simulation results show that the proposed method is effective on the selection of spatial frequency points.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128957243","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799555
N. Matsumoto, S. Yashiki
We examine an intuitive and very simple approach to find a suboptimal solution to TSP. The algorithm consists of the determination of the initial tour, permutation of the consecutive six cities and the deletion of the crossover. We have tested two kinds of algorithm to the examples on the Web site of TSPLIB95. The average ratio of the length of the obtained tour to the optimal length was 1.0464 and 1.0662.
{"title":"Simple approach to TSP by permutation of six cities and deletion of crossover","authors":"N. Matsumoto, S. Yashiki","doi":"10.1109/PACRIM.1999.799555","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799555","url":null,"abstract":"We examine an intuitive and very simple approach to find a suboptimal solution to TSP. The algorithm consists of the determination of the initial tour, permutation of the consecutive six cities and the deletion of the crossover. We have tested two kinds of algorithm to the examples on the Web site of TSPLIB95. The average ratio of the length of the obtained tour to the optimal length was 1.0464 and 1.0662.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129395048","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799537
R. Drechsler, B. Becker
Modern VLSI CAD makes intensively use of core based design and integration of Intellectual Property (IP) to handle the IC design complexity. Several methods for IP integration in today's design flow have been proposed. In this paper we present a new model for verification of designs using IP. We make use of probabilistic algorithms to verify a circuit. Our model allows the IP owners and creators to keep all detailed information about the design, while the designer can probabilistically verify his design.
{"title":"Probabilistic IP verification","authors":"R. Drechsler, B. Becker","doi":"10.1109/PACRIM.1999.799537","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799537","url":null,"abstract":"Modern VLSI CAD makes intensively use of core based design and integration of Intellectual Property (IP) to handle the IC design complexity. Several methods for IP integration in today's design flow have been proposed. In this paper we present a new model for verification of designs using IP. We make use of probabilistic algorithms to verify a circuit. Our model allows the IP owners and creators to keep all detailed information about the design, while the designer can probabilistically verify his design.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115819694","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799476
Y. Nakamura, H. Dekihara
A spatio-temporal data structure, called the PMD-tree (persistent multi-dimensional tree), has been proposed for managing the live intervals and locations of spatial objects. In the paper, novel concepts of time space bounding box (TSBB) and motion list are introduced to the PMD-tree to manage moving spatial objects efficiently. TSBB is an extended bounding box for a moving object that covers the trajectory of the object. As an object moves, a TSBB corresponding to the object is enlarged to enclose the trajectory of the object. A TSBB is divided when it becomes greater than a limit. An object and corresponding TSBBs are managed by a doubly connected linked list, called a motion list. TSBBs are also managed by the PMD-tree. By introducing the concept of TSBB and motion list to the PMD-tree, moving objects can be efficiently managed and quickly found for spatio-temporal queries. By carrying out a series of simulation tests, the storage requirements and search performances are evaluated for several types of moving objects.
{"title":"An efficient management method of moving spatial objects","authors":"Y. Nakamura, H. Dekihara","doi":"10.1109/PACRIM.1999.799476","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799476","url":null,"abstract":"A spatio-temporal data structure, called the PMD-tree (persistent multi-dimensional tree), has been proposed for managing the live intervals and locations of spatial objects. In the paper, novel concepts of time space bounding box (TSBB) and motion list are introduced to the PMD-tree to manage moving spatial objects efficiently. TSBB is an extended bounding box for a moving object that covers the trajectory of the object. As an object moves, a TSBB corresponding to the object is enlarged to enclose the trajectory of the object. A TSBB is divided when it becomes greater than a limit. An object and corresponding TSBBs are managed by a doubly connected linked list, called a motion list. TSBBs are also managed by the PMD-tree. By introducing the concept of TSBB and motion list to the PMD-tree, moving objects can be efficiently managed and quickly found for spatio-temporal queries. By carrying out a series of simulation tests, the storage requirements and search performances are evaluated for several types of moving objects.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127778349","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799463
Lichen Zhang, P. Yuan
In ATM networks, congestion usually results in cell loss. In this paper, an arbiter method for congestion control is proposed. Based on the time limit and priority, the cells that compete for the same output line could be lined according to the character of real-time services. We define /spl Pi//sub ij/ as the transmission probability of a cell to be transmitted from the input line i to the output line j. So each cell can be described clearly and the congestion control arbiters (include internal arbiter and external arbiter) could classify the cells that in competition. Experiments show that this method is effective in improving cell loss rate.
{"title":"Congestion control for ATM real-time service","authors":"Lichen Zhang, P. Yuan","doi":"10.1109/PACRIM.1999.799463","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799463","url":null,"abstract":"In ATM networks, congestion usually results in cell loss. In this paper, an arbiter method for congestion control is proposed. Based on the time limit and priority, the cells that compete for the same output line could be lined according to the character of real-time services. We define /spl Pi//sub ij/ as the transmission probability of a cell to be transmitted from the input line i to the output line j. So each cell can be described clearly and the congestion control arbiters (include internal arbiter and external arbiter) could classify the cells that in competition. Experiments show that this method is effective in improving cell loss rate.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127996993","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 introduce an interactive TV program production system for the coming digital TV era. To realize interactive TV program, we deploy software agents. We model the interactions in DTV and propose a scenario description language which can handle software agents and events. Finally, we implement our prototype system and produce a networked quiz show.
{"title":"Agent enabled scenario language for production of interactive TV program","authors":"Takeshi Shirai, Makoto Takano, Hideo Miyahara, Shunsuke Kodama, Koichi Tajima, Keishi Kandori, Shinji Shimojo","doi":"10.1109/PACRIM.1999.799592","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799592","url":null,"abstract":"We introduce an interactive TV program production system for the coming digital TV era. To realize interactive TV program, we deploy software agents. We model the interactions in DTV and propose a scenario description language which can handle software agents and events. Finally, we implement our prototype system and produce a networked quiz show.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129445287","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 : 1999-08-22DOI: 10.1109/PACRIM.1999.799517
Chi-Chun Lo, Yu-Jen Chen
With the advance of wireless communications technology, mobile communications has become more convenient than ever. However, because of the openness of wireless communications, how to protect the privacy between communication parties is becoming a very important issue. In this paper, we focus on the security of the Global System for Mobile communication (GSM) networks. A secure communication architecture for the GSM network is proposed. In the proposed architecture, we use public-key cryptography for user authentication and a stream cipher for message encryption and decryption. This architecture significantly improves the security of today's GSM networks.
{"title":"A secure communication architecture for GSM networks","authors":"Chi-Chun Lo, Yu-Jen Chen","doi":"10.1109/PACRIM.1999.799517","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799517","url":null,"abstract":"With the advance of wireless communications technology, mobile communications has become more convenient than ever. However, because of the openness of wireless communications, how to protect the privacy between communication parties is becoming a very important issue. In this paper, we focus on the security of the Global System for Mobile communication (GSM) networks. A secure communication architecture for the GSM network is proposed. In the proposed architecture, we use public-key cryptography for user authentication and a stream cipher for message encryption and decryption. This architecture significantly improves the security of today's GSM networks.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133598734","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
扫码关注我们
求助内容：
应助结果提醒方式：