Loading...

Table of Content

    01 May 2014, Volume 34 Issue 5
    Network and communications
    Optimization of data scheduling algorithm in concurrent multipath data transfer
    YU Dongping ZHANG Jianfeng WANG Cong LI Ning
    2014, 34(5):  1227-1231.  DOI: 10.11772/j.issn.1001-9081.2014.05.1227
    Asbtract ( )   PDF (752KB) ( )  
    References | Related Articles | Metrics

    To solve the problem of receiver buffer blocking and load unbalance of Concurrent Multipath data Transfer using Stream Control Transmission Protocol (CMT-SCTP) in heterogeneous network environments, an improved round-robin data scheduling algorithm was proposed. The network condition of each path was estimated by the proposed algorithm according to the sender queue information and the congestion status of links. Then the proposed data scheduling algorithm distributed the transmission task to each path based on its network condition, curtailed the queuing time of data chunks in sender buffer and reduced the number of out-of-order data chunks in receiver buffer. Simulation results show that the improved round-robin data scheduling algorithm can effectively enhance the transmission efficiency of CMT-SCTP in a heterogeneous wireless network environment and mitigate the receiver buffer blocking problem. It can also adapt to different network conditions.

    Secure cross-layer transmission protocol of orthogonal frequency division multiplexing vehicular Ad-Hoc network
    REN Guofeng JI Jiang LI Haixia TIAN Zhumei
    2014, 34(5):  1232-1235.  DOI: 10.11772/j.issn.1001-9081.2014.05.1232
    Asbtract ( )   PDF (771KB) ( )  
    References | Related Articles | Metrics

    To prevent eavesdropping in Orthogonal Frequency Division Multiplexing Vehicular Ad-Hoc Network (OFDM-VANET), a cross-layer security routing protocol was presented in this paper, which includes two parts: secure routing protocol and secure frequency diversity. On the one hand, the eavesdropping of the unrelated node was prevented, by limiting its knowledge on information transmission routing. On the other hand, in the diversity of physical layer receiving, the fading difference among wireless channels, which was transparently transmitted from network layer, was utilized to identify the destination node and eavesdropping nodes. The theory analysis and simulation results illustrate that, when the vehicle on a scale of 1000 to 2000, the protocol makes instantaneous eavesdroppers only about 3. Compared to the conventional methods, it can effectively reduce the number of eavesdroppers.

    Speed adaptive vertical handoff algorithm based on application requirements
    TAO Yang JIANG Yanli CHEN Leicheng
    2014, 34(5):  1236-1238.  DOI: 10.11772/j.issn.1001-9081.2014.05.1236
    Asbtract ( )   PDF (588KB) ( )  
    References | Related Articles | Metrics

    Next Generation Network (NGN) is an integrative network which uses different radio access technologies. In this converged network environment, vertical handoff between different wireless access technologies becomes an important research topic. However, most of vertical handoff algorithms do not think about the actual demands of network and the mobility of user, but taking network properties as the standards of judgment. In order to solve the problem above, a speed adaptive vertical handoff algorithm based on application requirements was proposed, which used the speed factor and network propertise matrix to compensate for the quality loss of wireless link caused by mobility, which adaptively adjusted the weights of network properties that the application needs and supported node to make effective decisions. This algorithm realized vertical handoff with adaptive speed which better served the application and . Simulation results show that the proposed algorithm can overcome the ping-pang effect effectively and it has higher packet throughput in comparison with the other vertical handoff algorithms.

    Effective inter-cell interference coordination scheme in long term evolution femtocell network based on soft frequency reuse
    LI Yanan SU Hansong LIU Gaohua LI Yuan
    2014, 34(5):  1239-1242.  DOI: 10.11772/j.issn.1001-9081.2014.05.1239
    Asbtract ( )   PDF (712KB) ( )  
    References | Related Articles | Metrics

    Femtocell is a small low powered base station which can provide an increase in system capacity and better indoor coverage for two-tier Long Term Evolution (LTE) network. However, interference problem between the femtocell and the Microcell eNodeB (MeNB) should be solved in advance. Concerning the interference between them, an effective Inter-Cell Interference Coordination (ICIC) scheme using Soft Frequency Reuse (SFR) was proposed in LTE femtocell system. Under the macrocell pre-allocating frequency band by the SFR, the femtocell user equipments chose sub-bands which were not used in the macrocell sub-area to avoid co-channel interference. At the same time, when the femtocell was located in the center of a macrocell, it was not going to select the sub-bands which were occupied by the boundary region of the same sector. Simulation results show that the proposal scheme improves the throughput performance of overall network by 14% compared to the situation without ICIC, and the average throughput of cell edge users increases by 34% at least.

    Efficient spectrum sensing mechanism with interference cancellation in cognitive radio network
    XIAO Heng LV Shaohe
    2014, 34(5):  1243-1246.  DOI: 10.11772/j.issn.1001-9081.2014.05.1243
    Asbtract ( )   PDF (582KB) ( )  
    References | Related Articles | Metrics

    To facilitate the quick detection of primary user and discover the available channel in a wireless cognitive network, a novel spectrum sensing mechanism was proposed. The mechanism conducted spectrum sensing simultaneously with data transmission to reduce the sense time, and exploited the interference cancellation technique to cancel out the self-interference. Furthermore, by combining the Fourier transform results of multiple signals with different sampling rates, it could quickly detect the behavior of the wideband channel. Finally, during the transmission, the primary user was detected in time by the well-known signature matching method. The experimental results show that, the sense time is reduced by 50%, and the throughput gain is as large as 100%. In summary, the proposed scheme can effectively reduce the overhead of spectrum sensing and improve the efficiency of cognitive communication.

    Improvement of DV-Hop based localization algorithm
    XIA Shaobo LIAN Lijun WANG Luna ZHU Xiaoli ZOU Jianmei
    2014, 34(5):  1247-1250.  DOI: 10.11772/j.issn.1001-9081.2014.05.1247
    Asbtract ( )   PDF (614KB) ( )  
    References | Related Articles | Metrics

    DV-Hop algorithm uses the hop number multiplied by the average distance per hop to estimate the distance between nodes and the trilateral measurement or the maximum likelihood to estimate the node coordinate information, which has defects and then causing too many positioning errors. This paper presented an improved DV-Hop algorithm based on node density regional division (Density Zoning DV-Hop, DZDV-Hop), which used the connectivity of network and the node density to limit the hop number of the estimated node coordinate information and the weighted centroid method to estimate the positioning coordinates. Compared with the traditional DV-Hop algorithm in the same network hardware and topology environment, the result of Matlab simulation test shows that, the communication amount of nodes can be effectively reduced and the positioning error rate can be reduced by 13.6% by using the improved algorithm, which can improve the positioning accuracy.

    Network traffic forecasting model based on Gaussian process regression
    LI Zhengang
    2014, 34(5):  1251-1254.  DOI: 10.11772/j.issn.1001-9081.2014.05.1251
    Asbtract ( )   PDF (557KB) ( )  
    References | Related Articles | Metrics

    To solve the defect of traditional network traffic prediction forecasting, and obtain good forecasting results of network traffic, a network traffic forecasting model based on Gaussian Process Regression (GPR) was proposed. Firstly, the time delay and embedding dimension of network traffic were calculated to construct the learning samples of GPR, and then training samples were input to Gaussian process to learn in which Invasive Weed Optimization (IWO) algorithm was used to optimize the parameters of Gaussian process, and finally, the forecasting model of network traffic was established based on the optimal parameters, and the performance was tested by network traffic data. The results show that the proposed model can improve the forecasting precision of network traffic and it has great practical application value.

    Design and realization of dynamic service-oriented optimization computing platform of BlackBox
    QI Chao George Cheng ZHANG Zhe
    2014, 34(5):  1255-1258.  DOI: 10.11772/j.issn.1001-9081.2014.05.1255
    Asbtract ( )   PDF (723KB) ( )  
    References | Related Articles | Metrics

    Aiming at the problem of high computational cost of the BlackBox of the engineering optimizations, a River-based Dynamic Service-oriented Optimization Computing Platform (R-DSOCP) was proposed to calculate the BlackBox in a distributed and parallel way. Firstly, the running pattern of BlackBox in the optimization algorithms was analyzed. Conforming to the dynamic service-oriented architecture and surrounding the functions of service release and lookup of River, the kernel services required for building R-DSOCP were designed. Secondly, an ACO-based BlackBox Schedule Problem (BSP) algorithm was devised. Depending on it, the scheduling service could not only choose the best computing services for BlackBox quickly but also balance the load of R-DSOCP. At Last, the experimental results show that the BlackBox can be parallel performed on the platform effectively after separating the BlackBox’s computation from the execution of the optimization algorithm. Comparing with a single computing machine, the average computing efficiency is advanced nearly n times. n is the parallel factor. Thus, with the help of High Performance Computing (HPC) technology, R-DSOCP can offer a feasible scheme for accelerating the optimization algorithm and reducing the computational expenses in the field of engineering optimization.

    Design of DNA encoding sequences based on h-distance
    ZHENG Xuedong WANG Bin ZHOU Shihua ZHOU Changjun
    2014, 34(5):  1259-1262.  DOI: 10.11772/j.issn.1001-9081.2014.05.1259
    Asbtract ( )   PDF (540KB) ( )  
    References | Related Articles | Metrics

    Aiming at the problem of the design of Deoxyribonucleic Acid (DNA) encoding sequences which can be mathematically converted into a multi-objective optimization problem with some constraints, by introducing the h-distance in the set of DNA single strands, a sharing function between different DNA sequences was defined and a micro-genetic algorithm was applied to solve the DNA encoding sequence problem. Compared with the previous results, the algorithm can get better DNA sequences and improve the efficiency of computation. The algorithm can be used to design concrete DNA sequences in DNA computing.

    Shortest cyclic quorum generation algorithm based on number of repetitions
    LIU Heng LI Meian SU Meng
    2014, 34(5):  1263-1266.  DOI: 10.11772/j.issn.1001-9081.2014.05.1263
    Asbtract ( )   PDF (729KB) ( )  
    References | Related Articles | Metrics

    When the length of the cyclic quorum is the shortest in distributed system, the space complexity and the time complexity of the existing quorum generation algorithm are too high, a new shortest cyclic quorum generation algorithm was presented. Based on the theory of relaxed cyclic difference set, adding elements to the quorum in turn was judged by the condition of maximum allowable number of repetitions. The simulation results show that, when the system node number is 70 to 90, the length of the cyclic quorum is the shortest and the space complexity is O(2n), the time complexity is 3.6E-03 to 6.8E-07 of that of the exhaustive search, and the time complexity of the shortest cyclic quorum generation algorithm is reduced.

    Distributed memetic differential evolution algorithm combined with pattern search
    ZHANG Chunmei GUO Hongge
    2014, 34(5):  1267-1270.  DOI: 10.11772/j.issn.1001-9081.2014.05.1267
    Asbtract ( )   PDF (673KB) ( )  
    References | Related Articles | Metrics

    In view of the problem of premature convergence and stagnation in the Differential Evolution (DE), the distributed memetic differential evolution was put forward. The idea of memetic algorithm was introduced into the DE algorithm. The distributed population structure and the combination strategy in memetic algorithm were applied. In the former strategy, the initial population was divided into multiple subpopulations according to the von Neumann topology and the periodical information exchange was realized among the subpopulations. And in the latter idea, the differential evolution was taken as an evolutionary frame that was assisted by pattern search to balance the exploration and exploitation abilities. The proposed algorithm made full use of advantages of the pattern search and differential evolution, set up an effective search mechanism and enhanced the algorithm to break away from local optima so as to satisfy the demand on population diversity and convergence speed of the search process. The proposed algorithm was run on a set of classic benchmark functions and compared with several state-of-the-art DE algorithms. Numerical results show that the proposed algorithm has excellent performance in terms of solution quality and convergence speed for all test problems given in this study.

    Multi-start tabu search algorithm for solving maximum cut problem
    ZHANG Aijun QIN Xinqiang QIONG Chunqiong
    2014, 34(5):  1271-1274.  DOI: 10.11772/j.issn.1001-9081.2014.05.1271
    Asbtract ( )   PDF (609KB) ( )  
    References | Related Articles | Metrics

    A Multi-Start Tabu Search (MSTS) algorithm was proposed for the maximum cut problem to improve the solution quality. The proposed algorithm included two key components, one of which was tabu search used to identify high-quality local optimal solutions and the other of which was the multi-start strategy used for the global exploration. Firstly, a local optimum solution was acquired by tabu search component. Secondly, new starting solution was produced by multi-start strategy and then tabu search procedure was restarted. Based on the random greediness, the proposed multi-start strategy integrated the constructive and perturbation methods to produce new starting solutions, thus escaping from being trapped in local optimum and finding higher quality solutions. Experiments on 21 standard maximum cut benchmark instances and comparisons with several state-of-the-art algorithms show that 18 best solutions was obtained by MSTS, higher than compared algorithms. The experimental results indicate that the proposed algorithm outperforms the reference algorithms in terms of the solution quality.

    Object classification based on discriminable features and continuous tracking
    LI Zhihua LIU Qiuluan
    2014, 34(5):  1275-1278.  DOI: 10.11772/j.issn.1001-9081.2014.05.1275
    Asbtract ( )   PDF (634KB) ( )  
    References | Related Articles | Metrics

    Aiming at object classification problem in heavily crowded and complex visual surveillance scenes, a real-time object classification approach was proposed based on discriminable features and continuous tracking. Firstly rapid features matching including color, shape and position was utilized to build the initial target correspondence in the whole scene, in which motion direction and velocity of the moving target were used to predict the preferable searching area in the next frame to accelerate the target matching process. And then the appearance model was utilized to rematch the occluded object without establishing the correspondence. In order to enhance the classification precision, the final object classification results were determined by the maximum probability of continuous object feature extraction and classification according to the tracking results. Experimental results show that the proposed method gets better classification precision compared with the method which do not utilized the continuous tracking,and its correct rate averagely reaches 97%. The new scheme effectively improves the performance of object classification in the complex scenes.

    Improved joint probabilistic data association algorithm based on Meanshift clustering and Bhattacharya likelihood modification
    TIAN Jun LI Dan XIAO Liqing
    2014, 34(5):  1279-1282.  DOI: 10.11772/j.issn.1001-9081.2014.05.1279
    Asbtract ( )   PDF (575KB) ( )  
    References | Related Articles | Metrics

    To reduce the calculation complexity of the Joint Probabilistic Data Association (JPDA) joint-association events, due to multiple targets' tracks aggregation, an improved JPDA algorithm, clustering by Meanshift algorithm and optimizing confirmation matrix by Bhattacharya coefficients,was proposed.The clustering center was created by Meanshift algorithm. Then the tracking gate was obtained by calculating Mahalanobis distance between the clustering center and targets' prediction observation. The Bhattacharya likelihood matrix which was as a basis for low probability events was created, consequently the computing complexity of JPDA joint-association events which was related to low probability events was reduced. The experimental results show that the new method is superior to the conventional JPDA both in computational complexity and precision of estimation for multiple targets' tracks aggregation.

    Built-in determined sub-key correlation power analysis
    LI Jinliang YU Yu FU Rong LI Xiangxue
    2014, 34(5):  1283-1287.  DOI: 10.11772/j.issn.1001-9081.2014.05.1283
    Asbtract ( )   PDF (908KB) ( )  
    References | Related Articles | Metrics

    To study the Built-in determined Sub-key Correlation Power Analysis (BS-CPA) proposed by Yuichi Komano et al.(KOMANO Y, SHIMIZU H, KAWAMURA S. BS-CPA: built-in determined sub-key correlation power analysis. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2010,E93-A(9):1632-1638.) based on the data set of dpacontest.org, this paper compared the efficiency of Differential Power Analysis (DPA), Correlation Power Analysis (CPA) and BS-CPA from the number of power consumption trace and success rate, the result shows that although BS-CPA works out nicely in theory, it is far from the reaching of the efficiency claimed by the authors, and then the intermediate was chosen by the relationship between the statement of executed cryptographic device’s register and power consumption. Attack surface was narrowed by the reduction of noise and ghost peak, the most relative point was filtered out. Compared with the whole point attack, the biggest success rate of partial point attack can be increased by 60% to crack the 64 bit keys for the same number traces. The experiment results prove that the improved model is able to increase the efficiency and decrease the needed power consumption trace for the same success rate, and the result is stable.

    Public key encryption scheme with auxiliary inputs based on indistinguishability under adaptive chosen ciphertext attack
    WANG Zhanjun MA Haiying WANG Jinhua
    2014, 34(5):  1288-1291.  DOI: 10.11772/j.issn.1001-9081.2014.05.1288
    Asbtract ( )   PDF (599KB) ( )  
    References | Related Articles | Metrics

    The existing public key encryption schemes with auxiliary inputs are impractical since they are only of Indistinguishability under Chosen Plaintext Attack (IND-CPA) security. This paper constructed a novel public-key encryption scheme resilient to auxiliary input leakage, which was based on CS '98 encryption scheme and Goldreich-Levin theorem over large field GF(q). The proposed scheme was based on Indistinguishability under Adaptive Chosen Ciphertext Attack (IND-CCA2) security, allowing an attacker to query decryption oracle with auxiliary input leakage when it tried to attack the challenge ciphertext. Compared with the BHHO (Boneh, Halevi, Hamburg, Ostrovsky) encryption scheme, the proposed scheme realizes the more strict IND-CCA2 security in spite of the encryption's and decryption's overhead being nearly doubled.

    Encryption scheme of certificateless and leakage-resilient private key
    YU Qihong LI Jiguo
    2014, 34(5):  1292-1295.  DOI: 10.11772/j.issn.1001-9081.2014.05.1292
    Asbtract ( )   PDF (736KB) ( )  
    References | Related Articles | Metrics

    A lot of side channel attacks and cold boot attacks can leak secret information of cryptographic systems and destroy the security of traditional cryptographic schemes. This paper presented a certificateless encryption scheme which can resist the private key leakage. Based on the q-ABDHE (Augmented Bilinear Diffie-Hellman Exponent) hypothesis, the security of the scheme was proved. The leakage-resilient property was obtained via extractor. The leakage-resilient performance was analyzed. The theoretical analyses show that the relative leakage rate of private key can reach 1/8.

    Cryptanalysis and improvement of provably secure k-out-of-n oblivious transfer scheme
    LI Luyao DAI Ming WANG Qinglong
    2014, 34(5):  1296-1299.  DOI: 10.11772/j.issn.1001-9081.2014.05.1296
    Asbtract ( )   PDF (552KB) ( )  
    References | Related Articles | Metrics

    Oblivious transfer plays an important role in the field of cryptography. A provably secure k-out-of-n oblivious transfer scheme was analyzed in this paper. This scheme was based on a novel method and was efficient in computation and communication. However, it was found not secure at all after deep analysis. The main fault is that the receiver can easily acquire all the secret messages sent by sender. Thus it does not satisfy the secure requirement of oblivious transfer. Finally, by adding a random number the fault of the scheme was fixed. The improved k-out-of-n oblivious transfer scheme keeps the same communicational overhead and computational overhead as the original one. The security of the improved scheme is also based on Decisional Diffie-Hellman (DDH) assumption.

    New secure signature scheme in standard model
    ZHANG Tengfei ZHANG Minqing WANG Xuan
    2014, 34(5):  1300-1303.  DOI: 10.11772/j.issn.1001-9081.2014.05.1300
    Asbtract ( )   PDF (626KB) ( )  
    References | Related Articles | Metrics

    Concerning the problem that it is hard to construct digital signature scheme in the standard model, a new signature scheme was proposed, based on Chosen Ciphertext Attack (CCA) secure Publicly Verifiable Public Key Encryption (PVPKE). The construction is based on the following facts: public verifiability is required in both signature scheme and PVPKE scheme; signatures in signature scheme can not be malleable, and ciphertexts in CCA secure PVPKE scheme can not also be malleable. To design the scheme, private key in PVPKE scheme was used to sign, and the public key was used to verify. Security proof was also given. Analysis result indicates that the proposed scheme has good application in the mail transfer system.

    Digital watermarking scheme of vector animation based on least significant bit algorithm and changed elements
    WANG Tao LI Fudan XU Chao CHEN Yan
    2014, 34(5):  1304-1308.  DOI: 10.11772/j.issn.1001-9081.2014.05.1304
    Asbtract ( )   PDF (803KB) ( )  
    References | Related Articles | Metrics

    For the vacancies on digital watermarking technology based on 2D-vector animation, this paper proposed a blind watermarking scheme which made full use of vector characteristics and the timing characteristics. This scheme adopted color values of adjacent frames in vector animation changed elements as embedded target. And it used Least Significant Bit(LSB) algorithm as embedding/extraction algorithm, which embedded multiple group watermarks to vector animation. Finally the accurate watermark could be obtained by verifying the extracted multiple group watermarks. Theoretical analysis and experimental results show that this scheme is not only easy to implement and well in robustness, but also can realize tamper-proofing. What's more, the vector animation can be played in real-time during the watermark embedding and extraction.

    3D point cloud model watermarking algorithm based on feature points extraction
    QI Xiangming SHI Shuangyu YANG Xiaotao
    2014, 34(5):  1309-1312.  DOI: 10.11772/j.issn.1001-9081.2014.05.1309
    Asbtract ( )   PDF (795KB) ( )  
    References | Related Articles | Metrics

    To effectively improve the transparency and noise immunity of three-dimensional watermark and accuracy of watermark extraction, for the unfixed point cloud data of three-dimensional grid, this paper proposed an three-dimensional point cloud watermarking algorithm based on feature points extraction. According to analysis of covariance, initial feature points were extracted from point cloud model. Every initial feature point was the core point of K-nearest neighbor local neighborhood to build no cross-regional and the smallest triangle, which was the embedding unit bottom, surface, and then the remaining vertices were arranged in ascending order. One suitable embedding vertex was searched as an embedding vertex. By changing the vertex information of local embedding unit, watermark was embedded. Blind watermark was achieved by the index values which was generated by the angle of the vertex's projection. Keeping feature point information, the proposed algorithm effectively improved transparency and noise immunity. By changing the non-characteristic point to embed watermark information and limiting the area of embedding unit, the proposed algorithm improves the watermark accuracy and achieves the blind watermark detection.

    Privacy-preserving location-aware model based on encrypted data
    RAO Jie TAN Bo TAN Chengxiang
    2014, 34(5):  1313-1317.  DOI: 10.11772/j.issn.1001-9081.2014.05.1313
    Asbtract ( )   PDF (795KB) ( )  
    References | Related Articles | Metrics

    The privacy-preserving location-aware model based on encrypted data was proposed to solve the privacy and security problems of Location Based Service (LBS) on the basis of survey of existing models. The spatial data was encrypted by the trusted server of a third party to realize the balance between service and privacy. Meanwhile the extended Discretionary Access Control (DAC) policy was implemented in a way that users are able to selectively share their data with others according to their own privacy concerns. Finally the location based queries were realized by using the improved order-preserving encryption algorithm through data conversion, bucket division and linear mapping. Experiments and analysis show that this model enables user-centric access control and queries on encrypted spatial data. The proposed algorithm improves the computational performance.

    Chosen initial vector correlation power attack on synchronous stream cipher Grain-128
    YANG Changsheng YU Jingchao YAN Yingjian
    2014, 34(5):  1318-1321.  DOI: 10.11772/j.issn.1001-9081.2014.05.1318
    Asbtract ( )   PDF (760KB) ( )  
    References | Related Articles | Metrics

    Unlike block cipher, stream ciphers are relatively simple and widely use linear operation, so there is often a strong correlation between the power of attack point and other power components, making it difficult to implement power analysis attacks. For the aforementioned situation, a chosen-Initial Vector (IV) correlation power analysis attack on synchronous stream cipher Grain-128 was proposed. First, the attack point and its power consumption model were gotten by analyzing the property of Grain-128's output function h(x). Then the correlation between the power of attack point and other power components was eliminated by choosing specific initial vectors, and the key problem facing the energy attacks was solved. Finally, a verification experiment was conducted based on power analysis tool PrimeTimePX. The results show that the scheme can implement 23 rounds attack and recover 46 bits key with only 736 initial vectors.

    Android malware detection based on permission correlation
    ZHANG Rui YANG Jiyun
    2014, 34(5):  1322-1325.  DOI: 10.11772/j.issn.1001-9081.2014.05.1322
    Asbtract ( )   PDF (638KB) ( )  
    References | Related Articles | Metrics

    Considering the demand of detecting Android malware and the redundancy of permission properties, a fast scheme was proposed to detect malware from the perspective of permission correlation. To eliminate the redundant permissions, Chi-square test was used to compute the influence of the permission on the classification results. Then some representative permissions were selected on the basis of permission clustering to further reduce redundancy. Finally an improved Naive Bayesian classification based on the weights of different permissions was proposed to classify the software. Results of the experiments conducted on 2000 software samples show that the miss rate of malware detection is 10.33% and the overall prediction accuracy is 88.98%. Experiments indicate that this scheme is capable of detecting malware on Android platform by using a few permission properties, which can provide a reference for further analysis and judgment.

    Artificial intelligence
    Survey of dynamic prediction method for Web service quality of service
    LIU Zhizhong SONG Cheng AN Jiyu LU Baoyun
    2014, 34(5):  1326-1330.  DOI: 10.11772/j.issn.1001-9081.2014.05.1326
    Asbtract ( )   PDF (843KB) ( )  
    References | Related Articles | Metrics

    With the rapid development of Service Oriented Computing (SOC), more and more Web services with the same functionalities and different Quality of Service (QoS) are available on the Web, QoS becomes an important basis for evaluating and selecting Web services. As the environment of Web services is open, the QoS of Web services are dynamic. How to accurately predict Web services' QoS becomes a key factor that affects the success of QoS based Web service selection and composition. Here existing Web service QoS prediction methods were deeply analyzed, and the advantages and disadvantages of these existing methods are pointed out, and the future research directions of Web service QoS dynamic prediction were explored.

    High efficient K-means algorithm for determining optimal number of clusters
    WANG Yong TANG Jing RAO Qinfei YUAN Chaoyan
    2014, 34(5):  1331-1335.  DOI: 10.11772/j.issn.1001-9081.2014.05.1331
    Asbtract ( )   PDF (709KB) ( )  
    References | Related Articles | Metrics

    The cluster number is not generally set by K-means clustering algorithm beforehand, and artificial initial clustering number easily leads to the problem of unstable clustering results. A high-efficient algorithm for determining the K-means optimal clustering number was presented. The algorithm got the upper bound of the number of clustering search range through stratified sample data and designed a new kind of effective clustering indicator to evaluate the clustering degree of similarity between and within class after clustering. Thus the optimal number of clusters was obtained in the search range of the clusters number. The simulation results show that the algorithm can obtain the optimal clustering number fast and accurately, and the dataset clustering effect is good.

    Cost-sensitive hypernetworks for imbalanced data classification
    ZHENG Yan WANG Yang HAO Qingfeng GAN Zhentao
    2014, 34(5):  1336-1340.  DOI: 10.11772/j.issn.1001-9081.2014.05.1336
    Asbtract ( )   PDF (872KB) ( )  
    References | Related Articles | Metrics

    Traditional hypernetwork model is biased towards the majority class, which leads to much higher accuracy on majority class than the minority when being tackled on imbalanced data classification problem. In this paper, a Boosting ensemble of cost-sensitive hypernetworks was proposed. Firstly, the cost-sensitive learning was introduced to hypernetwork model, to propose cost-sensitive hyperenetwork model. Meanwhile, to make the algorithm adapt to the cost of misclassification on positive class, cost-sensitive hypernetworks were integrated by Boosting. The proposed model revised the bias towards the majority class when traditional hypernetwork model was tackled on imbalanced data classification, and improved the classification accuracy on minority class. The experimental results show that the proposed scheme has advantages in imbalanced data classification.

    Nonlinear system modeling based on Takagi-Sugeno fuzzy radial basis function neural network optimized by improved particle swarm optimization
    LI Lina GAN Xiaoye XU Panfeng MA Jun
    2014, 34(5):  1341-1344.  DOI: 10.11772/j.issn.1001-9081.2014.05.1341
    Asbtract ( )   PDF (811KB) ( )  
    References | Related Articles | Metrics

    For the difficulty of complex non-linear system modeling, a new system modeling algorithm based on the Takagi-Sugeno (T-S) Fuzzy Radial Basis Function (RBF) neural network optimized by improved Particle Swarm Optimization (PSO) algorithm was proposed. In this algorithm, the good interpretability of T-S fuzzy model and the self-learning ability of RBF neural network were combined together to form a T-S fuzzy RBF neural network for system modeling, and the network parameters were optimized by the improved PSO algorithm with dynamic adjustment of the inertia weight combined with recursive least square method. Firstly, the proposed algorithm was used to do the approximation simulation of a non-linear multi-dimensional function, the Mean Square Error (MSE) of the approximation model was 0.00017, the absolute error was not greater than 0.04, which shows higher approximation precision; the proposed algorithm was also used to build a dynamic flow soft measurement model and to finish related experimental study, the average absolute error of the dynamic flow measurement results was less than 0.15L/min, the relative error is 1.97%, these results meet measurement requirements well and are better than the results of the existing algorithms. The above simulation results and experimental results show that the proposed algorithm is of high modeling precision and good adaptability for complex non-linear system.

    Topic clause identification method based on specific features
    JIANG Yuru SONG Rou
    2014, 34(5):  1345-1349.  DOI: 10.11772/j.issn.1001-9081.2014.05.1345
    Asbtract ( )   PDF (739KB) ( )  
    References | Related Articles | Metrics

    When identifying the Topic Clause (TC) of Punctuation Clause (PClause), the brute-force method to generate Candidate Topic Clause (CTC) causes high time consumption and low accuracy of the identification system. A new CTC generating method was proposed, which used specific features such as the PClause location in the text, the grammatical features of the topic and the adjacent features of topic and its comment. The experimental result shows that the improved method can not only improve the efficiency of the system by reducing the number of CTCs, but also make the accuracy of TC identification for single PClause and PClause sequence increase by 0.96 percentage points and 1.31 percentage points respectively over the current state.

    Learning resource recommendation method based on particle swarm optimization algorithm
    YANG Chao
    2014, 34(5):  1350-1353.  DOI: 10.11772/j.issn.1001-9081.2014.05.1350
    Asbtract ( )   PDF (625KB) ( )  
    References | Related Articles | Metrics

    Due to individual differences in the ability, learning objectives and learning time of the learners,a learning resource recommendation method based on Particle Swarm Optimization (PSO) algorithm was proposed to provide the learner with a personalized digital curriculum. The knowledge structure chart was constructed applying concept map and knowledge structure. The learning objectives and the ability of the learner were analyzed based on item response theory. The PSO algorithm was adopted to select the appropriate e-learning materials from a mass of candidate materials and the adaptive e-course was composed and recommended. The learning time limit was considered while initializing particles, and some unnecessary particles were filtered out to improve the efficiency of the algorithm. When determining the optimal solution, the Sigmoid function was used to fix the particle update velocity to ensure it effective. The experimental results show that with the increase of the number of iterations, the difference between the recommended content and the learner goal is 0. The difference between the recommended curriculum and the learner ability is 0.6, and the overall difference is 0.25.It shows that the convergency and efficiency of the proposed method and the selected learning materials can meet the demands of different learners.

    News topic mining method based on weighted latent Dirichlet allocation model
    LI Xiangdong BA Zhichao HUANG Li
    2014, 34(5):  1354-1359.  DOI: 10.11772/j.issn.1001-9081.2014.05.1354
    Asbtract ( )   PDF (969KB) ( )  
    References | Related Articles | Metrics

    To solve the problems such as low accuracy and poor interpretability of traditional news topic mining, a new method was proposed based on weighted Latent Dirichlet Allocation (LDA) that combined with the information structure characters of the news. Firstly, the vocabulary weights were improved from different angles and the composite weights were built, the more expressive words were got by extending the process of feature items generated by the LDA model. Secondly, the Category Distinguish Word (CDW) method was used to optimize the word order of the generated result, which could reduce the noise and the ambiguity of the topics and improve the interpretability of the topics. Finally, according to the mathematical characteristics of the probability distribution model of the topics, the topics were quantified in terms of the contribution degree from the documents to the topics and the topics weight probability to get the hot topics. The simulation results show that the false negative rate and false positive rate of the weighted LDA model drop by an average of 1.43% and 0.16% compared with the traditional LDA model, and the minimum standard price drops by an average of 2.68%. It confirms the feasibility and effectiveness of this method.

    Behavior modeling of transport robot using Petri nets
    YUAN Jie LI Wei
    2014, 34(5):  1360-1363.  DOI: 10.11772/j.issn.1001-9081.2014.05.1360
    Asbtract ( )   PDF (774KB) ( )  
    References | Related Articles | Metrics

    New difficulties are met when establishing accurate behavioral models of a transport robot. To solve this problem, behavioral models of a transport robot were built using Petri Nets (PN) with inhibitor arcs. There exist coupling, constraint, and asynchronization relationships among the behaviors of a transport robot. A Petri net metamodel with inhibitor arcs of interactive behaviors as well as a token flow control mechanism were utilized for modeling the behaviors of a transport robot. The Petri net models were converted into LabVIEW programs using LabVIEW2012 and the Robotics module. The robot behaviors were verified using a transport robot platform. The experimental results demonstrate that the transport robot's behaviors and interaction logic are achieved, and that the robot has behavioral identification, decision-making and implementation capabilities, and it is a suitable method model the behaviors of a transport robot using Petri nets with inhibitor arcs. The reference models of Petri nets are given for designing related behaviors of transport robots.

    Gait recognition based on row mass vector of frame difference energy image
    LI Rui CHEN Yong YU Lei
    2014, 34(5):  1364-1368.  DOI: 10.11772/j.issn.1001-9081.2014.05.1364
    Asbtract ( )   PDF (727KB) ( )  
    References | Related Articles | Metrics

    To effectively capture the dynamic information of the gait and accelerate the authentication and identification, a novel gait recognition algorithm was presented in this paper, which employed the row mass vector of the Frame Difference Energy Image (FDEI) as the gait features. The gait contour images were extracted through the object detection, binarization, morphological process and connectivity analysis of the original images. Using the width of the contour images sequence, the quasi-periodicity analysis and the row mass vector of the frame difference image were obtained, then the Continuous Hidden Markov Model (CHMM) was employed to train and recognize the parameters of model. The proposed algorithm was applied to Central Asia Student International Academic (CASIA) gait database. The experimental results show that it can easily extract the features of the gait with low dimension, achieving fast recognition speed and high recognition rate, so it can be used for real-time gait recognition.

    Face recognition using as authentication in intelligent office systems
    DENG Wenhong ZHOU Zhongli
    2014, 34(5):  1373-1377.  DOI: 10.11772/j.issn.1001-9081.2014.05.1373
    Asbtract ( )   PDF (738KB) ( )  
    References | Related Articles | Metrics

    Face recognition was proposed to use as the authentication method to improve the security of the intelligent network-based office systems, especially security-sensitive systems. Using multi-component fusion algorithm, the proposed algorithm divided the face image into a series of primitive components, selected a statistically optimal parts from it, extracted the Local Binary Pattern (LBP) histogram feature, obtained the Linear Discriminant Analysis (LDA) transformation characteristics through the corresponding LDA transformation matrix, as the final characteristics of each component, and used a summing means to achieve the integration of the similarity of parts. This algorithm was used for user registration and identification of intelligent office systems. The experimental results show that the application of multi-component fusion face recognition has high precision and safety.

    Abnormal behavior detection for highway vehicle based on lane model
    QIU Lingyun HAN Jun GU Ming
    2014, 34(5):  1378-1382.  DOI: 10.11772/j.issn.1001-9081.2014.05.1378
    Asbtract ( )   PDF (903KB) ( )  
    References | Related Articles | Metrics

    To solve the problem of detecting highway-vehicle abnormal behavior such as retrograde motion, parking and abnormal trajectory, this paper presented a bottom-up detection algorithm based on lane model. First, the lane line and vanishing point were found out by line's continuity and collinearity, and the lane model was automatically established. Second, a region-overlap graph was established by motion prediction and KLT feature tracking to indicate region relationship of the object in the detecting and tracking process. In this graph, the corresponding relationship and reliable trajectory was made by merging or splitting the target region. The target region was ruled by posterior relationship. At last, the vehicle's location was transformed based on vanishing point. The trend of target motion was judged and its location or velocity was calculated in the lane model with sliding window to decide vehicle's behavior. The experimental results show that the proposed algorithm has more than 80% detection rate for car incident in different weather or traffic environment. This algorithm is capable to detect vehicle abnormal behavior on highway for real-time application.

    Completely automated public turing test to tell computers and humans apart recognition algorithm based on spectral-clustering recurrent neural network ensemble
    ZHANG Liang CHEN Rui QIU Xiaosong
    2014, 34(5):  1383-1385.  DOI: 10.11772/j.issn.1001-9081.2014.05.1383
    Asbtract ( )   PDF (476KB) ( )  
    References | Related Articles | Metrics

    Concerning the recognition of closely-connected Completely Automated Public Turing Test to Tell Computers and Humans Apart (CAPTCHA), a recognition algorithm based on spectral-clustering Recurrent Neural Network (RNN) ensemble was proposed. This algorithm firstly used disagreement measure for distance between two RNNs, thus constructed a graph composed by candidate RNNs. Then, a graph cluster method was used to divide RNNs into clusters. Finally, the best RNN in each cluster was selected. The experimental results reveal that: compared with single candidate RNN, recognition rates of this algorithm is increased by 16%. Compared with the ensemble of all candidate RNNs, ensemble size of this algorithm is much smaller, it is about 23% of the original size.

    Improved speech endpoint detection algorithm in strong noise environment
    LU Yuanyao ZHOU Ni
    2014, 34(5):  1386-1390.  DOI: 10.11772/j.issn.1001-9081.2014.05.1386
    Asbtract ( )   PDF (690KB) ( )  
    References | Related Articles | Metrics

    To improve the correctness of speech endpoint detection in strong noise environment, and overcome the disadvantage in traditional dual-threshold speech endpoint detection based on short-time energy and short-time zero-crossing rate, whose performance degrades sharply in low Signal-to-Noise Ratio (SNR) environment, an improved speech endpoint detection algorithm was proposed. In this method, the noisy speech signal was de-noised to enhance SNR at first, then the dual-threshold speech endpoint detection algorithm was used to detect the endpoints of the de-noised speech signal. The experimental results indicate that the proposed method not only has strong robustness, but also can achieve high detection accuracy in strong noise environment, so the effectiveness of the algorithm is proved.

    Bird sounds recognition based on Radon and translation invariant discrete wavelet transform
    ZHOU Xiaomin LI Ying
    2014, 34(5):  1391-1396.  DOI: 10.11772/j.issn.1001-9081.2014.05.1391
    Asbtract ( )   PDF (1071KB) ( )  
    References | Related Articles | Metrics

    To improve the accuracy of bird sounds recognition in low Signal-to-Noise Ratio (SNR) environment, a new bird sounds recognition technology based on Radon Transform (RT) and Translation Invariant Discrete Wavelet Transform (TIDWT) from spectrogram after the noise reduction was proposed. First, an improved multi-band spectral subtraction method was presented to reduce the background noise. Second, short-time energy was used to detect silence of clean bird sound, and the silence was removed. Then, the bird sound was translated into spectrogram, RT and TIDWT were used to extract features. Finally, classification was achieved by Support Vector Machine (SVM) classifier. The experimental results show that the method can achieve better recognition effect even the SNR belows 10dB.

    Application of novel K-means particle swarm optimization algorithm in integrated navigation
    XIA Qi HAO Shunyi DONF Miao REN Yang
    2014, 34(5):  1397-1399.  DOI: 10.11772/j.issn.1001-9081.2014.05.1397
    Asbtract ( )   PDF (550KB) ( )  
    References | Related Articles | Metrics

    For the nonlinear, non-Gaussian and high dynamic model in Strapdown Inertial Navigation System/Global Navigation Satellite System (SINS/GNSS) tightly integrated navigation system, the general K-means Particle Swarm Optimization (PSO) algorithm was ineffective, and the particle impoverishses and diverges greatly. A novel K-means PSO algorithm was proposed. According to the Geometric Dilution Of Precision (GDOP) of the SINS/GNSS tightly integrated navigation system, the weight of particle was updated, and the weight of each K-means was updated. The novel algorithm was applied in SNS/GNSS tightly integrated navigation system. The simulation result shows that the novel algorithm can restrain the divergence effectively and it improves precision.

    Stability augmentation hybrid controller for quadrotor aircraft
    GAO Qingji YUE Fengfa HU Dandan
    2014, 34(5):  1400-1403.  DOI: 10.11772/j.issn.1001-9081.2014.05.1400
    Asbtract ( )   PDF (490KB) ( )  
    References | Related Articles | Metrics

    A hybrid control method based on backstepping and fuzzy adaptive Proportion-Integration-Differentiation (PID) was proposed, which improved the flight stability of quadrotor aircraft in different environment. The method selected the current appropriate controller according to the Unmanned Aerial Vehicles (UAV) flight environment, large attitude angle, and large attitude angular velocity. In the case of the system undisturbed, backstepping-based control algorithm could complete trajectory tracking. In case of disturbance, fuzzy adaptive PID could greatly suppress the impact of disturbance and realize the precise control of quadrotor aircraft. The Matlab simulation analysis and practical experiments illustrate that the stability augmentation hybrid controller can effectively realize the stability.

    Co-design optimization approach based on static register allocation in system emulation
    JIANG Liehui CHEN Huichao DONG Weiyu ZHANG Yanwen
    2014, 34(5):  1404-1407.  DOI: 10.11772/j.issn.1001-9081.2014.05.1404
    Asbtract ( )   PDF (801KB) ( )  
    References | Related Articles | Metrics

    To reduce the expand rate of translated code and the cost of switching between translation engine and execution engine based on static register allocation strategy in X86 system emulation, a co-design optimization approach based on register mapping, custom instruction and shadow register was proposed. The operation to the emulated source registers in memory was transformed into the operation to local registers by optimization of static register allocation and the expand rate of translated object code was reduced; the backup and restore operation between engine switching were simplified to two custom instructions by co-design optimization of custom instructions and shadow registers. After co-design optimization of X86 emulation system Linux-0.2, the average expand rate of translated code comes down by 21.9%, the period of the emulation system’s boot and shutdown obtains speed-up of 1.35. Evaluation demonstrates the feasibility and effectiveness of the proposed co-design optimization approach.

    Coroutine and scripted mechanism for embedded system
    ZOU Changwei WANG Lin
    2014, 34(5):  1408-1412.  DOI: 10.11772/j.issn.1001-9081.2014.05.1408
    Asbtract ( )   PDF (785KB) ( )  
    References | Related Articles | Metrics

    Due to the increase of system complexity arising from the partial substitution of the traditional 51 Micro Controller Unit (MCU) with Cortex M3, a method was proposed for concurrent control on embedded system without operating system.First of all, a script language and its corresponding interpreter for concurrent control were implemented via context-free grammar formally; further an proposition was pointed out that multithreading was a sufficient but not necessary condition for concurrent scripts; meanwhile, a coroutine mechanism for concurrent programming on embedded system was constructed by switching script contexts in the interrupt service routine of MCU timer. The experimental results show that the proposed mechanism avoids the dependency on commercial multithreading libraries, which is helpful to decrease the cost of product, promotes the readability of source code and causes a flash programming frequency drop by about 58%.The respective applications on systems with and without operating system demonstrate that this mechanism is portable and practical.

    Linear time properties of weighted transition system and checking of safety property
    LIN Yunguo
    2014, 34(5):  1413-1417.  DOI: 10.11772/j.issn.1001-9081.2014.05.1413
    Asbtract ( )   PDF (753KB) ( )  
    References | Related Articles | Metrics

    With regard to the weighted transition system, the linear time properties were proposed. Firstly, the weighted transition system above semiring K was defined, the concepts of the weighted linear time properties were given, the upper, the lower and the closure of weighted linear time properties were determined by the weighted function; secondly some familiar weighted linear time properties and their relationships were discussed; thirdly the weighted safety property was mainly studied, the weighted regular safety property was defined through weighted automaton and closure of weighted regular safety property; finally, the checking method of the weighted regular safety was built based on weighted finite automaton. The checking was follows. Together with semiring and formal series, the product system was built over weighted transition and weighted finite automaton, the model checking about weighted safety property of weighted transition was transferred to verify the invariance of the product system, the algorithm and complexity were given. Finally, an example shows the model checking of weighted regular safety property is reasonable and efficient. The example result shows the proposed method can verify the safety of the weighted system.

    Control flow checking method for on-board operating system
    MING Yuewei NING Hong DENG SHENGlan
    2014, 34(5):  1418-1422.  DOI: 10.11772/j.issn.1001-9081.2014.05.1418
    Asbtract ( )   PDF (809KB) ( )  
    References | Related Articles | Metrics

    The space high-energy particle radiation has a serious influence on the reliability of the space computation. Effective radiation hardening measures must be taken to overcome this problem. Compared with the use of radiation hardening devices, using the soft reinforcement commercial devices can enjoy the advantages of high performance, low cost, fast development and so on. However, the present research on soft reinforcement is mainly suitable for the application level, while there is very little research on soft reinforcement methods for the operating system. A control flow checking method for the on-board operating system was proposed to solve this problem. Taking account of the characteristics of the on-board operating system, the proposed method regarded each thread as a sequence of function calls and monitored the thread execution through inserting test statements in the entry and exit of a function to achieve the control flow error detection. The experimental results indicate that the proposed method can increase the control flow fault coverage of the on-board operating system by 25%.

    Precision analysis of arbitrary resolution wavelet fairing
    JI Xiaogang YANG Yan XUE Jie
    2014, 34(5):  1423-1426.  DOI: 10.11772/j.issn.1001-9081.2014.05.1423
    Asbtract ( )   PDF (738KB) ( )  
    References | Related Articles | Metrics

    For precision control problem of multi-resolution fairing, specific impact of fairing precision caused by fairing scale was studied on the basis of the researches of multi-resolution fairing algorithm and software. Taking semicircular curve as a calibration object, this method revealed the internal relations between selection of fairing scale and fairing precision. The experimental results show that the smaller the fairing scale is, the larger the fairing error is. Secondly, multi-resolution fairing can reflect original curves with less control vertexes and own a strong ability of data compression. Finally, fairing error would be larger at the place of curves with larger curvature.

    Element-sizing field smoothing algorithm for mesh generation of finite element analysis
    ZENG Lijuan LI Shaolei ZHU Chaoyan
    2014, 34(5):  1427-1430.  DOI: 10.11772/j.issn.1001-9081.2014.05.1427
    Asbtract ( )   PDF (604KB) ( )  
    References | Related Articles | Metrics

    Element-sizing fields are necessities for guiding the generation of high-quality meshes used in finite element analyses and smoothness of this field heavily affect the element quality of the resulting mesh. A new algorithm was proposed to smooth the element-sizing fields. Based on the H-variant proposed by Borouchaki, et al. (BOROUCHAKI H, HECHT F, FREY P J. Mesh gradation control. International Journal for Numerical Methods in Engineering, 1998,43(6):1143-1165), some basic geometric concepts and a theory that aimed at analyzing the smoothness of 2D element-sizing fields quantitatively was established in this paper. The rule of the reasonable sizing transition for 2D area was achieved. Based on this rule, an improved algorithm from Borouchaki sizing-correcting method defined on unstructured background meshes was designed. This algorithm adjusted the size values attached on a small set of background mesh nodes to ensure the output of a well graded size field. Finally, mesh examples were given to validate the proposed theory and algorithm. Compared with other smoothing methods, the proposed algorithm in this paper can help get meshes with better quality.

    Ray tracing of irregular scene based on spatial grid subdivision
    SUN Jingguang LIU Jiatong
    2014, 34(5):  1431-1434.  DOI: 10.11772/j.issn.1001-9081.2014.05.1431
    Asbtract ( )   PDF (749KB) ( )  
    References | Related Articles | Metrics

    To solve the slow rendering problem of ray tracing algorithm in irregular scene, an improved grid subdivision ray tracing algorithm was proposed based on the in-depth study and comparison of the recent acceleration algorithms of ray tracing. First, the rectangular bounding box of the scene was set to remove the influence of external light, and the intersect operations was simplified; second, spatial grids were created with a new way to limit the spatial unit number and complexity of storage space within a certain range; finally, the traditional spatial grid algorithm was greatly improved by subdividing grids to eliminate the bad influence on acceleration effects due to ignoring some blank space. The experimental results show that this method can effectively improve the light speed in blank space, it not only increases the time efficiency but also reduces the space lost.

    Positioning and display of intensive point of interest for augmented reality browser
    ZHANG Yu CHEN Jing WANG Yongtian ZHOU Qi
    2014, 34(5):  1435-1438.  DOI: 10.11772/j.issn.1001-9081.2014.05.1435
    Asbtract ( )   PDF (789KB) ( )  
    References | Related Articles | Metrics

    When Augmented Reality (AR) browser running in the Point of Interest (POI) dense region, there are some problems like data loading slowly, icon sheltered from the others, low positioning accuracy, etc. To solve above problems, this article proposed a new calculation method of the Global Positioning System (GPS) coordinate mapping which introduced the distance factor, improved the calculating way of coordinates based on the angle projection, and made the icon distinguished effectively after the phone posture changed. Secondly, in order to improve the user experience, a POI labels focus display method which is in more accord with human visual habits was proposed. At the same time, aiming at the low positioning accuracy problem of GPS, the distributed mass scene visual recognition technology was adopted to implement high-precision positioning of scenario.

    Improved cross-media relevance model for quick image annotation
    BAO Cuizhu SONG Haiyu NIU Junhai XIA Xiu LIN Yaozong WANG Bingfei
    2014, 34(5):  1439-1441.  DOI: 10.11772/j.issn.1001-9081.2014.05.1439
    Asbtract ( )   PDF (479KB) ( )  
    References | Related Articles | Metrics

    To overcome the shortcomings of Cross-Media Relevance Model (CMRM) whose efficiency and effectiveness are low, an improved CMRM was proposed. Based on the improved smoothing method for textual words, the improved CMRM simplified the feature representation and similarity computation which made the measure of relationship between image and image more accurate. The experimental results on the Corel5k dataset show that the proposed approach can significantly improve annotation efficiency. The performance of the improved CMRM is almost three times as good (in terms of mean F1-measure) as original CMRM, also, better than some previously published high quality algorithms such as famous Multiple Bernoulli Relevance Model (MBRM) and Supervised Multiclass Labeling (SML).

    Human fingertip detection and tracking algorithm based on depth image
    LIU Weihua FAN Yangyu LEI Tao
    2014, 34(5):  1442-1448.  DOI: 10.11772/j.issn.1001-9081.2014.05.1442
    Asbtract ( )   PDF (1110KB) ( )  
    References | Related Articles | Metrics

    To solve the problem of detecting human hand in complex background based on traditional camera, a fast, automatic method was proposed which can accurately detect and track foreground human fingertips by using Kinect camera. This method firstly used a combined vision-based information to roughly extract the hand region, then, by taking advantage of depth information, a bare hand could be successfully segmented without connecting to background. Subsequently, the fingertips of that bare hand could be extracted by using minimum circle and curvature relationship on the hand boundary. Finally, to improve the detecting accuracy, the fingertips were optimized by using Kalman filter. The experimental results show that compared with existing method the algorithm can successfully track the 3D locations of fingertips under multiple hand poses and with much lower error rate.

    Improved ASIFT algorithm for image registration
    FAN Xueting ZHANG Lei ZHAO Chaohe
    2014, 34(5):  1449-1452.  DOI: 10.11772/j.issn.1001-9081.2014.05.1449
    Asbtract ( )   PDF (701KB) ( )  
    References | Related Articles | Metrics

    Image registration is a well researched topic of computer vision. To deal with matching efficiency, repetitive pattern matching and affine invariant matching better, two improvements over the state-of-the-art Affine-Scale Invariant Feature Transform (ASIFT) algorithm were presented. The feature extraction of matching frame was developed to improve the matching efficiency of the ASIFT algorithm. The second increased the accuracy of matching and the adaptive capacity of repetitive patterns through the use of improved matching algorithm by combining Optimized Random Sample Consensus (ORSA) with Random Sample Consensus (RANSAC) algorithm based on geometric linear constraint model with homography matrix. The experimental results show that the proposed method is able to well match highly repetitive patterns and has smaller calculation, faster speed and higher accuracy as well.

    3D object matching combined 3D geometrical shape and 2D texture feature
    LI Shuiping PENG Xiaoming
    2014, 34(5):  1453-1457.  DOI: 10.11772/j.issn.1001-9081.2014.05.1453
    Asbtract ( )   PDF (793KB) ( )  
    References | Related Articles | Metrics

    To solve the matching problem between the model and 3D object in the scenes, this paper presented a 3D object matching method combined 3D shape and 2D texture feature. Scale-Invariant Feature Transform (SIFT) feature was extracted from the range image in the scene, and then the range image matched with a series of 2.5 dimensional range images which were used for the 3D model reconstruction one by one based on SIFT algorithm, so that it could find out the most similar local range image to the object in the scene.The matching between this local range image and the object was completed through 3D shape feature. It is to initialize the model, in other words, it is to reset the model close to the object in the scene. At last, a Iterative Closest Point (ICP) algorithm combined with color was used to implement the matching between the object in the sences and the model which was reset before. In this way the pose of the object in the scene can be calculated accurately. The experimental results verify the feasibility and accuracy of the proposed method.

    Culling of foreign matter fake information in detection of subminiature accessory based on prior knowledge
    ZHEN Rongjie WANG Zhong LIU Wenjing GOU Jiansong
    2014, 34(5):  1458-1462.  DOI: 10.11772/j.issn.1001-9081.2014.05.1458
    Asbtract ( )   PDF (810KB) ( )  
    References | Related Articles | Metrics

    In visual detection of subminiature accessory, the extracted target contour will be affected by the existence of foreign matter in the field like dust and hair crumbs. In order to avoid the impact for measurement brought by foreign matter, a method of culling foreign matter fake information based on prior knowledge was put forward. Firstly, the corners of component image with foreign matter were detected. Secondly, the corner-distribution features of standard component were obtained by statistics. Finally, the judgment condition of foreign matter fake imformation was derived from the corner-distribution features of standard component to cull the foreign matter fake information. Through successful application in an actual engineering project, the processing experiments on three typical images with foreign matter prove that the proposed algorithm ensures the accuracy of the measurement, while effectively culling the foreign matter fake information in the images.

    Real-time object detection method based on foreground segmentation
    NIU Jie BU Xiongzhu QIAN Kun
    2014, 34(5):  1463-1466.  DOI: 10.11772/j.issn.1001-9081.2014.05.1463
    Asbtract ( )   PDF (647KB) ( )  
    References | Related Articles | Metrics

    Aiming at the problem that object segmentation algorithms based on single color information are very sensitive to the changes on lighting, a novel approach to detect target based on the fusion of color and depth information was proposed. Firstly, improved Visual Background Extractor (ViBe) and multiple-frame subtraction algorithm were used to establish models for RGB and depth images which captured by Kinect senor respectively. Then, strategy of Selection Criterion (SC) was used to optimize segmentation results. Lastly, most likely target was labeled by calculating similar degree between foreground and template in the rg chromaticity space. The experimental results demonstrate that the proposed method exhibit a certain degree of resilience to light disturbance and noise, and it can overcome the disadvantages of single RGB based algorithms effectively.

    Improved algorithm of audio-video synchronization coding based on variable code length
    ZENG Bi LIN Jianhao XIAO Hong HE Yuanlie
    2014, 34(5):  1467-1472.  DOI: 10.11772/j.issn.1001-9081.2014.05.1467
    Asbtract ( )   PDF (934KB) ( )  
    References | Related Articles | Metrics

    To solve the synchronization problem of audio and video, an improved algorithm of audio-video synchronization coding based on H.264 inter-frame prediction was proposed. The algorithm introduced the concept of variable code length. The audio encoding data was divided into several code groups, and each code group had 2 or 3 bits of embedded data. In the stage of H.264 inter-frame prediction, the mappings between various variable size blocks and the data of code groups were based on formula. The coding method was dynamically determined for the macro block modes coding according to embedded data, and a proposed decoding method could extract the corresponding data according to the mapping relationship. Finally, the 4×4 macro block mode was used to indicate the end of the audio data.The experimental results show that the proposed algorithm enables the Peak Signal-to-Noise Ratio (PSNR) of video samples to reduce by 0.031dB, the bit rate to increase by 5.16% and the overhead to increase by 1.97%, but the embedded audio data can be correctly and completely extracted. Therefore,the algorithm can implement the synchronization of audio and video coding while increasing the data embedding capacity, maintaining the quality of video, ensuring the correctness and completeness of the data.

    Object-based polarimetric decomposition method for polarimetric synthetic aperture radar images
    LI Xuewei GUO Yiyou FANG Tao
    2014, 34(5):  1473-1476.  DOI: 10.11772/j.issn.1001-9081.2014.05.1473
    Asbtract ( )   PDF (777KB) ( )  
    References | Related Articles | Metrics

    Object-oriented analysis of polarimetric Synthetic Aperture Radar (SAR) has been used commonly, while the polarimetric decomposition is still based on pixel, which is inefficient to extract polarimetric information. A object-based method was proposed for polarimetric decomposition. The coherent matrix of object was constructed by weighted iteration of scattering coefficient of similarity, and the convergence of coherent matrix was analyzed, therefore polarimetric information could be obtained through the coherent matrix of object instead of pixel, which can improve the efficiency of obtaining polarimetric features. To more fully reflect the terrain target, spatial features of object were extracted. After feature selection, polarimetric SAR image classification experiments using Support Vector Machine (SVM) demonstrate the effectiveness of the proposed method.

    Image splicing detection based on high frequency wavelet Markov features
    YUAN Quanqiao SU Bo ZHAO Xudong LI Shenghong
    2014, 34(5):  1477-1481.  DOI: 10.11772/j.issn.1001-9081.2014.05.1477
    Asbtract ( )   PDF (810KB) ( )  
    References | Related Articles | Metrics

    Splicing is the most universal image tampering operation, detection of which is effective for identifying image tamper. A blind splicing detection method was proposed. The method firstly analyzed the effects of different sub-bands on image splicing detection according to features of wavelet transform. High frequency sub-band was verified to be more appropriate for splicing detection both from theory analysis and experiment results. Secondly, the method conducted difference operation, rounded and made threshold to the coefficients as discrete Markov states, and calculated the state transition probabilities as splicing features. Finally, Support Vector Machine (SVM) was used as classifier, and the features were tested on Columbia image splicing detection evaluation datasets. The experimental results show that the proposed method performs better compared with other features and achieves a detection accuracy rate of 94.6% on the color dataset specially.

    High quality positron emission tomography reconstruction algorithm based on correlation coefficient and forward-and-backward diffusion
    SHANG Guanhong LIU Yi ZHANG Quan GUI Zhiguo
    2014, 34(5):  1482-1485.  DOI: 10.11772/j.issn.1001-9081.2014.05.1482
    Asbtract ( )   PDF (752KB) ( )  
    References | Related Articles | Metrics

    In Positron Emission Tomography (PET) computed imaging, traditional iterative algorithms have the problem of details loss and fuzzy object edges. A high quality Median Prior (MP) reconstruction algorithm based on correlation coefficient and Forward-And-Backward (FAB) diffusion was proposed to solve the problem in this paper. Firstly, a characteristic factor called correlation coefficient was introduced to represent the image local gray information. Then through combining the correlation coefficient and forward-and-backward diffusion model, a new model was made up. Secondly, considering that the forward-and-backward diffusion model has the advantages of dealing with background and edge separately, the proposed model was applied to Maximum A Posterior (MAP) reconstruction algorithm of the median prior distribution, thus a median prior reconstruction algorithm based on forward-and-backward diffusion was obtained. The simulation results show that, the new algorithm can remove the image noise while preserving object edges well. The Signal-to-Noise Ratio (SNR) and Root Mean Squared Error (RMSE) also show visually the improvement of the reconstructed image quality.

    Multi-wavelet inverse transform and post filtering algorithm for digital images
    TAN Xiaorong CHEN Zhaofeng ZHA Daifeng
    2014, 34(5):  1486-1490.  DOI: 10.11772/j.issn.1001-9081.2014.05.1486
    Asbtract ( )   PDF (645KB) ( )  
    References | Related Articles | Metrics

    In order to quickly and effectively reduce digital image from multi-wavelet transform domain to space domain and get the reduced image with better visual result, a reduction method including inverse transform and post filtering was proposed. The proposed method decomposed image from space domain to transform domain by pre-filtering and multi-wavelet transform, and then recombined high and low frequency components, finally reduced spatial domain image without interpolation zero. The experimental results show that compared with the original image, the error value of more than 90% pixels of restored image is less than 0.0001.

    Reconstruction algorithm for auto-calibrating parallel imaging and compressed sensing
    ZHANG Jiuming GUO Shuxu WANG Miaoshi ZHONG Fei
    2014, 34(5):  1491-1493.  DOI: 10.11772/j.issn.1001-9081.2014.05.1491
    Asbtract ( )   PDF (612KB) ( )  
    References | Related Articles | Metrics

    A joint sparsity model, combined with a new soft threshold function, for magnetic resonance parallel imaging reconstruction was presented to improve the quality of reconstructed images. Firstly, the calibration data was used to generate the reconstruction kernel, and the non-acquired data points were reconstructed. Then the joint sparsity model and a new soft threshold function were used to process the image data for each coil. Finally, the compressed sensing magnetic resonance parallel imaging was reconstructed by the improved Projection Over Convex Set (POCS) algorithm. For the simulation images and brain images, the improved algorithm was compared with the original algorithm. When the acceleration ratio was 4, the normalized Root Mean Squared Error (nRMSE) of the reconstructed images was respectively reduced by 23% and 9%. The experimental results show that the improved algorithm can significantly improve the accuracy of the reconstructed parallel imaging images when the acceleration ratio is large relatively.

    Improved image denoising algorithm using UK-flag shaped anisotropic diffusion model
    ZHAI Donghai YU Jiang DUAN Weixia XIAO Jie LI Fan
    2014, 34(5):  1494-1498.  DOI: 10.11772/j.issn.1001-9081.2014.05.1494
    Asbtract ( )   PDF (836KB) ( )  
    References | Related Articles | Metrics

    To effectively improve the denoising effect of the original anisotropic diffusion model that used only the 4 neighborhood pixels information and ignored the diagonal neighborhood pixels information of the pixel to be repaired in the image denoising process, a image denoising algorithm using UK-flag shaped anisotropic diffusion model was proposed. This model not only made full use of the reference information of the 4 neighborhood pixels as in original algorithm, but also used another 4 diagonal neighborhood pixels information in the denoising process. Then the model using the 8 direction pixels information for image denoising was presented, and it was proved to be rational. The proposed algorithm, the original algorithm, and an improved similar algorithm were used to remove the noise from 4 images with noise. The experimental results show that the proposed algorithm has an average increase of 1.90dB and 1.43dB in Peak Signal-to-Noise Ratio (PSNR) value respectively, and an average increase of 0.175 and 0.1 in Mean Structure Similitary Index (MSSIM) value respectively, compared with the original algorithm and the improved similar algorithm, which concludes that the proposed algorithm is more suitable for image denoising. algorithm not only made full use of the reference information of the 4 neighborhood pixels as in original algorithm, but also another 4 diagonal neighborhood pixels information was used in the denoising process, and the algorithm was proved to be rationality. The experimental results showed that the proposed algorithm could increase the PSNR (peak signal-to-noise ratio) value 1.69db, and the MSSIM(mean structure similitary index) value 0.14, compared with the other similar algorithms in image denoising, which conclud that this proposed algorithm is more suitable for image denoising.

    Wavelet threshold denoising algorithm based on new threshold function
    WANG Pei ZHANG Genyao LI Zhi WANG Jing
    2014, 34(5):  1499-1502.  DOI: 10.11772/j.issn.1001-9081.2014.05.1499
    Asbtract ( )   PDF (578KB) ( )  
    References | Related Articles | Metrics

    Since the traditional wavelet threshold functions have some drawbacks such as the non-continuity on the points of threshold, and large deviation of estimated wavelet coefficient, distortion and Gibbs phenomenon occur after denoising. To overcome these drawbacks, an improved threshold function was proposed. Compared with the hard, soft threshold functions and the existing improved threshold function, the proposed function not only is easy to be calculated, but also has the superior mathematical characteristics.To verify its advantages, a series of simulation experiments were performed, the Peak Signal-to-Noise Ratio (PSNR) and Mean Squared Error (MSE) values were compared with other different denoising methods.The experimental results indicate that it is better than above mentioned denoising methods in both the visual effects and the performance of PSNR and MSE.

    Parameters design and optimization of crosstalk cancellation system for two loudspeaker configuration
    XU Chunlei LI Junfeng QIU Yuan XIA Risheng YAN Yonghong
    2014, 34(5):  1503-1506.  DOI: 10.11772/j.issn.1001-9081.2014.05.1503
    Asbtract ( )   PDF (747KB) ( )  
    References | Related Articles | Metrics

    In three-dimensional sound reproduction with two speakers, Crosstalk Cancellation System (CCS) performance optimization often pay more attention to the effect independently by the factors such as inverse filter parameters design and loudspeaker configuration. A frequency-domain Least-Squares (LS) estimation approximation was proposed to use for the performance optimization. The relationship between these factors and their effect on CCS performance was evaluated systematically. To achieve the tradeoff of computing efficiency and system performance of crosstalk cancellation algorithm, this method obtained the optimization parameters. The effect of crosstalk cancellation was evaluated with Channel Separation (CS) and Performance Error (PE) index, and the simulation results indicate that these parameters can obtain good crosstalk cancellation effect.

    Task scheduling scheme for civil aviation information exchange
    PAN Yu SONG Xueyan SUN Jizhou
    2014, 34(5):  1507-1510.  DOI: 10.11772/j.issn.1001-9081.2014.05.1507
    Asbtract ( )   PDF (766KB) ( )  
    References | Related Articles | Metrics

    In order to support the distributed transmission of a lot of tasks on the data exchange platform for civil aviation information, it needs to establish the efficient task scheduling algorithms and models. Based on the infrastructure and needs of the platform, after analyzing the existing task scheduling models and scheduling algorithms, a new task scheduling model was proposed to fulfill the data exchange on this platform. This model mapped the point-to-multipoint data transmission network to a Steiner tree problem with delay and bandwidth constraints, and an improved Genetic Algorithm (GA) was also proposed to solve the constrained Steiner tree problem. The results of comparative experiment with the maximum bandwidth allocation algorithm prove the validity and feasibility of the proposed model.

    Deterministic algorithm for optimal two-stage cutting layouts with same-shape block
    JI Jun XING Feifei DU Jun SHIning CUI Yaodong
    2014, 34(5):  1511-1515.  DOI: 10.11772/j.issn.1001-9081.2014.05.1511
    Asbtract ( )   PDF (654KB) ( )  
    References | Related Articles | Metrics

    A deterministic algorithm for two-stage cutting layout with same-shape block was proposed to solve the large-scale two-dimensional cutting problems. The algorithm used dynamic programming to generate the optimal same-shape block, solved the knapsack problem to determine the optimal layout of the same-shape block in the same-shape section and the same-shape section in the same-shape segment, and optimally selected the two segments to compose the optimal same-shape block layout. The algorithm was tested through 43 benchmark problems, and compared with the classic two-stage and the three-block algorithms. The experimental results indicate that the algorithm is superior in both computation time and material usage rate, it not only meets the requirements of shearing and punching process, but also achieves good results within reasonable time.

    Retail checkout optimized scheduling based on plant growth simulation algorithm
    WANG Tingting YANG Qin
    2014, 34(5):  1516-1520.  DOI: 10.11772/j.issn.1001-9081.2014.05.1516
    Asbtract ( )   PDF (778KB) ( )  
    References | Related Articles | Metrics

    Maximizing customer satisfaction is directly related to the enterprise profit and market competitiveness for the supermarket as a service enterprise, so it is important to optimize the retail checkout operation. Firstly, the retail checkout scheduling problem was described by a triplet of α/β/γ, maximizing customer satisfaction was taken as the first goal and minimizing operating cost was taken as the second goal with machine usage restriction and the rule of First In First Out (FIFO). The corresponding mathematical model was established, and then an algorithm was designed using plant growth simulation algorithm. 〖BP(〗Finally, the actual data was used to simulate, and the results prove that the study has effectiveness and feasibility. 〖BP)〗Finally, a numerical simulation of actual cases was used to verify the effectiveness and feasibility of the method.

    Modeling and simulating of train tracking based on multi-Agent theory
    CHEN Yong DANG Jianwu HU Xiaohui
    2014, 34(5):  1521-1525.  DOI: 10.11772/j.issn.1001-9081.2014.05.1521
    Asbtract ( )   PDF (780KB) ( )  
    References | Related Articles | Metrics

    Train tracking problem under moving block condition was studied according to the characteristics of CTCS-4 train operation. A Multi-Agent System (MAS) model of multi-train tracking under moving block condition was built based on multi-Agent theory and the interaction mechanism between the train and the Radio Block Center (RBC) was proposed. The model realized the real-time vehicle ground communication and safe distance control of multi-train tracking. The influences of the speed change in train tracking process and different line initialization density on line traffic were simulated, and corresponding quantitative analysis conclusions were obtained. The simulation results show that the proposed MAS model can realize Complex System (CS) formal description of the train control system in the static and dynamic environment, and accurately describe CTCS-4 train tracking mechanism. The example evaluation results prove the feasibility and effectiveness of the proposed method.

    Modeling and simulating of train tracking based on multi-Agent theory
    CHEN Shiyu NI Li LYV Zhao WU Xiaopei
    2014, 34(5):  1521-1525.  DOI: 10.11772/j.issn.1001-9081.2014.05.1526
    Asbtract ( )   PDF (582KB) ( )  
    References | Related Articles | Metrics

    Train tracking problem under moving block condition was studied according to the characteristics of CTCS-4 train operation. A Multi-Agent System (MAS) model of multi-train tracking under moving block condition was built based on multi-Agent theory and the interaction mechanism between the train and the Radio Block Center (RBC) was proposed. The model realized the real-time vehicle ground communication and safe distance control of multi-train tracking. The influences of the speed change in train tracking process and different line initialization density on line traffic were simulated, and corresponding quantitative analysis conclusions were obtained. The simulation results show that the proposed MAS model can realize Complex System (CS) formal description of the train control system in the static and dynamic environment, and accurately describe CTCS-4 train tracking mechanism. The example evaluation results prove the feasibility and effectiveness of the proposed method.

    Design and research of novel virtual EEPROM based on NAND flash device partition
    WEI Bing GUO Yutang HUA Yupng ZHANG Lei
    2014, 34(5):  1526-1528.  DOI: 10.11772/j.issn.1001-9081.2014.05.1529
    Asbtract ( )   PDF (630KB) ( )  
    References | Related Articles | Metrics

    In this paper, an novel virtual EEPROM based on flash device was designed, which focused on the current urgent need for low-cost in embedded systems especially, The virtual EEPROM was used as NAND device part in embedded Operating System (OS), which used data backup mechanism to ensure data security. Considering that NAND only supports page programming, a method of log update based on memory buffer was employed to realize byte programming in Virtual EEPROM. Finally, to achieve unified management of NAND block, a wear leveling was designed, meanwhile, issues of bad block and Program/Erase cycle were greatly optimized. The result shows that the Virtual EEPROM has fast programming characteristics of NAND, as well as a great advantage of endurance over the EEPROM. The design has good compatibility and can be widely transplanted in various embedded platforms.

2024 Vol.44 No.3

Current Issue
Archive
Honorary Editor-in-Chief: ZHANG Jingzhong
Editor-in-Chief: XU Zongben
Associate Editor: SHEN Hengtao XIA Zhaohui
Domestic Post Distribution Code: 62-110
Foreign Distribution Code: M4616
Address:
No. 9, 4th Section of South Renmin Road, Chengdu 610041, China
Tel: 028-85224283-803
  028-85222239-803
Website: www.joca.cn
E-mail: bjb@joca.cn
WeChat
Join CCF