Pub Date : 1900-01-01DOI: 10.1109/ISSPA.2001.950194
E. Husni, R. Razali, Azlin Md. Said
The increasing interest of broadband satellite multimedia systems has led to the consideration of higher bands operation, Ka-band (20/30 GHz). This is because of congestion of lower frequency bands such as C and Ku. Propagation impairments (rain attenuation) produced by the troposphere are a limiting factor for the effective use of the Ka-band and the use of smaller earth terminals, especially at tropical countries, i.e., Malaysia, Singapore and Indonesia, while very attractive for customer premise location, make it difficult to provide sufficient link margins for propagation related outages. Here, an alternative solution for broadband wireless systems at tropical countries replacing satellite systems is proposed. The broadband wireless systems is based on high altitude platform systems (HAPS) held geostationary in the stratosphere (approximately 21 km above sea level). The platforms act as the "highest cell tower in town".
{"title":"Broadband communications based on high altitude platform systems (HAPS) for tropical countries","authors":"E. Husni, R. Razali, Azlin Md. Said","doi":"10.1109/ISSPA.2001.950194","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.950194","url":null,"abstract":"The increasing interest of broadband satellite multimedia systems has led to the consideration of higher bands operation, Ka-band (20/30 GHz). This is because of congestion of lower frequency bands such as C and Ku. Propagation impairments (rain attenuation) produced by the troposphere are a limiting factor for the effective use of the Ka-band and the use of smaller earth terminals, especially at tropical countries, i.e., Malaysia, Singapore and Indonesia, while very attractive for customer premise location, make it difficult to provide sufficient link margins for propagation related outages. Here, an alternative solution for broadband wireless systems at tropical countries replacing satellite systems is proposed. The broadband wireless systems is based on high altitude platform systems (HAPS) held geostationary in the stratosphere (approximately 21 km above sea level). The platforms act as the \"highest cell tower in town\".","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125025903","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.949781
J. Manton
The classical steepest descent and Newton algorithms can be used to minimise a cost function f(X). This paper shows how they can be modified to take into account the constraint that the columns of the complex-valued matrix X are mutually orthogonal and have unit norm. It is assumed that the cost function satisfies f(XQ) = f(X) for any unitary matrix Q. This allows the constrained optimisation problem to be converted into an unconstrained one on the Grassmann manifold. This significantly reduces the dimension of the optimisation problem and often results in faster convergence.
{"title":"Modified steepest descent and Newton algorithms for orthogonally constrained optimisation. Part II. The complex Grassmann manifold","authors":"J. Manton","doi":"10.1109/ISSPA.2001.949781","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.949781","url":null,"abstract":"The classical steepest descent and Newton algorithms can be used to minimise a cost function f(X). This paper shows how they can be modified to take into account the constraint that the columns of the complex-valued matrix X are mutually orthogonal and have unit norm. It is assumed that the cost function satisfies f(XQ) = f(X) for any unitary matrix Q. This allows the constrained optimisation problem to be converted into an unconstrained one on the Grassmann manifold. This significantly reduces the dimension of the optimisation problem and often results in faster convergence.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122154482","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.950259
Q. Salih, A. Ramli
Region growing is a general technique for image segmentation, where image characteristics are used to group adjacent pixels together to form regions. This paper presents a parallel algorithm for solving the region growing problem based on the split and merge approach, and uses it to test and compare various parallel architecture models. Image segmentation is the process by which the original image is partitioned into some meaningful regions. It is the foundation of higher level processing; eg, object recognition. Both algorithms are supposed to segment 2D as well as 3D data sets. An objective comparison performs the evaluation using specified region growing, splitting and merging, and region segmentation.
{"title":"Region based segmentation technique and algorithms for 3D image","authors":"Q. Salih, A. Ramli","doi":"10.1109/ISSPA.2001.950259","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.950259","url":null,"abstract":"Region growing is a general technique for image segmentation, where image characteristics are used to group adjacent pixels together to form regions. This paper presents a parallel algorithm for solving the region growing problem based on the split and merge approach, and uses it to test and compare various parallel architecture models. Image segmentation is the process by which the original image is partitioned into some meaningful regions. It is the foundation of higher level processing; eg, object recognition. Both algorithms are supposed to segment 2D as well as 3D data sets. An objective comparison performs the evaluation using specified region growing, splitting and merging, and region segmentation.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123561399","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.950178
J. H. Lim, M. Ratnam
A set of optical signal data generated by shadow moire interferometry represents the profile of the surface that is under investigation. An existing algorithm has been used to process and visualize the optical signal into the three dimensional surface plot and a two-dimensional representation for a cantilever. This algorithm was tested and calibrated by measuring a cylinder surface profile and comparing the result with the actual measurement. An error analysis shows that distortion of the imaging system and the uncollimated light source are two major factors that may contribute to error in the analysis. Finally, an experiment was carried out to measure the deflection of a cantilever and the result is compared with the shape obtained from deflection theory.
{"title":"Optical signal processing for shape measurement","authors":"J. H. Lim, M. Ratnam","doi":"10.1109/ISSPA.2001.950178","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.950178","url":null,"abstract":"A set of optical signal data generated by shadow moire interferometry represents the profile of the surface that is under investigation. An existing algorithm has been used to process and visualize the optical signal into the three dimensional surface plot and a two-dimensional representation for a cantilever. This algorithm was tested and calibrated by measuring a cylinder surface profile and comparing the result with the actual measurement. An error analysis shows that distortion of the imaging system and the uncollimated light source are two major factors that may contribute to error in the analysis. Finally, an experiment was carried out to measure the deflection of a cantilever and the result is compared with the shape obtained from deflection theory.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131286894","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.950163
S. Bharitkar, Dimitar Filev
We propose an online learning algorithm for the learning vector quantization (LVQ) approach in nonlinear supervised classification. The advantage of this approach is the ability of the LVQ to adjust its codebook vectors as new patterns become available, so as to accurately model the class representation of the patterns. Moreover this algorithm does not significantly increase the computational complexity over the original LVQ algorithm.
{"title":"An online learning vector quantization algorithm","authors":"S. Bharitkar, Dimitar Filev","doi":"10.1109/ISSPA.2001.950163","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.950163","url":null,"abstract":"We propose an online learning algorithm for the learning vector quantization (LVQ) approach in nonlinear supervised classification. The advantage of this approach is the ability of the LVQ to adjust its codebook vectors as new patterns become available, so as to accurately model the class representation of the patterns. Moreover this algorithm does not significantly increase the computational complexity over the original LVQ algorithm.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131825830","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.949853
R. Hippenstiel, S. Mantis
In many applications the localization of a wireless communications transmitter is important. Localization of a mobile wireless communication unit using the time difference of arrival (TDOA) method is addressed. The localization of a GSM type emitter is enhanced by using denoised time domain signals. Denoising is obtained by thresholding the wavelet detail coefficients in time and the application of a fourth order moment criterion in scale. The performance, as a function of SNR and mean squared error for the TDOA is obtained.
{"title":"Wavelet denoising of signals based on the fourth order moment","authors":"R. Hippenstiel, S. Mantis","doi":"10.1109/ISSPA.2001.949853","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.949853","url":null,"abstract":"In many applications the localization of a wireless communications transmitter is important. Localization of a mobile wireless communication unit using the time difference of arrival (TDOA) method is addressed. The localization of a GSM type emitter is enhanced by using denoised time domain signals. Denoising is obtained by thresholding the wavelet detail coefficients in time and the application of a fourth order moment criterion in scale. The performance, as a function of SNR and mean squared error for the TDOA is obtained.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128326648","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.950191
Lin He, R. Malkemes, C. Reed, M. Amin
A performance comparison of the constant modulus algorithm (CMA) and the stop-and go algorithm (SGA) for blind adaptive equalization is presented. The performance evaluation is provided under indoor wireless channels using both transient and steady-state behaviors of the mean square error (MSE). A channel model is developed based on spectral observations of the unlicensed U-NII frequency band. The channel is time-varying and exhibits frequency selective fading. A receiver is implemented as two feed forward equalizers with one decision feedback equalizer. While the CMA is successful in achieving good performance, the SGA is much superior and more robust in low signal-to-noise ratio environments.
{"title":"A comparison of two blind equalization algorithms for broadband indoor wireless communications","authors":"Lin He, R. Malkemes, C. Reed, M. Amin","doi":"10.1109/ISSPA.2001.950191","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.950191","url":null,"abstract":"A performance comparison of the constant modulus algorithm (CMA) and the stop-and go algorithm (SGA) for blind adaptive equalization is presented. The performance evaluation is provided under indoor wireless channels using both transient and steady-state behaviors of the mean square error (MSE). A channel model is developed based on spectral observations of the unlicensed U-NII frequency band. The channel is time-varying and exhibits frequency selective fading. A receiver is implemented as two feed forward equalizers with one decision feedback equalizer. While the CMA is successful in achieving good performance, the SGA is much superior and more robust in low signal-to-noise ratio environments.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123142201","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.949787
Zhuhan Jiang, Xiling Guo
Wavelet systems of a maximum number of balanced vanishing moments are known to be extremely useful in a variety of applications including image and video compression. J. Tian and R.O. Wells Jr (see "Vanishing moments and biorthogonal wavelet systems", Mathematics in Signal Processing IV, Oxford University Press, 1997) recently created a family of such wavelet systems, called the biorthogonal Coifman wavelets, which proved valuable in both mathematics and applications. We first present an extension of Tian and Wells' family of biorthogonal Coifman wavelets by recovering other "missing" members of the biorthogonal Coifman wavelet systems. We then propose and study the wavelet filters of the minimal synthesis norm. It is also demonstrated that an additional feature of the minimal norm will in general improve the compression performance of the codecs based on such wavelets.
{"title":"Wavelets of vanishing moments and minimal filter norms and the application to image compression","authors":"Zhuhan Jiang, Xiling Guo","doi":"10.1109/ISSPA.2001.949787","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.949787","url":null,"abstract":"Wavelet systems of a maximum number of balanced vanishing moments are known to be extremely useful in a variety of applications including image and video compression. J. Tian and R.O. Wells Jr (see \"Vanishing moments and biorthogonal wavelet systems\", Mathematics in Signal Processing IV, Oxford University Press, 1997) recently created a family of such wavelet systems, called the biorthogonal Coifman wavelets, which proved valuable in both mathematics and applications. We first present an extension of Tian and Wells' family of biorthogonal Coifman wavelets by recovering other \"missing\" members of the biorthogonal Coifman wavelet systems. We then propose and study the wavelet filters of the minimal synthesis norm. It is also demonstrated that an additional feature of the minimal norm will in general improve the compression performance of the codecs based on such wavelets.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129913172","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.949805
Mohammed Raad, I. Burnett, A. Mertins
This paper describes the use of sorted sinusoidal parameters to produce a fixed rate, scalable, wideband audio coder. The sorting technique relies on the perceptual significance of the sinusoidal parameters. Sinusoidal coding permits the representation of a given signal through the summation of sinusoids. The parameters of the sinusoids (the amplitudes, phases and frequencies) are transmitted to allow signal reconstruction. The sinusoidal parameters are sorted according to energy content and perceptual significance. The most significant parameters are transmitted first, allowing the use of only a small set of the parameters for signal reconstruction. The proposed scheme incurs a low delay and uses a 20 ms frame length. The results presented show the advantages gained for scalable audio coding by sorting the parameters.
{"title":"Scalable audio coding employing sorted sinusoidal parameters","authors":"Mohammed Raad, I. Burnett, A. Mertins","doi":"10.1109/ISSPA.2001.949805","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.949805","url":null,"abstract":"This paper describes the use of sorted sinusoidal parameters to produce a fixed rate, scalable, wideband audio coder. The sorting technique relies on the perceptual significance of the sinusoidal parameters. Sinusoidal coding permits the representation of a given signal through the summation of sinusoids. The parameters of the sinusoids (the amplitudes, phases and frequencies) are transmitted to allow signal reconstruction. The sinusoidal parameters are sorted according to energy content and perceptual significance. The most significant parameters are transmitted first, allowing the use of only a small set of the parameters for signal reconstruction. The proposed scheme incurs a low delay and uses a 20 ms frame length. The results presented show the advantages gained for scalable audio coding by sorting the parameters.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132674043","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.950258
R. Palaniappan, R. Paramesran
We use the power and asymmetry ratio of spectral bands to recognise mental tasks from electroencephalogram signals using a fuzzy ARTMAP neural network. Classical spectral analysis using the Wiener-Khintchine theorem and modem parametric spectral analysis using the autoregressive method are used to obtain these features. The highest classification results of 90% for a subject recognising two mental tasks validate the method.
{"title":"Power and asymmetry ratio of spectral bands for mental task recognition","authors":"R. Palaniappan, R. Paramesran","doi":"10.1109/ISSPA.2001.950258","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.950258","url":null,"abstract":"We use the power and asymmetry ratio of spectral bands to recognise mental tasks from electroencephalogram signals using a fuzzy ARTMAP neural network. Classical spectral analysis using the Wiener-Khintchine theorem and modem parametric spectral analysis using the autoregressive method are used to obtain these features. The highest classification results of 90% for a subject recognising two mental tasks validate the method.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132839509","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
扫码关注我们
求助内容：
应助结果提醒方式：