Pan sharpening (fusion image) is the procedure of merging suitable information from two or more images into a single image. The image fusion techniques allow the combination of different information sources to improve the quality of image and increase its utility for a particular application. In this research, six pan-sharpening method have been implemented between the panchromatic and multispectral images, these methods include Ehlers, color normalize, Gram-Schmidt, local mean and variance matching, Daubechies of rank two and Symlets of rank four wavelet transform. Two images captured by two different sensors such as landsat-8 and world view-2 have been adopted to achieve the fusion purpose. Different fidelity metric like MSE, RMSE, PSNR, Cc, ERGAS and RASE have been used to achieve the comparison among the fusion methods. The results show that Daubechies wavelet (db2) transform was good method for pan sharpening images. Where good statistical values have been obtained, when it is applied on the first and second image that are captured by different sensors with different spatial resolution
Sewer sediment deposition is an important aspect as it relates to several operational and environmental problems. It concerns municipalities as it affects the sewer system and contributes to sewer failure which has a catastrophic effect if happened in trunks or interceptors. Sewer rehabilitation is a costly process and complex in terms of choosing the method of rehabilitation and individual sewers to be rehabilitated. For such a complex process, inspection techniques assist in the decision-making process; though, it may add to the total expenditure of the project as it requires special tools and trained personnel. For developing countries, Inspection could prohibit the rehabilitation proceeds. In this study, the researchers propos
... Show MoreImage Fusion Using A Convolutional Neural Network
In this paper, visible image watermarking algorithm based on biorthogonal wavelet
transform is proposed. The watermark (logo) of type binary image can be embedded in the
host gray image by using coefficients bands of the transformed host image by biorthogonal
transform domain. The logo image can be embedded in the top-left corner or spread over the
whole host image. A scaling value (α) in the frequency domain is introduced to control the
perception of the watermarked image. Experimental results show that this watermark
algorithm gives visible logo with and no losses in the recovery process of the original image,
the calculated PSNR values support that. Good robustness against attempt to remove the
watermark was s
Background: The skull offers a high resistance of adverse environmental conditions over time, resulting in the greater stability of the dimorphic features as compared to other skeletal bony pieces. Sex determination of human skeletal considered an initial step in its identification. The present study is undertaken to evaluate the validity of 3D reconstructed computed tomographic images in sex differentiation by using craniometrical measurements at various parts of the skull. Materials and Method: 3D reconstructed computed tomographic scanning of 100 Iraqi subject, (50 males and 50 females) were analyzed with their age range from20-70 years old. Craniometrical linear measurements were located and marked on both side of the 3D skull images.
... Show MoreComputer software is frequently used for medical decision support systems in different areas. Magnetic Resonance Images (MRI) are widely used images for brain classification issue. This paper presents an improved method for brain classification of MRI images. The proposed method contains three phases, which are, feature extraction, dimensionality reduction, and an improved classification technique. In the first phase, the features of MRI images are obtained by discrete wavelet transform (DWT). In the second phase, the features of MRI images have been reduced, using principal component analysis (PCA). In the last (third) stage, an improved classifier is developed. In the proposed classifier, Dragonfly algorithm is used instead
... Show MoreTransformations of the actor when acting many characters are the product of joint work between the actor and the director through the instructions and the exercises that facilitate the reach for the desired goal.
The method or way has often been used which is Stanislavsky premises in his work with the actor in the role. The first section consists of two parts under the heading of the actor's work with himself. The two parts are preparing the actor in creative suffering (internal), and in coexistence and embodiment (outside). The second section is the book of the actor's work with the role. The current research aims at identifying the mechanism of the acting performance transformations among many characters of the same actor.
... Show MoreEnhancing quality image fusion was proposed using new algorithms in auto-focus image fusion. The first algorithm is based on determining the standard deviation to combine two images. The second algorithm concentrates on the contrast at edge points and correlation method as the criteria parameter for the resulted image quality. This algorithm considers three blocks with different sizes at the homogenous region and moves it 10 pixels within the same homogenous region. These blocks examine the statistical properties of the block and decide automatically the next step. The resulted combined image is better in the contras
... Show MoreTwo unsupervised classifiers for optimum multithreshold are presented; fast Otsu and k-means. The unparametric methods produce an efficient procedure to separate the regions (classes) by select optimum levels, either on the gray levels of image histogram (as Otsu classifier), or on the gray levels of image intensities(as k-mean classifier), which are represent threshold values of the classes. In order to compare between the experimental results of these classifiers, the computation time is recorded and the needed iterations for k-means classifier to converge with optimum classes centers. The variation in the recorded computation time for k-means classifier is discussed.