This search has introduced the techniques of multi-wavelet transform and neural network for recognition 3-D object from 2-D image using patches. The proposed techniques were tested on database of different patches features and the high energy subband of discrete multi-wavelet transform DMWT (gp) of the patches. The test set has two groups, group (1) which contains images, their (gp) patches and patches features of the same images as a part of that in the data set beside other images, (gp) patches and features, and group (2) which contains the (gp) patches and patches features the same as a part of that in the database but after modification such as rotation, scaling and translation. Recognition by back propagation (BP) neural network as

 Uncompressed form of the digital images are needed a very large storage capacity amount, as a consequence requires large communication bandwidth for data transmission over the network. Image compression techniques not only minimize the image storage space but also preserve the quality of image. This paper reveal image compression technique which uses distinct image coding scheme based on wavelet transform that combined effective types of compression algorithms for further compression. EZW and SPIHT algorithms are types of significant compression techniques that obtainable for lossy image compression algorithms. The EZW coding is a worthwhile and simple efficient algorithm. SPIHT is an most powerful technique that utilize for image

Embedding an identifying data into digital media such as video, audio or image is known as digital watermarking. In this paper, a non-blind watermarking algorithm based on Berkeley Wavelet Transform is proposed. Firstly, the embedded image is scrambled by using Arnold transform for higher security, and then the embedding process is applied in transform domain of the host image. The experimental results show that this algorithm is invisible and has good robustness for some common image processing operations.

I n  this  paper ,we 'viii  consider  the density  questions  associC;lted with  the single  hidden layer feed forward  model. We proved  that a FFNN   with   one   hidden   layer  can   uniformly   approximate   any continuous  function  in C(k)(where k is a compact set in R11 ) to any required accuracy.

However, if the set of basis function is dense then the ANN's can has al most one hidden layer. But if the set of basis function  non-dense, then we  need more  hidden layers. Also, we have shown  that there exist  localized functions and that there is no t

Background: The demand for better esthetic during orthodontic treatment has increased nowadays, so orthodontists starting using esthetic arch wires, brackets and ligatures.Tooth colored brackets were introduced in different types of materials. Sapphire ceramic brackets are one type of esthetic brackets and their color stability remains the main concern for the clinicians and patients at the same time. The present study design to evaluate the effect of three different staining materials (pepsi, black tea and cigarette smoke) on the stainability of sapphire ceramic brackets bonded with three types of light cure orthodontic adhesives which include: Resilience, Enlight and Transbond. Materials and Methods: The sample consisted of three hundre

We have studied Bayesian method in this paper by using the modified exponential growth model, where this model is more using to represent the growth phenomena. We focus on three of prior functions (Informative, Natural Conjugate, and the function that depends on previous experiments) to use it in the Bayesian method. Where almost of observations for the growth phenomena are depended on one another, which in turn leads to a correlation between those observations, which calls to treat such this problem, called Autocorrelation, and to verified this has been used Bayesian method.

The goal of this study is to knowledge the effect of Autocorrelation on the estimation by using Bayesian method. F

     Evolutionary algorithms (EAs), as global search methods, are proved to be more robust than their counterpart local heuristics for detecting protein complexes in protein-protein interaction (PPI) networks. Typically, the source of robustness of these EAs comes from their components and parameters. These components are solution representation, selection, crossover, and mutation. Unfortunately, almost all EA based complex detection methods suggested in the literature were designed with only canonical or traditional components. Further, topological structure of the protein network is the main information that is used in the design of almost all such components. The main contribution of this paper is to formulate a more robust E