Abstract: This paper describes a novel and effective approach to content-based image retrieval (CBIR) that represents each image in the database by a vector of feature values called “Standard deviation of mean vectors of color distribution of rows and columns of images for CBIR". In many areas of commerce, government, academia, and hospitals, large collections of digital images are being created. This paper describes the approach that uses contents as feature vector for retrieval of similar images. There are several classes of features that are used to specify queries: colour, texture, shape, spatial layout. Colour features are often easily obtained directly from the pixel intensities. In this paper feature extraction is done for the texture descriptor that is 'variance' and 'Variance of Variances'. First standard deviation of each row and column mean is calculated for R, G, and B planes. These six values are obtained for one image which acts as a feature vector. Secondly we calculate variance of the row and column of R, G and B planes of an image. Then six standard deviations of these variance sequences are calculated to form a feature vector of dimension six. We applied our approach to a database of 300 BMP images. We have determined the capability of automatic indexing by analyzing image content: color and texture as features and by applying a similarity measure Euclidean distance.
Abstract: This paper proposes evaluation of sound parameterization methods in recognizing some spoken Arabic words, namely digits from zero to nine. Each isolated spoken word is represented by a single template based on a specific recognition feature, and the recognition is based on the Euclidean distance from those templates. The performance analysis of recognition is based on four parameterization features: the Burg Spectrum Analysis, the Walsh Spectrum Analysis, the Thomson Multitaper Spectrum Analysis and the Mel Frequency Cepstral Coefficients (MFCC) features. The main aim of this paper was to compare, analyze, and discuss the outcomes of spoken Arabic digits recognition systems based on the selected recognition features. The results acqired confirm that the use of MFCC features is a very promising method in recognizing Spoken Arabic digits.
Abstract: The Minimal Residual (MR) is modified for adaptive
filtering application. Three forms of MR based algorithm are
presented: i) the low complexity SPCG, ii) MREDSI, and iii)
MREDSII. The low complexity is a reduced complexity version of a
previously proposed SPCG algorithm. Approximations introduced
reduce the algorithm to an LMS type algorithm, but, maintain the
superior convergence of the SPCG algorithm. Both MREDSI and
MREDSII are MR based methods with Euclidean direction of search.
The choice of Euclidean directions is shown via simulation to give
better misadjustment compared to their gradient search counterparts.
Abstract: In this paper we present an approach for 3D face
recognition based on extracting principal components of range
images by utilizing modified PCA methods namely 2DPCA and
bidirectional 2DPCA also known as (2D) 2 PCA.A preprocessing
stage was implemented on the images to smooth them using median
and Gaussian filtering. In the normalization stage we locate the nose
tip to lay it at the center of images then crop each image to a standard
size of 100*100. In the face recognition stage we extract the principal
component of each image using both 2DPCA and (2D) 2 PCA.
Finally, we use Euclidean distance to measure the minimum distance
between a given test image to the training images in the database. We
also compare the result of using both methods. The best result
achieved by experiments on a public face database shows that 83.3
percent is the rate of face recognition for a random facial expression.
Abstract: This manuscript presents, palmprint recognition by
combining different texture extraction approaches with high accuracy.
The Region of Interest (ROI) is decomposed into different frequencytime
sub-bands by wavelet transform up-to two levels and only the
approximate image of two levels is selected, which is known as
Approximate Image ROI (AIROI). This AIROI has information of
principal lines of the palm. The Competitive Index is used as the
features of the palmprint, in which six Gabor filters of different
orientations convolve with the palmprint image to extract the orientation
information from the image. The winner-take-all strategy
is used to select dominant orientation for each pixel, which is
known as Competitive Index. Further, PCA is applied to select highly
uncorrelated Competitive Index features, to reduce the dimensions of
the feature vector, and to project the features on Eigen space. The
similarity of two palmprints is measured by the Euclidean distance
metrics. The algorithm is tested on Hong Kong PolyU palmprint
database. Different AIROI of different wavelet filter families are also
tested with the Competitive Index and PCA. AIROI of db7 wavelet
filter achievs Equal Error Rate (EER) of 0.0152% and Genuine
Acceptance Rate (GAR) of 99.67% on the palm database of Hong
Kong PolyU.
Abstract: These In this work, a regular unit speed curve in six
dimensional Euclidean space, whose Frenet curvatures are constant,
is considered. Thereafter, a method to calculate Frenet apparatus of
this curve is presented.
Abstract: In current common research reports, salient regions
are usually defined as those regions that could present the main
meaningful or semantic contents. However, there are no uniform
saliency metrics that could describe the saliency of implicit image
regions. Most common metrics take those regions as salient regions,
which have many abrupt changes or some unpredictable
characteristics. But, this metric will fail to detect those salient useful
regions with flat textures. In fact, according to human semantic
perceptions, color and texture distinctions are the main characteristics
that could distinct different regions. Thus, we present a novel saliency
metric coupled with color and texture features, and its corresponding
salient region extraction methods. In order to evaluate the
corresponding saliency values of implicit regions in one image, three
main colors and multi-resolution Gabor features are respectively used
for color and texture features. For each region, its saliency value is
actually to evaluate the total sum of its Euclidean distances for other
regions in the color and texture spaces. A special synthesized image
and several practical images with main salient regions are used to
evaluate the performance of the proposed saliency metric and other
several common metrics, i.e., scale saliency, wavelet transform
modulus maxima point density, and important index based metrics.
Experiment results verified that the proposed saliency metric could
achieve more robust performance than those common saliency
metrics.
Abstract: The goal of this project is to design a system to
recognition voice commands. Most of voice recognition systems
contain two main modules as follow “feature extraction" and “feature
matching". In this project, MFCC algorithm is used to simulate
feature extraction module. Using this algorithm, the cepstral
coefficients are calculated on mel frequency scale. VQ (vector
quantization) method will be used for reduction of amount of data to
decrease computation time. In the feature matching stage Euclidean
distance is applied as similarity criterion. Because of high accuracy
of used algorithms, the accuracy of this voice command system is
high. Using these algorithms, by at least 5 times repetition for each
command, in a single training session, and then twice in each testing
session zero error rate in recognition of commands is achieved.
Abstract: A new stochastic algorithm called Probabilistic Global Search Johor (PGSJ) has recently been established for global optimization of nonconvex real valued problems on finite dimensional Euclidean space. In this paper we present convergence guarantee for this algorithm in probabilistic sense without imposing any more condition. Then, we jointly utilize this algorithm along with control
parameterization technique for the solution of constrained optimal control problem. The numerical simulations are also included to illustrate the efficiency and effectiveness of the PGSJ algorithm in the solution of control problems.
Abstract: Developing a stable early warning system (EWS)
model that is capable to give an accurate prediction is a challenging
task. This paper introduces k-nearest neighbour (k-NN) method
which never been applied in predicting currency crisis before with the
aim of increasing the prediction accuracy. The proposed k-NN
performance depends on the choice of a distance that is used where in
our analysis; we take the Euclidean distance and the Manhattan as a
consideration. For the comparison, we employ three other methods
which are logistic regression analysis (logit), back-propagation neural
network (NN) and sequential minimal optimization (SMO). The
analysis using datasets from 8 countries and 13 macro-economic
indicators for each country shows that the proposed k-NN method
with k = 4 and Manhattan distance performs better than the other
methods.
Abstract: In this paper, we present the video quality measure
estimation via a neural network. This latter predicts MOS (mean
opinion score) by providing height parameters extracted from
original and coded videos. The eight parameters that are used are: the
average of DFT differences, the standard deviation of DFT
differences, the average of DCT differences, the standard deviation
of DCT differences, the variance of energy of color, the luminance
Y, the chrominance U and the chrominance V. We chose Euclidean
Distance to make comparison between the calculated and estimated
output.
Abstract: In this paper, we present a system for content-based
retrieval of large database of classified satellite images, based on
user's relevance feedback (RF).Through our proposed system, we
divide each satellite image scene into small subimages, which stored
in the database. The modified radial basis functions neural network
has important role in clustering the subimages of database according
to the Euclidean distance between the query feature vector and the
other subimages feature vectors. The advantage of using RF
technique in such queries is demonstrated by analyzing the database
retrieval results.
Abstract: We study a long-range percolation model in the hierarchical
lattice ΩN of order N where probability of connection between
two nodes separated by distance k is of the form min{αβ−k, 1},
α ≥ 0 and β > 0. The parameter α is the percolation parameter,
while β describes the long-range nature of the model. The ΩN is
an example of so called ultrametric space, which has remarkable
qualitative difference between Euclidean-type lattices. In this paper,
we characterize the sizes of large clusters for this model along the
line of some prior work. The proof involves a stationary embedding
of ΩN into Z. The phase diagram of this long-range percolation is
well understood.
Abstract: Face Recognition is a field of multidimensional
applications. A lot of work has been done, extensively on the most of
details related to face recognition. This idea of face recognition using
PCA is one of them. In this paper the PCA features for Feature
extraction are used and matching is done for the face under
consideration with the test image using Eigen face coefficients. The
crux of the work lies in optimizing Euclidean distance and paving the
way to test the same algorithm using Matlab which is an efficient tool
having powerful user interface along with simplicity in representing
complex images.
Abstract: This paper uses the radial basis function neural
network (RBFNN) for system identification of nonlinear systems.
Five nonlinear systems are used to examine the activity of RBFNN in
system modeling of nonlinear systems; the five nonlinear systems are
dual tank system, single tank system, DC motor system, and two
academic models. The feed forward method is considered in this
work for modelling the non-linear dynamic models, where the KMeans
clustering algorithm used in this paper to select the centers of
radial basis function network, because it is reliable, offers fast
convergence and can handle large data sets. The least mean square
method is used to adjust the weights to the output layer, and
Euclidean distance method used to measure the width of the Gaussian
function.
Abstract: In this study, we have defined slant helix according to
Bishop frame in Euclidean 3-Space. Furthermore, we have given
some necassary and sufficient conditons for the slant helix.
Abstract: In this paper we examine the use of global texture analysis based approaches for the purpose of Persian font recognition in machine-printed document images. Most existing methods for font recognition make use of local typographical features and connected component analysis. However derivation of such features is not an easy task. Gabor filters are appropriate tools for texture analysis and are motivated by human visual system. Here we consider document images as textures and use Gabor filter responses for identifying the fonts. The method is content independent and involves no local feature analysis. Two different classifiers Weighted Euclidean Distance and SVM are used for the purpose of classification. Experiments on seven different type faces and four font styles show average accuracy of 85% with WED and 82% with SVM classifier over typefaces
Abstract: The curves, of which the square of the distance
between the two points equal to zero, are called minimal or isotropic
curves [4]. In this work, first, necessary and sufficient conditions to
be a Pseudo Helix, which is a special case of such curves, are
presented. Thereafter, it is proven that an isotropic curve-s position
vector and pseudo curvature satisfy a vector differential equation of
fourth order. Additionally, In view of solution of mentioned
equation, position vector of pseudo helices is obtained.
Abstract: This paper proposes a method to improve the shortest
path problem on a NURBS (Non-uniform rational basis spline) surfaces.
It comes from an application of the theory in classic differential
geometry on surfaces and can improve the distance problem not only
on surfaces but in the Euclidean 3-space R3 .
Abstract: In this paper, first, a characterization of spherical
Pseudo null curves in Semi-Euclidean space is given. Then, to
investigate position vector of a pseudo null curve, a system of
differential equation whose solution gives the components of the
position vector of a pseudo null curve on the Frenet axis is
established by means of Frenet equations. Additionally, in view of
some special solutions of mentioned system, characterizations of
some special pseudo null curves are presented.