A Study of Multi-dimensional Melodic Similarity Model Based on Perceptual Analysis

Content-based audio classification and segmentation is a basis for further audio/video analysis. In this paper, we present our work on audio segmentation and classification which employs support vector machines (SVMs). Five audio classes are considered in this paper: silence, music, background sound, pure speech, and non- pure speech which includes speech over music and speech over noise. A sound stream is segmented by classifying each sub-segment into one of these five classes. We have evaluated the performance of SVM on different audio type-pairs classification with testing unit of different- length and compared the performance of SVM, K-Nearest Neighbor (KNN), and Gaussian Mixture Model (GMM). We also evaluated the effectiveness of some new proposed features. Experiments on a database composed of about 4- hour audio data show that the proposed classifier is very efficient on audio classification and segmentation. It also shows the accuracy of the SVM-based method is much better than the method based on KNN and GMM.

Identifying different audio segments in videos is the first step for many important tasks such as event detection and speech transcription. Approaches using Mel-Frequency Cepstral coefficients (MFCCs) with Gaussian mixture models (GMMs) and hidden Markov models (HMMs) perform reasonably well in stationary conditions but do not scale to a broad range of environmental conditions. This paper focuses on the audio segmentation in broadcast soccer videos into audio classes such as Silence, Speech Only, Speech Over Crowd, Crowd Only and Excited, with an alternative feature set which is simplistic as well as robust to changes in the environment conditions. Support Vector Machines (SVMs), Neural Networks and Random Forest are used for the classification. The accuracy achieved with SVMs, Neural Networks and Random Forest are 83.80%, 86.07%, and 88.35% respectively. The proposed features and Random Forest classifier are found to achieve better accuracy compared to the other classifiers.

An on-line audio classification and segmentation system is presented in this research, where audio recordings are classified and segmented into speech, music, several types of environmental sounds and silence based on audio content analysis. This is the first step of our continuing work towards a general content-based audio classification and retrieval system. The extracted audio features include temporal curves of the energy function,the average zero- crossing rate, the fundamental frequency of audio signals, as well as statistical and morphological features of these curves. The classification result is achieved through a threshold-based heuristic procedure. The audio database that we have built, details of feature extraction, classification and segmentation procedures, and experimental results are described. It is shown that, with the proposed new system, audio recordings can be automatically segmented and classified into basic types in real time with an accuracy of over 90 percent. Outlines of further classification of audio into finer types and a query-by-example audio retrieval system on top of the coarse classification are also introduced.

In this paper, we present an organized survey of the existing literature on music information retrieval systems in which descriptor features are extracted directly from the compressed audio files, without prior decompression to pulse-code modulation format. Avoiding the decompression step and utilizing the readily available compressed-domain information can significantly lighten the computational cost of a music information retrieval system, allowing application to large-scale music databases. We identify a number of systems relying on compressed-domain information and form a systematic classification of the features they extract, the retrieval tasks they tackle and the degree in which they achieve an actual increase in the overall speed—as well as any resulting loss in accuracy. Finally, we discuss recent developments in the field, and the potential research directions they open toward ultra-fast, scalable systems.

Audio signal classification is usually done using conventional signal features such as mel-frequency cepstrum coefficients (MFCC), line spectral frequencies (LSF), and short time energy (STM). Learned dictionaries have been shown to have promising capability for creating sparse representation of a signal and hence have a potential to be used for the extraction of signal features. In this paper, we consider to use sparse features for audio classification from music and speech data. We use the K-SVD algorithm to learn separate dictionaries for the speech and music signals to represent their respective subspaces and use them to extract sparse features for each class of signals using Orthogonal Matching Pursuit (OMP). Based on these sparse features, Support Vector Machines (SVM) are used for speech and music classification. The same signals were also classified using SVM based on the conventional MFCC coefficients and the classification results were compared to those of sparse coefficients. It was found that at lower signal to noise ratio (SNR), sparse coefficients give far better signal classification results as compared to the MFCC based classification.

