nils-herrmann/clean_scirepeval huggingface dataset:
A geometrical approach For vision based attitude and altitude estimation for UAVs in dark environments

This paper presents a single camera and laser system dedicated to the realtime estimation of attitude and altitude for unmanned aerial vehicles (UAV) under low illumination conditions to dark environments. The fisheye camera allows to cover a large field of view (FOV). The approach, close to structured light systems, uses the geometrical information obtained by the projection of a laser circle onto the ground plane and perceived by the camera. We propose some experiments based on simulated data and real sequences. The results show good agreement with the ground truth values from the commercial sensors in terms of its accuracy and correctness. The results also prove its suitability for autonomous take-off and landing as well as for the case of low altitude manoeuvre in dark, GPS signal deficient unknown environments with no prebuilt map. It also provides room for additional payload to be used for different applications due to it being inexpensive and use of light weight micro-camera and laser system.
A Survey of Vision-Based Traffic Monitoring of Road Intersections

Visual surveillance of dynamic objects, particularly vehicles on the road, has been, over the past decade, an active research topic in computer vision and intelligent transportation systems communities. In the context of traffic monitoring, important advances have been achieved in environment modeling, vehicle detection, tracking, and behavior analysis. This paper is a survey that addresses particularly the issues related to vehicle monitoring with cameras at road intersections. In fact, the latter has variable architectures and represents a critical area in traffic. Accidents at intersections are extremely dangerous, and most of them are caused by drivers' errors. Several projects have been carried out to enhance the safety of drivers in the special context of intersections. In this paper, we provide an overview of vehicle perception systems at road intersections and representative related data sets. The reader is then given an introductory overview of general vision-based vehicle monitoring approaches. Subsequently and above all, we present a review of studies related to vehicle detection and tracking in intersection-like scenarios. Regarding intersection monitoring, we distinguish and compare roadside (pole-mounted, stationary) and in-vehicle (mobile platforms) systems. Then, we focus on camera-based roadside monitoring systems, with special attention to omnidirectional setups. Finally, we present possible research directions that are likely to improve the performance of vehicle detection and tracking at intersections.
Visual odometry with unsynchronized multi-cameras setup for intelligent vehicle application

This paper presents a visual odometry with metric scale estimation of a multi-camera system in challenging un-synchronized setup. The intended application is in the field of intelligent vehicles. We propose a new algorithm named “triangle-based” method. The proposed algorithm employs the information from both extrinsic and intrinsic parameters of calibrated cameras. We assume that the trajectory between two consecutive frames of a camera is a linear segment (straight trajectory). The relative camera poses are estimated via classical Structure-from-Motion. Then, the scale factors are computed by imposing the known extrinsic parameters and the linearity assumption. We verify the validity of our method both in simulated and real conditions. For the real world, the motion trajectory estimated for image sequence of two cameras from KITTI dataset is compared against the GPS/INS ground truth.
A mobile robot localization based on a multisensor cooperation approach

The authors present an original method of localization based on using complementary measurement data. They use, for their application, a new omnidirectional device made of a panoramic video camera coupled with a rotative LASER range finder. The complementarity of information obtained from these two sensors is used to improve safety in the algorithm of position determination. This algorithm is based on a matching of the straight line projections and the natural vertical beacons taken in the global environment. In order to reduce the computing time for this matching phase, one can extract, from the rotative LASER range finder, a reduced set of possibilities for this matching. The method has been tested on the authors' "SARAH" mobile robot. Results obtained from this experiment are quite promising, especially for real-time applications.
Building an Intrusion Detection System Using a Filter-Based Feature Selection Algorithm

Redundant and irrelevant features in data have caused a long-term problem in network traffic classification. These features not only slow down the process of classification but also prevent a classifier from making accurate decisions, especially when coping with big data. In this paper, we propose a mutual information based algorithm that analytically selects the optimal feature for classification. This mutual information based feature selection algorithm can handle linearly and nonlinearly dependent data features. Its effectiveness is evaluated in the cases of network intrusion detection. An Intrusion Detection System (IDS), named Least Square Support Vector Machine based IDS (LSSVM-IDS), is built using the features selected by our proposed feature selection algorithm. The performance of LSSVM-IDS is evaluated using three intrusion detection evaluation datasets, namely KDD Cup 99, NSL-KDD and Kyoto 2006+ dataset. The evaluation results show that our feature selection algorithm contributes more critical features for LSSVM-IDS to achieve better accuracy and lower computational cost compared with the state-of-the-art methods.
Automatically Detecting Road Sign Text from Natural Scene Video

