In this study, a brand-new double transform known as the double INEM transform is introduced. Combined with the definition and essential features of the proposed double transform, new findings on partial derivatives, Heaviside function, are also presented. Additionally, we solve several symmetric applications to show how effective the provided transform is at resolving partial differential equation.
This paper deals with a new Henstock-Kurzweil integral in Banach Space with Bilinear triple n-tuple and integrator function Ψ which depends on multiple points in partition. Finally, exhibit standard results of Generalized Henstock - Kurzweil integral in the theory of integration.
This study's objective is to assess how well UV spectrophotometry can be used in conjunction with multivariate calibration based on partial least squares (PLS) regression for concurrent quantitative analysis of antibacterial mixture (Levofloxacin (LIV), Metronidazole (MET), Rifampicin (RIF) and Sulfamethoxazole (SUL)) in their artificial mixtures and pharmaceutical formulations. The experimental calibration and validation matrixes were created using 42 and 39 samples, respectively. The concentration range taken into account was 0-17 μg/mL for all components. The calibration standards' absorbance measurements were made between 210 and 350 nm, with intervals of 0.2 nm. The associated parameters were examined in order to develop the optimal c
... Show MoreRecovery of time-dependent thermal conductivity has been numerically investigated. The problem of identification in one-dimensional heat equation from Cauchy boundary data and mass/energy specification has been considered. The inverse problem recasted as a nonlinear optimization problem. The regularized least-squares functional is minimised through lsqnonlin routine from MATLAB to retrieve the unknown coefficient. We investigate the stability and accuracy for numerical solution for two examples with various noise level and regularization parameter.
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
... Show MoreThe Hartley transform generalizes to the fractional Hartley transform (FRHT) which gives various uses in different fields of image encryption. Unfortunately, the available literature of fractional Hartley transform is unable to provide its inversion theorem. So accordingly original function cannot retrieve directly, which restrict its applications. The intension of this paper is to propose inversion theorem of fractional Hartley transform to overcome this drawback. Moreover, some properties of fractional Hartley transform are discussed in this paper.
Steganography is a mean of hiding information within a more obvious form of
communication. It exploits the use of host data to hide a piece of information in such a way
that it is imperceptible to human observer. The major goals of effective Steganography are
High Embedding Capacity, Imperceptibility and Robustness. This paper introduces a scheme
for hiding secret images that could be as much as 25% of the host image data. The proposed
algorithm uses orthogonal discrete cosine transform for host image. A scaling factor (a) in
frequency domain controls the quality of the stego images. Experimented results of secret
image recovery after applying JPEG coding to the stego-images are included.
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
... Show MoreDigital image is widely used in computer applications. This paper introduces a proposed method of image zooming based upon inverse slantlet transform and image scaling. Slantlet transform (SLT) is based on the principle of designing different filters for different scales.
First we apply SLT on color image, the idea of transform color image into slant, where large coefficients are mainly the signal and smaller one represent the noise. By suitably modifying these coefficients , using scaling up image by box and Bartlett filters so that the image scales up to 2X2 and then inverse slantlet transform from modifying coefficients using to the reconstructed image .
&nbs
... Show MoreIn this paper, an algorithm for reconstruction of a completely lost blocks using Modified
Hybrid Transform. The algorithms examined in this paper do not require a DC estimation
method or interpolation. The reconstruction achieved using matrix manipulation based on
Modified Hybrid transform. Also adopted in this paper smart matrix (Detection Matrix) to detect
the missing blocks for the purpose of rebuilding it. We further asses the performance of the
Modified Hybrid Transform in lost block reconstruction application. Also this paper discusses
the effect of using multiwavelet and 3D Radon in lost block reconstruction.
In this work, we first construct Hermite wavelets on the interval [0,1) with it’s product, Operational matrix of integration 2^k M×2^k M is derived, and used it for solving nonlinear Variational problems with reduced it to a system of algebric equations and aid of direct method. Finally, some examples are given to illustrate the efficiency and performance of presented method.