Detection and Tracking Cows by Computer Vision and Image Classification Methods

2021 ◽  
Vol 13 (1) ◽  
pp. 1-45
Author(s):  
Terry Gao
Keyword(s):  
Feature Fusion ◽  
Binary Classification ◽  
Classification Problem ◽  
Detection Algorithm ◽  
Video Sequences ◽  
Image Block ◽  
Body Contour ◽  
Adaboost Algorithm ◽  
Target Model ◽  
Detection And Tracking

In this paper, the cow recognition and traction in video sequences is studied. In the recognition phase, this paper does some discussion and analysis which aim at different classification algorithms and feature extraction algorithms, and cow's detection is transformed into a binary classification problem. The detection method extracts cow's features using a method of multiple feature fusion. These features include edge characters which reflects the cow body contour, grey value, and spatial position relationship. In addition, the algorithm detects the cow body through the classifier which is trained by Gentle Adaboost algorithm. Experiments show that the method has good detection performance when the target has deformation or the contrast between target and background is low. Compared with the general target detection algorithm, this method reduces the miss rate and the detection precision is improved. Detection rate can reach 97.3%. In traction phase, the popular compressive tracking (CT) algorithm is proposed. The learning rate is changed through adaptively calculating the pap distance of image block. Moreover, the update for target model is stopped to avoid introducing error and noise when the classification response values are negative. The experiment results show that the improved tracking algorithm can effectively solve the target model update by mistaken when there are large covers or the attitude is changed frequently. For the detection and tracking of cow body, a detection and tracking framework for the image of cow is built and the detector is combined with the tracking framework. The algorithm test for some video sequences under the complex environment indicates the detection algorithm based on improved compressed perception shows good tracking effect in the changing and complicated background.

A Human Target Detection and Tracking Method Based on Adaptive Difference and GVF-Snake Algorithm

2013 ◽  
Vol 455 ◽  
pp. 344-349
Author(s):  
Xue Zhang ◽  
Wei Cheng Xie ◽  
Chao Huang ◽  
Qiang Xu
Keyword(s):  
Target Detection ◽  
Detection Algorithm ◽  
Initial Contour ◽  
Differential Detection ◽  
Body Contour ◽  
Snake Model ◽  
Tracking Method ◽  
Detection And Tracking ◽  
Frame Difference ◽  
Snake Algorithm

Detection of Frame difference fails when the human target is stationary in course of moving, this paper presents a method based on combination of adaptive difference and GVF-snake algorithm to solve it. Adaptive differential detection algorithm can accurately extract the target contour, and use it as the initial contour of GVF-snake model which cannot automatically extract it after we got the target. In the process of detection and tracking, calculating GVF field of the whole picture consume too much time, so we use the method of sub-region to improve the real-time. The experimental results show that, the algorithm can provide the actual body contour for GVF-snake model, and effectively track whether the target is stationary or moving.

scholarly journals Detecting malicious URLs using binary classification through adaboost algorithm

2020 ◽  
Vol 10 (1) ◽  
pp. 997
Author(s):  
Firoz Khan ◽  
Jinesh Ahamed ◽  
Seifedine Kadry ◽  
Lakshmana Kumar Ramasamy
Keyword(s):  
Machine Learning ◽  
Binary Classification ◽  
Classification Problem ◽  
End Users ◽  
Uniform Resource Locator ◽  
Adaboost Algorithm ◽  
Binary Classification Problem

Malicious Uniform Resource Locator (URL) is a frequent and severe menace to cybersecurity. Malicious URLs are used to extract unsolicited information and trick inexperienced end users as a sufferer of scams and create losses of billions of money each year. It is crucial to identify and appropriately respond to such URLs. Usually, this discovery is made by the practice and use of blacklists in the cyber world. However, blacklists cannot be exhaustive, and cannot recognize zero-day malicious URLs. So to increase the observation of malicious URL indicators, machine learning procedures should be incorporated. This study aims to discuss the exposure of malicious URLs as a binary classification problem using machine learning through an AdaBoost algorithm.

scholarly journals Advancing Stress Detection Methodology with Deep Learning Techniques Targeting UX Evaluation in AAL Scenarios: Applying Embeddings for Categorical Variables

