MULTI-OBJECTIVE GENETIC ALGORITHM FOR EFFICIENT POINT MATCHING IN MULTI-SENSOR SATELLITE IMAGE

This paper investigates a new approach for point matching in multi-sensor satellite images. The feature points are matched using multi-objective optimization (angle criterion and distance condition) based on Genetic Algorithm (GA). This optimization process is more efficient as it considers both the angle criterion and distance condition to incorporate multi-objective switching in the fitness function. This optimization process helps in matching three corresponding corner points detected in the reference and sensed image and thereby using the affine transformation, the sensed image is aligned with the reference image. From the results obtained, the performance of the image registration is evaluated and it is concluded that the proposed approach is efficient.

Hybrid aggregated-vector algorithm for efficient parallelization of fast multipole method

An efficient parallelization algorithm for the Fast Multipole Method which aims to alleviate the parallelization bottleneck arising from lower job-count closer to root levels is presented. An electrostatic problem of 12 million non-uniformly distributed mesh elements is solved with 80-85% parallel efficiency in matrix setup and matrix-vector product using 60GB and 16 threads on shared memory architecture.

Efficient density matrix renormalization group algorithm to study Y junctions with integer and half-integer spin

An efficient density matrix renormalization group (DMRG) algorithm is presented and applied to Y junctions, systems with three arms of n sites that meet at a central site. The accuracy is comparable to DMRG of chains. As in chains, new sites are always bonded to the most recently added sites and the superblock Hamiltonian contains only new or once renormalized operators. Junctions of up to N = 3n + 1 approximate to 500 sites are studied with antiferromagnetic (AF) Heisenberg exchange J between nearest-neighbor spins S or electron transfer t between nearest neighbors in half-filled Hubbard models. Exchange or electron transfer is exclusively between sites in two sublattices with N-A not equal N-B. The ground state (GS) and spin densities rho(r) = < S-r(z)> at site r are quite different for junctions with S = 1/2, 1, 3/2, and 2. The GS has finite total spin S-G = 2S(S) for even (odd) N and for M-G = S-G in the S-G spin manifold, rho(r) > 0(< 0) at sites of the larger (smaller) sublattice. S = 1/2 junctions have delocalized states and decreasing spin densities with increasing N. S = 1 junctions have four localized S-z = 1/2 states at the end of each arm and centered on the junction, consistent with localized states in S = 1 chains with finite Haldane gap. The GS of S = 3/2 or 2 junctions of up to 500 spins is a spin density wave with increased amplitude at the ends of arms or near the junction. Quantum fluctuations completely suppress AF order in S = 1/2 or 1 junctions, as well as in half-filled Hubbard junctions, but reduce rather than suppress AF order in S = 3/2 or 2 junctions.

Efficient two-step digit-set-restricted modified signed-digit algorithm based on optoelectronic shared content-addressable memory

A two-step digit-set-restricted modified signed-digit (MSD) adder based on symbolic substitution is presented. In the proposed addition algorithm, carry propagation is avoided by using reference digits to restrict the intermediate MSD carry and sum digits into {(1) over bar ,0} and {0, 1}, respectively. The algorithm requires only 12 minterms to generate the final results, and no complementarity operations for nonzero outputs are involved, which simplifies the system complexity significantly. An optoelectronic shared content-addressable memory based on an incoherent correlator is used for experimental demonstration. (c) 2005 Society of Photo-Optical Instrumentation Engineers.

Efficient two-step digit-set-restricted modified signed-digit algorithm based on optoelectronic shared content-addressable memory

A two-step digit-set-restricted modified signed-digit (MSD) adder based on symbolic substitution is presented. In the proposed addition algorithm, carry propagation is avoided by using reference digits to restrict the intermediate MSD carry and sum digits into {(1) over bar ,0} and {0, 1}, respectively. The algorithm requires only 12 minterms to generate the final results, and no complementarity operations for nonzero outputs are involved, which simplifies the system complexity significantly. An optoelectronic shared content-addressable memory based on an incoherent correlator is used for experimental demonstration. (c) 2005 Society of Photo-Optical Instrumentation Engineers.

Efficient block segmentation algorithm for true motion estimation

A block-based motion estimation technique is proposed which permits a less general segmentation performed using an efficient deterministic algorithm. Applied to image pairs from the Flower Garden and Table Tennis sequences, the algorithm successfully localizes motion discontinuities and detects uncovered regions. The algorithm is implemented in C on a Sun Sparcstation 20. The gradient-based motion estimation required 28.8 s CPU time, and 500 iterations of the segmentation algorithm required 32.6 s.

An efficient frequency-domain algorithm for wave scattering problems with application to jet noise

This paper presents a pseudo-time-step method to calculate a (vector) Green function for the adjoint linearised Euler equations as a scattering problem in the frequency domain, for use as a jet-noise propagation prediction tool. A method of selecting the acoustics-related solution in a truncated spatial domain while suppressing any possible shear-layer-type instability is presented. Numerical tests for 3-D axisymmetrical parallel mean flows against semi-analytical reference solutions indicate that the new iterative algorithm is capable of producing accurate solutions with modest computational requirements.

An efficient and robust pitch marking algorithm on the speech waveform for TD-PSOLA

In a Text-to-Speech system based on time-domain techniques that employ pitch-synchronous manipulation of the speech waveforms, one of the most important issues that affect the output quality is the way the analysis points of the speech signal are estimated and the actual points, i.e. the analysis pitchmarks. In this paper we present our methodology for calculating the pitchmarks of a speech waveform, a pitchmark detection algorithm, which after thorough experimentation and in comparison with other algorithms, proves to behave better with our TD-PSOLA-based Text-to-Speech synthesizer (Time- Domain Pitch-Synchronous Overlap Add Text to Speech System).

An Efficient Correspondence Based Algorithm for 2D and 3D Model Based Recognition

A polynomial time algorithm (pruned correspondence search, PCS) with good average case performance for solving a wide class of geometric maximal matching problems, including the problem of recognizing 3D objects from a single 2D image, is presented. Efficient verification algorithms, based on a linear representation of location constraints, are given for the case of affine transformations among vector spaces and for the case of rigid 2D and 3D transformations with scale. Some preliminary experiments suggest that PCS is a practical algorithm. Its similarity to existing correspondence based algorithms means that a number of existing techniques for speedup can be incorporated into PCS to improve its performance.