Video watermarking plays a crucial role in protecting intellectual property rights and ensuring content authenticity.This study delves into the integration of Galois Field(GF)multiplication tables,especially GF(2^(4))...Video watermarking plays a crucial role in protecting intellectual property rights and ensuring content authenticity.This study delves into the integration of Galois Field(GF)multiplication tables,especially GF(2^(4)),and their interaction with distinct irreducible polynomials.The primary aim is to enhance watermarking techniques for achieving imperceptibility,robustness,and efficient execution time.The research employs scene selection and adaptive thresholding techniques to streamline the watermarking process.Scene selection is used strategically to embed watermarks in the most vital frames of the video,while adaptive thresholding methods ensure that the watermarking process adheres to imperceptibility criteria,maintaining the video's visual quality.Concurrently,careful consideration is given to execution time,crucial in real-world scenarios,to balance efficiency and efficacy.The Peak Signal-to-Noise Ratio(PSNR)serves as a pivotal metric to gauge the watermark's imperceptibility and video quality.The study explores various irreducible polynomials,navigating the trade-offs between computational efficiency and watermark imperceptibility.In parallel,the study pays careful attention to the execution time,a paramount consideration in real-world scenarios,to strike a balance between efficiency and efficacy.This comprehensive analysis provides valuable insights into the interplay of GF multiplication tables,diverse irreducible polynomials,scene selection,adaptive thresholding,imperceptibility,and execution time.The evaluation of the proposed algorithm's robustness was conducted using PSNR and NC metrics,and it was subjected to assessment under the impact of five distinct attack scenarios.These findings contribute to the development of watermarking strategies that balance imperceptibility,robustness,and processing efficiency,enhancing the field's practicality and effectiveness.展开更多
In this paper, we give the conception of implicit congruence and nonimplicit congruence in a unique factorization domain R and establish some structures of irreducible polynomials over R . A classical result, E...In this paper, we give the conception of implicit congruence and nonimplicit congruence in a unique factorization domain R and establish some structures of irreducible polynomials over R . A classical result, Eisenstein′s criterion, is generalized.展开更多
The polynomial x4+1 is irreducible in Ζ[x] but is locally reducible, that is, it factors modulo p for all primes p. In this paper we investigate this phenomenon and prove that for any composite natural number...The polynomial x4+1 is irreducible in Ζ[x] but is locally reducible, that is, it factors modulo p for all primes p. In this paper we investigate this phenomenon and prove that for any composite natural number N there are monic irreducible polynomials in Ζ[x] which are reducible modulo every prime.展开更多
Dong和Pei在文[Construction for de Bruijn sequences with large stage,Des.Codes Cryptogr,2017,85（2）：343-358]中利用F2[x]的n次不可约多项式构造大级数de Bruijn序列.不可约多项式的邻接矩阵从理论上给出了这种方法能构造de Bru...Dong和Pei在文[Construction for de Bruijn sequences with large stage,Des.Codes Cryptogr,2017,85（2）：343-358]中利用F2[x]的n次不可约多项式构造大级数de Bruijn序列.不可约多项式的邻接矩阵从理论上给出了这种方法能构造de Bruijn序列的数目.我们给出一类特殊不可约多项式的邻接矩阵,从理论上给出了用这类不可约多项式能够构造的de Bruijn序列的数目.展开更多
文摘Video watermarking plays a crucial role in protecting intellectual property rights and ensuring content authenticity.This study delves into the integration of Galois Field(GF)multiplication tables,especially GF(2^(4)),and their interaction with distinct irreducible polynomials.The primary aim is to enhance watermarking techniques for achieving imperceptibility,robustness,and efficient execution time.The research employs scene selection and adaptive thresholding techniques to streamline the watermarking process.Scene selection is used strategically to embed watermarks in the most vital frames of the video,while adaptive thresholding methods ensure that the watermarking process adheres to imperceptibility criteria,maintaining the video's visual quality.Concurrently,careful consideration is given to execution time,crucial in real-world scenarios,to balance efficiency and efficacy.The Peak Signal-to-Noise Ratio(PSNR)serves as a pivotal metric to gauge the watermark's imperceptibility and video quality.The study explores various irreducible polynomials,navigating the trade-offs between computational efficiency and watermark imperceptibility.In parallel,the study pays careful attention to the execution time,a paramount consideration in real-world scenarios,to strike a balance between efficiency and efficacy.This comprehensive analysis provides valuable insights into the interplay of GF multiplication tables,diverse irreducible polynomials,scene selection,adaptive thresholding,imperceptibility,and execution time.The evaluation of the proposed algorithm's robustness was conducted using PSNR and NC metrics,and it was subjected to assessment under the impact of five distinct attack scenarios.These findings contribute to the development of watermarking strategies that balance imperceptibility,robustness,and processing efficiency,enhancing the field's practicality and effectiveness.
文摘In this paper, we give the conception of implicit congruence and nonimplicit congruence in a unique factorization domain R and establish some structures of irreducible polynomials over R . A classical result, Eisenstein′s criterion, is generalized.
文摘The polynomial x4+1 is irreducible in Ζ[x] but is locally reducible, that is, it factors modulo p for all primes p. In this paper we investigate this phenomenon and prove that for any composite natural number N there are monic irreducible polynomials in Ζ[x] which are reducible modulo every prime.
文摘Dong和Pei在文[Construction for de Bruijn sequences with large stage,Des.Codes Cryptogr,2017,85（2）：343-358]中利用F2[x]的n次不可约多项式构造大级数de Bruijn序列.不可约多项式的邻接矩阵从理论上给出了这种方法能构造de Bruijn序列的数目.我们给出一类特殊不可约多项式的邻接矩阵,从理论上给出了用这类不可约多项式能够构造的de Bruijn序列的数目.
