Pub Date : 1996-09-01DOI: 10.1109/DSPWS.1996.555523
D. Kouamé, J. Remeniéras, J. Roux, A. Ouahabi, M. Lethiecq
After having detected changes in an ARMA model, one of the problems consists in determining how to compensate for these changes in order to carry on tracking. Different detection techniques are compared and two common compensation of abrupt changes methods in an ARMA model are presented: the first one uses the Fisher information matrix and the second one the parametric error covariance. These compensation methods have a drawback: they can give an important weight to a direction without any failure. A new compensation technique is thus proposed. The compensated detection techniques are compared with each other and discussed.
{"title":"Effect of the compensation in abrupt model change detection problem","authors":"D. Kouamé, J. Remeniéras, J. Roux, A. Ouahabi, M. Lethiecq","doi":"10.1109/DSPWS.1996.555523","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555523","url":null,"abstract":"After having detected changes in an ARMA model, one of the problems consists in determining how to compensate for these changes in order to carry on tracking. Different detection techniques are compared and two common compensation of abrupt changes methods in an ARMA model are presented: the first one uses the Fisher information matrix and the second one the parametric error covariance. These compensation methods have a drawback: they can give an important weight to a direction without any failure. A new compensation technique is thus proposed. The compensated detection techniques are compared with each other and discussed.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115392476","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-09-01DOI: 10.1109/DSPWS.1996.555490
D. Chiper
A new systolic algorithm for memory-based parallel VLSI implementation of the inverse to discrete cosine transform (IDCT) is proposed. The new approach is based on a new formulation of an odd prime-length IDCT which uses two half-length cyclic convolutions with the same form which can be concurrently computed and were such reformulated that an efficient substitution of multipliers with small ROMs can be obtained. Using this algorithm, a new efficient VLSI implementation with outstanding performance in structural regularity, hardware cost of the PEs, average computation time, and I/O costs can be obtained. It has a much lower control complexity, and a simpler hardware structure.
{"title":"A new systolic array algorithm for memory-based VLSI array implementation of IDCT with high throughput rate and low complexity","authors":"D. Chiper","doi":"10.1109/DSPWS.1996.555490","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555490","url":null,"abstract":"A new systolic algorithm for memory-based parallel VLSI implementation of the inverse to discrete cosine transform (IDCT) is proposed. The new approach is based on a new formulation of an odd prime-length IDCT which uses two half-length cyclic convolutions with the same form which can be concurrently computed and were such reformulated that an efficient substitution of multipliers with small ROMs can be obtained. Using this algorithm, a new efficient VLSI implementation with outstanding performance in structural regularity, hardware cost of the PEs, average computation time, and I/O costs can be obtained. It has a much lower control complexity, and a simpler hardware structure.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115301699","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-09-01DOI: 10.1109/DSPWS.1996.555530
E. Horita, K. Nishikawa, Y. Miyanaga
This paper proposes a fast RLS based on a two-dimensional AR model in order to estimate a power spectrum of signals about time and space. The proposed method introduces a non-symmetric half plane (NSHP) model and an exponential weighting factor about time. Moreover, the calculation cost of the conventional FRLS is reduced.
{"title":"A fast recursive least-squares with a weighting factor based an a 2-D NSHP AR model and its application to spectral estimation","authors":"E. Horita, K. Nishikawa, Y. Miyanaga","doi":"10.1109/DSPWS.1996.555530","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555530","url":null,"abstract":"This paper proposes a fast RLS based on a two-dimensional AR model in order to estimate a power spectrum of signals about time and space. The proposed method introduces a non-symmetric half plane (NSHP) model and an exponential weighting factor about time. Moreover, the calculation cost of the conventional FRLS is reduced.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"12 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116125927","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-09-01DOI: 10.1109/DSPWS.1996.555514
Olivier Rioul
This paper presents an elegant solution to the impulse noise cancellation problem for images. The approach taken here is based on the theory of error-correcting (BCH) codes. Impulses are considered as "errors". The process is in two steps: First, find the error locations in the image; then, correct the error values. A first pass is made on the lines of the image, a second pass is then performed on the columns. Next the same procedure is repeated. In most cases, impulse noise is completely removed after a few iterations are performed.
{"title":"A spectral algorithm for removing salt and pepper from images","authors":"Olivier Rioul","doi":"10.1109/DSPWS.1996.555514","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555514","url":null,"abstract":"This paper presents an elegant solution to the impulse noise cancellation problem for images. The approach taken here is based on the theory of error-correcting (BCH) codes. Impulses are considered as \"errors\". The process is in two steps: First, find the error locations in the image; then, correct the error values. A first pass is made on the lines of the image, a second pass is then performed on the columns. Next the same procedure is repeated. In most cases, impulse noise is completely removed after a few iterations are performed.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123560330","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-09-01DOI: 10.1109/DSPWS.1996.555468
B. Zeng, Liping Gu
Roundoff noise (fixed-point) characteristics of two-channel paraunitary filter banks realized in lattice structure are studied in detail. Under the assumption that all quantization errors are independent WSS white noise with zero-mean, we derive a closed-form formula to calculate the output roundoff noise variance, involving only the set of lattice parameters. Based on this results, several general and important conclusions can be drawn. In addition, we also present some simulation results to show that the analytical results are accurate enough for practical use.
{"title":"Roundoff noise analysis of paraunitary filter banks realized in lattice structure","authors":"B. Zeng, Liping Gu","doi":"10.1109/DSPWS.1996.555468","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555468","url":null,"abstract":"Roundoff noise (fixed-point) characteristics of two-channel paraunitary filter banks realized in lattice structure are studied in detail. Under the assumption that all quantization errors are independent WSS white noise with zero-mean, we derive a closed-form formula to calculate the output roundoff noise variance, involving only the set of lattice parameters. Based on this results, several general and important conclusions can be drawn. In addition, we also present some simulation results to show that the analytical results are accurate enough for practical use.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128329988","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-09-01DOI: 10.1109/DSPWS.1996.555513
R. Qureshi, Xiaobo Li, A. Sather
This paper reports on an image segmentation system primarily developed for detecting loins in ultrasonic images of live pigs. The images have a low contrast, high level of noise, and a high degree of variance in terms of texture and shape. Our segmentation algorithm starts with a region growing process, which provides a rough approximation of the loin region. Morphological operations and curve fitting eliminate unwanted noise. Finally, an active contour process refines the shape of the resulting region. This method does not rely on specific a priori information of the texture or the contrast. The system is based on the principle of modular design, so that different region growing and refinement algorithms can be easily substituted into the current design as modules. Therefore, the system is general enough to be adapted to other segmentation tasks involving low contrast images.
{"title":"Towards a system for segmentation under noisy conditions","authors":"R. Qureshi, Xiaobo Li, A. Sather","doi":"10.1109/DSPWS.1996.555513","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555513","url":null,"abstract":"This paper reports on an image segmentation system primarily developed for detecting loins in ultrasonic images of live pigs. The images have a low contrast, high level of noise, and a high degree of variance in terms of texture and shape. Our segmentation algorithm starts with a region growing process, which provides a rough approximation of the loin region. Morphological operations and curve fitting eliminate unwanted noise. Finally, an active contour process refines the shape of the resulting region. This method does not rely on specific a priori information of the texture or the contrast. The system is based on the principle of modular design, so that different region growing and refinement algorithms can be easily substituted into the current design as modules. Therefore, the system is general enough to be adapted to other segmentation tasks involving low contrast images.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114137627","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-09-01DOI: 10.1109/DSPWS.1996.555565
C. Schreyogg
A divisive cluster algorithm has been applied to identify the type of signal constellation used by a voice band modem. Tests with simulated signals showed that this cluster technique is capable to classify a variety of voiceband signals in use (DPSK2A/B, DPSK4A/B, V.29, V.29Fallback (7.2 kbit/s) and V.32Fallback (9.6kbit/s)). Compared to former proposed algorithms to classify linear digital modulated signal constellations, this technique is able to classify both higher rated PSK and QAM signals at high to moderate signal-to-noise ratios (SNR). With respect to signal impairments such as phase jitter, residual carrier or incomplete equalisation the classifier has proven to be reasonably robust. This paper describes the applied cluster algorithm and provides examples of its performance.
{"title":"Identification of voiceband data signal constellations using a divisive cluster algorithm","authors":"C. Schreyogg","doi":"10.1109/DSPWS.1996.555565","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555565","url":null,"abstract":"A divisive cluster algorithm has been applied to identify the type of signal constellation used by a voice band modem. Tests with simulated signals showed that this cluster technique is capable to classify a variety of voiceband signals in use (DPSK2A/B, DPSK4A/B, V.29, V.29Fallback (7.2 kbit/s) and V.32Fallback (9.6kbit/s)). Compared to former proposed algorithms to classify linear digital modulated signal constellations, this technique is able to classify both higher rated PSK and QAM signals at high to moderate signal-to-noise ratios (SNR). With respect to signal impairments such as phase jitter, residual carrier or incomplete equalisation the classifier has proven to be reasonably robust. This paper describes the applied cluster algorithm and provides examples of its performance.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114291862","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-09-01DOI: 10.1109/DSPWS.1996.555503
R. Hamzaoui, M. Muller, D. Saupe
A novel hybrid scheme combining fractal image compression with mean-removed shape-gain vector quantization is presented. The algorithm, based on a distance classification fractal coder with fixed cluster centers, decides whether to encode a range block by a cluster center or by a domain block. Our scheme is shown to improve the performance of conventional fractal coding in all its aspects. The rate-distortion curve is ameliorated, and both the encoding and the decoding are faster.
{"title":"Enhancing fractal image compression with vector quantization","authors":"R. Hamzaoui, M. Muller, D. Saupe","doi":"10.1109/DSPWS.1996.555503","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555503","url":null,"abstract":"A novel hybrid scheme combining fractal image compression with mean-removed shape-gain vector quantization is presented. The algorithm, based on a distance classification fractal coder with fixed cluster centers, decides whether to encode a range block by a cluster center or by a domain block. Our scheme is shown to improve the performance of conventional fractal coding in all its aspects. The rate-distortion curve is ameliorated, and both the encoding and the decoding are faster.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114360537","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-09-01DOI: 10.1109/DSPWS.1996.555473
S. Barbarossa, A. Ventrella
The authors propose a method for image progressive transmission based on embedded multiresolution modulation of images coded using two-dimensional wavelet transforms. The method combines a multi-precision/multi-resolution image representation with an embedded modulation to implement a fully progressive transmission scheme, useful in digital broadcasting, mobile communications in the presence of multipath, and transmission over broadband digital networks based on ATM.
{"title":"Progressive transmission by wavelet zero-tree coding and embedded modulation","authors":"S. Barbarossa, A. Ventrella","doi":"10.1109/DSPWS.1996.555473","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555473","url":null,"abstract":"The authors propose a method for image progressive transmission based on embedded multiresolution modulation of images coded using two-dimensional wavelet transforms. The method combines a multi-precision/multi-resolution image representation with an embedded modulation to implement a fully progressive transmission scheme, useful in digital broadcasting, mobile communications in the presence of multipath, and transmission over broadband digital networks based on ATM.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131829418","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-09-01DOI: 10.1109/DSPWS.1996.555516
H. Skinnemoen
Vector quantization (VQ) is a multidimensional block quantizer methodology that can be very efficient with respect to approaching the rate-distortion bounds. Best performance is obtained for longer blocks. However, as the vectors become longer, the number of codebook vectors will generally increase, and the complexity of searching the codebook for the best codebook vector may soon become prohibitive. For best quantizer performance, the VQ must be trained for the source, but this usually prohibits the use of structured (or algebraic) codebooks that are fast to search. This paper presents a novel methodology for codebook design that combines the traditional training of codebooks by the well proven generalized Lloyd algorithm (GLA) with a structured codebook that can be searched efficiently. The concept is termed gradient search algorithm (GSA) since it is based upon a gradient in the error surface of the codebook pointing towards the optimum codebook vector choice.
{"title":"A codebook design method for fast VQ search","authors":"H. Skinnemoen","doi":"10.1109/DSPWS.1996.555516","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555516","url":null,"abstract":"Vector quantization (VQ) is a multidimensional block quantizer methodology that can be very efficient with respect to approaching the rate-distortion bounds. Best performance is obtained for longer blocks. However, as the vectors become longer, the number of codebook vectors will generally increase, and the complexity of searching the codebook for the best codebook vector may soon become prohibitive. For best quantizer performance, the VQ must be trained for the source, but this usually prohibits the use of structured (or algebraic) codebooks that are fast to search. This paper presents a novel methodology for codebook design that combines the traditional training of codebooks by the well proven generalized Lloyd algorithm (GLA) with a structured codebook that can be searched efficiently. The concept is termed gradient search algorithm (GSA) since it is based upon a gradient in the error surface of the codebook pointing towards the optimum codebook vector choice.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129842442","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
扫码关注我们
求助内容：
应助结果提醒方式：