nils-herrmann/clean_scirepeval huggingface dataset:
MAC Performance Analysis on Two-stage HFC Access Network

Two-stage access network structure is widely used in fixed and mobile access networks such as HFC (Hybrid Fibre/Coaxial) and BSS (Base Station System). In this paper, we introduce a new two-stage access scheme that employs random access and centralized polling methods corresponding to the two stages respectively. The new scheme's MAC (Medium Access Control) protocol procedure is presented based on DOCSIS standard. The performance of the mechanism in terms of access delay and throughput is evaluated and analyzed using computer simulating experiments. The results show the new access mechanism is efficient.
A comparison of modified evolutionary computation algorithms with applications to three-dimensional endoscopic camera motion tracking

Endoscope 3D motion tracking plays an irreplaceable role for computer-assisted endoscopy systems development. Without such tracking, it is impossible to synchronize pre- and intraoperative images in a reference coordinate frame. Currently available methods are comprised of video-based and electromagnetic tracking. These methods limit to either video image artifacts or inaccurate sensor measurements and dynamic errors. This paper proposes two modified evolutionary computation algorithms: (a) adaptive particle swarm optimization (APSO) and (b) observation-boosted differential evolution (OBDE), to augment current endoscopic camera motion tracking. The experimental results demonstrate that our modified algorithms, which combine endoscopic video images with sensor measurements to estimate endoscope movements, can improve tracking accuracy from 4.8 mm to 2.9 mm. OBDE outperforms APSO for endoscope tracking.
An efficient error concealment algorithm for H.264/AVC using regression modeling-based prediction

This paper presents a novel error concealment algorithm for H.264/AVC based on a regression model, which is constructed according to the spatial relationship between block locations and their motion activities. With the proposed algorithm, a corrupted macroblock is partitioned into subblocks and the motion vector of each sub-block is predicted through the regression model with the help of the neighbor motion vectors. The experimental results show that the proposed algorithm can achieve significant Peak Signal Noise Ratio (PSNR) improvement over existing methods with even reduced complexity. The implementation of the proposed algorithm is very simple and therefore it can be readily applied to real-time video applications running on various consumer electronic products such as mobile devices.
Online learning of multi-feature weights for robust object tracking

Sparse Representation based Classification (SRC) and its potential in object tracking have been explored in recent years. However, the trade-off between the discriminative ability of the overly emphasized sparse representation and the lack of insight on correlation of visual information has raised questions over the general applicability of such methods in object tracking. In addition, the need for the optimization of a series of l1-regularized least square norm, increases the computational complexity thereby limiting their usage in real-time applications. In this paper, a novel approach to robust object tracking is proposed. First, the variations in the appearance of the tracked target is modelled using PCA basis vectors, and further, a l2-regularized least square method is used to solve the proposed representation model. In order to improve the robustness of feature representation in object tracking applications, weights are associated with multiple trackers; each formulated using a different feature, and adapted via an online learning scheme. Finally, a decision fusion criterion is imposed to generate an optimized output through the weighted combination of different tracking results. Experiments on challenging video sequences have demonstrated the superior accuracy and robustness of the proposed method in comparison to thirteen other state-of-the-art baselines.
A hierarchically combined classifier for license plate recognition

High accuracy and fast recognition speed are two requirements for real-time and automatic license plate recognition system. In this paper, we propose a hierarchically combined classifier based on an inductive learning based method and an SVM-based classification. This approach employs the inductive learning based method to roughly divide all classes into smaller groups. Then the SVM method is used for character classification in individual groups. Both start from a collection of samples of characters from license plates. After a training process using some known samples in advance, the inductive learning rules are extracted for rough classification and the parameters used for SVM-based classification are obtained. Then, a classification tree is constructed for further fast training and testing processes for SVM-based classification. Experimental results for the proposed approach are given. From the experimental results, we can make the conclusion that the hierarchically combined classifier is better than either the inductive learning based classification or the SVM-based classification in terms of error rates and processing speeds.
Text detection in born-digital images using multiple layer images

In this paper, a new framework for detecting text from webpage and email images is presented. The original image is split into multiple layer images based on the maximum gradient difference (MGD) values to detect text with both strong and weak contrasts. Connected component processing and text detection are performed in each layer image. A novel texture descriptor named T-LBP, is proposed to further filter out non-text candidates with a trained SVM classifier. The ICDAR 2011 born-digital image dataset is used to evaluate and demonstrate the performance of the proposed method. Following the same performance evaluation criteria, the proposed method outperforms the winner algorithm of the ICDAR 2011 Robust Reading Competition Challenge 1.
Motion Based Pedestrian Recognition

