Table of Content

01 July 2008, Volume 28 Issue 7

Previous Issue    Next Issue

Artificial intelligence

Semantic multi-strategy combination matching algorithm

li Ming

2008, 28(7):  1639-1641. 

Asbtract ( )   PDF (478KB) ( )  

Related Articles | Metrics

Considering the drawbacks of single ontology matching strategy and current multi-matching strategies, the paper proposed a multi-matching strategy combination approach, improved some crucial strategies and introduced richness, equipoise and difference to optimize the approach. The experiment shows that the approach can gain better results in terms of precision and recall.

Transductive support vector machines based on incremental learning

2008, 28(7):  1642-1644. 

Asbtract ( )   PDF (600KB) ( )  

Related Articles | Metrics

Aiming at the problem of lower precision, slower training speed and more back learning steps when transducitve support vector machine learning algorithm carry on a great deal of data classification, a new transductive support vector machine based on incremental learning was proposed. The incremental learning was introduced into transductive support vector machine; thereby, the algorithm only employed the useful samples and discarded unwanted samples in the training process, reduced the study time and improved the classification speed of the algorithm. The experimental results show that the algorithm is of faster classification speed and higher classification accuracy.

Learning algorithm model of constructive PONN based on knowledge rules

Yang-bo GU

2008, 28(7):  1645-1648. 

Asbtract ( )   PDF (597KB) ( )  

Related Articles | Metrics

From the perspective of covering points in high-dimensional space, we discussed the theory of constrictive PONN based on knowledge rules. PONN's general constructive algorithm and its two special methods based on random sampling and barycenter rules respectively were proposed in this paper. Simulations on spirals recognition and voice language identification were conducted using the special methods. Experimental results illustrate the good performance of PONN instances. Besides, voice language identification results show that PONN method based on barycenter rule outperforms SVM under certain circumstances.

Research of knowledge discovery based on information entropy Petri net model

2008, 28(7):  1649-1651. 

Asbtract ( )   PDF (609KB) ( )  

Related Articles | Metrics

In order to describe certainty factor of rule and proposition, certainty information entropy of rule and proposition was defined. From the perspective of entropy，this article researched uncertainty reasoning in the production rules, established a new Information Entropy Petri Net model (IEPN) based on Petri nets and certainty information entropy, introduced uncertainty knowledge representation and reasoning steps, moreover, analyzed the significance that IEPN reasoning guided the Knowledge Discovery in Database (KDD), provided IEPN reasoning process and the method of Knowledge Discovery in Knowledgebase (KDK).

Visualization of virtual plant based on 3D model converter

ZHANG Ying WANG Qian LIU Ji

2008, 28(7):  1652-1655. 

Asbtract ( )   PDF (653KB) ( )  

Related Articles | Metrics

A method based on a 3D model converter to simulate the development of virtual plant was presented. The converter was mainly used to import the plant organs which have fine details into the virtual plant developmental system, then communicating with the L-system to implement the simulation of the development of plants controlled by the physiology of plant. It improves the virtual effect produced by the former systems which only take account of the geometric model.

Low-side-lobe pattern synthesis of antenna array by genetic algorithm

Li BIAN

2008, 28(7):  1656-1658. 

Asbtract ( )   PDF (579KB) ( )  

Related Articles | Metrics

In order to get the lower-side-lobe pattern, Genetic Algorithm models of the 16 elements linear array antennas and the 32×32 elements planar array antennas were presented. The two kinds of the array antennas patterns were synthesized. And, the synthesized emulation results of the genetic algorithm and Chebyshev, Taylor classical methods were compared. The results of the comparisons show that the first side-lobe level of the optimization pattern using the genetic algorithm reaches at -40dB and the optimization efficiency is higher than the classical methods. The technology supports to the applications of the array antennas synthesis using the Genetic Algorithm were given.

Online optimal fuzzy identification using improved nearest-neighbor clustering method

Yan LANG

2008, 28(7):  1659-1661. 

Asbtract ( )   PDF (414KB) ( )  

Related Articles | Metrics

To investigate online self-adaptive identification, a method based on improved nearest-neighborhood clustering with optimal fuzzy logic system was proposed. The advanced clustering way considered the input-output space, adjusted the centre point by calculating the means of the whole clustering space and judging the rule's deletion by potential function, and combined with optimal fuzzy logic system which proposed by WANG Li-xin. High identification speed and precision were achieved. The simulation result illustrates the effectiveness of the proposed method.

An optimizing parameter selection method of neural network based on small sample

Wu Gui-Fang Qing-song Lin Xiu-ming Sun Jin-wu Xu Ke Xu

2008, 28(7):  1662-1664. 

Asbtract ( )   PDF (582KB) ( )  

Related Articles | Metrics

An optimized parameter selection method of neural network based on small sample was presented, and it was applied to online surface defect inspection system of cold rolled strips. Small sample of the method was utilized to train and test neural network by every possible combination of parameters to get a group of neural network parameters by plotting histogram of recognition rate under different parameter combinations. Experiments show that optimum recognition of surface defect of cold rolled strips can be accomplished by the parameters that are selected by the optimizing parameter selection method.

Intuitionistic fuzzy rough sets based on residuation implication of T-norms

2008, 28(7):  1665-1667. 

Asbtract ( )   PDF (438KB) ( )  

Related Articles | Metrics

This paper researched and constructed residuation implication operator of intuitionistic fuzzy T-norms. Based on this, the paper deducted the intuitionistic fuzzy rough sets model, and proved that the Pawlak rough sets, intuitionistic fuzzy sets, fuzzy rough sets, rough fuzzy sets and fuzzy T-norms rough sets were special cases of intuitionistic fuzzy rough sets. At last, some properties of intuitionistic fuzzy sets were presented and proved.

Chart algorithm-based binary combinatorial grammar parsing

Zhang Yu-yan Yang Xiao Huang Guodong Hou Jin-kui

2008, 28(7):  1668-1671. 

Asbtract ( )   PDF (609KB) ( )  

Related Articles | Metrics

In order to resolve the share-space problem about parsing trees in operator-precedence based parsing of Binary Combinatorial Grammar (BCG), a chart algorithm based parsing approach was proposed to reduce the spent space and to improve the parsing efficiency. All edges produced during the parsing process were stored by a tabular structure. By tracing the table, parsing trees were constructed according to the span of edges, so that these edges were no longer restricted in a particular tree. Then, the pruning in parsing process was achieved according to the characteristics of BCG grammar. The experiment showed that all of the spent time, produced edges and result trees of this approach were less than those of traditional chart algorithm and operator-precedence based algorithm.

Illumination robust Mean Shift tracking

Lu WANG YANG Lin-yun ZHUO Qing WANG Wen-yuan

2008, 28(7):  1672-1674. 

