Table of Content

01 September 2008, Volume 28 Issue 9

Previous Issue    Next Issue

Network and communications

Overlay network-based least-cost scheduling strategies for NCS

2008, 28(9):  2181-2184. 

Asbtract ( )   PDF (893KB) ( )  

Related Articles | Metrics

In this paper, overlay network was introduced into networked control system based on Internet. A Modified Least-Cost Scheduling (MLCS) strategy was discussed, which was fit for Internet Networked Control System （NCS）. MLCS was also optimized. It was illustrated through the simulation system that the proposed scheduling and its optimized strategy can guarantee the network QoS effectively and enhance the performance of NCS.

Improved algorithm of reducing delay in data aggregation

2008, 28(9):  2185-2187. 

Asbtract ( )   PDF (611KB) ( )  

Related Articles | Metrics

Through studying the algorithm FHF of constructing the data aggregation tree, it is found that when the distant nodes are from the sink node transmit data to the sink node, the delay is longer. To reduce the transmission delay of abnormal data, particularly in large data packets occasions, the method of keeping a detection bit in the MAC layer was used to deal with unexpected events. Simulation results show that this method can reduce the delay of abnormal data transmission, and the emergency measures are relatively good.

Research of spectrum resource allocation based on user requirement in cognitive radio network

Jie CHEN Shao-Qian LI Chu-Lin LIAO

2008, 28(9):  2188-2191. 

Asbtract ( )   PDF (916KB) ( )  

Related Articles | Metrics

User requirement is not considered in existing spectrum allocation algorithms for the cognitive radio, which results in excessive allocation of resources to users with less demand. To solve the above problem, two spectrum allocation algorithms, which included spectrum allocation algorithm based on user requirement and joint proportional fairness algorithm, were proposed. They both consider user requirement as the needed factor of spectrum allocation. Numerical results indicate that these two algorithms are better satisfied with users requirement than the previous algorithms.

Adaptive PageRank algorithm search strategy for specific topics

Long-Yuan TAN

2008, 28(9):  2192-2194. 

Asbtract ( )   PDF (503KB) ( )  

Related Articles | Metrics

According to the features of Web links of structural model, a new adaptive PageRank algorithm search strategy for specific topics was proposed. Analysis and simulation results show that the improved algorithm can efficiently save CPU resources, reduce the calculating time, and better resolve the problem of topic-drift.

Load-leveling multi-groups hop count routing

2008, 28(9):  2195-2198. 

Asbtract ( )   PDF (887KB) ( )  

Related Articles | Metrics

Due to random deployment of nodes and unbalanced traffic in wireless sensor networks, the nodes’ load is imbalanced when using Hop Count Routing (HCR). To address this issue, the Load-leveling Multi-groups Hop Count Routing (LMHCR) based on expounding on the property of HCR was proposed in this paper. LMHCR presented can balance the nodes’ load effectively and extend the network’s life span by importing intra-group and inter-group leveling mechanism. The simulation experiment shows that the improved routing mechanism extends the average life span of the network by 80% than the previous.

Framework of reservation and QoS monitoring of resource based on WS-Agreement

2008, 28(9):  2199-2203. 

Asbtract ( )   PDF (989KB) ( )  

Related Articles | Metrics

Up to now, no OGSA or WSRF-compliant grid middleware can support the gird resource management based on QoS negotiation commendably. Therefore, how to design a SLA-implemented framework that can negotiate the resource reservation and support QoS monitoring of the resource on which a job is running becomes the emphasis of research in this paper. Firstly, the XML Schema of resource reservation that can make resource requestor negotiate the agreement about resource reservation with resource provider based on WS-Agreement was defined. Secondly, a set of WS-* and WSRF-compliant Web services that were used to construct a framework of reservation and QoS monitoring of the resource based on WS-Agreement (RMF) were designed and developed. And these Web services were integrated into Globuss resource management model. At last, the general performance of RMF was evaluated impersonally and logically through theory analysis and simulation experiment.

Technology for identifying VoIP traffic based on H.323 protocol

Bi Xia-an

2008, 28(9):  2204-2206. 

Asbtract ( )   PDF (621KB) ( )  

Related Articles | Metrics

The H.323 protocol and the session process based on H.323 were analyzed, the session signature in the communication process produced by VoIP based on H.323 was introduced, the tuples of the communicators were abstracted, and then the whole VoIP traffic was identified. The corresponding scheme for traffic store, search, update and the algorithm for VoIP traffic identification were designed. Experiment indicates that this method can accurately identify the H.323-based VoIP traffic.

Data replication selection algorithm based on prediction in data grid

2008, 28(9):  2207-2209. 

Asbtract ( )   PDF (639KB) ( )  

Related Articles | Metrics

A new replica selection algorithm based on prediction was proposed. After analyzing the factors infecting replica selection, the grey system theory was utilized to help predicting the data response time on the basis of GM(1,1) grey dynamic model. Meanwhile the Markov chain was applied to achieve state transition probability matrix to predict the reliability of replicas in the form of probability by the system state classification. The simulation results show that in the proposed replica selection model, the prediction is valid, helpful to selection decision, and is able to achieve load balance between nodes holding replicas.

Improved dynamic source routing protocol for Ad Hoc network

2008, 28(9):  2210-2212. 

Asbtract ( )   PDF (489KB) ( )  

Related Articles | Metrics

To enhance the performance of Dynamic Source Routing (DSR), release network congestion, balance network power, improve scalability and prolong network existence time, this thesis has introduced modification to the outgoing package structure of RREP and RREQ. A new protocol Improved Dynamic Source Routing (IDSR) has been introduced with new sending delay mechanism, and the performance of this refined IDSR routing protocol has been evaluated by simulation.

Novel OBS simulation platform and its testing results

He-Meng ZHENG Zi-Chun LE Ming-Lei FU

2008, 28(9):  2213-2215. 

Asbtract ( )   PDF (806KB) ( )  

Related Articles | Metrics

In this paper, a novel simulation tool OBSns for Optical Burst Switching (OBS) was built by means of an extension to the network simulator (NS-2). This simulation tool amends the deficiencies of simulation for WDM network based on NS-2, and is easier to set up network parameters including network topology, traffic and bandwidth. The model of an OBS network with 9 nodes was presented, and the simulation processes was described in detail. Finally the test results of end-to-end delay and throughput were shown and discussed.

GM (1,1) model based on adaptive link-level ARQ mechanism for wireless media streaming

Yong JIN

