NONLINEAR STATISTICS OF HUMAN SPEECH DATA

2009 ◽  
Vol 19 (07) ◽  
pp. 2307-2319 ◽  
Author(s):  
KENNETH A. BROWN ◽  
KEVIN P. KNUDSON
Keyword(s):  
Time Delay ◽  
Betti Number ◽  
Persistent Homology ◽  
Point Clouds ◽  
Simplicial Complexes ◽  
Data Sets ◽  
Human Speech ◽  
Speech Data ◽  
Nonlinear Statistics

We study the structure of point clouds obtained as time delay embeddings of human speech signals by approximating the data sets with certain simplicial complexes and analyzing their persistent homology. Results for several different sounds are presented in embedding dimensions 3 and 4. The first Betti number allows a coarse classification of sounds into three groups: vowels, nasals and noise.

scholarly journals Persistent homology analysis of multiqubit entanglement

2020 ◽  
Vol 20 (5&6) ◽  
pp. 375-399
Author(s):  
Ricardo Mengoni ◽  
Alessandra Di Pierro ◽  
Leleh Memarzadeh ◽  
Stefano Mancini
Keyword(s):  
Persistent Homology ◽  
Occurrence Frequency ◽  
Entangled States ◽  
Data Sets ◽  
Bipartite Entanglement ◽  
Homology Analysis ◽  
Relative Occurrence ◽  
Associate State

We introduce a homology-based technique for the classification of multiqubit state vectors with genuine entanglement. In our approach, we associate state vectors to data sets by introducing a metric-like measure in terms of bipartite entanglement, and investigate the persistence of homologies at different scales. This leads to a novel classification of multiqubit entanglement. The relative occurrence frequency of various classes of entangled states is also shown.

scholarly journals CLASSIFICATION OF MOBILE LASER SCANNING POINT CLOUDS OF URBAN SCENES EXPLOITING CYLINDRICAL NEIGHBOURHOODS

2018 ◽  
Vol XLII-2 ◽  
pp. 1225-1228 ◽  
Author(s):  
M. Zheng ◽  
M. Lemmens ◽  
P. van Oosterom
Keyword(s):  
Laser Scanning ◽  
Point Clouds ◽  
Bench Mark ◽  
Data Sets ◽  
Automated Classification ◽  
Height Difference ◽  
Urban Scenes ◽  
The Core ◽  
Selection Of

This paper presents our work on automated classification of Mobile Laser Scanning (MLS) point clouds of urban scenes with features derived from cylinders around points of consideration. The core of our method consists of spanning up a cylinder around points and deriving features, such as reflectance, height difference, from the points present within the cylindrical neighbourhood. Crucial in the approach is the selection of features from the points within the cylinder. An overall accuracy could be achieved, exploiting two bench mark data sets (Paris-rue-Madame and IQmulus & TerraMobilita) of 83 % and 87 % respectively.

scholarly journals Persistent Homology of Geospatial Data: A Case Study with Voting

2019 ◽  
Author(s):  
Michelle Feng ◽  
Mason A. Porter
Keyword(s):  
Simplicial Complex ◽  
Persistent Homology ◽  
Point Clouds ◽  
Simplicial Complexes ◽  
Geospatial Data ◽  
Alternative Methods ◽  
Data Set ◽  
New Methods ◽  
Complex Construction

A crucial step in the analysis of persistent homology is the transformation of data into an appropriate topological object (in our case, a simplicial complex). Modern packages for persistent homology often construct Vietoris–Rips or other distance-based simplicial complexes on point clouds because they are relatively easy to compute. We investigate alternative methods of constructing these complexes and the effects of making associated choices during simplicial-complex construction on the output of persistent-homology algorithms. We present two new methods for constructing simplicial complexes from two-dimensional geospatial data (such as maps). We apply these methods to a California precinct-level voting data set, demonstrating that our new constructions can capture geometric characteristics that are missed by distance-based constructions. Our new constructions can thus yield more interpretable persistence modules and barcodes for geospatial data. In particular, they are able to distinguish short-persistence features that occur only for a narrow range of distance scales (e.g., voting behaviors in densely populated cities) from short-persistence noise by incorporating information about other spatial relationships between precincts.

scholarly journals Disturbance Analysis in the Classification of Objects Obtained from Urban LiDAR Point Clouds with Convolutional Neural Networks

2021 ◽  
Vol 13 (11) ◽  
pp. 2135
Author(s):  
Jesús Balado ◽  
Pedro Arias ◽  
Henrique Lorenzo ◽  
Adrián Meijide-Rodríguez
Keyword(s):  
Laser Scanning ◽  
Ambient Noise ◽  
Point Clouds ◽  
Density Variation ◽  
Density Reduction ◽  
Manual Intervention ◽  
Point Density ◽  
Disturbance Analysis ◽  
Street Furniture

Mobile Laser Scanning (MLS) systems have proven their usefulness in the rapid and accurate acquisition of the urban environment. From the generated point clouds, street furniture can be extracted and classified without manual intervention. However, this process of acquisition and classification is not error-free, caused mainly by disturbances. This paper analyses the effect of three disturbances (point density variation, ambient noise, and occlusions) on the classification of urban objects in point clouds. From point clouds acquired in real case studies, synthetic disturbances are generated and added. The point density reduction is generated by downsampling in a voxel-wise distribution. The ambient noise is generated as random points within the bounding box of the object, and the occlusion is generated by eliminating points contained in a sphere. Samples with disturbances are classified by a pre-trained Convolutional Neural Network (CNN). The results showed different behaviours for each disturbance: density reduction affected objects depending on the object shape and dimensions, ambient noise depending on the volume of the object, while occlusions depended on their size and location. Finally, the CNN was re-trained with a percentage of synthetic samples with disturbances. An improvement in the performance of 10–40% was reported except for occlusions with a radius larger than 1 m.

