scholarly journals Watching a Small Portion could be as Good as Watching All: Towards Efficient Video Classification

2018 ◽  
Author(s):  
Hehe Fan ◽  
Zhongwen Xu ◽  
Linchao Zhu ◽  
Chenggang Yan ◽  
Jianjun Ge ◽  
...  
Keyword(s):  
Large Scale ◽  
Sampling Rate ◽  
Computational Cost ◽  
Confidence Score ◽  
Video Content ◽  
Video Classification ◽  
Video Frames ◽  
Similar Accuracy ◽  
Efficient Video

We aim to significantly reduce the computational cost for classification of temporally untrimmed videos while retaining similar accuracy. Existing video classification methods sample frames with a predefined frequency over entire video. Differently, we propose an end-to-end deep reinforcement approach which enables an agent to classify videos by watching a very small portion of frames like what we do. We make two main contributions. First, information is not equally distributed in video frames along time. An agent needs to watch more carefully when a clip is informative and skip the frames if they are redundant or irrelevant. The proposed approach enables the agent to adapt sampling rate to video content and skip most of the frames without the loss of information. Second, in order to have a confident decision, the number of frames that should be watched by an agent varies greatly from one video to another. We incorporate an adaptive stop network to measure confidence score and generate timely trigger to stop the agent watching videos, which improves efficiency without loss of accuracy. Our approach reduces the computational cost significantly for the large-scale YouTube-8M dataset, while the accuracy remains the same.

scholarly journals Classification of Tennis Video Types Based on Machine Learning Technology

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Xun Gong ◽  
Fucheng Wang
Keyword(s):  
Machine Learning ◽  
Large Scale ◽  
Rapid Development ◽  
Video Data ◽  
Learning Technology ◽  
Video Content ◽  
Video Classification ◽  
The World ◽  
Spatial Detection

With the rapid development of online video data, how to find the required information has become an urgent problem to be solved. This article focuses on sports videos and studies video classification and content-based retrieval techniques. Its purpose is to establish a mark and index of video content and to promote user acquisition through computer processing, analysis, and understanding of video content. Video tennis classification has high research and application value. This article focuses on video tennis based on the selection of the basic frame of each shot and proposes an algorithm for classification of shots based on average grouping. Based on this, we use a color-coded spatial detection method to detect the type of tennis match. Then, it integrates the results of audiovisual analysis to identify and classify exciting events in tennis matches. According to statistics, although the number of people participating in tennis cannot enter the top ten, the number of spectators ranks fourth. Four tennis tournaments, masters, and crown tournaments are held every year around the world. Watching large-scale international tennis matches has become a pillar of leisure and vacation for many people. Tennis matches last from two hours to four hours or more, and there are countless large and small tennis matches around the world every year, so the number of tennis records created is staggering. And artificial intelligence technology is rarely used in tennis in the sports world (5%), but football has reached 50%. Therefore, when dealing with such a large amount of data, we urgently need to find a fast and effective video retrieval classification method to find the required information. The experiment of tennis video classification research based on machine learning technology proves that the accuracy of tennis video classification reaches 98%, so this system has high feasibility.

scholarly journals Hallucinating Optical Flow Features for Video Classification

2019 ◽  
Author(s):  
Yongyi Tang ◽  
Lin Ma ◽  
Lianqiang Zhou
Keyword(s):  
Optical Flow ◽  
Data Storage ◽  
Large Scale ◽  
State Of The Art ◽  
Video Content ◽  
Video Classification ◽  
Temporal Relationships ◽  
Optical Flow Computation ◽  
Flow Features ◽  
Optical Flow Features