2008, 28(9):  2216-2219. 

Asbtract ( )   PDF (676KB) ( )  

Related Articles | Metrics

In this paper, an adaptive link-level Automatic Repeat reQuest (ARQ) algorithm was proposed for wireless media streaming, in the hope that the media could be played on receivers with high quality. The algorithm, based on cross-layer optimization design, predicts the packet loss rate using the model of GM (1, 1), and adjusts the ARQ parameter Nmax according to the characteristics of the number of frames of a GOP. Besides, an adaptive FEC at the application layer was used to adjust the sending rate of MPEG video frame adaptively and to allocate the network bandwidth resource between the MPEG video source data and the redundant data dynamically. Both the mathematical analysis and NS simulation results demonstrate that the proposed mechanism can significantly improve quality of media streaming, in terms of playable frame rate, reliability and real-time performance on the receiving side.

Efficient bidirectional anonymous routing protocol for wireless Ad Hoc networks

2008, 28(9):  2220-2224. 

Asbtract ( )   PDF (1027KB) ( )  

Related Articles | Metrics

A lightweight anonymous routing protocol was presented, which was based on reactive source routing. It enables complete anonymity of identity, route and topology defined in ASR, using Bloom Filter. The main computationally intensive operation in use is hashing and it does not need to use any public key operation. Without eroding the topology anonymity, it actualizes hop control to avoid the excessive propagation of route requests in order to enhance the efficiency of the network. In addition, the anonymous links established in this protocol are bidirectional, which also helps to reduce the overhead of the anonymous protocols. Detailed analysis and simulation show that the new protocol achieves good anonymity and efficiency.

Enhanced forward error correction algorithm supporting H.264 video transmission in wireless networks

Xi-Mei Gou

2008, 28(9):  2225-2229. 

Asbtract ( )   PDF (881KB) ( )  

Related Articles | Metrics

In order to support H.264 video traffic transmission in wireless networks, an enhanced Forward Error Correction (FEC) algorithm called Enhanced Forward Error Correction （EFEC） was proposed, and the performance of EFEC was analyzed. EFEC will decide whether the forward error correction transmission should be used or not if the sender receives feedback information and the sender would not stop transferring data due to the loss of the feedback information. EFEC would adjust the additional length of data according to the BER of wireless networks. Detailed simulation results prove that according to network status EFEC can adaptively adjust coding strength and redundancy to improve video quality obviously.

Communication traffic forecasting model based on multiple SVM regression functions

2008, 28(9):  2230-2232. 

Asbtract ( )   PDF (740KB) ( )  

Related Articles | Metrics

According to the characteristics of communication traffic, a traffic forecasting model based on multiple Support Vector Machines （SVM） regression functions was proposed. In this model, the traffic data will be divided into two groups by the date, which are the working-day traffic data and the weekend traffic data. Then two different SVM models are trained using those data. The experimental results show that this model is very effective. Moreover, the performance of this model outperforms that of traditional ARMA model.

Information security

Zero watermarking algorithm based on Zernike moments

tina

2008, 28(9):  2233-2235. 

Asbtract ( )   PDF (634KB) ( )  

Related Articles | Metrics

In order to implement the picture copyright protection, this article proposed a zero watermarking algorithm based on the Zernike moments. The rectangular revolves invariability of Zernike moments was used to withdraw picture characteristic point, and quantified it for the binary sequence as the zero watermarking. The other image used the same method to extract its feature and quantify for the binary sequence. Then comparison to zero watermarking was made to proof the copyright. The result indicated this method is very good to solute the contradictory question of robustness and imperceptibility.

Secure and efficient RFID mutual authentication protocol

Chang-she MA Tao WANG

2008, 28(9):  2236-2238. 

Asbtract ( )   PDF (599KB) ( )  

Related Articles | Metrics

Radio Frequency IDentification (RFID) is an automatic technology for identification of objects in the open system environment. The technology currently offers a wide range of application prospects in logistics, manufacturing, retail and many other areas. Thus how to design secure and efficient authentication protocols for RFID systems is a fundamental issue. In this paper, a novel RFID mutual authentication protocol that utilized a keyed hash function and synchronized information was proposed. We described the protocol in detail and discussed the related protocols. The results show our protocol has the advantages in security and efficiency.

Mobile RFID security protocol and its GNY logic analysis

Xinfeng Wang Xu Jiang Shengli Liu

2008, 28(9):  2239-2241. 

Asbtract ( )   PDF (609KB) ( )  

Related Articles | Metrics

Nowadays, Radio Frequency IDentification (RFID) security protocols based on Hash function have poor mobility and cannot satisfy the requirements of some fields. Aiming to boost up the mobility of RFID security protocols, a Mobile RFID Security Protocol was presented and GNY logic was used to prove its correctness. Analysis shows that presented protocol has satisfied mobility and security, and the protocol can be used in transmitting freight and field operation of war time, etc.

Image-adaptive SVD watermarking algorithm based on wavelet perceptual model

2008, 28(9):  2242-2243. 

Asbtract ( )   PDF (598KB) ( )  

Related Articles | Metrics

A SVD blind watermarking algorithm was proposed using a wavelet perceptual model, which was adaptive to the host image features. In order to maximize the intensity of watermark embedding, the quantization steps associated with different image features were determined by the significant wavelet coefficients, and a good tradeoff between the transparency and the robustness of the algorithm was achieved. Experiments show that the proposed algorithm is effective and robust to common image processing operations.

Survey of software vulnerability taxonomies

Yi-Sha LU Qing-Kai ZENG

2008, 28(9):  2244-2248. 

Asbtract ( )   PDF (961KB) ( )  

Related Articles | Metrics

Vulnerability taxonomies with creative features were introduced and analyzed. The uniqueness lied in criteria, classification rules，schemas or perspectives. Essential factors of vulnerability taxonomies were extracted, including purposes, objects, taxonomy principles and criteria. The paper provided comparative analysis based on the factors, and discussed the key issues and probable trends.

Blind digital watermarking method against geometric attack

ZHANG Jie-Yong 张杰勇 LIU Shou-yi YIN Zhong-hai

2008, 28(9):  2249-2251. 

Asbtract ( )   PDF (650KB) ( )  

Related Articles | Metrics

A digital watermarking method to resist geometric attack, mainly the scaling attack and the cropping attack, was presented. We used the method of embedding the watermarking to every block and the method of fixing a resisting scaling grid to be against the scaling attack and the cropping attack. The experiment proves that this method can recover the image, and can detect the watermark, and can effectively resist the scaling and the cropping attack.

