All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 8 Next

Displaying 141 – 160 of 1507

Showing per page

Algebra of Polynomially Bounded Sequences and Negligible Functions

Hiroyuki Okazaki (2015)

Formalized Mathematics

In this article we formalize negligible functions that play an essential role in cryptology [10], [2]. Generally, a cryptosystem is secure if the probability of succeeding any attacks against the cryptosystem is negligible. First, we formalize the algebra of polynomially bounded sequences [20]. Next, we formalize negligible functions and prove the set of negligible functions is a subset of the algebra of polynomially bounded sequences. Moreover, we then introduce equivalence relation between polynomially...

An algorithm for hybrid regularizers based image restoration with Poisson noise

Cong Thang Pham, Thi Thu Thao Tran (2021)

Kybernetika

In this paper, a hybrid regularizers model for Poissonian image restoration is introduced. We study existence and uniqueness of minimizer for this model. To solve the resulting minimization problem, we employ the alternating minimization method with rigorous convergence guarantee. Numerical results demonstrate the efficiency and stability of the proposed method for suppressing Poisson noise.

An analytical iterative statistical algorithm for image reconstruction from projections

Robert Cierniak (2014)

International Journal of Applied Mathematics and Computer Science

The main purpose of the paper is to present a statistical model-based iterative approach to the problem of image reconstruction from projections. This originally formulated reconstruction algorithm is based on a maximum likelihood method with an objective adjusted to the probability distribution of measured signals obtained from an x-ray computed tomograph with parallel beam geometry. Various forms of objectives are tested. Experimental results show that an objective that is exactly tailored statistically...

An application of the expectation-maximization algorithm to interference rejection for direct-sequence spread-spectrum signals

Quan G. Zhang, Costas N. Georghiades (1999)

Kybernetika

For a direct-sequence spread-spectrum (DS-SS) system we pose and solve the problem of maximum-likelihood (ML) sequence estimation in the presence of narrowband interference, using the expectation-maximization (EM) algorithm. It is seen that the iterative EM algorithm obtains at each iteration an estimate of the interference which is then subtracted from the data before a new sequence estimate is produced. Both uncoded and trellis coded systems are studied, and the EM-based algorithm is seen to perform...

Currently displaying 141 – 160 of 1507