Appearance and motion are two key components to depict and characterize the video content. Currently, the two-stream models have achieved state-of-the-art performances on video classification. However, extracting motion information, specifically in the form of optical flow features, is extremely computationally expensive, especially for large-scale video classification. In this paper, we propose a motion hallucination network, namely MoNet, to imagine the optical flow features from the appearance features, with no reliance on the optical flow computation. Specifically, MoNet models the temporal relationships of the appearance features and exploits the contextual relationships of the optical flow features with concurrent connections. Extensive experimental results demonstrate that the proposed MoNet can effectively and efficiently hallucinate the optical flow features, which together with the appearance features consistently improve the video classification performances. Moreover, MoNet can help cutting down almost a half of computational and data-storage burdens for the two-stream video classification. Our code is available at: https://github.com/YongyiTang92/MoNet-Features

scholarly journals FASTER Recurrent Networks for Efficient Video Classification

2020 ◽  
Vol 34 (07) ◽  
pp. 13098-13105 ◽  
Author(s):  
Linchao Zhu ◽  
Du Tran ◽  
Laura Sevilla-Lara ◽  
Yi Yang ◽  
Matt Feiszli ◽  
...  
Keyword(s):  
Video Sequence ◽  
State Of The Art ◽  
Temporal Structure ◽  
Computational Cost ◽  
Recurrent Network ◽  
Recurrent Networks ◽  
Video Classification ◽  
Spatio Temporal ◽  
Temporal Redundancy ◽  
Efficient Video

Typical video classification methods often divide a video into short clips, do inference on each clip independently, then aggregate the clip-level predictions to generate the video-level results. However, processing visually similar clips independently ignores the temporal structure of the video sequence, and increases the computational cost at inference time. In this paper, we propose a novel framework named FASTER, i.e., Feature Aggregation for Spatio-TEmporal Redundancy. FASTER aims to leverage the redundancy between neighboring clips and reduce the computational cost by learning to aggregate the predictions from models of different complexities. The FASTER framework can integrate high quality representations from expensive models to capture subtle motion information and lightweight representations from cheap models to cover scene changes in the video. A new recurrent network (i.e., FAST-GRU) is designed to aggregate the mixture of different representations. Compared with existing approaches, FASTER can reduce the FLOPs by over 10× while maintaining the state-of-the-art accuracy across popular datasets, such as Kinetics, UCF-101 and HMDB-51.

Classification of woody-shrub vegetation of the forest-steppe complex of Privolzhskaya Upland

2009 ◽  
pp. 27-53
Author(s):  
A. Yu. Kudryavtsev
Keyword(s):  
Plant Community ◽  
Plant Communities ◽  
Dominant Species ◽  
Large Scale ◽  
Nature Reserve ◽  
Vegetation Mapping ◽  
Vegetation Classification ◽  
Forest Steppe ◽  
Mapping Data

Diversity of plant communities in the nature reserve “Privolzhskaya Forest-Steppe”, Ostrovtsovsky area, is analyzed on the basis of the large-scale vegetation mapping data from 2000. The plant community classi­fication based on the Russian ecologic-phytocoenotic approach is carried out. 12 plant formations and 21 associations are distinguished according to dominant species and a combination of ecologic-phytocoenotic groups of species. A list of vegetation classification units as well as the characteristics of theshrub and woody communities are given in this paper.

Classification of vegetation in Cucphuong National Park with the aim of large-scale mapping, Vietnam

1996 ◽  
pp. 64-67 ◽  
Author(s):  
Nguen Nghia Thin ◽  
Nguen Ba Thu ◽  
Tran Van Thuy
Keyword(s):  
National Park ◽  
Large Scale ◽  
Satellite Images ◽  
Field Work ◽  
Aerial Photographs ◽  
Vegetation Map ◽  
Dense Forest ◽  
Broad Leaved Forest ◽  
Leaved Forest

The tropical seasonal rainy evergreen broad-leaved forest vegetation of the Cucphoung National Park has been classified and the distribution of plant communities has been shown on the map using the relations of vegetation to geology, geomorphology and pedology. The method of vegetation mapping includes: 1) the identifying of vegetation types in the remote-sensed materials (aerial photographs and satellite images); 2) field work to compile the interpretation keys and to characterize all the communities of a study area; 3) compilation of the final vegetation map using the combined information. In the classification presented a number of different level vegetation units have been identified: formation classes (3), formation sub-classes (3), formation groups (3), formations (4), subformations (10) and communities (19). Communities have been taken as mapping units. So in the vegetation map of the National Park 19 vegetation categories has been shown altogether, among them 13 are natural primary communities, and 6 are the secondary, anthropogenic ones. The secondary succession goes through 3 main stages: grassland herbaceous xerophytic vegetation, xerophytic scrub, dense forest.

