Loading...

Table of Content

    2012-11-01, Volume 32 Issue 11
    Design of termination criterion of BMS algorithm for lexicographical ordering
    2012, 32(11):  2977-2980.  DOI: 10.3724/SP.J.1087.2012.02977
    Abstract ( )   PDF (660KB) ( )  
    References | Related Articles | Metrics
    The BMS algorithm from Coding Theory has good decoding efficiency and error-correcting capability, and current work usually focuses on the case of graded orderings. With the analysis on the essential characteristics of lexicographical and graded orderings, a termination criterion of BMS algorithm for the lexicographical ordering is designed by using the elimination property of Gr?bner bases, which are closely related to the BMS algorithm, and an implementation-oriented description for the algorithm based on this criterion is also provided. Experimental results verify the effectiveness of the proposed termination criterion, and the new criterion matches the original theoretical one in the algorithm.
    Biogeographybased optimization algorithm of differential evolution
    2012, 32(11):  2981-2984.  DOI: 10.3724/SP.J.1087.2012.02981
    Abstract ( )   PDF (571KB) ( )  
    References | Related Articles | Metrics
    To improve the realcoded searching ability of the BiogeographyBased Optimization (BBO) algorithm, this paper presented a hybrid algorithm BBO/DEs based on Differential Evolution (DE). In order to solve the prematurity of BBO, the algorithm incorporated the search performance of differential evolution and the utilization performance of BBO. And a Levy mutation strategy was introduced to enhance population diversity. Finally suitable trial vector was chosen by comparison. Some correlation algorithms were compared on highdimensional benchmark functions. The experimental results show that without losing the original ability the proposed algorithm can improve the searching ability, and it has higher efficiency in terms of search accuracy and speed.
    Improved indicatorbased evolutionary algorithm based on grid
    XIAO Bao-qiu LIU Yang DAI Guang-ming
    2012, 32(11):  2985-2988.  DOI: 10.3724/SP.J.1087.2012.02985
    Abstract ( )   PDF (581KB) ( )  
    References | Related Articles | Metrics
    Evolutionary MultiObjective Optimization (EMO) has become a very popular topic in the last few years. However, designing an efficient EMO algorithm for finding wellconverged and welldistributed approximate optimal set is a challenging task. In this paper, an improved IBEA algorithm was proposed to solve Multiobjective Optimization Problems (MOPs) efficiently. The proposed approach introduced a diversity promotion mechanism based on grid in objective space to ensure the approximate optimal set has good distribution. To make the algorithm converge faster, the new approach employed oppositionbased learning mechanism to evaluate the current solutions and their opposite solutions simultaneously in order to find a group of better solutions. The experiments on six benchmark problems show that the new approach is able to obtain a set of welldistributed solutions approximating the true Paretofront.
    User ranking algorithm for microblog search based on MapReduce
    LIANG Qiu-shi WU Yi-lei FENG Lei
    2012, 32(11):  2989-2993.  DOI: 10.3724/SP.J.1087.2012.02989
    Abstract ( )   PDF (870KB) ( )  
    References | Related Articles | Metrics
    When microblog users search someone, they would like to follow by keywords. Most service providers order their results list simply depending on the scale of followers. Unfortunately, this approach gives frauds quite a few opportunities to cheat the search engine. This paper, by regarding microblog users as Web pages, and the relationship between followers as the one between Web pages that linked each other, applied the basic idea of PageRank to rank microblog users. After introducing a statetransition matrix and an autoiterative MapReduce workflow to parallel the computation steps, this paper described a user ranking algorithm for microblog search. As shown in the experiment by using Hadoop platform, the algorithm increases the difficulty to cheat search engines, makes more important users get better rankings, and improves the relevance and quality of search results.
    Application of domain decomposition method in parallel computing of CoLM
    2012, 32(11):  2994-2997.  DOI: 10.3724/SP.J.1087.2012.02994
    Abstract ( )   PDF (644KB) ( )  
    References | Related Articles | Metrics
    Domain decomposition method has great advantage for solving massive complicated problems. This paper proposed a domain decomposition method based on weighted average. If the research region is relatively big and the calculation accuracy is relatively low, this method is effective. This method decomposed the grid based on the land cover, and discreted parameters using time dimension finite difference method, and then the patches of each grid were weightedly aggregated to obtain the final output. This paper proposed the concrete steps of the method, and validated it by using the sensible and latent heat flux simulation result based on the CoLM model.
    Genetic algorithm for solving a class of multifollower fractional bilevel programming problems
    DU Cheng-juan LI He-cheng
    2012, 32(11):  2998-3001.  DOI: 10.3724/SP.J.1087.2012.02998
    Abstract ( )   PDF (546KB) ( )  
    References | Related Articles | Metrics
    For a kind of fractional bilevel programming problems with more than one linear follower, a genetic algorithm based on a new encoding scheme was proposed. Firstly, the dual theory was applied to transform the original problem to a singlelevel nonlinear programming; secondly, all individuals were encoded by considering feasible base of the follower's dual problem. For any individual given, the dual variables can be solved, which makes the nonlinear problem become a linear fractional programming; finally, the resulting linear fractional programming was resolved and the objective value was taken as the fitness of this individual. Based on the encoding scheme and fitness evaluation, the efficiency of the genetic algorithm is improved, which is also illustrated by the simulation of four examples.
    Intuitionistic fuzzy multiple attributes decision making method based on entropy and correlation coefficient
    WANG Cui-cui YAO Deng-bao MAO Jun-jun SUN Li
    2012, 32(11):  3002-3017.  DOI: 10.3724/SP.J.1087.2012.03002
    Abstract ( )   PDF (627KB) ( )  
    Related Articles | Metrics
    In order to deal with the problems that decision information is intuitionistic fuzzy and attribute weights are unknown, a decisionmaking method based on intuitionistic fuzzy entropy and score function was proposed. Firstly, a new concept of intuitionistic fuzzy entropy was presented to measure the intuitionism and fuzziness of intuitionistic fuzzy sets, and relevant properties were also discussed. Secondly, to decrease decision effects of uncertain information, a programming model was constructed to determine attribute weights combined with intuitionistic fuzzy entropy. Meanwhile, in the view of membership, nonmembership and hesitancy degree, correlation coefficients between objects of the universe and the ideal object were constructed, and according to decision makers attitude, the optimal decision was obtained by defining the score function. Finally, the article proposed a multiple attribute decision making method on intuitionistic fuzzy information, and the feasibility and effectiveness of the method are verified through a case study of candidates evaluation.
    Evolutionary K-means algorithm based on global splitting operator
    WANG Liu-zheng HE Zhen-feng
    2012, 32(11):  3005-3008.  DOI: 10.3724/SP.J.1087.2012.03005
    Abstract ( )   PDF (699KB) ( )  
    Related Articles | Metrics
    Evolutionary Algorithm (EA) can effectively overcome the drawback that Kmeans is sensitive to the initial clustering centers, thus enhancing the clustering performance. On the basis of evolutionary Kmeans clustering algorithm (FEAC), considering the randomness and locality in the splitting operator as a mutation operation, two improved splitting operators with global information (global splitting operator) were proposed. The idea of maxmin distance and the information of peripheral clusters were used to guide the selection of the initial splitting centers, in order to make splitting process more beneficial to global partition, furthermore, to improve the efficiency of the evolutionary clustering. The experimental results show that the improved algorithms based on global splitting operator outperform FEAC in terms of clusters number discovering and clustering accuracy.
    Domain knowledge semantic distance and its application in expert system
    LI Jian-xun SHEN Bing XIE Jian-cang JIANG Ren-gui
    2012, 32(11):  3009-3013.  DOI: 10.3724/SP.J.1087.2012.03009
    Abstract ( )   PDF (903KB) ( )  
    References | Related Articles | Metrics
    Oriented to the measurement of programmable knowledge distance in the expert system, based on the domain knowledge ontology and ontology tree, the paper established four measurements: knowledge identity distance, knowledge concept distance, knowledge attribute distance, and knowledge description distance, which were assembled by Ordered Weighted Geometric (OWG) operator after being standardized. As a result, a more comprehensive domain knowledge semantic distance model with strong applicability was obtained, so as to effectively solve the identification problem of domain knowledge database in expert system. The results show that: this model can quickly determine the similarity of two domain knowledge in expert system with an accuracy of above 82%.
    Semantic detection of video events based on probabilistic hypergraph
    REN Mei ZHAN Yong-zhao PAN Dao-yuan SUN Jia-yao
    2012, 32(11):  3014-3017. 
    Abstract ( )   PDF (662KB) ( )  
    References | Related Articles | Metrics
    The categorization of video events is blur and uncertain. Expanding the hypergraphs pointset matrix into the probabilistic form of soft hypergraph, and analyzing the correlation of events and semantic, the precision and recall rate of the multievent retrieval system will be improved. This paper proposed a video event semantic detection algorithm based on probabilistic hypergraph model (PHVESD). Firstly, the method integrated the lowlevel visual features, color,graylevel cooccurrence matrix, Tchebichef moment and Local Binary Pattern (LBP); then defined the intimacy function of video segmentation and used the intimacy information construct probabilistic hypergraph model, in which each hyperedge corresponded to an event semantics; adopted Markov random walk model to predict the probability of video segment belonging to each hyperedge; finally, classified the unknown video event with MAP. The authors used this method on traffic emergent multisemantic events detection and compared the proposed method to another. The experimental results show that, compared to Multi Label Random Walk (MLRW) algorithm based on the hypergraph model, the proposed method makes the multisemantic event detection precision improve by 10%, the recall rate increase by 8%.
    Web clustering based on hybrid probabilistic latent semantic analysis model
    WANG Zhi-he WANG Ling-yun DANG Hui PAN Li-na
    2012, 32(11):  3018-3022. 
    Abstract ( )   PDF (743KB) ( )  
    References | Related Articles | Metrics
    In Ecommerce, in order to know more about the inherent characteristics of user access and make better marketing strategies, a Web clustering algorithm based on Hybrid Probabilistic Latent Semantic Analysis (HPLSA) model was proposed in this paper. The Probabilistic Latent Semantic Analysis (PLSA) models were established respectively on user browsing data, page information and enhanced user transaction data by using PLSA technology. Using loglikelihood function, three PLSA models were merged to get the user clustering HPLSA model and the page clustering HPLSA model. Similarity calculation was based on the conditional probability among latent themes and user, page as well as site in the clustering analysis. The kmedoids algorithm based on distance was adopted in this clustering algorithm. The HPLSA model was designed and constructed in this article, and the Web clustering algorithm was verified on this HPLSA model. Then it is proved that the algorithm is effective.
    Semantic orientation study on Chinese network comments
    LI Hua CHU He-lan GAO Min
    2012, 32(11):  3023-3033.  DOI: 10.3724/SP.J.1087.2012.03023
    Abstract ( )   PDF (668KB) ( )  
    References | Related Articles | Metrics
    Considering the huge amount of information in network comments, using computers to recognize the semantic orientation of the comments automatically will make great significance. In this paper, by using the semantic orientation analysis based on HowNetbased semantic similarity method, the research improved related methods to satisfy the semantic orientation recognition of network comments. The experimental results show that the improved method is more reasonable, and to some degree the accuracy rate of semantic orientation recognition has been improved.
    BBS topic tracking method for military public opinion based on Wikipedia
    LIU Xiao-liang
    2012, 32(11):  3026-3029.  DOI: 10.3724/SP.J.1087.2012.03026
    Abstract ( )   PDF (703KB) ( )  
    References | Related Articles | Metrics
    A method using Wikipedia as semantic and background knowledge was proposed for public military topic tracking on BBS. The semantic profiles of a post was modeled by text graph, in which nodes and edges were considered as: Wikipediabased words semantic relevance, word cooccurrence with military themes and post structure, then a modified link mining method was utilized to extract the key words from text graph. At last, topic tracking was realized by calculating the semantic relevance of keywords between the post and topic. In the experiment, the results show that this method can effectively solve the problem of semantic feature scarcity in BBSoriented military topic tracking.
    Document sensitive information retrieval based on interest ontology
    CHEN Hua-cheng DU Xue-hui CHEN Xing-yuan XIA Chun-tao
    2012, 32(11):  3030-3033.  DOI: 10.3724/SP.J.1087.2012.03030
    Abstract ( )   PDF (635KB) ( )  
    References | Related Articles | Metrics
    With the development of computer technology and Internet, more and more office hosts have been connected to Internet, the threat of sensitive information leakage becomes serious. Therefore, it is extremely necessary to detect whether documents contain sensitive information. In order to solve the low precision and low recall problems caused by the traditional query expansion retrieval methods, this paper built an ontology of sensitive information for users interest, proposed a concept similarity query expansion algorithm based on the interest ontology, and described an experimental case to verify the feasibility of algorithm. The experimental results show that the proposed algorithm can improve the precision and recall of the traditional methods.
    Instance selection algorithms of balanced class distribution based on Hubness for time series
    ZHAI Ting-ting HE Zhen-feng
    2012, 32(11):  3034-3037.  DOI: 10.3724/SP.J.1087.2012.03034
    Abstract ( )   PDF (653KB) ( )  
    References | Related Articles | Metrics
    In order to solve the imbalanced class distribution in the selected instances of INSIGHT algorithm and that the importance of instances with the same score cannot be distinguished, two improved algorithms were proposed respectively. The first one based on the divide and conquer strategy achieved balanced class distribution by choosing the most representative instances from every class of the training set. The second one adapted single sorting of the first one to double sorting so that it could measure the importance of different instances effectively. The experimental results show that the proposed algorithms outperform INSIGHT in terms of the classification accuracy under the condition of basically the same time complexity.
    Application of active learning to recommender system in communication network
    CHEN Ke-jia HAN Jing-yu ZHENG Zheng-zhong ZHANG Hai-jin
    2012, 32(11):  3038-3041.  DOI: 10.3724/SP.J.1087.2012.03038
    Abstract ( )   PDF (630KB) ( )  
    References | Related Articles | Metrics
    The existence of potential links in sparse networks becomes a big challenge for link prediction. The paper introduced active learning into the link prediction task in order to mine the potential information of a large number of unconnected node pairs in networks. The most uncertain ones of the unlabeled examples to the system were selected and then labeled by the users. These examples would give the system a higher information gain. The experimental results in a real communication network dataset Nodobo show that the proposed method using active learning improves the accuracy of predicting potential contacts for communication users.
    Time difference insertion heuristics algorithm for vehicle routing problem with hard time window
    PAN Li-jun FU Zhuo
    2012, 32(11):  3042-3070.  DOI: 10.3724/SP.J.1087.2012.03042
    Abstract ( )   PDF (484KB) ( )  
    References | Related Articles | Metrics
    The Vehicle Routing Problem with Hard Time Window (VRPHTW) is a kind of Vehicle Routing Problem (VRP) which has a lot of applications. The existing heuristics of this problem hold shortcomings such as complex structure, lots of parameters and low efficiency. Therefore, Time Difference Insertion Heuristics (TDIH) for VRPHTW was proposed. The algorithm introduced the concept of Time Difference (TD), and took TD as a heuristic rule evaluation indicator. Compared to other classic heuristics, the algorithm was characterized with fewer parameters and simpler structure. The computational results on the benchmark problems show that the algorithm is better than the Solomons insertion heuristics and Potvins parallel insertion heuristics.
    Prediction of multivariate probabilistic systems based on predictive state representation
    WANG Qing-miao JU Shi-guang
    2012, 32(11):  3044-3046.  DOI: 10.3724/SP.J.1087.2012.03044
    Abstract ( )   PDF (480KB) ( )  
    References | Related Articles | Metrics
    In this paper, a new method based on Predictive State Representation (PSR) was proposed to solve high complexity of multivariate probability system. The paper introduced a new concept about general multivariate process in the first, and then described the multivariate system with the concept. Furthermore, the authors imported MultiVariate (MV)PSR as prediction model for multivariate system. The model was based on observable information and could realize the multivariate prediction in the finite dimensions. The experimental result shows that the approximate model effectively reduces the complexity of the system prediction.
    Control strategy parameter analysis of parallel hybrid electric vehicles based on multiindex orthogonal experiment
    YANG Guan-ci LI Shao-bo TANG Xiang-hong QU Jing-lei ZHONG Yong
    2012, 32(11):  3047-3053.  DOI: 10.3724/SP.J.1087.2012.03047
    Abstract ( )   PDF (588KB) ( )  
    References | Related Articles | Metrics
    Concerning the parameter optimization of electric assist control strategy for Hybrid Electrical Vehicles (HEV), the orthogonal table was designed based on the theory of orthoplan experiment, which took the fuel consumption, the COs emission, and the total emission of HC and NOx as the experimental indexes. The influence of control strategy parameters on the parallel HEV was obtained by using intuitive analysis to analyze the 18 group test results, and then the remarkably influencing factors of each index were found out.
    Application of improved genetic algorithm based on uniform design sampling crossover operator in regression model
    SHI Ming-hua ZHOU Ben-da ZHOU Ming-hua
    2012, 32(11):  3050-3053.  DOI: 10.3724/SP.J.1087.2012.03050
    Abstract ( )   PDF (548KB) ( )  
    References | Related Articles | Metrics
    After analyzing the advantages and disadvantages of good point genetic algorithm, the crossover operation of Genetic Algorithm (GA) was redesigned by using the theory and methods of Uniform Design Sampling (UDS). Then an improved GA based on UDS was presented. In combination with statistical criteria, the new algorithm was used for variable and transformation simultaneous selection in solving regression model selection problem. The results of simulation show a good improvement in solution quality, stability and other various indices.
    Application of particle swarm optimization to spacetime twodimensional parameter estimation
    QIU Xin-jian SHANBAI Dalabaev XUE Feng-feng
    2012, 32(11):  3054-3056.  DOI: 10.3724/SP.J.1087.2012.03054
    Abstract ( )   PDF (467KB) ( )  
    References | Related Articles | Metrics
    The traditional spacetime twodimensional parameter estimation has many shortcomings, such as high computational complexity, poor robustness and generalization, and slow convergence speed. According to the spacetime equivalence and that the spatial and time domain processing algorithms can be transformed into each other, a suitable fitness function was derived, the improved particle swarm algorithm was used to search the arrival angle and frequency of signal, and the search results were classified with Kmeans clustering algorithm. Using particle swarm algorithms feature, such as global convergence, parallelism, can improve the algorithms searching capabilities. The computer simulation shows that the proposed method has better statistics and convergence performance than traditional methods.
    Research of modern geometry based on mass point method
    LI Tao ZOU Yu
    2012, 32(11):  3057-3061.  DOI: 10.3724/SP.J.1087.2012.03057
    Abstract ( )   PDF (587KB) ( )  
    References | Related Articles | Metrics
    Based on the mass point method, the paper developed a new Mathematica prover. With this prover, hundreds of modern geometric theorems had been proved for the first time, and the proof readability was also satisfactory. With its help, some of the new modern geometric properties were found, and some research results on modern geometry got deepened too.
    Stereotype based pattern notation method
    LIU Wei HU Zhi-gang
    2012, 32(11):  3062-3066.  DOI: 10.3724/SP.J.1087.2012.03062
    Abstract ( )   PDF (689KB) ( )  
    References | Related Articles | Metrics
    Design pattern plays a very important role in objectoriented software design, development and maintenance. In order to overcome the drawbacks and weaknesses of the previous methods for design patterns notation, SBPN,a stereotypebased pattern notation method was proposed. Based on the stereotype mechanism in Unified Modeling Language (UML), SBPN provides some rules for labeling patternrelated information. It can not only identify precisely the role of a modeling element, such as a class, a method or an attribute in structural diagrams, but also label the information in interaction diagrams. Whats more SBPN provides a solution for labeling patternrelated information in source codes. Some cases were given to describe how to label patternrelated information in class diagrams, interaction diagrams and source codes, and a complex design diagram of sort system was also labeled by SBPN.
    Formal analysis and verification of randomness resources for Internetware
    XIA Qi WANG Zhong-qun
    2012, 32(11):  3067-3070.  DOI: 10.3724/SP.J.1087.2012.03067
    Abstract ( )   PDF (604KB) ( )  
    References | Related Articles | Metrics
    The resources on Internet are uncertain and random, which poses a challenge on how to guarantee that requirements of the resources are met for an Internetware system at run time. The interface automata with randomness resources was used to model the behaviors of software component, and the combination behavior of component assembly system was described using the randomness resources interface automata networks. Under the circumstance of resources with uncertainty and randomness, whether all the behaviors of a system were satisfied within the specified resource constraints was checked. And a reached graph based algorithm was proposed. Finally, the online bookstore system was used to illustrate the work, and the model checker Spin was used to verify the correctness of the proposed approach.
    Property preserving operation for simplifying Petri nets with inhibitor arcs
    MO Li-ping YUE Xiaobo ZHOU Kai-qing ZHANG Zhao-hai
    2012, 32(11):  3071-3074.  DOI: 10.3724/SP.J.1087.2012.03071
    Abstract ( )   PDF (596KB) ( )  
    References | Related Articles | Metrics
    Petri nets simplification of property preservation is a significant approach for Petri nets analysis. Meanwhile, the computational ability of Petri nets with inhibitor arcs is equal to Turing machine. From the perspective of series transition and series places respectively, this paper proposed two simplified methods of the Petri nets with inhibitor arcs. Finally, it proved that the characteristics such as aliveness, boundedness and weak fairness of simplified Petri nets with inhibitor arcs were kept unanimous with the original Petri nets with inhibitor arcs by these methods.
    Complete path coverage testing based on change
    LIU Ji-hua CHEN Ce
    2012, 32(11):  3075-3081.  DOI: 10.3724/SP.J.1087.2012.03075
    Abstract ( )   PDF (665KB) ( )  
    References | Related Articles | Metrics
    In order to solve the problem that the test cases generated from the complete path coverage based on the search on state node are too many and it is difficult to achieve continuous test, it is necessary to put forward a test criteria for complete path coverage based on change, design and implement an automatic generation algorithm (DWFS algorithm) of complete path coverage based on change, combining the depth first search and width first search. The experimental results show that the standards based on the change of the complete path coverage are more stringent than those based on the complete state coverage, and the corresponding DWFS algorithm can produce better test suite and can more easily accomplish software continuous dynamic test.
    Algorithm for Generating Weighted Voronoi Diagram Based on Quadtree Structure
    LI Rui LI Jia-tian WANG Hua PU Hai-xia HE Yu-feng
    2012, 32(11):  3078-3081.  DOI: 10.3724/SP.J.1087.2012.03078
    Abstract ( )   PDF (642KB) ( )  
    References | Related Articles | Metrics
    Considering the limitation of research on ordinary Voronoi diagram and low efficiency of the capabilities to build weighted voronoi diagram, a method based on quadtree structure for generating weighted Voronoi diagram was proposed in this paper. The key idea of this method was to obtain searched correlated seeds region of the nonexpansion nodes by the quadtree structure, calculate the time consumption value to replace weighted distance, and determine the ownership seed according to the node shortest time consumption value. The computing model based on quadtree structure and several basic characteristics of the method were given. The test result shows that the seeds are rapidly dilated, the time complexity gets effectively lower than uniform grid structure. The algorithm is simple, and it has a strong maneuverability and practical value.
    Study on efficiency of Sunday algorithm
    PAN Guan-hua ZHANG Xing-zhong
    2012, 32(11):  3082-3088.  DOI: 10.3724/SP.J.1087.2012.03082
    Abstract ( )   PDF (533KB) ( )  
    References | Related Articles | Metrics
    Given the characteristic that the Sunday algorithm is too complex to construct Markov chains, a new method according to the difference of matching number in the algorithms was proposed to compute the average efficiency. Firstly, the naive algorithm was chosen as the foundation, and its accurate average efficiency was computed by Markov chains. Secondly, the difference of the two algorithms was computed by the corresponding knowledge in probability theory. The two results were combined to get the equation which represented the average efficiency of Sunday algorithm. The experimental results show that the estimated value computed by the equation is the average number of the matching times.
    Graphical metamodel construction method of embedded control system
    CHEN De-sheng WANG Bin XUE Jie YU Li
    2012, 32(11):  3085-3088.  DOI: 10.3724/SP.J.1087.2012.03085
    Abstract ( )   PDF (638KB) ( )  
    References | Related Articles | Metrics
    An embedded control system development methodology based on modeldriven development method was studied, the basic features and architecture of the embedded control system were analyzed and summarized, and the key elements of this specific domain were identified and extracted. Afterwards, a visible element modeling technique was used to build a directly graphical model system, and this embedded modeling technique based on modeldriven was applied to realize a model of embedded voice control system design. As a result, the visual source model of this system was obtained.
    Enhanced binary search algorithm based on stack storage
    YUAN Zheng-wu DUAN Li-dan
    2012, 32(11):  3089-3091.  DOI: 10.3724/SP.J.1087.2012.03089
    Abstract ( )   PDF (510KB) ( )  
    References | Related Articles | Metrics
    In the RFID system, the tags collision resulting from the data transaction between several tags and the reader at the same time is unavoidable. Focusing on the tags collision problem of the RFID system, analyzing the theories of binary, dynamic binary and retrusive binary algorithm, and considering the identifying times and the bits of transmitting data together, an improved algorithm which effectively reduced the times of identification and transmission of redundant information via preprocessing the tags’ ID and setting the stack on reader was presented. The simulation results indicate that this algorithm can obtain a better performance in terms of timesefficiency and bitsefficiency.
    Separation of the high speed rail GSM-R interference signal based onthe multi-frame statistical spectrum
    YAN Tian-feng ZHAO Jie FENG Chao MENG Ling-wei
    2012, 32(11):  3092-3095.  DOI: 10.3724/SP.J.1087.2012.03092
    Abstract ( )   PDF (558KB) ( )  
    References | Related Articles | Metrics
    Global System for Mobile Communications for Railway (GSMR) communication system of highspeed railway is vulnerable to the interference of wireless signals of other types. In this paper, the authors analyzed and researched several GSMR interference signals and proposed a new kind of signal separation algorithm based on the multiframe statistical spectrum. The idea of the algorithm was that the interference signal was divided into multiple frames and accumulated to statistical spectrum. If the number of frames was sufficient, its spectral parameter tended to be a constant. The experimental results show that the algorithm can quickly separate the original and interference signals in the case of known original signal spectrum, its effect and versatility is better, and the complexity of the algorithm is less than the traditional method.
    Improved spectrum sensing algorithm based on index belief degree function
    LI Shi-yin XIAO Shu-yan SUN Qian WANG Miao-miao
    2012, 32(11):  3096-3099.  DOI: 10.3724/SP.J.1087.2012.03096
    Abstract ( )   PDF (680KB) ( )  
    References | Related Articles | Metrics
    This paper studied the spectrum sensing algorithms mainly from the perspective of multiple cognitive radio users. At present, most decision rules do not take the influence of the trust of spectrum sensing results into consideration. This paper proposed a new sending scheme based on index belief degree function. This scheme is a method of low complexity to improve the performance of spectrum sensing. Considering the security in cognitive radio network, this paper presented a cognitive radio spectrum algorithm based on outlier. This algorithm introduced outlier sensing to the fusion rules and this scheme could improve the robustness of spectrum sensing when some sensing nodes were malfunctioned or malicious. Considering the speed and precision of spectrum sensing in cognitive radio, this paper considered the sensing information to the spectrum sensing algorithm. This algorithm can improve the detection performance of spectrum sensing while accelerating the speed of spectrum sensing.
    New rapid algorithm for detecting girth of lowdensity Paritycheck codes
    LI Jiong-cheng LI Gui-yu XIAO Heng-hui HUANG Hai-yi
    2012, 32(11):  3100-3106.  DOI: 10.3724/SP.J.1087.2012.03100
    Abstract ( )   PDF (493KB) ( )  
    References | Related Articles | Metrics
    Concerning the girth problem of LowDensity ParityCheck(LDPC) codes, a new rapid algorithm for detecting the girth of LDPC codes in combination with Dijkstra algorithm and the feature of Tanner graph was proposed, and the time complexity of this algorithms was lower. Compared with known algorithms, this algorithm not only can calculate rapidly, but also return the girth and edges only one time, thus avoiding redundant computation. At last, the simulation verifies the feasibility and efficiency of this new algorithm.
    Network coding based reliable data transmission policy in wireless sensor network
    CHEN Zhuo CHEN Yang FENG Da-quan
    2012, 32(11):  3102-3106.  DOI: 10.3724/SP.J.1087.2012.03102
    Abstract ( )   PDF (853KB) ( )  
    References | Related Articles | Metrics
    With reference to network coding theory, a reliable data transmission policy,MGrowth Codes was proposed, for wireless sensor network environment. Through a gradientbased routing design, all data can converge to sink node (Sink). In addition, the data transmission policy can also use encoded packet to decode other encoded packets, which can further enhance the data recoverability. After the network simulation, MGrowth Codes can effectively increase the throughput of the wireless sensor network and improve the reliability of data transmission.
    Energybalanced adaptive clustering algorithm for wireless sensor network
    LV Tao ZHU Qing-xin ZHU Yu-yu
    2012, 32(11):  3107-3111.  DOI: 10.3724/SP.J.1087.2012.03107
    Abstract ( )   PDF (782KB) ( )  
    References | Related Articles | Metrics
    This paper presented an EnergyBalanced Adaptive Clustering Algorithm (EBACA) for Wireless Sensor Network (WSN) based on LEACH and HEED, in which a node, according to its status, independently made its decision to compete for acting as a cluster head. The cluster head selection criteria took account of both random probability and node residual energy, and introduced the combination of the node energy prediction and energy threshold. In order to balance energy consumption of each node, EBACA adjusted time slice to modify working frequency of each node. Furthermore, EBACA used the multihop manner for intercluster data transmission in order to save total energy consumption. A specialized cluster head node was responsible for collecting the data from other cluster head nodes, and then transmitted the aggregated data to the base station. Its objective was to balance the energy consumption and maximize the network lifetime. The analysis and simulation results show that EBACA provides more uniform energy consumption among nodes and can prolong network lifetime compared to LEACH and HEED.
    Status fusion method for wireless network based on Kalman filtering and data associated
    DUAN Mo-yi
    2012, 32(11):  3112-3124.  DOI: 10.3724/SP.J.1087.2012.03112
    Abstract ( )   PDF (570KB) ( )  
    References | Related Articles | Metrics
    In order to mitigate the performance by interference signal in wireless network transmission, a new signal status fusion method SFWD (Signal Fusion based on Wavelet transform and Data association) was proposed. In this method, the longrange dependence of signal was reduced by wavelet transform at first, and the fusion algorithm was established with Kalman filter and date association. Then, a simulation was conducted to research the relationship between the signal status and influencing factors. The result shows that it is of adaptability with wireless network signal, and the standard deviation between the fusion signal data and original signal is 7.13.
    Survey of physical unclonable function
    ZHANG Zi-nan LIU Wei GUO Yuan-bo
    2012, 32(11):  3115-3120.  DOI: 10.3724/SP.J.1087.2012.03115
    Abstract ( )   PDF (1002KB) ( )  
    References | Related Articles | Metrics
    Though PUF is a new concept in recent years, since it has application prospect for the security of system authentication and key generation, it has become a hot research topic in the field of hardware security. In order to get the whole picture of physical unclonable function for better application in the future research work, first, based on the the different PUF implementations available, this paper classified the detailed design, and summed up the main problems. Then based on these categories, this paper proposed a nonformal property description. Next, from the point of view of cryptographic applications, this paper summarized the PUF application. Finally, this paper pointed out a few meaningful PUF future research directions.
    Fast calculation of number of binary signed digit representations of an integer
    LI Zhong PENG Dai-yuan
    2012, 32(11):  3121-3124.  DOI: 10.3724/SP.J.1087.2012.03121
    Abstract ( )   PDF (453KB) ( )  
    References | Related Articles | Metrics
    Binary Signed Digit (BSD) representation of an integer is widely used in computer arithmetic, cryptography and digital signal processing. An integer of length n bits can have several BSD representations. In this paper, the authors studied the properties of the number of BSD representation of an integer, and presented two improved nonrecursion algorithms. They can rapidly calculate the exact number of BSD representations of an integer of a certain length, and the storage requirements get reduced.
    Reversible data hiding based on predictionerror and histogram pairs
    ZHANG XIao-jie TONG Xue-feng XUAN Guo-rong YANG Zhi-qiang SHI Yun-qing
    2012, 32(11):  3125-3128.  DOI: 10.3724/SP.J.1087.2012.03125
    Abstract ( )   PDF (653KB) ( )  
    References | Related Articles | Metrics
    Most of the existing image data hiding methods have little payload and the visual effect is usually not good enough. The paper proposed a reversible hiding technique based on predictionerror and histogram pair. The gray value of a pixel was predicted using eight pixels around it in a multigray image. Then the predictionerror could be calculated. The hiding data were embedded into the predictionerror with the technique of histogram pair. An embedded threshold and an undulating threshold were selected during embedding,and adjusting the pair of thresholds achieved the best performance. The experimental results have demonstrated the proposed method obtains good performance both in embedding payload and visual quality.
    Large-capacity dynamic multiple watermarking with tamperable localization based on Sudoku
    ZHANG Li LI Hong-song YAN Xi-lan LIAN De-liang
    2012, 32(11):  3129-3146.  DOI: 10.3724/SP.J.1087.2012.03129
    Abstract ( )   PDF (660KB) ( )  
    References | Related Articles | Metrics
    In this paper the largecapacity dynamic multiple watermarking algorithm based on Sudoku was proposed with two bit/pixel embedding capacity. The original image was divided into M×N pixels nonoverlapping areas. Different watermarks with size of 2 M×N pixels were embedded into the corresponding areas. If the watermarked area was tampered, the watermark in this area could not be extracted correctly. At any time, any watermarks can be embedded into any area as long as the areas are nonoverlapping. The experimental results show that the proposed algorithm has a larger watermarking embedding capacity and higher accuracy of tampered localization.
    Deep packet inspection algorithm based on parallel Bloom filters
    HU Guo-liang LIN Ya-ping WANG Gang
    2012, 32(11):  3132-3135.  DOI: 10.3724/SP.J.1087.2012.03132
    Abstract ( )   PDF (622KB) ( )  
    References | Related Articles | Metrics
    The traditional methods for hardware/softwarebased Deep Packet Inspection (DPI) have intrinsic limitations in practical implementation. To address the shortcomings, this paper presented a DPI algorithm implemented on the multicore platform based on the parallel Bloom filters. Firstly, the algorithm grouped the rule sets according to their lengths and constructed a set of counting Bloom filters to represent the grouped rule sets. Each Bloom filter stood for a rule set with a specific length. Secondly, efficient hash functions were introduced to reduce the collision probability and the computing complexity. Lastly, the algorithm was implemented using the parallel programming method based on the parallel processing ability of the multicore platform. The theoretic analysis and experimental results show that the proposed algorithm is time and space efficient.
    Network security risk evaluation model based on grey linguistic variables in mobile bank
    SHEN Li-xiang CAO Guo ZHU Yu-guang
    2012, 32(11):  3136-3139.  DOI: 10.3724/SP.J.1087.2012.03136
    Abstract ( )   PDF (554KB) ( )  
    References | Related Articles | Metrics
    A multi-person decision method based on the grey additive linguistic variables weighted aggregation operator is presented to solve the Network Security Risk Evaluation problems in mobile bank, in which the attribute values take the form of the grey additive linguistic variables(GALV). Firstly, some properties are defined, such as the concept and the relational calculation rules of grey additive linguistic variables. Then, some operators will be defined to solve the Network Security Risk Evaluation problems in mobile banking, such as grey additive linguistic weighted aggregation operator, and grey additive linguistic ordered weighted aggregation operator. At last, an example involved in mobile bank shows the effectiveness of this method.
    New certificateless threshold proxy blind signature scheme
    WANG Zhen LIU Pei-yu LI Feng-yin
    2012, 32(11):  3140-3142.  DOI: 10.3724/SP.J.1087.2012.03140
    Abstract ( )   PDF (452KB) ( )  
    References | Related Articles | Metrics
    Proxy blind signatures with extended properties are being thought highly of and widely researched in recent years, because they have both the features of proxy signatures and blind signatures. In traditional proxy blind signature, proxy signer’s authority is too big and it will change the original signer’s will. The new scheme introduced threshold signature technology, which based on secret share thoughts, and constructed threshold proxy blind signature with certificateless cryptography. The scheme implementation process with detailed analysis showed that this scheme is easy to realize, and verified its security under the random oracle machine. It can be a good application in electronic voting and e-government affairs where user’s privacy should be protected.
    Verifiable Rational Secret Sharing Scheme Based on Chinese Remainder Theorem
    ZHANG Li-yuan ZHANG Li-yuan
    2012, 32(11):  3143-3146.  DOI: 3724/SP.J.1087.2012.03143
    Abstract ( )   PDF (618KB) ( )  
    References | Related Articles | Metrics
    To address the problem that participant can not be added or deleted dynamically in rational secret sharing scheme so far, this paper proposed a dynamic rational secret sharing scheme which combined game theory with cryptography. The scheme based on Chinese remainder theorem, can add or delete the participant dynamically in the secret reconstruction phase. And it is verifiable by using the verifiable random function, and the cheat of participants cannot work. The participants did not know whether the current round was a testing round. And the gain of following the protocol was more than the gain of deviating, so rational player had an incentive to abide the protocol. Finally, every player could obtain the secret fairly. In addition, the scheme satisfied resilient equilibrium and could withstand the conspiracy attack.
    Improved two-party authenticated key agreement protocol
    ZHANG Long-xiang
    2012, 32(11):  3147-3152.  DOI: 10.3724/SP.J.1087.2012.03147
    Abstract ( )   PDF (474KB) ( )  
    References | Related Articles | Metrics
    Twoparty authenticated key agreement is one of the methods to generate session keys. In this paper, the authors analyzed a new provably secure twoparty authenticated key agreement protocol proposed in 2011 by Jianjie Zhao et al. and pointed out that this protocol was not secure if the adversary can obtain the longterm key of a participant. Then an improved protocol was presented, and in the new scheme, the parameters that may leak the longterm keys were encrypted. The authors also discussed the security and computational cost of the new scheme. The result shows that the new protocol realizes the secure key agreement with lower computational cost.
    Immersive display system based on single projector and cylindrical reflector
    YIN Xiao-qing LI Jing XIONG Zhi-hui WANG Wei ZHANG Mao-jun
    2012, 32(11):  3149-3152.  DOI: 10.3724/SP.J.1087.2012.03149
    Abstract ( )   PDF (625KB) ( )  
    References | Related Articles | Metrics
    Through analyzing the advantages and disadvantages of traditional immersive display systems, a new immersive display system was designed and implemented. In this system, the light illuminated by one projector was reflected by a cylindrical reflector to a cambered rear projection screen. Seamless projection picture can be obtained and coherent displaying of wideangle virtual scene could be implemented. By properly designing the surface of cylindrical reflector, it implemented uniform enlargement of the image on the horizontal direction. The distortion of the projection picture caused by the curvature of the screen could be basically removed through prior distortion of projected image and participants could acquire more moving freedom by means of rear projection. This system overcame the problem of image mosaics in traditional multiprojector and multidisplay immersive display systems. It is simple for manufacturing and can achieve satisfying immersive display quality, which is verified by the experimental result.
    Color image enhancement based on improved intersecting cortical model
    PU Tian LI Ying-hua CHENG Jian ZHENG Hu
    2012, 32(11):  3153-3156.  DOI: 10.3724/SP.J.1087.2012.03153
    Abstract ( )   PDF (686KB) ( )  
    References | Related Articles | Metrics
    To meet the physiological perception of human eyes, a color image enhancement algorithm based on improved Intersecting Cortical Model (ICM) was proposed. The internal activities and dynamic threshold were improved to nonlinear attenuation, which satisfied the nonlinear perception of human eyes. And the decay factor was replaced by the step factor, while maintaining some of the significant features of the original model. It applied the Threshold Versus Intensity (TVI) function of the human visual system on the intensity component of the input image to adjust the dynamic range compression. At the same time, it also adjusted the saturation component of the input image by nonlinearity. Compared to the original ICM, this algorithm reduced the complexity and improved the adaptability. The experimental results confirm that the method can obtain clear and bright results.
    Improvement of the adversarial optimization approach for outlier removal in image matching
    XUE Zhen-hua WANG Ping ZHANG Chu-han CAI Si-jia
    2012, 32(11):  3157-3160.  DOI: 10.3724/SP.J.1087.2012.03157
    Abstract ( )   PDF (638KB) ( )  
    References | Related Articles | Metrics
    Applying the adversarial optimization approach to remove the error matches in image matching usually causes the removal of correct matches,especially when multiple iterations are run.Concerning this drawback,a limit was put on the number of iterations,and a subsequent processing was added,which reestimated the homography matrix using a Random Sample Consensus (RANSAC)like method.The experiments show that the improved method can preserve almost all the correct matches with smaller root mean square error.And in the aspect of computing speed,the time the improved method needs is less than half the time the original method needs.
    Image matching method by using Hausdorff distance based on vector length
    ZHANG Wei CHEN He-ping YANG Ling-xian
    2012, 32(11):  3161-3167.  DOI: 10.3724/SP.J.1087.2012.03161
    Abstract ( )   PDF (562KB) ( )  
    References | Related Articles | Metrics
    Hausdorff distance is sensitive to acnodes when using it as the measure to describe the similarity of two point sets. Therefore, a new image matching method based on Hausdorff distance of vector length was proposed. Considering the mutual correlation of pixels in the image, one pixel was connected to the others in one image, a set of vector lengths was composed, and then each pixel corresponded to one vector length set. Then, the modified Hausdorff distance between the vector length set corresponding with each pixel in template image and matching image was computed out. At last, quantified image matching results were obtained. The experiment shows that, the efficiency of the new method to deal with image matching problems in random noisy situations is so remarkable.
    Resolving intersection, union and difference of two simple polygons based on minimum circle
    ZHAO Jun LIU Rong-zhen
    2012, 32(11):  3164-3167.  DOI: 10.3724/SP.J.1087.2012.03164
    Abstract ( )   PDF (611KB) ( )  
    References | Related Articles | Metrics
    A new algorithm for Boolean operation of two simple polygons based on minimum circle was presented. Polygon P and Q were initialized to counterclockwise direction, and the edges connecting to each intersection point of P and Q were arranged in sequential order. Then, all minimum circles were found using the minimum turning angle rule. These minimum circles were classified according to edges direction in P and Q. Intersection, union, and difference of the two polygons are corresponding to different kinds of minimum circles. The algorithm run in time O((n+m+k)logd) in a worst presented case, where n and m were the vertex numbers of the two polygons respectively, k was the numbers of intersection points, and d was the number of polygon’s monotonic chain. The algorithm has explicit geometric significance, and well resolves the problems in special cases,such as overlapped edges, and operation edges intersection at the vertex of edges.
    Seam-line removal method based on correctionratio of average value
    ZHENG Yue CHENG Hong SUN Wen-bang
    2012, 32(11):  3168-3170.  DOI: 10.3724/SP.J.1087.2012.03168
    Abstract ( )   PDF (497KB) ( )  
    References | Related Articles | Metrics
    It has been widely used in computer vision, military investigation, medical care and some other fields. The widely used seamline removal methods include overlappingimage method, wavelet transform method and hardcorrection method. An improved method based on the correctionratio of average gray value of the images on the two sides of the seamline was proposed. This method calculated the rate of the corrected value and the former value. Then the ratio gradually changed from the seamline to the boundary so that the seamline was removed. The experiments have shown that the method proposed above is effective to eliminate seamlines, especially when the difference of the gray level is big.
    Method of blind image forensics based on Lambert-Phong model
    DU Hong-ye YAO Wang-shu
    2012, 32(11):  3171-3173.  DOI: 10.3724/SP.J.1087.2012.03171
    Abstract ( )   PDF (442KB) ( )  
    References | Related Articles | Metrics
    Since the illumination model used in existing methods of blind image forensics could not effectively represent surface lighting effects, Lambert-Phong illumination model was proposed which contained the diffusing and specular reflection of light. Leveraging this illumination model on the tampering detection of infinite light source image, the experimental results show that the illumination direction of different objects in images could be calculated accurately using the proposed illumination model, and the image tampering could be effectively identified.
    Moving object tracking with related multi-regions based on Kalman filter
    WNAG Wei GUO Yu YU Xin
    2012, 32(11):  3174-3177.  DOI: 10.3724/SP.J.1087.2012.03174
    Abstract ( )   PDF (665KB) ( )  
    References | Related Articles | Metrics
    A moving object tracking algorithm with related multi-regions based on Kalman filter was proposed to solve the occlusion and tracking excursion. Through locating multiple regions on the target and constructing undirected graphs, the algorithm calculated the predicted position of the center of each region by using Kalman filter firstly. Then by combining gray histogram match with positional relations of adjacent regions, it calculated the observation center of each region. At last, it realized tracking by revising the observation centers using Kalman filter. The experimental results of human tracking of two regions show that the proposed algorithm has better robustness and real-time performance than the result of tracking each region using Mean Shift algorithm under the occlusion or similar targets and backgrounds.
    Online multiple instance boost random ferns for visual tracking
    HUANG Ye-jue ZHENG He-rong
    2012, 32(11):  3178-3184.  DOI: 10.3724/SP.J.1087.2012.03178
    Abstract ( )   PDF (893KB) ( )  
    References | Related Articles | Metrics
    In order to implement efficient and robust object tracking under the circumstances of variant lighting, changing shape and complicated background, an object tracking algorithm based on online multiple instance boost random ferns was proposed, which used Infinite Impulse Response (IIR) filter to implement online incremental learning for random ferns, the pool of online random fern classifier was constructed, and the random ferns were updated and selected by online multiple instance boosting to generate classifier of online multiple instance boost random ferns. The object was located by classifying samples of object candidate region using the classifier, and positive and negative sets were constructed to online update the classifier. The experiment shows that the proposed method has a good target tracking stability under the complex environment.
    New edge preserving enlargement algorithm for images
    YUAN Ye TIAN Zhong-xu
    2012, 32(11):  3182-3184.  DOI: 10.3724/SP.J.1087.2012.03182
    Abstract ( )   PDF (450KB) ( )  
    References | Related Articles | Metrics
    In order to meet the need of low-cost digital video processing chip,the paper presented a new edge preserving enlargement algorithm using two line buffers.First, a representation point was found to present interpolation point. Next, relevant direction of the representation point was found. Then, four points of this direction and new position relationship were calculated. Last, interpolation algorithm was used. The experimental results demonstrate that the algorithm can not only preserve the edge effectively,but also remove the edge blur. It can be used in the low-cost chip of digital video processing.
    Fast browser and index for large volume surveillance video
    ZHOU Yu-bin
    2012, 32(11):  3185-3197.  DOI: 10.3724/SP.J.1087.2012.03185
    Abstract ( )   PDF (882KB) ( )  
    References | Related Articles | Metrics
    In order to review all the interested contents from large volume recorded surveillance videos in very short time, a video digest method based on target indexing was presented in the paper. On the basis of optical flow analysis, the background got updated in the still region and the moving object image got segmented from the moving area. Accelerated motion model constrained the candidate points for corresponding feature tracking. Successful establishment of trajectory became the basic reference to cluster the whole objects into several classes. All the objects parameters such as size, velocity, and color were saved in XML format as the indexes. Finally, the living digest video was reproduced by mosaicking the selected objects images on the background frame by frame in the same order as original. Since the method removes all the spatial and temporal redundancy, a much shorter living video could browse all useful information of a long surveillance one.
    3D face reconstruction and recognition based on feature division
    LU Le ZHOU Da-ke HU Yang-ming
    2012, 32(11):  3189-3192.  DOI: 10.3724/SP.J.1087.2012.03189
    Abstract ( )   PDF (702KB) ( )  
    References | Related Articles | Metrics
    The traditional algorithm of 3D face reconstruction is inefficient and it is difficult to meet the requirements of practical application. To address this problem, a feature-slice-based 3D face reconstruction algorithm was proposed. Besides, the feature-slice-based weighed 3D face recognition was proposed on the basis of the reconstruction algorithm. First, a 2D template-based alignment algorithm was developed to process the correspondence between faces automatically, and a linear facial model was built up. Second, an improved Active Shape Model (ASM) algorithm was proposed to locate the feature points and slices in the 3D and 2D face images. Then, every facial feature slices shape was reconstructed by a PCA-based sparse morphable mode. Finally, the algorithm was applied to 3D face recognition. The experimental results show that the presented algorithm has higher efficiency and accuracy, and improves the 3D face recognition rate.
    New design of finger-vein identification algorithm against image rotation
    TANG Lu PENG Shuang-ping
    2012, 32(11):  3193-3197.  DOI: 10.3724/SP.J.1087.2012.03193
    Abstract ( )   PDF (784KB) ( )  
    References | Related Articles | Metrics
    In order to overcome the impacts of image rotation on the accuracy of the finger-vein identification system, in the image pre-processing module, a new rotation approach based on the fingertip position to correct the target region was presented in this paper. The other part of the proposed system consists of an improved feature extraction module using direction templates and local dynamic threshold segmentation and a classification module using a Modified Hausdorff Distance (MHD). The experimental results show that it achieves a high recognition rate of 97.25%, and the Equal Error Rate (EER) is 0.75% when the drift angle among the images of the same finger is less than 20 degrees. What is more, the whole process took only 161.6949ms in VC〖KG-*3〗+〖KG-*3〗+6.0, which meant that the system had a superior real-time performance. The proposed system also has certain practical significance for developing finger-vein identification products.
    Character segmentation method of check under complex background
    YE Long-huan WANG Jun-Feng GAO Lin YUAN Jun
    2012, 32(11):  3198-3205.  DOI: 10.3724/SP.J.1087.2012.03198
    Abstract ( )   PDF (686KB) ( )  
    References | Related Articles | Metrics
    Complex background including shading, seal and some images has a bad effect on character recognition of check. Thus, in this paper, an effective method that extracts the significant texture characteristics of character from the image by fast lifting wavelet transform was proposed to solve this problem. A coarse-to-fine searching strategy was adopted to distinguish the characters from background at the level of block of pixels and single pixel. First, Support Vector Machine (SVM) was used to classify blocks according to texture characteristics, and during this process text region could be located. Then character segmentation was achieved by using K-means algorithm for clustering the pixels at the text region. The experimental results show the high accuracy and strong robustness of the proposed method at the situation of strong interference of complex texture and seal.
    Improved clonal selection algorithm for multi-class data classification
    ZHENG Xian-hua LUO Yan-min
    2012, 32(11):  3201-3205.  DOI: 10.3724/SP.J.1087.2012.03201
    Abstract ( )   PDF (829KB) ( )  
    References | Related Articles | Metrics
    The traditional Clonal Selection Algorithm (CSA) can only provide supervised learning for a certain type of sample data, which may result in lower classification efficiency and accuracy, thus a multi-class supervised classification algorithms based on CSA was proposed. This algorithm can obtain optimal clustering center of the multi-class sample data at the same time. The appropriate value of antibodies consider both the same class similarities and the different class differences, thus the best cluster center is more representative. Classification experiments used UCI data and mangrove multispectral TM images, and obtained the overall classification accuracy of 92% and Kappa coefficient of 0.91. UCI data also got a good result. The results show that the algorithm is an effective classification algorithm.
    Quick Identification of Data Matrix Two-dimensional Bar Code Based on chain Code Tracking
    2012, 32(11):  3206-3209.  DOI: 10.3724/SP.J.1087.2012.03206
    Abstract ( )   PDF (619KB) ( )  
    References | Related Articles | Metrics
    A two-dimensional bar code recognition method based on chain code tracking and straight line segment extraction was proposed in order to realize quick identification of the Data Matrix two-dimensional bar code in the industrial field. Firstly, the Sobel operator was used to extract the edge of image. Secondly, the image edge points were tracked and chain codes were recorded based on chain code tracking method. Thirdly, line segment whose straight line similarity was below the threshold was removed with fast straight line segment extraction method. The fracture line was combined with the linear connection method and the unreliable line was excluded by length discrimination. Finally, the Data Matrix bar code was located with the characteristics of the Data Matrix two-dimensional bar code. The application test shows that the two-dimensional bar code area can be quickly and accurately located by the recognition method with the recognition rate of 99.39%. The proposed method is ready to meet the requirements of industrial field with strong real-time ability and high reliability.
    2D bar code recognition marking in metal parts
    WANG Cui-yan ZHANG Jian-chao
    2012, 32(11):  3210-3213.  DOI: 10.3724/SP.J.1087.2012.03210
    Abstract ( )   PDF (732KB) ( )  
    References | Related Articles | Metrics
    Direct Part Marking (DPM) technology is an important means to achieve product identification, and 2D bar code technology is one of the keys. DPM logo of this paper made metal as a background and marked 2D with a laser above it. Compared to image recognition in 2D bar code based on print background, the image recognition in 2D bar code based on metal background is more complex. This paper improved the traditional identification methods, integrated use of the largest connected components extraction, the improved Hough transform, the code division based on maximum degree of matching and the gray image based on non-destructive method of information extraction to achieve the rough positioning, precise positioning, calibration, bar code segmentation and data extraction of the bar code images. The results show that this program has a strong anti-interference for the wear, light pollution, distortion and uneven illumination 2D barcode on the metal. Finally, reliable results were obtained.
    Underwater targets extraction method based on Blob analysis and Bayesian design-making
    SHI Xiao-cheng HAO Li-chao ZHANG Wei WU Di
    2012, 32(11):  3214-3217.  DOI: 10.3724/SP.J.1087.2012.03214
    Abstract ( )   PDF (618KB) ( )  
    References | Related Articles | Metrics
    As it is known that the underwater environment is quite complicated and changeable, as a result, targets and pseudo targets always have a high degree of mixing, and one single segmentation method usually could not abstract ideal target regions. Therefore, this paper proposed a new segmentation method based on Blob analysis and Bayesian design-making. Firstly, the optimistic thresholds were calculated by the improved OTSU algorithm, and then the image was segmented according to this threshold. Through analyzing the connectivity characters, closed contours of regions were achieved. Secondly, the connected regions were described using 7 dimensions of Blob operators and pseudo-target regions were eliminated based on Bayesian decision-making rules. Finally, burrs and disturbances were wiped off through the usage of mathematical morphology operators and ideal target regions were achieved. Through dealing with the images grabbed during the pool experiments using the above method, accuracy and efficiency of the method were verified and the real target regions were acquired.
    Improved anisotropic diffusion ultrasound image denoising method based on logarithmic compression
    YANG Jin LIU Zhi-qin WANG Yao-bin GAO Xiao-ming
    2012, 32(11):  3218-3220.  DOI: 10.3724/SP.J.1087.2012.03218
    Abstract ( )   PDF (479KB) ( )  
    References | Related Articles | Metrics
    Current ultrasound image denoising algorithms cannot maintain edge well while denoising. An improved anisotropic diffusion denoising method called anisotropic diffusion based on Logarithmic Compression (LCAD) was proposed to reduce ultrasound speckle noise after the study of anisotropic diffusion model. The proposed method estimated noise distribution model after logarithmic compression of the image and then generated a diffusion coefficient based on generalized Gamma distribution to achieve denoising purpose while diffusing.
    High-speed automatic train operation optimization algorithm
    LI Yue-zong WANG Peng-ling LIN Xuan WANG Qing-yuan
    2012, 32(11):  3221-3224.  DOI: 10.3724/SP.J.1087.2012.03221
    Abstract ( )   PDF (603KB) ( )  
    References | Related Articles | Metrics
    In order to achieve the high efficiency in automatic train operation, on the basis of the analysis of the train at different stages of operation, taking parking as the key stage, analytic hierarchy process was used to get quantitative description of the importance between each performance indexes and evaluation function of parking controls comprehensive performance in this stage, then the fuzzy manipulation rules of the online control were got. The offline operation of train under the rules was simulated for several times, the different schemes in sub-regional division and start braking point selection were scored to get the parking manipulation scheme which performance indexes are the best. Finally the simulation system was designed based on VC++ platform, and it has verified that the practical effect of the train running under the control algorithm has good parking precision, comfort and time saving.
    Design of portable train general comfort testing system
    DENG Fei CHEN Jian-zheng LI Wen-bao
    2012, 32(11):  3225-3231.  DOI: 10.3724/SP.J.1087.2012.03225
    Abstract ( )   PDF (676KB) ( )  
    References | Related Articles | Metrics
    By investigating the main physical factors that may affect the high-speed Electric Multiple Unit (EMU) generalized comfort, a portable generalized comfort test system was designed, which integrated all the sensors, signal adjusting modules, embedded data detection and computer system into a simulation human model, and this model was capable to test the generalized comfort in real-time without the requirement of car wiring and would not affect the operation of the train. The characteristics and requirements of the test system were analyzed, its components and operating principles were introduced, and the feasibility of this system was verified as well. The results show that the testing system is highly stable and precise.
    3D Simulation of A-SMGCS Surface Movement Based on FlightGear
    TANG Yong HU Ming-hua WU Hong-gang HUANG Zhong-tao XU Zi-li HE Dong-lin
    2012, 32(11):  3228-3231.  DOI: 10.3724/SP.J.1087.2012.03228
    Abstract ( )   PDF (667KB) ( )  
    References | Related Articles | Metrics
    A new method to design a 3D surface movement simulation system for A-SMGCS based on Linux operation system and FilightGear flight simulator was proposed. The simulation system was driven by real-time track data of ADS-B. An airport model was built up according to a real airport prototype by modeling of aircrafts, airport layout, terminal, tower and terrain. Because ADS-B track data had no flight attitude data, an algorithm to extract flight attitude from a space vector, which was connected by two pre and post track points, was proposed. Six degrees of freedom (6-DOF) aircraft movement simulation was realized by importing position and attitude data into FlightGear through its multiplayer interface to drive aircraft models. The simulation results show that, the system can simulate surface movement accurately and realistically. The simulation system is low-cost because it is based on free, open source software.
    Virtual assembly modeling method of disassembly process based on matrix calculation
    GAO Qin-he DENG Gang-feng
    2012, 32(11):  3232-3239.  DOI: 10.3724/SP.J.1087.2012.03232
    Abstract ( )   PDF (613KB) ( )  
    References | Related Articles | Metrics
    There are many defects in the existing assembly modeling method such as large information redundancy or complex modeling process when descripting the disassembly process of virtual maintenance training system. A modeling method for virtual maintenances disassembly process was proposed in the paper based on researching the existing assembly modeling methods and analyzing the different between assembly process and disassembly process. In this method, the matrix was used to describe the assembly model and the matrix calculation was used to describe the partsdisassembly process, so the modeling process was simplified and the models data was reduced. It is a new idea and method for constructing the virtual maintenance training system.
    Dynamic Model of Heavy-Equipment Airdrop and Control Design
    HE Lei SUN Xiu-xia DONG Wen-han LI Da-dong
    2012, 32(11):  3235-3239.  DOI: 10.3724/SP.J.1087.2012.03235
    Abstract ( )   PDF (734KB) ( )  
    References | Related Articles | Metrics
    In view of the difference between present heavy-equipment airdrop mathematical model and the real system, the separation body method was improved. Considering cargo as rigid body, the point by constraint reaction of cargo was modified and the parachute force direction was presented, so a more accurate method of calculating disturbance torque was proposed which covered many influential factors including angle of cabin floor and friction coefficient. Then a more realistic dynamic model of heavy-equipment airdrop was established. The control laws of pitch altitude hold mode and velocity hold mode were designed and their parameters were selected by genetic algorithm. The simulation results indicate that the proposed control scheme can effectively hold flight path and aircraft attitude.
    Simulation of trees’ multi-state based on Perlin noise function and dynamics
    SUN Jing-ping TANG Xiang
    2012, 32(11):  3240-3242.  DOI: 10.3724/SP.J.1087.2012.03240
    Abstract ( )   PDF (485KB) ( )  
    References | Related Articles | Metrics
    In view of the waving motion of trees, a simulation on the broken branches caused by big wind was proposed. After analyzing the motion details using dynamics, the formula of deformation of trees, which was used to interpret character statistics, was obtained. By using Perlin noise function to simulate dynatic wind fields, the simulation of broken branches was realized with different expressions. The experiment result shows that trees move as a whole body conforming to the continuity and consistency of physics until being randomly broken down under wind fields. The method is valid and can be applied in virtual reality to simulate broken branches caused by big wind.
    Trajectory tracking control based on Lyapunov and Terminal sliding mode
    ZHANG Yang-ming LIU Guo-rong LIU Dong-bo LIU Huan
    2012, 32(11):  3243-3246.  DOI: 10.3724/SP.J.1087.2012.03243
    Abstract ( )   PDF (589KB) ( )  
    References | Related Articles | Metrics
    In view of the kinematic model of mobile robot, a tracking controller of global asymptotic stability was proposed. The design of tracking controller was divided into two parts: The first part designed the control law of angular velocity by using global fast terminal sliding mode in order to asymptotically stabilize the tracking error of the heading angle; the second part designed the control law of linear velocity by using the Lyapunov method in order to asymptotically stabilize the tracking error of the planar coordinate. By combining Lyapunov stability theorem and two control laws, the mobile robot can track the desired trajectory in a global asymptotic sense when the angular velocity and the linear velocity satisfy these control laws. The experimental results show that the mobile robot can track desired trajectory effectively. It is helpful for promoting the practical application.
    Track prediction of vessel in controlled waterway based on improved Kalman filter
    ZHAO Shuai-bing TANG Cheng LIANG Shan WANG De-jun
    2012, 32(11):  3247-3250.  DOI: 10.3724/SP.J.1087.2012.03247
    Abstract ( )   PDF (605KB) ( )  
    References | Related Articles | Metrics
    Due to the lack of information of Automatic Identification System (AIS) equipment, the location of a vessel cannot be accurately judged by intelligent supporting command system based on AIS. It is difficult to accurately issue the traffic signal from it. Meanwhile, due to the narrow and winding features in controlled waterway, it is difficult for traditional Kalman filter to accurately predict track of moving vessel. In this situation, the real-time estimation of system noise in Kalman filter algorithm was proposed to increase the accuracy of track prediction of moving vessel. Simulation analysis was carried out on the tracking effect of the traditional Kalman filter and improved Kalman filter. The results indicate that the proposed algorithm can solve the lack in information of AIS equipment, and accurately predict the location of a vessel. The accuracy and the reliability of intelligence supporting command system can be ensured in controlled waterway.
    Vehicle positioning system design for forest fire patrolling and fighting
    FAN Dong-ming YU Jian-guo
    2012, 32(11):  3251-3261.  DOI: 10.3724/SP.J.1087.2012.03251
    Abstract ( )   PDF (732KB) ( )  
    References | Related Articles | Metrics
    This paper studied and designed vehicle satellite positioning system and remote management software system under the consideration of the characteristics of Chinas forest and forest fires which are used in ground patrolling and fighting forest fires. It works with Global Position System (GPS) and mobile Internet technology to collect and return key site information of disaster in real-time and precisely which can be used to generate topographic map marks. By such method, fire prevention headquarters could get detailed and accurate statistics of fire scene. Experiments show that this system can return site coordinates, altitude, temperature and so on in real-time and reliably, and the location maps are marked precisely.
    Application of NSGA-Ⅱalgorithm to emergency task of space service
    Jing-Hua TONG DAI Guang-ming ZHU Huai-jun WU Wei WANG Lei-lei
    2012, 32(11):  3254-3258.  DOI: 10.3724/SP.J.1087.2012.03254
    Abstract ( )   PDF (743KB) ( )  
    References | Related Articles | Metrics
    This paper gave a solution to emergency task in space. When the emergency task occurred, at first, the existing satellite constellation was used to cover the target locations and the coverage rate was computed. If the coverage performance did not meet the mission requirements, the Non-Dominated Sorting Genetic Algorithm Ⅱ (NSGA-Ⅱ) was used to optimize the layout of satellite constellation, i.e. optimizing the anomaly of each satellite in the constellation. Then the phase modulation maneuver was used to achieve constellation optimization results, i.e. maneuvering the satellites to the specified locations, and calculating maneuver time and energy of each satellite. Finally, an emergency task example and its solution process were provided, and the time and energy of the satellite orbit maneuver were calculated.
    Design and implementation of high-speed sampling buffer system based on FPGA
    ZHENG Zheng-bing
    2012, 32(11):  3259-3261.  DOI: 10.3724/SP.J.1087.2012.03259
    Abstract ( )   PDF (516KB) ( )  
    References | Related Articles | Metrics
    An embedded general-purpose hardware structure based on FPGA + DSP was proposed in order to improve the real-time performance of the high-speed data acquisition system. In the structure, a new high speed sampling buffer as the data channel between the high-speed A/D and DSP was designed in FPGA and was used to realize the diversion and deceleration of high-speed data stream. The high-speed sampling buffer was based on the ping-pong operation structure of soft-core dual-clock First In First Out (FIFO) provided by Quartus Ⅱ 9.0. Under the control of the External Memory Interface A (EMIFA) interface of the DSP, it completed write-and-read operations of high-speed A/D data streams. The test results indicate that: in the case of large difference between the value of the read-and-write clock, high speed sampling buffer can save the time of the A/D sampling data to provide sufficient signal processing time for DSP, so the real-time performance of the entire system is improved. high speed sampling buffer can save the time of the A/D sampling data to provide sufficient signal processing time for DSP ,so the real-time performance of the entire system is improved.
    New GPS weak signal high-sensitivity acquisition algorithm
    CHEN Jing-xia LI Jian-wen
    2012, 32(11):  3262-3267.  DOI: 10.3724/SP.J.1087.2012.03262
    Abstract ( )   PDF (893KB) ( )  
    References | Related Articles | Metrics
    The algorithm of weak Global Positioning System (GPS) signal capture was analyzed, and the coherent accumulation and non-coherent accumulation capture algorithms signal model and detecting probability model were built. In order to improve the performance of GPS signal acquisition when strong and weak signals both exist, this paper put forward a method of SPRT (Sequential Probability Ratio Test) to capture the GPS signal. This method with coherent accumulation and non-coherent accumulation capture algorithm in detecting probability and time complexity was compared and simulated. Through theoretical analysis and computer simulation, the SPRT method is proved of high detecting probability. It can effectively reduce the detection time when strong and weak signals both exist, and improve the performance of GPS weak signal acquisition.
    Characterization and classification of EEG attention level
    2012, 32(11):  3268-3270.  DOI: 10.3724/SP.J.1087.2012.03268
    Abstract ( )   PDF (535KB) ( )  
    References | Related Articles | Metrics
    This paper proposed improved fuzzy entropy (FuzzyEn) to calculate attention levels from single channel EEG, on the basis of approximate entropy. EEG attention level signals collected from twelve healthy subjects were characterized by FuzzyEn and other methods, and Support Vector Machine (SVM) was used to classify all EEG attention levels. The experimental results demonstrate that average identification rate of FuzzyEn feature extraction method reaches 76.3%, and the fuzzy entropy method can effectively characterize the complexity of EEG attention level.
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