Automatic detection of text on road signs can help drivers keep aware of the traffic situation and surrounding environments by reminding them of the signs ahead. Current systems can only detect constrained road signs or produce unsatisfying performance when dealing with complex scenes in practical use. This paper firstly reviews the existing techniques used for text detection from natural scene. A novel system which detects text on road signs from natural scene video is then proposed. Our detailed approaches and methodology give a promising solution to this problem in order to reduce the running time and improve the recognition rate
A bank customer credit evaluation based on the decision tree and the simulated annealing algorithm

C4.5 is a learning algorithm that adopts local search strategy, and it cannot obtain the best decision rules. On the other hand, the simulated annealing algorithm is a globally optimized algorithm and it avoids the drawbacks of C4.5. This paper proposes a new credit evaluation method based on decision tree and simulated annealing algorithm. The experimental results demonstrate that the proposed method is effective.
Pedestrian detection using hybrid statistical feature

A novel approach for walking people detection is proposed in this paper, which is inspired by the idea of gait energy image (GEI). Unlike most of common human detection methods where usually a trained detector scans a single image and then generates a detection result, the proposed method detects people on a sequence of silhouettes which contain both appearance characteristics and motion characteristics. Thus, our method is more robust. Encouraging experimental results are obtained based on CASIA gait database and the additional non-human objects data.
Extracting key postures in a human action video sequence

Human key posture extraction from videos will benefit video storage, video retrieval, human action recognition, human behaviour understanding and so on. This paper presents an approach to select key postures from human action sequences using 2D information. There are two steps in the proposed method. Information measurement which is a kind of global feature of a frame is used to roughly find key posture candidates. Then, a body skeleton feature which is a kind of local feature is applied to select final key postures from the candidates obtained in the first step. The experiments show that the proposed method is efficient.
Super-resolution by prediction based sub-pel motion estimation

Super-resolution reconstruction produces highresolution images from a set of low-resolution images of the same scene. In the last two and a half decades, many super-resolution algorithms have been proposed. These algorithms are usually very sensitive to their assumed models of data and noise, and also computationally expensive for many practical applications. In this paper we adopt computationally efficient prediction based sub-pel motion estimation to produce a fast super-resolution reconstruction that can also accommodate generic motion patterns. The proposed algorithm adaptively exploits the available high frequency content in adjacent video frames to generate high resolution video frames. Initial experiments showed promising results of around 2dB, PSNR improvement, over single frame bi-linear interpolation.
Facial expression recognition with emotion-based feature fusion

In this paper, we propose an emotion-based feature fusion method using the Discriminant-Analysis of Canonical Correlations (DCC) for facial expression recognition. There have been many image features or descriptors proposed for facial expression recognition. For the different features, they may be more accurate for the recognition of different expressions. In our proposed method, four effective descriptors for facial expression representation, namely Local Binary Pattern (LBP), Local Phase Quantization (LPQ), Weber Local Descriptor (WLD), and Pyramid of Histogram of Oriented Gradients (PHOG), are considered. Supervised Locality Preserving Projection (SLPP) is applied to the respective features for dimensionality reduction and manifold learning. Experiments show that descriptors are also sensitive to the conditions of images, such as race, lighting, pose, etc. Thus, an adaptive descriptor selection algorithm is proposed, which determines the best two features for each expression class on a given training set. These two features are fused, so as to achieve a higher recognition rate for each expression. In our experiments, the JAFFE and BAUM-2 databases are used, and experiment results show that the descriptor selection step increases the recognition rate up to 2%.
A Novel Feature Selection Approach for Intrusion Detection Data Classification

Intrusion Detection Systems (IDSs) play a significant role in monitoring and analyzing daily activities occurring in computer systems to detect occurrences of security threats. However, the routinely produced analytical data from computer networks are usually of very huge in size. This creates a major challenge to IDSs, which need to examine all features in the data to identify intrusive patterns. The objective of this study is to analyze and select the more discriminate input features for building computationally efficient and effective schemes for an IDS. For this, a hybrid feature selection algorithm in combination with wrapper and filter selection processes is designed in this paper. Two main phases are involved in this algorithm. The upper phase conducts a preliminary search for an optimal subset of features, in which the mutual information between the input features and the output class serves as a determinant criterion. The selected set of features from the previous phase is further refined in the lower phase in a wrapper manner, in which the Least Square Support Vector Machine (LSSVM) is used to guide the selection process and retain optimized set of features. The efficiency and effectiveness of our approach is demonstrated through building an IDS and a fair comparison with other stateof-the-art detection approaches. The experimental results show that our hybrid model is promising in detection compared to the previously reported results.
Higher order prediction for sub-pixel motion estimation