ActiveX vulnerability exploiting technique based on Fuzzing

2008, 28(9):  2252-2254. 

Asbtract ( )   PDF (567KB) ( )  

Related Articles | Metrics

Fuzzing is an automated vulnerability exploiting technique. A vulnerability exploiting approach based on Fuzzing and the technical details of ActiveX was proposed. A fuzzer was designed, and effective implementation of data generation was advanced. By testing some third-part softwares ActiveX controls, one unreleased and two known vulnerabilities were discovered and the efficiency of the ActiveX fuzz was improved.

D-S theory-based intrusion detection system

2008, 28(9):  2255-2258. 

Asbtract ( )   PDF (767KB) ( )  

Related Articles | Metrics

It is hard for single security measure to attain favourable detection result. Therefore, how to combine multiplicate security measures to provide the network system with more effective protection becomes one of the hot spots in current research. A data fusion based intrusion detection system was proposed in this paper. Multiplicate detection measures were "fused" in this system to solve the problem that single measures can not obtain good result for all intrusions, and the system has better scalabilities and robustness.

Trust model with high cooperative cheating resistance

ZHANG Gong

2008, 28(9):  2259-2262. 

Asbtract ( )   PDF (1004KB) ( )  

Related Articles | Metrics

Due to the anonymous and open nature of the overlay network and peers’ uncertain behaviors, those overlay-based applications have to face the impact brought in by malicious peers and free riders. A trust model should be introduced to protect the overlay. A global trust model, RGVTrust, based on recommendation and trust voting, to model the trustworthiness of all peers and distinguish peers with different behaviors was proposed. As the computer simulation shows, RGVTrust converges quickly and shows good performance on providing successful service, and has high cooperative cheating resistance.

Graphics and image processing

Design of image group code based on chaotic systems

2008, 28(9):  2263-2266. 

Asbtract ( )   PDF (962KB) ( )  

Related Articles | Metrics

Chaotic capability will decline after digitalizing chaotic system. Aiming at this question, a chaotic random number generator based on Logistic mapping was presented in this paper, Piecewise Linear Chaotic Mapping (PLCM) and shift mapping defined on (0,1). Through the iterations of different chaotic systems, the generating random sequence was confirmed by four trajectories. Therefore, it has better random characteristic and longer cycle under finite precision. A group image encryption algorithm based on this chaotic random number generator is also presented. This algorithm has stronger robustness. The restore effect is also well while the encryption image is partly damaged or deleted. This algorithm has more control parameters and a large space of keys. It is sensitive to key and it has excellent performance against attacks.

Method of lossless removing to area and high-frequency noise in image

王萍 程晓丽 董晓凯 贾惠珍

2008, 28(9):  2267-2269. 

Asbtract ( )   PDF (1046KB) ( )  

Related Articles | Metrics

By statistically analyzing a large number of historical samples and with the help of meteorological knowledge and experience, the change frequency of pixel value was designed first. Then a classificatory characteristic and its threshold that was sensitive to the stochastic and skip noise were extracted. And another characteristic to make the non-noise objects that were circled into the noise class by the first one was found. In the end the two characteristics were used jointly to filter stochastic and skip noise without losing valid information. The validity and dependability of the method and arithmetic have been validated.

Line interpolation algorithm based on diagonal run-length

2008, 28(9):  2270-2273. 

Asbtract ( )   PDF (724KB) ( )  

Related Articles | Metrics

The efficiency of previous line interpolation algorithms based on horizontal run-length is greatly reduced when the slope of line is greater than 1/2. A new algorithm based on diagonal run-length was presented by treating the successive pixels on a same diagonal direction as a whole. Based on a careful analysis of the line segments properties, the algorithm can generate the whole line without error discriminating when line meets a special condition; to other lines, the diagonal run-length can be determined by only one addition and a zero judgment so that the efficiency of line interpolation algorithm is improved.

Background updating algorithm based on classification in complex scene

Wei Li

2008, 28(9):  2274-2277. 

Asbtract ( )   PDF (983KB) ( )  

Related Articles | Metrics

In view of the faults of traditional method, a new background updating method based on classification was proposed. A growth template that can detect the target and noise pixel was put forward. This template can choose the growth direction automatically according to the characteristics around the pixel, the template can eliminate the errors that were accumulated by the noise; background updating was implemented when many targets appeared. Comparison between the proposed method and the conventional way was made, the results of which show that the proposed method will stabilize within a very short time when quick changes happen in the scene such as the movement of the camera. This system is flexible enough to handle variations in moving objects and other arbitrary changes to the observed scene.

Auxiliary contour algorithm for 3D reconstruction of medical slice images

2008, 28(9):  2278-2280. 

Asbtract ( )   PDF (1138KB) ( )  

Related Articles | Metrics

An improved 3D reconstruction algorithm of multiple contours was presented in the paper in view of contour bifurcation in the process of contour reconstruction. By constructing auxiliary contours, the connection of multiple contours was converted to single contour and the defection of using multiple contours to 3D reconstruction was improved. The three keratinization of characteristic point using the acceptable surface was implemented, the rough surface in the process of reconstruction according to the curvatures change was fitted, and 3D reconstruction of medical slice images was realized. The experimental results show that the proposed algorithm can shorten the time of volume data structure, ensure the correction of reconstruction objects and accelerate the speed of the whole surface reconstruction at the same time.

Blind image deconvolution based on Gibbs distribution

Rui-Hua Liu

2008, 28(9):  2281-2284. 

Asbtract ( )   PDF (881KB) ( )  

Related Articles | Metrics

A weighted total variation algorithm was proposed for solving some blind deconvolution problems, and then we got the existence of energy functional minimum and educed corresponding thermal flow. In computer simulations, the algorithm performs well even when we have no more accurate prior knowledge about point spread function and the original true image, besides some other constrains. Experiments show that the proposed algorithm is more effective and performs better than the total variation blind deconvolution method proposed.

Real-time unrolling catadioptric omni-directional images on DSP

Gang CHENG Zhi-hui XIONG Li-dong CHEN Bin WANG Mao-jun ZHANG

2008, 28(9):  2285-2287. 

Asbtract ( )   PDF (861KB) ( )  

Related Articles | Metrics