This paper proposed a method for discriminating pedestrians from rigid objects in a video. The methodis a motion-based recognition of moving objects. This method is motivated by the assumptions that human beings are non-rigid and their movements are periodic. Moving objects and their skeletons are extracted. The motion cue is determined by the angle formed by the centroid point and the two bottom end points at object’s skeleton. The histogram of the cue over a time period is used to determine if the object is pedestrian or not. This cue does not require any pre-built models. Neither does it need Fourier Transform to obtain the cycle of the objects. The proposed method is computation inexpensive, and it can be used for realtime video surveillance.
Intrusion Detection Using Geometrical Structure

We propose a statistical model, namely Geometrical Structure Anomaly Detection (GSAD) to detect intrusion using the packet payload in the network. GSAD takes into account the correlations among the packet payload features arranged in a geometrical structure. The representation is based on statistical analysis of Mahalanobis distances among payload features, which calculate the similarity of new data against pre-computed profile. It calculates weight factor to determine anomaly in the payload. In the 1999 DARPA intrusion detection evaluation data set, we conduct several tests for limited attacks on port 80 and port 25. Our approach establishes and identifies the correlation among packet payloads in a network.
Segmentation of characters on car license plates

License plate recognition usually contains three steps, namely license plate detection/localization, character segmentation and character recognition. When reading characters on a license plate one by one after license plate detection step, it is crucial to accurately segment the characters. The segmentation step may be affected by many factors such as license plate boundaries (frames). The recognition accuracy will be significantly reduced if the characters are not properly segmented. This paper presents an efficient algorithm for character segmentation on a license plate. The algorithm follows the step that detects the license plates using an AdaBoost algorithm. It is based on an efficient and accurate skew and slant correction of license plates, and works together with boundary (frame) removal of license plates. The algorithm is efficient and can be applied in real-time applications. The experiments are performed to show the accuracy of segmentation.
Learning geodesic CRF model for image segmentation

Graph cut based on color model is sensitive to statistical information of images. Integrating priority information into graph cut approach, such as the geodesic distance information, may overcome the well-known drawback of bias towards shorter paths that occurred frequently with graph cut methods. In this paper, a conditional random field (CRF) model is formulated to combine color model and geodesic distance information into a graph cut optimization framework. A discriminative model is used to capture more comprehensive statistical information for geodesic distance. A simple and efficient parameter learning scheme based on feature fusion is proposed for CRF model construction. The method is evaluated by applying it to segmentation of natural images, medical images and low contrast images. The experimental results show that the geodesic information obtained by learning can provide more reliable object features. The dynamic parameter learning scheme is able to select best cues from geodesic map and color model for image segmentation.
Local Binary Patterns with Mahalanobis Distance Maps for Human Detection

Local Binary Pattern (LBP) was designed and has been widely used for efficient texture classification. LBP provides a simple and effective way to represent texture patterns. Uniform LBPs play an important role for LBP-based pattern/object recognition as they include majority of LBPs. On the other hand, Human detection based on Mahalanobis Distance Map (MDM) recognizes appearance of human based on geometrical structure. Each MDM shows a clear texture pattern that can be classified using LBPs. In this paper, we compute LBPs of MDMs. Chi-square as a measure is used for human detection based on uniform LBPs obtained. We show that our method using LBPs built on MDMs has a higher human detection rate and a lower false positive rate compared to the method merely based on MDMs.
Accuracy Enhancement for License Plate Recognition

Automatic License Plate Recognition is useful for real time traffic management and surveillance. License plate recognition usually contains two steps, namely license plate detection/localization and character recognition. Recognizing characters in a license plate is a very difficult task due to poor illumination conditions and rapid motion of vehicles. When using an OCR for character recognition, it is crucial to correctly remove the license plate boundaries after the step for license plate detection. No matter which OCRs are used, the recognition accuracy will be significantly reduced if the boundaries are not properly removed. This paper presents an efficient algorithm for non character area removal. The algorithm is based on the license plates detected using an AdaBoost algorithm. Then it follows the steps of character height estimation, character width estimation, segmentation and block identification. The algorithm is efficient and can be applied in real-time applications. The experiments are performed using OCR software for character recognition. It is shown that much higher recognition accuracy is obtained by gradually removing the license plate boundaries.
Visual Tracking via Nonnegative Multiple Coding

