Edge detection and noise removal by use of a partial differential equation with automatic selection of parameters

This work deals with noise removal by the use of an edge preserving method whose parameters are automatically estimated, for any application, by simply providing information about the standard deviation noise level we wish to eliminate. The desired noiseless image u(x), in a Partial Differential Equation based model, can be viewed as the solution of an evolutionary differential equation u t(x) = F(u xx, u x, u, x, t) which means that the true solution will be reached when t ® ¥. In practical applications we should stop the time ''t'' at some moment during this evolutionary process. This work presents a sufficient condition, related to time t and to the standard deviation s of the noise we desire to remove, which gives a constant T such that u(x, T) is a good approximation of u(x). The approach here focused on edge preservation during the noise elimination process as its main characteristic. The balance between edge points and interior points is carried out by a function g which depends on the initial noisy image u(x, t0), the standard deviation of the noise we want to eliminate and a constant k. The k parameter estimation is also presented in this work therefore making, the proposed model automatic. The model's feasibility and the choice of the optimal time scale is evident through out the various experimental results.

INEQUALITIES FOR ZEROS of JACOBI POLYNOMIALS VIA OBRECHKOFF'S THEOREM

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Finiteness theorem for topological contact equivalence of map germs

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Automatic estimation of crowd density using texture

This paper considers the role of automatic estimation of crowd density and its importance for the automatic monitoring of areas where crowds are expected to be present. A new technique is proposed which is able to estimate densities ranging from very low to very high concentration of people, which is a difficult problem because in a crowd only parts of people's body appear. The new technique is based on the differences of texture patterns of the images of crowds. Images of low density crowds tend to present coarse textures, while images of dense crowds tend to present fine textures. The image pixels are classified in different texture classes and statistics of such classes are used to estimate the number of people. The texture classification and the estimation of people density are carried out by means of self organising neural networks. Results obtained respectively to the estimation of the number of people in a specific area of Liverpool Street Railway Station in London (UK) are presented. (C) 1998 Elsevier B.V. Ltd. All rights reserved.

Automatic Classification of Three-Phase Flow Patterns of Heavy Oil in a Horizontal Pipe Using Support Vector Machines

The pipe flow of a viscous-oil-gas-water mixture such as that involved in heavy oil production is a rather complex thereto-fluid dynamical problem. Considering the complexity of three-phase flow, it is of fundamental importance the introduction of a flow pattern classification tool to obtain useful information about the flow structure. Flow patterns are important because they indicate the degree of mixing during flow and the spatial distribution of phases. In particular, the pressure drop and temperature evolution along the pipe is highly dependent on the spatial configuration of the phases. In this work we investigate the three-phase water-assisted flow patterns, i.e. those configurations where water is injected in order to reduce friction caused by the viscous oil. Phase flow rates and pressure drop data from previous laboratory experiments in a horizontal pipe are used for flow pattern identification by means of the 'support vector machine' technique (SVM).

Automatic identification of terpenoid skeletons by feed-forward neural networks

Feed-forward neural networks (FFNNs) were used to predict the skeletal type of molecules belonging to six classes of terpenoids. A database that contains the (13)C NMR spectra of about 5000 compounds was used to train the FFNNs. An efficient representation of the spectra was designed and the constitution of the best FFNN input vector format resorted from an heuristic approach. The latter was derived from general considerations on terpenoid structures. (c) 2006 Elsevier B.V. All rights reserved.

Blumenthal's theorem for Laurent orthogonal polynomials

We investigate polynomials satisfying a three-term recurrence relation of the form B-n(x) = (x - beta(n))beta(n-1)(x) - alpha(n)xB(n-2)(x), with positive recurrence coefficients alpha(n+1),beta(n) (n = 1, 2,...). We show that the zeros are eigenvalues of a structured Hessenberg matrix and give the left and right eigenvectors of this matrix, from which we deduce Laurent orthogonality and the Gaussian quadrature formula. We analyse in more detail the case where alpha(n) --> alpha and beta(n) --> beta and show that the zeros of beta(n) are dense on an interval and that the support of the Laurent orthogonality measure is equal to this interval and a set which is at most denumerable with accumulation points (if any) at the endpoints of the interval. This result is the Laurent version of Blumenthal's theorem for orthogonal polynomials. (C) 2002 Elsevier B.V. (USA).

