nils-herrmann/clean_scirepeval huggingface dataset:
Saliency Detection by Fully Learning a Continuous Conditional Random Field

Salient object detection is aimed at detecting and segmenting objects that human eyes are most focused on when viewing a scene. Recently, conditional random field (CRF) is drawn renewed interest, and is exploited in this field. However, when utilizing a CRF with unary and pairwise potentials having essential parameters, most existing methods only employ manually designed parameters, or learn parameters partly for the unary potentials. Observing that the saliency estimation is a continuous labeling issue, this paper proposes a novel data-driven scheme based on a special CRF framework, the so-called continuous CRF (C-CRF), where parameters for both unary and pairwise potentials are jointly learned. The proposed C-CRF learning provides an optimal way to integrate various unary saliency features with pairwise cues to discover salient objects. To the best of our knowledge, the proposed scheme is the first to completely learn a C-CRF for saliency detection. In addition, we propose a novel formulation of pairwise potentials that enables learning weights for different spatial ranges on a superpixel graph. The proposed C-CRF learning-based saliency model is tested on 6 benchmark datasets and compared with 11 existing methods. Our results and comparisons have provided further support to the proposed method in terms of precision-recall and F-measure. Furthermore, incorporating existing saliency models with pairwise cues through the C-CRF are shown to provide marked boosting performance over individual models.
Multiresolution feature detection using a family of isotropic bandpass filters

Presents a novel method which uses a special type of multi-scale isotropic band-pass filters to detect image landmark and corner features. This paper mainly contributes to the solutions of the following problems: (1) defining a general family of feature detectors under a unified framework that are able to enhance and detect the desired features; (2) explaining theoretically and experimentally why these feature points can be detected by the proposed detectors; and (3) extending the detectors to multi-scale versions for jointly achieving good detectability and localization where an automatic scale selection method is applied. The paper then presents several applications for detecting landmarks and corners using the proposed methods, in order to illustrate their usage. These include detecting landmarks from gesture images (of the face and hand), from airborne and vehicle-borne IR landmine images, and from images containing object corners. Experiments have been performed using the proposed detectors to these applications. Some comparisons and evaluations have also been performed. The results have demonstrated the effectiveness of the proposed detectors in terms of feature detectability and localization.
Big data from smart grids

This paper gives a general introduction to “Big Data” in general and to Big Data in smart grids in particular. Large amounts of data (Big Data) contains a lots of information, however developing the analytics to extract such information is a big challenge due to some of the particular characteristics of Big Data. This paper investigates some existing analytic algorithms, especially deep learning algorithms, as tools for handling Big Data. The paper also explains the potential for deep learning application in smart grids.
Head pose classification by multi-class AdaBoost with fusion of RGB and depth images

This paper addresses issues in multi-class visual object classification, where sequential learning and sensor fusion are exploited in a unified framework. We adopt a novel method for head pose classification using RGB and depth images. The main contribution of this paper is a multi-class AdaBoost classification framework where information obtained from RGB and depth modalities interactively complement each other. This is achieved by learning weak hypotheses for RGB and depth modalities independently with the same sampling weight in the boosting structure, and then fusing them through learning a sub-ensemble. Experiments are conducted on a Kinect RGB-D face image dataset containing 4098 face images in 5 different poses. Results have shown good performance in obtaining high classification rate (99.76%) with low false alarms on the dataset.
Visual Tracking via Nonnegative Regularization Multiple Locality Coding

This paper presents a novel object tracking method based on approximated Locality-constrained Linear Coding (LLC). Rather than using a non-negativity constraint on encoding coefficients to guarantee these elements nonnegative, in this paper, the non-negativity constraint is substituted for a conventional l2 norm regularization term in approximated LLC to obtain the similar nonnegative effect. And we provide a detailed and adequate explanation in theoretical analysis to clarify the rationality of this replacement. Instead of specifying fixed K nearest neighbors to construct the local dictionary, a series of different dictionaries with pre-defined numbers of nearest neighbors are selected. Weights of these various dictionaries are also learned from approximated LLC in the similar framework. In order to alleviate tracking drifts, we propose a simple and efficient occlusion detection method. The occlusion detection criterion mainly depends on whether negative templates are selected to represent the severe occluded target. Both qualitative and quantitative evaluations on several challenging sequences show that the proposed tracking algorithm achieves favorable performance compared with other state-of-the-art methods.
Effective small DIM target detection by local connectedness constraint

