Hueckel edge detector study using binary step edge image is presented. The standard algorithm that Hueckel presented, in his paper without any alteration is adopted. This paper studies a fully analysis for the algorithm efficiency, time consuming and the expected results with slide window size and edge direction. An analysis for its behavior with the changing of the slide window size (disk size) is presented. The best result is acquired when the window size equals to four pixel.
In this study, Yogurt was dried and milled, then shaked with distilled water to remove the soluble materials, then again dried and milled. Batch experiments were carried out to remove hexavalent chromium from aqueous solutions. Different parameters were optimized such as amount of adsorbent, treatment time, pH and concentration of adsorbate. The concentrations of Cr6+ in solutions are determined by UV-Visible spectrophotometer. Maximum percentage removal of Cr6+ was 82% at pH 2. Two equilibrium adsorption isotherms mechanisms are tested Langmuir and Freundlich, the results showed that the isotherm obeyed to Freundlich isotherm. Kinetic models were applied to the adsorption of Cr6+ ions on the adsorbents, ps
... Show MoreThis research had been achieved to identify the image of the subsurface structure representing the Tertiary period in the Galabat Field northeast of Iraq using 2D seismic survey measurements. Synthetic seismograms of the Galabat-3 well were generated in order to identify and pick the reflectors in seismic sections. Structural Images were drawn in the time domain and then converted to the depth domain by using average velocities. Structurally, seismic sections illustrate these reflectors are affected by two reverse faults affected on the Jeribe Formation and the layers below with the increase in the density of the reverse faults in the northern division. The structural maps show Galabat field, which consists of longitudinal Asymmetrical narr
... Show MoreNeighShrink 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
A common approach to the color image compression was started by transform
the red, green, and blue or (RGB) color model to a desire color model, then applying
compression techniques, and finally retransform the results into RGB model In this
paper, a new color image compression method based on multilevel block truncation
coding (MBTC) and vector quantization is presented. By exploiting human visual
system response for color, bit allocation process is implemented to distribute the bits
for encoding in more effective away.
To improve the performance efficiency of vector quantization (VQ),
modifications have been implemented. To combines the simple computational and
edge preservation properties of MBTC with high c
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 research including lineament automated extraction by using PCI Geomatica program, depending on satellite image and lineament analysis by using GIS program. Analysis included density analysis, length density analysis and intersection density analysis. When calculate the slope map for the study area, found the relationship between the slope and lineament density.
The lineament density increases in the regions that have high values for the slope, show that lineament play an important role in the classification process as it isolates the class for the other were observed in Iranian territory, clearly, also show that one of the lineament hit shoulders of Galal Badra dam and the surrounding areas dam. So should take into consideration
In this research, an adaptive Canny algorithm using fast Otsu multithresholding method is presented, in which fast Otsu multithresholding method is used to calculate the optimum maximum and minimum hysteresis values and used as automatic thresholding for the fourth stage of the Canny algorithm. The new adaptive Canny algorithm and the standard Canny algorithm (manual hysteresis value) was tested on standard image (Lena) and satellite image. The results approved the validity and accuracy of the new algorithm to find the images edges for personal and satellite images as pre-step for image segmentation.
A design of a Fabry -Perot interferometer system was constructed
to determine the precise value of the wavelength which is required in spectml studies depending on varying medium pressure where the refractive index was a function of pressure at a constant distance between the two mirrors by using a Hc-Ne laser (632.8) tun as a coherent source .
The (fmee) (t) and the coefficient of finesses (F) and the visbility
of the fringes (V) has been calculated . Image processing \\•as used and its result can be relied on verifying 
... Show MoreBased on the needs of the scientific community, researchers tended to find new iterative schemes or develop previous iterative schemes that would help researchers reach the fixed point with fewer steps and with stability, will be define in this paper the multi_implicit four-step iterative (MIFSI) which is development to four-step implicit fixed point iterative, to develop the aforementioned iterative scheme, we will use a finite set of projective functions ,nonexpansive function and finite set from a new functions called generalized quasi like contractive which is an amalgamation of quasi contractive function and contractive like function , by the last function and a set of sequential organized steps, we will be able to prove the existen
... Show More