Searcharxiv⌕ Search

arXiv subjects

Rui Fan

Publications and source records attributed to Rui Fan.

144 records · Page 8Linked to original sources

Convolutional Neural Network and Transfer Learning for High Impedance Fault Detection

This letter presents a novel high impedance fault (HIF) detection approach using a convolutional neural network (CNN). Compared to traditional artificial neural networks, a CNN offers translation invariance and it can accurately detect HIFs in spite of variance and noise in the input data. A transfer learning method is used to address the common challenge of a system with little training data. Extensive studies have demonstrated the accuracy and effectiveness of using a CNNbased approach for HIF detection.

eess.SP↗

Real-Time Dense Stereo Embedded in A UAV for Road Inspection

The condition assessment of road surfaces is essential to ensure their serviceability while still providing maximum road traffic safety. This paper presents a robust stereo vision system embedded in an unmanned aerial vehicle (UAV). The perspective view of the target image is first transformed into the reference view, and this not only improves the disparity accuracy, but also reduces the algorithm's computational complexity. The cost volumes generated from stereo matching are then filtered using a bilateral filter. The latter has been proved to be a feasible solution for the functional minimisation problem in a fully connected Markov random field model. Finally, the disparity maps are transformed by minimising an energy function with respect to the roll angle and disparity projection model. This makes the damaged road areas more distinguishable from the road surface. The proposed system is implemented on an NVIDIA Jetson TX2 GPU with CUDA for real-time purposes. It is demonstrated through experiments that the damaged road areas can be easily distinguished from the transformed disparity maps.

cs.CV↗

Using DP Towards A Shortest Path Problem-Related Application

The detection of curved lanes is still challenging for autonomous driving systems. Although current cutting-edge approaches have performed well in real applications, most of them are based on strict model assumptions. Similar to other visual recognition tasks, lane detection can be formulated as a two-dimensional graph searching problem, which can be solved by finding several optimal paths along with line segments and boundaries. In this paper, we present a directed graph model, in which dynamic programming is used to deal with a specific shortest path problem. This model is particularly suitable to represent objects with long continuous shape structure, e.g., lanes and roads. We apply the designed model and proposed an algorithm for detecting lanes by formulating it as the shortest path problem. To evaluate the performance of our proposed algorithm, we tested five sequences (including 1573 frames) from the KITTI database. The results showed that our method achieves an average successful detection precision of 97.5%.

cs.CV↗

Mobile Robot Localisation and Navigation Using LEGO NXT and Ultrasonic Sensor

Mobile robots are becoming increasingly important both for individuals and industries. Mobile robotic technology is not only utilised by experts in this field but is also very popular among amateurs. However, implementing a mobile robot to perform tasks autonomously can be expensive because of the need for various types of sensors and the high price of robot platforms. Hence, in this paper we present a mobile robot localisation and navigation system which uses a LEGO ultrasonic sensor in an indoor map based on the LEGO MINDSTORM NXT. This provides an affordable and ready-to-use option for most robot fans. In this paper, an effective method is proposed to extract useful information from the distorted readings collected by the ultrasonic sensor. Then, the particle filter is used to localise the robot. After robot's position is estimated, a sampling-based path planning method is proposed for the robot navigation. This method reduces the robot accumulative motion error by minimising robot turning times and covering distances. The robot localisation and navigation algorithms are implemented in MATLAB. Simulation results show an average accuracy between 1 and 3 cm for three different indoor map locations. Furthermore, experiments performed in a real setup show the effectiveness of the proposed methods.

cs.RO↗

Real-Time Stereo Vision for Road Surface 3-D Reconstruction

Stereo vision techniques have been widely used in civil engineering to acquire 3-D road data. The two important factors of stereo vision are accuracy and speed. However, it is very challenging to achieve both of them simultaneously and therefore the main aim of developing a stereo vision system is to improve the trade-off between these two factors. In this paper, we present a real-time stereo vision system used for road surface 3-D reconstruction. The proposed system is developed from our previously published 3-D reconstruction algorithm where the perspective view of the target image is first transformed into the reference view, which not only increases the disparity accuracy but also improves the processing speed. Then, the correlation cost between each pair of blocks is computed and stored in two 3-D cost volumes. To adaptively aggregate the matching costs from neighbourhood systems, bilateral filtering is performed on the cost volumes. This greatly reduces the ambiguities during stereo matching and further improves the precision of the estimated disparities. Finally, the subpixel resolution is achieved by conducting a parabola interpolation and the subpixel disparity map is used to reconstruct the 3-D road surface. The proposed algorithm is implemented on an NVIDIA GTX 1080 GPU for the real-time purpose. The experimental results illustrate that the reconstruction accuracy is around 3 mm.