It has been extensively observed that an accurate appearance model is critical to achieving satisfactory performance for robust object tracking. Most existing top-ranked methods rely on linear representation over a single dictionary, which brings about improper understanding on the target appearance. To address this problem, in this paper, we propose a novel appearance model named as “nonnegative multiple coding” (NMC) to accurately represent a target. First, a series of local dictionaries are created with different predefined numbers of nearest neighbors, and then the contributions of these dictionaries are automatically learned. As a result, this ensemble of dictionaries can comprehensively exploit the appearance information carried by all the constituted dictionaries. Second, the existing methods explicitly impose the nonnegative constraint to coefficient vectors, but in the proposed model, we directly deploy an efficient $\ell _2$ norm regularization to achieve the similar nonnegative purpose with theoretical guarantees. Moreover, an efficient occlusion detection scheme is designed to alleviate tracking drifts, which investigates whether negative templates are selected to represent the severely occluded target. Experimental results on two benchmarks demonstrate that our NMC tracker are able to achieve superior performance to state-of-the-art methods.
Action Recognition by Multiple Features and Hyper-Sphere Multi-class SVM

In this paper we propose a novel framework for action recognition based on multiple features for improve action recognition in videos. The fusion of multiple features is important for recognizing actions as often a single feature based representation is not enough to capture the imaging variations (view-point, illumination etc.) and attributes of individuals (size, age, gender etc.). Hence, we use two kinds of features: i) a quantized vocabulary of local spatio-temporal (ST) volumes (cuboids and 2-D SIFT), and ii) the higher-order statistical models of interest points, which aims to capture the global information of the actor. We construct video representation in terms of local space-time features and global features and integrate such representations with hyper-sphere multi-class SVM. Experiments on publicly available datasets show that our proposed approach is effective. An additional experiment shows that using both local and global features provides a richer representation of human action when compared to the use of a single feature type.
Enhancing Lifetime and Quality of Data in Cluster-Based Hierarchical Routing Protocol for Wireless Sensor Network

Wireless Sensor Network (WSN) performs energy extensive tasks and it is essential to rotate sensor nodes frequently so that Cluster Head selections can be made efficiently. In this paper, we aim to improve the lifetime of sensor network by using LEACH based protocols and efficiently utilizing the limited energy available in these sensor nodes. In sensor network, the amount of data delivered at the base station is not important but it is the quality of the data which is of utmost importance. Our proposed approach significantly improves the life time and quality of data being delivered at the base station in sensor network. We evaluate our proposed approach using different sets of node energy levels and in each case our approach shows significant improvement over existing cluster-based hierarchical routing protocols. We evaluate our scheme in terms of energy consumption, life time and quality of data delivered at the base station.
Macroscopic Indeterminacy Swarm Optimization (MISO) algorithm for real-parameter search

Swarm Intelligence (SI) is a nature-inspired emergent artificial intelligence. They are often inspired by the phenomena in nature. Many proposed algorithms are focused on designing new update mechanisms with formulae and equations to emerge new solutions. Despite the techniques used in an algorithm being the key factor of the whole system, the evaluation of candidate solutions also plays an important role. In this paper, the proposed algorithm Macroscopic Indeterminacy Swarm Optimization (MISO) presents a new search scheme with indeterminate moment of evaluation. Here, we perform an experiment based on public benchmark functions. The results produced by MISO, Differential Evolution (DE) with various settings, Artificial Bee Colony (ABC), Simplified Swarm Optimization (SSO), and Particle Swarm Optimization (PSO) have been compared. The result shows MISO can achieve similar or even better performance than other algorithms.
Image Translation and Rotation on Hexagonal Structure

Image translation and rotation are becoming essential operations in many application areas such as image processing, computer graphics and pattern recognition. Conventional translation moves image from pixels to pixels and conventional rotation usually comprises of computation-intensive CORDIC operations. Traditionally, images are represented on a square pixel structure. In this paper, we perform reversible and fast image translation and rotation based on a hexagonal structure. An image represented on the hexagonal structure is a collection of hexagonal pixels of equal size. The hexagonal structure provides a more flexible and efficient way to perform image translation and rotation without losing image information. As there is not yet any available hardware for capturing image and for displaying image on a hexagonal structure, we apply a newly developed virtual hexagonal structure. The virtual hexagonal structure retains image resolution during the process of image transformations, and almost does not introduce distortion. Furthermore, images can be smoothly and easily transferred between the traditional square structure and the hexagonal structure.
Network Intrusion Detection based on LDA for payload feature selection

