Pub Date : 2007-11-01DOI: 10.1109/ICSPC.2007.4728348
R. Shubair, R.S. Al Nuaimi
This paper proposes a displaced sensor array (DSA) configuration for estimating the angles of arrival of narrow-band sources arriving at grazing incidence directions. Unlike the conventional uniform linear array (ULA) where all the array elements are aligned along one axis, the proposed DSA configuration comprises two displaced ULAs aligned on two parallel axes in the vertical plane. The steering vectors of the two parallel arrays differ from each other by only two multiplicative phase terms that represent the space factors due to the vertical separation and horizontal displacement of the two arrays. This makes the computational load of using MUSIC algorithm with the proposed DSA configuration identical to that of ULA. Simulation results obtained for cases involving narrow-band sources arriving at grazing incidence angles show that the proposed DSA configuration outperforms ULA in terms numerical accuracy and angular resolution.
{"title":"A Displaced Sensor Array Configuration for Estimating Angles of Arrival of Narrowband Sources under Grazing Incidence Conditions","authors":"R. Shubair, R.S. Al Nuaimi","doi":"10.1109/ICSPC.2007.4728348","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728348","url":null,"abstract":"This paper proposes a displaced sensor array (DSA) configuration for estimating the angles of arrival of narrow-band sources arriving at grazing incidence directions. Unlike the conventional uniform linear array (ULA) where all the array elements are aligned along one axis, the proposed DSA configuration comprises two displaced ULAs aligned on two parallel axes in the vertical plane. The steering vectors of the two parallel arrays differ from each other by only two multiplicative phase terms that represent the space factors due to the vertical separation and horizontal displacement of the two arrays. This makes the computational load of using MUSIC algorithm with the proposed DSA configuration identical to that of ULA. Simulation results obtained for cases involving narrow-band sources arriving at grazing incidence angles show that the proposed DSA configuration outperforms ULA in terms numerical accuracy and angular resolution.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129086743","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 : 2007-11-01DOI: 10.1109/ICSPC.2007.4728411
S. Chitroub, R. Hachemi
We propose here a new method for POLSAR image analysis. The method is based on a new PCA-ICA model in which the relative Newton-based approach for performing ICA is developed. The basic idea of ICA with relative Newton method consists in approximating the negentropy by taking account of the orthogonality constraint of the extracted components. This concept is recognized for its robustness and gives consequently very good theoretical results. The approach is well justified from the mathematical point of view. However, its implementation requires being more flexible because of the number of the estimated parameters. The purpose of this paper is to try to open new issues, in future research, in the concern of working out a new method for SAR image analysis that accumulate the advantages of the proposed method while avoiding its disadvantages.
{"title":"Independent Component Analysis of POLSAR Images. Relative Newton-Based Approach","authors":"S. Chitroub, R. Hachemi","doi":"10.1109/ICSPC.2007.4728411","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728411","url":null,"abstract":"We propose here a new method for POLSAR image analysis. The method is based on a new PCA-ICA model in which the relative Newton-based approach for performing ICA is developed. The basic idea of ICA with relative Newton method consists in approximating the negentropy by taking account of the orthogonality constraint of the extracted components. This concept is recognized for its robustness and gives consequently very good theoretical results. The approach is well justified from the mathematical point of view. However, its implementation requires being more flexible because of the number of the estimated parameters. The purpose of this paper is to try to open new issues, in future research, in the concern of working out a new method for SAR image analysis that accumulate the advantages of the proposed method while avoiding its disadvantages.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131870456","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 : 2007-11-01DOI: 10.1109/ICSPC.2007.4728316
A. Zaher, A. Abu-Rezq
This paper explores the use of notch filters for the purpose of damping out chaotic oscillations. The design of the filter and the way it is interfaced to the system are investigated from a signal-processing point of view. A Chua's circuit, that has typical applications in synchronization and secure communications, is used to exemplify the suggested methodology where both theoretical and experimental results are provided. The power spectrum of the original system is analyzed to selectively damp-out portions of the power spectrum, thus truncating period-doubling, the original cause of chaos. Both single and double notch filters are explored to examine their effect on the performance of the modified system. Practical implementation's issues are addressed and advantages and limitations of the proposed method are highlighted.
{"title":"Tuning of Notch Filters for Controlling Chaos in a Chua's Circuit","authors":"A. Zaher, A. Abu-Rezq","doi":"10.1109/ICSPC.2007.4728316","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728316","url":null,"abstract":"This paper explores the use of notch filters for the purpose of damping out chaotic oscillations. The design of the filter and the way it is interfaced to the system are investigated from a signal-processing point of view. A Chua's circuit, that has typical applications in synchronization and secure communications, is used to exemplify the suggested methodology where both theoretical and experimental results are provided. The power spectrum of the original system is analyzed to selectively damp-out portions of the power spectrum, thus truncating period-doubling, the original cause of chaos. Both single and double notch filters are explored to examine their effect on the performance of the modified system. Practical implementation's issues are addressed and advantages and limitations of the proposed method are highlighted.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131629243","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 : 2007-11-01DOI: 10.1109/ICSPC.2007.4728485
T. Shanableh, K. Assaleh
This work introduces two novel approaches to feature extractions of video-based Arabic sign language gestures namely: motion representation through motion estimation and motion representation through motion residuals. In the former, motion estimation is used to compute the motion vectors of a video-based gesture. The vertical and horizontal components of such vectors are rearranged into intensity images and transformed into the frequency domain. On the other hand, if motion is represented through motion residuals then such residuals are thresholded and transformed into the frequency domain. The motion information is then temporally accumulated through either telescopic motion vector composition or polar accumulated differences. The feature vectors are extracted from the accumulated motion information. The superiority of the proposed feature extraction techniques is illustrated through comparisons with existing work.
{"title":"Time Sensitive and Non-Time Sensitive Feature Extractions in Arabic Sign Language Recognition","authors":"T. Shanableh, K. Assaleh","doi":"10.1109/ICSPC.2007.4728485","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728485","url":null,"abstract":"This work introduces two novel approaches to feature extractions of video-based Arabic sign language gestures namely: motion representation through motion estimation and motion representation through motion residuals. In the former, motion estimation is used to compute the motion vectors of a video-based gesture. The vertical and horizontal components of such vectors are rearranged into intensity images and transformed into the frequency domain. On the other hand, if motion is represented through motion residuals then such residuals are thresholded and transformed into the frequency domain. The motion information is then temporally accumulated through either telescopic motion vector composition or polar accumulated differences. The feature vectors are extracted from the accumulated motion information. The superiority of the proposed feature extraction techniques is illustrated through comparisons with existing work.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133739820","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 : 2007-11-01DOI: 10.1109/ICSPC.2007.4728246
A. Osseiran, A. Logothetis, S. Ben Slimane, P. Larsson
A cooperative communication scheme referred to as relay cyclic delay diversity (RCDD) is presented in this paper. The scheme is based on a set of distributed relay nodes (RNs) with each node associated with a certain cyclic shift in order to generate artificially multi-path diversity and equivalently frequency diversity. RCDD is an open loop scheme and the user terminal (UT) only needs to estimate an effective channel from all the RNs and not the channel from each RN. The effective channel induced by RCDD is frequency selective and can be exploited by a maximum signal to interference noise ratio (SINR) scheduler which improves substantially the system throughput. The SINR of the RCDD is derived analytically and the performance of the method is evaluated in a dynamic multi-cell multi-user simulator. The results show considerable SINR gains that translate into substantial cell throughput gains compared to 1-hop systems.
{"title":"Relay Cyclic Delay Diversity: Modeling & System Performance","authors":"A. Osseiran, A. Logothetis, S. Ben Slimane, P. Larsson","doi":"10.1109/ICSPC.2007.4728246","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728246","url":null,"abstract":"A cooperative communication scheme referred to as relay cyclic delay diversity (RCDD) is presented in this paper. The scheme is based on a set of distributed relay nodes (RNs) with each node associated with a certain cyclic shift in order to generate artificially multi-path diversity and equivalently frequency diversity. RCDD is an open loop scheme and the user terminal (UT) only needs to estimate an effective channel from all the RNs and not the channel from each RN. The effective channel induced by RCDD is frequency selective and can be exploited by a maximum signal to interference noise ratio (SINR) scheduler which improves substantially the system throughput. The SINR of the RCDD is derived analytically and the performance of the method is evaluated in a dynamic multi-cell multi-user simulator. The results show considerable SINR gains that translate into substantial cell throughput gains compared to 1-hop systems.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133456376","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 : 2007-11-01DOI: 10.1109/ICSPC.2007.4728338
R. Sachdeva, S. Johar, E. Piccinelli
This paper describes a transcoding algorithm able to transcode a compressed video bitstream into a WMV9 (VC1) compliant bitstream. A Closed-Loop Spatial Domain Transcoding approach, modeled on the Cascaded Pixel Domain Transcoder (CPDT) is presented here. It incorporates reusing of information obtained from the input bitstream. To enhance the performance of the transcoder, an approach for pipelining the encoder/decoder processes in the transcoder is proposed here. These modifications can be easily adapted to all the transcoders producing WMV9 as output, the input for whom may include video streams of type MPEG-2, MPEG-4 or H.264. As a proof of concept, the suggested approach has been applied to the case of MPEG-2 to VC1 transcoding. Extensive analysis has been performed and the ultimate gain in transcoding speed achieved for the presented approach compared with MPEG-2 to VC1 CPDT, is in the range of 3 to 7 times faster than CPDT.
{"title":"Transcoding Compressed Video Signals to WMV9","authors":"R. Sachdeva, S. Johar, E. Piccinelli","doi":"10.1109/ICSPC.2007.4728338","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728338","url":null,"abstract":"This paper describes a transcoding algorithm able to transcode a compressed video bitstream into a WMV9 (VC1) compliant bitstream. A Closed-Loop Spatial Domain Transcoding approach, modeled on the Cascaded Pixel Domain Transcoder (CPDT) is presented here. It incorporates reusing of information obtained from the input bitstream. To enhance the performance of the transcoder, an approach for pipelining the encoder/decoder processes in the transcoder is proposed here. These modifications can be easily adapted to all the transcoders producing WMV9 as output, the input for whom may include video streams of type MPEG-2, MPEG-4 or H.264. As a proof of concept, the suggested approach has been applied to the case of MPEG-2 to VC1 transcoding. Extensive analysis has been performed and the ultimate gain in transcoding speed achieved for the presented approach compared with MPEG-2 to VC1 CPDT, is in the range of 3 to 7 times faster than CPDT.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132728408","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 : 2007-11-01DOI: 10.1109/ICSPC.2007.4728412
H. Ijima, A. Matsuoka, T. Nakajima, A. Ohsumi
The purpose of this paper is to estimate unknown motion parameters, acceleration and initial velocity, from the radar signal corrupted by random noise. The principal attack of the approach is to use the (pseudo)-Wigner distribution which is computed from the noisy observation data. Parameters are estimated by least-squares method for the noisy instantaneous frequency of returned signal. Numerical simulations are presented to verify the efficacy of the proposed method.
{"title":"Estimation of Motion Parameters of Moving Target using Wigner Distribution","authors":"H. Ijima, A. Matsuoka, T. Nakajima, A. Ohsumi","doi":"10.1109/ICSPC.2007.4728412","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728412","url":null,"abstract":"The purpose of this paper is to estimate unknown motion parameters, acceleration and initial velocity, from the radar signal corrupted by random noise. The principal attack of the approach is to use the (pseudo)-Wigner distribution which is computed from the noisy observation data. Parameters are estimated by least-squares method for the noisy instantaneous frequency of returned signal. Numerical simulations are presented to verify the efficacy of the proposed method.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116763181","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 : 2007-11-01DOI: 10.1109/ICSPC.2007.4728553
S. Pullola, P. Atrey, Abdulmotaleb El Saddik
Current GPS-based vehicle navigation systems provide drivers with information about the location and the availability of a parking lot near the specified destination. However, this availability information is provided based only on the current state of the parking lot. Therefore, they fail to predict whether the vehicle would be able to get a parking lot when it actually arrives. In this paper, we propose a scientific solution to this problem by utilizing the history and current status of the occupancy/availability. We model the availability of a parking lot by the Poisson process, and propose an intelligent algorithm that allows drivers to choose a parking lot with the maximum probability of getting it. The preliminary experimental results show the utility of the proposed algorithm.
{"title":"Towards an Intelligent GPS-Based Vehicle Navigation System for Finding Street Parking Lots","authors":"S. Pullola, P. Atrey, Abdulmotaleb El Saddik","doi":"10.1109/ICSPC.2007.4728553","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728553","url":null,"abstract":"Current GPS-based vehicle navigation systems provide drivers with information about the location and the availability of a parking lot near the specified destination. However, this availability information is provided based only on the current state of the parking lot. Therefore, they fail to predict whether the vehicle would be able to get a parking lot when it actually arrives. In this paper, we propose a scientific solution to this problem by utilizing the history and current status of the occupancy/availability. We model the availability of a parking lot by the Poisson process, and propose an intelligent algorithm that allows drivers to choose a parking lot with the maximum probability of getting it. The preliminary experimental results show the utility of the proposed algorithm.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116283717","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 : 2007-11-01DOI: 10.1109/ICSPC.2007.4728381
M. Nabaee, G. Hossein-Zadeh
Locating the license plate in the image is a key initial step in automatic License Plate Recognition via machine vision. This step becomes more complicated when the image scene is arbitrary (complex) and the view-angle of camera and luminance conditions are not calibrated and constant. In this paper, a new License Plate Detection method in complex scenes is proposed. After removing regions that have a low probability of being a part of plate we apply a series of match filters on the image. These filters correspond to various (unknown) possible sizes of license. Novel improved Gradient operator improves the performance of the filtering stage. Finally a decision is made based on the faithfulness of candidate regions. This step extracts the plate template. This method was applied on 80 gray scale images of complex scene. The positive detection rate of this method was 71% and there was 29% false positive detection.
{"title":"License Plate Detection in Complex Scenes based on Improved Gradient and Match Filtering","authors":"M. Nabaee, G. Hossein-Zadeh","doi":"10.1109/ICSPC.2007.4728381","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728381","url":null,"abstract":"Locating the license plate in the image is a key initial step in automatic License Plate Recognition via machine vision. This step becomes more complicated when the image scene is arbitrary (complex) and the view-angle of camera and luminance conditions are not calibrated and constant. In this paper, a new License Plate Detection method in complex scenes is proposed. After removing regions that have a low probability of being a part of plate we apply a series of match filters on the image. These filters correspond to various (unknown) possible sizes of license. Novel improved Gradient operator improves the performance of the filtering stage. Finally a decision is made based on the faithfulness of candidate regions. This step extracts the plate template. This method was applied on 80 gray scale images of complex scene. The positive detection rate of this method was 71% and there was 29% false positive detection.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116533752","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 : 2007-11-01DOI: 10.1109/ICSPC.2007.4728493
P. Bilane, E. Youssef, B. Eter, C. Sarraf, J. Constantin
This paper describes an online handwriting recognition system. Our system presents a modified and less complex version of the point to point correspondence method that originally relies on a dynamic time warping algorithm. The system first passes through a training phase in which it is taught the handwriting of a certain person. The training consists of the person writing several times all the letters of the alphabet, data acquisition is done using a digitizer tablet. Training data for each character is then stored as pixels coordinates in the same order as their creation. In the recognition phase, the system recognizes a character written by the same person based on the previously done training. The obtained results were very encouraging; a recognition rate of 93.35 % for isolated lower case characters could be achieved relying only on the training done before the recognition phase without the need for a recognition database.
{"title":"Simplified Point to Point Correspondence of the Euclidean Distance for Online Handwriting Recognition","authors":"P. Bilane, E. Youssef, B. Eter, C. Sarraf, J. Constantin","doi":"10.1109/ICSPC.2007.4728493","DOIUrl":"https://doi.org/10.1109/ICSPC.2007.4728493","url":null,"abstract":"This paper describes an online handwriting recognition system. Our system presents a modified and less complex version of the point to point correspondence method that originally relies on a dynamic time warping algorithm. The system first passes through a training phase in which it is taught the handwriting of a certain person. The training consists of the person writing several times all the letters of the alphabet, data acquisition is done using a digitizer tablet. Training data for each character is then stored as pixels coordinates in the same order as their creation. In the recognition phase, the system recognizes a character written by the same person based on the previously done training. The obtained results were very encouraging; a recognition rate of 93.35 % for isolated lower case characters could be achieved relying only on the training done before the recognition phase without the need for a recognition database.","PeriodicalId":425397,"journal":{"name":"2007 IEEE International Conference on Signal Processing and Communications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116600516","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
扫码关注我们
求助内容：
应助结果提醒方式：