The main drawback of conventional filtering based methods for small dim target (SDT) detection is they could not guarantee sufficient suppression ability towards trivial high frequency component which belongs to background, such as strong corners and edges. To overcome this bottleneck, this paper proposes an effective SDT detection algorithm by using local connectedness constraint. Our method provides direct control for target size, ensure high accuracy and could be easily embedded into the classical sliding-window based framework. The effectiveness of the proposed method is validated using images with cluttered background.
A method to evaluate harmonic model-based estimations under non-white measured noise

Automatic extracting information from power-system event recordings requires applications of signal-processing estimation techniques whose performance has been verified under white noise. This paper proposes a method to test these techniques under real power-system noise, which is very different from white noise, to evaluate their application feasibility. The first part of the paper describes the evaluation method used to evaluate the techniques in a statistical sense and a method to extract noise from measured power-system recordings. The second part of the paper focuses on the evaluation of a number of harmonic model-based techniques under non-white noise, including: Kalman filter, MUSIC, ESPRIT, and segmentation algorithms. The paper shows that for the Kalman filter, a very high order with high computational burden is necessary only if high frequency components are of interest. The application of MUSIC, ESPRIT, and the segmentation algorithms under natural power-system noise is shown to be feasible.
A fault location technique for two and three terminal lines using high frequency fault clearing transients

This paper suggests that a voltage recorder, placed next to a circuit breaker not as usual on the side of the substation, but on the side of the transmission line, may reveal the location of permanent faults. Two different approaches on estimating the fault location are presented here: a frequency domain approach and a time domain approach. These methods are tested and compared with simulations of typical transmission systems using the Electromagnetic Transients Program (EMTP). Two typical line configurations are considered: two terminal lines and three terminal lines.
Video-based detection and analysis of driver distraction and inattention

This paper addresses two issues for mitigating driver distraction/inattention by using novel video analysis techniques: (a) inside an ego vehicle, driver inattention is monitored through first tracking drivers face/eye region using Riemannian manifold-based particle filters, followed by recognition of dynamic eye states using PPCA (probabilistic principal component analysis) and SVM (support vector machine) classifier. Frequencies of eye blinking and eye closure are used as the indication of sleepy and warning sign is then generated for recommendation; (b) outside an ego vehicle, road traffic is also analyzed. Surrounding vehicles (in both directions) are tracked, and their states are analyzed by self-calibrated cameras using view-geometries and road information. Parameters (e.g. distance, velocity, number) of tracked vehicles are estimated on the road ground plane in the 3D world coordinate system. These pieces of information are provided for mitigating drivers inattention. The main novelties of the proposed scheme include facial geometry based eye region detection for eye closure identification, combined tracking and detection of vehicles, new formulae derived in camera self-calibration, and the hybrid system that handles both daytime and nighttime scenarios. Experiments have been conducted on video data in two different types of camera settings, i.e., captured inside and outside a vehicle. Preliminary tests have been conducted, results and performance evaluation have indicated the effectiveness of the proposed methods.
Characterization of voltage variations in the very-short time-scale

This letter presents a method for characterizing the fast voltage variations that occur on a time scale between the subsecond fluctuations covered by the flickermeter standard and the 10-min values covered by standards like EN 50160 The method is fully compatible with IEC 61000-4-30 class A. The new characteristic is correlated to small switching actions, such as domestic load switching and transformer tap-changer operation.
Online detection of snowcoverage and swing angles of electrical insulators on power transmission lines using videos

A potential fatal problem for electrical power delivery through power lines in Northern countries is when snow or ice accumulates on electrical insulators. This could lead to snow or ice-induced outages and voltage collapse, causing huge economic loss. Further, large swing angles due to wind may cause short circuits. This paper presents a novel video surveillance system for detecting snow coverage on electric insulators and swing angles of insulators using videos from a remote outdoor 420 kV power transmission line. To the best of our knowledge, it is the first insulator snow surveillance system base on automatic image analysis techniques. We propose using hybrid techniques by combining histograms, boundaries and template cross-correlations for analyzing a broad range of scenarios caused by changing weather and lighting conditions. Experiments on videos captured during several month periods have shown promising and valuable estimation results. For image pixels related to snow on insulators, our system has yielded an average detection rate of 93% for good quality images and 67.6% for poor quality images, and a corresponding average false alarm of 9% and 18.1%.
Optimal Gradient Encoding Schemes for Diffusion Tensor and Kurtosis Imaging

