Showing papers on "Homomorphic encryption published in 1982"
TL;DR: This study investigates the relationship between nk(K) and nK where Kis a language and h is a homorphism, and investigates the relations existant entre KH(K), nKi où K est un langage and h est un homomorphisme.
Abstract: — The subword complexity of a language K is the function nK on positive integer s such that nK (n) equals the number of different subwords of length n appearing in words of X. We investigate the relationship between nk(K) and nK where Kis a language and h is a homorphism. This study is aiso carried out for the special case when Kis a DOL language. Resumé. — La complexité des facteurs d'un langage K est la fonction nK définie sur les entiers positifs telle que nK (n) est le nombre de facteurs distincts de longueur n apparaissant dans les mots de K. Nous étudions les relations existant entre KH(K) et nKi où K est un langage et h est un homomorphisme. Cette étude est menée également dans le cas particulier où Kest un DOL langage.
23 citations
06 Jan 1982
TL;DR: In this paper, the adaptive homomorphic filter invoked is space-varying and is parameterized by the local mean level of the degraded image which serves as an indication of the extent of local cloud cover degradation.
Abstract: : In this report, we demonstrate the use of adaptive homomorphic filtering in exposing objects under light cloud cover. More specifically, the homomorphic filter invoked is space-varying and is parameterized by the local mean level of the degraded image which serves as an indication of the extent of local cloud cover degradation. We show through some preliminary experiments that this approach compares favorably with long space methods such as deterministic and stochastic homomorphic filtering and an iterative version of stochastic homomorphic filtering. (Author)
3 citations