This paper proposes a nonparametric steganalysis method for quantization index modulation (QIM) based steganography. The proposed steganalysis method uses irregularity (or randomness) in the test-image to distinguish between the coverand the stego-image. We have shown that plain-quantization (quantization without message embedding) induces regularity in the resulting quantized-image; whereas me...

Information entropy as a universal and fascinating statistical concept is helpful for numerous problems in the computational sciences. Approximate entropy (ApEn), introduced by Pincus (1991), can classify complex data in diverse settings. The capability to measure complexity from a relatively small amount of data holds promise for applications of ApEn in a variety of contexts. In this work we a...

New directions in computing and algorithms has lead to some new applications that have tolerance to imprecision. Although, These applications are creating large volumes of data which exceeds the capability of today’s computing systems. Therefore, researchers are trying to find new techniques to alleviate this crisis. Approximate Computing is one promising technique that uses a trade off between...

Emerging applications such as R(ecognition), M(ining), and S(ynthesis) suit themselves well to approximate computing due to their intrinsic noise tolerance. RMS applications process massive, yet noisy and redundant data by probabilistic, often iterative, algorithms. Usually the solution space has many more elements than one, rendering a range of application outputs valid, as opposed to a single...

in this paper, we prove some approximate fixed point results for proximinal valued $beta$-contractive multifunctions on metric spaces. we show that our results generalize some old fixed point results in the literature.

We de ne approximate xed point in fuzzy norm spaces and prove the existence theorems, we also consider approximate pair constructive map- ping and show its relation with approximate fuzzy xed point.

This paper introduces a framework for clarifying and formalizing the duplicate document detection problem. Four distinct models are presented, each with a corresponding algorithm for its solution derived from the realm of approximate string matching. The robustness of these techniques is demonstrated through a set of experiments using data reflecting real-world degradation effects.

The theory instrument of grey relational analysis is grey relational grade between the sequences. The grey relational grade is a measure of the degree of association between two factors, or between two systems. It describes the relative changes among the various factors in the development process of the system. In turn, we can calculate the grey relational grade, compare and judge the grey rela...

With the development of information resources, there are more and more CD-ROM resources. The traditional disc management, storage and search methods can not meet the current requirements of the fast-paced CD-ROM management infomationization and standardization. Based on the demand, we studied a distributed intelligence disc management system with random access, fuzzy search and automatic pop-up...