Lookup-table method is usually used to improve the speed of panorama unrolling to avoid time-consuming calculation, but it strongly requires space for storage. Therefore, a method called block prefetch was put forward. In order to lower the accessing cost and fastern the lookup-table unrolling, a target image can be divided with its corresponding lookup-table and source image into blocks, and then it can be unrolled in DSPs on-chip memory by the prefetched blocks. Experiments indicate that the method makes the unrolling achieve a level of 97 frames per second, when dealing with 1024×768 source image to 1152×256 target image. It is 20 times faster than a lookup-table panorama unrolling without block prefetch.

Application of clustering and improved C-V evolution equation in medical image segmentation

Guo-can Feng

2008, 28(9):  2288-2291. 

Asbtract ( )   PDF (1050KB) ( )  

Related Articles | Metrics

A class of improved C-V evolution equation based on classical C-V model was proposed in this paper. It integrated with k-means clustering to segment pathological tissue of Brain CT and MRI, and satisfactory results were obtained. Specially, experimental result of a synthetic image shows that the proposed method is more accurate and robust than some traditional evolution equations.

Image Retrieval based on Spatail Feature

2008, 28(9):  2292-2296. 

Asbtract ( )   PDF (1216KB) ( )  

Related Articles | Metrics

A novel image feature descriptor SCH based on spatial feature was proposed. It used MCVAE algorithm based on the color vector angle and Euclid distance to detect original color image edge, and a new "greatest and smallest component color invariant model" to realize the original image quantization. Furthermore, for the edge pixels, the distribution of the color pairs at an edge was extracted by edge correlation matrix. Meanwhile, for the non-edge pixels, the local color distribution of pixels was extracted by color histogram. Then, a new sin similarity metric was used to measure the similarity between the image features. Finally a content-based image retrieval prototype system called "SttImageRetrieval" was developed with VC, with establishment of a comprehensive database of images called "IMAGEDB" using Oracle 9i database. Experimental results show that our algorithm outperforms the methods of color statistical feature for image indexing and retrieval.

Noise image compressed coding based on edge detection

Ying-Hua TIAN Jing-Song YANG Yue TAO

2008, 28(9):  2297-2299. 

Asbtract ( )   PDF (970KB) ( )  

Related Articles | Metrics

Edge blurring phenomenon, which occurs in the wavelet-based image compression algorithms under noised image or low bit rates, remains an open question for many years. Therefore, this paper presented a method of noise image compression and coding based on edge detection. Firstly, the image was wavelet edge detected, the detected wavelet coefficients were protected, and then the noise was removed by soft-threshold method, and at last we compressed and coded it by using Set Partitioning in Hierarchical Trees (SPIHT) method. The experimental result shows that this method not only achieve high compression ratio, remove noise well but also solve edge blurring problem better.

Reconstruction of compressive sensing and semi-QR factorization

Ying-Hua FU

2008, 28(9):  2300-2302. 

Asbtract ( )   PDF (593KB) ( )  

Related Articles | Metrics

In this paper, the signal reconstruction algorithms of Compressive Sensing (CS) were discussed and a new method to enhance the efficiency was found, and the quality of recovered images was improved: proximate QR factorization of measurement matrix. The exact reconstruction of minimum l0 norm is NP-complete problem. Minimum l1 norm reconstruction can approximate compressible vectors with high probability. In the study, the quality of solutions of l1 optimization can be enhanced further by changing the singular values of the measurement matrix with QR factorization. We illustrated the effectiveness of QR factorization of the measurement matrix and gave a comparison of the Gaussian random matrix and its QR factorization.

Shared-memory parallel multi-target tracking

Xiao-gang WANG Xiao-juan WU Xin ZHOU Xiao-yan ZHANG

2008, 28(9):  2303-2305. 

Asbtract ( )   PDF (663KB) ( )  

Related Articles | Metrics

The application of particle filtering in real video-based multi-target tracking systems is limited because of its high computational complexity. To overcome the efficiency bottleneck, a coarse-grained parallel multi-target tracking implementation based on the OpenMP-specified shared-memory parallel programming model was explored. A list of tracked targets was maintained in a shared variable, and each target was tracked by an independent particle filter. The number of threads and the number of targets tracked by each thread were determined by the number of processing units. Compared to its corresponding optimized sequential version, the parallel implementation, which increases the number of targets in real-time tracking from 2 to 8, is of much more practical value.

Particle swarm optimization for image minimum error thresholding

2008, 28(9):  2306-2308. 

Asbtract ( )   PDF (921KB) ( )  

Related Articles | Metrics

A scheme for image minimum error thresholding based on Particle Swarm Optimization (PSO) was proposed in this paper. Minimum error thresholding is a popular technique for image segmentation, and our scheme applies PSO algorithm to image minimum error thresholding. This scheme solves the problem of large calculation burden of the regular minimum error thresholding method. The results we obtained demonstrate that our scheme can efficiently reduce calculation burden of the regular method and achieve better performance on convergence and robustness, compared with Genetic Arithmetic (GA).

Multi-resolution image segmentation based on Normalized Cut

2008, 28(9):  2309-2311. 

Asbtract ( )   PDF (681KB) ( )  

Related Articles | Metrics

A new image segmentation method was proposed in this paper． Firstly, the higher level information was extracted from the small image in the low resolution space by use of the Normalized Cut． Then, the higher level information was taken back to the high resolution space effectively to do further smoothing. The global segmentation of the image was achieved in the experiments. This method can simplify the computation of the Normalized Cut greatly while using the global segmentation property of the Normalized Cut.

Extraction of minutiae and significant feature from fingerprint image

2008, 28(9):  2312-2314. 

Asbtract ( )   PDF (685KB) ( )  

Related Articles | Metrics

An improved algorithm for minutiae extraction was brought out. First, the set of original minutiae was directly extracted from thinned fingerprint images. Second, various noises in fingerprint images and their properties were analyzed and distributing regulation of pseudo minutiae was generalized. Last, combining with the information of local ridge direction, special algorithms were designed with respect to various noises to delete pseudo minutiae from original minutiae set. The remainders of original minutiae were viewed as intrinsic minutiae. According to the characteristics of fingerprint image, a new algorithm to extract the significant features was presented, by constructing three types of line feature in the complete image, and the line feature can be extracted out successfully from the sets of minutiae.

Algorithm of image inpainting based on texture orientation

2008, 28(9):  2315-2317. 

Asbtract ( )   PDF (846KB) ( )  

Related Articles | Metrics