Abstract. The Support Vector Machine (SVM) is a theoretically superior machine learning methodology with great results in classification of remotely sensed datasets. Determination of optimal parameters applied in SVM is still vague to some scientists. In this research, it is suggested to use the Taguchi method to optimize these parameters. The objective of this study was to detect tree crowns on very high resolution (VHR) aerial imagery in Zagros woodlands by SVM optimized by Taguchi method. A 30 ha plot of Persian oak (Quercus persica) coppice trees was selected in Zagros woodlands, Iran. The VHR aerial imagery of the plot with 0.06 m spatial resolution was obtained from National Geographic Organization (NGO), Iran, to extract the crowns of Persian oak trees in this study. The SVM parameters were optimized by Taguchi method and thereafter, the imagery was classified by the SVM with optimal parameters. The results showed that the Taguchi method is a very useful approach to optimize the combination of parameters of SVM. It was also concluded that the SVM method could detect the tree crowns with a KHAT coefficient of 0.961 which showed a great agreement with the observed samples and overall accuracy of 97.7% that showed the accuracy of the final map. Finally, the authors suggest applying this method to optimize the parameters of classification techniques like SVM.

The growing number of music content online has opened up new possibilities for the introduction of successful digital knowledge access services known as music referral systems that help user groups in searching, finding, sharing, and creating. The music recovery approach based on specific similarity information combines several similarity features, including audio and contextual similarities, such as tone format features and melodic details. Audio classification is very important for recovering audio files quickly. To get the best results from audio classification, it is important to choose the best feature set and follow the best analysis method. Support vector machines (SVMs) are implemented by learning from input samples to classify music into separate classes of music genres. The SVM study excelled in the music category classification.KeywordsSVMZCRSTELPCRMSMFCCMIR and genre

Investigation of acoustic and visual features for pig cough classification

Computations in most music retrieval systems strongly depend on the size of data compared. We propose to enhance performances of a music retrieval system, namely a harmonic similarity evaluation method, by first indexing relevant parts of music pieces. The indexing algorithm represents each audio piece exclusively by its major repetition, using harmonic descriptions and string matching techniques. Evaluations are performed in the context of a state-of-the-art retrieval method, namely cover songs identification, and results highlight the success of our indexing system in keeping similar results while yielding a substantial gain in computation time.

Music similarity can be perceived by the listeners in different ways depending on individual preferences to musical parameters. Metadata based similarity measures are used by many websites for music recommendation and retrieval. Metadata attached to music files as text generally include title, albums, genre, artist etc. The main limitation of this method is that it can only work if metadata is available with the music. It may produce wrong results if incorrect metadata is associated with the music file. Present Meta data based systems also lack in analyzing contents. We have conducted experiments with Indian film songs in pairs and triplets to understand listener's perception of similarity. We analyzed content based parameters such as voice, mood, instruments used, lyrics, rhythms, tune etc and their relative importance in similarity perception to majority of the listeners. We propose to use both metadata and content based parameters. We worked on few parameters and worked with some algorithms in our prototype. Our findings can be useful for music Information Retrieval System and the concept is applicable to all musical forms. Perception based framework for music similarity is an attempt to model present and future needs of music listeners with option of adjustment for various musical parameters from listener perceptive.

Classification is the process of finding a model or function that can describe and differentiate data into classes. One application of classification is Support Vector Machine (SVM). SVM is a learning system that uses a hypothetical space in the form of linear functions in a high-dimensional feature space, trained with a learning algorithm based on optimization theory by implementing machine learning derived from statistical learning theory. The concept of classification with SVM is to find the best hyperplane to separate the two data classes and use a support vector approach. This study uses the proportion of the distribution of training data and testing data, namely 50%:50%, 70%:30%, 90%:10% and uses the SVM algorithm Polynomial kernel function with parameters =0.01, r=0.5, d =2, and C=1. This study aims to determine the results of the classification of the credit payment status of electronic goods and furniture and the level of classification accuracy in the SVM method. The data used is the debtor data of PT. KB Finansia Multi Finance Bontang in 2020 as many as 133 data with current and non-current credit payment status and using 7 independent variables, namely age, number of dependents, length of stay, income, years of service, large credit payments, and length of credit borrowing. The results of the SVM classification show an average accuracy value of 72.25% and the best accuracy chosen is the proportion of training data distribution and testing data 90%:10%, which is 84.62%.

