Pub Date : 2002-11-07DOI: 10.1109/ICDSP.2002.1028334
Li-Ke Huang, A. Manikas
We propose a joint space-Doppler parameter estimation algorithm for fast-fading multipath DS-CDMA communication systems. The Doppler shifts induced by the relative motion between the transmitter and the receiver, together with the associated direction-of-arrival (DOA), are jointly estimated by a semi-blind subspace-type method. The Doppler effect is successfully eliminated by a space-time-Doppler receiver after the directional and Doppler parameters are estimated.
{"title":"Space-Doppler parameter estimation for space-time-Doppler reception in time-varying multipath DS-CDMA systems","authors":"Li-Ke Huang, A. Manikas","doi":"10.1109/ICDSP.2002.1028334","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028334","url":null,"abstract":"We propose a joint space-Doppler parameter estimation algorithm for fast-fading multipath DS-CDMA communication systems. The Doppler shifts induced by the relative motion between the transmitter and the receiver, together with the associated direction-of-arrival (DOA), are jointly estimated by a semi-blind subspace-type method. The Doppler effect is successfully eliminated by a space-time-Doppler receiver after the directional and Doppler parameters are estimated.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"52 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":"128176796","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.1028304
Z. Banjac, B. D. Kovaeeviae, M. M. Milosavljeviae, M. D. Veinoviae
We propose an application of adaptive FIR filter algorithm for echo cancellation applications. The proposed algorithm differs from the conventional one by the construction of input signals on an optimal way using the nonlinear experiment design named D-optimal experiment design. The advantages in using the proposed adaptive FIR echo canceller as an initialization process in the first phase of each telephone call is demonstrated through simulation results. With respect to the obtained results, the D-optimal input sequence should be adapted properly to the changes in the telephone network topology caused by any new line connection.
{"title":"An application of adaptive FIR filter with nonlinear optimal input design","authors":"Z. Banjac, B. D. Kovaeeviae, M. M. Milosavljeviae, M. D. Veinoviae","doi":"10.1109/ICDSP.2002.1028304","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028304","url":null,"abstract":"We propose an application of adaptive FIR filter algorithm for echo cancellation applications. The proposed algorithm differs from the conventional one by the construction of input signals on an optimal way using the nonlinear experiment design named D-optimal experiment design. The advantages in using the proposed adaptive FIR echo canceller as an initialization process in the first phase of each telephone call is demonstrated through simulation results. With respect to the obtained results, the D-optimal input sequence should be adapted properly to the changes in the telephone network topology caused by any new line connection.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"2013 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":"128181158","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.1028297
D. Creanga
The electroretinographic response (ERG) of the Drosophila melanogaster eye was recorded in different illumination conditions. A analog/digital conversion system and adequate software was used to process information for quantitative interpretation. The electroretinographic parameters that were comparatively studied, in different light intensities and colors, were the latency time and the adaptation time. It was underlined that the latency time is dependent on the intensity of the white light and on the wavelength of the color light, being longer when the role of the photoreceptors connected to a more distant synapse is stronger.
{"title":"Preliminary study on the temporal parameters in some electroretinographic recordings","authors":"D. Creanga","doi":"10.1109/ICDSP.2002.1028297","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028297","url":null,"abstract":"The electroretinographic response (ERG) of the Drosophila melanogaster eye was recorded in different illumination conditions. A analog/digital conversion system and adequate software was used to process information for quantitative interpretation. The electroretinographic parameters that were comparatively studied, in different light intensities and colors, were the latency time and the adaptation time. It was underlined that the latency time is dependent on the intensity of the white light and on the wavelength of the color light, being longer when the role of the photoreceptors connected to a more distant synapse is stronger.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"8 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":"124278299","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.1028168
Renato Fabbri, L. Costa, J. Barrera
cDNA microarrays, or biochips, are a technology used to measure gene expression on a large-scale basis. One of the critical issues of microarray experiments is the analysis of the produced images, which are the raw data from which measurements need to be made. However, the first stage, i.e. spot gridding, is not performed fully automatically in most microarray image analysis software. A novel, nonparametric gridding technique is proposed in this paper. Basically, the vertical and horizontal image projections are processed independently. An image is formed for each projection by plotting it into a 2D image, yielding a binary shape. Scale-space skeletonization is then performed in order to extract hierarchical representations of the signal. Using a criterion based on the number of blocks (or spots) in the microarray image, we select the scale in which the blocks(or spots) are detected. Experimental results for block segmentation, which constitutes the most difficult task in microarray gridding, are also shown.
{"title":"Towards non-parametric gridding of microarray images","authors":"Renato Fabbri, L. Costa, J. Barrera","doi":"10.1109/ICDSP.2002.1028168","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028168","url":null,"abstract":"cDNA microarrays, or biochips, are a technology used to measure gene expression on a large-scale basis. One of the critical issues of microarray experiments is the analysis of the produced images, which are the raw data from which measurements need to be made. However, the first stage, i.e. spot gridding, is not performed fully automatically in most microarray image analysis software. A novel, nonparametric gridding technique is proposed in this paper. Basically, the vertical and horizontal image projections are processed independently. An image is formed for each projection by plotting it into a 2D image, yielding a binary shape. Scale-space skeletonization is then performed in order to extract hierarchical representations of the signal. Using a criterion based on the number of blocks (or spots) in the microarray image, we select the scale in which the blocks(or spots) are detected. Experimental results for block segmentation, which constitutes the most difficult task in microarray gridding, are also shown.","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":"121791378","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.1028308
E. Hore, B. Qiu, H. Wu
In this paper an extension is proposed for the MWC switch-based detection filter. The proposed algorithm uses the partial derivatives of the pixel channels for the x and y direction in order to calculate a new estimate for the pixels that were classified as corrupted and replaced by a median filter output. The algorithm is performed as a final stage of the filter process and as it is only carried out on the detected noise pixels, it has a relatively low computational cost. In addition, it requires no parameters or weighting coefficients so there is no additional training time incurred. The new extension performs exceptionally well, providing an improvement for PSNR measures with both impulse and Gaussian noise types. It is currently performed over each colour channel in the RGB space.
{"title":"A differential enhancement to the multiple window configuration (MWC) image restoration filter","authors":"E. Hore, B. Qiu, H. Wu","doi":"10.1109/ICDSP.2002.1028308","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028308","url":null,"abstract":"In this paper an extension is proposed for the MWC switch-based detection filter. The proposed algorithm uses the partial derivatives of the pixel channels for the x and y direction in order to calculate a new estimate for the pixels that were classified as corrupted and replaced by a median filter output. The algorithm is performed as a final stage of the filter process and as it is only carried out on the detected noise pixels, it has a relatively low computational cost. In addition, it requires no parameters or weighting coefficients so there is no additional training time incurred. The new extension performs exceptionally well, providing an improvement for PSNR measures with both impulse and Gaussian noise types. It is currently performed over each colour channel in the RGB space.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"5 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":"125162218","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.1028263
Zehang Sun, G. Bebis, Ronald Miller
On-road vehicle detection is an important problem with application to driver assistance systems and autonomous, self-guided vehicles. The focus of this paper is on the problem of feature extraction and classification for rear-view vehicle detection. Specifically, we propose using Gabor filters for vehicle feature extraction and support vector machines (SVM) for vehicle detection. Gabor filters provide a mechanism for obtaining some degree of invariance to intensity due to global illumination, selectivity in scale, and selectivity in orientation. Basically, they are orientation and scale tunable edge and line detectors. Vehicles do contain strong edges and lines at different orientation and scales, thus, the statistics of these features (e.g., mean, standard deviation, and skewness) could be very powerful for vehicle detection. To provide robustness, these statistics are not extracted from the whole image but rather are collected from several subimages obtained by subdividing the original image into subwindows. These features are then used to train a SVM classifier. Extensive experimentation and comparisons using real data, different features (e.g., based on principal components analysis (PCA)), and different classifiers (e.g., neural networks (NN)) demonstrate the superiority of the proposed approach which has achieved an average accuracy of 94.81% on completely novel test images.
{"title":"On-road vehicle detection using Gabor filters and support vector machines","authors":"Zehang Sun, G. Bebis, Ronald Miller","doi":"10.1109/ICDSP.2002.1028263","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028263","url":null,"abstract":"On-road vehicle detection is an important problem with application to driver assistance systems and autonomous, self-guided vehicles. The focus of this paper is on the problem of feature extraction and classification for rear-view vehicle detection. Specifically, we propose using Gabor filters for vehicle feature extraction and support vector machines (SVM) for vehicle detection. Gabor filters provide a mechanism for obtaining some degree of invariance to intensity due to global illumination, selectivity in scale, and selectivity in orientation. Basically, they are orientation and scale tunable edge and line detectors. Vehicles do contain strong edges and lines at different orientation and scales, thus, the statistics of these features (e.g., mean, standard deviation, and skewness) could be very powerful for vehicle detection. To provide robustness, these statistics are not extracted from the whole image but rather are collected from several subimages obtained by subdividing the original image into subwindows. These features are then used to train a SVM classifier. Extensive experimentation and comparisons using real data, different features (e.g., based on principal components analysis (PCA)), and different classifiers (e.g., neural networks (NN)) demonstrate the superiority of the proposed approach which has achieved an average accuracy of 94.81% on completely novel test images.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"95 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":"122051745","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.1028149
A. Doulamis, N. Doulamis
A video content representation framework is proposed in this paper, for extracting limited, but meaningful, information of video data, directly from the MPEG compressed domain. In particular, extraction of several representative shots is performed for each video sequence in a content based rate sampling framework. An approach, based on minimization of a cross-correlation criterion of the video frames has been adopted for the shot selection. For efficient implementation of the latter approach, a logarithmic search in a stochastic framework is proposed. The method always converges to the global minimum as is proven in the paper.
{"title":"Stochastic search algorithms for optimal content-based sampling of video sequences","authors":"A. Doulamis, N. Doulamis","doi":"10.1109/ICDSP.2002.1028149","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028149","url":null,"abstract":"A video content representation framework is proposed in this paper, for extracting limited, but meaningful, information of video data, directly from the MPEG compressed domain. In particular, extraction of several representative shots is performed for each video sequence in a content based rate sampling framework. An approach, based on minimization of a cross-correlation criterion of the video frames has been adopted for the shot selection. For efficient implementation of the latter approach, a logarithmic search in a stochastic framework is proposed. The method always converges to the global minimum as is proven in the paper.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"56 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":"123782624","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.1028156
M. Azimi, P. Nasiopoulos, R. Ward
In digital TV systems, variable bitrate encoding is usually used to improve the bandwidth usage efficiency. Since the transmission channel has a fixed bandwidth, this leaves some portions of the bandwidth unoccupied. This free space can be used to transmit extra data to enhance the TV content, which can be either discrete, like text, or streaming, like video and audio. We address the problem of adding time-sensitive streaming data to a TV program. The crucial part of this problem is a scheduling algorithm that guarantees the on-time delivery of the incidental data to the decoder. We present a sophisticated time-sensitive scheduling algorithm for off-line multiplexing of TV programs and incidental streaming data. The two important features of our algorithm are: 1) it minimizes the presentation delay for incidental and main streams; 2) it minimizes the required decoder buffer size for incidental data. Comparing the experimental results of our algorithm with existing scheduling methods shows that our algorithm significantly reduces the presentation delay and the decoder buffer size for the incidental streams.
{"title":"A scheduling scheme for multiplexing extra streaming data into digital TV programs","authors":"M. Azimi, P. Nasiopoulos, R. Ward","doi":"10.1109/ICDSP.2002.1028156","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028156","url":null,"abstract":"In digital TV systems, variable bitrate encoding is usually used to improve the bandwidth usage efficiency. Since the transmission channel has a fixed bandwidth, this leaves some portions of the bandwidth unoccupied. This free space can be used to transmit extra data to enhance the TV content, which can be either discrete, like text, or streaming, like video and audio. We address the problem of adding time-sensitive streaming data to a TV program. The crucial part of this problem is a scheduling algorithm that guarantees the on-time delivery of the incidental data to the decoder. We present a sophisticated time-sensitive scheduling algorithm for off-line multiplexing of TV programs and incidental streaming data. The two important features of our algorithm are: 1) it minimizes the presentation delay for incidental and main streams; 2) it minimizes the required decoder buffer size for incidental data. Comparing the experimental results of our algorithm with existing scheduling methods shows that our algorithm significantly reduces the presentation delay and the decoder buffer size for the incidental streams.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"62 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":"123797529","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.1028189
T. Harte, A. Bors
Watermarking has been used for protecting the copyright information in various data such as audio signals, images and video. Copyright protection of graphical objects and models is important for protecting author rights in animation, multimedia, computer-aided design (CAD), virtual reality, medical imaging, etc. Watermarking techniques in 3D graphical objects are facing new challenges because of the specific nature of the information available in 3D graphics. In this paper we suggest a blind watermarking algorithm for 3D models and objects. A string of bits is embedded in the geometrical structure of the graphical object by changing the locations of certain vertices. The criterion employed for selecting the vertices ensures a minimal visibility of the distortion in the watermarked object. The proposed 3D graphical object algorithm is applied in various 3D graphical models including characters and industrial objects.
{"title":"Watermarking graphical objects","authors":"T. Harte, A. Bors","doi":"10.1109/ICDSP.2002.1028189","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028189","url":null,"abstract":"Watermarking has been used for protecting the copyright information in various data such as audio signals, images and video. Copyright protection of graphical objects and models is important for protecting author rights in animation, multimedia, computer-aided design (CAD), virtual reality, medical imaging, etc. Watermarking techniques in 3D graphical objects are facing new challenges because of the specific nature of the information available in 3D graphics. In this paper we suggest a blind watermarking algorithm for 3D models and objects. A string of bits is embedded in the geometrical structure of the graphical object by changing the locations of certain vertices. The criterion employed for selecting the vertices ensures a minimal visibility of the distortion in the watermarked object. The proposed 3D graphical object algorithm is applied in various 3D graphical models including characters and industrial objects.","PeriodicalId":351073,"journal":{"name":"2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628)","volume":"18 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":"126439792","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.1028317
M. Shimizu, M. Okutomi
Area-based matching and sub-pixel displacement estimation using similarity measures are common methods for various fields. Sub-pixel estimation using parabola fitting over three points with their similarity measures is also a common method to increase the resolution of matching. However, this estimation contains a systematic error depending on the image characteristics, the similarity function, and the fitting function used for the sub-pixel estimation. The characteristics of sub-pixel estimation error have been clarified using a simple analysis model. Although this model is quite simple, it enables us to make a theoretical analysis for general images without assuming any specific image pattern. Through this analysis, it has been shown that there are the right combinations of similarity functions and fitting functions. Also, the so-called "pixel-locking" effect, where the estimated positions tend to be biased toward integer values, is explained. Finally, the analyses are verified with an experiment using real images.
{"title":"An analysis of sub-pixel estimation error on area-based image matching","authors":"M. Shimizu, M. Okutomi","doi":"10.1109/ICDSP.2002.1028317","DOIUrl":"https://doi.org/10.1109/ICDSP.2002.1028317","url":null,"abstract":"Area-based matching and sub-pixel displacement estimation using similarity measures are common methods for various fields. Sub-pixel estimation using parabola fitting over three points with their similarity measures is also a common method to increase the resolution of matching. However, this estimation contains a systematic error depending on the image characteristics, the similarity function, and the fitting function used for the sub-pixel estimation. The characteristics of sub-pixel estimation error have been clarified using a simple analysis model. Although this model is quite simple, it enables us to make a theoretical analysis for general images without assuming any specific image pattern. Through this analysis, it has been shown that there are the right combinations of similarity functions and fitting functions. Also, the so-called \"pixel-locking\" effect, where the estimated positions tend to be biased toward integer values, is explained. Finally, the analyses are verified with an experiment using real images.","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":"130593278","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
扫码关注我们
求助内容：
应助结果提醒方式：