The method was introduced to compute the main direction of the texture and complete the image by limiting the search to one direction to carry out image completion based on Exemplar-Based image completion. The method computed the main direction of the texture and improved the template window's priority and size based on Criminisi A's algorithm. A number of examples were given to demonstrate the effectiveness of the proposed algorithm on dealing with the image with strong orientation of texture distribution and raising efficiency obviously.

Database Technology

Association rules mining method from XML based on Ontology

2008, 28(9):  2318-2320. 

Asbtract ( )   PDF (635KB) ( )  

Related Articles | Metrics

Due to the fact that the traditional data mining technology can not be directly applied to the semi-structured XML data mining, Ontology-based XML mining association rules mining method was put forward in this paper. In this method by introducing domain ontology and Hash technology, the operation of frequent item sets and generating association rules has been improved, and at the same time it is easy to transform the operation of the database into memory tree based on XML, and at last through theoretical and experimental analysis it has been verified the mining effects of the method, so the advantages of the method are shown.

Information retrieval method based on data fusion and relevance feedback

2008, 28(9):  2321-2323. 

Asbtract ( )   PDF (817KB) ( )  

Related Articles | Metrics

Data fusion and relevance feedback based query expansion are two effective methods for information retrieval optimizing. While data fusion improves retrieval performance by merging multiple retrieval results, feedback based query expansion revises user query according to previous retrieval result and runs the new query to improve retrieval performance. Based on data fusion and query expansion, The hybrid method, Hybrid Query expansion and Data fusion method （HQD）, for information retrieval optimizing was proposed. HQD selects top-ranked documents from the relevance feedback result and runs these documents as surrogate queries, then merges the retrieval results using a sum cos measure. HQD method can improve retrieval performance efficiently.

Data modeling and retrieval in semantic grid based on RDF

Xue-Lin SHI

2008, 28(9):  2324-2327. 

Asbtract ( )   PDF (794KB) ( )  

Related Articles | Metrics

The data processed by semantic grid are often semi-structured data. Therefore, how to model and retrieve these semi-structured data is a key issue of semantic Web. The presenting model for semi-structured data base Resource Description Framework （RDF） and its information retrieval mechanism were proposed in this paper. Then a semantic grid infrastructure was described, which implemented knowledge sharing and retrieval in chemical engineering domain based on a chemical computing grid platform.

Document clustering based on concept lattice

Jiang-Hua Li

2008, 28(9):  2328-2330. 

Asbtract ( )   PDF (837KB) ( )  

Related Articles | Metrics

It is still difficult to deal with the dimension catastrophe, the sparse vector, and random selection of initial center in standard K-Means algorithm. A new clustering method based on concept lattice without evaluation function was proposed in this paper. Finally, an experiment was given. The results clearly show the outstanding performance of the proposed method in terms of correctness and efficiency.

New XML document coding scheme based on complete binary tree

ZHNAG Peng FENG Jian-Hua FANG Zhi-Feng

2008, 28(9):  2331-2334. 

Asbtract ( )   PDF (776KB) ( )  

Related Articles | Metrics

In this paper, a new coding scheme was proposed, which was based on the sequence of its complete binary tree. The scheme is easy to realize and only one positive integer is needed to express the position of the node in XML tree. The time-bounding of identifying the ancestor-descendant relationships is only O(log n). It also supports XML document update. In the scheme, the length of the code is short.

Compression algorithm of text files based on LZSS

2008, 28(9):  2335-2337. 

Asbtract ( )   PDF (752KB) ( )  

Related Articles | Metrics

A new algorithm based on LZSS was proposed in this paper. The algorithm creates an effective organized cache to store frequent phrases. It not only decreases the cost time of compression and decompression, but also improves compression performance. It is proved that the new algorithm is better than LZSS in text compression.

Improved kernel-based fuzzy clustering algorithm

Pan Kong DENG Hui-Wen

2008, 28(9):  2338-2340. 

Asbtract ( )   PDF (543KB) ( )  

Related Articles | Metrics

Since the traditional kernel fuzzy clustering algorithm does not take account of the level of contribution the every feature makes toward clustering, and it also has a shortcoming of easy falling into a situation of a local optimum, an improved kernel fuzzy clustering algorithm was put forward. It combined the advantage of the global optimum to construct a simple and effective fitness function that can avoid plunging local optimum. This improved algorithm gave every feature a weighted coefficient, in which the ReliefF algorithm was used to assign the weights for every feature. Compared with the traditional algorithm, this one has made some significant progress, and the experimental result has proved its effectiveness.

Improved FP-Growth algorithm and its applications in the business association

ZHAO Xiao-Min 赵孝敏 HE Song-Hua LI Xian-Peng YIN Bo

2008, 28(9):  2341-2344. 

Asbtract ( )   PDF (1036KB) ( )  

Related Articles | Metrics

The FP-Growth algorithm, based on FP-Tree, needs to create a large number of conditional FP-Trees recursively in the process of mining frequent patterns. It is not efficient and not good to apply in mobile communication business cross-selling, in which the association rules mining is business-constraint. Therefore, an items-constraint frequent pattern tree ICFP-Tree and a new ICFP-Mine algorithm which directly mines in the tree were proposed. Theoretical analysis and experimental results show that the ICFP-Mine algorithm is superior to FP-Growth algorithm in memory occupancy and time costs. It has achieved better results in the field of mobile communication business cross-selling applications.

Algorithm of estimating index sizes of resource collections in distributed search

WU Sheng Xing LI

2008, 28(9):  2345-2348. 

Asbtract ( )   PDF (898KB) ( )  

Related Articles | Metrics

Distributed search is an effective way to search the Deep Web, while collection size is an important feature in collection representation and selection in distributed search. To estimate collection size in uncooperative environments, the two novel algorithms were proposed in this paper. High frequent resample algorithm first samples collections with random queries, then resamples with high frequent queries in the sample set. Heterogeneous capture algorithm, based on the assumption of different capture probabilities among documents, uses Logistic functions and conditional maximum likelihood. Experimental results show that the algorithms outperform both sample-resample and capture-recapture algorithms.

Approach of feature dependency modeling for software product line

DaiZhong LUO WenYun ZHAO

2008, 28(9):  2349-2352. 

Asbtract ( )   PDF (968KB) ( )  

Related Articles | Metrics

Feature dependency modeling describes the model of mutual constraints among features. It is an essential activity for development of software product line. This paper introduced local dependency and global dependency of feature. With analyzing relationship of feature dependency, an approach of feature dependency modeling was proposed. It not only provides specification of local dependency such as decomposition and generalization, but also provides global dependency modeling such as configuration dependency, operational dependency and impact dependency. Finally a case study of feature dependency modeling in air-condition controlling software product line is presented to demonstrate our method.

