-The existence of numerous imaging modalities makes it possible to present different data present in different modalities together thus forming multimodal images. Component images forming multimodal images should be aligned, or registered so that all the data, coming from the different modalities, are displayed in proper locations. Mutual Information is the similarity measure used in this case for optimizing the two images. This method requires estimating joint histogram of the two images. The fusion of images is the process of combining two or more images into a single image retaining important features from each. The Discrete Wavelet Transform (DWT) has become an attractive tool for fusing multimodal images. In this work it has been used to segment the features of the input images to produce a region map. Features of each region are calculated and a region based approach is used to fuse the images in the wavelet Domain.
Spread-spectrum techniques are methods by which electromagnetic energy generated in a particular bandwidth is deliberately spread in the frequency Domain, resulting in a signal with a wider bandwidth. These techniques are used for a variety of reasons, including the establishment of secure communications, increasing resistance to natural interference and jamming, and to prevent detec
SKIN INSTALLATION
Blue Skin Analyzer in Php-MYSQL
1. Upload folder from zip on your server into the folder "style" of
ActualAnalyzer.
2. Point your browser to your Domain to file "admin.php" and select skin
in section "Settings".
SKIN INSTALLATION
Grey Skin Analyzer--PHP-MYSQL
1. Upload folder from zip on your server into the folder "style" of
ActualAnalyzer.
2. Point your browser to your Domain to file "admin.php" and select skin
in section "Settings".
*** HyperString v6.0 ***
(c)1996-2000 EFD Systems, All rights reserved
efd@mindspring.com
*** THIS IS NOT PUBLIC Domain SOFTWARE ***
See below for license agreement, disclaimer, installation and use.
Introduction ---------------------------------------------------------
Welcome to HyperString!
One of the most significant new features with Delphi32 is long dynamic
strings. However, the built-in functions don t really exploit the full
potential of these new strings. HyperString provides over 400 fast,
efficient string management routines to help you realize the full power
of this highly versatile new data type.
In number theory, the Euclidean algorithm (also called Euclid s algorithm) is an algorithm to determine the greatest common divisor (GCD) of two elements of any Euclidean Domain (for example, the integers). Its major significance is that it does not require factoring the two integers, and it is also significant in that it is one of the oldest algorithms known, dating back to the ancient Greeks.
This software is developed to provide ease with controller design. For PID control, options are given
to design and analyse the compensated and uncompensated system. You are free to choice among Proportional
PI, PD and PID mode of control. Both frequency and time Domain characteristics can be observed. Special
Menus are given to observe time and frequency response plots. For Statefeedback controller similar options
are given. But this is limited to second order system only.
SQLite is a software library that implements a self-contained, serverless, zero-configuration, transactional SQL database engine.
SQLite is the most widely deployed SQL database engine in the world. It is used in countless desktop computer applications as well as consumer electronic devices including cellphones, PDAs, and MP3 players. The source code for SQLite is in the public Domain.
matlab有限元網(wǎng)格劃分程序
DistMesh is a simple MATLAB code for generation of unstructured triangular and tetrahedral meshes. It was developed by Per-Olof Persson (now at UC Berkeley) and Gilbert Strang in the Department of Mathematics at MIT. A detailed description of the program is provided in our SIAM Review paper, see documentation below.
One reason that the code is short and simple is that the geometries are specified by Signed Distance Functions. These give the shortest distance from any point in space to the boundary of the Domain. The sign is negative inside the region and positive outside. A simple example is the unit circle in 2-D, which has the distance function d=r-1, where r is the distance from the origin. For more complicated geometries the distance function can be computed by interpolation between values on a grid, a common representation for level set methods.
For the actual mesh generation, DistMesh uses the Delaunay triangulation routine in MATLAB and tries to optimize the node locations by a force-based smoothing procedure. The topology is regularly updated by Delaunay. The boundary points are only allowed to move tangentially to the boundary by projections using the distance function. This iterative procedure typically results in very well-shaped meshes.
Our aim with this code is simplicity, so that everyone can understand the code and modify it according to their needs. The code is not entirely robust (that is, it might not terminate and return a well-shaped mesh), and it is relatively slow. However, our current research shows that these issues can be resolved in an optimized C++ code, and we believe our simple MATLAB code is important for demonstration of the underlying principles.
To use the code, simply download it from below and run it from MATLAB. For a quick demonstration, type "meshdemo2d" or "meshdemond". For more details see the documentation.
The 4.0 kbit/s speech codec described in this paper is based on a
Frequency Domain Interpolative (FDI) coding technique, which
belongs to the class of prototype waveform Interpolation (PWI)
coding techniques. The codec also has an integrated voice
activity detector (VAD) and a noise reduction capability. The
input signal is subjected to LPC analysis and the prediction
residual is separated into a slowly evolving waveform (SEW) and
a rapidly evolving waveform (REW) components. The SEW
magnitude component is quantized using a hierarchical
predictive vector quantization approach. The REW magnitude is
quantized using a gain and a sub-band based shape. SEW and
REW phases are derived at the decoder using a phase model,
based on a transmitted measure of voice periodicity. The spectral
(LSP) parameters are quantized using a combination of scalar
and vector quantizers. The 4.0 kbits/s coder has an algorithmic
delay of 60 ms and an estimated floating point complexity of
21.5 MIPS. The performance of this coder has been evaluated
using in-house MOS tests under various conditions such as
background noise. channel errors, self-tandem. and DTX mode
of operation, and has been shown to be statistically equivalent to
ITU-T (3.729 8 kbps codec across all conditions tested.
