Many studies in the current literature annotate patterns in stock prices and use computer vision models to learn and recognize these patterns from stock price-action chart images. Additionally, current literature also use Long Short-Term Memory Networks to predict prices from continuous dollar amount data. In this study, we combine the two techniques. We annotate the consolidation breakouts for a given stock price data, and we use continuous stock price data to predict consolidation breakouts. Unlike computer vision models that look at the image of a stock price action, we explore using the convolution operation on raw dollar values to predict consolidation breakouts under a supervised learning problem setting. Unlike LSTMs that predict stock prices given continuous stock data, we use the continuous stock data to classify a given price window as breakout or not. Finally, we do a regularization study to see the effect of L₁, L₂, and Elastic Net regularization. We hope that combining regression and classification shed more light on stock market prediction studies.

Development of rovers and development of infrastructure which enables them to probe other planets (such as Mars) have sparked a lot of interest recently specially with increasing public attention in Moon and Mars program by National Aeronautics and Space Administration. This is designed to be achieved by various means such as advanced spectroscopy and artificial intelligent techniques such as deep learning and transfer learning to enable the rover to not only map the surface of planet but to get a detailed information about its chemical makeup in layers beneath (deep learning) and in areas around point of observation (transfer learning). In this work, which is part of a proposal, later approach is explored. A systematic strategy is presented which make use of aforementioned techniques developed for metallic glass matrix composites as benchmark and helps develop algorithms for chemistry mapping of actual Martian surface on Perseverance Rover launching shortly.

Multi-task Gaussian processes (MTGPs) are a powerful approach for modeling structured dependencies among multiple tasks. Researchers on MTGPs have contributed to enhance this approach in various ways. Current MTGP methods, however, cannot model nonlinear task correlations in a general way. In this paper we address this problem. We focus on spectral mixture (SM) based kernels and propose an enhancement of this type of kernels, called multi-task generalized convolution spectral mixture (MT-GCSM) kernel. The MT-GCSM kernel can model nonlinear task correlations and mixtures dependency, including time and phase delay, not only between different tasks but also within a task at the spectral mixture level. Each task in MT-GCSM has its own generalized convolution spectral mixture kernel (GCSM) with a different number of convolution structures and all spectral mixtures from different tasks are dependent. Furthermore, the proposed kernel uses inner and outer full cross convolution between base spectral mixtures, so that the base spectral mixtures in the tasks are not necessarily aligned. Extensive experiments on synthetic and real-life datasets illustrate the difference between MT-GCSM and other kernels as well as the practical effectiveness of MT-GCSM.

This paper introduces a fusion convolutional architecture for efficient learning of spatio-temporal features in video action recognition. Unlike 2D CNNs, 3D CNNs can be applied directly on consecutive frames to extract spatio-temporal features. The aim of this work is to fuse the convolution layers from 2D and 3D CNNs to allow temporal encoding with fewer parameters than 3D CNNs. We adopt transfer learning from pre-trained 2D CNNs for spatial extraction, followed by temporal encoding, before connecting to 3D convolution layers at the top of the architecture. We construct our fusion architecture, semi-CNN, based on three popular models: VGG-16, ResNets and DenseNets, and compare the performance with their corresponding 3D models. Our empirical results evaluated on the action recognition dataset UCF-101 demonstrate that our fusion of 1D, 2D and 3D convolutions outperforms its 3D model of the same depth, with fewer parameters and reduces overfitting. Our semi-CNN architecture achieved an average of 16 – 30% boost in the top-1 accuracy when evaluated on an input video of 16 frames.

