Fast-armored target detection based on multi-scale representation and guided anchor

Focused on the task of fast and accurate armored target detection in ground battlefield,a detection method based on multi-scale representation network(MS-RN) and shape-fixed Guided Anchor(SF-GA)scheme is proposed.Firstly,considering the large-scale variation and camouflage of armored target,a new MS-RN integrating contextual information in battlefield environment is designed.The MS-RN extracts deep features from templates with different scales and strengthens the detection ability of small targets.Armored targets of different sizes are detected on different representation features.Secondly,aiming at the accuracy and real-time detection requirements,improved shape-fixed Guided Anchor is used on feature maps of different scales to recommend regions of interests(ROIs).Different from sliding or random anchor,the SF-GA can filter out 80% of the regions while still improving the recall.A special detection dataset for armored target,named Armored Target Dataset(ARTD),is constructed,based on which the comparable experiments with state-of-art detection methods are conducted.Experimental results show that the proposed method achieves outstanding performance in detection accuracy and efficiency,especially when small armored targets are involved.

A Promising Initial Population Based Genetic Algorithm for Job Shop Scheduling Problem

Job shop scheduling problem is typically a NP-Hard problem. In the recent past efforts put by researchers were to provide the most generic genetic algorithm to solve efficiently the job shop scheduling problems. Less attention has been paid to initial population aspects in genetic algorithms and much attention to recombination operators. Therefore authors are of the opinion that by proper design of all the aspects in genetic algorithms starting from initial population may provide better and promising solutions. Hence this paper attempts to enhance the effectiveness of genetic algorithm by providing a new look to initial population. This new technique along with job based representation has been used to obtain the optimal or near optimal solutions of 66 benchmark instances which comprise of varying degree of complexity.

Functional Knowledge Representation Based on Problem Reduction

This paper proposes an approach for functional knowledge representation based on problem reduction,which represents the organization of problem-solving activities in two levels:reduction and reasoning.The former makes the functional plans for problem-solving while the latter constructs functional units, called handlers,for executing subproblems designated by these plans.This approach emphasizes that the representation of domain knowledge should be closely combined with(rather than separated from)its use therefore provides a set of reasoning-level primitives to construct handlers and formulate the control strate- gies for executing them.As reduction-level primitives,handlers are used to construct handler-associative networks,which become the executable representation of problem-reduction graphs,in order to realize the problem-solving methods suited to domain features.Besides,handlers and their control slots can be used to focus the attention of knowledge acquisition and reasoning control.