Asbtract ( )   PDF (495KB) ( )  

Related Articles | Metrics

A new illumination robust Mean Shift tracking method was proposed. This method combined color feature and local binary pattern feature to describe the target. The illumination invariant characteristic of local binary pattern made the model more robust. To avoid the unstable bin-to-bin similarity applied in the original Mean Shift tracking method, a cross-bin similarity was used to make the feature matching more stable. Experiments show that the proposed method is robust than the original Mean Shift tracking method under illumination changes.

Classification-based automatic initialization VVS tracking algorithm

SUN Min 孙敏 Yao-Lin Gu

2008, 28(7):  1675-1677. 

Asbtract ( )   PDF (454KB) ( )  

Related Articles | Metrics

Automatic initialization becomes the hot issue in the tracking of augmented reality. The paper based on Virtual Visual Servoing (VVS) tracking algorithm used randomized trees as the classification technique and treated the feature point matching as a classification problem. Then, a linear pose computation method was used to estimate the initial camera position. Finally, the fast veracity was verified and the method had a better performance.

Robust processing method for data smooth

2008, 28(7):  1678-1680. 

Asbtract ( )   PDF (535KB) ( )  

Related Articles | Metrics

There exist deviations of error distribution and exceptional dots in practical data measurement. However the classical methods of shift smooth processing of 2k＋1 dots are not robust. In order to deal with this problem, the paper utilized M robust quadratic polynomial linearity space regression algorithm to deal with the robust smooth progressing. Lastly, the full robustness of the algorithm is demonstrated by analyzing the IF.

Research of multi-class algorithm based on fuzzy support vector machine

2008, 28(7):  1681-1683. 

Asbtract ( )   PDF (501KB) ( )  

Related Articles | Metrics

An approach of binary tree fuzzy multi-class support vector machines algorithm was proposed due to the multi-classification problem and sensitivity to the noisy data of the Support Vector Machine algorithm (SVM). The algorithm introduced a K-Nearest Neighbor （KNN） fuzzy membership function according to Binary Tree Support Vector Machine algorithm (BTSVM). Depending on the different influences of respective data set on the classification results and measuring method of the KNN fuzzy membership function, it can calculate the corresponding value and additionally obtain the different penalty value and ignore the unimportant data for the classification results, while constructing the classification hyper-planes. Experimental results indicate that the algorithm has a better ability of anti-interference and better classification effects.

Database Technology

Rough set model based on set pair analysis in incomplete information system

TAO Zhi

2008, 28(7):  1684-1685. 

Asbtract ( )   PDF (410KB) ( )  

Related Articles | Metrics

Rough set theory has become a focus subject because of its successful applications to data mining. Equivalent relation in the classical rough set was relaxed to the application of the rough set theory widely, but it is restricted in incomplete systems. In this paper, we put the more effective rough set model based on set pair analysis of the existing model. Through a case study, it is verified that the model is more feasible and effective, and rough set theory is extended in some way.

Resolving combinational ambiguity in Chinese word segmentation based on rule mining and Naive Bayes method

2008, 28(7):  1686-1688. 

Asbtract ( )   PDF (616KB) ( )  

Related Articles | Metrics

Combinational ambiguity is one of the most difficult problems for Chinese word segmentation. After in-depth analysis of the other algorithms in literature, the paper proposed a new segmentation algorithm. The algorithm automatically mined word collocation rules and grammar rules from training corpus, and then made integrated decisions to resolve combinational ambiguity based on the mined rules and Naive Bayes method. Extensive experiments show that the proposed algorithm obtains an accuracy increase of 8% against the related works.

Complicated query aggregation algorithms for multi-dimensional data

Jin-ling LIU

2008, 28(7):  1689-1691. 

Asbtract ( )   PDF (440KB) ( )  

Related Articles | Metrics

Complex inquiry to the spatial multi-dimensional data is the key point and the difficulty of the multi-dimensional data research. This article has made improvement in several aspects as the following: carry out the data piecemeal according to the grouping attribute value; carry out effective sorting to the integrated data; carry out the optimization in the accumulation function's application. It indicated that the improved algorithm can enhance the inquiry's efficiency greatly via analog data's experiment.

Multi-class associative classification based on intersection method and extended chi-square testing

Sunlei

2008, 28(7):  1692-1695. 

Asbtract ( )   PDF (565KB) ( )  

Related Articles | Metrics

Given that there exit some defects in several typical classification algorithms, such as poor classification performance and long running time when the algorithm efficiency is not high, this paper proposed a classification algorithm ERAC based on intersection method and extended chi-square testing. This algorithm first produced, through intersection method, all the frequency items and association rules. Then it conducted classification and pruning on rules using an extended testing method, reducing the number of rules for classification effectively. Subsequent experiments prove that new method, compared with the CBA algorithm, has higher classification accuracy and operating efficiency.

Algorithm of refactoring XML structure with heuristic strategy

Bo Liu

2008, 28(7):  1696-1699. 

Asbtract ( )   PDF (541KB) ( )  

Related Articles | Metrics

Considering the demand of the date relationship and service request multiform based on XML documents, this paper proposed a new frequent pattern tree algorithm for selected incremental vector items set of refactoring XML structure (XFP-tree). Bases on the XML Key, the algorithm firstly dealt with XML structure to vector matrix, then used project frequent pattern tree to optimize the XML structure through dissociating, uniting, updating and canceling to satisfy the conciseness of the XML structure and query multiversity. Combining project and tree-structure manipulation, this paper discussed the dividing rule of xml key vector matrix frequent pattern. This rule improved the algorithm efficiency by establishing heuristic strategy and support thresholds. Contrasted with other algorithms of Association Rule, a series of emulation experiments show that this method has the effectiveness and feasibility as an efficacious attempt of refactoring XML structure.

Message mechanism to achieve heterogeneous database synchronization update

Lei Yuan-Ping

2008, 28(7):  1700-1701. 

Asbtract ( )   PDF (427KB) ( )  

Related Articles | Metrics

In terms of Heterogeneous database synchronization demand, a synchronization solution was proposed based on the study of JMS message mechanism. This solution actualized asynchronously the synchronic data renewal by two parts: messages customization using XML language, database read-write using JNDI interface technology. The experimental results show that this new method effectively deals with the above problems.

Execution optimization for composite services through multiple engines

Lin Yang Jian-su Lin

2008, 28(7):  1702-1704. 

Asbtract ( )   PDF (467KB) ( )  

Related Articles | Metrics

A Web service Management System with Multiple Engines (WSMSME) was proposed to solve the problem of execution optimization for composite services in the system. The scheduler execution of composite services in system with multiple engines was analyzed, and a dynamic programming algorithm was put forward, which optimally minimized the heaviest load of engines by segmenting a pipelined execution plan into subsequences before they were dispatched and executed. Experiment with an initial prototype indicates that the algorithm can lead to significant performance improvement than the random algorithm.

