Loading [MathJax]/jax/output/SVG/jax.js
Research article

Meaningful secret image sharing for JPEG images with arbitrary quality factors


  • Received: 29 April 2022 Revised: 13 July 2022 Accepted: 03 August 2022 Published: 11 August 2022
  • JPEG is the most common format for storing and transmitting photographic images on social network platforms. JPEG image is widely used in people's life because of their low storage space and high visual quality. Secret image sharing (SIS) technology is important to protect image data. Traditional SIS schemes generally focus on spatial images, however there is little research on frequency domain images. In addition, the current tiny research on SIS for JPEG images only focuses on JPEG images with a compression quality factor (QF) of 100. To overcome the limitation of JPEG images in SIS, we propose a meaningful SIS for JPEG images to operate the quantized DCT coefficients of JPEG images. The random elements utilization model is applied to achieve meaningful shadow images. Our proposed scheme has a better quality of the shadow images and the recovered secret image. Experiment results and comparisons indicate the effectiveness of the scheme. The scheme can be used for JPEG images with any compression QF. Besides, the scheme has good characteristics, such as (k,n) threshold, extended shadow images.

    Citation: Yue Jiang, Xuehu Yan, Jia Chen, Jingwen Cheng, Jianguo Zhang. Meaningful secret image sharing for JPEG images with arbitrary quality factors[J]. Mathematical Biosciences and Engineering, 2022, 19(11): 11544-11562. doi: 10.3934/mbe.2022538

    Related Papers:

    [1] Khaled Kefi, Nasser S. Albalawi . Three weak solutions for degenerate weighted quasilinear elliptic equations with indefinite weights and variable exponents. AIMS Mathematics, 2025, 10(2): 4492-4503. doi: 10.3934/math.2025207
    [2] Haohao Jia, Feiyao Ma, Weifeng Wo . Large positive solutions to an elliptic system of competitive type with nonhomogeneous terms. AIMS Mathematics, 2021, 6(8): 8191-8204. doi: 10.3934/math.2021474
    [3] Mengyu Wang, Xinmin Qu, Huiqin Lu . Ground state sign-changing solutions for fractional Laplacian equations with critical nonlinearity. AIMS Mathematics, 2021, 6(5): 5028-5039. doi: 10.3934/math.2021297
    [4] Labudan Suonan, Yonglin Xu . Existence of solutions to mixed local and nonlocal anisotropic quasilinear singular elliptic equations. AIMS Mathematics, 2023, 8(10): 24862-24887. doi: 10.3934/math.20231268
    [5] Diane Denny . Existence of a solution to a semilinear elliptic equation. AIMS Mathematics, 2016, 1(3): 208-211. doi: 10.3934/Math.2016.3.208
    [6] Dan Wang, Yongxiang Li . Existence and uniqueness of radial solution for the elliptic equation system in an annulus. AIMS Mathematics, 2023, 8(9): 21929-21942. doi: 10.3934/math.20231118
    [7] Zhiying Deng, Yisheng Huang . Existence and multiplicity results for a singular fourth-order elliptic system involving critical homogeneous nonlinearities. AIMS Mathematics, 2023, 8(4): 9054-9073. doi: 10.3934/math.2023453
    [8] Khaled Kefi . Existence and multiplicity of triple weak solutions for a nonlinear elliptic problem with fourth-order operator and Hardy potential. AIMS Mathematics, 2024, 9(7): 17758-17773. doi: 10.3934/math.2024863
    [9] Nafissa Toureche Trouba, Mohamed E. M. Alngar, Reham M. A. Shohib, Haitham A. Mahmoud, Yakup Yildirim, Huiying Xu, Xinzhong Zhu . Novel solitary wave solutions of the (3+1)–dimensional nonlinear Schrödinger equation with generalized Kudryashov self–phase modulation. AIMS Mathematics, 2025, 10(2): 4374-4411. doi: 10.3934/math.2025202
    [10] Ninghe Yang . Exact wave patterns and chaotic dynamical behaviors of the extended (3+1)-dimensional NLSE. AIMS Mathematics, 2024, 9(11): 31274-31294. doi: 10.3934/math.20241508
  • JPEG is the most common format for storing and transmitting photographic images on social network platforms. JPEG image is widely used in people's life because of their low storage space and high visual quality. Secret image sharing (SIS) technology is important to protect image data. Traditional SIS schemes generally focus on spatial images, however there is little research on frequency domain images. In addition, the current tiny research on SIS for JPEG images only focuses on JPEG images with a compression quality factor (QF) of 100. To overcome the limitation of JPEG images in SIS, we propose a meaningful SIS for JPEG images to operate the quantized DCT coefficients of JPEG images. The random elements utilization model is applied to achieve meaningful shadow images. Our proposed scheme has a better quality of the shadow images and the recovered secret image. Experiment results and comparisons indicate the effectiveness of the scheme. The scheme can be used for JPEG images with any compression QF. Besides, the scheme has good characteristics, such as (k,n) threshold, extended shadow images.



    Let Ω be a bounded domain of RN(N3) with smooth boundary Ω. In this paper, we consider the existence of W1,10(Ω)solutions to the following elliptic problem

    {div(M(x,u)u)+|u|2uθ=f,xΩ,u=0,xΩ, (1.1)

    where NN1θ<2, M:Ω×RRN2 is a symmetric Carathéodory matrix function, which satisfies the following assumptions: for some real constants γ>0, α>0,β>0,

    |M(x,s)|β,M(x,s)ξξα(a(x)+|s|)γ|ξ|2, (1.2)

    for almost every xΩ, (s,ξ)R×RN, where a(x) is a measurable function, such that

    0<ζa(x)ρ, (1.3)

    for some positive constants ζ,ρ.

    We note that there are two difficulties in dealing with (1.1), the first one is the fact that, due to hypothesis (1.2), the differential operator A(u)=div(M(x,u)u) is well defined in H10(Ω), but it not coercive on H10(Ω) when u is large enough. Therefore, the classical Leray-Lions theorem cannot be applied even if f is sufficiently regular. The second difficulty is dealing with lower order term which singular natural growth with respect to the gradient. In order to overcome these difficulties, we approximate problem (1.1) by means of truncations in M(x,s) to get a coercive differential operator on H10(Ω).

    The existence of W1,10(Ω) solution to elliptic problem has been studied by many authors. Boccardo and Croce [4] proved the existence of W1,10(Ω) solutions to problem

    {div(a(x)u(1+|u|)γ)=f,xΩ,u=0,xΩ,

    where a:ΩR is a measurable function which satisfies (1.3), fLm(Ω) with

    m=NN+1γ(N1),1N1<γ<1.

    In the literature [6], the authors considered the existence and regularity of solutions to the following elliptic equation with noncoercivity

    {div(a(x,u)u)=f,xΩ,u=0,xΩ, (1.4)

    where Ω is an open bounded subset of RN(N3), fLm(Ω) and a(x,s):Ω×RR is a Carathéodory function which satisfies

    α(1+|s|)γa(x,s)β,

    where 0γ<1.The existence results of solutions to problem (1.4)are as following:

    ● There exists a weak solution uH10(Ω)L(Ω) to (1.4) if m>N2.

    ● There exists a weak solution uH10(Ω)Lr(Ω) to (1.4) with r=Nm(1γ)N2m if

    2NN+2γ(N2)m<N2.

    ● There exists a distributional solution uW1,q0(Ω) to (1.4) with q=Nm(1γ)Nm(1+γ)<2 if

    NN+1γ(N1)<m<2NN+2γ(N2).

    In [15], the under the assumption (1.2)-(1.3), Souilah proved the existence results of solutions to problem

    {div(M(x,u)u)+|u|2uθ=f+λur,xΩ,u=0,xΩ, (1.5)

    where 0<θ<1,0<r<2θ,λ>0,fLm(Ω)(m1). There exists at least a solution to problem (1.5):

    ● If 2N2Nθ(N2)m<N2, then uH10(Ω)L(Ω).

    ● If 1<m<2N2Nθ(N2), then uW1,q0(Ω) with q=Nm(2θ)Nmθ.

    ● If mN2, then uH10(Ω)L(Ω).

    Moreover, the existence of solutions uH10(Ω) to problem (1.5) with λ=0 have been obtained in [9]. Some other related results see [1,3,5,7,10,11,12,14,16].

    Based on the above research results, the aim of this article is to study the existence of W1,10(Ω) solution to problem (1.1).

    In order to state the main results of this paper, the following definition need to be introduced. We use the following notion of distributional solution to problem (1.1).

    Definition 1.1. We say that uW1,10(Ω) is a distributional solution to problem (1.1) if u>0 in Ω, |u|2uθL1(Ω) and

    ΩM(x,u)uφ+Ω|u|2uθφ=Ωfφ,

    for every φC0(Ω).

    Our main results are following:

    Theorem 1.2. Assume that (1.2)-(1.3) hold, fLm(Ω) is a nonnegative function with

    m=N2Nθ(N1),NN1<θ<2. (1.6)

    Then there exists a distributional solution uW1,10(Ω) to problem (1.1).

    Remark 1.3. Notice that the result of previous theorem do not depend on γ.

    Remark 1.4. Observe that, m>1 if and only if θ>NN1.

    For fL1(Ω), we have the following theorem.

    Theorem 1.5. Assume (1.2)-(1.3) hold, fL1(Ω) is a nonnegative function and θ=NN1. Then there exists a distributional solution uW1,10(Ω) to problem (1.1).

    The paper is organized as follows. In section 2, we collect some definitions and useful tools. The proof of Theorem 1.2 and 1.5 be given in section 3.

    In order to prove our main results, we need to introduce a basic definition and some lemmas.

    Definition 2.1. For all k0, the truncation function defined by

    Tk(s)=max{k,min{k,s}},Gk(s)=sTk(s).

    Let 0<ε<1, we approximate problem (1.1) by the following non-singular problem

    {div(M(x,T1ε(uε))uε)+uε|uε|2(|uε|+ε)θ+1=fε,xΩ,uε=0,xΩ, (2.1)

    where fε=T1ε(f). Problem (2.1) admits at least a solution uεH10(Ω)L(Ω) by Theorem 2 of [8]. Due to the fact that fε0 and quadratic lower order term has the same sign of the solution, it is easy to prove that uε0 by taking uε as a test function in (2.1).

    Lemma 2.2. Let uε be the solutions to problem (2.1). Then

    Ωuε|uε|2(uε+ε)θ+1Ωf. (2.2)

    Proof. For fixed h>0, taking Th(uε)h as a test function in (2.1). Dropping the first term, we obtain

    Ωuε|uε|2(uε+ε)θ+1Th(uε)hΩfεTh(uε)h.

    Using the fact that fεf and Th(uε)h1, then

    Ωuε|uε|2(uε+ε)θ+1Th(uε)hΩf.

    Letting h0, we deduce (2.2) by the Fatou Lemma.

    Lemma 2.3. Let δ>0 and 0<ε<1. Then there exists C>0, such that

    αδ(t+ε)θ2(ρ+t)γ+tt+εC.

    for every t0.

    Proof. Clearly, if tε, we have tt+ε12, while if t<ε, we have

    αδ(t+ε)θ2(ρ+t)γαδ(ρ+t)γ(2ε)2θαδ22θ(ρ+1)γ,

    since ε<1. Therefore, Lemma 2.3 is proved.

    In this section, C denotes a generic constant whose value might change from line to line. We prove the existence results of Theorems 1.2 and 1.5 by considering the following approximate problem

    {div(M(x,T1ε(uε))uε)+uε|uε|2(uε+ε)θ+1=fε,xΩ,uε=0,xΩ. (3.1)

    Proof of Theorem 1.2. Step 1: Let δ=θNN1, then δ>0 by (1.6). Choosing (uε+ε)δ(uε+ε)δ1 as a test function in the approximate problem (3.1), we find

    ΩM(x,T1ε(uε))uεuε[δ(uε+ε)δ1+(1δ)(uε+ε)δ2]+Ωuε(uε+ε)δ|uε|2(uε+ε)θ+1=Ωuε|uε|2(uε+ε)θ+1(uε+ε)δ1+Ωfε[(uε+ε)δ(uε+ε)δ1].

    Combining (1.2)-(1.3) and dropping the positive term, we obtain

    Ω|uε|2(uε+ε)δθ[α(1δ)(uε+ε)θ2(ρ+uε)γ+uεuε+ε]Ωuε|uε|2(uε+ε)θ+1(uε+ε)δ1+Ωfε(uε+ε)δ.

    Since 1δ>0, according to Lemma 2.3, we have

    CΩ|uε|2(uε+ε)δθΩuε|uε|2(uε+ε)θ+1(uε+ε)δ1+Ωfε(uε+ε)δ.

    Using the fact that uε0,fεf and (2.2), we obtain

    CΩ|uε|2(uε+ε)δθεδ1Ωuε|uε|2(uε+ε)θ+1+Ωf(uε+ε)δεδ1Ωf+Ωf(uε+ε)δ. (3.2)

    Observe that the left hand side of (3.2) can be rewritten as

    CΩ|[(uε+ε)δθ+22εδθ+22]|2. (3.3)

    Then, (3.2) and (3.3) imply

    CΩ|[(uε+ε)δθ+22εδθ+22]|2εδ1Ωf+Ωf(uε+ε)δ. (3.4)

    By the Sobolev inequality, satisfy

    [Ω|(uε+ε)δθ+22εδθ+22|2]22CΩ|[(uε+ε)δθ+22εδθ+22]|2. (3.5)

    Using the Hölder inequality and (3.4)-(3.5), we get

    [Ω|(uε+ε)δθ+22εδθ+22|2]22CfLm(Ω)+CfLm(Ω)[Ω(uε+ε)δm]1m.

    Since |(t+ε)sεs|2C[(t+ε)2s1] for every t0 and for suitable constant C independent on ε, then we find

    (Ω[(uε+ε)2(δθ+2)21])22CfLm(Ω)+CfLm(Ω)[Ω(uε+ε)δm]1m. (3.6)

    Thanks to the choice of δ, we have

    2(δθ+2)2=δm=NN1.

    Moreover 22>1m since m<N2. Then (3.6) implies that

    ΩuNN1εC. (3.7)

    Observe that δθ=NN1, then, (3.2), (3.7) follow

    Ω|uε|2(ε+uε)NN1C. (3.8)

    Combining (3.7)-(3.8) with the Hölder inequality, we obtain

    Ω|uε|=Ωuε(ε+uε)N2N2(ε+uε)N2N2[Ω|uε|2(ε+uε)NN1]12[Ω(ε+uε)NN1]12C.

    Then we get that {uε} is bounded in W1,10(Ω). Hence, there exists a subsequence {uε}, which converges to a measurable function u a.e. in Lr(Ω) with 1r<NN1.

    Step 2: First, we are going to estimate {uεk}|uε|. Choosing [(uε+ε)δ(k+ε)δ]+ as a test function in (3.1). By (1.2)-(1.3) and Lemma 2.3, we have

    {uεk}|uε|2(ε+uε)NN1({uεk}|f|m)1m({uεk}(ε+uε)NN1)1mC({uεk}|f|m)1m.

    Using the Hölder inequality and (3.7), we find

    {uεk}|uε|={uεk}uε(ε+uε)N2N2(ε+uε)N2N2C({uεk}|f|m)12m. (3.9)

    Choosing Tk(uε) as a test function in (3.1). Dropping the nonnegative lower order term, by (1.2)-(1.3) and the boundedness of uε in LNN1(Ω), we get

    Ω|Tk(uε)|2k(ρ+k)γαfL1(Ω). (3.10)

    This implies that Tk(uε)Tk(u) weakly in W1,20(Ω).

    Let E be a measurable subset of Ω, and i=1,,N. By the Hölder inequality and (3.9)-(3.10), we obtain

    E|uεxi|E|uε|E|Tk(uε)|+{uεk}|uε|meas(E)12(E|Tk(uε)|2)12+C({uεk}|f|m)12m. (3.11)

    The estimates (3.7) and (3.11) shows that the sequence {uεxi} is equi-integrable. Thus, by the Dunford–Pettis theorem, there exists a subsequence {uε} and Vi in L1(Ω), such that unxiVi in L1(Ω). Since uεxi is the distributional partial derivative of uε, then we have

    Ωuεxiφ=Ωuεφxi,φC0(Ω),

    for every ε>0.

    Since uεxiVi in L1(Ω) and uεu in L1(Ω), we find

    ΩViφ=Ωuφxi,φC0(Ω).

    This implies that Vi=uxi for every i.

    Step 3: We prove that uε|uε|2(uε+ε)θ+1 is equi-integrable. Let E⊂⊂Ω, then

    Euε|uε|2(uε+ε)θ+1E{uεk}uε|uε|2(uε+ε)θ+1+E{uεk}uε|uε|2(uε+ε)θ+1.

    For every subset E⊂⊂Ω,

    E{uεk}uε|uε|2(uε+ε)θ+1E{uεk}1uθε|Tk(uε)|2CE{uεk}|Tk(uε)|2,

    since uεC>0 in E by Proposition 2 of [9]. Moreover, since Tk(uε)Tk(u) weakly in W1,20(Ω), then there exists εn,δ>0, such that

    E{uεk}|Tk(uε)|dxϵ2,εεn, (3.12)

    for every ϵ>0 if μ(E)<δ.

    Choosing T1(uεTk1(uε)) as a test function in the approximate problem (3.1), dropping the nonnegative term, we have

    {uεk}uε|uε|2(uε+ε)θ+1{uεk1}f. (3.13)

    Observe there exists a constant C>0, such that μ(uεk1)Ck1. As uε are uniformly bounded in LNN1(Ω). This implies the right hand side of (3.13) converges to 0 as k. Thus, we deduce there exists k0>1, such that

    {uεk}uε|uε|2(uε+ε)θ+1ϵ2,k>k0, (3.14)

    for every ϵ>0. The (3.12), (3.14) imply that uε|uε|2(uε+ε)θ+1 is equi-integrable and converges a.e. to |u|2uθ.

    Let u the weak limit of the sequence of approximated solutions uε. Thanks to (2.2), we have

    Ωuε|uε|2(uε+ε)θ+1Ωf.

    Using the Fatou lemma, that uε convergence to u a.e, uε convergence to u a.e and the strict positivity of uε imply

    Ω|u|2uθΩfC.

    This show that |u|2uθL1(Ω).

    Since uε is bounded and uεu a.e, it follow M(x,T1ε(uε)uεM(x,u)u a.e. Hence, we can pass to the limit in (3.1). Thus prove that uW1,10(Ω) is a distributional solution of (1.1) and yields the conclusion of the proof of Theorem 1.1.

    Proof of Theorem 1.5. Step 1: For 0<ε<1, according to Lemma 2.2, we have

    12θ+1{uε1}|uε|2uθε{uε1}uε|uε|2(uε+ε)θ+1fL1(Ω). (3.15)

    By the Sobolev inequality, (3.15) lead to

    [Ω|u2θ2ε1|2]22CfL1(Ω), (3.16)

    which implies that

    [Ωu(2θ)22ε]22C+CfL1(Ω). (3.17)

    Observe that θ=(2θ)22=NN1. Then (3.17) shows that

    ΩuNN1εC. (3.18)

    Using the Hölder inequality and (3.15), (3.18), we obtain

    Ω|G1(uε)|={uε1}|G1(uε)|uθ2εuθ2ε[{uε1}|uε|2uθε]12[{uε1}uθε]12CfL1(Ω).

    This fact show that G1(uε) is bounded in W1,10(Ω).

    Choosing T1(uε) as a test function in (3.1), it is easy to prove that T1(uε) is bounded in H10(Ω)), hence in W1,10(Ω). Since uε=G1(uε)+T1(uε), we deduce that uε is bounded in W1,10(Ω).

    Moreover, due to (3.15) and the Hölder inequality, we have

    {uεk}|uε|={uεk}|uε|uθ2εuθ2εCf12L1(Ω). (3.19)

    That (3.10), (3.19) implies, for every measurable subset E, we have

    E|uεxi|E|uε|E|Tk(uε)|+{uεk}|uε|meas(E)12[k(ρ+k)γαfL1(Ω)]12+Cf12L1(Ω).

    Thus, we prove that uεu in W1,10(Ω). Then pass to the limit in problem (3.1), as in the proof of Theorem 1.2, it is sufficient to observe that uW1,10(Ω) is a distributional solution of (1.1). This concludes the proof the Theorem 1.5.

    In this paper, we main consider the existence of W1,10(Ω) solutions to a elliptic equation with principal part having noncoercivity. The main results show that the singular quadratic term has an important impact on this existence.

    This research was partially supported by the National Natural Science Foundation of China (No. 11761059), Program for Yong Talent of State Ethnic Affairs Commission of China (No. XBMU-2019-AB-34), Fundamental Research Funds for the Central Universities (No.31920200036) and First-rate Discipline of Northwest Minzu University.

    The authors declare that there is no conflict of interests regarding the publication of this article.



    [1] G. Blakley, Safeguarding cryptographic keys, Proc. Afips Natl. Comput. Conf., 48 (1979), 313. https://doi.org/10.1109/AFIPS.1979.98 doi: 10.1109/AFIPS.1979.98
    [2] A. Shamir, How to share a secret, Commun. ACM, 22 (1979), 612–613. https://doi.org/10.1145/359168.359176 doi: 10.1145/359168.359176
    [3] C. Thien, J. Lin, Secret image sharing, Comput. Graphics, 26 (2002), 767–770. https://doi.org/10.1016/S0097-8493(02)00131-0 doi: 10.1016/S0097-8493(02)00131-0
    [4] J. B. Feng, H. C. Wu, C. S. Tsai, Y. P. Chu, A new multi-secret images sharing scheme using largrange's interpolation, J. Syst. Software, 76 (2005), 326–339. https://doi.org/10.1016/j.jss.2004.07.250 doi: 10.1016/j.jss.2004.07.250
    [5] T. Liu, L. Lu, H. Yan, Polynomial-based extended secret image sharing scheme with reversible and unexpanded covers, Multimedia Tools Appl., 78 (2018), 1–23. https://doi.org/10.1007/s11042-018-6202-3 doi: 10.1007/s11042-018-6202-3
    [6] H. Yan, L. Lu, T. Liu, General meaningful shadow construction in secret image sharing, IEEE Access, 6 (2018), 45246–45255. https://doi.org/10.1109/ACCESS.2018.2865421 doi: 10.1109/ACCESS.2018.2865421
    [7] X. Liu, S. Wang, Z. Sang, Z. Zhang, A novel lossless recovery algorithm for basic matrix-based VSS, Multimedia Tools Appl., 77 (2018), 16461–16476. https://doi.org/10.1007/s11042-017-5215-7 doi: 10.1007/s11042-017-5215-7
    [8] N. Yang, S. Chen, H. Yu, C. Wang, Improvements of image sharing with steganography and authentication, J. Syst. Software, 80 (2006), 1070–1076. https://doi.org/10.1016/j.jss.2006.11.022 doi: 10.1016/j.jss.2006.11.022
    [9] T. Liu, L. Lu, M. Ding, T. Xuan, A Lossless polynomial-based secret image sharing scheme utilizing the filtering operation, Secur. Intell. Comput. Big-data Serv., 895 (2020), 129–139. https://doi.org/10.1007/978-3-030-16946-6_11 doi: 10.1007/978-3-030-16946-6_11
    [10] P. Li, J. Ma, H. Su, N. Yang, Improvements of a two-in-one image secret sharing scheme based on gray mixing model, J. Visual Commun. Image Represent., 23 (2012), 441–453. https://doi.org/10.1016/j.jvcir.2012.01.003 doi: 10.1016/j.jvcir.2012.01.003
    [11] J. Weir, Q. Yan, Sharing multiple secrets using visual cryptography, IEEE Int. Symp. Circuits Syst., 2009. https://doi.org/10.1109/ISCAS.2009.5117797 doi: 10.1109/ISCAS.2009.5117797
    [12] P. Li, N. Yang, Q. Kong, A novel two-in-one image secret sharing scheme based on perfect black visual cryptography, J. Real-Time Image Process., 14 (2018), 41–50. https://doi.org/10.1007/s11554-016-0621-z doi: 10.1007/s11554-016-0621-z
    [13] X. Liu, S. Wang, Z. Sang, Z. Zhang, A novel mapping-based lossless recovery algorithm for vss, J. Real-Time Image Process., 14 (2016), 51–60. https://doi.org/10.1007/s11554-016-0644-5 doi: 10.1007/s11554-016-0644-5
    [14] Y. Jiang, Q. Qi, L. Lu, X. Zhou, Secret image sharing with dealer-participatory and non-dealer-participatory mutual shadow authentication capabilities, Mathematice, 8 (2020), 234. https://doi.org/10.3390/math8020234 doi: 10.3390/math8020234
    [15] H. Yan, X. Liu, N. Yang, An enhanced threshold visual secret sharing based on random grids, J. Real-Time Image Process., 14 (2015), 61–73. https://doi.org/10.1007/s11554-015-0540-4 doi: 10.1007/s11554-015-0540-4
    [16] N. Yang, New visual secret sharing schemes using probabilistic method, Pattern Recognit. Lett., 25 (2004), 481–494. https://doi.org/10.1016/j.patrec.2003.12.011 doi: 10.1016/j.patrec.2003.12.011
    [17] Z. Wang, H. Su, Secret image sharing with smaller shadow images, Pattern Recognit. Lett., 27 (2006), 551–555. https://doi.org/10.1016/j.patrec.2005.09.021 doi: 10.1016/j.patrec.2005.09.021
    [18] Y. Lin, H. Chan, Invertible secret image sharing with steganography, Pattern Recognit. Lett., 31 (2010), 1887–1893. https://doi.org/10.1016/j.patrec.2010.01.019 doi: 10.1016/j.patrec.2010.01.019
    [19] F. Liu, K. Wu, Embedded extended visual cryptography schemes, IEEE Trans. Inf. Forensics Secur., 2 (2011), 307–322. https://doi.org/10.1109/TIFS.2011.2116782 doi: 10.1109/TIFS.2011.2116782
    [20] H. He, Q. Lan, H. Tang, A secure image sharing scheme with high quality stego-images based on steganography, Multimedia Tools Appl., 76 (2017), 7677–7698. https://doi.org/10.1007/s11042-016-3429-8 doi: 10.1007/s11042-016-3429-8
    [21] J. Chen, H. Zhou, B. Zhou, Defining cost functions for adaptive jpeg steganography at the microscale, IEEE Trans. Inf. Forensics Secur., 14 (2019), 1052–1066. https://doi.org/10.1109/TIFS.2018.2869353 doi: 10.1109/TIFS.2018.2869353
    [22] Y. Tao, S. Li, P. Zhang, C. Wang, Towards Robust Image Steganography, IEEE Trans. Circuits Syst. Video Technol., 29 (2021), 594–600. https://doi.org/10.1109/TCSVT.2018.2881118 doi: 10.1109/TCSVT.2018.2881118
    [23] Z. Zhao, X. Guan, H. Zhang, F. Zhao, Improving the robustness of adaptive steganographic algorithms based on transport channel matching, IEEE Trans. Inf. Forensics Secur., 14 (2019), 1843–1856. https://doi.org/10.1109/TIFS.2018.2885438 doi: 10.1109/TIFS.2018.2885438
    [24] Y. Wang, M. Zhang, X. Li, H. Yu, Non-additive cost functions for jpeg steganography based on block boundary maintenance, IEEE Trans. Inf. Forensics Secur., 16 (2021), 1117–1130. https://doi.org/10.1109/TIFS.2020.3029908 doi: 10.1109/TIFS.2020.3029908
    [25] T. Taburet, P. Bas, W. Sawaya, J. Fridrich, Natural steganography in jpeg domain with a linear development pipeline, IEEE Trans. Inf. Forensics Secur., 16 (2020), 173–186. https://doi.org/10.1109/TIFS.2020.3007354 doi: 10.1109/TIFS.2020.3007354
    [26] Y. Sun, Research on Key Technologies of Robust and Meaningful Secret Image Sharing, Master's thesis, National University of Defense Technology in Hefei, 2020. In press.
    [27] P. Bas, T. Filler, P. Tomas, "Break our steganographic system": the ins and outs of organizing BOSS, in Information Hiding, International Workshop on Information Hiding, (2011), 59–70. https://doi.org/10.1007/978-3-642-24178-9_5
    [28] H. Yan, T. Liu, L. Li, L. Lu, Robust secret image sharing resistant to noise in shares, ACM Trans. Multimedia Comput., Commun., Appl., 24 (2021), 1–22. https://doi.org/10.1145/3419750 doi: 10.1145/3419750
  • This article has been cited by:

    1. Mounim El Ouardy, Youssef El Hadfi, Some Nonlinear Parabolic Problems with Singular Natural Growth Term, 2022, 77, 1422-6383, 10.1007/s00025-022-01631-6
    2. Abdelkrim Moussaoui, Kamel Saoudi, Existence and Location of Nodal Solutions for Quasilinear Convection–Absorption Neumann Problems, 2024, 47, 0126-6705, 10.1007/s40840-024-01669-5
    3. Hocine Ayadi, Rezak Souilah, The impact of a singular first-order term in some degenerate elliptic equations involving Hardy potential, 2024, 9, 2662-2009, 10.1007/s43036-024-00324-x
  • Reader Comments
  • © 2022 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(2125) PDF downloads(67) Cited by(2)

Figures and Tables

Figures(11)  /  Tables(1)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog