Random pixel selection is one of the image steganography methods that has achieved significant success in enhancing the robustness of hidden data.This property makes it difficult for steganalysts’powerful data extrac...Random pixel selection is one of the image steganography methods that has achieved significant success in enhancing the robustness of hidden data.This property makes it difficult for steganalysts’powerful data extraction tools to detect the hidden data and ensures high-quality stego image generation.However,using a seed key to generate non-repeated sequential numbers takes a long time because it requires specific mathematical equations.In addition,these numbers may cluster in certain ranges.The hidden data in these clustered pixels will reduce the image quality,which steganalysis tools can detect.Therefore,this paper proposes a data structure that safeguards the steganographic model data and maintains the quality of the stego image.This paper employs the AdelsonVelsky and Landis(AVL)tree data structure algorithm to implement the randomization pixel selection technique for data concealment.The AVL tree algorithm provides several advantages for image steganography.Firstly,it ensures balanced tree structures,which leads to efficient data retrieval and insertion operations.Secondly,the self-balancing nature of AVL trees minimizes clustering by maintaining an even distribution of pixels,thereby preserving the stego image quality.The data structure employs the pixel indicator technique for Red,Green,and Blue(RGB)channel extraction.The green channel serves as the foundation for building a balanced binary tree.First,the sender identifies the colored cover image and secret data.The sender will use the two least significant bits(2-LSB)of RGB channels to conceal the data’s size and associated information.The next step is to create a balanced binary tree based on the green channel.Utilizing the channel pixel indicator on the LSB of the green channel,we can conceal bits in the 2-LSB of the red or blue channel.The first four levels of the data structure tree will mask the data size,while subsequent levels will conceal the remaining digits of secret data.After embedding the bits in the binary tree level by level,the model r展开更多
A bearing capacity evaluation for the surface strip foundation on a working platform modelled on a twolayered substrate is considered in the study.The upper layer is assumed as man-made and wellcontrolled and thus non...A bearing capacity evaluation for the surface strip foundation on a working platform modelled on a twolayered substrate is considered in the study.The upper layer is assumed as man-made and wellcontrolled and thus non-variable.The lower layer modelling natural cohesive soil is subjected to spatial variability of undrained shear strength.The random failure mechanism method(RFMM)is used to evaluate the bearing capacity.This approach employs a kinematic assessment of the critical load and incorporates the averaging of three-dimensional(3 D)random field along dissipation surfaces that result from the failure mechanism geometry.A novel version of the approach considering an additional linear trend of undrained shear strength in the spatially variable layer is proposed.The high efficiency of the RFMM algorithm is preserved.The influences of foundation length,trend slope in the spatially variable layer,fluctuation scales,and thickness of the homogenous sand layer on the resulting bearing capacity evaluations are analysed.Moreover,for selected cases,verification of the RFMM based assessment obtained using random finite difference method(RFDM)based on 3 D analysis is provided.Two types of analyses are performed using RFDM based on associated and non-associated flow rules.For associated flow rule which corresponds to RFMM,the RFMM is conservative and efficient and thus it seems preferable.However,if RFDM employs non-associated flow rule(much lower dilation angle for sand layer),the efficient RFMM is no longer conservative.For this situation,a combined approach that improves the efficiency of the numerical method is suggested.展开更多
文摘Random pixel selection is one of the image steganography methods that has achieved significant success in enhancing the robustness of hidden data.This property makes it difficult for steganalysts’powerful data extraction tools to detect the hidden data and ensures high-quality stego image generation.However,using a seed key to generate non-repeated sequential numbers takes a long time because it requires specific mathematical equations.In addition,these numbers may cluster in certain ranges.The hidden data in these clustered pixels will reduce the image quality,which steganalysis tools can detect.Therefore,this paper proposes a data structure that safeguards the steganographic model data and maintains the quality of the stego image.This paper employs the AdelsonVelsky and Landis(AVL)tree data structure algorithm to implement the randomization pixel selection technique for data concealment.The AVL tree algorithm provides several advantages for image steganography.Firstly,it ensures balanced tree structures,which leads to efficient data retrieval and insertion operations.Secondly,the self-balancing nature of AVL trees minimizes clustering by maintaining an even distribution of pixels,thereby preserving the stego image quality.The data structure employs the pixel indicator technique for Red,Green,and Blue(RGB)channel extraction.The green channel serves as the foundation for building a balanced binary tree.First,the sender identifies the colored cover image and secret data.The sender will use the two least significant bits(2-LSB)of RGB channels to conceal the data’s size and associated information.The next step is to create a balanced binary tree based on the green channel.Utilizing the channel pixel indicator on the LSB of the green channel,we can conceal bits in the 2-LSB of the red or blue channel.The first four levels of the data structure tree will mask the data size,while subsequent levels will conceal the remaining digits of secret data.After embedding the bits in the binary tree level by level,the model r
文摘A bearing capacity evaluation for the surface strip foundation on a working platform modelled on a twolayered substrate is considered in the study.The upper layer is assumed as man-made and wellcontrolled and thus non-variable.The lower layer modelling natural cohesive soil is subjected to spatial variability of undrained shear strength.The random failure mechanism method(RFMM)is used to evaluate the bearing capacity.This approach employs a kinematic assessment of the critical load and incorporates the averaging of three-dimensional(3 D)random field along dissipation surfaces that result from the failure mechanism geometry.A novel version of the approach considering an additional linear trend of undrained shear strength in the spatially variable layer is proposed.The high efficiency of the RFMM algorithm is preserved.The influences of foundation length,trend slope in the spatially variable layer,fluctuation scales,and thickness of the homogenous sand layer on the resulting bearing capacity evaluations are analysed.Moreover,for selected cases,verification of the RFMM based assessment obtained using random finite difference method(RFDM)based on 3 D analysis is provided.Two types of analyses are performed using RFDM based on associated and non-associated flow rules.For associated flow rule which corresponds to RFMM,the RFMM is conservative and efficient and thus it seems preferable.However,if RFDM employs non-associated flow rule(much lower dilation angle for sand layer),the efficient RFMM is no longer conservative.For this situation,a combined approach that improves the efficiency of the numerical method is suggested.
