scholarly journals Research on fine tuning parameter insulator identification based on YOLOV4 algorithm

2021 ◽  
Vol 2121 (1) ◽  
pp. 012041
Author(s):  
Meng Wang ◽  
Yuan Sun ◽  
Feize Xia
Keyword(s):  
Virtual Machine ◽  
Large Data ◽  
Fine Tuning ◽  
Tuning Parameter ◽  
Detection Accuracy ◽  
Aerial Photo ◽  
Data Set ◽  
Training Time ◽  
Tuning Parameters ◽  
Network Time

Abstract Aiming at the problem that the training network time of YOLOV4 algorithm is too long due to the large data set of aerial insulator images, a method based on YOLOV4 algorithm is proposed to shorten the training time by fine-tuning parameters without affecting the positioning detection accuracy. Based on the development of UBANTU virtual machine, through CUDA and CUDNN environment configuration, and through the detection and verification of insulator aerial photo data set, the feasibility of accurate positioning of insulators under the condition of fine tuning parameters of YOLOV4 algorithm is successfully proved.

Some statistical and CI models to predict chaotic high-frequency financial data

2020 ◽  
Vol 39 (5) ◽  
pp. 6419-6430
Author(s):  
Dusan Marcek
Keyword(s):  
Time Series Data ◽  
Moving Average ◽  
Methodological Approach ◽  
Back Propagation ◽  
Large Data ◽  
Series Data ◽  
Data Set ◽  
Training Time ◽  
Optimal Population ◽  
Forecast Time

To forecast time series data, two methodological frameworks of statistical and computational intelligence modelling are considered. The statistical methodological approach is based on the theory of invertible ARIMA (Auto-Regressive Integrated Moving Average) models with Maximum Likelihood (ML) estimating method. As a competitive tool to statistical forecasting models, we use the popular classic neural network (NN) of perceptron type. To train NN, the Back-Propagation (BP) algorithm and heuristics like genetic and micro-genetic algorithm (GA and MGA) are implemented on the large data set. A comparative analysis of selected learning methods is performed and evaluated. From performed experiments we find that the optimal population size will likely be 20 with the lowest training time from all NN trained by the evolutionary algorithms, while the prediction accuracy level is lesser, but still acceptable by managers.

scholarly journals Selectively Connected Self-Attentions for Semantic Role Labeling

2019 ◽  
Vol 9 (8) ◽  
pp. 1716
Author(s):  
Jaehui Park
Keyword(s):  
Neural Networks ◽  
Deep Neural Networks ◽  
State Of The Art ◽  
Hierarchical Structures ◽  
Large Data ◽  
Neural Model ◽  
Semantic Role ◽  
Semantic Role Labeling ◽  
Data Set ◽  
Training Time

Semantic role labeling is an effective approach to understand underlying meanings associated with word relationships in natural language sentences. Recent studies using deep neural networks, specifically, recurrent neural networks, have significantly improved traditional shallow models. However, due to the limitation of recurrent updates, they require long training time over a large data set. Moreover, they could not capture the hierarchical structures of languages. We propose a novel deep neural model, providing selective connections among attentive representations, which remove the recurrent updates, for semantic role labeling. Experimental results show that our model performs better in accuracy compared to the state-of-the-art studies. Our model achieves 86.6 F1 scores and 83.6 F1 scores on the CoNLL 2005 and CoNLL 2012 shared tasks, respectively. The accuracy gains are improved by capturing the hierarchical information using the connection module. Moreover, we show that our model can be parallelized to avoid the repetitive updates of the model. As a result, our model reduces the training time by 62 percentages from the baseline.

Fitting with differential evolution: an introduction and evaluation

2011 ◽  
Vol 44 (6) ◽  
pp. 1198-1204 ◽  
Author(s):  
Matts Björck
Keyword(s):  
Differential Evolution ◽  
Tuning Parameter ◽  
Scattering Problems ◽  
Data Set ◽  
Tuning Parameters ◽  
Order Of Magnitude ◽  
Evolution Algorithms ◽  
Reflectivity Data ◽  
Differential Evolution Algorithms ◽  
Parameter Values

Differential evolution is a global optimization algorithm that has started to find widespread use in the scattering community because of its proven effectiveness. In this article the performance of the algorithm is evaluated by fitting an X-ray reflectivity data set and investigating its convergence behavior as a function of its tuning parameters. The results offer important insights for applying differential evolution algorithms to scattering problems and provide some rules of thumb on how to tune the parameters. It is shown that, by choosing optimal tuning parameter values, the speed of the fitting process can be increased by an order of magnitude.

scholarly journals Low Shot Box Correction for Weakly Supervised Object Detection

2019 ◽  
Author(s):  
Tianxiang Pan ◽  
Bin Wang ◽  
Guiguang Ding ◽  
Jungong Han ◽  
Junhai Yong
Keyword(s):  
Object Detection ◽  
Large Data ◽  
Detection Accuracy ◽  
Detection Problem ◽  
Data Set ◽  
Supervised Methods ◽  
Weakly Supervised ◽  
Bounding Boxes ◽  
State Of Art ◽  
Discriminative Parts

