Spelling suggestions: "subject:"asistance measure"" "subject:"2distance measure""
1 |
Identification of Push-to-Talk Transmitters Using WaveletsPayal, Yalçin 12 1900 (has links)
The views expressed in this thesis are those of the author and do not reflect the official policy or position of the Department
of Defense or the U.S. Government. / The main objective of this study is to find a wavelet-based, feature extracting algorithm for push-to-talk transmitter
identification. A distance-measure algorithm is introduced to classify signals belonging to one of four transmitters. The
signals are first preprocessed to put them into a form suitable for wavelet analysis. The preprocessing scheme includes
taking the envelopes and differentials. Median filtering is also applied to the outputs of the wavelet transform. The
distance algorithm uses local extrema of the wavelet coefficients, and computes the distance between the local extrema of
a template and the processed signals. A small distance implies high similarity . A signal from each transmitter is selected
as a template. A small distance measure indicates that the signal belongs to the transmitter from which the template
originated. The distance algorithm can classify correctly the four different signal sets provided for the research. Even at
lower signal-to-noise levels, good identification is achieved.
|
2 |
Self-Organized Deviation DetectionKreshchenko, Ivan January 2008 (has links)
<p>A technique to detect deviations in sets of systems in a self-organized way is described in this work. System features are extracted to allow compact representation of the system. Distances between systems are calculated by computing distances between the features. The distances are then stored in an affinity matrix. Deviating systems are detected by assuming a statistical model for the affinities. The key idea is to extract features and and identify deviating systems in a self-organized way, using nonlinear techniques for the feature extraction. The results are compared with those achieved with linear techniques, (principal component analysis).</p><p>The features are computed with principal curves and an isometric feature mapping. In the case of principal curves the feature is the curve itself. In the case of isometric feature mapping is the feature a set of curves in the embedding space. The similarity measure between two representations is either the Hausdorff distance, or the Frechet distance. The deviation detection is performed by computing the probability of each system to be observed given all the other systems. To perform reliable inference the Bootstrapping technique was used.</p><p>The technique is demonstrated on simulated and on-road vehicle cooling system data. The results show the applicability and comparison with linear techniques.</p>
|
3 |
Self-Organized Deviation DetectionKreshchenko, Ivan January 2008 (has links)
A technique to detect deviations in sets of systems in a self-organized way is described in this work. System features are extracted to allow compact representation of the system. Distances between systems are calculated by computing distances between the features. The distances are then stored in an affinity matrix. Deviating systems are detected by assuming a statistical model for the affinities. The key idea is to extract features and and identify deviating systems in a self-organized way, using nonlinear techniques for the feature extraction. The results are compared with those achieved with linear techniques, (principal component analysis). The features are computed with principal curves and an isometric feature mapping. In the case of principal curves the feature is the curve itself. In the case of isometric feature mapping is the feature a set of curves in the embedding space. The similarity measure between two representations is either the Hausdorff distance, or the Frechet distance. The deviation detection is performed by computing the probability of each system to be observed given all the other systems. To perform reliable inference the Bootstrapping technique was used. The technique is demonstrated on simulated and on-road vehicle cooling system data. The results show the applicability and comparison with linear techniques.
|
4 |
Generalized Conditional Matching Algorithm for Ordered and Unordered SetsKrishnan, Ravikiran 13 November 2014 (has links)
Designing generalized data-driven distance measures for both ordered and unordered set data is the core focus of the proposed work. An ordered set is a set where time-linear property is maintained when distance between pair of temporal segments. One application in the ordered set is the human gesture analysis from RGBD data. Human gestures are fast becoming the natural form of human computer interaction. This serves as a motivation to modeling, analyzing, and recognition of gestures. The large number of gesture categories such as sign language, traffic signals, everyday actions and also subtle cultural variations in gesture classes makes gesture recognition a challenging problem. As part of generalization, an algorithm is proposed as part of an overlap speech detection application for unordered set.
Any gesture recognition task involves comparing an incoming or a query gesture against a training set of gestures. Having one or few samples deters any class statistic learning approaches to classification, as the full range of variation is not covered. Due to the large variability in gesture classes, temporally segmenting individual gestures also becomes hard. A matching algorithm in such scenarios needs to be able to handle single sample classes and have the ability to label multiple gestures without temporal segmentation.
Each gesture sequence is considered as a class and each class is a data point on an input space. A pair-wise distances pattern between to gesture frame sequences conditioned on a third (anchor) sequence is considered and is referred to as warp vectors. Such a process is defined as conditional distances. At the algorithmic core we have two dynamic time warping processes, one to compute the warp vectors with the anchor sequences and the other to compare these warp vectors. We show that having class dependent distance function can disambiguate classification process where the samples of classes are close to each other. Given a situation where the model base is large (number of classes is also large); the disadvantage of such a distance would be the computational cost. A distributed version combined with sub-sampling anchor gestures is proposed as speedup strategy. In order to label multiple connected gestures in query we use a simultaneous segmentation and recognition matching algorithm called level building algorithm. We use the dynamic programming implementation of the level building algorithm. The core of this algorithm depends on a distance function that compares two gesture sequences. We propose that, we replace this distance function, with the proposed distances. Hence, this version of level building is called as conditional level building (clb). We present results on a large dataset of 8000 RGBD sequences spanning over 200 gesture classes, extracted from the ChaLearn Gesture Challenge dataset. The result is that there is significant improvement over the underlying distance used to compute conditional distance when compared to conditional distance.
As an application of unordered set and non-visual data, overlap speech segment detection algorithm is proposed. Speech recognition systems have a vast variety of application, but fail when there is overlap speech involved. This is especially true in a meeting-room setting. The ability to recognize speaker and localize him/her in the room is an important step towards a higher-level representation of the meeting dynamics. Similar to gesture recognition, a new distance function is defined and it serves as the core of the algorithm to distinguish between individual speech and overlap speech temporal segments. The overlap speech detection problem is framed as outlier detection problem. An incoming audio is broken into temporal segments based on Bayesian Information Criterion (BIC). Each of these segments is considered as node and conditional distance between the nodes are determined. The underlying distances for triples used in conditional distances is the symmetric KL distance. As each node is modeled as a Gaussian, the distance between the two segments or nodes is given by Monte-Carlo estimation of the KL distance. An MDS based global embedding is created based on the pairwise distance between the nodes and RANSAC is applied to compute the outliers. NIST meeting room data set is used to perform experiments on the overlap speech detection. An improvement of more than 20% is achieved with conditional distance based approach when compared to a KL distance based approach.
|
5 |
Analysis of integrated transcriptomics and metabolomics data : a systems biology approachDaub, Carsten Oliver January 2004 (has links)
Moderne Hochdurchsatzmethoden erlauben die Messung einer Vielzahl von komplementären Daten und implizieren die Existenz von regulativen Netzwerken auf einem systembiologischen Niveau. Ein üblicher Ansatz zur Rekonstruktion solcher Netzwerke stellt die Clusteranalyse dar, die auf einem Ähnlichkeitsmaß beruht.<br />
Wir verwenden das informationstheoretische Konzept der wechselseitigen Information, das ursprünglich für diskrete Daten definiert ist, als Ähnlichkeitsmaß und schlagen eine Erweiterung eines für gewöhnlich für die Anwendung auf kontinuierliche biologische Daten verwendeten Algorithmus vor. Wir vergleichen unseren Ansatz mit bereits existierenden Algorithmen. Wir entwickeln ein geschwindigkeitsoptimiertes Computerprogramm für die Anwendung der wechselseitigen Information auf große Datensätze. Weiterhin konstruieren und implementieren wir einen web-basierten Dienst fuer die Analyse von integrierten Daten, die durch unterschiedliche Messmethoden gemessen wurden. Die Anwendung auf biologische Daten zeigt biologisch relevante Gruppierungen, und rekonstruierte Signalnetzwerke zeigen Übereinstimmungen mit physiologischen Erkenntnissen. / Recent high-throughput technologies enable the acquisition of a variety of complementary data and imply regulatory networks on the systems biology level. A common approach to the reconstruction of such networks is the cluster analysis which is based on a similarity measure.<br />
We use the information theoretic concept of the mutual information, that has been originally defined for discrete data, as a measure of similarity and propose an extension to a commonly applied algorithm for its calculation from continuous biological data. We compare our approach to previously existing algorithms. We develop a performance optimised software package for the application of the mutual information to large-scale datasets. Furthermore, we design and implement a web-based service for the analysis of integrated data measured with different technologies. Application to biological data reveals biologically relevant groupings and reconstructed signalling networks show agreements with physiological findings.
|
6 |
The Comparison of Parameter Estimation with Application to Massachusetts Health Care Panel Study (MHCPS) DataHuang, Yao-wen 03 June 2004 (has links)
In this paper we propose two simple algorithms to estimate parameters £] and baseline survival function in Cox proportional hazard model with application to Massachusetts Health Care Panel Study (MHCPS) (Chappell, 1991) data which is a left truncated and interval censored data. We find that, in the estimation of £] and baseline survival function, Kaplan and Meier algorithm is uniformly better than the Empirical algorithm. Also, Kaplan and Meier algorithm is uniformly more powerful than the Empirical algorithm in testing whether two groups of survival functions are the same. We also define a distance measure D and compare the performance of these two algorithms through £] and D.
|
7 |
Automatic Source Code Classification : Classifying Source Code for a Case-Based Reasoning SystemNordström, Markus January 2015 (has links)
This work has investigated the possibility of classifying Java source code into cases for a case-based reasoning system. A Case-Based Reasoning system is a problem solving method in Artificial Intelligence that uses knowledge of previously solved problems to solve new problems. A case in case-based reasoning consists of two parts: the problem part and solution part. The problem part describes a problem that needs to be solved and the solution part describes how this problem was solved. In this work, the problem is described as a Java source file using words that describes the content in the source file and the solution is a classification of the source file along with the source code. To classify Java source code, a classification system was developed. It consists of four analyzers: type filter, documentation analyzer, syntactic analyzer and semantic analyzer. The type filter determines if a Java source file contains a class or interface. The documentation analyzer determines the level of documentation in asource file to see the usefulness of a file. The syntactic analyzer extracts statistics from the source code to be used for similarity, and the semantic analyzer extracts semantics from the source code. The finished classification system is formed as a kd-tree, where the leaf nodes contains the classified source files i.e. the cases. Furthermore, a vocabulary was developed to contain the domain knowledge about the Java language. The resulting kd-tree was found to be imbalanced when tested, as the majority of source files analyzed were placed inthe left-most leaf nodes. The conclusion from this was that using documentation as a part of the classification made the tree imbalanced and thus another way has to be found. This is due to the fact that source code is not documented to such an extent that it would be useful for this purpose.
|
8 |
Image classification, storage and retrieval system for a 3 u cubesatGashayija, Jean Marie January 2014 (has links)
Thesis submitted in fulfillment of the requirements for the degree Master of Technology: Electrical Engineering in the Faculty of Engineering at the Cape Peninsula University of Technology / Small satellites, such as CubeSats are mainly utilized for space and earth imaging missions. Imaging CubeSats are equipped with high resolution cameras for the capturing of digital images, as well as mass storage devices for storing the images. The captured images are transmitted to the ground station and subsequently stored in a database.
The main problem with stored images in a large image database, identified by researchers and developers within the last number of years, is the retrieval of precise, clear images and overcoming the semantic gap. The semantic gap relates to the lack of correlation between the semantic categories the user requires and the low level features that a content-based image retrieval system offers. Clear images are needed to be usable for applications such as mapping, disaster monitoring and town planning. The main objective of this thesis is the design and development of an image classification, storage and retrieval system for a CubeSat. This system enables efficient classification, storing and retrieval of images that are received on a daily basis from an in-orbit CubeSat. In order to propose such a system, a specific research methodology was chosen and adopted. This entails extensive literature reviews on image classification techniques and image feature extraction techniques, to extract content embedded within an image, and include studies on image database systems, data mining techniques and image retrieval techniques. The literature study led to a requirement analysis followed by the analyses of software development models in order to design the system. The proposed design entails classifying images using content embedded in the image and also extracting image metadata such as date and time. Specific features extraction techniques are needed to extract required content and metadata. In order to achieve extraction of information embedded in the image, colour feature (colour histogram), shape feature (Mathematical Morphology) and texture feature (GLCM) techniques were used. Other major contributions of this project include a graphical user interface which enables users to search for similar images against those stored in the database. An automatic image extractor algorithm was also designed to classify images according to date and time, and colour, texture and shape features extractor techniques were proposed. These ensured that when a user wishes to query the database, the shape objects, colour quantities and contrast contained in an image are extracted and compared to those stored in the database. Implementation and test results concluded that the designed system is able to categorize images automatically and at the same time provide efficient and accurate results. The features extracted for each image depend on colour, shape and texture methods. Optimal values were also incorporated in order to reduce retrieval times. The mathematical morphological technique was used to compute shape objects using erosion and dilation operators, and the co-occurrence matrix was used to compute the texture feature of the image.
|
9 |
Toward Improving Confidence in Autonomous Vehicle Software: A Study on Traffic Sign Recognition SystemsAslansefat, K., Kabir, Sohag, Abdullatif, Amr R.A., Vasudevan, Vinod, Papadopoulos, Y. 10 August 2021 (has links)
Yes / This article proposes an approach named SafeML II, which applies empirical cumulative distribution function-based statistical distance measures in a designed human-in-the loop procedure to ensure the safety of machine learning-based classifiers in autonomous vehicle software.
The application of artificial intelligence (AI) and
data-driven decision-making systems in autonomous vehicles is
growing rapidly. As autonomous vehicles operate in dynamic
environments, the risk that they can face an unknown observation
is relatively high due to insufficient training data, distributional
shift, or cyber-security attack. Thus, AI-based algorithms should
make dependable decisions to improve their interpretation of the
environment, lower the risk of autonomous driving, and avoid
catastrophic accidents. This paper proposes an approach named
SafeML II, which applies empirical cumulative distribution
function (ECDF)-based statistical distance measures in a designed
human-in-the-loop procedure to ensure the safety of machine
learning-based classifiers in autonomous vehicle software. The
approach is model-agnostic and it can cover various machine
learning and deep learning classifiers. The German Traffic
Sign Recognition Benchmark (GTSRB) is used to illustrate the
capabilities of the proposed approach. / This work was supported by the Secure and Safe MultiRobot Systems (SESAME) H2020 Project under Grant Agreement 101017258.
|
10 |
Comparison of A*, Euclidean and Manhattan distance using Influence map in MS. Pac-ManRanjitkar, Hari Sagar, Karki, Sudip January 2016 (has links)
Context An influence map and potential fields are used for finding path in domain of Robotics and Gaming in AI. Various distance measures can be used to find influence maps and potential fields. However, these distance measures have not been compared yet. ObjectivesIn this paper, we have proposed a new algorithm suitable to find an optimal point in parameters space from random parameter spaces. Finally, comparisons are made among three popular distance measures to find the most efficient. Methodology For our RQ1 and RQ2, we have implemented a mix of qualitative and quantitative approach and for RQ3, we have used quantitative approach. Results A* distance measure in influence maps is more efficient compared to Euclidean and Manhattan in potential fields. Conclusions Our proposed algorithm is suitable to find optimal point and explores huge parameter space. A* distance in influence maps is highly efficient compared to Euclidean and Manhattan distance in potentials fields. Euclidean and Manhattan distance performed relatively similar whereas A* distance performed better than them in terms of score in Ms. Pac-Man (See Appendix A).
|
Page generated in 0.0683 seconds