This paper suggest two method of recognition, these methods depend on the extraction of the feature of the principle component analysis when applied on the wavelet domain(multi-wavelet). First method, an idea of increasing the space of recognition, through calculating the eigenstructure of the diagonal sub-image details at five depths of wavelet transform is introduced. The effective eigen range selected here represent the base for image recognition. In second method, an idea of obtaining invariant wavelet space at all projections is presented. A new recursive from that represents invariant space of representing any image resolutions obtained from wavelet transform is adopted. In this way, all the major problems that effect the image and change its characteristic are solved through calculating invariant eigen range of the recursive resolution forms of all sub-images coefficient. These approaches employed here as multi-wavelet transform identifier with minimum Mahalanobis distance. All method recognition proposed in this paper are applied on different images. Different tables of image recognition resulted in accurate and fast.
NeighShrink is an efficient image denoising algorithm based on the discrete wavelet
transform (DWT). Its disadvantage is to use a suboptimal universal threshold and identical
neighbouring window size in all wavelet subbands. Dengwen and Wengang proposed an
improved method, which can determine an optimal threshold and neighbouring window size
for every subband by the Stein’s unbiased risk estimate (SURE). Its denoising performance is
considerably superior to NeighShrink and also outperforms SURE-LET, which is an up-todate
denoising algorithm based on the SURE. In this paper different wavelet transform
families are used with this improved method, the results show that Haar wavelet has the
lowest performance among
Groupwise non-rigid image alignment is a difficult non-linear optimization problem involving many parameters and often large datasets. Previous methods have explored various metrics and optimization strategies. Good results have been previously achieved with simple metrics, requiring complex optimization, often with many unintuitive parameters that require careful tuning for each dataset. In this chapter, the problem is restructured to use a simpler, iterative optimization algorithm, with very few free parameters. The warps are refined using an iterative Levenberg-Marquardt minimization to the mean, based on updating the locations of a small number of points and incorporating a stiffness constraint. This optimization approach is eff
... Show MoreThis paper studies a novel technique based on the use of two effective methods like modified Laplace- variational method (MLVIM) and a new Variational method (MVIM)to solve PDEs with variable coefficients. The current modification for the (MLVIM) is based on coupling of the Variational method (VIM) and Laplace- method (LT). In our proposal there is no need to calculate Lagrange multiplier. We applied Laplace method to the problem .Furthermore, the nonlinear terms for this problem is solved using homotopy method (HPM). Some examples are taken to compare results between two methods and to verify the reliability of our present methods.
Urbanization led to significant changes in the properties of the land surface. That appends additional heat loads at the city, which threaten comfort and health of people. There is unclear understanding represent of the relationship between climate indicators and the features of the early virtual urban design. The research focused on simulation capability, and the affect in urban microclimate. It is assumed that the adoption of certain scenarios and strategies to mitigate the intensity of the UHI leads to the improvement of the local climate and reduce the impact of global warming. The aim is to show on the UHI methods simulation and the programs that supporting simulation and mitigate the effect UHI. UHI reviewed has been conducted the for
... Show MoreIn this paper Volterra Runge-Kutta methods which include: method of order two and four will be applied to general nonlinear Volterra integral equations of the second kind. Moreover we study the convergent of the algorithms of Volterra Runge-Kutta methods. Finally, programs for each method are written in MATLAB language and a comparison between the two types has been made depending on the least square errors.
In this work, results from an optical technique (laser speckle technique) for measuring surface roughness was done by using statistical properties of speckle pattern from the point of view of computer image texture analysis. Four calibration relationships were used to cover wide range of measurement with the same laser speckle technique. The first one is based on intensity contrast of the speckle, the second is based on analysis of speckle binary image, the third is on size of speckle pattern spot, and the latest one is based on characterization of the energy feature of the gray level co-occurrence matrices for the speckle pattern. By these calibration relationships surface roughness of an object surface can be evaluated within the
... Show MoreThe phytoremediation technique has become very efficient for treating soil contaminated with heavy metals. In this study, a pot experiment was conducted where the Dodonaea plant (known as hops) was grown, and soil previously contaminated with metals (Zn, Ni, Cd) was added at concentrations 100, 50, 0 mg·kg-1 for Ni and Zn, and at concentrations of 0, 5, 10 mg·kg-1 for cadmium. Irrigation was done within the limits of the field capacity of the soil. Cadmium, nickel and zinc was estimated in the soil to find out the capacity of plants to the absorption of heavy and contaminated metals by using bioconcentration factors (BCFs), bioaccumulation coefficient (BAC) and translocation factor (TF). Additionally, BCF values of both Ni and Zn were l
... Show More