Weakly supervised object detection (WSOD) has been widely studied but the accuracy of state-of-art methods remains far lower than strongly supervised methods. One major reason for this huge gap is the incomplete box detection problem which arises because most previous WSOD models are structured on classification networks and therefore tend to recognize the most discriminative parts instead of complete bounding boxes. To solve this problem, we define a low-shot weakly supervised object detection task and propose a novel low-shot box correction network to address it. The proposed task enables to train object detectors on a large data set all of which have image-level annotations, but only a small portion or few shots have box annotations. Given the low-shot box annotations, we use a novel box correction network to transfer the incomplete boxes into complete ones. Extensive empirical evidence shows that our proposed method yields state-of-art detection accuracy under various settings on the PASCAL VOC benchmark.

scholarly journals Object Detection with the Addition of New Classes Based on the Method of RNOL

2020 ◽  
Vol 2020 ◽  
pp. 1-6
Author(s):  
Haiquan Fang ◽  
Feijia Zhu
Keyword(s):  
Object Detection ◽  
State Of The Art ◽  
Fine Tuning ◽  
Detection Methods ◽  
Detection Accuracy ◽  
Important Research ◽  
Training Time ◽  
Tuning Method ◽  
High Detection ◽  
Computer Vision Applications

Object detection plays an important role in many computer vision applications. Innovative object detection methods based on deep learning such as Faster R-CNN, YOLO, and SSD have achieved state-of the-art results in terms of detection accuracy. There have been few studies to date on object detection with the addition of new classes, however, though this problem is often encountered in the industry. Therefore, this issue has important research significance and practical value. On the premise that the old class samples are available, a method of reserving nodes in advance in the output layer (RNOL) was established in this study. Experiments show that RNOL can achieve high detection accuracy in both new and old classes over a short training time while outperforming the traditional fine-tuning method.

In silico Prediction of Inhibitory Constant of Thrombin Inhibitors Using Machine Learning

2019 ◽  
Vol 21 (9) ◽  
pp. 662-669 ◽  
Author(s):  
Junnan Zhao ◽  
Lu Zhu ◽  
Weineng Zhou ◽  
Lingfeng Yin ◽  
Yuchen Wang ◽  
...  
Keyword(s):  
Machine Learning ◽  
Prediction Models ◽  
Regression Tree ◽  
Large Data ◽  
Thrombin Inhibitors ◽  
Coagulation Cascade ◽  
Gradient Boosting ◽  
Support Vector ◽  
Data Set ◽  
Descriptor Selection

Background: Thrombin is the central protease of the vertebrate blood coagulation cascade, which is closely related to cardiovascular diseases. The inhibitory constant Ki is the most significant property of thrombin inhibitors. Method: This study was carried out to predict Ki values of thrombin inhibitors based on a large data set by using machine learning methods. Taking advantage of finding non-intuitive regularities on high-dimensional datasets, machine learning can be used to build effective predictive models. A total of 6554 descriptors for each compound were collected and an efficient descriptor selection method was chosen to find the appropriate descriptors. Four different methods including multiple linear regression (MLR), K Nearest Neighbors (KNN), Gradient Boosting Regression Tree (GBRT) and Support Vector Machine (SVM) were implemented to build prediction models with these selected descriptors. Results: The SVM model was the best one among these methods with R2=0.84, MSE=0.55 for the training set and R2=0.83, MSE=0.56 for the test set. Several validation methods such as yrandomization test and applicability domain evaluation, were adopted to assess the robustness and generalization ability of the model. The final model shows excellent stability and predictive ability and can be employed for rapid estimation of the inhibitory constant, which is full of help for designing novel thrombin inhibitors.

scholarly journals Correlation between the structure and skin permeability of compounds

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Ruolan Zeng ◽  
Jiyong Deng ◽  
Limin Dang ◽  
Xinliang Yu
Keyword(s):  
Large Data ◽  
Qsar Model ◽  
Coefficient Of Determination ◽  
Support Vector ◽  
Skin Permeability ◽  
Data Set ◽  
Test Set ◽  
Svm Algorithm ◽  
Svm Model ◽  
Toxicity Relationship

AbstractA three-descriptor quantitative structure–activity/toxicity relationship (QSAR/QSTR) model was developed for the skin permeability of a sufficiently large data set consisting of 274 compounds, by applying support vector machine (SVM) together with genetic algorithm. The optimal SVM model possesses the coefficient of determination R2 of 0.946 and root mean square (rms) error of 0.253 for the training set of 139 compounds; and a R2 of 0.872 and rms of 0.302 for the test set of 135 compounds. Compared with other models reported in the literature, our SVM model shows better statistical performance in a model that deals with more samples in the test set. Therefore, applying a SVM algorithm to develop a nonlinear QSAR model for skin permeability was achieved.

scholarly journals Implementation of a Modified Faster R-CNN for Target Detection Technology of Coastal Defense Radar