Diffusion-derived parameters find application in characterizing pathological and developmental changes in living tissues. Robust estimation of these parameters is important because they are used for medical diagnosis. An optimal gradient encoding scheme (GES) is one that minimizes the variance of the estimated diffusion parameters. This paper proposes a method for optimal GES design for two diffusion models: high-order diffusion tensor (HODT) imaging and diffusion kurtosis imaging (DKI). In both cases, the optimal GES design problem is formulated as a D-optimal (minimum determinant) experiment design problem. Then, using convex relaxation, it is reformulated as a semidefinite programming problem. Solving these problems we show that: 1) there exists a D-optimal solution for DKI that is simultaneously D-optimal for second- and fourth-order diffusion tensor imaging (DTI); 2) the traditionally used icosahedral scheme is approximately D-optimal for DTI and DKI; 3) the proposed D-optimal design is rotation invariant; 4) the proposed method can be used to compute the optimal design (b-values and directions) for an arbitrary number of measurements and shells; and 5) using the proposed method one can obtain uniform distribution of gradient encoding directions for a typical number of measurements. Importantly, these theoretical findings provide the first mathematical proof of the optimality of uniformly distributed GESs for DKI and HODT imaging. The utility of the proposed method is further supported by the evaluation results and comparisons with with existing methods.
Salient object detection using normalized cut and geodesics

Recently the Normalized cut (Ncut) has been introduced to salient object detection [1, 2]. In this paper we validate that instead of proposing new detection models that leverage the Ncut, the previous geodesic saliency detection model which computes shortest paths on a graph can be adapted to eigenvectors of the Ncut to produce superior performance. Since the Ncut partitions a graph in a normalized energy minimization fashion, resulting eigenvectors contain decent cluster information that can group visual contents. Combining it with the existing geodesic saliency detection is conducive to highlighting salient objects uniformly, yielding to improved detection accuracy. Experiments by comparing with 12 existing methods on four benchmark datasets show the proposed method significantly outperforms the original geodesic saliency model and achieves comparable performance to state-of-the-art methods.
Bayesian online learning on Riemannian manifolds using a dual model with applications to video object tracking

This paper proposes a new Bayesian online learning method on a Riemannian manifold for video objects. The basic idea is to consider the dynamic appearance of an object as a point moving on a manifold, where a dual model is applied to estimate the posterior trajectory of this moving point at each time instant under the Bayesian framework. The dual model uses two state variables for modeling the online learning process on Riemannian manifolds: one is for object appearances on Riemannian manifolds, another is for velocity vectors in tangent planes of manifolds. The key difference of our method as compared with most existing Riemannian manifold tracking methods is to compute the Riemannian mean from a set of particle manifold points at each time instant rather than using a sliding window of manifold points at different times. Next to that, we propose to use Gabor filter outputs on partitioned sub-areas of object bounding box as features, from which the covariance matrix of object appearance is formed. As an application example, the proposed online learning is employed to a Riemannian manifold object tracking scheme where tracking and online learning are performed alternatively. Experiments are performed on both visual-band videos and infrared videos, and compared with two existing manifold trackers that are most relevant. Results have shown significant improvement in terms of tracking drift, tightness and accuracy of tracked boxes especially for objects with large pose changes.
Normalized cut-based saliency detection by adaptive multi-level region merging

Existing salient object detection models favor over-segmented regions upon which saliency is computed. Such local regions are less effective on representing object holistically and degrade emphasis of entire salient objects. As a result, the existing methods often fail to highlight an entire object in complex background. Toward better grouping of objects and background, in this paper, we consider graph cut, more specifically, the normalized graph cut (Ncut) for saliency detection. Since the Ncut partitions a graph in a normalized energy minimization fashion, resulting eigenvectors of the Ncut contain good cluster information that may group visual contents. Motivated by this, we directly induce saliency maps via eigenvectors of the Ncut, contributing to accurate saliency estimation of visual clusters. We implement the Ncut on a graph derived from a moderate number of superpixels. This graph captures both intrinsic color and edge information of image data. Starting from the superpixels, an adaptive multi-level region merging scheme is employed to seek such cluster information from Ncut eigenvectors. With developed saliency measures for each merged region, encouraging performance is obtained after across-level integration. Experiments by comparing with 13 existing methods on four benchmark datasets, including MSRA-1000, SOD, SED, and CSSD show the proposed method, Ncut saliency, results in uniform object enhancement and achieves comparable/better performance to the state-of-the-art methods.
Network-Adaptive Frame-Expansion-Based Packet Video Coding for Erasure Channels