Estimating motion between two frames of a video sequence, up to sub-pixel accuracy, is a critical task for many image processing applications. Efficient block matching algorithms were proposed in [1, 4, 5, 6] for motion estimation up to pixel accuracy. Applying these fast block search algorithms to up-sampled and interpolated frames can produce good results but with significant increase in computations. To reduce the number of search points, and therefore the computational cost, quadratic prediction was proposed earlier [1, 2] to predict the location of minimum block matching error, and then to limit the search window to the vicinity of the predicted location. In this paper we investigate the typical behavior of block matching error surface and propose an improved higher order prediction that models the error surface more accurately, utilizing additional local image behavior. Initial experiments have proved promising results of about 50% more improvement in PSNR compared to quadratic prediction with only a marginal increase in the computational cost.
A radio frequency identification network design methodology for the decision problem in Mackay Memorial Hospital based on swarm optimization

Radio-frequency identification (RFID) is an automatic identification system which has become a hot topic in the fields of manufacturing, logistics, and so on. The purpose of this research is to propose a methodology for designing the RFID network planning problem (RNP) for application in the Mackay Memorial Hospital in Hsinchu, Taiwan. In this study, the RFID network is first considered as a grid and divided into several small squares. A soft computing methodology called FKB-SSO is proposed to solve the RNP problem based on simplified swarm optimization (SSO) by integrating k-means, fuzzy adaptive resonance theory (fuzzy-ART), and binary search. The proposed FKB-SSO will provide the basis for strategic decisions in constructing the RFID network to reduce the number of RFID readers with a minimal budget under the constraint of 100% coverage rate. The proposed FKB-SSO is more efficient than PSO and experts' manual solution in both run time and solution quality.
Unsupervised Feature Selection Method for Intrusion Detection System

This paper considers the feature selection problem for data classification in the absence of data labels. It first proposes an unsupervised feature selection algorithm, which is an enhancement over the Laplacian score method, named an Extended Laplacian score, EL in short. Specifically, two main phases are involved in EL to complete the selection procedures. In the first phase, the Laplacian score algorithm is applied to select the features that have the best locality preserving power. In the second phase, EL proposes a Redundancy Penalization (RP) technique based on mutual information to eliminate the redundancy among the selected features. This technique is an enhancement over Battiti's MIFS. It does not require a user-defined parameter such as beta to complete the selection processes of the candidate feature set as it is required in MIFS. After tackling the feature selection problem, the final selected subset is then used to build an Intrusion Detection System. The effectiveness and the feasibility of the proposed detection system are evaluated using three well-known intrusion detection datasets: KDD Cup 99, NSL-KDD and Kyoto 2006+ dataset. The evaluation results confirm that our feature selection approach performs better than the Laplacian score method in terms of classification accuracy.
Diversity-Enhanced Condensation Algorithm and Its Application for Robust and Accurate Endoscope Three-Dimensional Motion Tracking

The paper proposes a diversity-enhanced condensation algorithm to address the particle impoverishment problem which stochastic filtering usually suffers from. The particle diversity plays an important role as it affects the performance of filtering. Although the condensation algorithm is widely used in computer vision, it easily gets trapped in local minima due to the particle degeneracy. We introduce a modified evolutionary computing method, adaptive differential evolution, to resolve the particle impoverishment under a proper size of particle population. We apply our proposed method to endoscope tracking for estimating three-dimensional motion of the endoscopic camera. The experimental results demonstrate that our proposed method offers more robust and accurate tracking than previous methods. The current tracking smoothness and error were significantly reduced from (3.7, 4.8) to (2.3 mm, 3.2 mm), which approximates the clinical requirement of 3.0 mm.
Multi-Instance Learning with an Extended Kernel Density Estimation for Object Categorization

Multi-instance learning (MIL) is a variational supervised learning. Instead of getting a set of instances that are labeled, the learner receives a set of bags that are labeled. Each bag contains many instances. In this paper, we present a novel MIL algorithm that can efficiently learn classifiers in a large instance space. We achieve this by estimating instance distribution using a proposed extended kernel density estimation (eKDE) which is an alternative to previous diverse density estimation (DDE). A fast method is devised to approximately locate the multiple modes of eKDE. Comparing to DDE, eKDE is more efficient and robust to the labeling noise (the mislabeled training data). We compare our approach with other state-of-the-art MIL methods in object categorization on the popular Caltech-4 and SIVAL datasets, the results illustrate that our approach provides superior performance.
Facial expression recognition using histogram variances faces

