scholarly journals Development of Scalable Coding of Encrypted Images Using Modified Absolute Moment Block Truncation Code

2022 ◽  
Author(s):  
Pankiraj Jeya Bright ◽  
Vishnuvarthanan Govindaraj ◽  
Yu-Dong Zhang ◽  
Pallikonda Rajasekaran ◽  
Anisha Milton ◽  
...  
Keyword(s):  
Random Number ◽  
Input Image ◽  
Scalable Coding ◽  
Bilinear Interpolation ◽  
Absolute Moment ◽  
Interpolation Technique ◽  
Novel Method ◽  
Pixel Value ◽  
Encrypted Images ◽  
The Given

Abstract Many researchers worked on scalable coding for unencrypted images, and there is more space for research in scalable coding for encrypted images. This paper proposes a novel method of scalable coding for encrypted images, especially for lossy compression images using the Modified Absolute Moment Block Truncation Code (MAMBTC) technique. The given input image is compressed using MAMBTC and then encrypted using a Pseudo-Random Number (PRNG) at the encryption phase. The PRNG is shared between the encoder and the decoder. At the decryption phase, the compressed pixel value is obtained by decryption using the PRNG and then reconstructed using MAMBTC, scaled by scaling factor 2 and Bilinear Interpolation Technique to obtain the original image. MAMBTC gives better image quality than Block Truncation Code (BTC), a higher PSNR of 36.32 dB, and a Compression ratio of 1.09, which makes the proposed system ready for the signal processing community/applications.

scholarly journals Development of a Scalable Coding for the Encryption of Images using Diagonal Min-Max Block Truncation Code

2019 ◽  
Vol 9 (1S4) ◽  
pp. 718-723
Keyword(s):  
Input Image ◽  
Scalable Coding ◽  
Gray Level ◽  
Receiver Side ◽  
Pseudorandom Numbers ◽  
Block Truncation Coding ◽  
Gray Level Image ◽  
Pixel Value ◽  
Encrypted Images ◽  
Bit Stream

This paper proposes a scalability coding on encrypted images, especially resolution scalability on lossy compression images. In the compression stage, the input gray level image is compressed using Diagonal Min-Max Block Truncation Coding technique. The compressed input image is encrypted using pseudorandom numbers masked by modulo-256, and then the encoded bit streams are transmitted. The pseudorandom numbers generated will be the encrypted key and the same is shared to the receiver. In the receiver side, the encoded bit stream is decrypted by using the shared encrypted key, which gives the compressed pixel value. Then the original image is reconstructed by using Diagonal Min-Max Block Truncation Coding Technique.

Analisis Kualitas Interpolasi Terhadap Fitur Statistik pada Citra

2017 ◽  
Vol 8 (2) ◽  
Author(s):  
Meirista Wulandari
Keyword(s):  
Image Processing ◽  
Pattern Recognition ◽  
Statistical Methods ◽  
Nearest Neighbor ◽  
Input Image ◽  
Bilinear Interpolation ◽  
Interpolation Technique ◽  
Image Density ◽  
Index Terms ◽  
Bicubic Interpolation

There are a lot of applications of pattern recognition which need input image with a certain size. The size effect the result of pattern recognition. Determining size of image adopts interpolation technique. Interpolated image’s quality depends on interpolation technique. Texture is the main feature which is used in image processing and computer vision to classify object. One of some methods that are used to characterize texture is statistical methods. Statistical methods characterize texture by the statistical distribution of the image density. This research compared 4 interpolation methods (Nearest Neighbor Interpolation, Bilinear Interpolation, Bicubic Interpolation and Nearest Neighbor Value Interpolation) and 6 features of 10 test images. Based on 6 features which are researched, skewness changes upto 800%, energy 90%, entropy 75%, smoothness 18%, standard deviation 10% and mean 0,9%. Index Terms—Interpolation, Statistical feature, NNI, Bilinear Interpolation, NNV, Bicubic Interpolation

