Physical Sciences and Mathematics Commons^™

The Fast Fourier Transform, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

This tutorial discusses the fast Fourier transform, which has numerous applications in signal and image processing. The FFT computes the frequency components of a signal that has been sampled at n points in O( n log n) time. We explain the FFT and illustrate it by examples and Pascal algorithms. We assume that you are familiar with elementary calculus.

On Some Problems In Analysis Of Covariance Structure., Sadhan Samar Maiti Dr.

Doctoral Theses

In recent years, the teahniques of struotural analynie of covarianoe and correlation matrioes have frequently be en employed espeed ally in the s ooial and behavioural soieno es for analysing multivariate data. Analysis of covarlance structures (ACOVS) lea; generie tem describing a variety of statistioal procedures for testing and measuring the goodnese-of-fit of certain types of struotures postulated a priori for the cova- riance matrix by plaoing al temative restriotione on the para- neter natrioes of the general model" [Mukherjee, 1976, p. 132].The aoronyn AOOVS' standa for; analyeis of covarianoe atructurea; and waa firat proposed by Book (1960) as a …

Indifference Graphs And The Single Row Routing Problem, Peter J. Looges

Computer Science Theses & Dissertations

This thesis investigates the subclass of interval graphs known as indifference graphs. New optimal algorithms for recognition, center, diameter, maximum matching, Hamiltonian path and domination in indifference graphs are presented. The recognition algorithm produces a linear order with properties which allow the solution of the other problems in linear time. Indifference graphs are further applied to the single row routing problem which results in both sequential,. and parallel routing algorithms.

Using Genetic Algorithms To Solve Combinatorial Optimization Problems, Xinwei Cui

FIU Electronic Theses and Dissertations

Genetic algorithms are stochastic search techniques based on the mechanics of natural selection and natural genetics. Genetic algorithms differ from traditional analytical methods by using genetic operators and historic cumulative information to prune the search space and generate plausible solutions. Recent research has shown that genetic algorithms have a large range and growing number of applications.

The research presented in this thesis is that of using genetic algorithms to solve some typical combinatorial optimization problems, namely the Clique, Vertex Cover and Max Cut problems. All of these are NP-Complete problems. The empirical results show that genetic algorithms can provide efficient …

On Image Information Measures And Object Extraction., Nikhil Ranjan Pal Dr.

Doctoral Theses

The field of image processing deals with the manipulation of data which are inherently two-dimensional in nature. techniques of image processing sten from two principal application The areas, namely, Improvement of pictorial information for human interpretation and processing of scene data for automatic machine perception. These areas together have experienced a vigorous growth in recent years because they have offered a number of important applications in solving scientific and engineering problems. In biological and medical sciences, we are interested in automatie analysis and interpretation of radiographs, cell images micrographs. In netallurgical, geological and and tissue environmental sciences, we are concerned …

Three--Dimensional Medical Imaging: Algorithms And Computer Systems, M. R. Stytz, G. Frieder, O. Frieder

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

This paper presents an introduction to the field of three-dimensional medical imaging It presents medical imaging terms and concepts, summarizes the basic operations performed in three-dimensional medical imaging, and describes sample algorithms for accomplishing these operations. The paper contains a synopsis of the architectures and algorithms used in eight machines to render three-dimensional medical images, with particular emphasis paid to their distinctive contributions. It compares the performance of the machines along several dimensions, including image resolution, elapsed time to form an image, imaging algorithms used in the machine, and the degree of parallelism used in the architecture. The paper concludes …