Analysis of customer loss based on artificial immune system

Xiao-Ning QIU

2008, 28(7):  1705-1708. 

Asbtract ( )   PDF (655KB) ( )  

Related Articles | Metrics

Concerning to the low efficiency of the classification algorithm in the real applications which was caused by over-sampling and misunderstanding rules in the analysis of customer loss, a new classified method, Induction of Rule with Antibody-cross-antigen of Artificial immune system (IRAA), was proposed. IRAA was based on artificial immune system, and combined with both rule extraction and classification of Michigan approach model. Furthermore, antibody-cross-antigen was added in the antibody's clone selection process. Compared with tradition classification algorithms in actual application, results show the proposed algorithm obtains higher precision and easy-to-understand rules.

QoS management for real-time and mobile database systems based on imprecise computation

2008, 28(7):  1709-1712. 

Asbtract ( )   PDF (607KB) ( )  

Related Articles | Metrics

The demand on mobile and real-time database application and service becomes increasingly extensive, so that competing for the limited resources and predicting workload imprecisely lead to abortion or restart for system even catastrophe. Because a real-time process scheduler using worst-case execution time is inefficient for optimizing performance, a scheduling algorithm for update transactions based on imprecise computation and feedback control loop was presented in this paper. A performance metrics based on validity in time domain and value domain was proposed to ensure the quality of service in mobile and real-time database systems. The algorithms and feedback control architecture can guarantee the transient and steady performance of Quality of Service (QoS), which is verified by simulation experiments.

Graphics and image processing

Robustness analysis of pose estimation based on points

2008, 28(7):  1713-1716. 

Asbtract ( )   PDF (692KB) ( )  

Related Articles | Metrics

From the perspective of practical application, the robustness of pose estimation with coordinate detection error was discussed, given that P3P issue has exclusive solution. With the theoretical derivation on simplified condition and the simulation on normal condition, some conclusions have been obtained such as the pose estimation error is decreases with increment of camera focus ratio, is independent to the coordinate of image center point, decreases with the increment of distance between control points in object model, increases with the increment of estimation distance, etc. All these conclusions are significant to the design of pose estimation system.

Real-time shadow rendering technology for large-scale virtual environments

2008, 28(7):  1717-1720. 

Asbtract ( )   PDF (670KB) ( )  

Related Articles | Metrics

In order to solve the problem of reality and real-time performance in the shadow generation of large-scale scene, the view frustum was divided into different depth ranges by using split planes parallel to the view plane, with combining uniform split scheme and logarithmic split scheme; then the paper proposed to generate multiple smaller shadow maps for these split parts; at last the scene was rendered with multiple shadow maps with smaller sizes instead of a large size one. This algorithm can produce real-time shadowing effects with less texture memory, but significant improvement of shadow qualities, especially for the dynamic and large-scale virtual environments. The algorithm was implemented in VS2005 and OpenSceneGraph, and it can satisfy the requirement of quality and real-time performance.

Motion blur scales identification based on autocorrelation of projection

2008, 28(7):  1721-1723. 

Asbtract ( )   PDF (558KB) ( )  

Related Articles | Metrics

In order to restore the degraded image, the first step is to give the estimation of the blur scale. Blur scale identification based on the autocorrelation of projection was proposed aiming at the motion blurring. The movement direction was transformed into horizontal direction, firstly computing the horizontal derivative of blurred image, and secondly computing the vertical derivative of the horizontal derivative of blurred image. Then, the autocorrelation curve of the projection for the vertical derivative was drawn, and the degradation scales were equal to the distance of maximum and minimum values of the autocorrelation function.

Segmented logarithmic tone mapping from HDR to LDR

Rui-Shen TAN

2008, 28(7):  1724-1725. 

Asbtract ( )   PDF (449KB) ( )  

Related Articles | Metrics

To adapt to low-end display device, High Dynamic Range (HDR) image should be converted into Low Dynamic Range (LDR) image. A sigmoid logarithmic method based on both human eyes' logarithmic response to light and luminance distribution of images is proposed. With low complexity, the algorithm produces low dynamic range images integrating sigmoid and logarithmic algorithms' characteristics in terms of visual quality.

Spatial shape error concealment method based on cubic B-spline interpolation

2008, 28(7):  1726-1728. 

Asbtract ( )   PDF (405KB) ( )  

Related Articles | Metrics

The deficiencies of traditional shape error concealment method based on Bézier curve were analyzed, which included the complex process of calculating additional control points and the influence of additional control points to accuracy. In this paper, an error concealment method was proposed based on cubic B-spline interpolation (CBI). The matrix formula of CBI was modified to smooth the object's boundary. The known boundary points were interpolated directly and no additional control points needed. Experimental results show that the proposed method is simple and easy implement, and is of great promise in practice.

Size measurement of ceramic substrate based on three level edge gradation model spatial moment

2008, 28(7):  1729-1731. 

Asbtract ( )   PDF (386KB) ( )  

Related Articles | Metrics

This paper introduced the subpixel subdivision algorithm for spatial moment based on two level edge gradation model and analyzed its principle error, and established more actual three level edge gradation model, and deduced two-dimensional spatial moment of random angle image edge as well as its subpixel location function. The algorithm is applied to size measurement and classification of ceramic substrate, and measurement is more effective and classification accuracy is higher. The algorithm has high value in measurement of component size.

Improved adaptive median filtering

2008, 28(7):  1732-1734. 

Asbtract ( )   PDF (489KB) ( )  

Related Articles | Metrics

An improved adaptive median filter is proposed to restore images corrupted by impulse noise. There are mainly three improved points in this algorithm. First, the image pixels are classified into signal pixels and noise pixels according to the decision criterion. Second, a measure, denoted as minimum set distance, is introduced to avoid misclassification of high frequency signal as noise. Third, the median of minimum uncorrupted pixel set is used to restore noise pixel, in order to eliminate its neighborhood noise impact. The results of comparison experiments with RAMF and NASMF demonstrate that the proposed method can detect noise with high accuracy, remove noise efficiently while retaining image details, especially to images with high noise density.

Research of generating sketching style from original image

Hui-Qin Wang

2008, 28(7):  1735-1737. 

Asbtract ( )   PDF (529KB) ( )  

Related Articles | Metrics

Most current Non-Photorealistic Rendering (NPR) techniques perform rendering using strokes with different size and shape. This is largely to mimic hand painting practice. A non-stroke-based method was proposed for generating sketching style of painting from original image. A feature preserved filter was used to remove the illumination effect and separate feature pixels from others. The result image was transformed into binary version and edges were detected from the filtered image. Finally, the target sketching style was obtained by removing noises from binary version according to the edge information. At last, experimental results demonstrate that the new method can quickly and efficiently generate sketch effects, and the implementation is simple.

