2018
DOI: 10.1007/s11042-018-6844-1
|View full text |Cite
|
Sign up to set email alerts
|

Double random phase encoding with a Poisson-multinomial distribution for efficient colorful image authentication

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 21 publications
0
1
0
Order By: Relevance
“…Cheng, Diakonikolas, and Stewart (2017) proved that any n-player anonymous games can have an approximate Nash equilibrium in polynomial time. Akter, Moon, and Kwon (2019) introduced PMD in the image processing field for the first time, and used PMD to process the encrypted image data and computed the pmf of PMD to obtain optimal results. However, the pmf of PMD was computed by using simplified multinomial distributions, which is an approximation.…”
Section: Related Literature and Contribution Of This Workmentioning
confidence: 99%
“…Cheng, Diakonikolas, and Stewart (2017) proved that any n-player anonymous games can have an approximate Nash equilibrium in polynomial time. Akter, Moon, and Kwon (2019) introduced PMD in the image processing field for the first time, and used PMD to process the encrypted image data and computed the pmf of PMD to obtain optimal results. However, the pmf of PMD was computed by using simplified multinomial distributions, which is an approximation.…”
Section: Related Literature and Contribution Of This Workmentioning
confidence: 99%