Electronics ◽  
2021 ◽  
Vol 10 (13) ◽  
pp. 1550
Author(s):  
Alexandros Liapis ◽  
Evanthia Faliagka ◽  
Christos P. Antonopoulos ◽  
Georgios Keramidas ◽  
Nikolaos Voros
Keyword(s):  
Machine Learning ◽  
Deep Learning ◽  
User Experience ◽  
Electrodermal Activity ◽  
Binary Classification ◽  
Research Question ◽  
Classification Problem ◽  
Categorical Variables ◽  
Stress Detection ◽  
Software Failures

Physiological measurements have been widely used by researchers and practitioners in order to address the stress detection challenge. So far, various datasets for stress detection have been recorded and are available to the research community for testing and benchmarking. The majority of the stress-related available datasets have been recorded while users were exposed to intense stressors, such as songs, movie clips, major hardware/software failures, image datasets, and gaming scenarios. However, it remains an open research question if such datasets can be used for creating models that will effectively detect stress in different contexts. This paper investigates the performance of the publicly available physiological dataset named WESAD (wearable stress and affect detection) in the context of user experience (UX) evaluation. More specifically, electrodermal activity (EDA) and skin temperature (ST) signals from WESAD were used in order to train three traditional machine learning classifiers and a simple feed forward deep learning artificial neural network combining continues variables and entity embeddings. Regarding the binary classification problem (stress vs. no stress), high accuracy (up to 97.4%), for both training approaches (deep-learning, machine learning), was achieved. Regarding the stress detection effectiveness of the created models in another context, such as user experience (UX) evaluation, the results were quite impressive. More specifically, the deep-learning model achieved a rather high agreement when a user-annotated dataset was used for validation.

Automatic construction of academic profile: A case of information science domain

2021 ◽  
pp. 016555152199804
Author(s):  
Qian Geng ◽  
Ziang Chuai ◽  
Jian Jin
Keyword(s):  
Information Science ◽  
Binary Classification ◽  
Learning To Rank ◽  
Semantic Distance ◽  
Background Information ◽  
Training Dataset ◽  
Initial Vector ◽  
Specific Domain ◽  
Adaboost Algorithm ◽  
Domain Specific

To provide junior researchers with domain-specific concepts efficiently, an automatic approach for academic profiling is needed. First, to obtain personal records of a given scholar, typical supervised approaches often utilise structured data like infobox in Wikipedia as training dataset, but it may lead to a severe mis-labelling problem when they are utilised to train a model directly. To address this problem, a new relation embedding method is proposed for fine-grained entity typing, in which the initial vector of entities and a new penalty scheme are considered, based on the semantic distance of entities and relations. Also, to highlight critical concepts relevant to renowned scholars, scholars’ selective bibliographies which contain massive academic terms are analysed by a newly proposed extraction method based on logistic regression, AdaBoost algorithm and learning-to-rank techniques. It bridges the gap that conventional supervised methods only return binary classification results and fail to help researchers understand the relative importance of selected concepts. Categories of experiments on academic profiling and corresponding benchmark datasets demonstrate that proposed approaches outperform existing methods notably. The proposed techniques provide an automatic way for junior researchers to obtain organised knowledge in a specific domain, including scholars’ background information and domain-specific concepts.

scholarly journals Confidence interval for micro-averaged F1 and macro-averaged F1 scores

2021 ◽  
Author(s):  
Kanae Takahashi ◽  
Kouji Yamamoto ◽  
Aya Kuchiba ◽  
Tatsuki Koyama
Keyword(s):  
Binary Classification ◽  
Classification Problem ◽  
Classification Problems ◽  
Summary Measure ◽  
Medical Field ◽  
Predictive Values ◽  
Binary Classification Problem ◽  
Multi Class Classification ◽  
Sensitivity Specificity ◽  
Measures Of Performance