The colossal depths of the deep neural network sometimes suffer from ineffective backpropagation of the gradients through all its depths. Whereas, The strong performance of shallower multilayer neural structures prove their ability to increase the gradient signals in the early stages of training which easily gets backpropagated for global loss corrections. Shallow neural structures are always a good starting point for encouraging the sturdy feature characteristics of the input. In this research, a shallow, deep neural structure called PrimeNet is proposed. PrimeNet is aimed to dynamically identify and encourage the quality visual indicators from the input to be used by the subsequent deep network layers and increase the gradient signals in the lower stages of the training pipeline. In addition to this, the layerwise training is performed with the help of locally generated errors which means the gradient is not backpropagated to previous layers, and the hidden layer weights are updated during the forward pass, making this structure a backpropagation free variant. PrimeNet has obtained state-of-the-art results on various image datasets, attaining the dual objective of (1) compact dynamic deep neural structure, which (2) eliminates the problem of backwards-locking. The PrimeNet unit is proposed as an alternative to traditional convolution and dense blocks for faster and memory-efficient training, outperforming previously reported results aimed at adaptive methods for parallel and multilayer deep neural systems.

A method of direction-of-arrival (DoA) estimation for FMCW radars is presented. In addition to MUSIC and ESPRIT, which are well-known high-resolution DoA estimation algorithms, deep learning has recently emerged as a very promising alternative. It is proposed in this paper to use a 3D convolutional neural network (CNN) for DoA estimation. The 3D-CNN extracts from the radar data cube spectrum features of the region of interest (RoI) centered on the potential positions of the targets, thereby capturing the spectrum phase shift information, which corresponds to DoA, along the antenna axis. Finally, the results of simulations and field experiments are provided to demonstrate the superior performance, as well as the limitations, of the proposed 3D-CNN.

In this paper, we propose a robust video understanding model for activity recognition by learning the actor’s pair-wise correlations and relational reasoning, exploiting spatial and temporal information. In order to measure the similarity between the pair appearances and construct an actor relations map, the Zero Mean Normalized Cross-Correlation (ZNCC) and the Zero Mean Sum of Absolute Differences(ZSAD) is proposed to allow the Graph Convolution Network (GCN) to learn how to distinguish group actions. We recommend that MNASNet be used as the backbone to retrieve features. Experiments show a 38.50% and 23.7% reduction in training time in the 2-stage training process along with a 1.52% improvement in accuracy against traditional methods.

The paper demonstrates the analysis of Corona Virus Disease based on a CNN probabilistic model. It involves a technique for classification and prediction by recognizing typical and diagnostically most important CT images features relating to Corona Virus. The main contributions of the research include predicting the probability of recurrences in no recurrence (first time detection) cases at applying our proposed Convolution neural network structure. The Study is validated on 2002 chest X-ray images with 60 confirmed positive covid19 cases and (650 bacterial – 412 viral -880 normal) x-ray images. The proposed CNN compared with traditional classifiers with proposed CHFS feature extraction model. The experimental study has done with real data demonstrates the feasibility and potential of the proposed approach for the said cause. The result of proposed CNN structure has been successfully done to achieve 98.20% accuracy of covid19 potential cases with comparable of traditional classifiers.

Alcoholism is attributed to regular or excessive drinking of alcohol and leads to the disturbance of the neuronal system in the human brain. This results in certain malfunctioning of neurons that can be detected by an electroencephalogram (EEG) using several electrodes on a human skull at appropriate positions. It is of great interest to be able to classify an EEG activity as that of a normal person or an alcoholic person using data from the minimum possible electrodes (or channels). Due to the complex nature of EEG signals, accurate classification of alcoholism using only a small data is a challenging task. Artificial neural networks, specifically convolutional neural networks (CNN), provide efficient and accurate results in various pattern-based classification problems. In this work, we apply CNN on raw EEG data, and demonstrate how we achieved 98% average accuracy by optimizing a baseline CNN model and outperforming its results in a range of performance evaluation metrics on the UCI-KDD EGG dataset. This article explains the step-wise improvement of the baseline model using the dropout, batch normalization, and kernel regularization techniques, and provides a comparison of the two models that can be beneficial for aspiring practitioners who aim to develop similar classification models in CNN. A performance comparison is also provided with other approaches using the same dataset.