In human's expression recognition, the representation of expression features is essential for the recognition accuracy. In this work we propose a novel approach for extracting expression dynamic features from facial expression videos. Rather than utilising statistical models e.g. Hidden Markov Model (HMM), our approach integrates expression dynamic features into a static image, the Histogram Variances Face (HVF), by fusing histogram variances among the frames in a video. The HVFs can be automatically obtained from videos with different frame rates and immune to illumination interference. In our experiments, for the videos picturing the same facial expression, e.g., surprise, happy and sadness etc., their corresponding HVFs are similar, even though the performers and frame rates are different. Therefore the static facial recognition approaches can be utilised for the dynamic expression recognition. We have applied this approach on the well-known Cohn-Kanade AU-Coded Facial Expression database then classified HVFs using PCA and Support Vector Machine (SVMs), and found the accuracy of HVFs classification is very encouraging.
An Intrusion Detection System Based on Polynomial Feature Correlation Analysis

This paper proposes an anomaly-based Intrusion Detection System (IDS), which flags anomalous network traffic with a distance-based classifier. A polynomial approach was designed and applied in this work to extract hidden correlations from traffic related statistics in order to provide distinguishing features for detection. The proposed IDS was evaluated using the well-known KDD Cup 99 data set. Evaluation results show that the proposed system achieved better detection rates on KDD Cup 99 data set in comparison with another two state-of-the-art detection schemes. Moreover, the computational complexity of the system has been analysed in this paper and shows similar to the two state-of-the-art schemes.
Solving reliability redundancy allocation problems with orthogonal simplified swarm optimization

This study applies a penalty guided strategy and the orthogonal array test (OA) based on the Simplified Swarm Optimization algorithm (SSO) to solve the reliability redundancy allocation problems (RRAP) in the series system, the series-parallel system, the complex (bridge) system, and the overspeed protection of gas turbine system. For several decades, the RRAP has been one of the most well known techniques. The maximization of system reliability, the number of redundant components, and the reliability of corresponding components in each subsystem have to be decided simultaneously with nonlinear constraints, acting as one difficulty for the use of the RRAP. In other words, the objective function of the RRAP is the mixed-integer programming problem with the nonlinear constraints. The RRAP is of the class of NP-hard. Hence, in this paper, the SSO algorithm is proposed to solve the RRAP and improve computation efficiency for these NP-hard problems. There are four RRAP problems used to illustrate the applicability and the effectiveness of the SSO. The experimental results are compared with previously developed algorithms in literature. Moreover, the maximum-possible-improvement (MPI) is used to measure the amount of improvement of the solution found by the SSO to the previous solutions. According to the results, the system reliabilities obtained by the proposed SSO for the four RRAP problems are as well as or better than the previously best-known solutions.
An efficient algorithm for image retrieval through fusion of two clustering approaches based on combined features

This paper proposes new approaches for image representation to bridge the gap between visual features and semantics. Two new combined feature extraction approaches are used to extract significant features from images. Each approach is a hybrid of two feature extraction methods and tries to capture both colour and texture information. In order to improve the query processing time and avoid the linear search problem, a clustering technique is applied on the image dataset according to each feature extraction approach. The clustering outcomes of the two feature extraction approaches are combined together using a decision fusion technique. The fused results show an improvement over any single approach. An implemented prototype system demonstrates a promising retrieval performance examined on 1000 colour images from CORAL dataset in comparison with a peer system in literature.
Spectral salient object detection

Many existing methods for salient object detection are performed by over-segmenting images into non-overlapping regions, which facilitate local/global color statistics for saliency computation. In this paper, we propose a new approach: spectral salient object detection, which is benefited from selected attributes of normalized cut, enabling better retaining of holistic salient objects as comparing to conventionally employed pre-segmentation techniques. The proposed saliency detection method recursively bi-partitions regions that render the lowest cut cost in each iteration, resulting in binary spanning tree structure. Each segmented region is then evaluated under criterion that fit Gestalt laws and statistical prior. Final result is obtained by integrating multiple intermediate saliency maps. Experimental results on three benchmark datasets demonstrate the effectiveness of the proposed method against 13 state-of-the-art approaches to salient object detection.