Abstract It is shown experimentally a new digital optical decoding scheme based on the transmission or polarized light at p polarization planes using K‐Nearest Neighbour (KNN) algorithm through single‐mode fibre 633 nm. The power signal sent which constitute classes required for bit recognition. Results show that it possible to recognize 32 polarizations planes, 5 bits, 4 features corresponding...

In this paper, we suggest a lower and an upper bound for the Generalized Fibonaccip-Sequence, for different values of p. The Fibonacci-p-Sequence is a generalization of the Classical Fibonacci Sequence. We first show that the ratio of two consecutive terms in generalized Fibonacci sequence converges to a p-degree polynomial and then use this result to prove the bounds for generalized Fibonacci-...

Great concern has arisen in the field of reversible data hiding encrypted images (RDHEI) due to development cloud storage and privacy protection. RDHEI is an effective technology that can embed additional after image encryption, extract error-free reconstruct original losslessly. In this paper, a high-capacity fully method proposed, which based on pixel prediction multi-MSB (most significant bi...

However, the dodecahedron and the icosahedron can be realized with rational coordinates if we do not require them to be precisely regular: If you perturb the vertices of a regular icosahedron “just a bit” into rational position, then taking the convex hull will yield a rational polytope that is combinatorially equivalent to the regular icosahedron. Similarly, by perturbing the facet planes of a...

We study the problem of memory-e cient scalable image compression and investigate some tradeo s in the complexity vs. coding e ciency space. The focus is on a low-complexity algorithm centered around the use of sub-bit-planes, scan-causal modeling, and a simpli ed arithmetic coder. This algorithm approaches the lowest possible memory usage for scalable wavelet-based image compression and demons...

We proposed a context-based binary arithmetic coding to improve entropy coding of the enhancement layer for the H.26Lbased Fine Granularity Scalability (FGS). Instead of independent bit-plane coding, we exploit correlation between various bitplanes and neighboring coefficients. For each bit-plane, we perform significant/refinement bit partition and construct contexts separately in terms of ener...

We study the problem of memory-eecient scalable image compression and investigate some tradeoos in the complexity vs. coding eeciency space. The focus is on a low-complexity algorithm centered around the use of sub-bit-planes, scan-causal modeling, and a simpliied arithmetic coder. This algorithm approaches the lowest possible memory usage for scalable wavelet-based image compression and demons...

-------------------------------------------------------------------ABSTRACT-----------------------------------------------------------------Data hiding is the art of embedding data into digital media in a way such that the existence of data remains concealed from everyone except the intended recipient. In this paper, we discuss the various Least Significant Bit (LSB) data hiding techniques. We ...

In this paper, we address the problem of joint sourcechannel coding (JSCC) for fine-granular-scalability (FGS) video over wireless packet-erasure channels in two aspects. First, we study the impact of JSCC applying equal error protection (EEP) to bit-planes of the enhancement-layer and we compare optimal protection resulted from the scheme with fixed protection. Second, we present JSCC scheme u...