Search

Video-based human action recognition is currently one of the most active research areas in computer vision. Various research studies indicate that the performance of action recognition is highly dependent on the type of features being extracted and how the actions are represented. Since the release of the Kinect camera, a large number of Kinect-based human action recognition techniques have been proposed in the literature. However, there still does not exist a thorough comparison of these Kinect-based techniques under the grouping of feature types, such as handcrafted versus deep learning features and depth-based versus skeleton-based features. In this paper, we analyze and compare 10 recent Kinect-based algorithms for both cross-subject action recognition and cross-view action recognition using six benchmark datasets. In addition, we have implemented and improved some of these techniques and included their variants in the comparison. Our experiments show that the majority of methods perform better on cross-subject action recognition than cross-view action recognition, that the skeleton-based features are more robust for cross-view recognition than the depth-based features, and that the deep learning features are suitable for large datasets. [ABSTRACT FROM AUTHOR]

The aim of this paper was to test the capabilities of the Sentinel-1 radar data in downscaling Soil Moisture Active Passive (SMAP) radiometer data for high-resolution soil moisture estimation. Three different active–passive downscaling algorithms, including the brightness temperature-based downscaling algorithm (BTBDA), the soil moisture-based downscaling algorithm (SMBDA), and a change detection method (CDM), were analyzed using pairs of Sentinel-1 active and SMAP passive observations collected over a semiarid landscape in southeastern Australia from May 2015 to May 2016. While these algorithms have been tested previously, this is the first study to evaluate the three algorithms using real Sentinel-1 radar and SMAP radiometer data. The SMAP passive observations were disaggregated to 9-, 3-, and 1-km scales and then compared with ground soil moisture measurements. The results suggest that the root-mean-square error (RMSE) in downscaled soil moisture at 9-km resolution was 0.057, 0.056, and 0.067 cm3/cm3 for the BTBDA, SMBDA, and CDM, respectively. The accuracy of downscaling methods was generally decreased when applied at the finer spatial resolution. The SMBDA had overall better performance in terms of correctly detecting the soil moisture pattern and relatively lower RMSE values, and is, therefore, recommended for the combined Sentinel-1 radar and SMAP radiometer setup for soil moisture monitoring. The influence of incidence angle normalization of Sentinel-1 SAR data on downscaled soil moisture was also investigated and found to be minimal. [ABSTRACT FROM AUTHOR]

Wildfires are one of the most destructive disasters on the planet. They also significantly impact the land surface. Satellite data have been widely used to detect the outbreak and monitor the expansion of fire incidents for damage assessment and disaster management. Polar-orbiting satellite data have been used for several decades but data from geostationary satellites, which can provide observations with a high temporal resolution, have received much less attention. This paper utilizes data from FengYun-2G, a Chinese geostationary satellite, to detect wildfires in two selected research regions in January 2016. The detection algorithm systemizes image-based analysis to filter out obvious nonfire pixels and temporal analysis to confirm the true detections. Fire detection is based on comparisons between predicted and observed values. The results show that the proposed method has some advantages compared with the use of polar-orbiting satellite data, including early detection and continuous observation. The validation work is conducted based on the collection 6.1 Global Monthly Fire Location Product generated from fire detections by Moderate Resolution Imaging Spectroradiometer (MODIS) sensors. The average accuracy within the target time is 56%, while the omission error rate is over 78%. In detail, the algorithm has a lower omission error rate in Australia while it fails in detecting most of the fire pixels in India. The dominance of small fire incidents, as well as low spatial resolution greatly limit the detection ability. Many small fires were beyond the ability of Stretched Visible and Infrared Spin Scan Radiometer (S-VISSR) data when no significant fire characteristics could be captured. Future development of the algorithm will focus on improving the results by enhancing the adaption to different regions, as well as, including multisource data sets. [ABSTRACT FROM AUTHOR]

A novel canonical duality theory (CDT) is presented for solving general bilevel mixed integer nonlinear optimization governed by linear and quadratic knapsack problems. It shows that the challenging knapsack problems can be solved analytically in term of their canonical dual solutions. The existence and uniqueness of these analytical solutions are proved. NP-hardness of the knapsack problems is discussed. A powerful CDT algorithm combined with an alternative iteration and a volume reduction method is proposed for solving the NP-hard bilevel knapsack problems. Application is illustrated by benchmark problems in optimal topology design. The performance and novelty of the proposed method are compared with the popular commercial codes. [ABSTRACT FROM AUTHOR]