AbstractA binary classification problem is common in medical field, and we often use sensitivity, specificity, accuracy, negative and positive predictive values as measures of performance of a binary predictor. In computer science, a classifier is usually evaluated with precision (positive predictive value) and recall (sensitivity). As a single summary measure of a classifier’s performance, F1 score, defined as the harmonic mean of precision and recall, is widely used in the context of information retrieval and information extraction evaluation since it possesses favorable characteristics, especially when the prevalence is low. Some statistical methods for inference have been developed for the F1 score in binary classification problems; however, they have not been extended to the problem of multi-class classification. There are three types of F1 scores, and statistical properties of these F1 scores have hardly ever been discussed. We propose methods based on the large sample multivariate central limit theorem for estimating F1 scores with confidence intervals.

scholarly journals Understanding Smartwatch Battery Utilization in the Wild

Sensors ◽  
2020 ◽  
Vol 20 (13) ◽  
pp. 3784 ◽  
Author(s):  
Morteza Homayounfar ◽  
Amirhossein Malekijoo ◽  
Aku Visuri ◽  
Chelsea Dobbins ◽  
Ella Peltonen ◽  
...  
Keyword(s):  
Real World ◽  
Binary Classification ◽  
Classification Problem ◽  
Machine Learning Algorithms ◽  
Indexing Method ◽  
In The Wild ◽  
Art Research ◽  
Battery Discharge ◽  
Changes Over Time ◽  
Application Developers

Smartwatch battery limitations are one of the biggest hurdles to their acceptability in the consumer market. To our knowledge, despite promising studies analyzing smartwatch battery data, there has been little research that has analyzed the battery usage of a diverse set of smartwatches in a real-world setting. To address this challenge, this paper utilizes a smartwatch dataset collected from 832 real-world users, including different smartwatch brands and geographic locations. First, we employ clustering to identify common patterns of smartwatch battery utilization; second, we introduce a transparent low-parameter convolutional neural network model, which allows us to identify the latent patterns of smartwatch battery utilization. Our model converts the battery consumption rate into a binary classification problem; i.e., low and high consumption. Our model has 85.3% accuracy in predicting high battery discharge events, outperforming other machine learning algorithms that have been used in state-of-the-art research. Besides this, it can be used to extract information from filters of our deep learning model, based on learned filters of the feature extractor, which is impossible for other models. Third, we introduce an indexing method that includes a longitudinal study to quantify smartwatch battery quality changes over time. Our novel findings can assist device manufacturers, vendors and application developers, as well as end-users, to improve smartwatch battery utilization.

scholarly journals Deep Learning for Laryngopharyngeal Reflux Diagnosis

2021 ◽  
Vol 11 (11) ◽  
pp. 4753
Author(s):  
Gen Ye ◽  
Chen Du ◽  
Tong Lin ◽  
Yan Yan ◽  
Jack Jiang
Keyword(s):  
Deep Learning ◽  
Speech Processing ◽  
Data Augmentation ◽  
Laryngopharyngeal Reflux ◽  
Ph Monitoring ◽  
Binary Classification ◽  
Classification Problem ◽  
Learning Approaches ◽  
Learning Techniques ◽  
Auc Value

(1) Background: Deep learning has become ubiquitous due to its impressive performance in various domains, such as varied as computer vision, natural language and speech processing, and game-playing. In this work, we investigated the performance of recent deep learning approaches on the laryngopharyngeal reflux (LPR) diagnosis task. (2) Methods: Our dataset is composed of 114 subjects with 37 pH-positive cases and 77 control cases. In contrast to prior work based on either reflux finding score (RFS) or pH monitoring, we directly take laryngoscope images as inputs to neural networks, as laryngoscopy is the most common and simple diagnostic method. The diagnosis task is formulated as a binary classification problem. We first tested a powerful backbone network that incorporates residual modules, attention mechanism and data augmentation. Furthermore, recent methods in transfer learning and few-shot learning were investigated. (3) Results: On our dataset, the performance is the best test classification accuracy is 73.4%, while the best AUC value is 76.2%. (4) Conclusions: This study demonstrates that deep learning techniques can be applied to classify LPR images automatically. Although the number of pH-positive images used for training is limited, deep network can still be capable of learning discriminant features with the advantage of technique.

Sign in / Sign up

Export Citation Format

Share Document