This paper proposes a novel error-resilient packet video coding method which is designed to operate on unreliable IP networks suffering from large bursts of packet losses. The main novelties of the proposed system are: (1) A Bayesian packet loss predictor is employed to dynamically predict the packet loss probabilities; (2) A harmonic frame-expansion is applied to the video stream to add error-resilience. This includes dynamically choosing the size of the expansions. (3) Error-propagation is reduced by filtering out error-prone high-frequency components from reference images. This means that the proposed video codec method does not need to switch between the inter and intra coding modes. (4) Theoretical analysis of the video performance is given. Our preliminary simulations have shown that the frame expansion method can provide excellent resilience to video packet losses. The system has generated high quality videos at low bit-rates (64kbs) on simulated networks with the packet loss probability ranging from 5% to 20%. Visual inspection has shown that under similar PSNRs, the resulting videos have noticeable less visual artifacts as compared with those from the conventional codecs
Adaptive appearance learning for visual object tracking

This paper addresses online learning of reference object distribution in the context of two hybrid tracking schemes that combine the mean shift with local point feature correspondences, and the mean shift under the Bayesian framework, respectively. The reference object distribution is built up by a kernel-weighted color histogram. The main contributions of the proposed schemes includes: (a) an adaptive learning strategy that seeks to update the reference object distribution when the changes are caused by the intrinsic object dynamic without partial occlusion/intersection; (b) novel dynamic maintenance of object feature points by exploring both foreground and background sets; (c) integration of adaptive appearance and local point features in joint object appearance similarity and local point features correspondences-based tracker to improve [7]; (d) integration of adaptive appearance in joint appearance similarity and particle filter tracker under the Bayesian framework to improve [10]. Experimental results on a range of videos captured by a dynamic/stationary camera demonstrate the effectiveness of the proposed schemes in terms of robustness to partial occlusions, tracking drifts and tightness and accuracy of tracked bounding box. Comparisons are also made with the two hybrid trackers together with 3 existing trackers.
Joint anisotropic mean shift and consensus point feature correspondences for object tracking in video

We propose a novel tracking scheme that jointly employs point feature correspondences and object appearance similarity. For selecting point correspondences, we use a subset of scaleinvariant point features from SIFT that agree with a pre-defined affine transformation. The selected consensus points are then used for pre-selecting candidate regions. For appearance similarity based tracking, we employ an existing anisotropic mean shift, from which the formula for estimating bounding box parameters (width, height, orientation and center) are derived. A switching criterion is utilized to handle the situation where only a small number of point correspondences is found. Experiments and evaluation are performed on tracking moving objects on videos where objects may contain partial occlusions, intersection, deformation and pose changes among other transforms. Our comparisons with two existing methods have shown that the proposed scheme has yielded marked improvement, especially in terms of reducing tracking drifts, of robustness to occlusions, and of tightness and accuracy of tracked bounding box.
Trace of Flicker Sources by Using the Quantity of Flicker Power

Industries that produce flicker are often placed close to each other and connected to the same power grid system. This implies that the measured flicker level at the point of common coupling (PCC) is a result of contribution from a number of different flicker sources. In a mitigation process it is essential to know which one of the flicker sources is the dominant one. Therefore this paper proposes a method to determine the flicker propagations and trace the flicker sources by using flicker power measurements. Flicker power is considered as a quantity containing both sign and magnitude. The sign determines if a flicker source is placed downstream or upstream with respect to a given monitoring point and the magnitude is used to determine the propagation of flicker power throughout the power network and to trace the dominant flicker source. This paper covers the theoretical background of flicker power and describes a novel method for calculation of flicker power that can be implemented in a power network analyzer. Also a conducted field test based on the proposed method is described in the paper.
Tracking visual and infrared objects using joint Riemannian manifold appearance and affine shape modeling

This paper addresses the problem of object tracking from visual and infrared videos captured either by a dynamic or stationary camera where objects contain large pose changes. We propose a novel object tracking scheme that exploits the geometrical structure of Riemannian manifold and piecewise geodesics under a Bayesian framework. Two particle filters are alternatingly employed for tracking dynamic objects. One for online learning object appearances on Riemannian manifolds using tracked candidates, another for tracking object bounding box parameters with appearances on the manifold embedded. The rationale for obtaining this enhanced manifold tracker as compared with existing ones is to introduce an additional state variable, such that not only the manifold point representing the object is updated, but also the velocity of dynamic manifold point is estimated. Main contributions of the paper include: (a) propose an online appearance learning strategy by a particle filter on the manifold; (b) an object tracker that incorporates the manifold appearance for prediction under a particle filter framework; (c) use partitioned sub-regions of object bounding box that incorporates the spatial information in the appearance; (d) use Gabor features in different frequencies and orientations in partitioned sub-regions for IR (infrared) video objects. Hence, the proposed tracking scheme is applicable to both visual and IR videos. Experiments on videos where objects contain significant pose changes show very robust tracking results. The proposed scheme is also compared with two most relevant manifold tracking methods, results have shown much improved tracking performance in terms of tracking drift and tightness and accuracy of tracked boxes.