Research of mining meta-association rules for dynamic association rule based on model of Grey-Markov

Jun LIU

2008, 28(9):  2353-2356. 

Asbtract ( )   PDF (677KB) ( )  

Related Articles | Metrics

A rule called a dynamic association rule was introduced, which contained not only a support value and a confidence value but also a support vector and a confidence vector, and the usual mining process of the meta-association Rules for dynamic association rule by the model of Grey-Markov was introduced. This method applies the Markov theory in the foundation of G(1.1) model, and proved that this method is superior to G(1.1) and other methods in mining the meta-association rules.

Artificial intelligence

Trust model in interdomain of grid

MA Man-Fu

2008, 28(9):  2357-2359. 

Asbtract ( )   PDF (878KB) ( )  

Related Articles | Metrics

The trust relationship in interdomain is restricted by the difference of inner-domain model of Grid. A new grid interdomain trust model which implemented trust value conversion among domains was proposed in this paper, and at same times, the RUR was sent to source system to evaluate new trust value. As to the model requirement, interdomain infrastructure was proposed. Based on the model and trust context, the scheduling algorithm had been described. Finally we performed simulations to compare the performance of scheduling algorithm with that of the inner-domain model. The experiments show that the scheduling algorithm is efficient on task completion time and task fulfilling ratio within multi-domain grid environments.

Time synchronization mechanism in Agent-based distributed simulation

Shou-Yi LIAO Jian CHENG Shi-Cheng WANG

2008, 28(9):  2360-2362. 

Asbtract ( )   PDF (816KB) ( )  

Related Articles | Metrics

The time synchronization mechanism is one of the key problems on Agent-based distributed simulation research. The time synchronization mechanism of Agent-based distributed simulation environment (ADSimE) — conservative mechanism and optimistic mechanism were introduced. That is, the conservative mechanism was used within the node of the platform，while optimistic mechanism was used between the nodes. This kind of time synchronization mechanism could promote the performance of the time advancing in the simulation platform. The principles of the two mechanisms were also introduced. Finally, the key process of the design and running for conservative simulation Agent and optimistic simulation Agent were described in detail.

Forecasting chaotic time series based on improved genetic WNN

2008, 28(9):  2363-2365. 

Asbtract ( )   PDF (629KB) ( )  

Related Articles | Metrics

The chaotic time series forecast using Wavelet Neural Networks (WNN) was researched in this paper. An improved training method for WNN was presented. This method combines the Genetic Arithmetic (GA) and gradient descent BP method, and the BP method was embedded in the GA operation in order to resolve the GA's limitation in detail search capability. In the last step of this method the WNN trained by GA searches the best solution using BP method once again. The experiment on predicting the chaotic time series from Henon map validates the performance of the method in this paper; the experimental result also shows the method could assure the WNN convergence and have high forecasting precision.

Cellular automaton model based on fuzzy control rule

Yong-Gang GONG Tao CHEN

2008, 28(9):  2366-2368. 

Asbtract ( )   PDF (647KB) ( )  

Related Articles | Metrics

A cellular automaton model for one-lane highway traffic was proposed in this paper. Based on the classical NS model, the randomization parameter of a vehicle was calculated according to fuzzy control rules. Some basic qualitative results and the fundamental diagram of our new model were got through computer simulations. Compared with other existing single lane cellular automaton models, the experimental results show that our new model is able to reproduce some of the real macroscopic traffic characteristics such as hysteresis.

Improved SMO algorithm with different error costs

Dong-Dong TIAN

2008, 28(9):  2369-2370. 

Asbtract ( )   PDF (494KB) ( )  

Related Articles | Metrics

When Keerthi's Sequential Minimal Optimization （SMO） algorithm is applied to the classification of unbalanced datasets, it not only leads to a poor classification performance but makes the result unstable. In order to overcome the difficulty, an improved SMO algorithm that used different error costs for different class was presented. Besides, the formula and the steps of the improved SMO algorithm were given. Experimental results show that our algorithm's ability of dealing with unbalanced datasets can be improved and its stability also can be intensified.

Solution of molecule scattering model based on parallel mode

Ren-Dong HUANG

2008, 28(9):  2371-2374. 

Asbtract ( )   PDF (733KB) ( )  

Related Articles | Metrics

The solution of Electron-molecule scattering model based on serial mode meets two challenges: long running time and large memory requirement. Parallel computing which would reduce the workload of one computer is a useful method to meet the challenge. Based on master-slave parallel model structure, several optimized approaches were introduced and the parallel algorithm for Electron-molecule scattering was realized. Results of the experiments obtain satisfied speedup and parallel efficiency, and prove the feasibility and validity of this solution.

Study on virtual machine's live migration

2008, 28(9):  2375-2377. 

Asbtract ( )   PDF (810KB) ( )  

Related Articles | Metrics

Virtual machine technology is a good way to separate software and hardware in the same physical machine, and is beneficial to fault management, dynamic load balancing and online server maintenance. It is especially useful in optimizing the performance of data center and cluster. To compare the performance of stop and copy migration and live migration, as well as to compare the impact of different tasks on live migration, this paper migrated four kinds of virtual machines with different tasks in LAN, using XEN as a virtual machine monitor.

Soft-sensor modeling of quality control based on support vector machine

Xian-Lin JIANG

2008, 28(9):  2382-2385. 

Asbtract ( )   PDF (769KB) ( )  

Related Articles | Metrics

On the basis of studying Support Vector Machine (SVM) theory, a soft-sensor controlling method based on Support Vector Machine wass presented. In order to solve the problem of getting the important parameter that is hard to be measured online and has long time-delay, a soft-sensor controlling method based on support vector machine was presented. In the control process, modeling techniques have been studied intensively, and then RBF kernel function was chosen to establish an exact support vector machine model. On the background of quality control in a company, the online estimate of output value was realized. Under the circumstance of changing and choosing different parameters and through a lot of research and simulation, a relatively better generalization result model was established.

Text categorization based on genetic fuzzy classification and Boosting method

2008, 28(9):  2386-2388. 

Asbtract ( )   PDF (768KB) ( )  

Related Articles | Metrics