Anomaly Intrusion Detection System (IDS) is a statistical based network IDS which can detect attack variants and novel attacks without a priori knowledge. Current anomaly IDSs are inefficient for real-time detection because of their complex computation. This paper proposes a novel approach to reduce the heavy computational cost of an anomaly IDS. Linear Discriminant Analysis (LDA) and difference distance map are used for selection of significant features. This approach is able to transform high-dimensional feature vectors into a low-dimensional domain. The similarity between new incoming packets and a normal profile is determined using Euclidean distance on the simple, low-dimensional feature domain. The final decision will be made according to a pre-calculated threshold to differentiate normal and abnormal network packets. The proposed approach is evaluated using DARPA 1999 IDS dataset.
Mean shift for accurate number plate detection

This paper presents a robust method for number plate detection, where mean shift segmentation is used to segment color vehicle images into candidate regions. Three features are extracted in order to decide whether a candidate region contains a number plate, namely, rectangularity, aspect ratio, and edge density. Then, the Mahalanobis classifier is used with respect to the above three features to detect number plate regions accurately. The experimental results show that our algorithm produces high robustness and accuracy.
Segmenting Characters from License Plate Images with Little Prior Knowledge

In this paper, to enable a fast and robust system for automatically recognizing license plates with various appearances, new and simple but efficient algorithms are developed to segment characters from extracted license plate images. Our goal is to segment characters properly from a license plate image region. Different from existing methods for segmenting degraded machine-printed characters, our algorithms are based on very weak assumptions and use no prior knowledge about the format of the plates, in order for them to be applicable to wider applications. Experimental results demonstrate promising efficiency and flexibility of the proposed scheme.
Human Action Recognition by Radon Transform

A new feature description is used for human behaviour representation and recognition. The feature is based on Radon transforms of extracted silhouettes. Key postures are selected based on the Radon transform. Key postures are combined to construct an action template for each sequence. Linear discriminant analysis (LDA) is applied to the set of key postures to obtain low dimensional feature vectors. Different classification methods are used to classify each sequence. Experiments are carried out based on a publically available human behaviour database and the results are exciting.
Learn Concepts in Multiple-Instance Learning with Diverse Density Framework Using Supervised Mean Shift

Many machine learning tasks can be achieved by using Multiple-instance learning (MIL) when the target features are ambiguous. As a general MIL framework, Diverse Density (DD) provides a way to learn those ambiguous features by maxmising the DD estimator, and the maximum of DD estimator is called a concept. However, modeling and finding multiple concepts is often difficult especially without prior knowledge of concept number, i.e., every positive bag may contain multiple coexistent and heterogeneous concepts but we do not know how many concepts exist. In this work, we present a new approach to find multiple concepts of DD by using an supervised mean shift algorithm. Unlike classic mean shift (an unsupervised clustering algorithm), our approach for the first time introduces the class label to feature point and each point differently contributes the mean shift iterations according to its label and position. A feature point derives from an MIL instance and takes corresponding bag label. Our supervised mean shift starts from positive points and converges to the local maxima that are close to the positive points and far away from the negative points. Experiments qualitatively indicate that our approach has better properties than other DD methods.
A Novel Interactive Progressive Decoding Method for Fractal Image Compression

Fractal image compression is an efficient and effective technique in image coding. This paper presents a novel interactive progressive fractal decoding method, with which the compressed file can be transmitted incrementally and reconstructed progressively at users' side. It requires no modification to either encoder or decoder of any fractal image compression algorithm. In addition, it also provides the user-controlled decoding procedure with the inherited fractal fast decoding feature. The experimental results illustrated that the proposed progressive decoding method can be applied directly to various fractal compression techniques and especially favourable to applications where the transmission bandwidth is of great concern
Guest Editorial Introduction to the Special Issue on Dependable Wireless Vehicular Communications for Intelligent Transportation Systems (ITS)

Over the past couple of decades, transportation systems have begun to receive widespread attention from the scientific community and emerged toward Intelligent Transportation Systems (ITS). Effective vehicular connectivity techniques can significantly enhance efficiency of travel, reduce traffic incidents and improve safety, and alleviate the impact of congestion; devising the ITS experience. Furthermore, during the past decades, the volume and density of vehicles increased significantly, especially the road traffic; this lead to a dramatic increase in the number of accidents and congestion, with negative impacts on the economy, environment, and quality of people’s lives. In particular, according to the World Health Organization (WHO), road traffic injuries are estimated to be the leading cause of death for young people aged 15–29 and the ninth cause of death worldwide in 2015. The enabling communication technologies are intended to realize the frameworks that will spur an array of applications and use cases in the domain of road safety, traffic efficiency, and driver’s assistance. Although these applications will allow the dissemination and gathering of useful information among vehicles and between transportation infrastructure and vehicles in pursuance of assisting drivers to travel safely and comfortably, much effort is required to implement these practices for the success of these applications.