Application of WMD Gaussian kernel in spectral partitioning

Shi-tong WANG

2008, 28(7):  1738-1741. 

Asbtract ( )   PDF (655KB) ( )  

Related Articles | Metrics

To obtain a better segmentation result, this paper used Weighted Mahalanobis Distance (WMD) Gaussian kernel for Nystrm-Ncut segmentation. It proves that weighted Mahalanobis distance Gaussian kernel is more appropriate for spectral graph theoretic methods than Mahalanobis distance, because weighted Mahalanobis distance can compute the similarity between two pixels more accurately.

Design of thresholding segmentation operator with high precision self-adaptive capacity

Da-xing Zhao Huang Wang Jin-lei Zhu Yun-hui Yan

2008, 28(7):  1742-1743. 

Asbtract ( )   PDF (452KB) ( )  

Related Articles | Metrics

Focusing on the problems about low precision and self-adaptive capacity in the identification of target area under complicated background, a new thresholding segmentation algorithm with self-adaptive capacity and high precision was introduced in the test after the investigation of texture image and the space area form rule. Results demonstrate that the algorithm has fine self-adaptive capacity. Particularly in random texture images with higher energy distribution, a high precision could be obtained with this algorithm.

Modified Split-Merge image segmentation algorithm

Jun XIE Lu YU Le-nan WU

2008, 28(7):  1744-1746. 

Asbtract ( )   PDF (494KB) ( )  

Related Articles | Metrics

As a classical algorithm in image segmentation, Split-Merge algorithm is simple and effective. However, two problems are often encountered, i.e. inaccuracy of edges and over-segmentation of the image. To eliminate over-segmentation, this paper proposed a modified Split-Merge algorithm. In the modified algorithm, a global objective function including a length term was introduced, and the greedy algorithm was used to merge the regions. The use of length term and greedy algorithm made it possible to merge the adjacent blocks effectively and eliminate over-segmentation. The experiments show that the new algorithm can yield good results.

Segmentation algorithm of hydrophobic image based on region similarity

YU Wen-Wen Yi SU Liang-rui TANG

2008, 28(7):  1747-1749. 

Asbtract ( )   PDF (633KB) ( )  

Related Articles | Metrics

Hydrophobic measurement is an important way to evaluate the performance of insulators. Traditional segmentation algorithms may bring error segmentation in weak boundary, which affect the accuracy of confirming the level of hydrophobic. A new segmentation algorithm based on region similarity was proposed in this paper. According to the characteristics of hydrophobic image, gray similarity and gradient similarity were used in region growing. The final image segmentations were effectively obtained by mathematical morphology. The proposed approach achieves improved segmentation performance and provides evidences for contamination grades recognition of insulators.

Brain MR image segmentation based on anisotropic Gibbs random field and fuzzy C-means clustering model

Sun-feng Wang Jian-Wei ZHANG

2008, 28(7):  1750-1752. 

Asbtract ( )   PDF (439KB) ( )  

Related Articles | Metrics

Fuzzy C-means (FCM) clustering model is one of the well known unsupervised clustering techniques, which has been widely used. However, the classical FCM model only uses the intensity information and no spatial information is taken into account, so it is sensitive to the noise. In order to overcome this limitation of FCM, this paper used the Gibbs theory and the image structure information to construct anisotropic Gibbs random field and incorporated it to FCM model. The new model can reduce the effect of the noise and contain the information of beam structure regions and corner regions. Experiments on the segmentation of brain magnetic resonance images show this model has better performance in image segmentation.

Image fusion algorithm based on fuzzy integral

2008, 28(7):  1753-1755. 

Asbtract ( )   PDF (474KB) ( )  

Related Articles | Metrics

A novel image fusion algorithm was proposed, which was based on choquet fuzzy integral. The main idea was to obtain belief function using the wavelet coefficient of infrared images and low light level images, then construct fuzzy density using the fuzzy edge evaluation function of local area, finally get fused wavelet coefficient by fuzzy integral and reconstruct fused image by inverse wavelet transform. The experimental results show that the method not only keeps spectral quality of fused image, but also enhances the spatial detail quality of fused image.

Determining knots by minimizing second derivative vector

2008, 28(7):  1756-1758. 

Asbtract ( )   PDF (439KB) ( )  

Related Articles | Metrics

One of key problems of constructing parametric fitting curves is to compute a knot for each point. A new method for determining knots was presented. Corresponding to each data point, the new method constructed a quadratic curve that passed three consecutive points; the knots of the quadratic curve were determined by minimizing the second derivative vector of the curve. The knot interval between two adjacent points was determined by the two quadratic curves. The new method determined the knots with a local way, which made it useful in interactive design of curve and surface. The experimental results in this paper show that the new method is more effective than the other existing methods.

Volume rendering of spatial scattered data based on spatial data interpolation algorithms

2008, 28(7):  1759-1760. 

Asbtract ( )   PDF (439KB) ( )  

Related Articles | Metrics

Volume rendering technology is one kind of visualization technology, which can truly represent the information within the 3D data sets. And volume rendering of 3D irregular data sets is still a focus in the volume rendering field. This paper introduced the means to transform the spatial scattered data to regular volume data by using spatial data interpolation algorithms, and then implemented the volume rendering of spatial scattered data by using ray casting algorithms. Finally, the volume rendering of the oil distributions in one part of oil storage field was achieved by using the principle introduced in this paper.

Using tow-steps Hough transform to detection ellipses

Jing-Dong ZHAO

2008, 28(7):  1761-1763. 

Asbtract ( )   PDF (416KB) ( )  

Related Articles | Metrics

Hough transform plays an important part in the image processing. It is an effective approach for curve detection. But using traditional Hough transform to detect circles has the disadvantages of massive storage requirement and high cost of computation. This article presented a method of tow-steps Hough transform to decide whether the input figure is a circle. The method utilized the slope attribute of circle to reduce the statistical dimension of Hough parameter space, enhance the operating efficiency and advance to detect an ellipse.

Modified nonlinear diffusion equation for noise removal

2008, 28(7):  1764-1765. 

Asbtract ( )   PDF (431KB) ( )  

Related Articles | Metrics

A diffusion coefficient function of nonlinear diffusion equation was modified for processing image so that the modified model can remove the high gradient noise of the image and preserve the edge details of the image while considering the gradient and second derivative of the image. Experiments have shown that the modified model is capable of getting rid of the noises efficiently and preserving the edge locality and stronger peaks and thin edges while removing the high gradient noise of the image.

Modified fast algorithm for STL file slicing

Pei-Zhi WEN

2008, 28(7):  1766-1768. 

