A loS.sless (reversible) data hiding (embedding) method  inside  an image  (translating medium)  - presented   in  the  present  work  using  L_SB (least  significant  bit). technique  which  enables  us to translate   data  using an  image  (host  image),  using  a  secret  key, to  be  undetectable  without losing  any  data  or  without   changing   the  size  and  the  external   scene (visible  properties) of the image, the hid-ing data is then can  be extracted (without  losing)   by reversing &n

This paper presents a proposed neural network algorithm to solve the shortest path problem (SPP) for communication routing. The solution extends the traditional recurrent Hopfield architecture introducing the optimal routing for any request by choosing single and multi link path node-to-node traffic to minimize the loss. This suggested neural network algorithm implemented by using 20-nodes network example. The result shows that a clear convergence can be achieved by 95% valid convergence (about 361 optimal routes from 380-pairs). Additionally computation performance is also mentioned at the expense of slightly worse results.

     This paper introduces a relation between resultant and the Jacobian determinant
by generalizing Sakkalis theorem from two polynomials in two variables to the case of (n) polynomials in (n) variables. This leads us to study the results of the type:  ,            and use this relation to attack the Jacobian problem. The last section shows our contribution to proving the conjecture.

in this paper we adopted ways for detecting edges locally classical prewitt operators and modification it are adopted to perform the edge detection and comparing then with sobel opreators the study shows that using a prewitt opreators

Data hiding is the process of encoding extra information in an image by making small modification to its pixels. To be practical, the hidden data must be perceptually invisible yet robust to common signal processing operations. This paper introduces a scheme for hiding a signature image that could be as much as 25% of the host image data and hence could be used both in digital watermarking as well as image/data hiding. The proposed algorithm uses orthogonal discrete wavelet transforms with two zero moments and with improved time localization called discrete slantlet transform for both host and signature image. A scaling factor ? in frequency domain control the quality of the watermarked images. Experimental results of signature image

In this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .

    In this paper, we devoted to use circular shape sliding block, in image edge determination. The circular blocks have symmetrical properties in all directions for the mask points around the central mask point. Therefore, the introduced method is efficient to be use in detecting image edges, in all directions curved edges, and lines. The results exhibit a very good performance in detecting image edges, comparing with other edge detectors results.

Skin detection is classification the pixels of the image into two types of pixels skin and non-skin. Whereas, skin color affected by many issues like various races of people, various ages of people gender type. Some previous researchers attempted to solve these issues by applying a threshold that depends on certain ranges of skin colors. Despite, it is fast and simple implementation, it does not give a high detection for distinguishing all colors of the skin of people. In this paper suggests improved ID3 (Iterative Dichotomiser) to enhance the performance of skin detection. Three color spaces have been used a dataset of RGB obtained from machine learning repository, the University of California Irvine (UCI), RGB color space, HSV color sp

Steganography is the art of secret communication. Its purpose is to hide the presence of information, using, for example, images as covers. The frequency domain is well suited for embedding in image, since hiding in this frequency domain coefficients is robust to many attacks. This paper proposed hiding a secret image of size equal to quarter of the cover one. Set Partitioning in Hierarchal Trees (SPIHT) codec is used to code the secret image to achieve security. The proposed method applies Discrete Multiwavelet Transform (DMWT) for cover image. The coded bit stream of the secret image is embedded in the high frequency subbands of the transformed cover one. A scaling factors ? and ? in frequency domain control the quality of the stego

Autorías: Wafaa Sabah Mohammed Al-Khafaji, Fatimah Hameed Kzar Al-Masoodi, Suadad Ibrahim Suhail Al-Kinani. Localización: Revista iberoamericana de psicología del ejercicio y el deporte. Nº. 3, 2023. Artículo de Revista en Dialnet.