A novel method for text categorization, which is based on boosting fuzzy classification, was proposed in the paper. Latent Semantic Index (LSI) was used to select text feature and then Boosting algorithm was proposed to integrate fuzzy classification. In each iteration training of boosting algorithm, the distribution of training instances was adjusted, and classification rules were created by genetic algorithm. The weights of the training instances that were classified correctly by available rules were reduced, so that the new fuzzy rule focuses on the misestimate or uncovered instances. Experimental results show that classifier based on fuzzy classification is effective and efficient.

Off-line Chinese signature recognition system based on neural network

2008, 28(9):  2389-2391. 

Asbtract ( )   PDF (603KB) ( )  

Related Articles | Metrics

This paper tried to combine neural network and signature verification, using the Back Propagation algorithm (BP) of the multi player Neural Network based on matlab neural network box. And a method of feature extraction based on Gabor fliter and Zernike moment was proposed. The experiment shows that the method is more effective and feasible, and recognition rate has been up to 93.70%.

Research of immune particle swarm optimization algorithm based on Gaussian distribution and simulated annealing algorithm

2008, 28(9):  2392-2394. 

Asbtract ( )   PDF (721KB) ( )  

Related Articles | Metrics

The particle swarm optimization algorithm is not only easy to lose diversity and run into local optimization in course of search, but also the speed of search is low. This article presented an immune Particle Swarm Optimization (PSO) algorithm through immune inoculation and immune choice, which recurs to mechanism of GUASS and SA. The common norm function is used to develop simulated and validated work. Comparison of simulated results between Immune Particle Swarm Optimization (IPSO), PSO and DWIPSO shows that IPSO has the advantage of improving the global search ability and decreasing calculated steps.

Intuitionistic fuzzy integer programming based on improved particle swarm optimization

2008, 28(9):  2395-2397. 

Asbtract ( )   PDF (490KB) ( )  

Related Articles | Metrics

A model of intuitionistic fuzzy integer programming based on modified particle swarm optimization was presented in this paper. Firstly, membership and non-membership functions of object and constrain functions were defined. Secondly, intuitionistic fuzzy integer programming model was presented based on intuitionistic fuzzy "min-max" operator. Then, intuitionistic fuzzy integer programming was resolved by improving particle swarm optimization. At last, a typical experiment indicates that the performance of presented algorithm is better than other algorithms.

Typical applications

Service discovery improved model based on QoS

代艳红

2008, 28(9):  2398-2400. 

Asbtract ( )   PDF (759KB) ( )  

Related Articles | Metrics

Based on relevant research, a discovery model of Quality of Service (QoS) was proposed. The model provides a set of dynamic performance testing of services and a negotiator with a counter offer mechanism, in order to filter and sort according to QoS, which can mostly meet customer demand through negotiation. The effectiveness and availability of the discovery system can be enhanced, which is verified through experiments.

Application of particle swarm optimization to continuous location of distribution center

2008, 28(9):  2401-2403. 

Asbtract ( )   PDF (498KB) ( )  

Related Articles | Metrics

The local optimal solution is often got when general algorithm was applied to solve continuous location of distribution center. To solve the problem, Alert Location-Allocation (ALA) algorithm to construct hybrid particle swarm optimization was cited in this paper. The computing result of the algorithm is nearer to the global optimal solution by combining local search of ALA algorithm and global optimization of particle swarm optimization. An example demonstrates that hybrid particle swarm optimization can solve the problem of continuous location of logistics distribution center and provides an effective decision tool for decision-maker.

Scene matching algorithm for SAR images based on SIFT features

2008, 28(9):  2404-2406. 

Asbtract ( )   PDF (819KB) ( )  

Related Articles | Metrics

According to the characteristic of Synthetic Aperture Radar (SAR) images, a new scene matching algorithm for SAR images based on Scale Invariant Feature Transform (SIFT) features was proposed. Firstly, SIFT keypoints of realtime images and reference images were extracted efficiently using improved SIFT feature descriptor. Then ratio of distance and Random Sample Consensus (RANSAC) were performed to guarantee the stability of matching points. Finally, transformation parameters between realtime and reference images were computed by reliable matching points. The experimental results demonstrate that our approach is fast, reliable, efficient and robust.

Multi-access control and multi-format document organizing and retrieving system based on Oracle

Zhi-Hui XIONG De-Xin WANG Wei WANG Mao-Jun ZHANG

2008, 28(9):  2407-2409. 

Asbtract ( )   PDF (579KB) ( )  

Related Articles | Metrics

Fast retrieval and fine granularity access control of massive inhomogeneous documents are key points of document management system towards industry applications. A classification document organizing and retrieval system on B/S mode was designed in this paper. It achieves fast retrieval and role-based multi-level access control of each document.

Scheduling model for flexible manufacturing system based on Petri net

2008, 28(9):  2410-2412. 

Asbtract ( )   PDF (564KB) ( )  

Related Articles | Metrics

A top-down method was proposed to build the Petri net model for the Flexible Manufacturing System (FMS). An algorithm was given to generate specified number of test models in accordance with some specified conditions and the simulation rules of programs were also given. The platform for FMS analysis and scheduling based on Petri net had been implemented. The system was configurable and could be maintained easily. Finally, the structure of the system was given.

Research of business activity driving system architecture execution

Jun Jiang Lv Xiang Luo ai min Luo Xue Shan

2008, 28(9):  2413-2415. 

Asbtract ( )   PDF (830KB) ( )  

Related Articles | Metrics

Aiming at that it is hard to correlate the execution of business architecture and that of system architecture, and finally forming a whole inherent execution body of the organization's architecture, this paper put forward the method of business activity driving system architecture execution. According to the many-to-many relationships between business activity and system function of DoDAF, the method uses more detailed business process model to describe business activities, and correlates the UOBs of business process model to system functions, and triggers the system function's execution by the execution of business process model's UOBs. The system functions' execution will trigger a series of functions' executions, and the system data exchange between system functions will be implemented by the links of system communications description (SV-2), and finally forming an inherent execution body of the organization's architecture. The method effectively resolves the problem of the many-to-many relationships between business activities and system functions and is unable to form a whole inherent execution body, and provides a specific, concrete implementation scheme for architecture execution.

Region-of-interest coding based on rate-distortion optimization

2008, 28(9):  2416-2419. 

Asbtract ( )   PDF (951KB) ( )  

Related Articles | Metrics

A novel Region-Of-Interest (ROI) coding method was proposed, which could adaptively shift the rate-distortion slopes of the ROI code-blocks. The proposed method could avoid the low efficiency caused by increasing bit-planes. Experimental results demonstrate that the proposed method enables the flexible adjustment of image quality between ROI and background, can support arbitrarily shaped ROI coding without coding the shape, and can reconstruct ROI with higher quality more quickly.

