{"title":"An automatic recognition algorithm of analogue modulated signals for disturbance rejection","authors":"Eriko Matsuzaki, K. Ichige, H. Arai","doi":"10.1109/ISSPA.2003.1224666","DOIUrl":"https://doi.org/10.1109/ISSPA.2003.1224666","url":null,"abstract":"This paper presents an automatic recognition algorithm of analogue modulated signals provided that jamming signals exist near the carrier frequency of a target signal. The proposed algorithm is based on the decision-theoretic approach, is assumed to be used as surveillance system for radiowaves, and can distinguish LSB (lower side band), USB(upper side band), AM (amplitude modulation), and DSB-SC (double side band suppressed carrier). The performance of the proposed algorithm is evaluated through some simulations of modulation recognition.","PeriodicalId":264814,"journal":{"name":"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115294670","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}
{"title":"Weighted subspace fitting of interferometric phases for multibaseline SAR interferometry","authors":"A. Jakobsson, F. Lombardini, F. Gini","doi":"10.1109/ISSPA.2003.1224705","DOIUrl":"https://doi.org/10.1109/ISSPA.2003.1224705","url":null,"abstract":"In this paper, we deal with the problem of exploiting baseline diversity of a multichannel interferometric SAR system to overcome the layover problem. The problem arises when different height contributions collapse in the same range-azimuth resolution cell, due to the presence of strong terrain slopes or discontinuities in the sensed scene. The multilook framework is adopted to counteract the presence of the space varying distortion, termed speckle, which is due to the extended nature of natural targets; to this purpose we introduce a weighted subspace fitting approach to estimate the interferometric phases. Although the approach does not take the speckle into account, it is found to yield estimates superior to previously examined methods.","PeriodicalId":264814,"journal":{"name":"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.","volume":"460 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115859108","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}
{"title":"Channel rate allocation for error-robust packet transmission of SNR-scalable DPCM-coded video","authors":"Till Halbach, T. Fischer","doi":"10.1109/ISSPA.2003.1224846","DOIUrl":"https://doi.org/10.1109/ISSPA.2003.1224846","url":null,"abstract":"An SNR-scalable hybrid video coding scheme with a quality constraint is considered. The encoded digital data are conveyed as packets over an error-prone channel. We derive a low-complexity algorithm which assigns the best code to each packet, based on a limited set of codes, and accounting for channel conditions, code properties, the data's importance, and inter-packet dependencies. A highly error-resilient transmission is hereby achieved, the image quality being equal to approximately high-quality layer SNR for a low error probability (0.002). The quality decrease with degrading channel conditions is only moderate.","PeriodicalId":264814,"journal":{"name":"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123783163","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}
{"title":"A comparative study on source number detection","authors":"S. Aouada, A. Zoubir, C. See","doi":"10.1109/ISSPA.2003.1224668","DOIUrl":"https://doi.org/10.1109/ISSPA.2003.1224668","url":null,"abstract":"The problem of source number detection using an array of sensors at the receiver is addressed and a review of the basic detectors is presented. An alternative detection method based on the bootstrap is also summarized and its advantages over the standard detectors are illustrated through simulation examples.","PeriodicalId":264814,"journal":{"name":"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124880755","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}
{"title":"Segmentation-based image compression using BTC-VQ technique","authors":"Qosai Kanafani, Azeddine Beghdadi, C. Fookes","doi":"10.1109/ISSPA.2003.1224653","DOIUrl":"https://doi.org/10.1109/ISSPA.2003.1224653","url":null,"abstract":"This paper proposes a new approach to image compression based on image segmentation using the EM algorithm and combined with BTC (block truncation coding) and VQ (vector quantization). The main idea is to decompose the image into homogeneous and nonhomogeneous blocks and then compress them using BTC or VQ. This block classification is achieved using an image segmentation based on the EM (expectation-maximization) algorithm. The use of the EM algorithm results in a good robust segmentation with well behaved boundaries. The segmented image is then used to specify whether BTC or VQ is used to encode a block by assessing if it contains all pixels from a homogeneous or nonhomogeneous region. BTC provides a simple and effective method for coding blocks which contain a lot of information or distinct edges due to its two-level quantizer. However, its lowest attainable bit rate is limited and it often introduces blocking effect in homogeneous regions. VQ on the other hand is more efficient due to a multilevel quantizer and thus results in better compression ratios. However, it does not retain any spatial information about the edges, resulting in stair casing effects. Previous attempts to combine both techniques into a hybrid algorithm only make use of simple measures such as image variance. Results for medical images show that this approach yields significant improvements over traditional BTC or VQ coding when used alone.","PeriodicalId":264814,"journal":{"name":"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122491070","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}
K. Stadlthanner, A. Tomé, Fabian J Theis, W. Gronwald, H. Kalbitzer, E. Lang
{"title":"Removing water artefacts from 2D protein NMR spectra using GEVD with congruent matrix pencils","authors":"K. Stadlthanner, A. Tomé, Fabian J Theis, W. Gronwald, H. Kalbitzer, E. Lang","doi":"10.1109/ISSPA.2003.1224821","DOIUrl":"https://doi.org/10.1109/ISSPA.2003.1224821","url":null,"abstract":"Multidimensional H nmr spectra of biomolecules dissolved in light water are contaminated by an intense water artefact. We discuss the application of the generalized eigenvalue decomposition (GEVD) method using a matrix pencil to explore the time structure of the signals in order to separate out the water artefacts. Simulated as well as experimental 2D NOESY spectra of proteins are studied. Results are compared to those obtained with the FastICA algorithm.","PeriodicalId":264814,"journal":{"name":"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133748714","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}
{"title":"Optimized filter banks for the compression of subtraction angiographic images","authors":"Martin Franz, R. Schüffny","doi":"10.1109/ISSPA.2003.1224645","DOIUrl":"https://doi.org/10.1109/ISSPA.2003.1224645","url":null,"abstract":"Several classes of images contain a clearly determined set of basic signals. This permits the development of signal-matched filter banks for image compression. A new approach for the derivation of signal-optimized filter banks using nonlinear optimization is presented here. Filters optimized with respect to the vessel and background signal of angiographic images are provided as a design example. Experimental results show that the new filter bank is competitive with the best biorthogonal wavelets.","PeriodicalId":264814,"journal":{"name":"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132251890","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}
{"title":"Genetic algorithms and multifractal segmentation of cervical cell images","authors":"N. Lassouaoui, L. Hamami","doi":"10.1109/ISSPA.2003.1224800","DOIUrl":"https://doi.org/10.1109/ISSPA.2003.1224800","url":null,"abstract":"This paper deals with the segmentation problem of cervical cell images. Knowing that the malignity criteria appear on the morphology of the core and the cytoplasm of each cell, then, the goal of this segmentation is to separate each cell on its component, that permits to analyze separately their morphology (size and shape) in the recognition step, for deducing decision about the malignity of each cell. For that, we use a multifractal algorithm based on the computation of the singularity exponent on each point of the image. For increasing the quality of the segmentation, we propose to add an optimization step based on genetic algorithms. The proposed processing has been tested on several images. Herein, we present some results obtained by two cervical cell images.","PeriodicalId":264814,"journal":{"name":"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134211858","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}
{"title":"Attacks on quantization-based watermarking schemes","authors":"M. Mansour, A. Tewfik","doi":"10.1109/ISSPA.2003.1224890","DOIUrl":"https://doi.org/10.1109/ISSPA.2003.1224890","url":null,"abstract":"In this work, we introduce an efficient attack for removing the watermark with minimum distortion from quantization-based watermarking schemes. The attack is based on analyzing the quantization error to extract the key parameters of the encoder. The removal of the watermark is done by perturbing enough components of the quantized watermarked signal by half of the estimated quantization step. Simulation experiments show the high effectiveness of the proposed algorithm in hacking known quantization-based schemes for watermarking.","PeriodicalId":264814,"journal":{"name":"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134269357","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}
{"title":"A multi-scale curve smoothing for generalised pattern recognition (MSGPR)","authors":"K. Kpalma, J. Ronsin","doi":"10.1109/ISSPA.2003.1224905","DOIUrl":"https://doi.org/10.1109/ISSPA.2003.1224905","url":null,"abstract":"In this paper, we introduce a new method for pattern characterisation in the context of pattern recognition. This method is based on the analysis of the contour of planar objects like the CSS (curvature scale space) method that uses the maxima of the curvature zero-crossing. The input contour is separated into two signals according to its coordinates x and y which are progressively low-pass filtered by decreasing the filter bandwidth. The output signals are then amplified so that the reconstructed contour and the input one have the same scale. By doing so, we detect the intersection points between both contours and then generate the intersection points map that defines features for pattern recognition. Since this method deals only with curve smoothing, it needs only a convolution operation. This way, one can reasonably hope that this method is faster than the CSS one with equivalent performances.","PeriodicalId":264814,"journal":{"name":"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134511314","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}