scholarly journals A novel method for the analytical solution of fractional Zakharov–Kuznetsov equations

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Rasool Shah ◽  
Hassan Khan ◽  
Dumitru Baleanu ◽  
Poom Kumam ◽  
Muhammad Arif
Keyword(s):  
Present Method ◽  
Decomposition Method ◽  
Fractional Derivatives ◽  
Adomian Decomposition Method ◽  
Current Method ◽  
Analytical Technique ◽  
Suggested Technique ◽  
Adomian Decomposition ◽  
Novel Method ◽  
The Given

AbstractIn this article, an efficient analytical technique, called Laplace–Adomian decomposition method, is used to obtain the solution of fractional Zakharov– Kuznetsov equations. The fractional derivatives are described in terms of Caputo sense. The solution of the suggested technique is represented in a series form of Adomian components, which is convergent to the exact solution of the given problems. Furthermore, the results of the present method have shown close relations with the exact approaches of the investigated problems. Illustrative examples are discussed, showing the validity of the current method. The attractive and straightforward procedure of the present method suggests that this method can easily be extended for the solutions of other nonlinear fractional-order partial differential equations.

scholarly journals Design of True Random Number Circuit with Controllable Frequency

Electronics ◽  
2021 ◽  
Vol 10 (13) ◽  
pp. 1517
Author(s):  
Xinsheng Wang ◽  
Xiyue Wang
Keyword(s):  
Random Number ◽  
Noise Source ◽  
State Of The Art ◽  
Building Blocks ◽  
Encryption Algorithm ◽  
Random Numbers ◽  
Random Number Generators ◽  
Random Telegraph Noise ◽  
Telegraph Noise ◽  
Novel Method

True random number generators (TRNGs) have been a research hotspot due to secure encryption algorithm requirements. Therefore, such circuits are necessary building blocks in state-of-the-art security controllers. In this paper, a TRNG based on random telegraph noise (RTN) with a controllable rate is proposed. A novel method of noise array circuits is presented, which consists of digital decoder circuits and RTN noise circuits. The frequency of generating random numbers is controlled by the speed of selecting different gating signals. The results of simulation show that the array circuits consist of 64 noise source circuits that can generate random numbers by a frequency from 1 kHz to 16 kHz.

scholarly journals An evolutionary approach to the vehicle route planning in e-waste mobile collection on demand

2021 ◽  
Vol 25 (8) ◽  
pp. 6665-6680
Author(s):  
Krzysztof Szwarc ◽  
Piotr Nowakowski ◽  
Urszula Boryczka
Keyword(s):  
Tabu Search ◽  
Quality Evaluation ◽  
Memetic Algorithm ◽  
Route Planning ◽  
Memetic Algorithms ◽  
Approximate Methods ◽  
On Demand ◽  
Suboptimal Solutions ◽  
Novel Method ◽  
The Given

AbstractThe article discusses the utilitarian problem of the mobile collection of waste electrical and electronic equipment. Due to its $$\mathcal {NP}$$ NP -hard nature, implies the application of approximate methods to discover suboptimal solutions in an acceptable time. The paper presents the proposal of a novel method of designing the Evolutionary and Memetic Algorithms, which determine favorable route plans. The recommended methods are determined using quality evaluation indicators for the techniques applied herein, subject to the limits characterizing the given company. The proposed Memetic Algorithm with Tabu Search provides much better results than the metaheuristics described in the available literature.

Shadow Removal Using Inpainting and Interpolation Technique

2014 ◽  
Vol 626 ◽  
pp. 32-37 ◽  
Author(s):  
Ajayan Lekshmi ◽  
C. Christopher Seldev
Keyword(s):  
Image Inpainting ◽  
Smooth Transition ◽  
Color Model ◽  
Shadow Removal ◽  
Bilinear Interpolation ◽  
False Color ◽  
Novel Approach ◽  
Reconstruction Quality ◽  
Hsv Color Model ◽  
Interpolation Technique

Shadows are viewed as undesired information that strongly affects images. Shadows may cause a high risk to present false color tones, to distort the shape of objects, to merge, or to lose objects. This paper proposes a novel approach for the detection and removal of shadows in an image. Firstly the shadow and non shadow region of the original image is identified by HSV color model. The shadow removal is based on exemplar based image inpainting. Finally, the border between the reconstructed shadow and the non shadow areas undergoes bilinear interpolation to yield a smooth transition between them. They would lead to a better fitting of the shadow and non shadow classes, thus resulting in a potentially better reconstruction quality.