2021 ◽  
Vol 13 (9) ◽  
pp. 1703
Author(s):  
He Yan ◽  
Chao Chen ◽  
Guodong Jin ◽  
Jindong Zhang ◽  
Xudong Wang ◽  
...  
Keyword(s):  
False Alarm ◽  
False Alarm Rate ◽  
Target Detection ◽  
Real Data ◽  
Detection Performance ◽  
Detection Accuracy ◽  
Constant False Alarm Rate ◽  
Data Set ◽  
Detection Technology ◽  
Coastal Defense

The traditional method of constant false-alarm rate detection is based on the assumption of an echo statistical model. The target recognition accuracy rate and the high false-alarm rate under the background of sea clutter and other interferences are very low. Therefore, computer vision technology is widely discussed to improve the detection performance. However, the majority of studies have focused on the synthetic aperture radar because of its high resolution. For the defense radar, the detection performance is not satisfactory because of its low resolution. To this end, we herein propose a novel target detection method for the coastal defense radar based on faster region-based convolutional neural network (Faster R-CNN). The main processing steps are as follows: (1) the Faster R-CNN is selected as the sea-surface target detector because of its high target detection accuracy; (2) a modified Faster R-CNN based on the characteristics of sparsity and small target size in the data set is employed; and (3) soft non-maximum suppression is exploited to eliminate the possible overlapped detection boxes. Furthermore, detailed comparative experiments based on a real data set of coastal defense radar are performed. The mean average precision of the proposed method is improved by 10.86% compared with that of the original Faster R-CNN.

scholarly journals Galaxy spin direction distribution in HST and SDSS show similar large-scale asymmetry

2020 ◽  
Vol 37 ◽  
Author(s):  
Lior Shamir
Keyword(s):  
Large Scale ◽  
Spiral Galaxies ◽  
Hubble Space Telescope ◽  
Gravitational Interaction ◽  
Large Data ◽  
Sloan Digital Sky Survey ◽  
Data Sets ◽  
Dipole Axis ◽  
Data Set ◽  
The Asymmetry

Abstract Several recent observations using large data sets of galaxies showed non-random distribution of the spin directions of spiral galaxies, even when the galaxies are too far from each other to have gravitational interaction. Here, a data set of $\sim8.7\cdot10^3$ spiral galaxies imaged by Hubble Space Telescope (HST) is used to test and profile a possible asymmetry between galaxy spin directions. The asymmetry between galaxies with opposite spin directions is compared to the asymmetry of galaxies from the Sloan Digital Sky Survey. The two data sets contain different galaxies at different redshift ranges, and each data set was annotated using a different annotation method. The results show that both data sets show a similar asymmetry in the COSMOS field, which is covered by both telescopes. Fitting the asymmetry of the galaxies to cosine dependence shows a dipole axis with probabilities of $\sim2.8\sigma$ and $\sim7.38\sigma$ in HST and SDSS, respectively. The most likely dipole axis identified in the HST galaxies is at $(\alpha=78^{\rm o},\delta=47^{\rm o})$ and is well within the $1\sigma$ error range compared to the location of the most likely dipole axis in the SDSS galaxies with $z>0.15$ , identified at $(\alpha=71^{\rm o},\delta=61^{\rm o})$ .

scholarly journals The Complete DNA Sequence of the Mitochondrial Genome of a “Living Fossil,” the Coelacanth (Latimeria chalumnae)

Genetics ◽  
1997 ◽  
Vol 146 (3) ◽  
pp. 995-1010 ◽  
Author(s):  
Rafael Zardoya ◽  
Axel Meyer
Keyword(s):  
Mitochondrial Genome ◽  
Tandem Repeats ◽  
Phylogenetic Analyses ◽  
Large Data ◽  
Molecular Data ◽  
Phylogenetic Position ◽  
Data Set ◽  
Living Fossil ◽  
Latimeria Chalumnae ◽  
Relationship Of

The complete nucleotide sequence of the 16,407-bp mitochondrial genome of the coelacanth (Latimeria chalumnae) was determined. The coelacanth mitochondrial genome order is identical to the consensus vertebrate gene order which is also found in all ray-finned fishes, the lungfish, and most tetrapods. Base composition and codon usage also conform to typical vertebrate patterns. The entire mitochondrial genome was PCR-amplified with 24 sets of primers that are expected to amplify homologous regions in other related vertebrate species. Analyses of the control region of the coelacanth mitochondrial genome revealed the existence of four 22-bp tandem repeats close to its 3′ end. The phylogenetic analyses of a large data set combining genes coding for rRNAs, tRNA, and proteins (16,140 characters) confirmed the phylogenetic position of the coelacanth as a lobe-finned fish; it is more closely related to tetrapods than to ray-finned fishes. However, different phylogenetic methods applied to this largest available molecular data set were unable to resolve unambiguously the relationship of the coelacanth to the two other groups of extant lobe-finned fishes, the lungfishes and the tetrapods. Maximum parsimony favored a lungfish/coelacanth or a lungfish/tetrapod sistergroup relationship depending on which transversion:transition weighting is assumed. Neighbor-joining and maximum likelihood supported a lungfish/tetrapod sistergroup relationship.

Sign in / Sign up

Export Citation Format

Share Document