This study examines the prediction of print defect perception (banding) of the human visual system (HVS) by combining detection probabilities of contrast components from wavelet and sinusoidal decompositions of defect patterns. Detection probabilities for basis function components are obtained from subjective tests. Prediction performance is presented in terms of the deviation of the contrast t...

Within the context face expression classi cation using the facial action coding system (FACS), we address the problem of detecting facial action units (AUs). The method adopted is to train a single error-correcting output code (ECOC) multiclass classi er to estimate the probabilities that each one of several commonly occurring AU groups is present in the probe image. Platt scaling is used to ca...

A Bloom filter (BF) is a randomised data structure for set membership queries. Its space requirements fall significantly below lossless information-theoretic lower bounds but it produces false positives with some quantifiable probability. Here we present a general framework for deriving smoothed language model probabilities from BFs. We investigate how a BF containing n-gram statistics can be u...

This paper estimates the minimal length of a binary probabilistic traitor tracing code. We consider the code construction proposed by G. Tardos in 2003, with the symmetric accusation function as improved by B. Skoric et al. The length estimation is based on two pillars. First, we consider the Worst Case Attack that a group of c colluders can lead. This attack minimizes the mutual information be...

In this paper, we introduce REMAP, an approach for the training and estimation of posterior probabilities using a recursive algorithm that is reminiscent of the EM-based Forward-Backward (Liporace 1982) algorithm for the estimation of sequence likelihoods. Although very general, the method is developed in the context of a statistical model for transition-based speech recognition using Artificia...

Multiple self-proclaimed experts claim that they know the probabilities of future events. A tester does not know the odds of future events and she also does not know whether, among the multiple experts, there are some who do know the relevant probabilities. So the tester requires each expert to announce, before any data are observed, the probabilities of all future events. A test either rejects...

In this paper a new approach for increasing the efficiency of checksum error detection is proposed. In order to decrease the probability of undetected errors, it is suggested to use Avalanche transformation of codes before the checksum calculation. Analytical estimations of undetected error probabilities are presented. Comparative analysis indicated high effectiveness of the suggested approach....

Much has been written on the theoretical description of error correcting codes but, due to a lack of actual channel error patterns, little has been said of practical performance. In this paper the performance of three types of error control is evaluated for the case of independent random errors and for an actual channel exhibiting dense bursts. The selected codes are burst codes with high proba...