cs.CV↗

Multiple Lane Detection Algorithm Based on Optimised Dense Disparity Map Estimation

Lane detection is very important for self-driving vehicles. In recent years, computer stereo vision has been prevalently used to enhance the accuracy of the lane detection systems. This paper mainly presents a multiple lane detection algorithm developed based on optimised dense disparity map estimation, where the disparity information obtained at time t_{n} is utilised to optimise the process of disparity estimation at time t_{n+1}. This is achieved by estimating the road model at time t_{n} and then controlling the search range for the disparity estimation at time t_{n+1}. The lanes are then detected using our previously published algorithm, where the vanishing point information is used to model the lanes. The experimental results illustrate that the runtime of the disparity estimation is reduced by around 37% and the accuracy of the lane detection is about 99%.

cs.CV↗

Real-Time Subpixel Fast Bilateral Stereo

Stereo vision technique has been widely used in robotic systems to acquire 3-D information. In recent years, many researchers have applied bilateral filtering in stereo vision to adaptively aggregate the matching costs. This has greatly improved the accuracy of the estimated disparity maps. However, the process of filtering the whole cost volume is very time consuming and therefore the researchers have to resort to some powerful hardware for the real-time purpose. This paper presents the implementation of fast bilateral stereo on a state-of-the-art GPU. By highly exploiting the parallel computing architecture of the GPU, the fast bilateral stereo performs in real time when processing the Middlebury stereo datasets.

cs.CV↗

A Novel Disparity Transformation Algorithm for Road Segmentation

The disparity information provided by stereo cameras has enabled advanced driver assistance systems to estimate road area more accurately and effectively. In this paper, a novel disparity transformation algorithm is proposed to extract road areas from dense disparity maps by making the disparity value of the road pixels become similar. The transformation is achieved using two parameters: roll angle and fitted disparity value with respect to each row. To achieve a better processing efficiency, golden section search and dynamic programming are utilised to estimate the roll angle and the fitted disparity value, respectively. By performing a rotation around the estimated roll angle, the disparity distribution of each row becomes very compact. This further improves the accuracy of the road model estimation, as demonstrated by the various experimental results in this paper. Finally, the Otsu's thresholding method is applied to the transformed disparity map and the roads can be accurately segmented at pixel level.

cs.CV↗

Does putting your emotions into words make you feel better? Measuring the minute-scale dynamics of emotions from online data

Studies of affect labeling, i.e. putting your feelings into words, indicate that it can attenuate positive and negative emotions. Here we track the evolution of individual emotions for tens of thousands of Twitter users by analyzing the emotional content of their tweets before and after they explicitly report having a strong emotion. Our results reveal how emotions and their expression evolve at the temporal resolution of one minute. While the expression of positive emotions is preceded by a short but steep increase in positive valence and followed by short decay to normal levels, negative emotions build up more slowly, followed by a sharp reversal to previous levels, matching earlier findings of the attenuating effects of affect labeling. We estimate that positive and negative emotions last approximately 1.25 and 1.5 hours from onset to evanescence. A separate analysis for male and female subjects is suggestive of possible gender-specific differences in emotional dynamics.

cs.SI↗

Real-time stereo vision-based lane detection system

The detection of multiple curved lane markings on a non-flat road surface is still a challenging task for automotive applications. To make an improvement, the depth information can be used to greatly enhance the robustness of the lane detection systems. The proposed system in this paper is developed from our previous work where the dense vanishing point Vp is estimated globally to assist the detection of multiple curved lane markings. However, the outliers in the optimal solution may severely affect the accuracy of the least squares fitting when estimating Vp. Therefore, in this paper we use Random Sample Consensus to update the inliers and outliers iteratively until the fraction of the number of inliers versus the total number exceeds our pre-set threshold. This significantly helps the system to overcome some suddenly changing conditions. Furthermore, we propose a novel lane position validation approach which provides a piecewise weight based on Vp and the gradient to reduce the gradient magnitude of the non-lane candidates. Then, we compute the energy of each possible solution and select all satisfying lane positions for visualisation. The proposed system is implemented on a heterogeneous system which consists of an Intel Core i7-4720HQ CPU and a NVIDIA GTX 970M GPU. A processing speed of 143 fps has been achieved, which is over 38 times faster than our previous work. Also, in order to evaluate the detection precision, we tested 2495 frames with 5361 lanes from the KITTI database (1637 lanes more than our previous experiment). It is shown that the overall successful detection rate is improved from 98.7% to 99.5%.