Asbtract ( )   PDF (464KB) ( )  

Related Articles | Metrics

STL is an Ad Hoc standard in rapid prototyping manufacturing. An efficient STL slicing algorithm is necessary for high quality prototype production. In this paper, we proposed a fast slicing algorithm based on recursion and searching direct graph with weight. In this method, the time consuming of creating direct graph was eliminated. Then the slicing data was postprocessed to get rid of the redundant points. Thus the slicing speed can be accelerated substantially. Lots of experiments and data analysis validate our new slicing algorithm.

Information security

Detecting hidden process with local virtualization technology

WEN Yan JinJing ZHAO Huaimin WANG

2008, 28(7):  1769-1771. 

Asbtract ( )   PDF (492KB) ( )  

Related Articles | Metrics

Currently stealth malware is becoming a major threat to the PC computers. Process hiding is the technique commonly used by stealth malware to evade detection by anti-malware scanners. In this paper, we presented a new VM-based approach called Gemini that accurately reproduced the software environment of the underlying preinstalled OS within the Gemini VM. With our new local-booting technology, Gemini VM just booted from the underlying host OS but not a newly installed OS image. In addition, Gemini adopted a unique technique to implicitly construct the Trusted View of Process List (TVPL) from within the virtualized hardware layer. Thus, Gemini provided a way to detect the existing process-hiding stealth malware in the host OS. Our evaluation results with real-world hiding-process rootkits, which are widely used by stealth malware, demonstrate its practicality and effectiveness.

Research of HSC-based hidden process detection technique

HE Zhi 何志

2008, 28(7):  1772-1775. 

Asbtract ( )   PDF (630KB) ( )  

Related Articles | Metrics

This article introduced normal hidden process detection techniques in Windows, and brought forth Hook System Call (HSC) based hidden process detection technique. Finally it improved the detection technique to withstand RootKit's attack. This technique made use of hidden process's action characteristics to hook system call for establishing integrated process list, and then detected hidden process. This detection method is more reliable, so it can detect more malware's intrusions than general security detection softwares.

Study on intrusion detection alerts analysis system based on LRE algorithm

2008, 28(7):  1776-1778. 

Asbtract ( )   PDF (485KB) ( )  

Related Articles | Metrics

In allusion to the efficiency problem of the actual association rules mining algorithms in the process of disposing massive data, an improved Recursive Elimination based on linked List (LRE) based on one-dimensional linked list was put forward in this paper. A model of intrusion alerts analysis system with LRE algorithm was designed. Finally, the validity in the aspect of reducing the number of alerts and the false positive rate has been showed by the experiments.

Random chaotic dynamical systems group and stream cipher algorithms

2008, 28(7):  1779-1780. 

Asbtract ( )   PDF (455KB) ( )  

Related Articles | Metrics

The characteristics of the existing cipher algorithms for chaotic system were briefly analyzed in this paper. In order to provide a more effective encryption technique, the concept of random chaotic dynamical systems group was given. The random chaotic systems group can generate complex chaotic systems sequence under given conditions. Therefore, a stream cipher algorithm based on the random chaotic dynamical systems group was presented directly. Its encryption process could be influenced by secret keys, plaintext and specialty of chaotic systems group. Compared with other algorithms, the algorithm has been proved of higher security. The results of experiments show stream cipher algorithm based on the random chaotic dynamical systems group is easy to realize. Meanwhile, it has been tested with good encryption result and large secret space.

Novel intrusion detection algorithm based on semi-supervised clustering

Songling

2008, 28(7):  1781-1783. 

Asbtract ( )   PDF (479KB) ( )  

Related Articles | Metrics

An anomaly intrusion detection algorithm based on semi-supervised clustering along with PSO K-means was presented. It could solve the problems of the low detection rate of the intrusion detection algorithms based on unsupervised learning, and the insufficiency of training samples of the intrusion detection algorithms based on supervised learning. The algorithm utilized minimal labeled data and lots of unlabeled data to improve its learning capability, and novelty detection could also be carried out. The experimental results manifest that the detection results of the algorithm outperforms both the one based on unsupervised learning remarkably and the one based on supervised learning.

Research of co-stimulate intrusion detection based on danger singal

2008, 28(7):  1784-1785. 

Asbtract ( )   PDF (440KB) ( )  

Related Articles | Metrics

To increase the detection ability of unknown intrusion and overcome false negative rate and false positive rate when boundary between normal and abnormal was fuzzy and improve the adaptability of intrusion detection system, a co-stimulate intrusion detection with danger signal based on danger theory was presented. A method of determining the danger signals based on rough set theory was proposed and a control strategy of danger signal used in co-stimulate intrusion detection was brought forward. The logic structure of this system and the control flow of this system were proposed.

Study and realization on secure elliptic curve over optimal extension fields

Ping Zhang Ren ChangGen Peng YouLiang Tian YuLing Chen

2008, 28(7):  1789-1791. 

Asbtract ( )   PDF (427KB) ( )  

Related Articles | Metrics

Concerning the deficiency that the study on elliptic curve cryptosystem over Optimal Extension Fields (OEF) mainly focuses on the operation about addition, subtraction, multiplication and inverse of field's element, the preparative base point method was presented and a simple algorithm of computing the order on elliptic curve was designed. Making use of the methods and the algorithm, a fast generating algorithm of secure elliptic curve over optimal extension fields was implemented on general PC. Experiments show that the efficient is preferable.

Blind color watermarking algorithm based on self-adaptation of wavelet domain

zhi-jun liu

2008, 28(7):  1792-1794. 

Asbtract ( )   PDF (483KB) ( )  

Related Articles | Metrics

This paper proposed a novel blind color watermarking algorithm based on self-adaptation of wavelet contrast and HVS speciality. It mainly includes the self-adaptation calculation of the factor of embedding intensity on the basis of wavelet contrast and HVS speciality; color watermarking embedding and blind extracting algorithm (using Arnold transform, interweaving and BCH coding technology). Experiments of attack and non-attack were carried out in the Matlab 6.5. The experimental results show that the algorithm has stronger invisibility and robustness on non-attack. It has better robustness on the common watermarking attack such as noise adding, middlefilter, croping, JPEG compression and so on; it has higher value on the multimedia copyright protection.

Approach for policy consistency management in automated trust negotiation

Ying-long Wang

2008, 28(7):  1795-1797. 

Asbtract ( )   PDF (430KB) ( )  

Related Articles | Metrics

