The concealment of data has emerged as an area of deep and wide interest in research that endeavours to conceal data in a covert and stealth manner, to avoid detection through the embedment of the secret data into cover images that appear inconspicuous. These cover images may be in the format of images or videos used for concealment of the messages, yet still retaining the quality visually. Over the past ten years, there have been numerous researches on varying steganographic methods related to images, that emphasised on payload and the quality of the image. Nevertheless, a compromise exists between the two indicators and to mediate a more favourable reconciliation for this duo is a daunting and problematic task. Additionally, the current techniques have not been successful in attaining more improved security caused by the non-encrypted data that only underwent the first layer of concealment through merely a straightforward embedment process of the secret data within the images, thus allowing the extraction of the concealed data to be quite simple for hostile entities. Hence, in the current study, the proposed scheme, we have improved the Bit Inverting Map method to narrow the gap of existing work. Our experimental results indicate that the proposed framework maintains a better balance between image visual quality and security, with relatively less computational and complexity, which assures its effectiveness compared to other state-of-the-art methods.
Fractal image compression depends on representing an image using affine transformations. The main concern for researches in the discipline of fractal image compression (FIC) algorithm is to decrease encoding time needed to compress image data. The basic technique is that each portion of the image is similar to other portions of the same image. In this process, there are many models that were developed. The presence of fractals was initially noticed and handled using Iterated Function System (IFS); that is used for encoding images. In this paper, a review of fractal image compression is discussed with its variants along with other techniques. A summarized review of contributions is achieved to determine the fulfillment of fractal ima
... Show More
(1)
Fractal image compression gives some desirable properties like fast decoding image, and very good rate-distortion curves, but suffers from a high encoding time. In fractal image compression a partitioning of the image into ranges is required. In this work, we introduced good partitioning process by means of merge approach, since some ranges are connected to the others. This paper presents a method to reduce the encoding time of this technique by reducing the number of range blocks based on the computing the statistical measures between them . Experimental results on standard images show that the proposed method yields minimize (decrease) the encoding time and remain the quality results passable visually.
In this paper, an algorithm through which we can embed more data than the
regular methods under spatial domain is introduced. We compressed the secret data
using Huffman coding and then this compressed data is embedded using laplacian
sharpening method.
We used Laplace filters to determine the effective hiding places, then based on
threshold value we found the places with the highest values acquired from these filters
for embedding the watermark. In this work our aim is increasing the capacity of
information which is to be embedded by using Huffman code and at the same time
increasing the security of the algorithm by hiding data in the places that have highest
values of edges and less noticeable.
The perform
(2)
In this paper the behavior of the quality of the gradient that implemented on an image as a function of noise error is presented. The cross correlation coefficient (ccc) between the derivative of the original image before and after introducing noise error shows dramatic decline compared with the corresponding images before taking derivatives. Mathematical equations have been constructed to control the relation between (ccc) and the noise parameter.
(105)
(94)
The image caption is the process of adding an explicit, coherent description to the contents of the image. This is done by using the latest deep learning techniques, which include computer vision and natural language processing, to understand the contents of the image and give it an appropriate caption. Multiple datasets suitable for many applications have been proposed. The biggest challenge for researchers with natural language processing is that the datasets are incompatible with all languages. The researchers worked on translating the most famous English data sets with Google Translate to understand the content of the images in their mother tongue. In this paper, the proposed review aims to enhance the understanding o
... Show More
(1)
Drip irrigation is one of the conservative irrigation techniques since it implies supplying water directly on the soil through the emitter; it can supply water and fertilizer directly into the root zone. An equation to estimate the wetted area in unsaturated soil is taking into calculating the water absorption by roots is simulated numerically using HYDRUS (2D/3D) software. In this paper, HYDRUS comprises analytical types of the estimate of different soil hydraulic properties. Used one soil type, sandy loam, with three types of crops; (corn, tomato, and sweet sorghum), different drip discharge, different initial soil moisture content was assumed, and different time durations. The relative error for the different hydrauli
... Show More
(3)
In this research study the synodic month for the moon and theirrelationship with the mean anomaly for the moon orbit and date A.Dand for long periods of time (100 years), we was design a computerprogram that calculates the period of synodic months, and thecoordinates of the moon at the moment of the new moon with highaccuracy. During the 100 year, there are 1236 period of synodicmonths.We found that the when New Moon occurs near perigee (meananomaly = 0°), the length of the synodic month at a minimum.Similarly, when New Moon occurs near apogee (mean anomaly =180°), the length of the synodic month reaches a maximum. Theshortest synodic month on 2053 /1/ 16 and lasted (29.27436) days.The longest synodic month began on 2008 /11/ 27 a
... Show More