The Swiss Prison Study (SWIPS): Protocol for Establishing a Public Health Registry of Prisoners in Switzerland (Preprint)

2020 ◽  
Author(s):  
Thomas Gaisl ◽  
Naser Musli ◽  
Patrick Baumgartner ◽  
Marc Meier ◽  
Silvana K Rampini ◽  
...  
Keyword(s):  
Public Health ◽  
Medical History ◽  
Large Scale ◽  
International Classification Of Diseases ◽  
Disease Prevalence ◽  
Vulnerable Population ◽  
International Classification ◽  
Classification Of Diseases ◽  
Health Registry

BACKGROUND The health aspects, disease frequencies, and specific health interests of prisoners and refugees are poorly understood. Importantly, access to the health care system is limited for this vulnerable population. There has been no systematic investigation to understand the health issues of inmates in Switzerland. Furthermore, little is known on how recent migration flows in Europe may have affected the health conditions of inmates. OBJECTIVE The Swiss Prison Study (SWIPS) is a large-scale observational study with the aim of establishing a public health registry in northern-central Switzerland. The primary objective is to establish a central database to assess disease prevalence (ie, International Classification of Diseases-10 codes [German modification]) among prisoners. The secondary objectives include the following: (1) to compare the 2015 versus 2020 disease prevalence among inmates against a representative sample from the local resident population, (2) to assess longitudinal changes in disease prevalence from 2015 to 2020 by using cross-sectional medical records from all inmates at the Police Prison Zurich, Switzerland, and (3) to identify unrecognized health problems to prepare successful public health strategies. METHODS Demographic and health-related data such as age, sex, country of origin, duration of imprisonment, medication (including the drug name, brand, dosage, and release), and medical history (including the International Classification of Diseases-10 codes [German modification] for all diagnoses and external results that are part of the medical history in the prison) have been deposited in a central register over a span of 5 years (January 2015 to August 2020). The final cohort is expected to comprise approximately 50,000 to 60,000 prisoners from the Police Prison Zurich, Switzerland. RESULTS This study was approved on August 5, 2019 by the ethical committee of the Canton of Zurich with the registration code KEK-ZH No. 2019-01055 and funded in August 2020 by the “Walter and Gertrud Siegenthaler” foundation and the “Theodor and Ida Herzog-Egli” foundation. This study is registered with the International Standard Randomized Controlled Trial Number registry. Data collection started in August 2019 and results are expected to be published in 2021. Findings will be disseminated through scientific papers as well as presentations and public events. CONCLUSIONS This study will construct a valuable database of information regarding the health of inmates and refugees in Swiss prisons and will act as groundwork for future interventions in this vulnerable population. CLINICALTRIAL ISRCTN registry ISRCTN11714665; http://www.isrctn.com/ISRCTN11714665 INTERNATIONAL REGISTERED REPORT DERR1-10.2196/23973

Deep Learning-Based Classification of Large-Scale Airborne LiDAR Point Cloud

2021 ◽  
pp. 1-15
Author(s):  
Mathieu Turgeon-Pelchat ◽  
Samuel Foucher ◽  
Yacine Bouroubi
Keyword(s):  
Deep Learning ◽  
Point Cloud ◽  
Large Scale ◽  
Airborne Lidar

scholarly journals Uncertainty-Aware Deep Learning-Based Cardiac Arrhythmias Classification Model of Electrocardiogram Signals