Saif et al. (J. Math. Comput. Sci. 21 (2020) 127-135) considered modified Laplace transform and developed some of their certain properties and relations. Motivated by this work, in this paper, we define modified Sumudu transform and investigate many properties and relations including modified Sumudu transforms of the power function, sine, cosine, hyperbolic sine, hyperbolic cosine, exponential function, and function derivatives. Moreover, we attain two shifting properties and a scale preserving theorem for the modified Sumudu transform. We give modified inverse Sumudu transform and investigate some relations and examples. Furthermore, we show that the modified Sumudu transform is the theoretical dual transform to the modified Laplace transform.

The rapid growth of smartphone financial services raises the need for secure mobile authentication. Continuous authentication is a user-friendly way to strengthen the security of smartphones by implicitly monitoring a user’s identity through sessions. Mobile continuous authentication can be viewed as an anomaly detection problem in which models discriminate between one genuine user and the rest of the imposters (anomalies). In practice, complete imposter profiles are hardly available due to the time and monetary cost, while leveraging genuine data alone yields poor generalized models due to the lack of knowledge about imposters. To address this challenge, we recast continuous mobile authentication as a few-shot anomaly detection problem, aiming to enhance the inference robustness of unseen imposters by using partial knowledge of available imposter profiles. Specifically, we propose a novel deep learning-based model, namely Local Feature Pooling based Temporal Convolution Network (LFP-TCN), which directly models raw sequential mobile data, aggregating global and local feature information. In addition, we introduce a random pattern mixing augmentation to generate class-unconstrained imposter data for the training. The augmented pool enables characterizing various imposter patterns from limited imposter data. Finally, we demonstrate practical continuous authentication using score-level fusion, which prevents long-term dependency or increased model complexity due to extended re-authentication time. Experiments on two public benchmark datasets show the effectiveness of our method and its state-of-the-art performance.

Automatic target detection of remote sensing images (RSI) plays an important role in military reconnaissance, disaster monitoring, and target rescue. The core task of remote sensing target detection is to judge the target categories and complete precise location. However, the existing target detection algorithms have limited accuracy and weak generalization capability for remote sensing images with complex backgrounds. To achieve accurate detection of different categories targets in remote sensing images, this study presents a novel feature enhancement single shot multibox detector (FESSD) algorithm for remote sensing target detection. The FESSD introduces feature enhancement module and attention mechanism into the convolution neural networks (CNN) model, which can effectively enhance the feature extraction ability and nonlinear relationship between different convolution features. Specifically, the feature enhancement module is used to extract the multi-scale feature information, and enhance the model nonlinear learning ability; the self-learning attention mechanism (SAM) is used to expand the convolution kernel local receptive field, which makes the model extract more valuable features. In addition, the nonlinear relationship between different convolution features is enhanced using the feature pyramid attention mechanism (PAM). The advantage of FESSD over other state-of-the-art target detection methods is validated by experiments on the presented seven-class target detection dataset (SD-RSI) and the public DIOR dataset.

Panchromatic (PAN) images contain abundant spatial information that is useful for earth observation, but always suffer from low-resolution due to the sensor limitation and large-scale view field. The current super-resolution (SR) methods based on traditional attention mechanism have shown remarkable advantages but remain imperfect to reconstruct the edge details of SR images. To address this problem, an improved super-resolution model which involves the self-attention augmented WGAN is designed to dig out the reference information among multiple features for detail enhancement. We use an encoder-decoder network followed by a fully convolutional network (FCN) as the backbone to extract multi-scale features and reconstruct the HR results. To exploit the relevance between multi-layer feature maps, we first integrate a convolutional block attention module (CBAM) into each skip-connection of the encoder-decoder subnet, generating weighted maps to enhance both channel-wise and spatial-wise feature representation automatically. Besides, considering that the HR results and LR inputs are highly similar in structure, yet cannot be fully reflected in traditional attention mechanism, we therefore design a self augmented attention (SAA) module, where the attention weights are produced dynamically via a similarity function between hidden features, this design allows the network to flexibly adjust the fraction relevance among multi-layer features and keep the long-range inter information, which is helpful to preserve details. In addition, the pixel-wise loss is combined with perceptual and gradient loss to achieve comprehensive supervision. Experiments on benchmark datasets demonstrate that the proposed method outperforms other SR methods in terms of both objective evaluation and visual effect.

