{"title":"A simple scheme for enhanced reassignment of the SPWV representation of noisy signals","authors":"A. Loza, N. Canagarajah, Dave Bull","doi":"10.1109/ISPA.2003.1296353","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296353","url":null,"abstract":"The reassignment procedure has often been employed to improve readability of some time-frequency representations (TFRs). When processing noisy signals, the problem of sensitivity of the technique to noise is encountered. In this paper, a simple modification of reassignment method is proposed, based on thresholding operation. Specifically, by preventing the reassignment of the distribution coefficients below the noise dependent threshold and replacing them with zeros, the enhanced signatures on the time-frequency plane are obtained. This method is compared with other techniques, such as the reassigned spectrogram (RSP) and the supervised reassigned spectrogram (SRSP). An experimental test of these algorithms as the instantaneous frequency (IF) estimators for a chirp signal have shown that our method improves the accuracy of the estimation for heavy noise.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128823541","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":"Feature extraction for automatic ball recognition: comparison between wavelet and ICA preprocessing","authors":"M. Leo, T. D’orazio, A. Distante","doi":"10.1109/ISPA.2003.1296345","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296345","url":null,"abstract":"The ball detection in soccer images is one of the applications of the most general problem of object recognition, where the approach mainly used is based on classifying the pattern images after a suitable preprocessing. In this paper we have compared two different preprocessing techniques: the initial vectorial representation of the image has been projected both on the Haar basis and on the basis extracted from the independent component analysis. The coefficients of the new representation in the ICA and Wavelet subspaces are supplied as input to a neural classifier. ICA and wavelet representations have been chosen since they are well suited to increase the inter class differences and decrease the intra class ones. The experimental results on real soccer images show that the classification performances applying the ICA and wavelet preprocessing techniques are quite the same and that combining ICA and wavelet the percentage of pattern recognition can be further increased.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127849377","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":"Fragile watermark based on polarity of pixel points","authors":"C. Kailasanathan","doi":"10.1109/ISPA.2003.1296399","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296399","url":null,"abstract":"A fragile watermarking scheme for authenticating images based on the Yeung-Mintzer scheme is proposed in this paper. This scheme does provide a better protection against all the attacks proposed for Yeung-Mintzer scheme. A polar set derived from the image blocks is used in the embedding process. The center pixel values of image blocks are perturbed by small quantities in such a way that the perceptual quality of the image is not modified. This paper also analyse the security level with respect to other attacks.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124239214","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":"Adaptive weighted median filter using local entropy for ultrasonic image denoising","authors":"P. Yang, O. Basir","doi":"10.1109/ISPA.2003.1296386","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296386","url":null,"abstract":"In this paper we present an information theory based adaptive weighted median filter. The weights of the filter are set based on localized image entropy measurements. The lower the local entropy is the smoother becomes the behavior of the proposed filter. In contrast, when the localized entropy is high, the filter's signal preservation mechanism becomes more dominant. The paper presents experimental data to compare the performance of the proposed filter with other well-known filters on a set of simulated images as well as B-mode ultrasonic images. It is shown that the proposed adaptive entropy weighted median (AEWM) filter has a superior performance in both the speckle reduction and edge preservation.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114388221","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":"Moments of size distributions applied to texture classification","authors":"G. Ayala, E. Díaz, J. Domingo, I. Epifanio","doi":"10.1109/ISPA.2003.1296875","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296875","url":null,"abstract":"This paper is mainly concerned with texture classification. A texture has to be classified in a class from a well defined and complete set of classes. The texture features proposed in the paper would be moments of different probability distributions associated with the texture. These probability distributions correspond with different formalisations of the concept of size distribution. Firstly, the well-known granulometric size distribution proposed by Matheron (1975). Secondly, a non-granulometric size distribution related with that proposed by E. de Ves et al. (Sept. 1999) and, finally, the spatial size distribution given by G. Ayala and J. Domingo (Dec. 2001). From the image, the density or the cumulative distribution function can be estimated and, from them, the moments of the distribution. Moments of first and second order constitute the texture features used for comparing the performance of these functions. A typical experimental set up has been performed on a small texture database. The results show the superior behaviour obtained for combining the size and the spatial components, and also give clues to determine the minimum number of features that can provide good percentages of correct classification.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122076168","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":"Application of the tensor voting technique for perceptual grouping to grey-level images: quantitative evaluation","authors":"A. Massad, Martin Bab, Biirbel Mertsching","doi":"10.1109/ISPA.2003.1296949","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296949","url":null,"abstract":"This paper presents a quantitative evaluation of the application of the perceptual grouping method known as tensor voting to grey-level images. For that purpose, we have introduced the use of local orientation tensors computed from a set of Gabor filters. While inputs formerly consisted of binary images or sparse edgel maps, we use oriented input tokens and the locations of junctions from images as input to the perceptual grouping. Here, we introduce a benchmark test to estimate the precision of our method with regards to angular and positional error. Results on these test images show that the computation of the tensorial input tokens is highly precise and robust against noise. Both aspects arc further improved by the subsequent grouping process.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124465314","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":"An intelligent hardware structure for impulse noise suppression","authors":"G. Louverdis, I. Andreadis, N. Papamarkos","doi":"10.1109/ISPA.2003.1296937","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296937","url":null,"abstract":"In this paper an intelligent hardware module suitable for the computation of an adaptive median filter (AMF) is presented. The proposed digital hardware structure is pipelined and parallel processing is used to minimize computational time. It is capable of processing gray-scale images of 8-bit resolution with 3/spl times/3 or 5/spl times/5-pixel image neighborhoods as options for the computation of the filter output. However, the system can be easily expanded to accommodate windows of larger sizes. The function of the proposed circuitry is to detect the existence of impulse noise in an image neighborhood and apply the median filter operator only when necessary. Moreover, the noise detection procedure can be customized so that a range of pixel values is considered as impulse noise. In this way, the integrity of edge and detail information of the image under process is preserved and blurring is avoided. The proposed digital structure was implemented in FPGA and it can be used in industrial imaging applications, where fast processing is of the utmost importance. As an example, the time required to perform filtering of a grayscale image of 260/spl times/244 pixels is approximately 7.6 msec. The typical system clock frequency is 65 MHz.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128714021","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":"Line pattern segmentation using morphological probing","authors":"C. Barat, C. Ducottet, M. Jourlin","doi":"10.1109/ISPA.2003.1296933","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296933","url":null,"abstract":"In this paper, we propose a new algorithm for line pattern segmentation. It allows to recover line structures of various widths and intensities and removes structures other than line structures, effects of non-uniformity of the background level and noise. This algorithm is composed of two stages : line enhancement and line extraction. Firstly, line enhancement is carried out using a pattern matching method, relying on a profiling approach and defined with mathematical morphology operators. This transform allows to detect multiple objects of varying size or shape simultaneously using a unique template. For line segmentation, this template is divided into three parallel flat segments. Two lateral segments are used to probe the line from above while a central one probes the line from below. Several parameters describe the template and allow to adapt to various applications. Secondly, line extraction is performed by thinning and thresholding. Results on synthetic line patterns images as well as on real biomedical images are presented.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127356279","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":"LMS adaptive filter with optimum step-size for tracking time-varying channels","authors":"R. Bilcu, P. Kuosmanen, K. Egiazarian","doi":"10.1109/ISPA.2003.1296403","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296403","url":null,"abstract":"In this paper, an adaptive step-size LMS algorithm for tracking time-varying channels is presented. It is well known that in the case of such channels, the output steady-state mean square error (MSB) is a nonlinear function of the algorithm step-size and so, an optimum step-size that minimize the MSE exist. Here we propose an algorithm which adaptively adjust the step-size of the LMS toward its optimum value, such that the steady-state MSE is minimized. The nonlinear relation between the steady-state MSE and the step-size is parametrized such that, during the adaptation, estimates of the optimum step-size are easily obtained. These estimates are obtained independent from the channel statistical parameters, therefore, no prior information about the channel parameters is needed.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127497394","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}
H. Wactlar, Michael G. Christel, Alexander Hauptmann, S. Stevens, Ashok Bharucha
{"title":"A system of video information capture, indexing and retrieval for interpreting human activity","authors":"H. Wactlar, Michael G. Christel, Alexander Hauptmann, S. Stevens, Ashok Bharucha","doi":"10.1109/ISPA.2003.1296908","DOIUrl":"https://doi.org/10.1109/ISPA.2003.1296908","url":null,"abstract":"This system creates a manageable information resource that enables more complete and accurate interpretation, assessment and diagnosis of human behavior in constrained physical spaces. Through activity and environmental monitoring, a continuous, voluminous audio and video record is captured. Through work in information extraction, behavior analysis and synthesis, this record is transformed into an information asset whose efficient, secure presentation empowers specialists with greater insights into problems, effectiveness of treatments, and determination of environmental and social influences. Application environments range from nursery schools to nursing homes. The foundation for this work, the informedia digital video library (H.D. Wactlar et al., 1999), has demonstrated the successful integration of speech, image, and natural language processing in automatically creating an indexed, searchable multimedia information resource for broadcast-quality video, upon which this system builds.","PeriodicalId":218932,"journal":{"name":"3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130594509","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}