{"title":"Wavelet domain watermarking capacity analysis","authors":"Fan Zhang, Hongbin Zhang","doi":"10.1117/12.570628","DOIUrl":"https://doi.org/10.1117/12.570628","url":null,"abstract":"Capacity is an important character of digital watermarking. Research of image watermarking capacity is to study how much information can be hidden in an image. Recently, wavelet transform has been applied widely in watermarking research as its excellent multi-resolution analysis property. According to watermarking methods in wavelet domain, watermark's embedding and extracting realized in wavelet domain, we think that watermarking capacity should be analyzed in wavelet domain also. This paper presents a watermarking capacity analysis method based on content of wavelet subbands by using Watson quantization matrix and Noise Visibility Function (NVF), and discusses watermarking capacity of blind watermarking and non-blind watermarking in this scenario.","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115741538","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":"Technology evaluations of fingerprint-based biometric systems","authors":"R. Cappelli, D. Maio, D. Maltoni","doi":"10.5281/ZENODO.38698","DOIUrl":"https://doi.org/10.5281/ZENODO.38698","url":null,"abstract":"Independent and reliable evaluation of the advances in fingerprint recognition is extremely important for several reasons: 1) to give governments, organizations and to every potential user a clear panorama of the potentiality and current limits of this technology; 2) to compare and rank different solutions (academic and commercial); 3) to provide unambiguous benchmarks/protocols to researchers to track their advances. This paper discusses the fingerprint evaluation campaigns organized in the recent years, focusing on the three editions of the Fingerprint Verification Competition (FVC).","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124266224","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":"Generic target recognition","authors":"C. Rosenberger, A. Rakotomamonjy, B. Emile","doi":"10.5281/ZENODO.38539","DOIUrl":"https://doi.org/10.5281/ZENODO.38539","url":null,"abstract":"We present in this paper a study on target recognition. The goal of this work is to determine and compare different methods from the pattern recognition domain in order to be able to recognize some objects in an image. We suppose having detected by a segmentation process a candidate object appearing with an unknown scale or rotation. To be able to recognize this object, we have first to describe it by some features having the property to be invariant by rotation, translation or scale. Second, we have to realize a supervised classification in order to compare this unknown object with one from the knowledge database. We present some experimental results for target recognition by comparing several features, classification methods and methodologies.","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127318911","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":"Recursively re-weighted least-squares estimation in regression models with parameterized variance","authors":"L. Pronzato, A. Pázman","doi":"10.5281/ZENODO.38283","DOIUrl":"https://doi.org/10.5281/ZENODO.38283","url":null,"abstract":"We consider a nonlinear regression model with parameterized variance and compare several methods of estimation: the Weighted Least-Squares (WLS) estimator; the two-stage LS (TSLS) estimator, where the LS estimator obtained at the first stage is plugged into the variance function used for WLS estimation at the second stage; and finally the recursively re-weighted LS (RWLS) estimator, where the LS estimator obtained after k observations is plugged into the variance function to compute the k-th weight for WLS estimation. We draw special attention to RWLS estimation which can be implemented recursively when the regression model in linear (even if the variance function is nonlinear), and is thus particularly attractive for signal processing applications.","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127341993","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":"Unitary Cyclic MUSIC algorithm in a multipath environment","authors":"Zhigang Liu, Jinkuan Wang","doi":"10.5281/ZENODO.38164","DOIUrl":"https://doi.org/10.5281/ZENODO.38164","url":null,"abstract":"A signal selective Unitary Cyclic MUSIC algorithm is presented by introducing a new forward backward smoothed covariance matrix. Compared with Cyclic MUSIC algorithm, the suggested approach has a better performance in the presence of multipath propagation. In addition, this approach not only reduces the computational complexity by real-valued eigendecomposition, but also allows to select desired signals and to ignore interferences by exploiting the cyclostationarity property of signals of interest (SOIs). Simulation results that illustrate the performance of this approach in conjunction with Cyclic MUSIC algorithm are described.","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127355795","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 score normalization for relational approaches to face authentication","authors":"F. Perronnin, J. Dugelay","doi":"10.5281/ZENODO.38357","DOIUrl":"https://doi.org/10.5281/ZENODO.38357","url":null,"abstract":"Relational approaches to pattern recognition consist in modeling the relationship between observations. In this paper, we consider two score normalization strategies based on a Bayesian framework for relational approaches to face authentication. The first one is specific to relational approaches and models the relationship between face images of different persons. The second one, which is very general and can be applied to any face authentication system, models directly impostors. These two techniques are compared from a theoretical and an experimental point of view and both comparisons hint at a superiority of the general approach.","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125816417","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":"Improvement of Hidden Markov model evaluation of the mobile satellite channel by resorting to a transition localisation method","authors":"C. Alasseur, L. Husson","doi":"10.5281/ZENODO.38228","DOIUrl":"https://doi.org/10.5281/ZENODO.38228","url":null,"abstract":"The mobile satellite channel has underlying Markovian properties and can then be represented by a Hidden Markov model (HMM). A challenging problem consists in estimating the model parameters from experimental data, especially when these parameters are not easily identifiable. In these cases, classification methods like k-means or scalable clustering, which are considered in this paper, show poor results when applied to the channel signal directly. We show that the detection of change-points of the signal, i.e. the detection of transitions between the model states, in a preliminary step, improves the estimation of the model parameters. We thus propose a method of model estimation including the detection of change-points that enables a better modelling of the satellite channel.","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125919974","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":"MSE-ratio regret estimation with bounded data uncertainties","authors":"Yonina C. Eldar","doi":"10.5281/ZENODO.38180","DOIUrl":"https://doi.org/10.5281/ZENODO.38180","url":null,"abstract":"We consider the problem of robust estimation of a deterministic bounded parameter vector x in a linear model. While in an earlier work, we proposed a minimax estimation approach in which we seek the estimator that minimizes the worst-case mean-squared error (MSE) difference regret over all bounded vectors x, here we consider an alternative approach, in which we seek the estimator that minimizes the worst-case MSE ratio regret, namely, the worst-case ratio between the MSE attainable using a linear estimator ignorant of x, and the minimum MSE attainable using a linear estimator that knows x. The rational behind this approach is that the value of the difference regret may not adequately reflect the estimator performance, since even a large regret should be considered insignificant if the value of the optimal MSE is relatively large.","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125923087","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":"Software implementation of SHDSL transceivers on a novel DSP architecture","authors":"Manfred Riener, A. Bolzer, Gerald Krottendorfer","doi":"10.5281/ZENODO.38406","DOIUrl":"https://doi.org/10.5281/ZENODO.38406","url":null,"abstract":"The continuous development in communication technology demands high flexibility and short product cycles. The analysis of the communication standard SHDSL provides computational requirements, which can be used to specify a new type of signal processor. This paper examines the architectural issues for a vector processor, which shall handle communication algorithms as applied to SHDSL. It will be shown that enhancements to the conventional approach of vector computing significantly increases the utilization of scalar algorithms. This makes vector processing a suitable solution for communication applications.","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125492233","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":"Subband adaptive filtering using a multiple-constraint optimization criterion","authors":"Kong-Aik Lee, W. Gan, Y. Wen","doi":"10.5281/ZENODO.38483","DOIUrl":"https://doi.org/10.5281/ZENODO.38483","url":null,"abstract":"In this paper we propose a new design criterion for subband adaptive filters (SAFs). The proposed multiple-constraint optimization criterion is based on the principle of minimal disturbance, where the multiple constraints are imposed on the updated subband filter outputs. Compared to the classical fullband least-mean-square (LMS) algorithm, the subband adaptive filtering algorithm derived from the proposed criterion exhibits faster convergence under colored excitation. Furthermore, the recursive tap-weight adaptation can be expressed in a simple form comparable to that of the normalized LMS (NLMS) algorithm. We also show that the proposed criterion is related to another known weighted criterion. The efficacy of the proposed criterion and algorithm are examined and validated via mathematical analysis and simulation.","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115586302","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}