This paper proposes an algorithm to fix the tone inconsistency in captured video especially by mobile devices such as smartphone and black box cameras. We propose a method to stabilize the inconsistent tone of video f...
详细信息
This paper proposes an algorithm to fix the tone inconsistency in captured video especially by mobile devices such as smartphone and black box cameras. We propose a method to stabilize the inconsistent tone of video frames in which tone is adjusted for each frame with adjustment map using several key anchor frames.
This paper formulates a probabilistic security-constraint optimal power flow considering a combination of an AC system and a multi-terminal HVDC grid that can depict the future power systems. The probabilistic formula...
详细信息
ISBN:
(纸本)9781479940950
This paper formulates a probabilistic security-constraint optimal power flow considering a combination of an AC system and a multi-terminal HVDC grid that can depict the future power systems. The probabilistic formulation is discussed considering uncertainty in the generation infeed (e.g. wind power). To achieve a tractable problem we use a linearized version of the power flow equations of the combined grid where the voltage angles (of the HVAC grid) and the voltage magnitudes (of the HVDC grid) are eliminated. The flexibility introduced by the HVDC terminals is exploited for control of the power flows in a corrective way, i.e adjust their setpoints after the occurrence of a contingency. The method is applied at the three area IEEE RTS96 test system and the costs, power flows and security levels are investigated. A comparison between a deterministic and the proposed probabilistic method is done.
Sensing technologies have made the tracking of users' daily trajectories a common service, such as location based service, children/elders tracking service, etc. This information can also be analyzed to discover s...
详细信息
ISBN:
(纸本)9781479959686
Sensing technologies have made the tracking of users' daily trajectories a common service, such as location based service, children/elders tracking service, etc. This information can also be analyzed to discover some interesting and meaningful information about users. In this paper, we study the Routine Based Classification (RBC) approach for classifying users into different groups. For comparing two routines, we modify the Smith-Waterman alignment algorithm to increase the accuracy of similarity calculation. Term Frequency-Inverse Document Frequency (TF/IDF) is then used for classifying users based on their routines. To further improve the accuracy of classification, we propose the "group routine pattern" concept which refers to some common routines among the users of the same group. Our numerical results show that the group routine pattern concept yields higher classification accuracy than that of the Support Vector Machines (SVM) approach as well as that of an existing approach proposed in the literature.
With the dramatic growth of using video cameras for applications of public surveillances in recent years, detection of public threats or security issues on surveillances becomes possible nowadays. How to identify anom...
详细信息
ISBN:
(纸本)9781479952847
With the dramatic growth of using video cameras for applications of public surveillances in recent years, detection of public threats or security issues on surveillances becomes possible nowadays. How to identify anomalous behavior from surveillance videos has been identified as an effective manner for detecting critical events in the public avenue. We in this paper discuss a new application paradigm to identify anomalous moving behavior by utilizing techniques of mining trajectories which are extracted from moving objects in the surveillance video. Our experimental results show the effectiveness of our proposed algorithms, demonstrating its promising applicability in the big data era.
For a given edge-weighted graph G = (V, E, w), in which the vertices are partitioned into clusters R = {R 1 , R 2 , ... , R k }, a spanning tree of G is a clustered spanning tree if the subtrees spanning the clusters ...
详细信息
ISBN:
(纸本)9781479979820
For a given edge-weighted graph G = (V, E, w), in which the vertices are partitioned into clusters R = {R 1 , R 2 , ... , R k }, a spanning tree of G is a clustered spanning tree if the subtrees spanning the clusters are mutually disjoint. In this paper we study the problem of constructing a clustered spanning tree such that the total distance summed over all vertices of different clusters is minimized. We show that the problem is polynomial-time solvable when the number of clusters k is 2 and NP-hard for k = 3. We also present a 2-approximation algorithm for the case of 3 clusters.
Mobile wireless sensor networks may be applied to diverse areas, and have been receiving increasingly attentions. However, these studies do not seem to address the issue regarding how group of mobile sensor nodes move...
详细信息
Mobile wireless sensor networks may be applied to diverse areas, and have been receiving increasingly attentions. However, these studies do not seem to address the issue regarding how group of mobile sensor nodes move autonomously, explore and monitor area of interest without exploiting geographic information. Accordingly, this paper develops two amoeba-like algorithms, folding and elastic algorithms, to cope with the above mentioned problem. Folding algorithm operates by assigning some mobile sensor node stay in each intersection, so that it can guide and coordinate the movement of the whole group. Elastic algorithm selects a cluster head for commanding movement directions of the remaining nodes to collect necessary geographic information and determine the subsequent movements. Simulations are conducted to evaluate the two proposed algorithms.
An increase in data size, number of classes, dimension of the feature space and interclass separability in any pattern classification task, affect the performance of any classifier. It is essential to know the effect ...
详细信息
ISBN:
(纸本)9781479924059
An increase in data size, number of classes, dimension of the feature space and interclass separability in any pattern classification task, affect the performance of any classifier. It is essential to know the effect of the training dataset size on the recognition performance of a feature extraction method and classifier. In this paper, an attempt is made to measure the performance of the classifier by testing the classifier with two different datasets of different sizes. A desirable recognition performance can be achieved by data fusion in any practical classification applications, if the number of classes and multiple feature sets for pattern samples are given. A framework for feature selection and feature fusion has been proposed in this paper to increase the performance of classification. From the experimental results it is seen that there is an increase of 13.20% in the recognition accuracy.
Damage in parietal and/or motor cortex of the brain can lead to inability in proper visuo-motor coordination, hampering movement planning and execution. The objective of this work is to predict joint coordinates of ha...
详细信息
ISBN:
(纸本)9781479914821
Damage in parietal and/or motor cortex of the brain can lead to inability in proper visuo-motor coordination, hampering movement planning and execution. The objective of this work is to predict joint coordinates of hand by sequential prediction of the parietal and motor cortex Electroencephalogram (EEG) features from their occipital counterparts using artificial neural networks (ANNs). EEG signals during hand movement execution are acquired from occipital, parietal and motor cortical regions and the joint coordinates of hand are acquired using Kinect sensor. The acquired EEG signals are preprocessed followed by extraction of wavelet features and selection of the best features using Principal Component Analysis. The EEG features originating from one brain region are mapped to the features of another brain region using regression analysis on artificial neural networks with Back Propagation learning. The mapped motor cortical EEG signals are finally used to predict the hand joint coordinates using Back Propagation learning based ANN. The performances of various weight adaptation techniques for Back Propagation learning are evaluated. Regression analysis results indicate that Levenberg-Marquardt optimization based weight adaptation performed best in terms of mean squared error, slope of the best linear fit and correlation coefficient between the original values and predicted results.
Fault-tolerance has huge impact on embedded safety-critical systems. As technology that assists to the development of such improvement, Safe Node Sequence Protocol (SNSP) is designed to make part of such impact. In th...
详细信息
ISBN:
(纸本)9781479936311
Fault-tolerance has huge impact on embedded safety-critical systems. As technology that assists to the development of such improvement, Safe Node Sequence Protocol (SNSP) is designed to make part of such impact. In this paper, we present a mechanism for fault-tolerance and recovery based on the Safe Node Sequence Protocol (SNSP) to strengthen the system robustness, from which the correctness of a fault-tolerant prototype system is analyzed and verified. In order to verify the correctness of more than thirty failure modes, we have partitioned the complete protocol state machine into several subsystems, followed to the injection of corresponding fault classes into dedicated independent models. Experiments demonstrate that this method effectively reduces the size of overall state space, and verification results indicate that the protocol is able to recover from the fault model in a fault-tolerant system and continue to operate as errors occur.
Recently, a single image haze removal scheme based on dark channel prior (DCP) is presented in [1] and is getting popular because of its satisfactory performance for most of cases. However, the DCP scheme has at least...
详细信息
ISBN:
(纸本)9781479944750
Recently, a single image haze removal scheme based on dark channel prior (DCP) is presented in [1] and is getting popular because of its satisfactory performance for most of cases. However, the DCP scheme has at least three problems: halos, high computational cost and over-exposure. In our previous paper [2], a dehazing algorithm with dual dark channels was presented where high computational cost and over-exposure problems are relieved. In this paper, the objective of proposed dehazing algorithm (PDA) is to relieve the three problems in [1] simultaneously. Four examples are given to verify the PDA where comparison with the DCP scheme is made as well. The simulation results indicate that the PDA is 87.87 times, on average, faster than the DCP in the given examples. Besides, in general better color situation is found for the PDA with similar visual quality and without the three problems in the DCP scheme.
暂无评论