Pub Date : 1997-09-09DOI: 10.1109/ICICS.1997.647107
S. Cucchi, D. Grechi
Block motion estimation using exhaustive search is computationally intensive. Most of the proposed strategies reduce the algorithm complexity by limiting the number of locations searched or by pixel and motion-field sub-sampling. This is done at the expense of the accuracy of the estimation and without a substantial reduction of the computational cost. A new algorithm based on the features representation of the luminance and chrominance pixels values using integral projection is proposed. The used search strategy has the same performance of the classical exhaustive search with a computation reduction of a factor of 30. In the presented implementation a six-step fast search procedure select a small set of blocks on which exhaustive search is applied to compute the final motion vector. The presented algorithm takes advantage of a statistical partitioning of the search set, in order to progressively reduce the number of matching. A direct comparison in terms of the performance/complexity is reported with respect to other proposed solutions.
{"title":"A new features-based fast algorithm for motion estimation: decimated integral projection (DIP)","authors":"S. Cucchi, D. Grechi","doi":"10.1109/ICICS.1997.647107","DOIUrl":"https://doi.org/10.1109/ICICS.1997.647107","url":null,"abstract":"Block motion estimation using exhaustive search is computationally intensive. Most of the proposed strategies reduce the algorithm complexity by limiting the number of locations searched or by pixel and motion-field sub-sampling. This is done at the expense of the accuracy of the estimation and without a substantial reduction of the computational cost. A new algorithm based on the features representation of the luminance and chrominance pixels values using integral projection is proposed. The used search strategy has the same performance of the classical exhaustive search with a computation reduction of a factor of 30. In the presented implementation a six-step fast search procedure select a small set of blocks on which exhaustive search is applied to compute the final motion vector. The presented algorithm takes advantage of a statistical partitioning of the search set, in order to progressively reduce the number of matching. A direct comparison in terms of the performance/complexity is reported with respect to other proposed solutions.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"67 1","pages":"297-300 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86484550","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 : 1997-09-09DOI: 10.1109/ICICS.1997.647144
K. Nguyen-Phi, H. Weinrichter
We present a new image compression coder based on the discrete wavelet transform (DWT). We propose a new method to code the quantized wavelet coefficients. This way of coding exploits both the sparseness and the self-similarity amongst the subbands. By using contextual coding and a binary arithmetic coder, the statistics of the coefficients is automatically captured. The system is completely adaptive. It is also simple, fast and of low complexity. The proposed system is shown to have good performance, competitive with other more complicated methods. On Lena 512/spl times/512, a compression ratio (CR) of 103 can be attained with peak signal over noise ratio (PSNR) of 28.9 dB.
{"title":"A fast wavelet image coder based on contextual coefficient coding","authors":"K. Nguyen-Phi, H. Weinrichter","doi":"10.1109/ICICS.1997.647144","DOIUrl":"https://doi.org/10.1109/ICICS.1997.647144","url":null,"abstract":"We present a new image compression coder based on the discrete wavelet transform (DWT). We propose a new method to code the quantized wavelet coefficients. This way of coding exploits both the sparseness and the self-similarity amongst the subbands. By using contextual coding and a binary arithmetic coder, the statistics of the coefficients is automatically captured. The system is completely adaptive. It is also simple, fast and of low complexity. The proposed system is shown to have good performance, competitive with other more complicated methods. On Lena 512/spl times/512, a compression ratio (CR) of 103 can be attained with peak signal over noise ratio (PSNR) of 28.9 dB.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"80 1","pages":"480-484 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83840716","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 : 1997-09-09DOI: 10.1109/ICICS.1997.652185
Kyongho Han, H. Nam
The design of the maximum number of serial test vectors is proposed for the detection of the short circuit faults of the interconnect wires. The interconnect wires of the circuit board is reconfigured and mapped into several net groups, which are electrically independent from each other. The short circuit faults between the independent net groups generate the responses which is the result of wired-OR or wired-AND operation of the applied test vector sets to the net groups. The test vector is self-detectable if the responses from the faulty net group are different from any set of the applied test vector sets and the short circuit faults are detected by observing the response of the circuit. For the self-detectable vector sets, the previous methods showed the reduced the number of the test vector set. We proposed the maximum number of self-detectable test vector sets and compared with the previous test vector sets.
{"title":"Self-detectable serial test vector for short circuit fault detection","authors":"Kyongho Han, H. Nam","doi":"10.1109/ICICS.1997.652185","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652185","url":null,"abstract":"The design of the maximum number of serial test vectors is proposed for the detection of the short circuit faults of the interconnect wires. The interconnect wires of the circuit board is reconfigured and mapped into several net groups, which are electrically independent from each other. The short circuit faults between the independent net groups generate the responses which is the result of wired-OR or wired-AND operation of the applied test vector sets to the net groups. The test vector is self-detectable if the responses from the faulty net group are different from any set of the applied test vector sets and the short circuit faults are detected by observing the response of the circuit. For the self-detectable vector sets, the previous methods showed the reduced the number of the test vector set. We proposed the maximum number of self-detectable test vector sets and compared with the previous test vector sets.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"16 1","pages":"1253-1256 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88917993","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 : 1997-09-09DOI: 10.1109/ICICS.1997.652267
C.W. Ang, C. See, A. Kot
This paper is concerned with the optimization of array geometry using genetic algorithms as the optimization tool. Recent advances in array processing have been focused on developing high resolution algorithms for estimating signal parameters. The problem of optimal design of the array geometry has been neglected and therefore addressed in this paper. An optimal array geometry will correspond to one with the lowest Cramer-Rao bound (CRB) and which gives rise to minimal ambiguities at low SNR. An approach using genetic algorithms (GA) to minimise the CRB, subjected to the ambiguity constraint is proposed and implemented. By utilizing the parallel search capability of the GA, this approach constitutes an efficient design tool for the design of an array of any size and configuration. An alternative using simulated annealing is also proposed. Both approaches are shown to produce optimum array geometries that are superior to the conventional circular array in terms of accuracy and identifiability.
{"title":"Optimization of array geometry for identifiable high resolution parameter estimation in sensor array signal processing","authors":"C.W. Ang, C. See, A. Kot","doi":"10.1109/ICICS.1997.652267","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652267","url":null,"abstract":"This paper is concerned with the optimization of array geometry using genetic algorithms as the optimization tool. Recent advances in array processing have been focused on developing high resolution algorithms for estimating signal parameters. The problem of optimal design of the array geometry has been neglected and therefore addressed in this paper. An optimal array geometry will correspond to one with the lowest Cramer-Rao bound (CRB) and which gives rise to minimal ambiguities at low SNR. An approach using genetic algorithms (GA) to minimise the CRB, subjected to the ambiguity constraint is proposed and implemented. By utilizing the parallel search capability of the GA, this approach constitutes an efficient design tool for the design of an array of any size and configuration. An alternative using simulated annealing is also proposed. Both approaches are shown to produce optimum array geometries that are superior to the conventional circular array in terms of accuracy and identifiability.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"221 1","pages":"1613-1617 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89135321","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 : 1997-09-09DOI: 10.1109/ICICS.1997.653155
H. Beadle, Gerald Q. Maguire, Mark T. Smith
We are investigating the use of badge based wearable computers to create highly mobile location and environment aware systems. When coupled to intelligent servers the badges provide an unparalleled platform for human centred information environments. This paper describes the architecture of the badge, its distributed computing environment, and presents initial results of application development trials conducted by a class of telecommunications students at KTH.
{"title":"Using location and environment awareness in mobile communications","authors":"H. Beadle, Gerald Q. Maguire, Mark T. Smith","doi":"10.1109/ICICS.1997.653155","DOIUrl":"https://doi.org/10.1109/ICICS.1997.653155","url":null,"abstract":"We are investigating the use of badge based wearable computers to create highly mobile location and environment aware systems. When coupled to intelligent servers the badges provide an unparalleled platform for human centred information environments. This paper describes the architecture of the badge, its distributed computing environment, and presents initial results of application development trials conducted by a class of telecommunications students at KTH.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"47 1","pages":"1781-1785 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83752610","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 : 1997-09-09DOI: 10.1109/ICICS.1997.652117
K. Warendorf, W. J. Hsu, P. Y. Seah
Visual language (VL) is a programming language without textual codes and algorithm animation (AA) is about visualizing a computer algorithm. Visual programming (VP) and AA are traditionally separate factions in software visualization (SV). With the atomic reaction model (ARM) project we have bridged these two major branches in SV. Due to the advancements in graphics technology, many developers have come up with graphical applications that claim to be VLs. We see in this diversity of VP systems two main categories of VLs. They are the application specific and the general programming (GP). GPVLs are be developed with the eventual aim of substituting textual programming. Currently, there are two main approaches: graphical rewrite systems and dataflow VLs. AA systems have up to this point of time used the approach pioneered by the BALSA AA system to animate algorithms. Opsis, a Java applet for teaching binary tree algorithms, has shown that the visual approach to AA is more effective as a learning tool. Therefore in this project, we create a VP system that can animate most of the algorithms traditionally done by textual coding. The ARM offered an alternative to the textual codes used in BALSA systems. We have also proven that a VL is capable of solving complex problems without sacrificing its visual clarity and showed that graphical rewrite systems are not necessarily simplistic and without much flow control as compared to dataflow VLs. We have even laid down the frameworks of a heterogeneous VL. Our research has successfully opened the door to true GPVLs.
{"title":"ARMVLS-atomic reaction model visual language system-a new way of animating algorithms","authors":"K. Warendorf, W. J. Hsu, P. Y. Seah","doi":"10.1109/ICICS.1997.652117","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652117","url":null,"abstract":"Visual language (VL) is a programming language without textual codes and algorithm animation (AA) is about visualizing a computer algorithm. Visual programming (VP) and AA are traditionally separate factions in software visualization (SV). With the atomic reaction model (ARM) project we have bridged these two major branches in SV. Due to the advancements in graphics technology, many developers have come up with graphical applications that claim to be VLs. We see in this diversity of VP systems two main categories of VLs. They are the application specific and the general programming (GP). GPVLs are be developed with the eventual aim of substituting textual programming. Currently, there are two main approaches: graphical rewrite systems and dataflow VLs. AA systems have up to this point of time used the approach pioneered by the BALSA AA system to animate algorithms. Opsis, a Java applet for teaching binary tree algorithms, has shown that the visual approach to AA is more effective as a learning tool. Therefore in this project, we create a VP system that can animate most of the algorithms traditionally done by textual coding. The ARM offered an alternative to the textual codes used in BALSA systems. We have also proven that a VL is capable of solving complex problems without sacrificing its visual clarity and showed that graphical rewrite systems are not necessarily simplistic and without much flow control as compared to dataflow VLs. We have even laid down the frameworks of a heterogeneous VL. Our research has successfully opened the door to true GPVLs.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"106 1","pages":"939-943 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79714989","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 : 1997-09-09DOI: 10.1109/ICICS.1997.652300
B. Senadji, B. Boashash
In mobile radio communications, inter-cell handover is the process whereby a call in progress is maintained while the mobile unit passes through different cells. Current handover decision algorithms compare the difference between the received signal strengths from different base-stations to a hysteresis value. The proposed paper is a contribution towards an optimal estimation of the hysteresis value using Bayes criterion. An expression of the threshold value h is derived in terms of the standard deviation a of the log-normal shadowing affecting the received signals and the ratio /spl eta/ between the a priori probability of handover and probability of no handover. The performance of the handover decision algorithm is evaluated in terms of the probability of false alarm, or probability of unnecessary handover, and probability of detection, or probability of successful handover.
{"title":"Estimation of the hysteresis value for handover decision algorithms using Bayes criterion","authors":"B. Senadji, B. Boashash","doi":"10.1109/ICICS.1997.652300","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652300","url":null,"abstract":"In mobile radio communications, inter-cell handover is the process whereby a call in progress is maintained while the mobile unit passes through different cells. Current handover decision algorithms compare the difference between the received signal strengths from different base-stations to a hysteresis value. The proposed paper is a contribution towards an optimal estimation of the hysteresis value using Bayes criterion. An expression of the threshold value h is derived in terms of the standard deviation a of the log-normal shadowing affecting the received signals and the ratio /spl eta/ between the a priori probability of handover and probability of no handover. The performance of the handover decision algorithm is evaluated in terms of the probability of false alarm, or probability of unnecessary handover, and probability of detection, or probability of successful handover.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"50 1","pages":"1771-1775 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83251063","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 : 1997-09-09DOI: 10.1109/ICICS.1997.652131
C. Caini, P. Salmi, A. V. Coralli
The focus of this work is on the performance analysis of a text dependent closed set speaker identification system for the Italian language. Two identification algorithms, based on LPC and LPC-cepstral feature extractors followed by a continuous density hidden Markov model (CD-HMM) classifier, have been implemented and tested on the Italian database SIVA the MUSER. The database consists of 360 phone calls made by 20 different male speakers from different Italian regions. The false identification probability for the two algorithms has been evaluated for different training sets, different spoken words and a variable number of states of the CD-HMM classifier. Results show that, in any of the considered conditions, the LPC-cepstral based system performs better than the LPC based one and that, in the best working condition, the false identification probability turns out to be of the order of 1.5 per cent.
这项工作的重点是对意大利语文本依赖的闭集说话人识别系统的性能分析。基于LPC和LPC-倒谱特征提取器和连续密度隐马尔可夫模型(CD-HMM)分类器的两种识别算法在意大利数据库SIVA the MUSER上实现并进行了测试。该数据库包括来自意大利不同地区的20位不同男性的360次通话记录。在CD-HMM分类器的不同训练集、不同口语单词和不同状态数下，对两种算法的误识别概率进行了评估。结果表明，在任何考虑的条件下，基于LPC-倒谱的系统都比基于LPC的系统性能更好，并且在最佳工作条件下，错误识别概率为1.5%左右。
{"title":"CD-HMM algorithm performance for speaker identification on an Italian database","authors":"C. Caini, P. Salmi, A. V. Coralli","doi":"10.1109/ICICS.1997.652131","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652131","url":null,"abstract":"The focus of this work is on the performance analysis of a text dependent closed set speaker identification system for the Italian language. Two identification algorithms, based on LPC and LPC-cepstral feature extractors followed by a continuous density hidden Markov model (CD-HMM) classifier, have been implemented and tested on the Italian database SIVA the MUSER. The database consists of 360 phone calls made by 20 different male speakers from different Italian regions. The false identification probability for the two algorithms has been evaluated for different training sets, different spoken words and a variable number of states of the CD-HMM classifier. Results show that, in any of the considered conditions, the LPC-cepstral based system performs better than the LPC based one and that, in the best working condition, the false identification probability turns out to be of the order of 1.5 per cent.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"55 1","pages":"1003-1006 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89271359","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 : 1997-09-09DOI: 10.1109/ICICS.1997.647108
A. Padmanabhan, ShaoHua Tan, K. Goh
Fast block matching algorithms (BMA) have been simulated and tested for the H.263 codec as an alternative to the more computationally expensive full search algorithm (FSA). Comparison of FSA against three step search (TSS), modified motion estimation algorithm (MMEA), and independent orthogonal search (IOSA), have been done when coding with or without the four options of H.263 and results show that these methods offer a good compromise between bit-rate and encoding speed for very low bit-rate (VLB) video coding. A new method utilizing the temporal correlation of motion vectors (MV) has also been developed and simulated. The new method is promising, and its performance is better than nondependent algorithms by subjective assessment.
{"title":"A study of fast block matching algorithms for H.263","authors":"A. Padmanabhan, ShaoHua Tan, K. Goh","doi":"10.1109/ICICS.1997.647108","DOIUrl":"https://doi.org/10.1109/ICICS.1997.647108","url":null,"abstract":"Fast block matching algorithms (BMA) have been simulated and tested for the H.263 codec as an alternative to the more computationally expensive full search algorithm (FSA). Comparison of FSA against three step search (TSS), modified motion estimation algorithm (MMEA), and independent orthogonal search (IOSA), have been done when coding with or without the four options of H.263 and results show that these methods offer a good compromise between bit-rate and encoding speed for very low bit-rate (VLB) video coding. A new method utilizing the temporal correlation of motion vectors (MV) has also been developed and simulated. The new method is promising, and its performance is better than nondependent algorithms by subjective assessment.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"23 1","pages":"301-305 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84718327","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 : 1997-09-09DOI: 10.1109/ICICS.1997.652121
Xingyuan Li, W. Oh, S. Ji, K. Moon, Hyeon-Jin Kim
Page segmentation is necessary for optical character recognition (OCR) and also very useful for many other document image manipulations. We describe a bottom-up method for page segmentation. Connected components are extracted and clustered into a tree description according to their spatial relations. Then, a new iterative split and merge process is performed to refine the text blocks. We also propose new criterion for clustering the connected components and some new techniques to deal with noise and reduce the computation time. The experiment shows the method's efficiency.
{"title":"An efficient method for page segmentation","authors":"Xingyuan Li, W. Oh, S. Ji, K. Moon, Hyeon-Jin Kim","doi":"10.1109/ICICS.1997.652121","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652121","url":null,"abstract":"Page segmentation is necessary for optical character recognition (OCR) and also very useful for many other document image manipulations. We describe a bottom-up method for page segmentation. Connected components are extracted and clustered into a tree description according to their spatial relations. Then, a new iterative split and merge process is performed to refine the text blocks. We also propose new criterion for clustering the connected components and some new techniques to deal with noise and reduce the computation time. The experiment shows the method's efficiency.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"43 1","pages":"957-961 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90643303","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
扫码关注我们
求助内容：
应助结果提醒方式：