The fractional Hilbert transform, a generalization of the Hilbert transform, has been extensively studied in the literature because of its extensive use in optics, engineering, and signal processing. In the present work, we aimed to expand the fractional Hilbert transform to a space of generalized functions known as Boehmians. We introduce a new fractional convolution operator for the fractional Hilbert transform to prove a convolution theorem similar to the classical Hilbert transform and also to extend the fractional Hilbert transform to Boehmians. We also construct a suitable Boehmian space on which the fractional Hilbert transform exists. Further, we investigate convergence of the fractional Hilbert transform for the class of Boehmians and discuss the continuity of the extended fractional Hilbert transform.

In recent years, different deep learning frameworks were introduced for hyperspectral image (HSI) classification. However, the proposed network models have a higher model complexity and do not provide high classification accuracy if few-shot learning is used. This paper pre-sents an HSI classification method that combines random patches network (RPNet) and re-cursive filtering (RF) to obtain informative deep features. The proposed method first convolves image bands with random patches to extract multi-level deep RPNet features. Thereafter, the RPNet feature set is subjected to dimension reduction through principal component analysis (PCA) and the extracted components are filtered using the RF procedure. Finally, HSI spectral features and the obtained RPNet-RF features are combined to classify the HSI using a support vector machine (SVM) classifier. In order to test the performance of the proposed RPNet-RF method, some experiments were performed on three widely known datasets using a few training samples for each class and classification results were compared with those obtained by other advanced HSI classification methods adopted for small training samples. The comparison showed that the RPNet-RF classification is characterized by higher values of such evaluation metrics as overall accuracy and Kappa coefficient (https://github.com/UchaevD/RPNet-RF).

This article focuses on obtaining the analytical solutions for parabolic Volterra integro- differential equations in d-dimensional with different types frictional memory kernel. Based on theories of Laplace transform, Fourier transform, the properties of Fox-H function and convolution theorem, analytical solutions of the equations in the infinite domain are derived under three frictional memory kernel functions respectively. The analytical solutions are expressed by infinite series, the generalized multi-parameter Mittag-Leffler function, Fox-H function and convolution form of Fourier transform. In addition, the graphical representations of the analytical solution under different parameters are given for one-dimensional parabolic Volterra integro-differential equation with power-law memory kernel. It can be seen that the solution curves subject to Gaussian decay at any given moment.

This paper presents a novel approach for semantic segmentation of building roof in dense urban environment with Deep Convolution Neural Network (DCNN) using imagery acquired by a Chinese Very High Resolution (VHR) satellite mission, i.e. GaoFen-2 (GF-2). To provide an operational end-to-end work flow for accurate build roof mapping with feature extraction as well as image segmentation, a fully convolutional DCNN with both convolutional and deconvolutional layers is designed to perform the VHR image analysis for labeling pixels. Since the diverse urban patterns and building styles in large areas, sample image data sets of building roof and non-building roof are collected over different metropolitan regions in China. We selected typical cities with dense urban environment in each metropolitan region as study areas for collecting training and test samples. High performance cluster with GPU-mounted workstations is employed to perform the model training and optimization. With the building roof samples collected over different cities, the predictive model with multiple NN layers is developed for building roof labeling. The validation of the building roof map shows that the overall accuracy(OA) and the mean Intersection Over Union( mIOU) of DCNN based segmentation are 94.67%, 0.85 respectively, while CRF-refined segmentation achieved OA of 94.69% and mIOU of 0.83. The results suggest that the proposed approach is a promising solution for building roof mapping with VHR images over large areas across different urban and building patterns. With the operational acquisition of GF2 VHR imagery, it is expected to develop an automated pipeline for operational built-up area monitoring and timely update of building roof map over large areas.

Let be a power function $f_{r,M}(s)$ defined for every $s$ within the finite set $M$ as follows $$f_{r,M}(s)= \begin{cases} s^r, \ &s\in M,\\ 0, \ &\mathrm{otherwise}. \end{cases} $$ Let a discrete convolution of $f_{r,M}(s)$ be denoted as follows $\mathrm{Conv}_{r,M}[n]=(f_{r,M}*f_{r,M})[n]$. Let a real coefficients $A_{m,j}$ be given by the following recurrence $$ A_{m,j} = \begin{cases} 0, & \mathrm{if } \ j<0 \ \mathrm{or } \ j>m, \\ (2j+1)\binom{2j}{j} \sum_{d=2j+1}^{m} A_{m,d} \binom{d}{2j+1} \frac{(-1)^{d-1}}{d-j} B_{2d-2j}, & \mathrm{if } \ 0 \leq j < m, \\ (2j+1)\binom{2j}{j}, & \mathrm{if } \ j=m. \end{cases} $$ In this paper we show that for every $n>0$ the following odd-power identities involving coefficients $A_{m,j}$ and convolution transform $\mathrm{Conv}_{r,M}[n]$ hold $$ \begin{split} n^{2m+1}+1&=\sum_{r=0}^{m}A_{m,r}\mathrm{Conv}_{r,\mathbb{N}}[n],\\ n^{2m+1}-1&=\sum_{r=0}^{m}A_{m,r}\mathrm{Conv}_{r,\mathbb{Z}_{>0}}[n],\\ n^{2m+1}&=\sum_{r=0}^{m}A_{m,r}\sum_{k=1}^{n} k^r(n-k)^r\\ &=\sum_{r=0}^{m}A_{m,r}\sum_{k=0}^{n-1} k^r(n-k)^r. \end{split} $$

In recent years, intelligent fault diagnosis algorithms using deep learning method have achieved much success. However, the signals collected by sensors contain a lot of noise, which will have a great impact on the accuracy of the diagnostic model. To address this problem, we propose a one-dimensional convolutional neural network with multi-scale kernels (MSK-1DCNN) and apply this method to bearing fault diagnosis. We use a multi-scale convolution structure to extract different fault features in the original signal, and use the ELU activation function instead of the ReLU function in the multi-scale convolution structure to improve the anti-noise ability of MSK-1DCNN; then we use the training set with pepper noise to train the network to suppress overfitting. We use the Western Reserve University bearing data to verify the effectiveness of the algorithm and compare it with other fault diagnosis algorithms. Experimental results show that the improvements we proposed have effectively improved the diagnosis performers of MSK-1DCNN under strong noise and the diagnosis accuracy is higher than other comparison algorithms.

Since smoke usually occurs before a flame arises, fire smoke detection is especially significant for early warning systems. In this paper, a DSATA(Depthwise Separability And Target Awareness) algorithm based on depthwise separability and target awareness is proposed. Existing deep learning methods with convolutional neural networks pretrained by abundant and vast datasets are always used to realize generic object recognition tasks. In the area of smoke detection, collecting large quantities of smoke data is a challenging task for small sample smoke objects. The basis is that the objects of interest can be arbitrary object classes with arbitrary forms. Thus, deep feature maps acquired by target-aware pretrained networks are used in modelling these objects of arbitrary forms to distinguish them from unpredictable and complex environments. In this paper, this scheme is introduced to deal with smoke detection. The depthwise separable method with a fixed convolution kernel replacing the training iterations can improve the speed of the algorithm to meet the enhanced requirements of real-time fire spreading for detecting speed. The experimental results demonstrate that the proposed algorithm can detect early smoke, is superior to the state-of-the-art methods in accuracy and speed, and can also realize real-time smoke detection.

This paper presents a novel method to extract local features, which instead of calculating local extrema computes global maxima in a discretized scale-space representation. To avoid obtaining precise scales by interpolation and to achieve perfect rotation invariance, two essential techniques, increasing the width of kernels in pixel and utilizing disk-shaped convolution template are adopted in this method. Since the size of a convolution template is finite and finite templates can introduce computational error into convolution, we sufficiently discuss this problem and work out an upper bound of the computational error. The upper bound is utilized in the method to ensure that all features obtained are computed under a given tolerance. Besides, the technique of relative threshold to determine features is adopted to reinforce the robustness for the scene of changing illumination. Simulations show that this new method attains high performance of repeatability in various situations including scale change, rotation, blur, JPEG compression, illumination change and even viewpoint change.

In the last few decades, glaucoma became the second biggest leading cause of irreversible vision loss. Because of its asymptotic growth, it is not properly diagnosed until the relatively late stage. To stop the severe damage by glaucoma it is needed to detect glaucoma in its early stages. Surprisingly diabetes also be the greatest cause of glaucoma. In the modern era, artificial intelligence makes great progress in the medical image processing field. Image analysis based on machine learning gives a huge success in diagnosis glaucoma without any misdiagnosis. The aim of this proposed paper is to create an automated process that can detect glaucoma and diabetic retinopathy. Here various Machine Learning models are used and results of these methods are presented.

Accurate and efficient traffic incident detection methods can effectively alleviate traffic congestion caused by traffic incidents, prevent secondary accidents and improve the safety of urban road traffic.Aiming at the problems that the traditional machine learning event detection method cannot fully extract the parameter characteristics of traffic flow and is not suitable formulti-dimensional and non-linear massive data, we propose a new traffic event detection method(CNN-XGBoost).This method combines the respective advantages of Convolution Neural Network(CNN) and Extreme Gradation Boosting (XGBoost). Firstly, we preprocessed the original freeway traffic incident detection data set by constructing initial variable set, data normalization, data balance processing and dimension reorganization. Secondly,we use CNN network to automatically extract the deep features of event detection data, and use XGBoost as a classifier to classify the extracted features for expressway traffic event detection.Finally, we use the data set of Hangzhou expressway microwave detector in China to carry out simulation experiments on CNN-XGBoost. The experimental results show that compared with XGBoost, CNN, Support Vector Machine (SVM) and Gradient Boosting Decision Tree (GBDT) and other methods, CNN-XGBoost method can effectively improve the accuracy of expressway traffic event detection and has better generalization ability.

This work is part of an ongoing research project to develop an unmanned flying social robot to monitor dependants at home in order to detect the person’s state and bring the necessary assistance. In this sense, this paper focuses on the description of a virtual reality (VR) simulation platform for the monitoring process of an avatar in a virtual home by a rotatory-wing autonomous unmanned aerial vehicle (UAV). This platform is based on a distributed architecture composed of three modules communicated through the Message Queue Telemetry Transport (MQTT) protocol: the UAV Simulator implemented in MATLAB/Simulink, the VR Visualiser developed in Unity, and the new emotion recognition (ER) System developed in Python. Using a face detection algorithm and a convolutional neural network (CNN), the ER System is able to detect the person’s face in the image captured by the UAV’s on-board camera and classify the emotion among seven possible ones (surprise, fear, happiness, sadness, disgust, anger or neutral expression). The experimental results demonstrate the correct integration of this new computer vision module within the VR platform, as well as the good performance of the designed CNN, with around 85% in the F1-score, a mean of the precision and recall of the model. The developed emotion detection system can be used in the future implementation of the assistance UAV that monitors dependent people in a real environment, since the methodology used is valid for images of real people.

Objectives: In order to solve the problem that most of the existing research focuses on the binary tactile attributes of objects,which ignores the tactile attribute strength and category recognition,an attribute strength and category recognition method based on convolutional neural network matrix-label is proposed. Methods:Firstly,in the data preparation stage,we preprocess the raw data and determine the matrix labels to build the haptic dataset.Secondly,in the feature extraction stage,we fuse the haptic data of two fingers and use the convolutional neural network to extract the attribute strength features.Finally,in the attribute strength and category recognition stage,all channel haptic data is fused to predict the attribute strength and category.Results:We compared with the multi-label convolutional neural network method in terms of elastic strength,hardness strength and category,and compared the attribute strength recognition capabilities of the two methods using novel objects outside the haptic dataset.The results show that the accuracy of the last 20 iterations of the matrix-label method has an average elastic strength of 96.73%,hardness strength of 97.34%,and category of 96.67%.The performance is better.When the Euclidean distance between the prediction of the novel object and the real label is less than 1,the accuracy of the elastic strength is best to reach 100%,and the hardness strength is best to reach 100%.The performance is better. Conclusions:The effectiveness of the method has been verified.Comparing with the convolutional neural network method,our method can effectively recognize the attribute strength and category of objects.

Singing melody extraction is the task that identifies the melody pitch contour of singing voice from polyphonic music. Most of the traditional melody extraction algorithms are based on calculating salient pitch candidates or separating the melody source from the mixture. Recently, classification-based approach based on deep learning has drawn much attentions. In this paper, we present a classification-based singing melody extraction model using deep convolutional neural networks. The proposed model consists of a singing pitch extractor (SPE) and a singing voice activity detector (SVAD). The SPE is trained to predict a high-resolution pitch label of singing voice from a short segment of spectrogram. This allows the model to predict highly continuous curves. The melody contour is smoothed further by post-processing the output of the melody extractor. The SVAD is trained to determine if a long segment of mel-spectrogram contains a singing voice. This often produces voice false alarm errors around the boundary of singing segments. We reduced them by exploiting the output of the SPE. Finally, we evaluate the proposed melody extraction model on several public datasets. The results show that the proposed model is comparable to state-of-the-art algorithms.

Cyber security plays an important role to protect our computer, network, program and data from unauthorized access. Intrusion detection system (IDS) and intrusion prevention system (IPS) are two main categories of cyber security, designed to identify any suspicious activities present in inbound and outbound network packets and restrict the suspicious incident. Deep neural network plays a significant role in the construction of IDS and IPS. This paper highlights a novel IDS using optimized convolution neural network (CNN-IDS). An optimized CNNIDS model is an improvement over CNN which selects the best weighted model by considering the loss in every epoch. All the experiments have been conducted on the well known NSL-KDD dataset. Information gain has been used for dimensionality reduction. The accuracy of the proposed model is evaluated through optimized CNN for both binary and multiclass categories. Finally, a critical comparison has been performed with other general classifiers like J48, Naive Bayes, NB tree, Random forest, Multilayer Perceptron (MLP), Support Vector Machine (SVM), Recurrent Neural Network (RNN) and Convolution Neural Network(CNN). All the experimental results demonstrate that the optimized CNN-IDS model records the best recognition rate with minimum model construction time.

Table detection is a preliminary step in extracting reliable information from tables in scanned document images. We present CasTabDetectoRS, a novel end-to-end trainable table detection framework that operates on Cascade Mask R-CNN, including Recursive Feature Pyramid network and Switchable Atrous Convolution in the existing backbone architecture. By utilizing a comparatively lightweight backbone of ResNet-50, this paper demonstrates that superior results are attainable without relying on pre and post-processing methods, heavier backbone networks (ResNet-101, ResNeXt-152), and memory-intensive deformable convolutions. We evaluate the proposed approach on five different publicly available table detection datasets. Our CasTabDetectoRS outperforms the previous state-of-the-art results on four datasets (ICDAR-19, TableBank, UNLV, and Marmot) and accomplishes comparable results on ICDAR-17 POD. Upon comparing with previous state-of-the-art results, we obtain a significant relative error reduction of 56.36%, 20%, 4.5%, and 3.5% on the datasets of ICDAR-19, TableBank, UNLV, and Marmot, respectively. Furthermore, this paper sets a new benchmark by performing exhaustive cross-datasets evaluations to exhibit the generalization capabilities of the proposed method.

In remote sensing domain, it is crucial to annotate semantics, e.g., river, building, forest, etc, on the raster images. Deep Convolutional Encoder Decoder (DCED) network is the state-of-the-art semantic segmentation for remotely-sensed images. However, the accuracy is still limited, since the network is not designed for remotely sensed images and the training data in this domain is deficient. In this paper, we aim to propose a novel CNN for semantic segmentation particularly for remote sensing corpora with three main contributions. First, we propose to apply a recent CNN call ``Global Convolutional Network (GCN)'', since it can capture different resolutions by extracting multi-scale features from different stages of the network. Also, we further enhance the network by improving its backbone using larger numbers of layers, which is suitable for medium resolution remotely sensed images. Second, ``Channel Attention'' is presented into our network in order to select most discriminative filters (features). Third, ``Domain Specific Transfer Learning'' is introduced to alleviate the scarcity issue by utilizing other remotely sensed corpora with different resolutions as pre-trained data. The experiment was then conducted on two given data sets: ($i$) medium resolution data collected from Landsat-8 satellite and ($ii$) very high resolution data called ``ISPRS Vaihingen Challenge Data Set''. The results show that our networks outperformed DCED in terms of $F1$ for 17.48% and 2.49% on medium and very high resolution corpora, respectively.

When extract building from high resolution remote sensing image with meter/sub-meter accuracy, the shade of trees and interference of roads are the main factors of reducing the extraction accuracy. Proposed a Bayesian Convolutional Neural Networks(BCNET) model base on standard fully convolutional networks(FCN) to solve these problems. First take building with no shade or artificial removal of shade as Sample-A, woodland as Sample-B, road as Sample-C. Set up 3 sample libraries. Learn these sample libraries respectively, get their own set of feature vector; Mixture Gauss model these feature vector set, evaluate the conditional probability density function of mixture of noise object and roofs; Improve the standard FCN from the 2 aspect:(1) Introduce atrous convolution. (2) Take conditional probability density function as the activation function of the last convolution. Carry out experiment using unmanned aerial vehicle(UVA) image, the results show that BCNET model can effectively eliminate the influence of trees and roads, the building extraction accuracy can reach 97%.

In the paper, by virtue of convolution theorem for the Laplace transforms, Bernstein's theorem for completely monotonic functions, and other techniques, the author finds necessary and sufficient conditions for a difference constituted by four derivatives of a function involving trigamma function to be completely monotonic.

Tables in the document image are one of the most important entities since they contain crucial information. Therefore, accurate table detection can significantly improve information extraction from tables. In this work, we present a novel end-to-end trainable pipeline, HybridTabNet, for table detection in scanned document images. Our two-stage table detector uses the ResNeXt-101 backbone for feature extraction and Hybrid Task Cascade (HTC) to localize the tables in scanned document images. Moreover, we replace conventional convolutions with deformable convolutions in the backbone network. This enables our network to detect tables of arbitrary layouts precisely. We evaluate our approach comprehensively on ICDAR-13, ICDAR-17 POD, ICDAR-19, TableBank, Marmot, and UNLV. Apart from the ICDAR-17 POD dataset, our proposed HybridTabNet outperforms earlier state-of-the-art results without depending on pre and post-processing steps. Furthermore, to investigate how the proposed method generalizes unseen data, we conduct an exhaustive leave-one-out-evaluation. In comparison to prior state-of-the-art results, our method reduces the relative error by 27.57% on ICDAR-2019-TrackA-Modern, 42.64% on TableBank (Latex), 41.33% on TableBank (Word), 55.73% on TableBank (Latex + Word), 10% on Marmot, and 9.67% on UNLV dataset. The achieved results reflect the superior performance of the proposed method.

In the paper, by convolution theorem for the Laplace transforms and analytic techniques, the author finds necessary and sufficient conditions for complete monotonicity, monotonicity, and inequalities of several functions involving polygamma functions. By these results, the author derives a lower bound of a function related to the sectional curvature of the manifold of the beta distributions. Finally, the author poses several guesses and open problems related to monotonicity, complete monotonicity, and inequalities of several functions involving polygamma functions.