In this study, an efficient compression system is introduced, it is based on using wavelet transform and two types of 3Dimension (3D) surface representations (i.e., Cubic Bezier Interpolation (CBI)) and 1 st order polynomial approximation. Each one is applied on different scales of the image; CBI is applied on the wide area of the image in order to prune the image components that show large scale variation, while the 1 st order polynomial is applied on the small area of residue component (i.e., after subtracting the cubic Bezier from the image) in order to prune the local smoothing components and getting better compression gain. Then, the produced cubic Bezier surface is subtracted from the image signal to get the residue component. Then, thebi-orthogonal wavelet transform is applied on the produced Bezier residue component. The resulting transform coefficients are quantized using progressive scalar quantization and the 1 st order polynomial is applied on the quantized LL subband to produce the polynomial surface, then the produced polynomial surface is subtracted from the LL subband to get the residue component (high frequency component). Then, the quantized values are represented using quad tree encoding to prune the sparse blocks, followed by high order shift coding algorithm to handle the remaining statistical redundancy and to attain efficient compression performance. The conducted tests indicated that the introduced system leads to promising compression gain.
Fingerprints are commonly utilized as a key technique and for personal recognition and in identification systems for personal security affairs. The most widely used fingerprint systems utilizing the distribution of minutiae points for fingerprint matching and representation. These techniques become unsuccessful when partial fingerprint images are capture, or the finger ridges suffer from lot of cuts or injuries or skin sickness. This paper suggests a fingerprint recognition technique which utilizes the local features for fingerprint representation and matching. The adopted local features have determined using Haar wavelet subbands. The system was tested experimentally using FVC2004 databases, which consists of four datasets, each set holds
... Show MoreMany image processing and machine learning applications require sufficient image feature selection and representation. This can be achieved by imitating human ability to process visual information. One such ability is that human eyes are much more sensitive to changes in the intensity (luminance) than the color information. In this paper, we present how to exploit luminance information, organized in a pyramid structure, to transfer properties between two images. Two applications are presented to demonstrate the results of using luminance channel in the similarity metric of two images. These are image generation; where a target image is to be generated from a source one, and image colorization; where color information is to be browsed from o
... Show MoreThis study focuses on studying an oscillation of a second-order delay differential equation. Start work, the equation is introduced here with adequate provisions. All the previous is braced by theorems and examplesthat interpret the applicability and the firmness of the acquired provisions
Oscillation criterion is investigated for all solutions of the first-order linear neutral differential equations with positive and negative coefficients. Some sufficient conditions are established so that every solution of eq.(1.1) oscillate. Generalizing of some results in [4] and [5] are given. Examples are given to illustrated our main results.
In this paper, we introduce the concept of cubic bipolar-fuzzy ideals with thresholds (α,β),(ω,ϑ) of a semigroup in KU-algebra as a generalization of sets and in short (CBF). Firstly, a (CBF) sub-KU-semigroup with a threshold (α,β),(ω,ϑ) and some results in this notion are achieved. Also, (cubic bipolar fuzzy ideals and cubic bipolar fuzzy k-ideals) with thresholds (α,β),(ω ,ϑ) are defined and some properties of these ideals are given. Relations between a (CBF).sub algebra and-a (CBF) ideal are proved. A few characterizations of a (CBF) k-ideal with thresholds (α, β), (ω,ϑ) are discussed. Finally, we proved that a (CBF) k-ideal and a (CBF) ideal with thresholds (α, β), (ω,ϑ) of a KU-semi group are equivalent relations.
In this paper, the Decomposition method was used to find approximation solutions for a system of linear Fredholm integral equations of the second kind. In this method the solution of a functional equations is considered as the sum of an infinite series usually converging to the solution, and Adomian decomposition method for solving linear and nonlinear integral equations. Finally, numerical examples are prepared to illustrate these considerations.
In this work, the fractional damped Burger's equation (FDBE) formula = 0,
Land Use / Land Cover (LULC) classification is considered one of the basic tasks that decision makers and map makers rely on to evaluate the infrastructure, using different types of satellite data, despite the large spectral difference or overlap in the spectra in the same land cover in addition to the problem of aberration and the degree of inclination of the images that may be negatively affect rating performance. The main objective of this study is to develop a working method for classifying the land cover using high-resolution satellite images using object based method. Maximum likelihood pixel based supervised as well as object approaches were examined on QuickBird satellite image in Karbala, Iraq. This study illustrated that
... Show More