Image classification based on bag-of-words(BOW)has a broad application prospect in pattern recognition field but the shortcomings such as single feature and low classification accuracy are apparent.To deal with this problem,this paper proposes to combine two ingredients:(i)Three features with functions of mutual complementation are adopted to describe the images,including pyramid histogram of words(PHOW),pyramid histogram of color(PHOC)and pyramid histogram of orientated gradients(PHOG).(ii)An adaptive feature-weight adjusted image categorization algorithm based on the SVM and the decision level fusion of multiple features are employed.Experiments are carried out on the Caltech101 database,which confirms the validity of the proposed approach.The experimental results show that the classification accuracy rate of the proposed method is improved by 7%-14%higher than that of the traditional BOW methods.With full utilization of global,local and spatial information,the algorithm is much more complete and flexible to describe the feature information of the image through the multi-feature fusion and the pyramid structure composed by image spatial multi-resolution decomposition.Significant improvements to the classification accuracy are achieved as the result.
At present, the studies on multi-team antagonistic games(MTAGs) are still in the early stage, because this complicated problem involves not only incompleteness of information and conflict of interests, but also selection of antagonistic targets.Therefore, based on the previous researches, a new framework is proposed in this paper, which is dynamic multi-team antagonistic games with incomplete information(DMTAGII) model.For this model, the corresponding concept of perfect Bayesian Nash equilibrium(PBNE) is established and the existence of PBNE is also proved. Besides, an interactive iteration algorithm is introduced according to the idea of the best response for solving the equilibrium. Then, the scenario of multiple unmanned aerial vehicles(UAVs) against multiple military targets is studied to solve the problems of tactical decision making based on the DMTAGII model. In the process of modeling, the specific expressions of strategy, status and payoff functions of the games are considered, and the strategy is coded to match the structure of genetic algorithm so that the PBNE can be solved by combining the genetic algorithm and the interactive iteration algorithm.Finally, through the simulation the feasibility and effectiveness of the DMTAGII model are verified. Meanwhile, the calculated equilibrium strategies are also found to be realistic, which can provide certain references for improving the autonomous ability of UAV systems.
The problem of distributed coordinated tracking control for networked Euler-Lagrange systems without velocity measurements is investigated. Under the condition that only a portion of the followers have access to the leader, sliding mode estimators are developed to estimate the states of the dynamic leader in finite time. To cope with the absence of velocity measurements,the distributed observers which only use position information are designed. Based on the outputs of the estimators and observers,distributed tracking control laws are proposed such that all the followers with parameter uncertainties can track the dynamic leader under a directed graph containing a spanning tree. It is shown that the distributed observer-controller guarantees asymptotical stability of the closed-loop system. Numerical simulations are worked out to illustrate the effectiveness of the control laws.
The problem of generating optimal paths for curvature-constrained unmanned aerial vehicles(UAVs) performing surveillance of multiple ground targets is addressed in this paper.UAVs are modeled as Dubins vehicles so that the constraints of UAVs' minimal turning radius can be taken into account. In view of the effective surveillance range of the sensors equipped on UAVs, the problem is formulated as a Dubins traveling salesman problem with neighborhood(DTSPN). Considering its prohibitively high computational complexity, the Dubins paths in the sense of terminal heading relaxation are introduced to simplify the calculation of the Dubins distance, and a boundary-based encoding scheme is proposed to determine the visiting point of every target neighborhood. Then, an evolutionary algorithm is used to derive the optimal Dubins tour. To further enhance the quality of the solutions, a local search strategy based on approximate gradient is employed to improve the visiting points of target neighborhoods. Finally, by a minor modification to the individual encoding, the algorithm is easily extended to deal with other two more sophisticated DTSPN variants(multi-UAV scenario and multiple groups of targets scenario).The performance of the algorithm is demonstrated through comparative experiments with other two state-of-the-art DTSPN algorithms identified in literature. Numerical simulations exhibit that the algorithm proposed in this paper can find high-quality solutions to the DTSPN with lower computational cost and produce significantly improved performance over the other algorithms.
An indoor positioning method for robots is presented to improve the precision of displacement measurement using only low-cost inertial measurement units(IMUs).Firstly,a high-fidelity displacement estimation for linear motion is proposed.A new robot motion model is designed as well as an axis alignment that only uses a single axis of the accelerometer.The integral error of velocity is eliminated by a new subsection calculation method.Two complementary IMUs are combined by assigning them different weights to obtain high accuracy displacement results.Secondly,an orientation estimation based on a fusion filter for the steering motion is proposed.Experiments show that the proposed method significantly improves the accuracy of linear motion measurement and is effective for the indoor positioning of a robot.
A hierarchical particle filter(HPF) framework based on multi-feature fusion is proposed.The proposed HPF effectively uses different feature information to avoid the tracking failure based on the single feature in a complicated environment.In this approach,the Harris algorithm is introduced to detect the corner points of the object,and the corner matching algorithm based on singular value decomposition is used to compute the firstorder weights and make particles centralize in the high likelihood area.Then the local binary pattern(LBP) operator is used to build the observation model of the target based on the color and texture features,by which the second-order weights of particles and the accurate location of the target can be obtained.Moreover,a backstepping controller is proposed to complete the whole tracking system.Simulations and experiments are carried out,and the results show that the HPF algorithm with the backstepping controller achieves stable and accurate tracking with good robustness in complex environments.