cs.CV↗

A Comparative Study of Interface Techniques for Transmission and Distribution Dynamic Co-Simulation

Transmission and distribution dynamic co-simulation is a practical and effective approach to leverage existing simulation tools for transmission and distribution systems to simulate dynamic stability and performance of transmission and distribution systems in a systematic manner. Given that these tools are developed as stand-alone programs and there are inherent differences between them, interface techniques become critical to bridge them. Two important unsolved questions are: 1) which interface technique is better and should be used, and 2) how the modeling and simulation capabilities in these tools that are available and can be exploited for co-simulation should be considered when selecting an interface technique. To address these questions, this paper presents a comparative study for different interface techniques that can be employed for T and D dynamic co-simulation. The study provides insights into the pros and cons of each interface technique, and helps researchers make informed decisions on choosing the interface techniques.

eess.SY↗

An agent-based model for emotion contagion and competition in online social media

Recent studies suggest that human emotions diffuse in not only real-world communities but also online social media. More and more mechanisms beyond emotion contagion are revealed, including emotion correlations which indicate their influence and the coupling of emotion diffusion and network structure such as tie strength. Besides, different emotions might even compete in shaping the public opinion. However, a comprehensive model that considers up-to-date findings to replicate the patterns of emotion contagion in online social media is still missing. In this paper, to bridge this vital gap, we propose an agent-based emotion contagion model which combines features of emotion influence and tie strength preference in the dissemination process. The simulation results indicate that anger-dominated users have higher vitality than joy-dominated ones, and anger prefers weaker ties than joy in diffusion, which could make it easier to spread between online groups. Moreover, anger's high influence makes it competitive and easily to dominate the community, especially when negative public events occur. It is also surprisingly revealed that as the ratio of anger approaches joy with a gap less than 10%, angry tweets and users will eventually dominate the online social media and arrives the collective outrage in the cyber space. The critical gap disclosed here can be indeed warning signals at early stages for outrage controlling in online social media. All the parameters of the presented model can be easily estimated from the empirical observations and their values from historical data could help reproduce the emotion contagion of different circumstances. Our model would shed lights on the study of multiple issues like forecasting of emotion contagion in terms of computer simulations.

cs.SI↗

A GPU-Based Solution to Fast Calculation of Betweenness Centrality on Large Weighted Networks

Recent decades have witnessed the tremendous development of network science, which indeed brings a new and insightful language to model real systems of different domains. Betweenness, a widely employed centrality in network science, is a decent proxy in investigating network loads and rankings. However, the extremely high computational cost greatly prevents its applying on large networks. Though several parallel algorithms have been presented to reduce its calculation cost on unweighted networks, a fast solution for weighted networks, which are in fact more ubiquitous than unweighted ones in reality, is still missing. In this study, we develop an efficient parallel GPU-based approach to boost the calculation of betweenness centrality on very large and weighted networks. Comprehensive and systematic evaluations on both synthetic and real-world networks demonstrate that our solution can arrive the performance of 30x to 150x speedup over the CPU implementation by integrating the work-efficient and warp-centric strategies. Our algorithm is completely open-sourced and free to the community and it is public available through https://dx.doi.org/10.6084/m9.figshare.4542405. Considering the pervasive deployment and declining price of GPU on personal computers and servers, our solution will indeed offer unprecedented opportunities for exploring the betweenness related problems in network science.

cs.SI↗

Higher contagion and weaker ties mean anger spreads faster than joy in social media