Automated Trust Negotiation （ATN) provides a means to establish the trust membership by disclosing and matching credentials and access control policies. In the open and distributed environment, policy consistency management helps users to find various resources, and makes users know what they need to meet the requirements of the access control policy. Currently, policy consistency management is maintained by resource provider in ATN, which restricts resources to be found, limits the sharing and wastes the valuable computational power of the resource provider. To solve the problems, an efficient policy consistency management approach was proposed in the paper, in which a trusted third party was created to store policies and manage the access control policies in a centralized method by using Lightweight Directory Access Protocol (LDAP), and to describe policies by using the general XML and to effectively check and handle policy conflicts from policy updating and deleting.

Novel group key agreement protocol for dynamic collaborative peer groups

Li-Ping ZHANG

2008, 28(7):  1798-1801. 

Asbtract ( )   PDF (705KB) ( )  

Related Articles | Metrics

To achieve security in a dynamic collaborative peer group, group key agreement protocol should be provided. Two-party key agreement protocol based on the weil pairing protocol (A-WGKA2) was proposed in this paper. It may establish a secret key between two nodes and authenticate each other by fewer messages. The proposed protocol has the security properties such as forward secrecy, no unknown key-share, known session key security, no key control and no key-compromise impersonation. Further, we proposed a group key agreement protocol using weil pairing referred as A-WGKAn that was adapted to the dynamic collaborative peer groups. In the A-WGKAn protocol, the A-WGKA2 protocol was employed on key tree to establish and allocate group key. Therefore, it not only has low computational overhead and communication costs but also provides the node authentication.

Design and analysis of a security protocol for ubiquitous environments

Fan Yang

2008, 28(7):  1802-1806. 

Asbtract ( )   PDF (754KB) ( )  

Related Articles | Metrics

"Unobtrusiveness" is the essential property of ubiquitous computing. We presented a Security Protocol for Ubiquitous Environments (SPUE), which provided data authentication, and data freshness besides unobtrusiveness. Using both asymmetric-key and symmetric-key algorithms made the protocol more secure and enough for severe resource constraints, limited computation, memory, and communication capacities. Furthermore, with modeling the protocol by Communicating Sequential Processes (CSP) method and checking it with Failures Divergence's Refinement (FDR), it has been verified that security properties can be guaranteed.

Security analysis and improvement of IKE protocol with signature authentication

Wei-Wei HE

2008, 28(7):  1807-1809. 

Asbtract ( )   PDF (621KB) ( )  

Related Articles | Metrics

The complexity of Internet Key Exchange (IKE) protocol causes some potential security flaws. After the mechanism of IKE with signature was introduced, the two kinds of man-in-middle attack were analyzed. In order to protect the users' identities from being exposed to the outside, two solutions with some improvements were proposed. Finally the paper made a quantitative capability analysis on the whole.

Three-factor authentication mode of network payment

2008, 28(7):  1810-1811. 

Asbtract ( )   PDF (423KB) ( )  

Related Articles | Metrics

This paper introduced a three-factor authentication mode of network payment which added an authentication code factor on the basis of the traditional dual-factor authentication. The realization method of the authentication protocol was also given, followed by an analysis on its security. The analysis verifies that this mode can enhance the security of the network payment.

Modeling of virus propagation in peer-to-peer file-sharing networks

2008, 28(7):  1812-1815. 

Asbtract ( )   PDF (612KB) ( )  

Related Articles | Metrics

To counter the attacks of virus in P2P file-sharing networks, the model of virus propagation in P2P networks was proposed based on deep analysis on the features of file sharing and virus propagation. In order to examine the effect of different parameters in this model, large scale simulating experiments were carried out. The fact that different parameters have varied effect on virus propagation shows that virus propagation can be throttled by controlling those key parameters.

Cancelable fingerprint fuzzy vault scheme

Quan Feng Fei Su

2008, 28(7):  1816-1818. 

Asbtract ( )   PDF (537KB) ( )  

Related Articles | Metrics

Fuzzy vault is a cryptographic framework that binds the biometric template with a cryptographic key. However, attackers can easily compromise them if they steel more than two vaults of a legal user by cross matching. A new scheme named cancelable fuzzy vault was proposed to overcome this shortcoming, which generated different vaults from different cancelable templates instead of the origin template. In our scheme, a mixture of butterworth low filter was taken as the transform function which generated a cancelable template. In addition, users' passwords were adopted to encrypt the vaults to improve their security.

Network and communications

Service-oriented network management model based on active network technology

WANG Jian-guo 王建国 HU Chuan LI Ying Hong Jing

2008, 28(7):  1819-1822. 

Asbtract ( )   PDF (657KB) ( )  

Related Articles | Metrics

Traditional network management can not meet the needs of the Next Generation Network (NGN), so service-oriented network management is the inevitable development trend. Based on the research of active network technology and using advanced ideas of active network technology and telecommunication management network, we proposed the organization model, the function model, the communication model and the information model. To propose a new network management model: service-oriented network management model based on active network technology. The network management system based on this model can preferably and effectively manage network services.

Cooperative incentive mechanism based on game theory in mobile P2P networks

Xin-Zheng Niu Kun She

2008, 28(7):  1823-1827. 

Asbtract ( )   PDF (807KB) ( )  

Related Articles | Metrics

Many selfish mobile peers consume much resource without any contribution in mobile P2P network. Considering the limitation of network resource and selfishness of peers, this paper proposed a cooperative incentive mechanism based on game theory. The mechanism provided peers with different network's service quality according to their contribution and therefore every peer was encouraged to cooperate with others or share their resource. This paper described and analyzed the resource allocation policy of cooperative incentive mechanism in detail. Besides, the existence of the steady Nash equilibrium in the game was also proven. Simulation and analysis results show that the incentive mechanism can encourage the cooperation among the peers and improve the network performance efficiently. Compared with current cooperative incentive mechanism, the mechanism can increase forwarding ratio of the packet.

Study of communication performance in underwater acoustic sensor networks

2008, 28(7):  1828-1830. 

Asbtract ( )   PDF (587KB) ( )  

Related Articles | Metrics

In this paper, the study on the relation between the communication performance and node distributed density in Underwater Sensor Networks (USN) was presented. The method combined the models of transmitting loss and ray of underwater acoustics to deduce the relationship between communication performance and node distributed density in USN. Moreover, the conclusion was simulated by Monte Carlo methods. By the result of simulation, the communication ability of underwater network can be forecasted on the given node deployment, furthermore the optimum net density will be found with the constraint of the given communication ability of underwater network, which affords benefit for the topology and node deployment based on the communication performance in underwater sensor networks.

Scheduling scheme of IPTV multicast traffic control based on fair service and multidimensional weighted round robin

2008, 28(7):  1831-1834. 

Asbtract ( )   PDF (546KB) ( )  

Related Articles | Metrics

