Pub Date : 1996-10-14DOI: 10.1109/ICSIGP.1996.567350
Naikang Ge, Hongchen Li, Li Han, Zhai Xin
The message handling system (MHS), was promulgated by CCITT in 1984 to realise the international standardization of E-mail. By combining the technologies of computers, communications and information processing, the MHS forms an electronic imitation of the traditional mail system. The voice message handling system (VMHS) discussed in this article is a part of the MHS. We discuss the research according to the international standard of the MHS.
{"title":"Research of the voice message handling system","authors":"Naikang Ge, Hongchen Li, Li Han, Zhai Xin","doi":"10.1109/ICSIGP.1996.567350","DOIUrl":"https://doi.org/10.1109/ICSIGP.1996.567350","url":null,"abstract":"The message handling system (MHS), was promulgated by CCITT in 1984 to realise the international standardization of E-mail. By combining the technologies of computers, communications and information processing, the MHS forms an electronic imitation of the traditional mail system. The voice message handling system (VMHS) discussed in this article is a part of the MHS. We discuss the research according to the international standard of the MHS.","PeriodicalId":385432,"journal":{"name":"Proceedings of Third International Conference on Signal Processing (ICSP'96)","volume":"203 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133033627","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 : 1996-10-14DOI: 10.1109/ICSIGP.1996.566504
Y. Zeng
An approach is proposed for segmented image coding which avoids the redundant and false-edges that appear in the late stages of hierarchical segmentation. The recursive shortest spanning tree (RSST) algorithm is used to obtain regions describing the main objects. Significant small features are then extracted from the original image to compensate for the coarse segmented image. The method of extracting details is based on mathematical morphology and is a modification of a detail extracting method described in a previous study. This approach produced better visual image quality than using the segmentation-only algorithms especially in the case of low bit-rate coding.
{"title":"Region coding and detail compensation","authors":"Y. Zeng","doi":"10.1109/ICSIGP.1996.566504","DOIUrl":"https://doi.org/10.1109/ICSIGP.1996.566504","url":null,"abstract":"An approach is proposed for segmented image coding which avoids the redundant and false-edges that appear in the late stages of hierarchical segmentation. The recursive shortest spanning tree (RSST) algorithm is used to obtain regions describing the main objects. Significant small features are then extracted from the original image to compensate for the coarse segmented image. The method of extracting details is based on mathematical morphology and is a modification of a detail extracting method described in a previous study. This approach produced better visual image quality than using the segmentation-only algorithms especially in the case of low bit-rate coding.","PeriodicalId":385432,"journal":{"name":"Proceedings of Third International Conference on Signal Processing (ICSP'96)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133599015","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 : 1996-10-14DOI: 10.1109/ICSIGP.1996.571197
W. Yousheng, S. Qiao, Pan Xufeng, L. Xiaolei
The wavelet transform and artificial neural networks (ANNs) are briefly described. Then both of them are applied comprehensively to machinery fault diagnosis. The wavelet transform is used to pre-process data and extract feature vectors. ANNs are used to identify fault types. Using the wavelet transform, the dimension of the feature vector is greatly decreased and the noises are restrained as well. Thus the construction of the ANNs is simplified and the calculation speed is raised without lowering accuracy. For comparison, two types of features are extracted. Such a diagnosing measure is proved to be efficient by an experiment at the end of the paper.
{"title":"The application of wavelet transform and artificial neural networks in machinery fault diagnosis","authors":"W. Yousheng, S. Qiao, Pan Xufeng, L. Xiaolei","doi":"10.1109/ICSIGP.1996.571197","DOIUrl":"https://doi.org/10.1109/ICSIGP.1996.571197","url":null,"abstract":"The wavelet transform and artificial neural networks (ANNs) are briefly described. Then both of them are applied comprehensively to machinery fault diagnosis. The wavelet transform is used to pre-process data and extract feature vectors. ANNs are used to identify fault types. Using the wavelet transform, the dimension of the feature vector is greatly decreased and the noises are restrained as well. Thus the construction of the ANNs is simplified and the calculation speed is raised without lowering accuracy. For comparison, two types of features are extracted. Such a diagnosing measure is proved to be efficient by an experiment at the end of the paper.","PeriodicalId":385432,"journal":{"name":"Proceedings of Third International Conference on Signal Processing (ICSP'96)","volume":"460 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133303737","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 : 1996-10-14DOI: 10.1109/ICSIGP.1996.567279
G. Schmidt, W.P. Buckwald, L. Dooley
This paper discusses the many and varied design considerations of a 2D digital subband filter bank implementation for orthogonal sampling structures, which enables the derivation of only two subbands rather than the usual four. In particular, the design trade-off and overall performance of a quadrature mirror filter pair, in combination with a 2D diagonal prefilter is explored and the ensuing problems of avoiding and compensating for aliasing within the subbands, as well as for the signal reconstruction process at the decoder are highlighted.
{"title":"Optimal design of dual-channel subband filter structures for video and image applications","authors":"G. Schmidt, W.P. Buckwald, L. Dooley","doi":"10.1109/ICSIGP.1996.567279","DOIUrl":"https://doi.org/10.1109/ICSIGP.1996.567279","url":null,"abstract":"This paper discusses the many and varied design considerations of a 2D digital subband filter bank implementation for orthogonal sampling structures, which enables the derivation of only two subbands rather than the usual four. In particular, the design trade-off and overall performance of a quadrature mirror filter pair, in combination with a 2D diagonal prefilter is explored and the ensuing problems of avoiding and compensating for aliasing within the subbands, as well as for the signal reconstruction process at the decoder are highlighted.","PeriodicalId":385432,"journal":{"name":"Proceedings of Third International Conference on Signal Processing (ICSP'96)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133681017","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 : 1996-10-14DOI: 10.1109/ICSIGP.1996.566266
G. Hong, G. Hall, T. Terrell
This paper describes a prediction process produced by a back-propagation neural network for lossless image compression. The predictor is designed by supervised training of a back-propagation neural network using actual image pixels, i.e. using a typical sequence of pixel values. The significance of this approach lies in the fact that it can exploit high-order statistics and the nonlinear function existing between pixel values in an image. Results are presented for the prediction error image in terms of mean-square error and first-order entropy, and a discussion on the performance of the algorithm is given.
{"title":"Prediction by back-propagation neural network for lossless image compression","authors":"G. Hong, G. Hall, T. Terrell","doi":"10.1109/ICSIGP.1996.566266","DOIUrl":"https://doi.org/10.1109/ICSIGP.1996.566266","url":null,"abstract":"This paper describes a prediction process produced by a back-propagation neural network for lossless image compression. The predictor is designed by supervised training of a back-propagation neural network using actual image pixels, i.e. using a typical sequence of pixel values. The significance of this approach lies in the fact that it can exploit high-order statistics and the nonlinear function existing between pixel values in an image. Results are presented for the prediction error image in terms of mean-square error and first-order entropy, and a discussion on the performance of the algorithm is given.","PeriodicalId":385432,"journal":{"name":"Proceedings of Third International Conference on Signal Processing (ICSP'96)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133822333","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}
This paper discusses a finite iterative method for computing 2-D deconvolution. The given algorithm doesn't have any convergent problems and doesn't deal with any complex irrational factors or know all of x(n/sub 1/, n/sub 2/) or y(n/sub 1/, n/sub 2/). So it can be called a semi-blind algorithm for 2-D deconvolution. A flow diagram of the algorithm, comparison of computational cost and FFT are given.
{"title":"An iterative algorithm for 2-D deconvolution","authors":"Zhang Shengfu, Shen Haiming, Zhao Huichang, Zhao Zhilin","doi":"10.1109/ICSIGP.1996.567044","DOIUrl":"https://doi.org/10.1109/ICSIGP.1996.567044","url":null,"abstract":"This paper discusses a finite iterative method for computing 2-D deconvolution. The given algorithm doesn't have any convergent problems and doesn't deal with any complex irrational factors or know all of x(n/sub 1/, n/sub 2/) or y(n/sub 1/, n/sub 2/). So it can be called a semi-blind algorithm for 2-D deconvolution. A flow diagram of the algorithm, comparison of computational cost and FFT are given.","PeriodicalId":385432,"journal":{"name":"Proceedings of Third International Conference on Signal Processing (ICSP'96)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115238624","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 : 1996-10-14DOI: 10.1109/ICSIGP.1996.566558
Y. B. Mahdy, M. El-Melegy
Encoding of relevant information from visual patterns represents an important challenging component of pattern recognition. This paper proposes a contour-following based algorithm for extracting features from patterns. For classification of the encoded patterns by nearest neighbor (NN) classifiers, an iterative clustering algorithm is proposed to obtain a reduced, but efficient, number of prototypes. The algorithm works in a supervised mode and can perform cluster merging and cancelling. Moreover, mapping this NN classifier to a multilayer feedforward neural network is investigated. The performance of the algorithms is demonstrated through application to the task of handwritten Hindi numeral recognition. Experiments reveal the advantages of handling flexible sizes, orientations and variations.
{"title":"Encoding patterns for efficient classification by nearest neighbor classifiers and neural networks with application to handwritten Hindi numeral recognition","authors":"Y. B. Mahdy, M. El-Melegy","doi":"10.1109/ICSIGP.1996.566558","DOIUrl":"https://doi.org/10.1109/ICSIGP.1996.566558","url":null,"abstract":"Encoding of relevant information from visual patterns represents an important challenging component of pattern recognition. This paper proposes a contour-following based algorithm for extracting features from patterns. For classification of the encoded patterns by nearest neighbor (NN) classifiers, an iterative clustering algorithm is proposed to obtain a reduced, but efficient, number of prototypes. The algorithm works in a supervised mode and can perform cluster merging and cancelling. Moreover, mapping this NN classifier to a multilayer feedforward neural network is investigated. The performance of the algorithms is demonstrated through application to the task of handwritten Hindi numeral recognition. Experiments reveal the advantages of handling flexible sizes, orientations and variations.","PeriodicalId":385432,"journal":{"name":"Proceedings of Third International Conference on Signal Processing (ICSP'96)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115350185","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 : 1996-10-14DOI: 10.1109/ICSIGP.1996.567298
Wang Zhao, Xiang Ming, Y. Xiaodong, Y. Rijie, Shi Kunlin, Zhao Baichun
This paper presents the method for high precision bearing estimation under the condition that the volume of the array is strictly limited. It gives the principle of this method, the realizing method of beamforming, theory demonstration and simulation results.
{"title":"The research of cross array's acoustic direction-finding technique","authors":"Wang Zhao, Xiang Ming, Y. Xiaodong, Y. Rijie, Shi Kunlin, Zhao Baichun","doi":"10.1109/ICSIGP.1996.567298","DOIUrl":"https://doi.org/10.1109/ICSIGP.1996.567298","url":null,"abstract":"This paper presents the method for high precision bearing estimation under the condition that the volume of the array is strictly limited. It gives the principle of this method, the realizing method of beamforming, theory demonstration and simulation results.","PeriodicalId":385432,"journal":{"name":"Proceedings of Third International Conference on Signal Processing (ICSP'96)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114916342","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 : 1996-10-14DOI: 10.1109/ICSIGP.1996.567089
Fan Pingyi, Gao Yunliang, C. Zhigang, Feng Chong-xi
In signal analysis and processing, the Z transform plays the same-important role in the discrete signal system as that of the Laplace transform in a continuous signal system. The limitation of the application of the Z transform is analysed. A new concept of the wide sense Z (WSZ) transform for a bandlimited signal is proposed, some new results is obtained, and the transform theory is expanded. In practical applications, some problems which are difficult to solve with the traditional Z transform can be solved easily by the proposed theory.
{"title":"Some new results on Z transform","authors":"Fan Pingyi, Gao Yunliang, C. Zhigang, Feng Chong-xi","doi":"10.1109/ICSIGP.1996.567089","DOIUrl":"https://doi.org/10.1109/ICSIGP.1996.567089","url":null,"abstract":"In signal analysis and processing, the Z transform plays the same-important role in the discrete signal system as that of the Laplace transform in a continuous signal system. The limitation of the application of the Z transform is analysed. A new concept of the wide sense Z (WSZ) transform for a bandlimited signal is proposed, some new results is obtained, and the transform theory is expanded. In practical applications, some problems which are difficult to solve with the traditional Z transform can be solved easily by the proposed theory.","PeriodicalId":385432,"journal":{"name":"Proceedings of Third International Conference on Signal Processing (ICSP'96)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122002366","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 : 1996-10-14DOI: 10.1109/ICSIGP.1996.566240
Shi Lei, L. Weihua, Liu Zuoliang
To reduce the complexity of algorithms for tracking maneuvering targets, a two stage filter scheme based on non-zero mean target dynamical model has been developed, and to maintain good tracking performance for non-maneuvering targets, an improved interacting multiple model (IMM) algorithm with the two stage filter has been suggested. The Monte Carlo simulation shows that this scheme posses a good tracking performance for both high maneuvering and non-maneuvering targets with substantially reduced computing burden.
{"title":"An effective IMM algorithm for maneuvering target tracking","authors":"Shi Lei, L. Weihua, Liu Zuoliang","doi":"10.1109/ICSIGP.1996.566240","DOIUrl":"https://doi.org/10.1109/ICSIGP.1996.566240","url":null,"abstract":"To reduce the complexity of algorithms for tracking maneuvering targets, a two stage filter scheme based on non-zero mean target dynamical model has been developed, and to maintain good tracking performance for non-maneuvering targets, an improved interacting multiple model (IMM) algorithm with the two stage filter has been suggested. The Monte Carlo simulation shows that this scheme posses a good tracking performance for both high maneuvering and non-maneuvering targets with substantially reduced computing burden.","PeriodicalId":385432,"journal":{"name":"Proceedings of Third International Conference on Signal Processing (ICSP'96)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125744707","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
扫码关注我们
求助内容：
应助结果提醒方式：