Loading...

Table of Content

    30 July 2016, Volume 34 Issue 4
    Invited Paper
    Satellite Video Processing and Applications
    ZHANG Guo
    2016, 34(4):  361-370.  doi:10.3969/j.issn.0255-8297.2016.04.001
    Asbtract ( 1758 )   PDF (6851KB) ( 770 )  
    References | Related Articles | Metrics

    Video satellites acquire continuous images of targets in a certain time period to dynamically monitor areas of interest in real time. They have become a hot spot in remote sensing satellite development in recent years. In this paper, a survey is given on the development of video satellites and application perspectives of satellite video data. Major challenges facing satellite video are analyzed, focusing on geometric calibration, radiometric calibration, video stabilization, super resolution reconstruction, moving target detection and tracking, 3D reconstruction, and the development trend. Major application fields of satellite video and the future perspectives are discussed.

    Communication Engineering
    Distribution of Coding and Modulation in SatelliteCommunication Systems
    YANG Liu, GUO Dao-xing, YE Zhan, XIE Si-lin, WANG Ya-hui, ZHANG Bang-ning
    2016, 34(4):  371-379.  doi:10.3969/j.issn.0255-8297.2016.04.002
    Asbtract ( 1170 )   PDF (5761KB) ( 603 )  
    References | Related Articles | Metrics

    The coding and modulation scheme of FDMA satellite communication systems is dynamically variable. Therefore balancing utilization of power and bandwidth can improve efficiency of resource usage and avoid decrease of system capacity due to limitation of power or bandwidth when allocating resources for subsequent users. In this paper, a game model with a dynamically variable coding and modulation mode is established based on an analysis of the satellite link. An algorithm for balanced utilization of power and bandwidth is developed to improve efficiency of system resource. Simulation results show that the proposed algorithm can improve the system channel capacity when system resources are limited.

    Anti-jamming Algorithm of Space-Time AdaptiveFiltering for GPS Based on MatrixReconstruction
    YANG Qiong, ZHANG Yi, TANG Cheng-kai, HE Wei
    2016, 34(4):  380-386.  doi:10.3969/j.issn.0255-8297.2016.04.003
    Asbtract ( 940 )   PDF (6451KB) ( 717 )  
    References | Related Articles | Metrics

    Global positioning system (GPS) anti-jamming algorithms suffer from severe performance degradation in the presence of covariance matrix estimation errors due to small snapshots, jamming movement and antenna vibration. In view of this problem, we present an anti-jamming algorithm of space-time adaptive filtering based on covariance matrix reconstruction. In this algorithm, the covariance matrix that includes noise and interference is reconstructed using the Capon spectral estimation method. The matrix is smoothed in the time domain to obtain space-time filter weights, thus helping reduce the influence of array errors. We analyze three aspects of the algorithm performance: space frequency response spectrum, different signal-to-noise ratio and different number of snapshots. Simulation results show that the proposed algorithm can suppress both wideband and narrowband interferences, improve signal-to-interference-plus-noise ratio of the array output under the condition of low signal-to-noise ratio and low level of snapshots. The output signal-to-interference-plus-noise ratio is improved by 5 dB, better than the diagonal loading algorithm and the covariance matrix taper algorithm.

    Signal and Information Processing
    Marine Association Rule Mining Based on Events
    LI Yi-long, LI Xiao-hong, XUE Cun-jin, LIN Xiao-song
    2016, 34(4):  387-396.  doi:10.3969/j.issn.0255-8297.2016.04.004
    Asbtract ( 981 )   PDF (9159KB) ( 525 )  
    References | Related Articles | Metrics

    An association rule mining algorithm is designed for anomalous oceanic events based on recursive "link-prune" of a priori algorithm. Concepts, definitions, rule expression and evaluation indicator related to events are introduced first. Based on a threshold of support and definition of event, event frequent 1-item set and designed an event-oriented link-prune algorithm is generated for frequent (k + 1)-item set from frequent k-item set. Marine events' strong association rule is then extracted based on events' strong association rule evaluation indicator. A case study on the association rule mining of Pacific marine abnormal events and association rule analysis on typical abnormal events are used to show correctness and feasibility of the proposed method.

    Remote Sensing Image Classification for NationalGeomatics Monitoring Based on ConditionalRandom Field
    ZHANG Chun-sen, FENG Chen-yi, CUI Wei-hong, ZHENG Yi-wei, SUN Zhi-wei
    2016, 34(4):  397-404.  doi:10.3969/j.issn.0255-8297.2016.04.005
    Asbtract ( 1052 )   PDF (2820KB) ( 646 )  
    References | Related Articles | Metrics

    A method of high-resolution remote sensing image classification for national geomatics monitoring based on conditional random field (CRF) is proposed. Different from object-based classification, the proposed method is based on probabilistic graphical models that calculate an energy function composed of potentials. The potentials are defined on the pixel-level and the object-level, and the level between pixels and objects. The energy function can be computed by solving a minimum s-t cut problem using a move making algorithm based on powerful graph cut. Since the classification method fully expresses relationship between pixels and objects, classification errors caused by segmentation is effectively reduced. High-resolution remote sensing images of GW-1 are used in the experiment. The overall classification accuracy and average classification accuracy reached 91.08% and 86.95% respectively, much higher than the results of object-based classification.

    Edge Detection for Industrial CT Image Based on GuidedFiltering and Non-subsampled Shearlet Transform
    MENG Tian-liang, WU Yi-quan, WU Shi-hua
    2016, 34(4):  405-416.  doi:10.3969/j.issn.0255-8297.2016.04.006
    Asbtract ( 893 )   PDF (19102KB) ( 509 )  
    References | Related Articles | Metrics

    As existing image edge detection algorithms cannot accurately detect edges from noisy industrial computed tomography (CT) images, a robust edge detection algorithm capable of preserving fine edges is proposed. Instead of Gaussian filtering, guided filtering is used in image pre-processing for edge detection to avoid edge destruction of the Canny algorithm. Having obtained the preliminary detection result, non-subsampled shearlet transform (NSST) is applied for image decomposition. High-frequency coefficients of various scales in different directions containing edges and details are extracted. Modulus maximum detection is performed on the coefficients in each direction, and the maximum modulus values are adjusted depending on the property of coefficients of the edge points under different decomposing conditions. By setting the low-frequency coefficients to zero, inverse NSST is performed to get the high-frequency edge detection result. Finally, the preliminary result and the high-frequency detection result are combined. The final edge map is obtained with mathematical morphology. Experiments are performed and detection results are compared with those of classical Canny algorithm and several recent and similar edge detection algorithms. The proposed algorithm shows better edge preserving property, higher edge integrity and accuracy. An average increase of 12% of the figure of merit (FOM) indicator is achieved. The proposed edge detection algorithm provides a better edge detection scheme for industrial CT nondestructive testing systems.

    Low Complexity Recovery Algorithms of ImageCompressed Sensing Based on Statistics
    YANG Jing-ran, WU Shao-hua, WANG Hai-xu, LI Jia-hui
    2016, 34(4):  417-429.  doi:10.3969/j.issn.0255-8297.2016.04.007
    Asbtract ( 1002 )   PDF (15434KB) ( 286 )  
    References | Related Articles | Metrics

    Based on statistical prior information of image representations in the wavelet domain, we propose a low-complexity high-performance recovery method coupled with a separable image sensing encoder. By analyzing energy distribution of natural images in the wavelet domain, we develop an exponential decay model and use it as statisticalprior information in the algorithm. Particularly, the recovery process is composed of two steps, in which row-wise (or column-wise) intermediates and column-wise (or row-wise) final results are reconstructed sequentially. In each step, reconstruction is constrained to conform to the statistical prior by introducing a weight matrix. For different applications, we present two recovery strategies with different levels of complexity, namely one-time direct (OTD) recovery strategy and two-times iterative (TTI) recovery strategy. With OTD, the same weight matrix is used in both recovery steps to boost the recovery speed, whereas with TTI, the weight matrix in the second step is iteratively refined to enhance accuracy of recovery. Simulation results show that, compared to the traditional method, the proposed method boosts performance of compressed sensing recovery. In particular, the method with OTD can achieve much faster recovery speed and better recovery quality. Meanwhile, the best recovery quality can be obtained with TTI at the expense of slightly lowered recovery speed, yet still faster than traditional methods.

    Target Tracking Based on Online Template Clustering
    HU Zhao-hua, WANG Guan-nan, WANG Jue, SHAO Xiao-wen, BIAN Fei-fei
    2016, 34(4):  430-440.  doi:10.3969/j.issn.0255-8297.2016.04.008
    Asbtract ( 897 )   PDF (19795KB) ( 481 )  
    References | Related Articles | Metrics

    The template of most tracking algorithms is difficult to suit appearance changes of non-rigid objects due to high redundancy. To deal with the problem, a tracking method with online templates clustering based on particle filter is proposed. Positive and negative template sets are established to describe the target and background. Candidates are then extracted based on the dynamic model. A likelihood function is built based on the withinclass distance between the candidate and template sets, and the between-class distance between positive sets and negative sets. The best candidate is considered the tracking result according to the maximum a posteriori probability (MAP). The main idea of online template clustering is as follows: First, the cluster radius is determined by the state class produced from a series of continuous target states in a certain range. Second, the positive template set combined with the recent several tracking results are used for clustering by using the mean shift iterative method and the above cluster radius. Third, the updated positive template set consists of the new cluster centers. In complicated situations, experiments show that this method can retain different appearance states of target and track the target accurately.

    Audio Watermarking Based on Heuristic Search
    CHANG Le-jie, SU Zhao-pin, HU Dong-hui
    2016, 34(4):  441-450.  doi:10.3969/j.issn.0255-8297.2016.04.009
    Asbtract ( 1002 )   PDF (5396KB) ( 474 )  
    References | Related Articles | Metrics

    To solve the constraint relationships between robustness and imperceptibility of the DWT-DCT-SVD based audio watermarking, a watermarking scheme based on heuristic search is proposed in this paper. Relations among embedding strength, imperceptibility and robustness are analyzed. An embedding strength optimization model is constructed according to these relations, and a heuristic search algorithm proposed to obtain the solution. Comparative experiments show that the proposed solution has good imperceptibility, and can resist various signal processing and StirMark attacks.

    Saliency Detection via Combining BackgroundPriors and Object Priors
    YUE Ke-juan, ZHENG Ming-cai, XIAO Jian-hua, WU Jiong-xing
    2016, 34(4):  451-460.  doi:10.3969/j.issn.0255-8297.2016.04.010
    Asbtract ( 1097 )   PDF (11484KB) ( 334 )  
    References | Related Articles | Metrics

    This paper proposes a saliency detection method in which both background prior-based characteristics and object prior-based characteristics are taken into consideration. First, two geodesic saliency maps are generated based on the average color contrast and the EMD distance between two regions represented by the bag of words (BoW)features. A region-level objectiveness map is then generated to measure probability of a region being salient. Finally, a Bayesian classifier is trained to integrate the three saliency maps. The experimental results on ASD and MSRA5000 show that the proposed method outperforms 15 alternative methods.

    Control and System
    Evaluation of Support Capability of CAPF ArmouredVehicle with Improved BP Neural Network
    SHAN Ning, BAN Chao, DENG Chun-ze
    2016, 34(4):  461-468.  doi:10.3969/j.issn.0255-8297.2016.04.011
    Asbtract ( 919 )   PDF (2474KB) ( 575 )  
    References | Related Articles | Metrics

    There are many factors affecting security of Chinese armed police force (CAPF) armored vehicles in wartime and peacetime. To overcome ambiguity and uncertainty in the evaluation of security capability of CAPF armored vehicles, this paper establishes an evaluation index system using glowworm swarm to optimize a BP neural network. Having determined the initial weights and thresholds, a security of CAPF armored vehicles is evaluated. By establishing a model, calculation and analysis are performed. It is concluded that the glowworm swarm optimization BP (GSOBP) neural network converges fast and is accurate. The method can be used effectively for evaluating security of the CAPF wheeled armored anti-riot vehicles.

    Recognition of Helicopter Flight Condition Based onSupport Vector Machine
    XIONG Bang-shu, LIU Yu, MO Yan, HUANG Jian-ping, LI Xin-min
    2016, 34(4):  469-474.  doi:10.3969/j.issn.0255-8297.2016.04.012
    Asbtract ( 994 )   PDF (1188KB) ( 518 )  
    References | Related Articles | Metrics

    To solve the problem of low recognition rate due to insufficient training samples, a flight condition recognition method based on SVM is proposed. The flight data first undergo denoising by clipping, outlier removal, and averaging. The changing rate of flight data is obtained with least square line fitting. Redundancy in the data is reduced based on the characteristic parameters extracted using linear correlation. The flight condition is classified into ten categories according to the characteristic parameters. An SVM classifier is designed for each category to improve identification efficiency. Finally, every SVM classifier is trained with training samples, and all flight conditions of the helicopter are identified by the trained SVM classifier. Actual flight experiments show that, compared with the RBF neural network method, the proposed method can improve performance under a small sample condition. It provides a reference for helicopter fault diagnoses and life prediction.