According to the general technology criterion of Access Convergence Router (ACR), the IPTV multicast copy is processed in Ethernet Multiplexer-Demultiplexer (EMD). Because the increase of the IPTV multicast service will impact other service, the IPTV multicast traffic should be controlled to ensure the bandwidth allocation of other service. To solve the key portion - the queue schedule of IPTV multicast traffic, a scheme of Fair Service and Multidimensional Round Robin was presented, the result of simulation indicate that Fair Service and Multidimensional Weighted Round Robin (FSMWRR) can achieve the good delay and jitter performance for IPTV service and provide fair bandwidth allocation for all service.

Research on improving a problem of the cluster-heads' death in a round using a variable round method

2008, 28(7):  1835-1837. 

Asbtract ( )   PDF (400KB) ( )  

Related Articles | Metrics

To solve the problem of cluster-heads' heath in the LEACH-based algorithms for WSNs, a variable round mechanism was proposed in this paper. It effectively solves the problem that when the rounds last too long, it appears that cluster-heads die in the rounds and when the round time is too small, the overhead energy wastes and the frequent alternation takes place. The simulation shows that the method of variable round enhances the efficiency in energy-consumed and the usability of WSNs.

Probabilistic analysis on fault tolerance of E-3DMesh networks based on partitioning strategies

Jie XIAO

2008, 28(7):  1838-1840. 

Asbtract ( )   PDF (451KB) ( )  

Related Articles | Metrics

The mode of E-3DMesh network with a large number of faulty nodes was investigated. Based on partitioning strategies, a new probabilistic analysis approach was given, which enabled to derive the node failure probability of E-3DMesh networks when the connectivity probability of E-3DMesh network was attributed. In order to remain connected with probability larger than 99% in E-3DMesh networks with millions of nodes, the network node failure probability was controlled below 3.86% was proved. The scheme is applicable to the study of other hierarchical network structures and of other network communication problems.

Research of stability of PID active queue management in Ad Hoc network

2008, 28(7):  1841-1843. 

Asbtract ( )   PDF (599KB) ( )  

Related Articles | Metrics

Stability of Proportional Integral Differential (PID) algorithm in Active Queue Management (AQM) is the base of congestion control. Now PID often uses experience and experimentation to design and optimize. These methods lack theoretic analysis of stability region and often get some isolated results. Stability characterization of PID was analyzed in wireless and delay Ad Hoc network because of the multi-hop and delay. Finally, it gave stability regions of PID AQM controllers under different differential coefficients in large-delay networks. Compared with tradition engineering ways, it also gave stability theory of PID delay system and helped to determinate coefficients. Matlab and NS2 simulations indicate that stability regions and its advantage are proved.

Level-based routing protocol design for multi-hop wireless sensor networks

2008, 28(7):  1844-1846. 

Asbtract ( )   PDF (427KB) ( )  

Related Articles | Metrics

The Level-based routing protocol was proposed for multi-hop wireless sensor networks. The level structure of this protocol guaranteed the length of the route, and the application of achievable Power Available strategy improved the energy efficiency, and the life-span of the net was also extended. Through being compared with other protocols, its validity was proved.

Application on call signal system and call control of HMP

Xue-Hua LIAO Jing-wei MIAO Zhou-sen ZHU Ying ZHANG Xiao-ning LI

2008, 28(7):  1847-1849. 

Asbtract ( )   PDF (523KB) ( )  

Related Articles | Metrics

The communication signal system and signal control of Host Media Processing (HMP) were studied. One new model of communication using HMP, which combined SIP and MS RCT as communication protocols, was proposed. The procedure of improving the identification of Dual Tone Multi Frequency (DTMF) under this model was provided, and the methods of reducing the transportation time of signal were informed.

Typical applications

CORBA-based implementation of invalidation detection mechanism in large scale transaction processing system

Xi-Ping HE

2008, 28(7):  1850-1853. 

Asbtract ( )   PDF (655KB) ( )  

Related Articles | Metrics

In order to manage the large scale transaction processing system more efficiently, XML implementation of invalidation detection mechanism in mornitoring system, based on Common Object Request Broker Architecture (CORBA), was discussed. The primary-slave invalidation detector was designed to realize service object invalidation detection, application sever invalidation detection, database invalidation detection were designed and realized. These mechanisms are under good condition in the practical running, and provide effective means to system monitoring.

Automatic generation of non-linear loop invariants

BI Zhong-Qin ZENG Zhen-Bing Yuan-Hua GUO

2008, 28(7):  1854-1857. 

Asbtract ( )   PDF (608KB) ( )  

Related Articles | Metrics

This paper proposed an approach to automatically generate non-linear loop invariants. An invariant of a loop was hypothesized as a parameterized polynomial. Based on the inductive assertion's properties, we reduced the non-linear loop invariant problem to a numerical constraint solving problem. All the solutions to these constraints were the non-linear loop invariants of the program. The approach has been implemented in Maple. The implementation has been used to automatically discover nontrivial invariants for many programs.

Use of RFID technology for indoor location

HUI-FANG DENG QI-PING MA

2008, 28(7):  1858-1860. 

Asbtract ( )   PDF (638KB) ( )  

Related Articles | Metrics

Radio Frequency IDentification (RFID) Technology and its different applications in various sectors, particularly, in the indoor location, were briefly introduced. The theory of LANDMARC indoor location system was improved to make it more realistic in use. The experimental results show that the improved algorithm yields an accuracy of 10%~50% higher than the original one does.

Research on the service-oriented solution for integrating WSN with grid

Lei PENG Lei WU Jia-zhi ZENG

2008, 28(7):  1861-1865. 

Asbtract ( )   PDF (680KB) ( )  

Related Articles | Metrics

The idea building Wireless Sensor Networks (WSN) system based on services and working via a uniform interface, referring to Service-Oriented Architecture (SOA), seems an intuitionistic way to integrate WSN with the grid seamlessly. This paper anatomized WSN architecture in forms of services first and presented a formal definition and verification of WSN services combination. Then the integration scheme was discussed, which involved gateway interface and service agent middleware. The scheme not only makes WSN and grid cooperate to meet the application needs by a friendly interface, but also effectively guarantee the QoS of WSN when attached to grids.

Virtual apparatus sharing platform based on SOA

LIU Zhi-Du CHENG Xin-Dang

2008, 28(7):  1866-1867. 

Asbtract ( )   PDF (518KB) ( )  

Related Articles | Metrics

Concerning the insufficiency of integrated level of virtual apparatus experiment teaching system between colleges, taking advantage of Service-Oriented Architecture (SOA) and Web services technology, and Web-based virtual apparatus technology, the interscholastic virtual apparatus experiment teaching sharing platform was designed and implemented in the.NET architecture, which found a solution to achieve the target for resource share of virtual apparatus experiment teaching system.

Model checking interactive Markov chains

XU Xiang WU jin-zhao Lin lian-nan Chen Jian-feng

2008, 28(7):  1868-1871. 