Interval number approach for robot non-vision multi-sensor fusion

Shu-Pping WAN

2008, 28(9):  2420-2422. 

Asbtract ( )   PDF (512KB) ( )  

Related Articles | Metrics

A new method was proposed for the target recognition problem of robot non-vision multi-sensors. The method applies the theory of interval multiple attribute decision making and obtains the weight vector of attributes by solving the optimal programming of minimizing the maximum deviation of comprehensive incidence degrees between the object types and the unknown part. The result of recognition for the unknown object is given by the comprehensive correlation degree. It can avoid the subjectivity of selecting attributes weights and improve the objectivity of target recognition. It is straightforward and can be performed on computer easily. Finally, a simulated example is given to demonstrate the feasibility and practicability of the proposed method.

Incorporating prior knowledge in fuzzy least squares SVM model and its application

XU Liang

2008, 28(9):  2423-2426. 

Asbtract ( )   PDF (950KB) ( )  

Related Articles | Metrics

To address the drawback that the Least Squares Support Vector Machines (LSSVM) is sensitive to noises or outliers, a LSSVM model incorporating with prior knowledge on data was proposed based on noise distribution and sample affinity. Information of noise distribution for samples was introduced in the training process. A strategy based on the sample affinity was presented to discriminate data with noises. A fuzzy membership was automatically generated and assigned to each corresponding data point in the sample set by using the strategy and the noise model. The ability of FLSSVM was improved to resist noises. The flexibility was increased to treat data points with noises or outliers. The proposed method was applied to fault diagnosis for the lubricating oil refining process. The experimental result shows that the proposed method has better robustness.

Research of the method of software/hardware partitioning in the embedded system

2008, 28(9):  2427-2429. 

Asbtract ( )   PDF (550KB) ( )  

Related Articles | Metrics

The clonal selection algorithm in the application of software/hardware partitioning was described, and the problems of target function，system constraint, antibody coding, clonal selection and mutation were discussed. Experiment shows that this algorithm has faster convergence speed and yields solutions close to optical value.

Design of software based on seamless tiling display system

2008, 28(9):  2434-2436. 

Asbtract ( )   PDF (949KB) ( )  

Related Articles | Metrics

On the basis of Microsoft DirectShow technology and OpenSceneGraph that is an OpenSource and three dimensional rendering engine, the paper developed a software platform for an easy manageable, flexible, low cost large scalable and seamless tiling display system, which can be used for some applications such as 3D interactively browser and a large display movie playing. According to the thought of sort-first, we used a master / slave setup for our system as well as OSG (OpenSceneGraph) and the Microsoft DirectShow technology to load graphic scenes and videos. We presented two ways to synchronize the output of the PCs on the retained mode and the immediate mode: time synchronization and frame synchronization. Our experiments show that the performance of our newly developed system is comparable to old expensive display system, but with very small hardware cost.

Design and application of workflow modeling based on extended-directed graph

2008, 28(9):  2437-2439. 

Asbtract ( )   PDF (630KB) ( )  

Related Articles | Metrics

According to the analysis of the object of the workflow modeling, a workflow modeling based on extended-directed graph was proposed in this paper, and this model from node, directed acyclic and evolutionary rules were analyzed. Based on these, a workflow visual modeling was given. The effectiveness of this model in practice was illuminated through a concrete example. It is a brand new solution proposed to settle the key problems in the traditional modeling software development.

Moving object segmentation technology based on DA-STMRF model

Xiao chuanmin QI Lin

2008, 28(9):  2440-2442. 

Asbtract ( )   PDF (772KB) ( )  

Related Articles | Metrics

In order to avoid the drawback of over-smoothness in the conventional Spatiotemporal Markov Random Field (MRF) model, a moving object segmentation technology based on Discontinuity Adaptive-Spatiotemporal Markov Random Field （DA-STMRF) model was proposed. Initial labels were derived after frame difference images were converted to binary images, and the AND-label was obtained with the AND-operation on the two initial labels. After constructing corresponding energy functions, we used metroplis sampler algorithm to optimize the label field. Segmentation experiments on several image sequences show that the algorithm proposed is effective.

Attribute reduction algorithm based on tolerance relation under attribute order

2008, 28(9):  2443-2445. 

Asbtract ( )   PDF (569KB) ( )  

Related Articles | Metrics

In this paper, an attribute order was given, and an algorithm for attribute reduction based on tolerance relation was developed. With the proposed algorithm the unique attribute reduction of the incomplete information systems can be obtained. The strict proof was presented and a case study was also provided to illustrate the proposed algorithm in detail.

Research of Hibernate frame-based data persistence and its application

Yun Xia

2008, 28(9):  2446-2448. 

Asbtract ( )   PDF (575KB) ( )  

Related Articles | Metrics

The currently popular Hibernate mapping framework was discussed in detail in this paper. With the development of a certain communication enterprise's Electronic-Operation Maintenace System (E-OMS), a solution on the hibernate-based data persistence was proposed and its implementation was also given. According to the effect of the system implementation, the advantages and disadvantages of this solution were analyzed, and some proposals in development were summarized.

Improvement and application of access control mode based on RBAC

2008, 28(9):  2449-2451. 

Asbtract ( )   PDF (562KB) ( )  

Related Articles | Metrics

A new access authorization mode was established based on the analysis of access of existing access authorization control system, in which user A can authorize directly user B within his available authorization set, as well as set a time of validity, during which user B own user A's access authorization. This scheme combined static authority allotment with dynamic access authorization, solving the restriction of traditional authority management system. The improved scheme had been well applied in actual projects, getting good effect.

Algorithm of weighting factors dynamic allocation in multi-radar track weighted fusion

Huang You-Peng Zhou Yong-Feng Zhang Hai-Bo Tang Xiu-Hu

2008, 28(9):  2452-2454. 

Asbtract ( )   PDF (486KB) ( )  

Related Articles | Metrics

For the weighted average method used in multi-radar track fusion, the influence of weighting factor allocation on the accuracy of the fused track was analyzed, and an algorithm of weighting factor dynamic allocation was presented. The output track accuracy of each radar was estimated online by exploiting the same target's track information coming from multi-radar system. The dynamic allocation of the weighting factors was realized and the accuracy of the fused track was improved. The results of the simulation experiment show that this algorithm is really effective.