Automatic identification by C-13 NMR of substituent groups bonded in natural product skeletons

The aim of this paper is to present a procedure that utilizes C-13 NMR for identification of substituent groups which are bonded to carbon skeletons of natural products. For so much was developed a new version of the program (MACRONO), that presents a database with 161 substituent types found in the most varied terpenoids. This new version was widely tested in the identification of the substituents of 60 compounds that, after removal of the signals that did not belong to the carbon skeleton, served to test the prediction of skeletons by using other programs of the expert system (SISTEMAT). (C) 2002 Elsevier B.V. Ltd. All rights reserved.

Automatic absolute orientation of scanned aerial photographs

Image orientation is a basic problem in Digital Photogrammetry. While interior and relative orientations were succesfully automated, the same can not be said about absolute orientation. This process can be automated by using an approach based on relational matching and a heuristic that uses the analytical relation between straight features in the object space and its homologous in the image space. A build-in self-diagnosis is also used in this method, that is based on the implementation of data snooping statistic test in the process of spatial resection, using the Iterated Extended Kalman Filtering (IEKF). The aim of this paper is to present the basic principles of the proposed approach and results based on real data.

A homological version of the implicit function theorem

Our objective in this paper is to prove an Implicit Function Theorem for general topological spaces. As a consequence, we show that, under certain conditions, the set of the invertible elements of a topological monoid X is an open topological group in X and we use the classical topological group theory to conclude that this set is a Lie group.

The Noether theorem for geometric actions and area preserving diffeomorphisms on the torus

We find that within the formalism of coadjoint orbits of the infinite dimensional Lie group the Noether procedure leads, for a special class of transformations, to the constant of motion given by the fundamental group one-cocycle S. Use is made of the simplified formula giving the symplectic action in terms of S and the Maurer-Cartan one-form. The area preserving diffeomorphisms on the torus T2=S1⊗S1 constitute an algebra with central extension, given by the Floratos-Iliopoulos cocycle. We apply our general treatment based on the symplectic analysis of coadjoint orbits of Lie groups to write the symplectic action for this model and study its invariance. We find an interesting abelian symmetry structure of this non-linear problem.

Asymmetry of the Aharonov-Bohm diffraction pattern and Ehrenfests theorem

The electron-diffraction pattern for two slits with magnetic flux confined to an inaccessible region between them is calculated. The Aharonov-Bohm effect gives a diffraction pattern that is asymmetric but has a symmetric envelope. In general, both the expected displacement and the kinetic momentum of the electron are nonzero as a consequence of the asymmetry. Nevertheless, Ehrenfests theorems and the conservation of momentum are satisfied. © 1992 The American Physical Society.

A refinement of the gauss-lucas theorem

The classical Gauss-Lucas Theorem states that all the critical points (zeros of the derivative) of a nonconstant polynomial p lie in the convex hull H of the zeros of p. It is proved that, actually, a subdomain of H contains the critical points of p. ©1998 American Mathematical Society.

Three-dimensional reconstruction of fracture surfaces: Area matching algorithms for automatic parallax measurements

This paper describes two solutions for systematic measurement of surface elevation that can be used for both profile and surface reconstructions for quantitative fractography case studies. The first one is developed under Khoros graphical interface environment. It consists of an adaption of the almost classical area matching algorithm, that is based on cross-correlation operations, to the well-known method of parallax measurements from stereo pairs. A normalization function was created to avoid false cross-correlation peaks, driving to the true window best matching solution at each region analyzed on both stereo projections. Some limitations to the use of scanning electron microscopy and the types of surface patterns are also discussed. The second algorithm is based on a spatial correlation function. This solution is implemented under the NIH Image macro programming, combining a good representation for low contrast regions and many improvements on overall user interface and performance. Its advantages and limitations are also presented.

Invex nonsmooth alternative theorem and applications

An invex constrained nonsmooth optimization problem is considered, in which the presence of an abstract constraint set is possibly allowed. Necessary and sufficient conditions of optimality are provided and weak and strong duality results established. Following Geoffrion's approach an invex nonsmooth alternative theorem of Gordan type is then derived. Subsequently, some applications on multiobjective programming are then pursued. © 2000 OPA (Overseas Publishers Association) N.V. Published by license under the Gordon and Breach Science Publishers imprint.