Pub Date : 2002-11-07DOI: 10.1109/ICDSP.2002.1028214
G. Doroeviae, T. Unkasevia, M. Markoviae
Possible optimization techniques for the modular reduction procedure of RSA algorithm realization on assembler of Texas Instruments TMS320C54x family of signal processors are considered. Besides a standard dividing algorithm with a remainder, a reciprocal value method and Montgomery's procedure are considered. Obtained results show that the best results are obtained by using Montgomery's approach for modular reduction in the RSA algorithm and also show that the TMS320C54x family of signal processors is suitable for the RSA algorithm realization. Therefore, they are proposed for realization of some coprocessor module in computer networks with "client-server" architecture requiring public-key cryptographic applications.
{"title":"Optimization of modular reduction procedure in RSA algorithm implementation on assembler of TMS320C54x signal processors","authors":"G. Doroeviae, T. Unkasevia, M. Markoviae","doi":"10.1109/ICDSP.2002.1028214","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028214","url":null,"abstract":"Possible optimization techniques for the modular reduction procedure of RSA algorithm realization on assembler of Texas Instruments TMS320C54x family of signal processors are considered. Besides a standard dividing algorithm with a remainder, a reciprocal value method and Montgomery's procedure are considered. Obtained results show that the best results are obtained by using Montgomery's approach for modular reduction in the RSA algorithm and also show that the TMS320C54x family of signal processors is suitable for the RSA algorithm realization. Therefore, they are proposed for realization of some coprocessor module in computer networks with \"client-server\" architecture requiring public-key cryptographic applications.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114756270","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 : 2002-11-07DOI: 10.1109/ICDSP.2002.1028319
M. Hayes, J. Jackson
The Georgia Tech Regional Engineering Program (GTREP) was originally created to provide the opportunity for students in southeastern Georgia to earn a Georgia Tech undergraduate engineering degree without leaving the region. Students complete two years of general education and engineering prerequisites at their home institutions before beginning the Georgia Tech curriculum as juniors. Georgia Tech courses are taught both by local faculty in southeast Georgia and remotely by faculty on the main campus. This system is further complicated by the fact that courses are delivered to three partner institutions as well as the GTREP facilities. The GTREP program is an ideal testbed for novel distributed education methods. We present some results for the combined approach we have developed, and outline plans for future scaling as the GTREP program expands.
{"title":"Synchronous and asynchronous distributed DSP education","authors":"M. Hayes, J. Jackson","doi":"10.1109/ICDSP.2002.1028319","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028319","url":null,"abstract":"The Georgia Tech Regional Engineering Program (GTREP) was originally created to provide the opportunity for students in southeastern Georgia to earn a Georgia Tech undergraduate engineering degree without leaving the region. Students complete two years of general education and engineering prerequisites at their home institutions before beginning the Georgia Tech curriculum as juniors. Georgia Tech courses are taught both by local faculty in southeast Georgia and remotely by faculty on the main campus. This system is further complicated by the fact that courses are delivered to three partner institutions as well as the GTREP facilities. The GTREP program is an ideal testbed for novel distributed education methods. We present some results for the combined approach we have developed, and outline plans for future scaling as the GTREP program expands.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128592347","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 : 2002-11-07DOI: 10.1109/ICDSP.2002.1028208
C. Vural, W. Sethares
In linear image restoration, the point spread function of the degrading system is assumed known even though this information is usually not available in real applications. As a result, both blur identification and image restoration must be performed from the observed noisy blurred image. This paper presents a computationally simple linear adaptive finite impulse response filter for blind image deconvolution. This is essentially a two-dimensional version of the constant modulus algorithm that is well known in the field of blind equalization. The two-dimensional extension is shown capable of reconstructing noisy blurred images using partial a priori information about the true image and the point spread function. The method is applicable to minimum as well as mixed phase blurs. Experimental results are provided.
{"title":"Blind deconvolution of noisy blurred images via dispersion minimization","authors":"C. Vural, W. Sethares","doi":"10.1109/ICDSP.2002.1028208","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028208","url":null,"abstract":"In linear image restoration, the point spread function of the degrading system is assumed known even though this information is usually not available in real applications. As a result, both blur identification and image restoration must be performed from the observed noisy blurred image. This paper presents a computationally simple linear adaptive finite impulse response filter for blind image deconvolution. This is essentially a two-dimensional version of the constant modulus algorithm that is well known in the field of blind equalization. The two-dimensional extension is shown capable of reconstructing noisy blurred images using partial a priori information about the true image and the point spread function. The method is applicable to minimum as well as mixed phase blurs. Experimental results are provided.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"39 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132970603","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 : 2002-11-07DOI: 10.1109/ICDSP.2002.1028302
D. Tsishkou, E. Bovbel
This paper describes an ultrasound image compression algorithm, related to mosaic image compression, where each compressed object is represented as a set of indexes to the database of mosaic elements. The proposed approach is considered as an alternative method for ultrasound biomedical image compression. A memory efficient implementation based upon the tree tessellation algorithm v.10 (TTA10) indexing/retrieval solution for managing mosaic elements. The principal advantage of the current approach is that for the very specific kind of ultrasound images (cardiology), it classifies a particular type of image (compression stage) first, and secondly uses a specially constructed schema to decompose an object into parts. Each part of the image is identified as the most similar mosaic image in the database using TTA10, and finally only the index is stored in compressed structure of an image. Since the size of ultrasound image storage is similar to the video one, while the specific biomedical content is highly correlated, the usage of mosaic image compression is an effective solution for storage.
{"title":"Mosaic ultrasound medical image compression using TTA10 algorithm","authors":"D. Tsishkou, E. Bovbel","doi":"10.1109/ICDSP.2002.1028302","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028302","url":null,"abstract":"This paper describes an ultrasound image compression algorithm, related to mosaic image compression, where each compressed object is represented as a set of indexes to the database of mosaic elements. The proposed approach is considered as an alternative method for ultrasound biomedical image compression. A memory efficient implementation based upon the tree tessellation algorithm v.10 (TTA10) indexing/retrieval solution for managing mosaic elements. The principal advantage of the current approach is that for the very specific kind of ultrasound images (cardiology), it classifies a particular type of image (compression stage) first, and secondly uses a specially constructed schema to decompose an object into parts. Each part of the image is identified as the most similar mosaic image in the database using TTA10, and finally only the index is stored in compressed structure of an image. Since the size of ultrasound image storage is similar to the video one, while the specific biomedical content is highly correlated, the usage of mosaic image compression is an effective solution for storage.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116233082","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 : 2002-11-07DOI: 10.1109/ICDSP.2002.1028147
P. Cristea
The paper discusses the ways of converting DNA sequences from their symbolic - nucleotide, codon and amino acid - forms into corresponding digital signals. It is shown that all the real and complex mappings can be derived from the same original tetrahedral representation of the genetic code (GC). The reduction of the representation dimensionality results from the projection of the GC tetrahedron on adequately oriented planes or surfaces. On these bases, optimal symbolic-to-digital mappings of the DNA strands into real or complex genomic signals are derived at nucleotide, codon and amino acid levels. By converting the nucleic acid and polypeptide sequences into digital genomic signals, this approach offers the possibility to use a large variety of signal processing methods for their handling and analysis. It is also shown that some essential features of the nucleotide sequences can be better extracted using this representation. Results obtained by applying this approach for the analysis of the human genome are presented along with some new methods for identifying genetically significant segments of DNA sequences.
{"title":"Real and complex genomic signals","authors":"P. Cristea","doi":"10.1109/ICDSP.2002.1028147","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028147","url":null,"abstract":"The paper discusses the ways of converting DNA sequences from their symbolic - nucleotide, codon and amino acid - forms into corresponding digital signals. It is shown that all the real and complex mappings can be derived from the same original tetrahedral representation of the genetic code (GC). The reduction of the representation dimensionality results from the projection of the GC tetrahedron on adequately oriented planes or surfaces. On these bases, optimal symbolic-to-digital mappings of the DNA strands into real or complex genomic signals are derived at nucleotide, codon and amino acid levels. By converting the nucleic acid and polypeptide sequences into digital genomic signals, this approach offers the possibility to use a large variety of signal processing methods for their handling and analysis. It is also shown that some essential features of the nucleotide sequences can be better extracted using this representation. Results obtained by applying this approach for the analysis of the human genome are presented along with some new methods for identifying genetically significant segments of DNA sequences.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"269 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116615187","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 : 2002-11-07DOI: 10.1109/ICDSP.2002.1028279
P. Esquef, M. Karjalainen, V. Välimäki
Warped linear prediction (WLP) is applied to a model-based method to detect impulsive disturbances in audio signals. According to simulations performed on artificially corrupted audio signals, the adoption of negative values for the warping factor favors the click detection scheme. As a consequence, for equal levels of missing (false) detection, the WLP-based scheme yields a consistently lower percentage of false (missing) detection than the conventional method.
{"title":"Detection of clicks in audio signals using warped linear prediction","authors":"P. Esquef, M. Karjalainen, V. Välimäki","doi":"10.1109/ICDSP.2002.1028279","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028279","url":null,"abstract":"Warped linear prediction (WLP) is applied to a model-based method to detect impulsive disturbances in audio signals. According to simulations performed on artificially corrupted audio signals, the adoption of negative values for the warping factor favors the click detection scheme. As a consequence, for equal levels of missing (false) detection, the WLP-based scheme yields a consistently lower percentage of false (missing) detection than the conventional method.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122228869","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 : 2002-11-07DOI: 10.1109/ICDSP.2002.1028288
I. Cosic, Q. Fang
We have shown previously that digital signal processing methods and in particular wavelets can be used to analyze linear sequences of amino acids to reveal the informational content of proteins. In addition, we have shown that Morlet wavelets are the most suitable for the identification of active sites within the protein sequence. Here, we modify the Morlet function to optimise it for the use in protein analysis.
{"title":"Evaluation of different wavelet constructions (designs) for analysis of protein sequences","authors":"I. Cosic, Q. Fang","doi":"10.1109/ICDSP.2002.1028288","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028288","url":null,"abstract":"We have shown previously that digital signal processing methods and in particular wavelets can be used to analyze linear sequences of amino acids to reveal the informational content of proteins. In addition, we have shown that Morlet wavelets are the most suitable for the identification of active sites within the protein sequence. Here, we modify the Morlet function to optimise it for the use in protein analysis.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125049180","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 : 2002-11-07DOI: 10.1109/ICDSP.2002.1028280
R. Torres, A. Falcão, L. F. D. Costa
The image foresting transform (IFT) is a unified and effective graph-based approach to the design of image-processing operations, often with considerable efficiency gains over published algorithms. This paper extends the applications of the Euclidean IFT to two recently proposed shape descriptors: saliences and multiscale fractal dimension. It explains how to obtain the salience information and the multiscale fractal dimension of contours and skeletons and presents their comparison in terms of robustness and separability.
{"title":"Shape description by image foresting transform","authors":"R. Torres, A. Falcão, L. F. D. Costa","doi":"10.1109/ICDSP.2002.1028280","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028280","url":null,"abstract":"The image foresting transform (IFT) is a unified and effective graph-based approach to the design of image-processing operations, often with considerable efficiency gains over published algorithms. This paper extends the applications of the Euclidean IFT to two recently proposed shape descriptors: saliences and multiscale fractal dimension. It explains how to obtain the salience information and the multiscale fractal dimension of contours and skeletons and presents their comparison in terms of robustness and separability.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125104837","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 : 2002-11-07DOI: 10.1109/ICDSP.2002.1028198
S. Sarpal, E. Chilton
Cepstral deconvolution has been successfully applied to many diverse fields, such as speech and seismic analysis. Thus far, all cepstral modelling performance has been empirical, relying on the judgement of the designer. A novel method for measuring root cepstral ARMA modelling performance is proposed, by introducing a cost function applied directly to the root cepstral domain. It is, therefore, possible to demonstrate the optimised modelling of an ARMA process and show that its performance is superior to that of a FIR Wiener filter and linear prediction.
{"title":"ARMA modelling based on root cepstral deconvolution","authors":"S. Sarpal, E. Chilton","doi":"10.1109/ICDSP.2002.1028198","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028198","url":null,"abstract":"Cepstral deconvolution has been successfully applied to many diverse fields, such as speech and seismic analysis. Thus far, all cepstral modelling performance has been empirical, relying on the judgement of the designer. A novel method for measuring root cepstral ARMA modelling performance is proposed, by introducing a cost function applied directly to the root cepstral domain. It is, therefore, possible to demonstrate the optimised modelling of an ARMA process and show that its performance is superior to that of a FIR Wiener filter and linear prediction.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"120 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126306267","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 : 2002-11-07DOI: 10.1109/ICDSP.2002.1028341
K. M. Curtis, G. Neil, V. Fotopoulos
DCT and fractal compression incorporate certain advantages and disadvantages. In the present communication, a hybrid fractal/DCT image compression technique is presented. DCT is employed whenever the quality of the decoding block is of sufficient quality or else fractal compression technique is used for the encoding that will also lead to great compression. Pruned DCT is used to lower even more the computational time. The result is faster coding than fractals, better compression ratios than the DCT and better image quality from both techniques.
{"title":"A hybrid fractal/DCT image compression method","authors":"K. M. Curtis, G. Neil, V. Fotopoulos","doi":"10.1109/ICDSP.2002.1028341","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028341","url":null,"abstract":"DCT and fractal compression incorporate certain advantages and disadvantages. In the present communication, a hybrid fractal/DCT image compression technique is presented. DCT is employed whenever the quality of the decoding block is of sufficient quality or else fractal compression technique is used for the encoding that will also lead to great compression. Pruned DCT is used to lower even more the computational time. The result is faster coding than fractals, better compression ratios than the DCT and better image quality from both techniques.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124470788","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
扫码关注我们
求助内容：
应助结果提醒方式：