Performance evaluation of multi-target tracking algorithms is of great practical importance in the design, parameter optimization and comparison of tracking systems. The goal of performance evaluation is to measure the distance between two sets of tracks: the ground truth tracks and the set of estimated tracks. This paper proposes a mathematically rigorous metric for this purpose. The basis of the proposed distance measure is the recently formulated consistent metric for performance evaluation of multi-target filters, referred to as the OSPA metric. Multi-target filters sequentially estimate the number of targets and their position in the state space. The OSPA metric is therefore defined on the space of finite sets of vectors. The distinction between filtering and tracking is that tracking algorithms output tracks and a track represents a labeled temporal sequence of state estimates, associated with the same target. The metric proposed in this paper is therefore defined on the space of finite sets of tracks and incorporates the labeling error. Numerical examples demonstrate that the proposed metric behaves in a manner consistent with our expectations. [ABSTRACT FROM PUBLISHER]

This paper presents and evaluates artificial neural network (ANN) models used for macrocell path-loss prediction. Measurement data obtained by utilizing the IS-95 pilot signal from a commercial code-division multiple-access (CDMA) mobile network in rural Australia are used to train and evaluate the models. A simple neuron model and feed-forward networks with different numbers of hidden layers and neurons are evaluated regarding their training time, prediction accuracy, and generalization properties. Furthermore, different backpropagation training algorithms, such as gradient descent and Levenberg--Marquardt, are evaluated. The artificial neural network inputs are chosen to be distance to base station, parameters easily obtained from terrain path profiles, land usage, and vegetation type and density near the receiving antenna. The path-loss prediction results obtained by using the ANN models are evaluated against different versions of the semi-terrain based propagation model Recommendation ITU-R P.1546 and the Okumura--Hata model. The statistical analysis shows that a non-complex ANN model performs very well compared with traditional propagation models with regard to prediction accuracy, complexity, and prediction time. The average ANN prediction results were 1) maximum error: 22 dB; 2) mean error: 0 dB; and 3) standard deviation: 7 dB. A multilayered feedforward network trained using the standard backpropagation algorithm was compared with a neuron model trained using the Levenberg--Marquardt algorithm. It was found that the training time decreases from 150 000 to 10 iterations, while the prediction accuracy is maintained. [ABSTRACT FROM AUTHOR]

In this article, a continuous terminal sliding mode control algorithm is proposed for servo motor systems. A novel full-order terminal sliding mode surface is proposed based on the bilimit homogeneous property, such that the sliding motion is finite-time stable independent of the system's initial condition. A new continuous terminal sliding mode control algorithm is proposed to guarantee that the system states reach the sliding surface in finite-time. Not only the robustness is guaranteed by the proposed controller but also the continuity makes the control algorithm more suitable for the servo mechanical systems. Finally, a numerical example is presented to depict the advantages of the proposed control algorithm. An application in the rotary servo system is done to validate the effectiveness of the proposed control strategy. [ABSTRACT FROM AUTHOR]

The national health insurance system in Australia records details on medical services and claims provided to its population. An effective method to the discovery of temporal behavioral patterns in the data set is proposed in this paper. The method consists of a two-step approach which is applied recursively to the data set. First, a clustering algorithm is used to segment the data into classes. Then, hidden Markov models are employed to find the underlying temporal behavioral patterns. These steps are applied recursively to features extracted from the data set until convergence. The main objective is to minimize the misclassification of patient profiles into various classes. This results in a hierarchical tree model consisting of a number of classes; each class groups similar patient temporal behavioral patterns together. The capabilities of the proposed method are demonstrated through the application to a subset of the Australian national health insurance data set. It is shown that the proposed method not only clusters data into various categories of interest, but it also automatically marks the periods in which similar temporal behavioral patterns occurred. [ABSTRACT FROM AUTHOR]

We develop a new linearly-constrained recursive total least squares adaptive filtering algorithm by incorporating the linear constraints into the underlying total least squares problem using an approach similar to the method of weighting and searching for the solution (filter weights) along the input vector. The proposed algorithm outperforms the previously proposed constrained recursive least square (CRLS) algorithm when both input and output data are observed with noise. It also has a significantly smaller computational complexity than CRLS. Simulations demonstrate the efficacy of the proposed algorithm. [ABSTRACT FROM PUBLISHER]