Asbtract ( )   PDF (591KB) ( )  

Related Articles | Metrics

Model checking algorithm was investigated for Interactive Markov Chains (IMC). IMC is a concurrent system model, combining functional feature and performance properties. Model checking is one kind of automatic function confirmation and the performance evaluation technology. The presented algorithm is a combination of traditional function confirmation and performance evaluation, and which is in consistency with the original algorithm. Experimental results have shown the algorithm can achieve a good performance and can be used to evaluate for large and complex systems.

Design and implementation of high resolution camera array oriented to 3DTV

Mao-Jun ZHANG Le LI Wei-Dong BAO Shu-Ren TAN

2008, 28(7):  1872-1874. 

Asbtract ( )   PDF (516KB) ( )  

Related Articles | Metrics

The resolution and frame rate of the video captured by the current camera arrays is not high enough to create the high quality 3DTV programs. We designed and implemented a high resolution camera array. It can be used to capture the video whose frame rate was 27fps and resolution was 1280×1024, or which frame rate was 93fps and resolution was 640×480. The two capture schemes can be chosen by the user applications. Some issues about the architecture, camera unit, synchronization control and real-time storage of the camera array were presented.

Study of e-government platform mechanism based on extension component

Xiao-Yuan Zhang

2008, 28(7):  1875-1877. 

Asbtract ( )   PDF (719KB) ( )  

Related Articles | Metrics

An e-government platform based on component was proposed to improve the low integration and un-extension of e-government strategy application in complex and distributed computation environment. Some key points about component model and extension mechanism were discussed in detail. The e-government divided its application requirement into different independent information service components by the decomposing norm and application logic to provide integrated and unified service of application management, data exchange and message transmission.

Reconfigurable statistical process control system based on SPSS

2008, 28(7):  1878-1881. 

Asbtract ( )   PDF (646KB) ( )  

Related Articles | Metrics

Aiming to meet the requirements that manufacturing enterprises need the digital Statistical Process Control (SPC) method with diversification and agility to be applied independently or integrated with other manufacturing information systems, a reconfigurable SPC system based on Statistical Package for the Social Science (SPSS) was proposed and implemented through analyzing and building SPC's domain model. The system introduced SPSS powerful statistical analysis functions to implement visual statistical analysis by referring SPSS components and executing SPSS Syntax commands. The component architecture and hot spots technology can meet the requirements of application mode reconstruction and configuration model reconstruction for SPC. At last an application instance is shown to confirm that the system with well usability provides a digital method and application platform for total quality management of manufacturing enterprises.

Study on acceleration technique for ADI-FDTD algorithm based on GPU

Yu Liu Hong-Chun Yuan Zheng Liang

2008, 28(7):  1882-1885. 

Asbtract ( )   PDF (817KB) ( )  

Related Articles | Metrics

With the advancement of Graphics Processing Unit (GPU) and the creation of its new feature of programmability, it has come possible to transfer some of the processing stages in general numerical algorithms from CPU to GPU in order to accelerate the computation. In this paper, starting from a brief introduction to Alternative Direction Implicit Finite Difference Time Domain (ADI-FDTD) algorithm, detailed introduction and analysis were given to the fundamentals and the key technique of GPU for accelerating ADI-FDTD computation, in combination with the implementation frame of the conjugate gradient method for solving linear equations system on GPU. Finally, some computed examples were presented, and various comparisons were made to prove the efficiency and accuracy of this acceleration approach.

Traffic incident detection system based on video image processing

Wang Qin

2008, 28(7):  1886-1889. 

Asbtract ( )   PDF (657KB) ( )  

Related Articles | Metrics

Concerning the traffic accident can not be detected effectively and accidents dealing delayed, a system for traffic incident detection and alarm based on video was presented. Using computer vision and digital image processing technology, the video images from the road monitoring camera were processed with intelligent detection algorithm processing, automatic acquire of various traffic parameters and traffic accidents, timely detection alarm. Thus accident dealing delay was reduced and the second incident was prevented. In comparison with the traditional traffic incident detection system, the system is intuitive convenient, low-cost, and has good market demand and practical value.

A novel approach for vehicle license plate location and tilt correction

2008, 28(7):  1890-1891. 

Asbtract ( )   PDF (476KB) ( )  

Related Articles | Metrics

In order to robustly locate vehicle license plate and correct tilt under different conditions, a novel approach for license plate location and tilt correction was proposed based on the feature matching of character. Considering that the primacy characteristic of the PRC license plates was Chinese characters, this approach got the Chinese character's position using standard Chinese characters of the PRC license plates based on feature matching. The Chinese character's position in the PRC license plates was fixed, thus, the proposed approach achieved license plate location and tilt correction using Chinese characters location. To demonstrate the effectiveness of the proposed approach, it conducted extensive experiments over a large number of real-world vehicle license plates. It reports that the proposed approach has high accuracy and robustness.

Fingerprint image enhancement using mixed filters

2008, 28(7):  1892-1895. 

Asbtract ( )   PDF (672KB) ( )  

Related Articles | Metrics

Accurate and reliable extraction of minutiae from the fingerprint images is an important work in the automatic fingerprint identification systems. Quality of fingerprint images and appropriate enhancement technique are critical for minutiae extraction. An orientation coherent map was calculated, and minimum coherent regions were determined as high-curvature areas and the others as low-curvature areas. This paper presented a new orientation filter to enhance fingerprint images in the low-curvature. The algorithm was adaptive. In the high-curvature areas, the orientation filter was not efficient for fingerprint image enhancement, so fingerprints were enhanced in frequency domain. Experimental results demonstrate the effectiveness and fast speed of the proposed method.

Blind signal extraction algorithm in overdetermined mixtures

2008, 28(7):  1896-1897. 

Asbtract ( )   PDF (267KB) ( )  

Related Articles | Metrics

Based on the signal kurtosis, a blind signal extraction algorithm was proposed in over-determined mixtures. Converting the mixture matrix into a series of Givens matrix identifications, the algorithm can extract signals one by one from the mixtures. When the all unknown independent components were separated, the other components were redundant signals that can be regarded as copies of one or some independent components. All source signals were separated while the algorithm was accomplished. The algorithm is easy to implement with fast convergent speed. Computer simulation confirms its validity.

Rapid algorithm of multi-block motion estimation for H.264

Yanfei Shen

2008, 28(7):  1898-1900. 

Asbtract ( )   PDF (461KB) ( )  

Related Articles | Metrics

The full search algorithm of H.264 multi-block motion estimation is highly time-consuming. The paper proposed a new multi-block algorithm by speculating motion estimation based on the characteristic of the image's spatial frequency. The results of the experiments show that our algorithm evidently reduces the complexity of motion estimation computing under the condition of keeping good image quality and high bit rate.