scholarly journals Classification of jujube defects in small data sets based on transfer learning

2021 ◽  
Author(s):  
Jianping Ju ◽  
Hong Zheng ◽  
Xiaohang Xu ◽  
Zhongyuan Guo ◽  
Zhaohui Zheng ◽  
...  
Keyword(s):  
Transfer Learning ◽  
Loss Function ◽  
Training Model ◽  
Parameter Distribution ◽  
Test Accuracy ◽  
Small Data ◽  
Data Sets ◽  
Data Set ◽  
Small Data Sets

AbstractAlthough convolutional neural networks have achieved success in the field of image classification, there are still challenges in the field of agricultural product quality sorting such as machine vision-based jujube defects detection. The performance of jujube defect detection mainly depends on the feature extraction and the classifier used. Due to the diversity of the jujube materials and the variability of the testing environment, the traditional method of manually extracting the features often fails to meet the requirements of practical application. In this paper, a jujube sorting model in small data sets based on convolutional neural network and transfer learning is proposed to meet the actual demand of jujube defects detection. Firstly, the original images collected from the actual jujube sorting production line were pre-processed, and the data were augmented to establish a data set of five categories of jujube defects. The original CNN model is then improved by embedding the SE module and using the triplet loss function and the center loss function to replace the softmax loss function. Finally, the depth pre-training model on the ImageNet image data set was used to conduct training on the jujube defects data set, so that the parameters of the pre-training model could fit the parameter distribution of the jujube defects image, and the parameter distribution was transferred to the jujube defects data set to complete the transfer of the model and realize the detection and classification of the jujube defects. The classification results are visualized by heatmap through the analysis of classification accuracy and confusion matrix compared with the comparison models. The experimental results show that the SE-ResNet50-CL model optimizes the fine-grained classification problem of jujube defect recognition, and the test accuracy reaches 94.15%. The model has good stability and high recognition accuracy in complex environments.

Detection and Classification of Anomalies in Large Data Sets on the Basis of Information Granules

2021 ◽  
pp. 1-1
Author(s):  
Adam Kiersztyn ◽  
Pawe Karczmarek ◽  
Krystyna Kiersztyn ◽  
Witold Pedrycz
Keyword(s):  
Large Data ◽  
Large Data Sets ◽  
Data Sets ◽  
Information Granules

scholarly journals Software Benchmark—Classification Tree Algorithms for Cell Atlases Annotation Using Single-Cell RNA-Sequencing Data

2021 ◽  
Vol 12 (2) ◽  
pp. 317-334
Author(s):  
Omar Alaqeeli ◽  
Li Xing ◽  
Xuekui Zhang
Keyword(s):  
Single Cell ◽  
Rna Sequencing ◽  
Classification Tree ◽  
Area Under The Curve ◽  
Data Sets ◽  
Sequencing Data ◽  
Single Cell Rna Sequencing ◽  
Tree Algorithms ◽  
R Packages

Classification tree is a widely used machine learning method. It has multiple implementations as R packages; rpart, ctree, evtree, tree and C5.0. The details of these implementations are not the same, and hence their performances differ from one application to another. We are interested in their performance in the classification of cells using the single-cell RNA-Sequencing data. In this paper, we conducted a benchmark study using 22 Single-Cell RNA-sequencing data sets. Using cross-validation, we compare packages’ prediction performances based on their Precision, Recall, F1-score, Area Under the Curve (AUC). We also compared the Complexity and Run-time of these R packages. Our study shows that rpart and evtree have the best Precision; evtree is the best in Recall, F1-score and AUC; C5.0 prefers more complex trees; tree is consistently much faster than others, although its complexity is often higher than others.

scholarly journals An Inverse Node Graph-Based Method for the Urban Scene Segmentation of 3D Point Clouds

2021 ◽  
Vol 13 (15) ◽  
pp. 3021
Author(s):  
Bufan Zhao ◽  
Xianghong Hua ◽  
Kegen Yu ◽  
Xiaoxing He ◽  
Weixing Xue ◽  
...  
Keyword(s):  
Semantic Segmentation ◽  
Point Clouds ◽  
Intelligent Vehicles ◽  
Critical Data ◽  
Multi Scale ◽  
3D Point Clouds ◽  
Cluster Optimization ◽  
Urban Scene ◽  
Processing Steps

Urban object segmentation and classification tasks are critical data processing steps in scene understanding, intelligent vehicles and 3D high-precision maps. Semantic segmentation of 3D point clouds is the foundational step in object recognition. To identify the intersecting objects and improve the accuracy of classification, this paper proposes a segment-based classification method for 3D point clouds. This method firstly divides points into multi-scale supervoxels and groups them by proposed inverse node graph (IN-Graph) construction, which does not need to define prior information about the node, it divides supervoxels by judging the connection state of edges between them. This method reaches minimum global energy by graph cutting, obtains the structural segments as completely as possible, and retains boundaries at the same time. Then, the random forest classifier is utilized for supervised classification. To deal with the mislabeling of scattered fragments, higher-order CRF with small-label cluster optimization is proposed to refine the classification results. Experiments were carried out on mobile laser scan (MLS) point dataset and terrestrial laser scan (TLS) points dataset, and the results show that overall accuracies of 97.57% and 96.39% were obtained in the two datasets. The boundaries of objects were retained well, and the method achieved a good result in the classification of cars and motorcycles. More experimental analyses have verified the advantages of the proposed method and proved the practicability and versatility of the method.

Sign in / Sign up

Export Citation Format

Share Document