Increasing evidence suggests that, similar to face-to-face communications, human emotions also spread in online social media. However, the mechanisms underlying this emotional contagion, for example, whether different feelings spread in unlikely ways or how the spread of emotions relates to the social network, is rarely investigated. Indeed, because of high costs and spatio-temporal limitations, explorations of this topic are challenging using conventional questionnaires or controlled experiments. Because they are collection points for natural affective responses of massive individuals, online social media sites offer an ideal proxy for tackling this issue from the perspective of computational social science. In this paper, based on the analysis of millions of tweets in Weibo, surprisingly, we find that anger is more contagious than joy, indicating that it can spark more angry follow-up tweets. Moreover, regarding dissemination in social networks, anger travels easily along weaker ties than joy, meaning that it can infiltrate different communities and break free of local traps because strangers share such content more often. Through a simple diffusion model, we reveal that greater contagion and weaker ties function cooperatively to speed up anger's spread. The diffusion of real-world events with different dominant emotions provides further testimony to the findings. To the best of our knowledge, this is the first time that quantitative long-term evidence has been presented that reveals a difference in the mechanism by which joy and anger are disseminated. Our findings shed light on both personal anger management in human communications and on controlling collective outrage in cyberspace.

cs.SI↗

Sentiment Analysis based on User Tag for Traditional Chinese Medicine in Weibo

With the acceptance of Western culture and science, Traditional Chinese Medicine (TCM) has become a controversial issue in China. So, it's important to study the public's sentiment and opinion on TCM. The rapid development of online social network, such as twitter, make it convenient and efficient to sample hundreds of millions of people for the aforementioned sentiment study. To the best of our knowledge, the present work is the first attempt that applies sentiment analysis to the domain of TCM on Sina Weibo (a twitter-like microblogging service in China). In our work, firstly we collect tweets topic about TCM from Sina Weibo, and label the tweets as supporting TCM and opposing TCM automatically based on user tag. Then, a support vector machine classifier has been built to predict the sentiment of TCM tweets without labels. Finally, we present a method to adjust the classifier result. The performance of F-measure attained with our method is 97%.

cs.CL↗

Energy-Efficient Multiprocessor Scheduling for Flow Time and Makespan

We consider energy-efficient scheduling on multiprocessors, where the speed of each processor can be individually scaled, and a processor consumes power $s^α$ when running at speed $s$, for $α>1$. A scheduling algorithm needs to decide at any time both processor allocations and processor speeds for a set of parallel jobs with time-varying parallelism. The objective is to minimize the sum of the total energy consumption and certain performance metric, which in this paper includes total flow time and makespan. For both objectives, we present instantaneous parallelism clairvoyant (IP-clairvoyant) algorithms that are aware of the instantaneous parallelism of the jobs at any time but not their future characteristics, such as remaining parallelism and work. For total flow time plus energy, we present an $O(1)$-competitive algorithm, which significantly improves upon the best known non-clairvoyant algorithm and is the first constant competitive result on multiprocessor speed scaling for parallel jobs. In the case of makespan plus energy, which is considered for the first time in the literature, we present an $O(\ln^{1-1/α}P)$-competitive algorithm, where $P$ is the total number of processors. We show that this algorithm is asymptotically optimal by providing a matching lower bound. In addition, we also study non-clairvoyant scheduling for total flow time plus energy, and present an algorithm that achieves $O(\ln P)$-competitive for jobs with arbitrary release time and $O(\ln^{1/α}P)$-competitive for jobs with identical release time. Finally, we prove an $Ω(\ln^{1/α}P)$ lower bound on the competitive ratio of any non-clairvoyant algorithm, matching the upper bound of our algorithm for jobs with identical release time.

cs.DS↗

Anger is More Influential Than Joy: Sentiment Correlation in Weibo

Recent years have witnessed the tremendous growth of the online social media. In China, Weibo, a Twitter-like service, has attracted more than 500 million users in less than four years. Connected by online social ties, different users influence each other emotionally. We find the correlation of anger among users is significantly higher than that of joy, which indicates that angry emotion could spread more quickly and broadly in the network. While the correlation of sadness is surprisingly low and highly fluctuated. Moreover, there is a stronger sentiment correlation between a pair of users if they share more interactions. And users with larger number of friends posses more significant sentiment influence to their neighborhoods. Our findings could provide insights for modeling sentiment influence and propagation in online social networks.

cs.SI↗

The ground state of a mixture of two species of fermionic atoms in 1D optical lattice

In this paper, we investigate the ground state properties of a mixture of two species of fermionic atoms in one-dimensional optical lattice, as described by the asymmetric Hubbard model. The quantum phase transition from density wave to phase separation is investigated by studying both the corresponding charge order parameter and quantum entanglement. A rigorous proof that even for the single hole doping case, the density wave is unstable to the phase separation in the infinite U limit, is given. Therefore, our results are quite instructive for both on-going experiments on strongly correlated cold-atomic systems and traditional heavy fermion systems.

cond-mat.str-el↗