• 不 限
  • 期刊论文
  • 硕博论文
  • 会议论文
  • 报 纸
  • 英文论文
  2. 您的位置
  3. 首页
  4. 会议论文
  5. Research on the coding strategies for synonym substitution-based steganography

Research on the coding strategies for synonym substitution-based steganography

来源 :2014全国理论计算机科学学术年会 | 被引量 : 0次 | 上传用户：hanfenng
【摘 要】
：
It is crucial for synonym substitution-based steganographic algorithms to choose a suitable coding strategy for high embedding capacity.In this paper,three existing coding strategies are discussed in
【作 者】
：
Lingyun Xiang Gang Luo Yuhua Xie Weihu Chen 
【机 构】
：
School of Computer and Communication Engineering,Changsha University of Science and Technology,Chang
【出 处】
：
2014全国理论计算机科学学术年会
【发表日期】
：
2014年9期
【关键词】
：
Coding strategy Synonym substitution Steganography Embedding capacity 
下载到本地 , 更方便阅读
下载此文 赞助VIP
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
　　It is crucial for synonym substitution-based steganographic algorithms to choose a suitable coding strategy for high embedding capacity.In this paper,three existing coding strategies are discussed in detail.After that,a new coding strategy based on the concept of block coding is designed,and the binary tree based coding strategy is improved by constructing a complete binary tree to obtain the maximum expected coding length.The theoretical comparison of embedding capacity provided by different coding strategies has been given.The experimental results show that the block-based coding strategy provides a more balanced performance compared with other strategies.
其他文献
Image registration based on a novel culture particle swarm optimization
This paper designed a kind of optimization algorithm for image registration.By combining with cultural particle swarm optimization (CPSO),a novel image registration algorithm is outlined in this paper
会议
Culture particle swarm optimizationImage registrationMutual informationMeasur
Fuzzy Regular Languages and Associated Topology
Profinite topology plays a key role in formal languages.Depending on the fact that Boolean algebra of regular languages is in one-to-one correspondence to clopen of profinite topological space,we prov
会议
Fuzzy Finite AutomataFuzzy Regular LanguagesProfinite TopologiesProfinite Wor
Up-to Technique for Product Functor
To further explore the up-to techniques for bisimulation in the coalgebra setting,we investigate a special kind of functor,i.e.,product functor in this paper.Specifically,when F is the product of n su
会议
Up-to techniqueCoalgebraBisimulationJointly consistent function
Polynomial-time heuristic algorithms for several NP-complete optimization problems
Motivated by a previous work showing a new NP-complete decision problem,the Multistage graph Simple Path problem (MSP) possesses a novel polynomial-time heuristic algorithm,which has undergone extensi
会议
MSP problemoptimization problemmaximum satisfiabilitymaximum independent set
Method for Modeling CPS Based on Open Colored Petri Net
Spatio-Temporal properties are the intrinsic properties of Cyber-Physical System(CPS),the correlation in space and time between computing and physical entities should be fully considered in CPS modeli
会议
Cyber-Physical SystemSpatio-Temporal EventSpatial PropertiesModelingAnalysis
A Distributed and Parallel Algorithm Using Big Data Analysis and Its Verification Under Possibility
With the rapid development of cloud computing,how to effectively improve the utilization of computing resources in a cloud becomes a difficult problem.Therefore,a large number of distributed and paral
会议
Parallel algorithmBig dataVerificationPossibility Measure
An Ensemble Support Vector Machine Classifier for Health Identification Using Tongue Image
Considering poor quality and high noise in medical data,we propose an ensemble classifier based on support vector machine (SVM) and apply this classifier to health identification.Health identification
会议
Health identificationSVMEnsemble classifierTongue image
L(2,1)-labeling of flower snark and related graphs
An L(2,1)-labeling of a graph G is an assignment of nonnegative integers to the vertices of G such that adjacent vertices get numbers at least two apart,and vertices at distance two get distinct numbe
会议
L(21)-labelingL(21)-labeling numberFlower snark
Unbalanced Graph Partitioning
We investigate the unbalanced cut problems.A cut (A;B) is called unbalanced if the size of its smaller side is at most k (called k-size) or exactly k (called Ek-size),where k is an input parameter.An
会议
Secure Store of User Authentication Tokens in Multi-Cloud Storage System
To solve the security problems in single-cloud storage,multi-cloud storage system has been put forward in some literatures.However,when using multi-cloud,a user needs to be authenticated by different
会议
Cloud storage securityUser authenticationKerberos protocolToken management