{"title":"Self-authentication of natural color images in Pascal Transform domain","authors":"Eleni E. Varsaki, V. Fotopoulos, A. Skodras","doi":"10.1109/ICDSP.2009.5201200","DOIUrl":"https://doi.org/10.1109/ICDSP.2009.5201200","url":null,"abstract":"This paper proposes a self-authentication scheme for color images, using a fragile data hiding method based on the Discrete Pascal Transform (DPT). The main contribution of this work is in the development of a scheme that is able to detect whether a color image has been tampered or not, to locate the exact tampered position, and to attempt to restore the original image content. This is achieved by embedding a low bit-depth scaled version of the image itself, resulting in very good stego image quality and satisfactory restoration.","PeriodicalId":409669,"journal":{"name":"2009 16th International Conference on Digital Signal Processing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116133736","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":"Watermarking: How secure is the DM-QIM embedding technique?","authors":"B. R. Matam, David Lowe","doi":"10.1109/ICDSP.2009.5201248","DOIUrl":"https://doi.org/10.1109/ICDSP.2009.5201248","url":null,"abstract":"Evaluation of the security of data hiding methods has gained considerable interest recently. The security of quantisation index modulation (QIM) based watermark embedding methods has previously been investigated for different classes of attacks including known-message attack, known-original attack and watermark-only attack. In this paper, an extreme case of the watermark-only attack scenario is discussed wherein only a single instance of a set of watermarked content is available. We challenge the security of the dither modulation (DM)-QIM based embedding method by examining feature space embeddings for time series and images, using a distribution-free algorithm to discover the primary key embedding parameters.","PeriodicalId":409669,"journal":{"name":"2009 16th International Conference on Digital Signal Processing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124167350","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}
D. Marijan, Vladimir Zlokolica, N. Teslic, V. Pekovic
{"title":"Quality assessment of digital television picture based on local feature matching","authors":"D. Marijan, Vladimir Zlokolica, N. Teslic, V. Pekovic","doi":"10.1109/ICDSP.2009.5201147","DOIUrl":"https://doi.org/10.1109/ICDSP.2009.5201147","url":null,"abstract":"This paper presents a novel, full-reference image quality measurement method for video quality assessment in television systems. Particularly, the proposed metric targets the problem of automatic assessment of digital picture degradations. The performance of proposed algorithm has been evaluated on different image sequences with various distortions of interest. The results show that the proposed scheme for quality assessment outperforms other image quality measures: PSNR, SSIM and VIF in terms of more efficient quality inspection based on local feature matching as well as robustness against various distortions such as luminance or contrast change, negligible picture misalignment, etc.","PeriodicalId":409669,"journal":{"name":"2009 16th International Conference on Digital Signal Processing","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125910709","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":"Face annotation for personal photos using collaborative face recognition in online social networks","authors":"J. Choi, W. De Neve, Yong Man Ro, K. Plataniotis","doi":"10.1109/ICDSP.2009.5201095","DOIUrl":"https://doi.org/10.1109/ICDSP.2009.5201095","url":null,"abstract":"Automatic face annotation (or tagging) facilitates improved retrieval and organization of personal photos in online social networks. In this paper, we present a new collaborative face recognition (FR) method that aims to improve face annotation accuracy. The proposed method makes efficient use of multiple FR engines and databases that are distributed over an online social network. The performance of our collaborative face recognition method was successfully evaluated using the standard MPEG-7 VCE-3 data set and a set of real-world personal photos from the web. The efficacy of the proposed method is demonstrated in terms of comparative annotation performance against non-collaborative approaches utilizing a single FR engine and a single database only.","PeriodicalId":409669,"journal":{"name":"2009 16th International Conference on Digital Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130192580","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":"Fast exact Affine Projection Algorithm using displacement structure theory","authors":"M. Tsakiris, P. Naylor","doi":"10.1109/ICDSP.2009.5201045","DOIUrl":"https://doi.org/10.1109/ICDSP.2009.5201045","url":null,"abstract":"This paper exploits the displacement structure of the coefficient matrix of the linear system of equations pertinent to the Affine Projection Algorithm (APA), to obtain the exact solution in a way faster than any other existing exact method. The main emphasis of the paper is to present the concepts of displacement structure theory and how these are applied to the APA context.","PeriodicalId":409669,"journal":{"name":"2009 16th International Conference on Digital Signal Processing","volume":"15 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122446602","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}
Jonas De Vylder, Daniel Ochoa, W. Philips, L. Chaerle, D. Straeten
{"title":"Tracking multiple objects using moving snakes","authors":"Jonas De Vylder, Daniel Ochoa, W. Philips, L. Chaerle, D. Straeten","doi":"10.1109/ICDSP.2009.5201067","DOIUrl":"https://doi.org/10.1109/ICDSP.2009.5201067","url":null,"abstract":"Active contours or snakes are widely used for segmentation and tracking. The ability of a snake to track an object depends on the movement of the object. If the object moves too far from one frame to another, the snake risks losing the true contour location. The subsequent evolution steps are negatively affected, reporting a false contour that can propagate to other frames. To overcome this problem a new snake algorithm has been developed. This new technique, moving snakes, works in two steps. During the fist step, the snake is translated as a rigid body towards the contour. This translation is calculated using the external force field of the image, therefore it does not require prior knowledge about the object movement. In the second step the actual shape evolution of the snake takes place.","PeriodicalId":409669,"journal":{"name":"2009 16th International Conference on Digital Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120915343","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 novel lane feature extraction algorithm implemented on the TMS320DM6437 DSP platform","authors":"Yifei Wang, N. Dahnoun, A. Achim","doi":"10.1109/ICDSP.2009.5201242","DOIUrl":"https://doi.org/10.1109/ICDSP.2009.5201242","url":null,"abstract":"This paper presents an implementation of a novel lane edge feature extraction algorithm based on digital interpolation. The method is based on the observation that by zooming towards the vanishing point, the positions and the sizes of the lanes will not change significantly while other objects will. Comparing the zoomed image with the original image allows us to remove most of the unwanted features from the lane feature map. The proposed algorithm shows outstanding performance on extracting features belonging solely to the lanes embedded in severe noise environment. The algorithm runs in real-time on the TMS320DM6437 DSP platform from Texas Instruments. The system implemented can achieve at least 23 fps, without performing any code optimisation but only considering memory management.","PeriodicalId":409669,"journal":{"name":"2009 16th International Conference on Digital Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120953549","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":"Compressed sensing of time-varying signals","authors":"Daniele Angelosante, G. Giannakis, E. Grossi","doi":"10.1109/ICDSP.2009.5201168","DOIUrl":"https://doi.org/10.1109/ICDSP.2009.5201168","url":null,"abstract":"Compressed sensing (CS) lowers the number of measurements required for reconstruction and estimation of signals that are sparse when expanded over a proper basis. Traditional CS approaches deal with time-invariant sparse signals, meaning that, during the measurement process, the signal of interest does not exhibit variations. However, many signals encountered in practice are varying with time as the observation window increases (e.g., video imaging, where the signal is sparse and varies between different frames). The present paper develops CS algorithms for time-varying signals, based on the least-absolute shrinkage and selection operator (Lasso) that has been popular for sparse regression problems. The Lasso here is tailored for smoothing time-varying signals, which are modeled as vector valued discrete time series. Two algorithms are proposed: the Group-Fused Lasso, when the unknown signal support is time-invariant but signal samples are allowed to vary with time; and the Dynamic Lasso, for the general class of signals with time-varying amplitudes and support. Performance of these algorithms is compared with a sparsity-unaware Kalman smoother, a support-aware Kalman smoother, and the standard Lasso which does not account for time variations. The numerical results amply demonstrate the practical merits of the novel CS algorithms.","PeriodicalId":409669,"journal":{"name":"2009 16th International Conference on Digital Signal Processing","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121262471","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 new ECG feature extractor for biometric recognition","authors":"Zahra Fatemian, D. Hatzinakos","doi":"10.1109/ICDSP.2009.5201143","DOIUrl":"https://doi.org/10.1109/ICDSP.2009.5201143","url":null,"abstract":"In this paper, a new wavelet based framework is developed and evaluated for automatic analysis of single lead electrocardiogram (ECG) for application in human recognition. The proposed system utilizes a robust preprocessing stage that enables it to handle noise and outliers so that it is directly applied on the raw ECG signal. Moreover, it is capable of handling ECGs regardless of the heart rate (HR) which renders making presumptions on the individual's stress level unnecessary. One of the novelties of this paper is the design of personalized heartbeat template so that the gallery set consists of only one heartbeart per subject. This substantial reduction of the gallery size, decreases the storage requirements of the system significantly. Furthermore, the classification process is speeded up by eliminating the need for dimensionality reduction techniques such as PCA or LDA. Experimental results for identification over PTB and MIT healthy ECG databases indicate a robust subject identification rate of 99.61% using only 2 heartbeats in average for each individual.","PeriodicalId":409669,"journal":{"name":"2009 16th International Conference on Digital Signal Processing","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125844575","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":"Robust access based on speaker identification for optical communications security","authors":"L. Zão, A. Alcaim, R. Coelho","doi":"10.1109/ICDSP.2009.5201087","DOIUrl":"https://doi.org/10.1109/ICDSP.2009.5201087","url":null,"abstract":"A robust biometric access system for optical communications based on a speaker identification authentication is proposed in this paper. The solution also enables optical access with remote speaker identification. A set of speech features and classifiers were defined to achieve the best recognition rates. The experiments demonstrated the feasibility and importance of using the biometric technology for the optical communications security.","PeriodicalId":409669,"journal":{"name":"2009 16th International Conference on Digital Signal Processing","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121526456","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}