In this work, we are obviously interested in a general solution for the calculation of the image of a single bar in partially coherent illumination. The solution is based on the theory of Hopkins for the formation of images in optical instruments in which it was shown that for all practical cases, the illumination of the object may be considered as due to a self – luminous source placed at the exit pupil of the condenser , and the diffraction integral describing the intensity distribution in the image of a single bar – as an object with half – width (U0 = 8 ) and circular aperture geometry is viewed , which by suitable choice of the coherence parameters (S=0.25,1.0.4.0) can be fitted to the observed distribution in various types of microscope , the aberration were restricted to defocusing and coma upto third – order , the method of integration was Gauss quadrature: The necessary set of integration depends , of course , on the amount of present aberrations and had to be chosen (20) points of Gauss which decrease the computation time to few seconds: The aberration free systems corresponding to the paraxial receiving plane (W20= 0.0) is especially interesting as it predicts diffraction pattern shape. The influence of defocusing is very pronounced and relatively distorts the object , the influence of the off – axis aberration (third – order coma ), in which it was shown that for the high peaks in the images are most noticeable in the region of almost perfect coherence (S=0.25). As (S) is increased from (0.25) to (1.0) there is a pronounced redistribution of intensity, with peaks moving from one side of the image to the other. Calculations were also performed for systems having spherical aberration, but the results are qualitatively similar to an aberration – free defocused system and are omitted, so we will not present any numerical results. A computer program was written in FORTRAN 77 which solved the modified intensity distribution of Hopkins for(U´) dimensionless distance. The advantage of that additional work on this class of problems to investigate the development of more efficient numerical methods, also the reduction in computation time to few seconds for data runs for individual curves of intensity.
Identifying the total number of fruits on trees has long been of interest in agricultural crop estimation work. Yield prediction of fruits in practical environment is one of the hard and significant tasks to obtain better results in crop management system to achieve more productivity with regard to moderate cost. Utilized color vision in machine vision system to identify citrus fruits, and estimated yield information of the citrus grove in-real time. Fruit recognition algorithms based on color features to estimate the number of fruit. In the current research work, some low complexity and efficient image analysis approach was proposed to count yield fruits image in the natural scene. Semi automatic segmentation and yield calculation of fruit
... Show MoreAn image retrieval system is a computer system for browsing, looking and recovering pictures from a huge database of advanced pictures. The objective of Content-Based Image Retrieval (CBIR) methods is essentially to extract, from large (image) databases, a specified number of images similar in visual and semantic content to a so-called query image. The researchers were developing a new mechanism to retrieval systems which is mainly based on two procedures. The first procedure relies on extract the statistical feature of both original, traditional image by using the histogram and statistical characteristics (mean, standard deviation). The second procedure relies on the T-
... Show MoreIn this paper three techniques for image compression are implemented. The proposed techniques consist of three dimension (3-D) two level discrete wavelet transform (DWT), 3-D two level discrete multi-wavelet transform (DMWT) and 3-D two level hybrid (wavelet-multiwavelet transform) technique. Daubechies and Haar are used in discrete wavelet transform and Critically Sampled preprocessing is used in discrete multi-wavelet transform. The aim is to maintain to increase the compression ratio (CR) with respect to increase the level of the transformation in case of 3-D transformation, so, the compression ratio is measured for each level. To get a good compression, the image data properties, were measured, such as, image entropy (He), percent root-
... Show MoreIn the reverse engineering approach, a massive amount of point data is gathered together during data acquisition and this leads to larger file sizes and longer information data handling time. In addition, fitting of surfaces of these data point is time-consuming and demands particular skills. In the present work a method for getting the control points of any profile has been presented. Where, many process for an image modification was explained using Solid Work program, and a parametric equation of the profile that proposed has been derived using Bezier technique with the control points that adopted. Finally, the proposed profile was machined using 3-aixs CNC milling machine and a compression in dimensions process has been occurred betwe
... Show MoreDue to the vast using of digital images and the fast evolution in computer science and especially the using of images in the social network.This lead to focus on securing these images and protect it against attackers, many techniques are proposed to achieve this goal. In this paper we proposed a new chaotic method to enhance AES (Advanced Encryption Standards) by eliminating Mix-Columns transformation to reduce time consuming and using palmprint biometric and Lorenz chaotic system to enhance authentication and security of the image, by using chaotic system that adds more sensitivity to the encryption system and authentication for the system.
This paper presents the matrix completion problem for image denoising. Three problems based on matrix norm are performing: Spectral norm minimization problem (SNP), Nuclear norm minimization problem (NNP), and Weighted nuclear norm minimization problem (WNNP). In general, images representing by a matrix this matrix contains the information of the image, some information is irrelevant or unfavorable, so to overcome this unwanted information in the image matrix, information completion is used to comperes the matrix and remove this unwanted information. The unwanted information is handled by defining {0,1}-operator under some threshold. Applying this operator on a given ma
... Show More