Land-cover classification using remote sensing imagery is an important part of environmental research because it provides baseline information for ecological vulnerability and risk assessment, disaster management, landscape conservation, local and regional planning, and so on. Rural-land-cover classification is challenging for both object-based image analysis methods and classifiers. The objective of this study is to improve the object-oriented classification accuracy of rural land cover by combining two models based on high spatial resolution imagery. We apply the C5.0 algorithm in R to combine support vector machines (SVMs) and random forest (RF) to create the model RS_C5.0. The effectiveness of the model combination is assessed by comparing the classification results with the state-of-the-art machine learning algorithm, namely extreme gradient boosting (XGBoost). The comparisons are done based on the classification results of both the study area and the case area. Results show that in the classification of the study area, RF performs slightly better than SVM, and XGBoost performs worse than RF but better than SVM. However, in the classification of the case area, SVM performs slightly better than RF and both SVM and RF perform better than XGBoost. Furthermore, RS_C5.0 obtains the highest overall accuracies and kappa coefficients in the classifications of both the study area and the case area. In terms of training time, XGBoost runs the slowest in the classifications of both the study area and the case area. SVM and RF as well as the combined model (RS_C5.0) run much faster than XGBoost classifier. To summarize, the combination of SVM and RF classifiers using C5.0 algorithm is found to be a fast and effective way to improve rural-land-cover classification.

Combining evidences from magnitude and phase information using VTEO for person recognition using humming

In this study, the performances of Random Forests (RF), Artificial Neural Networks (ANN), Support Vector Machine (SVM) and Extreme Gradient Boosting (XGBoost) algorithms in agricultural crop classification were compared using multi-temporal Sentinel-2 images. The study area is located within an area of approximately 45* 45 km2 within the borders of Çukurova Plain. Within the scope of the study, agricultural crop pattern classification including corn, cotton, wheat, sunflower, sunflower, watermelon, peanut, and citrus trees, as well as double crop corn, soya, and cotton crops planted after wheat using RF, ANN, SVM, XGBoost algorithms with multi-time Sentinel-2 images of 2021. The study used parcels registered in the Farmer Registration System (FRS) as reference data. Before defining the parcels that are called Farmer Declaration Parcels (FDP) as ground truth data, pre-editing and rule-based deletion operations were performed, afterwards false and incorrect declarations were eliminated.10 bands (B2, B3, B4, B5, B6, B7, B8, B8A, B11, B12) of Sentinel-2 imagery from 11 different dates and Enhanced Vegetation Index (EVI) were used. All classification results showed a high overall accuracy (OA) ranging from 85% to 92%. As a result of the classification using a total of 121 different features, the highest overall accuracy OA (92.14%) belongs to the XGBoost algorithm. XGBoost algorithm was followed by RF (89.15%), SVM (86.14%) and ANN (85.48%). In all algorithms, although cotton, maize and wheat gave the highest accuracy in the classification results, double crops (wheat-maize, wheat-soybean, wheat-cotton) especially those with very close phenological periods, could not reach very high accuracy values. As a result of the study, it was observed that crops at different phenological stages achieved high classification accuracy using all algorithms, while crops at very similar phenological stages lower classification results. With the methodology applied in this study, a large number of ground truth data were generated from FDP plots and used for classification.

Air pollution has become one of the biggest environmental challenges worldwide, and Jakarta, the capital city of Indonesia, is no exception. Jakarta, as one of the most populous cities in the world, faces serious problems in ensuring healthy air quality for its residents. The impact of this air pollution is not only limited to human health, but also damages the environment as a whole, including plants and aquatic ecosystems. In an effort to address this issue, many studies have been conducted to develop prediction models that can provide estimates of air quality levels in Jakarta City. Two modeling models that can be used in this context are Support Vector Machine (SVM) and K-Nearest Neighbors (KNN). This study aims to compare the performance of the SVM algorithm model with the KNN algorithm in the classification of air quality in Jakarta City. Data mining is the art and science of discovering knowledge, insights, and patterns in data based on the CRISP -DM (Cross Industry Standard Process For Data Mining) methodology. The data source in this study is the Jakarta air pollution standard index (ISPU) data obtained on the satudata.jakarta.go.id website. This study compares the accuracy of the Jakarta City air quality classification on the Support vector Machine (SVM) and K-Nearest Neighbor (KNN) algorithms using python. Comparison results are determined by the level of accuracy and score of the confusion matrix. Classification results are presented in the form of a Graphic User Interface with media interface. The comparison of classification algorithms on two models in data mining shows that the Support Vector Machine (SVM) algorithm is superior to K-Nearest Neighbor (KNN). This is evident from the higher accuracy rate in SVM, especially with the use of the Rbf kernel which reaches 97.05%, compared to KNN which has an accuracy of 94.74% with parameters p = 1 and k = 5. In addition, SVM also shows a higher correct prediction value compared to KNN. In a 1-year time span the overall quality may be quite good, with moderate quality at more than equal to 50 to 100. However, control is still needed for the unhealthy category areas.