scholarly journals Linear traveltime perturbation interpolation: a novel method to compute 3-D traveltimes

2015 ◽  
Vol 203 (1) ◽  
pp. 548-552 ◽  
Author(s):  
Jianzhong Zhang ◽  
Junjie Shi ◽  
Lin-Ping Song ◽  
Hua-wei Zhou
Keyword(s):  
Seismic Waves ◽  
Homogeneous Medium ◽  
Cell Boundary ◽  
Routine Method ◽  
Bilinear Interpolation ◽  
Linear Distribution ◽  
Heterogeneous Model ◽  
Computational Errors ◽  
Novel Method ◽  
The Difference

Abstract The linear traveltime interpolation has been a routine method to compute first arrivals of seismic waves and trace rays in complex media. The method assumes that traveltimes follow a linear distribution on each boundary of cells. The linearity assumption of traveltimes facilitates the numerical implementation but its violation may result in large computational errors. In this paper, we propose a new way to mitigate the potential shortcoming hidden in the linear traveltime interpolation. We use the vertex traveltimes in a calculated cell to introduce an equivalent homogeneous medium that is specific to the cell boundary from a source. Therefore, we can decompose the traveltime at a point on the cell boundary into two parts: (1) a reference traveltime propagating in the equivalent homogeneous medium and (2) a perturbation traveltime that is defined as the difference between the original and reference traveltimes. We now treat that the traveltime perturbation is linear along each boundary of cells instead of the traveltime. With the new assumption, we carry out the bilinear interpolation over traveltime perturbation to complete traveltime computation in a 3-D heterogeneous model. The numerical experiments show that the new method, the linear traveltime perturbation interpolation, is able to achieve much higher accuracy than that based on the linear traveltime interpolation.

scholarly journals Single Image Dehazing Using Sparse Contextual Representation

Atmosphere ◽  
2021 ◽  
Vol 12 (10) ◽  
pp. 1266
Author(s):  
Jing Qin ◽  
Liang Chen ◽  
Jian Xu ◽  
Wenqi Ren
Keyword(s):  
Sparse Representation ◽  
State Of The Art ◽  
Input Image ◽  
Single Image ◽  
Image Dehazing ◽  
Dark Channel ◽  
Local Patch ◽  
Novel Method ◽  
Contextual Representation ◽  
Single Image Dehazing

In this paper, we propose a novel method to remove haze from a single hazy input image based on the sparse representation. In our method, the sparse representation is proposed to be used as a contextual regularization tool, which can reduce the block artifacts and halos produced by only using dark channel prior without soft matting as the transmission is not always constant in a local patch. A novel way to use dictionary is proposed to smooth an image and generate the sharp dehazed result. Experimental results demonstrate that our proposed method performs favorably against the state-of-the-art dehazing methods and produces high-quality dehazed and vivid color results.

Preserving Information Security Using Fractal-Based Cryptosystem

2021 ◽  
pp. 539-566
Author(s):  
Shafali Agarwal
Keyword(s):  
Real World ◽  
Random Sequence ◽  
Chaotic Map ◽  
Simple Approach ◽  
Fractal Function ◽  
Image Rotation ◽  
Pixel Value ◽  
Image Pixels ◽  
World Information ◽  
The Given

The chapter intends to propose a hybrid cryptosystem based on a chaotic map and a fractal function. The sequential order of process execution provides a computationally less expensive and simple approach that still designed a secure cryptosystem. A one-dimensional Ricker map and its modified form are employed to initially shuffle the image pixels twice, and also a pseudo-random sequence is generated using both maps. The algorithm implemented a sequence of pixel confusion-diffusion steps using the image rotation and a transcendental anti-Mandelbrot fractal function (TAMFF) and its Mann-iterated fractal function (Sup-TAMFF). Finally, the pixel value of an image obtained in the last step and the recent two pixels of the encrypted image is XORed with the corresponding pseudo-random matrix value to get the cipher image. Subsequently, various performance tests are conducted to verify the suitability of the given method to be used in real-world information transmission.

Sign in / Sign up

Export Citation Format

Share Document