Pub Date : 2004-09-27DOI: 10.1109/ISCCSP.2004.1296266
M. Hergli, F. Bouslama, J. Baili, A. Lansari, A. Al-Rawi, K. Besbes
The identification of seabed archaeological objects has become of great importance in the last decades. However, often times identifying and retrieving archeological artifacts is an expensive venture. There is a need to develop economical equipment and efficient signal processing techniques to identify and retrieve underwater artifacts. Current signal processing techniques are quite complex. The purpose of this paper is to first propose a test bed for conducting underwater experiments that can be used in a number of applications such as object identification. The experimental setup uses ultrasound waves. Wavelets are used to de-noise and analyze the ultrasound signals reflected from seabed objects. Results show that the test bed can be easily used to simulate various seabed environments. Experimental results show that wavelets are an effective tool for signal de-noising and identification purposes.
{"title":"Experimental setup for underwater artifact identification and signal analysis using wavelets","authors":"M. Hergli, F. Bouslama, J. Baili, A. Lansari, A. Al-Rawi, K. Besbes","doi":"10.1109/ISCCSP.2004.1296266","DOIUrl":"https://doi.org/10.1109/ISCCSP.2004.1296266","url":null,"abstract":"The identification of seabed archaeological objects has become of great importance in the last decades. However, often times identifying and retrieving archeological artifacts is an expensive venture. There is a need to develop economical equipment and efficient signal processing techniques to identify and retrieve underwater artifacts. Current signal processing techniques are quite complex. The purpose of this paper is to first propose a test bed for conducting underwater experiments that can be used in a number of applications such as object identification. The experimental setup uses ultrasound waves. Wavelets are used to de-noise and analyze the ultrasound signals reflected from seabed objects. Results show that the test bed can be easily used to simulate various seabed environments. Experimental results show that wavelets are an effective tool for signal de-noising and identification purposes.","PeriodicalId":146713,"journal":{"name":"First International Symposium on Control, Communications and Signal Processing, 2004.","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131515404","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 : 2004-09-27DOI: 10.1109/ISCCSP.2004.1296325
E. B. Braiek, N. Aouina, S. Abid, M. Cheriet
In this paper, we present a new handwritten character recognition algorithm. The proposed algorithm is based on three main steps. In the first one the original characters are segmented using separable kernel compact support (SKCS) method. In the second step a preprocessing phases: skeleton, separation, resizing, and a polyline approximation processes are then applied to the SKCS segmented characters. In the last step a handwritten hidden Markov model (HMM) is used to recognize the characters from the Cartesian coordinates of their main strokes. Simulation results are presented showing the usefulness of this new recognition method.
{"title":"Handwritten characters recognition based on SKCS-polyline and hidden Markov model (HMM)","authors":"E. B. Braiek, N. Aouina, S. Abid, M. Cheriet","doi":"10.1109/ISCCSP.2004.1296325","DOIUrl":"https://doi.org/10.1109/ISCCSP.2004.1296325","url":null,"abstract":"In this paper, we present a new handwritten character recognition algorithm. The proposed algorithm is based on three main steps. In the first one the original characters are segmented using separable kernel compact support (SKCS) method. In the second step a preprocessing phases: skeleton, separation, resizing, and a polyline approximation processes are then applied to the SKCS segmented characters. In the last step a handwritten hidden Markov model (HMM) is used to recognize the characters from the Cartesian coordinates of their main strokes. Simulation results are presented showing the usefulness of this new recognition method.","PeriodicalId":146713,"journal":{"name":"First International Symposium on Control, Communications and Signal Processing, 2004.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131165398","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 : 2004-09-27DOI: 10.1109/ISCCSP.2004.1296461
J. Hagenauer, N. Dutsch, J. Barros, A. Schaefer
For joint source channel coding we extend the concept of incremental redundancy to a combination of decremental and incremental redundancy in a parallel concatenated turbo scheme. Even for compression only the new scheme outperforms Lempel-Ziv compression, but has many advantages in adaptive type II FEC/ARQ systems for the transmission over noisy channels.
{"title":"Incremental and decremental redundancy in turbo source-channel coding","authors":"J. Hagenauer, N. Dutsch, J. Barros, A. Schaefer","doi":"10.1109/ISCCSP.2004.1296461","DOIUrl":"https://doi.org/10.1109/ISCCSP.2004.1296461","url":null,"abstract":"For joint source channel coding we extend the concept of incremental redundancy to a combination of decremental and incremental redundancy in a parallel concatenated turbo scheme. Even for compression only the new scheme outperforms Lempel-Ziv compression, but has many advantages in adaptive type II FEC/ARQ systems for the transmission over noisy channels.","PeriodicalId":146713,"journal":{"name":"First International Symposium on Control, Communications and Signal Processing, 2004.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133557316","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 : 2004-09-27DOI: 10.1109/ISCCSP.2004.1296319
S. Khanfir, M. Jemni, E. B. Braiek
Wavelet analysis has received considerable interest in the recent years because of its efficiency in the several practical applications. Image processing for wavelet transformation is considered as one of the most powerful methods that provide a good quality of results. However, its implementation may be too time-consuming accordingly to the problem size. Parallel processing can be a solution to speed up wavelet transformation programs. In this context, and in order to have a quick image compression/decompression program based on 1D wavelet transformation, we have designed three parallel algorithms that where implemented on an IBM RS6000/SP machine. The first parallel algorithm exploits control parallelism it was developed with OpenMP and executed on one four-processor node. The two others exploit data parallelism and were developed with MPI directives. Finally, we present an evaluation of these algorithms based on an experimental study.
{"title":"Parallelization of an image compression and decompression algorithm based on 1D wavelet transformation","authors":"S. Khanfir, M. Jemni, E. B. Braiek","doi":"10.1109/ISCCSP.2004.1296319","DOIUrl":"https://doi.org/10.1109/ISCCSP.2004.1296319","url":null,"abstract":"Wavelet analysis has received considerable interest in the recent years because of its efficiency in the several practical applications. Image processing for wavelet transformation is considered as one of the most powerful methods that provide a good quality of results. However, its implementation may be too time-consuming accordingly to the problem size. Parallel processing can be a solution to speed up wavelet transformation programs. In this context, and in order to have a quick image compression/decompression program based on 1D wavelet transformation, we have designed three parallel algorithms that where implemented on an IBM RS6000/SP machine. The first parallel algorithm exploits control parallelism it was developed with OpenMP and executed on one four-processor node. The two others exploit data parallelism and were developed with MPI directives. Finally, we present an evaluation of these algorithms based on an experimental study.","PeriodicalId":146713,"journal":{"name":"First International Symposium on Control, Communications and Signal Processing, 2004.","volume":" 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132187559","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 : 2004-09-27DOI: 10.1109/ISCCSP.2004.1296447
N. Gresset, J. Boutros, L. Brunel
We propose a universal linear precoder for bit-interleaved coded QAM modulations transmitted over frequency non-selective multiple antenna channels. The precoder is based on cyclotomic multi-dimensional rotations and does not require the knowledge of the channel matrix at the transmitter side. The preceding performance analysis is made via the genie method by assuming a receiver with iterative APP detection. We also describe a new singleton bound on the diversity order that takes into account the time-spreading factor of the precoder. This new bound is indispensable to select the precoder size yielding the maximum diversity order while minimizing the detector's complexity.
{"title":"Linear precoding under iterative processing for multiple antenna channels","authors":"N. Gresset, J. Boutros, L. Brunel","doi":"10.1109/ISCCSP.2004.1296447","DOIUrl":"https://doi.org/10.1109/ISCCSP.2004.1296447","url":null,"abstract":"We propose a universal linear precoder for bit-interleaved coded QAM modulations transmitted over frequency non-selective multiple antenna channels. The precoder is based on cyclotomic multi-dimensional rotations and does not require the knowledge of the channel matrix at the transmitter side. The preceding performance analysis is made via the genie method by assuming a receiver with iterative APP detection. We also describe a new singleton bound on the diversity order that takes into account the time-spreading factor of the precoder. This new bound is indispensable to select the precoder size yielding the maximum diversity order while minimizing the detector's complexity.","PeriodicalId":146713,"journal":{"name":"First International Symposium on Control, Communications and Signal Processing, 2004.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115529724","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 : 2004-09-27DOI: 10.1109/ISCCSP.2004.1296267
A. Moreno, T. Alieva, M. L. Calvo
It is shown theoretically and experimentally that the additional self images at the fractional Talbot distances are observed if the initiator of the periodic structure possesses a certain symmetry.
理论和实验表明，如果周期结构的引发剂具有一定的对称性，则可以观察到分数阶塔尔博特距离上的附加自像。
{"title":"Fractional Talbot images of periodic gratings with a certain symmetry","authors":"A. Moreno, T. Alieva, M. L. Calvo","doi":"10.1109/ISCCSP.2004.1296267","DOIUrl":"https://doi.org/10.1109/ISCCSP.2004.1296267","url":null,"abstract":"It is shown theoretically and experimentally that the additional self images at the fractional Talbot distances are observed if the initiator of the periodic structure possesses a certain symmetry.","PeriodicalId":146713,"journal":{"name":"First International Symposium on Control, Communications and Signal Processing, 2004.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124030703","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 : 2004-09-27DOI: 10.1109/ISCCSP.2004.1296240
K. Laabidi, F. Bouani
Control of nonlinear uncertain dynamical systems is considered. The artificial neural networks (ANNs) are used to model the process. For each operating level an ANN is determined. The model predictive type of controller is designed that utilizes a set of ANN model and employs the input constraints. The nondominated sorting genetic algorithm (NSGA) is applied to solve the multiobjective optimization problem. The proposed control schema is applied to a numerical example and the simulation results are included.
{"title":"Genetic algorithms for multiobjective predictive control","authors":"K. Laabidi, F. Bouani","doi":"10.1109/ISCCSP.2004.1296240","DOIUrl":"https://doi.org/10.1109/ISCCSP.2004.1296240","url":null,"abstract":"Control of nonlinear uncertain dynamical systems is considered. The artificial neural networks (ANNs) are used to model the process. For each operating level an ANN is determined. The model predictive type of controller is designed that utilizes a set of ANN model and employs the input constraints. The nondominated sorting genetic algorithm (NSGA) is applied to solve the multiobjective optimization problem. The proposed control schema is applied to a numerical example and the simulation results are included.","PeriodicalId":146713,"journal":{"name":"First International Symposium on Control, Communications and Signal Processing, 2004.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124619329","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 : 2004-09-27DOI: 10.1109/ISCCSP.2004.1296503
B. Rim, M. Sylvie
The network of Kalman filter (NKF) structure was proposed to perform optimal Bayesian symbol-by-symbol estimation in a SISO equalization context [(P. Grohan et al., September 1997)(R. Amara et al., 2002)]. By approximating the error filtering covariance matrix of each branch of the network by a diagonal one, we show in this paper that the NKF can be simplified into a particular network of normalized LMS filters (NLMSF) minimizing the error on the predicted channel output, so that reducing the corresponding complexity. We also propose an adjusting procedure of the approximating matrix which is still related to the second order statistics of the symbol state estimation error. Simulations show the good performance of the NLMSF based equalizer compared to the NKF version for both short and long memory linear channels.
提出了一种基于卡尔曼滤波(NKF)结构的网络，用于在SISO均衡环境下进行最优贝叶斯逐符号估计[P]。Grohan et al.， 1997年9月。Amara et al.， 2002)。通过用对角矩阵逼近网络各分支的误差滤波协方差矩阵，我们证明了NKF可以简化为一个特定的归一化LMS滤波器网络(NLMSF)，使预测信道输出上的误差最小化，从而降低了相应的复杂度。我们还提出了一种与符号状态估计误差的二阶统计量有关的近似矩阵的调整方法。仿真结果表明，与NKF相比，基于NLMSF的均衡器在短存储器和长存储器线性信道上都具有良好的性能。
{"title":"A simplified network of LMS filters for Bayesian equalization based on a state model","authors":"B. Rim, M. Sylvie","doi":"10.1109/ISCCSP.2004.1296503","DOIUrl":"https://doi.org/10.1109/ISCCSP.2004.1296503","url":null,"abstract":"The network of Kalman filter (NKF) structure was proposed to perform optimal Bayesian symbol-by-symbol estimation in a SISO equalization context [(P. Grohan et al., September 1997)(R. Amara et al., 2002)]. By approximating the error filtering covariance matrix of each branch of the network by a diagonal one, we show in this paper that the NKF can be simplified into a particular network of normalized LMS filters (NLMSF) minimizing the error on the predicted channel output, so that reducing the corresponding complexity. We also propose an adjusting procedure of the approximating matrix which is still related to the second order statistics of the symbol state estimation error. Simulations show the good performance of the NLMSF based equalizer compared to the NKF version for both short and long memory linear channels.","PeriodicalId":146713,"journal":{"name":"First International Symposium on Control, Communications and Signal Processing, 2004.","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124798627","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 : 2004-09-27DOI: 10.1109/ISCCSP.2004.1296486
F. Bahloul, M. Zghal, R. Chatta, R. Attia
In this paper we present an analysis and design of the microstructured optical fibres using the effective index and the Galerkin models. Some performance of air guiding microstructured fibers is discussed. We establish the effective indexes, field distributions and chromatic dispersion of the guided modes. We demonstrate that the full-vectorial Galerkin method can be efficiently used to obtain the propagation characteristics of microstructured optical fibres. Comparison with previous models and numerical methods is made and excellent agreement is achieved.
{"title":"Modelling microstructured optical fibres","authors":"F. Bahloul, M. Zghal, R. Chatta, R. Attia","doi":"10.1109/ISCCSP.2004.1296486","DOIUrl":"https://doi.org/10.1109/ISCCSP.2004.1296486","url":null,"abstract":"In this paper we present an analysis and design of the microstructured optical fibres using the effective index and the Galerkin models. Some performance of air guiding microstructured fibers is discussed. We establish the effective indexes, field distributions and chromatic dispersion of the guided modes. We demonstrate that the full-vectorial Galerkin method can be efficiently used to obtain the propagation characteristics of microstructured optical fibres. Comparison with previous models and numerical methods is made and excellent agreement is achieved.","PeriodicalId":146713,"journal":{"name":"First International Symposium on Control, Communications and Signal Processing, 2004.","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127050010","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 : 2004-09-27DOI: 10.1109/ISCCSP.2004.1296280
D. Khedim, A. Benyettou, M. Woolfson
The characteristic (transfer function) of a dispersive M-ary channel equalizer designed through a Bayesian estimator, a performance indicator that is not trivial to obtain for M>2 due to intersymbol interference (ISI), is investigated. A set of curves is obtained and interpreted. Implementation through a radial basis function neural network is considered. It is shown that because network centers endure updating with different rates, the equalizer characteristic errates off the optimum, causing thus the symbol error rate and/or the training time to increase. A solution, based on incorporating an underlying symmetry in the channel response levels into the updating algorithm, brings the characteristic uniformly closer to the optimal one. It is also provided a strategy endowing the network with self-initializing. Simulation results are presented for a channel with sufficient ISI strength.
{"title":"A robust RBF neural net Bayesian estimator for channel equalization","authors":"D. Khedim, A. Benyettou, M. Woolfson","doi":"10.1109/ISCCSP.2004.1296280","DOIUrl":"https://doi.org/10.1109/ISCCSP.2004.1296280","url":null,"abstract":"The characteristic (transfer function) of a dispersive M-ary channel equalizer designed through a Bayesian estimator, a performance indicator that is not trivial to obtain for M>2 due to intersymbol interference (ISI), is investigated. A set of curves is obtained and interpreted. Implementation through a radial basis function neural network is considered. It is shown that because network centers endure updating with different rates, the equalizer characteristic errates off the optimum, causing thus the symbol error rate and/or the training time to increase. A solution, based on incorporating an underlying symmetry in the channel response levels into the updating algorithm, brings the characteristic uniformly closer to the optimal one. It is also provided a strategy endowing the network with self-initializing. Simulation results are presented for a channel with sufficient ISI strength.","PeriodicalId":146713,"journal":{"name":"First International Symposium on Control, Communications and Signal Processing, 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130021777","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
扫码关注我们
求助内容：
应助结果提醒方式：