Computers ◽  
2021 ◽  
Vol 10 (6) ◽  
pp. 82
Author(s):  
Ahmad O. Aseeri
Keyword(s):  
Deep Learning ◽  
Cardiac Arrhythmias ◽  
Large Scale ◽  
Clinical Decision Making ◽  
Probabilistic Approach ◽  
Classification Model ◽  
Gating Mechanism ◽  
Uncertainty Estimates ◽  
Wide Range

Deep Learning-based methods have emerged to be one of the most effective and practical solutions in a wide range of medical problems, including the diagnosis of cardiac arrhythmias. A critical step to a precocious diagnosis in many heart dysfunctions diseases starts with the accurate detection and classification of cardiac arrhythmias, which can be achieved via electrocardiograms (ECGs). Motivated by the desire to enhance conventional clinical methods in diagnosing cardiac arrhythmias, we introduce an uncertainty-aware deep learning-based predictive model design for accurate large-scale classification of cardiac arrhythmias successfully trained and evaluated using three benchmark medical datasets. In addition, considering that the quantification of uncertainty estimates is vital for clinical decision-making, our method incorporates a probabilistic approach to capture the model’s uncertainty using a Bayesian-based approximation method without introducing additional parameters or significant changes to the network’s architecture. Although many arrhythmias classification solutions with various ECG feature engineering techniques have been reported in the literature, the introduced AI-based probabilistic-enabled method in this paper outperforms the results of existing methods in outstanding multiclass classification results that manifest F1 scores of 98.62% and 96.73% with (MIT-BIH) dataset of 20 annotations, and 99.23% and 96.94% with (INCART) dataset of eight annotations, and 97.25% and 96.73% with (BIDMC) dataset of six annotations, for the deep ensemble and probabilistic mode, respectively. We demonstrate our method’s high-performing and statistical reliability results in numerical experiments on the language modeling using the gating mechanism of Recurrent Neural Networks.

scholarly journals Research on Methods of Parsing and Classification of Internet Super Large-scale Texts

2021 ◽  
Vol 1757 (1) ◽  
pp. 012121
Author(s):  
Mengting Song ◽  
Hang Zheng ◽  
Zhen Tao ◽  
Jia Jiang ◽  
Bin Pan
Keyword(s):  
Large Scale

scholarly journals Renormalization group theory of molecular dynamics

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Daiji Ichishima ◽  
Yuya Matsumura
Keyword(s):  
Molecular Dynamics ◽  
Renormalization Group ◽  
Critical Exponent ◽  
Computational Efficiency ◽  
Large Scale ◽  
Dissipative Particle Dynamics ◽  
Computational Cost ◽  
Coarse Graining ◽  
Spatial Dimension ◽  
Deborah Number

AbstractLarge scale computation by molecular dynamics (MD) method is often challenging or even impractical due to its computational cost, in spite of its wide applications in a variety of fields. Although the recent advancement in parallel computing and introduction of coarse-graining methods have enabled large scale calculations, macroscopic analyses are still not realizable. Here, we present renormalized molecular dynamics (RMD), a renormalization group of MD in thermal equilibrium derived by using the Migdal–Kadanoff approximation. The RMD method improves the computational efficiency drastically while retaining the advantage of MD. The computational efficiency is improved by a factor of $$2^{n(D+1)}$$ 2 n ( D + 1 ) over conventional MD where D is the spatial dimension and n is the number of applied renormalization transforms. We verify RMD by conducting two simulations; melting of an aluminum slab and collision of aluminum spheres. Both problems show that the expectation values of physical quantities are in good agreement after the renormalization, whereas the consumption time is reduced as expected. To observe behavior of RMD near the critical point, the critical exponent of the Lennard-Jones potential is extracted by calculating specific heat on the mesoscale. The critical exponent is obtained as $$\nu =0.63\pm 0.01$$ ν = 0.63 ± 0.01 . In addition, the renormalization group of dissipative particle dynamics (DPD) is derived. Renormalized DPD is equivalent to RMD in isothermal systems under the condition such that Deborah number $$De\ll 1$$ D e ≪ 1 .

Sign in / Sign up

Export Citation Format

Share Document