Image fusion is one of the most important techniques in digital image processing, includes the development of software to make the integration of multiple sets of data for the same location; It is one of the new fields adopted in solve the problems of the digital image, and produce high-quality images contains on more information for the purposes of interpretation, classification, segmentation and compression, etc. In this research, there is a solution of problems faced by different digital images such as multi focus images through a simulation process using the camera to the work of the fuse of various digital images based on previously adopted fusion techniques such as arithmetic techniques (BT, CNT and MLT), statistical techniques (LMM,

In this work, silver (Ag) self-metallization on a polyimide (PI) film was prepared through autocatalytic plating. PI films were prepared through the solution casting method, followed by etching with potassium hydroxide (KOH) solution, sensitization with tin chloride (SnCl₂), and the use of palladium chloride (PdCl₂) to activate the surface of PI. Energy-dispersive X-ray analysis (EDX) showed the highest peak in the (Ag) region and confirmed the presence of AgNPs. The diffraction peaks at 2θ = 38.2^°, 44.5^°, 64.6^°, and 78.2^° represented the 111, 200, 220, and 311 planes of Ag, respectively. The FT–IR an

International Journal on Technical and Physical Problems of Engineering

The topic of supra.topological.spaces considered one of the important topics because it is a generalization to topological.spaces. Many researchers have presented generalizations to supra open sets such as supra semi.open and supra pre.open sets and others. In this paper, the concept of δ∼open sets was employed and introduced in to the concept of supra topology and a new type of open set was extracted, which was named S∼δ∼open. Our research entails the utilization of this category of sets to form a new concepts in these spaces, namely S∼δ∼limit points and S∼δ∼derive points, and examining its relationship with S∼open and S∼reg∼open. Based on this class of sets, we have introduced other new concepts such as S∼isolate

A comprehensive review focuses on 3D network-on-chip (NoC) simulators and plugins while paying attention to the 2D simulators as the baseline is presented. Discussions include the programming languages, installation configuration, platforms and operating systems for the respective simulators. In addition, the simulator’s properties and plugins for design metrics evaluations are addressed. This review is intended for the early career researchers starting in 3D NoC, offering selection guidelines on the right tools for the targeted NoC architecture, design, and requirements.

Image pattern classification is considered a significant step for image and video processing.Although various image pattern algorithms have been proposed so far that achieved adequate classification,achieving higher accuracy while reducing the computation time remains challenging to date. A robust imagepattern classification method is essential to obtain the desired accuracy. This method can be accuratelyclassify image blocks into plain, edge, and texture (PET) using an efficient feature extraction mechanism.Moreover, to date, most of the existing studies are focused on evaluating their methods based on specificorthogonal moments, which limits the understanding of their potential application to various DiscreteOrthogonal Moments (DOMs). The

This paper contains an equivalent statements of a pre-  space, where  are considered subsets of with the product topology. An equivalence relation between the preclosed set  and a pre-  space, and a relation between a pre-  space and the preclosed set  with some conditions on a function  are found. In addition, we have proved that the graph  of  is preclosed in if  is a pre-  space, where the equivalence relation  on  is open.

     On the other hand, we introduce the definition of a pre-stable ( pre-stable) set by depending on the concept of a pre-neighborhood, where we get that every stable set is pre-stable. Moreover, we obtain that

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