Table of Content

01 October 2012, Volume 32 Issue 10

Previous Issue    Next Issue

Network and communications

Optimal routing algorithm based on user experience estimation model

ZHANG Da-lu CAO Xiao-jing HU Zhi-guo

2012, 32(10):  2683-2688.  DOI: 10.3724/SP.J.1087.2012.02683

Asbtract ( )   PDF (1059KB) ( )  

References | Related Articles | Metrics

As a fast-growing contributor to Internet service, online videos make ISPs and video providers pay more attention to the Quality of user Experience (QoE). The existing routing algorithms could only guarantee that parameters of path such as delay and jitter, in accordance with the demands of Quality of Service (QoS) restriction. However, they are not able to reflect the QoE-related information directly. As a result, these kinds of algorithms cannot meet the demand of showing QoE. This paper proposed a QoE-optimal routing algorithm called QoE_DSP, based on QoE estimation model. By taking advantage of two properties of QoE parameter, decomposability and nondecreasing characteristics from the analysis on relationship between QoE and QoS, the authors designed QoE_DSP, which owned a polynomial time complexity of (V log V+E). According to the experiments and results analysis, this algorithm can guarantee the selected path meets the demand of QoE, while it also has a strong computational scalability.

Voronoi diagram-based sleeping algorithm in wireless sensor networks

DENG Yaping LIU Sa LIU Ya-fei

2012, 32(10):  2689-2691.  DOI: 10.3724/SP.J.1087.2012.02689

Asbtract ( )   PDF (495KB) ( )  

References | Related Articles | Metrics

The multi-coverage will appear with the sensors of Wireless Sensor Network (WSN) being randomly and high-densely distributed on the fields that will waste the energy of sensors and the entire network. Concerning this problem, a sleeping algorithm based Voronoi diagram was improved. Sleeping sensors were estimated and the energy of the whole network cost was reduced with calculating distance of sensors and their neighbors and distance of sensors and vertex of their Voronoi diagrams. The simulation results show that the improved sleeping algorithm can save energy of the whole network, and extend the lifetime of network.

Node localization algorithm of wireless sensor network in marine monitoring

REN Xiu-li HAN Jing-jing

2012, 32(10):  2692-2695.  DOI: 10.3724/SP.J.1087.2012.02692

Asbtract ( )   PDF (598KB) ( )  

References | Related Articles | Metrics

Focusing on the applications of wireless sensor networks in marine monitoring, a localization algorithm of sensor nodes based on Monte Carlo was proposed. The algorithm improved the location accuracy of the prediction stage by introducing the right angle of the sea motion; and revised the prediction coordinates by the confidence of the prediction coordinates which was gained through the nodes perception of pressure. The simulation results show the proposed algorithm has outstanding performance compared with traditional methods under conditions of different node density, seed density, moving speed and time.

Cluster head election based on trust mechanism in wireless sensor network

WANG Wei-long MA Man-fu

2012, 32(10):  2696-2699.  DOI: 10.3724/SP.J.1087.2012.02696

Asbtract ( )   PDF (617KB) ( )  

References | Related Articles | Metrics

The cluster head election of current Wireless Sensor Network (WSN) mainly relies on energy and location, but ignores the trust. In this paper, using the trust as the basis of reliability and with the energy as the priority, trust value was considered to improve the system reliability. Meanwhile, an election generates more candidate nodes, every node bears cluster head in turn, so it reduces the frequency of the election and improves the efficiency of the election of cluster head. Thus, a Cluster Head Trust Elections (CHTE) based on trust and energy was proposed. The experiments show that the electing algorithm is efficient on data packet correctness of sink node and Mean Time Between Failures (MTBF) within WSN environments.

Lower energy adaptive clustering hierarchy routing protocol for wireless sensor network

LI Ling WANG Lin ZHANG Fei-ge WANG Xiao-zhe

2012, 32(10):  2700-2703.  DOI: 10.3724/SP.J.1087.2012.02700

Asbtract ( )   PDF (635KB) ( )  

References | Related Articles | Metrics

Lower Energy Adaptive Clustering Hierarchy (LEACH) protocol randomly and circularly selects the cluster-head node and evenly distributes network energy consumption to each sensor node, but it does not consider the remaining energy of each node. In order to avoid premature death of the less energy node that was selected as the cluster-head node, an advanced algorithm named LEACH-New was proposed,which was based on the energy probability to select those nodes with more energy as cluster-head and to determine the optimal number of the cluster-head nodes. The cluster-head node collected, fused, then sent the data to the base station by the combined mode of single-hop and multi-hop. This algorithm resolved the problem that less energy node was selected to be cluster-head and cluster-heads energy overloaded in LEACH protocol, so it can prolong the lifetime of whole network. The simulation results show that the improved algorithm effectively reduces the network energy consumption and ensure network load balance.

Vertical handoff algorithm based on fuzzy logic control

WANG Jia

2012, 32(10):  2704-2706.  DOI: 10.3724/SP.J.1087.2012.02704

Asbtract ( )   PDF (485KB) ( )  

References | Related Articles | Metrics

In order to meet different needs of users, more and more factors need considering in the vertical handoff algorithm. Hence, time that handoff decision needs prolongs. Fast and efficient handoff decision cannot be achieved and the application of mobile node gets affected. Parallel fuzzy logic makes fuzzy inference on judgment factors at the same time, and decreases the number of fuzzy rules, then reduces the time of handoff decision. This paper chose some judgment factors to pass the parallel fuzzy logic, including network available bandwidth, users moving speed and cost of the network services, calculated the weights of judgment factors according to different service type of the users, and then calculated the score of the candidates networks based on the output of parallel fuzzy logic and the weight. The simulation results show that the proposed algorithm enhances the accuracy of handoff, reduces the unnecessary handoff, and improves the performance of system.

Echo cancellation based on blind source separation

WANG Zhu-yi YANG Jian-po YIN Yong-chao WANG Zhen-chao

2012, 32(10):  2707-2710.  DOI: 10.3724/SP.J.1087.2012.02707

Asbtract ( )   PDF (571KB) ( )  

References | Related Articles | Metrics

An echo cancellation method on digital repeater of mobile communication system was presented to solve the problem of traditional adaptive filter, which cannot eliminate the sub-path echo in complex multipath channel. Firstly, based on phase space reconstruction theory, the signal that came from the donor antenna and contained echo was reconstructed; hence, the number of sensors was not fewer than the number of sources in blind source separation. Secondly, Independent Component Analysis (ICA) algorithm was used to separate reconstructed signal. Finally, desired signal was determined by the correlation of sent signal and separated signal. In the experiment on the multi-carrier Global System of Mobile communication (GSM) source with complex multipath echo, correlation coefficient of desired signal was up to 0.9593. The echo cancellation method based on blind source separation proves to be an effective way to eliminate the echo in complex multipath channel.

Detection and defense scheme for selective forwarding attacks in wireless sensor network

FU Xiang-yan LI Ping WU Jia-ying

2012, 32(10):  2711-2715.  DOI: 10.3724/SP.J.1087.2012.02711

Asbtract ( )   PDF (956KB) ( )  

References | Related Articles | Metrics

To improve the detection rate for malicious node and the defensive ability of system,a detection method based on optimal random routing algorithm and neighbor node monitoring was proposed, which was against the selective forwarding attack about Wireless Sensor Network (WSN). This method created the forward path by introducing some parameters such as distance, trust degree, etc. At the same time, it also used the node monitor scheme to detect and defend malicious node during the routing discovery and selection process. Simulation was completed at Matlab environment and performance comparison was done with other methods. Analysis and simulation results show that this method is effective for detecting selective forwarding attack and can ensure reliable packets delivery to destination using relatively less energy.

Passive queue management algorithm based on synchronized queue

XIE Li-chun

2012, 32(10):  2716-2718.  DOI: 10.3724/SP.J.1087.2012.02716

Asbtract ( )   PDF (405KB) ( )  

References | Related Articles | Metrics

In order to mitigate the network congestion problem, a new passive queue management algorithm Drop Front n based on Synchronized Queue (DFSQ) was proposed by Drop Front. In this algorithm, the network queue length was deducted with synchronized queue, and drop packet probability and drop packet strategy were presented. Then, a simulation was conducted to research on the key influencing factors of queue length. The results show that, compared with Random Early Detection (RED) and Drop Tail algorithm, the performance of DFSQ is better.

Advanced computing

Task classification method oriented to cloud computing

CHEN Ting-wei ZHOU Shan-jie QIN Ming-da

2012, 32(10):  2719-2723.  DOI: 10.3724/SP.J.1087.2012.02719

Asbtract ( )   PDF (868KB) ( )  

References | Related Articles | Metrics

To improve the resource utilization, the task resource requirement features of processor, network, disk and so on were efficiently estimated through analyzing the way of the task request, measuring the performance of application program in task or simulating to run the task. Afterwards, according to the features of resource requirement, the tasks could be classified into processor bound task, communicate bound task, disk bound task and others. And then the classified tasks were integrated with specific virtual machines to make all kinds of resources to be used efficiently. The research shows that the method can classify the task efficiently. And compared to unclassified method, it can reduce the times of virtual machines migration or integration.

Sigmoid inertia weight adjustment strategy with particle spacing feedback for PSO

ZUO Xu-kun SU Shou-bao

2012, 32(10):  2724-2727.  DOI: 10.3724/SP.J.1087.2012.02724

Asbtract ( )   PDF (534KB) ( )  

References | Related Articles | Metrics

Concerning the problem that the standard Particle Swarm Optimization (PSO) algorithm in which inertia weight is global parameter, and cannot adapt to the complex and nonlinear optimization process, a Spacing Feedback Inertia Weight (SFIW) was proposed. Taking advantage of the characteristic that Sigmoid function can make the smooth transition between linear and nonlinear, an inertia weight function based on Logistic equation was constructed. In the process of optimization, the nonlinear coefficient of inertia weight function was adjusted according to the particle spacing to make the particle with longer particle spacing get larger inertia weight and make the particle with shorter particle spacing get smaller inertia weight. Therefore, the local exploitation and global exploration get balanced. Finally, the experimental results on several benchmark functions and the comparison with other algorithms show the effectiveness and feasibility of the SFIW-PSO.

Probability distribution estimation for Web service QoS based on max entropy principle

DAI Zhi-hua FU Xiao-dong HUANG Yuan JIA Nan

2012, 32(10):  2728-2731.  DOI: 10.3724/SP.J.1087.2012.02728

Asbtract ( )   PDF (629KB) ( )  

References | Related Articles | Metrics

To manage the risk of service, it is necessary to obtain stochastic character of Quality of Service (QoS) that is represented as accurate probability distribution. This paper presented an approach to estimate probability distribution of Web service QoS in the case of small number of samples. Using max entropy principle, the analytical formula of the probability density function can be obtained by transforming the probability distribution estimation problem into an optimal problem with constraints obtained from sampling QoS data. Then an algorithm to estimate parameters of the probability density function was designed. The experimental and simulation results based on real Web service QoS data show the effectiveness of the proposed approach for probability distribution estimation of different QoS attribute. The efficiency and feasibility of the distribution estimation algorithm have got validated by experiments too.

Analysis on improvement of particle memory in gravitational search algorithm

LI Chun-long DAI Juan PAN Feng

2012, 32(10):  2732-2735.  DOI: 10.3724/SP.J.1087.2012.02732

Asbtract ( )   PDF (517KB) ( )  

References | Related Articles | Metrics

As the gravitational search algorithm plays bad performance in search accuracy of the complex issues,especially the poor search quality of standard Gravitational Search Algorithm (GSA) in the high dimensional function optimization. It is easy to get into premature convergence in the optimization process. Therefore, the idea of the particle swarm optimization algorithm was introduced to gravitational search algorithm, which was used to improve the memory of particles. The particle evolution is not only influenced by other particles in the space, but also by its own memory constraint, which is used to improve the ability of exploitation. The test of the 10 benchmark functions confirms the validity of the method.

Lock-free implementation of concurrent binary search tree

LIU Shao-dong XING Yong-kang LIU Heng

2012, 32(10):  2736-2741.  DOI: 10.3724/SP.J.1087.2012.02736

Asbtract ( )   PDF (806KB) ( )  

References | Related Articles | Metrics

A new scheme for unlocking implementation of concurrent Binary Search Tree (BST) based on asynchronous shared memory systems was provided in this paper. This scheme possessed two outstanding advantages: The deletion is wait-free, and the insertion is lock-free. The experimental results show that this scheme is highly scalable and can produce high throughputs under heavy load.

Iterated parallel diagonal dominant algorithm for tridiagonal systems

LI Tai-quan XIAO Bo-xun

2012, 32(10):  2742-2744.  DOI: 10.3724/SP.J.1087.2012.02742

Asbtract ( )   PDF (397KB) ( )  

References | Related Articles | Metrics

In parallel solving weak diagonal dominant tridiagonal systems, the approximate error of the Parallel Diagonal Dominant (PDD) algorithm cannot be ignored. An iterated PDD algorithm was presented. In the algorithm, the solution of the correction value was calculated by iterative method, and the computational accuracy was obviously improved. Through error analysis on the algorithm, an estimation formula of iteration number was derived for a given error tolerance. And the numerical experiment shows the validity. Based on the complexity analysis of the iterative and non-iterative PDD algorithm, the increase of iterative algorithm computational complexity is very small, but the communication complexity increases exponentially with the iteration number.

CWENO-type entropy consistent scheme for two dimensional scalar hyperbolic conservation laws

ZHENG Su-pei FENG Jian-hu LIU Cai-xia

2012, 32(10):  2745-2747.  DOI: 10.3724/SP.J.1087.2012.02745

Asbtract ( )   PDF (500KB) ( )  

References | Related Articles | Metrics

This paper advanced the Central Weighted Essentially Nonoscillatory （CWENO)-type entropy consistent schemes to simulate the two-dimensional conservation laws of the initial boundary value problem. The numerical results were analyzed and compared with the exact solutions. It is pointed out that the courant-friedrich-lewy can attain 0.6 and shock transition zone is one or two cells. The results indicate that the new numerical method in this paper has high-resolution and strong stability.

Information security

Reliable assurance model for distributed system survivability

GENG Ji CHEN Fei NIE Peng CHEN Wei QIN Zhi-guang

2012, 32(10):  2748-2751.  DOI: 10.3724/SP.J.1087.2012.02748

Asbtract ( )   PDF (619KB) ( )  

References | Related Articles | Metrics

The cooperative rollback recovery mechanism based on checkpointing is an effective mechanism for the survivability of distributed system. The existing cooperative rollback recovery mechanism based on checkpointing presumes that the communication channel is reliable. However, this assumption is not always true in actual application scenarios. For the actual application scenarios of distributed system, a reliable assurance model for the survivability of distributed system was proposed, based on the checkpointing-based rollback recovery mechanism. Through the creation of redundant communication channel and process migration mechanism, the proposed model assures the survivability of distributed system in actual application scenarios where the communication channel is not reliable.

Reputation incentive mechanism based on dynamic topology

LI Shao-jing

2012, 32(10):  2752-2756.  DOI: 10.3724/SP.J.1087.2012.02752

Asbtract ( )   PDF (786KB) ( )  

References | Related Articles | Metrics

In order to increase the rate of successful exchange, encourage peers to contribute their recourses actively, and make the P2P file sharing system develop continually, a dynamic topology based reputation was proposed. The peers in the P2P network were encouraged to contribute their recourses via the incentive mechanism, so the network would be running continually. These made P2P file sharing system work normally, and the capability of network would be increased. The simulation experiments and theoretical analysis of the reputation incentive mechanism prove that the mechanism is correct and valid. Compared with the former trust models, the reputation incentive mechanism has higher security and simplicity, and reaches the expected goal.

Packet marking algorithm with consistency probability based on router interface

YAN Qiao YAO Xi-yan

2012, 32(10):  2757-2760.  DOI: 10.3724/SP.J.1087.2012.02757

Asbtract ( )   PDF (623KB) ( )  

References | Related Articles | Metrics

Probabilistic Packet Marking (PPM) algorithm is an important method to prevent the Distributed Denial of Service (DDoS) attacks. But it has the weakest chain and the weak convergence of issues because of the repeated marking, as well as large amount of computation because of the fragmentation problem when reconstructing the path. A new marking algorithm — IDCPPM was proposed which was based on router interface (ID number) with a consistency probability. The algorithm enabled the marking information to reach the victims with a consistency probability .For its non-fragmentation, it effectively reduced the number of packets needed to reconstruct the path and reduce the complexity of the algorithm. Also it can be applied to IPv6. The theoretical analysis and experimental results prove the effectiveness of this method.

Hierarchical feature selection method for detection of obfuscated malicious code

ZHANG Jian-fei CHEN Li-fei GUO Gong-de

2012, 32(10):  2761-2767.  DOI: 10.3724/SP.J.1087.2012.02761

Asbtract ( )   PDF (1145KB) ( )  

References | Related Articles | Metrics

Obfuscated malicious codes can easily escape from being detected by the conventional static method. On the other hand, despite its high detection accuracy, the dynamic method usually expends a large amount of system resources. A hierarchical feature selection method was proposed to improve the detection accuracy with relative low system overhead, where the features were generated and subsequently selected on the oriented layer, the individual layer, the family layer and the global layer, respectively. By the layer-by-layer refinements, an appropriate trade-off between the feature redundancy and information omission was archived using the hierarchical feature selection method. The experimental results on the real-world datasets demonstrate that the proposed method yields high accuracy for detecting obfuscated malicious code, while has several advantages such as smaller size of required training samples and better generalization ability compared with the conventional feature selection methods.

Encryption algorithm based on double chaos system with mutual feedback

MAO Yong-yi WANG Yao

2012, 32(10):  2768-2770.  DOI: 10.3724/SP.J.1087.2012.02768

Asbtract ( )   PDF (604KB) ( )  

References | Related Articles | Metrics

In order to increase the security of the low dimensional chaotic encryption system while not affecting the performance, a composite chaotic encryption system based on Logistic mapping and Tent mapping was presented. Firstly, the secret-key sequences were generated based on two mapping with mutual feedback, which was used to encrypt the plaintext; at the same time, the number of chaotic iterations was changed through cipher-feedback, and the iterative process has certain randomness. The results show, compared with single Logistic chaotic encryption, the algorithm not only has a large key space, high encryption intension and good operation efficiency of low dimensional chaotic encryption system, but also can resist brute-force attack, statistical attack and phase diagrams attack effectively.

Security analysis of digital rights management system based on usage control

WANG Chang-da GONG Ting-ting ZHOU Cong-hua

2012, 32(10):  2771-2775.  DOI: 10.3724/SP.J.1087.2012.02771

Asbtract ( )   PDF (793KB) ( )  

References | Related Articles | Metrics

Through the research and analysis about the security mechanisms of the existing Digital Rights Management (DRM), a fine-grained Usage Control (UCON) plan separated rights from content was proposed in order to avoid being cracked now and then. Firstly, based on the concept of secret division, digital license has been divided into two sections to realize the separation of authentication and authorization management. Then temporary permission files were fine-grainedly granted to ensure that digital content can be dedicatedly controlled in usage. Finally integrity checks were used to improve the ability of anti-tampering attacks. The model checking results show that this plan and its policy can realize the design requirements and fairly satisfy the security requirements of DRM.

Digital watermarking algorithm based on structure of PDF document

ZHONG Zheng-yan GUO Yan-hui XU Guo-ai

2012, 32(10):  2776-2778.  DOI: 10.3724/SP.J.1087.2012.02776

Asbtract ( )   PDF (637KB) ( )  

References | Related Articles | Metrics

With the rapid development of digital product, the copyright protection of PDF documents has become a crucial research topic in the information security field. This paper analyzed the structure of PDF documents and the relative digital watermarking algorithms. In order to solve the problem that some large capacity text watermarking algorithms increase the size of the document, the authors proposed a digital watermarking algorithm based on the structure of PDF document. Considering the characteristics that end-of-line marker cannot be shown in the document, this algorithm managed to embed watermark through replacing end-of-line markers of the cross-reference table with a fixed format. The experimental results show that, the proposed algorithm can not only reach the standard of watermark capacity required by digital copyright protection, but also has good concealment and can resist statistics attack as well.

Adaptive high-capacity reversible data hiding algorithm for medical images

HUANG Bin SHI Liang DENG Xiaohong CHEN Zhi-gang

2012, 32(10):  2779-2782.  DOI: 10.3724/SP.J.1087.2012.02779

Asbtract ( )   PDF (603KB) ( )  

References | Related Articles | Metrics

A new reversible data hiding algorithm for medical images was proposed. The hidden information was embedded into Region Of Interest (ROI) and non-interest respectively. In ROI, an adaptive integer transform scheme was employed to enhance the embedding capacity and control distortions. And in Region of Non-Interest (RONI), the classical Least Significant Bit (LSB) method was used to keep the marked image’s quality. The experimental results show that, compared with previous works, the performance of the proposed method has been significantly improved in terms of capacity and image quality. The proposed method’s embedding capacity is between 1.2bpp and 1.7bpp, while the Peak Signal-to-Noise Ratio (PSNR) can maintain the 43dB or so. Moreover, the proposed method with high run efficiency can be applied into the practical hospital information system.

New implementation of 2-aidc finite state machines

LIN Zhi-qiang

2012, 32(10):  2783-2785.  DOI: 10.3724/SP.J.1087.2012.02783

Asbtract ( )   PDF (508KB) ( )  

References | Related Articles | Metrics

The structure of 2-adic Finite State Machine (2-adic FSM) was studied. To build the machine, multiple-input Galois Feedback with Carry Shift Register (FCSR) vanes were used as building blocks instead of the one-input vanes which were used in the old method. This leads to a new implementation method of 2-adic FSM. With this method, a general 2-adic FSM was transformed into an equivalent 2-adic FSM with integer matrices. Moreover, if there exist some entries whose denominators are not coprime in the same row of the input or the transition matrix, the length of the transformed 2-adic FSM is shorter than the one in the old method, thus reducing the number of registers.

Graphics and image technology

model on cartoon-texture decomposition based on curvelet transform and sparse representation

KANG Xiao-dong WANG Hao GUO Hong GUO Jun

2012, 32(10):  2786-2789.  DOI: 10.3724/SP.J.1087.2012.02786

Asbtract ( )   PDF (637KB) ( )  

References | Related Articles | Metrics

CT image denoising restoration is a basic procedure in medical image processing. Cartoon-texture decomposition method was extended in order to resolve the problems of computational difficulty and low precision while applying cartoon-texture models in medical image denoising. First, the structure of cartoon-texture model was described by curvelet transform. Second, the texture of cartoon-texture decomposition was described using more sparse dual-tree complex wavelet transform. Third, an image cartoon images-texture model was established by combining curvelet transform and sparse representation. The algorithms of cartoon-texture model were discussed at last. The simulation experimental results show that the new method can effectively resolve the problem of large amount of iterative calculation using medical image denoising algorithm, and the image quality after processing can be improved as well.

Salt and pepper noise detection algorithm based on directional median

CHEN Jian ZHENG Shao-hua

2012, 32(10):  2790-2792.  DOI: 10.3724/SP.J.1087.2012.02790

Asbtract ( )   PDF (693KB) ( )  

References | Related Articles | Metrics

To remove the salt and pepper noise in images effectively while preserving the detail, a salt and pepper noise detection algorithm based on directional median was proposed after analyzing merits and drawbacks of different slat and pepper noise detection algorithms. The algorithm divided the image into doubtful noise pixels and signal pixels in the first step. At the second step, the algorithm set nine directional detection areas in the 5×5 detection window centered on the doubtful pixels, and confirmed the noise pixels after comparing gray value of doubtful noise pixels and median gray value of the detection areas. The feasibility of the leak detection in the algorithm reduced load of subsequent processing. At the same time, the algorithm possessed low false detection rate which preserved the detail. The simulation results show the validity of the algorithm.

Image denoising algorithms based on Laplacian operator and image inpainting

TIAN Su-yun WANG Xiao-ming ZHAO Xue-qing

2012, 32(10):  2793-2797.  DOI: 10.3724/SP.J.1087.2012.02793

Asbtract ( )   PDF (850KB) ( )  

References | Related Articles | Metrics

Through the analysis of Partial Differential Equation (PDE), the image denoising algorithms based on Laplacian operator and image inpainting were designed for the processing of the polluted image by noise: Rudin-Osher-Fatemi (ROF) harmonical Laplacian algorithm and ROF harmonical inpainting algorithm, which were simply called RHL and RHI respectively. By analyzing the local features of the image, the ability of the ROF model in protecting image edges and the harmonical model in overcoming the "ladder effect", and the advantages of the Laplacian operator in enhancing edges, the first image denoising algorithm, RHL was designed. Meanwhile, the second algorithm RHI was designed by syncretizing the image inpainting model. The experimental results show that the two designed algorithms, RHL and RHI, have better performance visually and quantitatively than other algorithms, which combine the advantages of the ROF model and harmonical model in image denoising effectively. Compared with other PDE based algorithms, the two designed algorithms can remove noise, protect smooth region and edge information much better.

Skinning developable mesh surface of optimal topology

CUI Xiao-kun CHEN Ming

2012, 32(10):  2798-2801.  DOI: 10.3724/SP.J.1087.2012.02798

Asbtract ( )   PDF (887KB) ( )  

References | Related Articles | Metrics

In some industrial fields such as garments, shoes and metal building, it is often required to interpolate multiple specified set of skeleton curves using one loft developable surfaces (which can be developed onto plane without any distortion, tear or stretch). To solve this problem, one new algorithm based on Dijkstras algorithm was proposed to support the design of developable mesh surface: given multiple parametric curves, after adaptively sampling them, the objective is to search one globally optimal developable loft surface (given other specified objective surface energy function, varied corresponding loft mesh surfaces can be obtained of globally optimal topology). The problem was simplified into source route finding problem in Direct Acyclic Graph (DAG). The proposed algorithm is of practical engineering senses in designing loft surfaces in related engineering applications.

Three dimensional reconstruction algorithm based on uncalibrated multiple images

ZHAO Lu-lu GENG Guo-hua WANG Xiao-feng LIU Qian

2012, 32(10):  2802-2805.  DOI: 10.3724/SP.J.1087.2012.02802

Asbtract ( )   PDF (636KB) ( )  

References | Related Articles | Metrics

This paper proposed an algorithm for 3D reconstruction based on uncalibrated images. First, this algorithm detected the feature points by using Harris corners, and presented an improved bidirectional matching to match these feature points. Under the condition of the known camera parameters, the authors carried out 3D reconstruction of two images. Then the quaternion algorithm was adopted to transform coordinate. The results coming from different subsets were brought into a common coordinate frame, achieving 3D reconstruction of multiple images. Finally, bundle adjustment was used to optimize the results. The experimental results show that object structure can be well reconstructed by using this algorithm.

Curtain dynamic simulation based on particle constraint algorithm

HAN Li JIA Yue

2012, 32(10):  2806-2808.  DOI: 10.3724/SP.J.1087.2012.02806

Asbtract ( )   PDF (500KB) ( )  

References | Related Articles | Metrics

Concerning the cloth undulation in dealing with the super-elasticity, an improved particle constraint algorithm based on mass-spring model was presented. In an iteration cycle, it only adjusted the longest stretch spring, and the other over-stretched springs adaptively made the velocity change. The paper took curtain dynamic simulation as example to implement this algorithm, and the curtain flapped naturally in the wind. The experimental results demonstrate that the proposed algorithm can effectively avoid unrealistic undulation and has strong stability.

Real-time image fusion based on morphological un-decimated wavelets

DENG Miao ZHANG Ji-hong LIU Wei LIANG Yong-sheng

2012, 32(10):  2809-2813.  DOI: 10.3724/SP.J.1087.2012.02809

Asbtract ( )   PDF (928KB) ( )  

References | Related Articles | Metrics

An efficient Morphological Un-Decimated Wavelet (MUDW) transform with more delicate and accurate multi-scale decomposition performance that suites real-time image fusion was proposed. It took the average of dilation and erosion as the analysis operator, and the difference of adjacent scale images as the detail image. Size-increasing structure elements were adopted to get better fusion result. Due to the simplicity of dilation and erosion operator, computation time is shorter than other real-time algorithms. Furthermore, a factor was added during reconstruction, to obtain an obvious enhancement effect. The experimental results show that the new method outperforms other real-time algorithms.

Multi-feature fusion Camshift algorithm and its further improvement

LIN Jian-hua LIU Dang-hui SHAO Xian-kui

2012, 32(10):  2814-2816.  DOI: 10.3724/SP.J.1087.2012.02814

Asbtract ( )   PDF (687KB) ( )  

References | Related Articles | Metrics

The Camshift algorithm based on color-kernel can effectively track objects in a simple background, but it is easy to be interfered by illumination variation or the similar color object in the background. To improve the algorithms ability to respond to illumination variation, a multi-feature adaptive fusion scheme based on color, shape and texture was proposed. And further improvements have been proposed through modifying feature histogram and setting a reasonable search region to solve the problem of similar background. The experimental results show that the improved algorithm has higher tracking accuracy than traditional algorithm in the scene with illumination variation or similar background.

Electronic image stabilization algorithm using improved scale invariant feature transform

MENG Bo HAN Guang-liang

2012, 32(10):  2817-2820.  DOI: 10.3724/SP.J.1087.2012.02817

Asbtract ( )   PDF (720KB) ( )  

References | Related Articles | Metrics

In order to satisfy the real-time requirement of image stabilization, this paper proposed a new matching method based on the improved Scale Invariant Feature Transform (SIFT) features. The presented method extract the key points of the target within the space of a single scale, and the formation of 34-dimensional feature vector, instead of the traditional SIFT algorithm to generate the 128-dimensional feature vector, so that the real-time of the algorithm was greatly improved, while maintaining the registration accuracy. At last, the improved SIFT features were used in the global motion estimation of the electronic image stabilization. The experiments verified the performance of the algorithm.

Fast image interpolation algorithm based on gradient

YANG He-meng HUANG Zhan-hua

2012, 32(10):  2821-2823.  DOI: 10.3724/SP.J.1087.2012.02821

Asbtract ( )   PDF (679KB) ( )  

References | Related Articles | Metrics

Traditional image interpolation algorithms have poor performance and most of the recently developed edge-directed interpolation algorithms are of high computation. To solve those problems, a fast image interpolation algorithm based on gradient distribution detection was proposed. The basic idea was to detect the existence of edges in each 3×3 neighbourhood of the original low-resolution image by calculating its two-step gradients. If an edge existed, adaptive weighted factor up to edge strength was obtained by calculating its one-step gradient, and then the weighted linear interpolation was implemented. Otherwise, bilinear interpolation was carried through in that neighbourhood. The experiments show that the proposed algorithm is able to not only keep the subjective visual quality of the interpolated high-resolution image with whole clarity and edge smoothness, but also reduce the operation time by at least 20% compared with the equivalent algorithms now available. It contributes to an image enlargement application in embedded systems.

Moving object detection based on SIFT features matching and K-means clustering

LI Guang FENG Yan

2012, 32(10):  2824-2826.  DOI: 10.3724/SP.J.1087.2012.02824

Asbtract ( )   PDF (517KB) ( )  

References | Related Articles | Metrics

It is a difficult and hot topic in video surveillance to detect moving objects with moving camera．In order to detect moving objects effectively,according to the characteristics of the different speed between the background and moving target, a method was proposed based on Scale Invariant Feature Transform （SIFT） features matching and K-means clustering．The SIFT features of the two adjacent frames in the video were extracted and matched firstly. After that the velocity of the matched SIFT features were computed. Finally the K-means clustering method was used to analyze the SIFT features of the moving objects and background and experiments were done in the cases of single moving object and multiple moving objects and when the camera was rotated. The experimental results demonstrate that, the proposed method can detect targets effectively and remain the stable local features of targets in moving background and have good adaptability to changing illumination and camera movement and rotation．

Color image feature extracting method with small space occupying and fast speed

LUO Chan-juan ZHU Jia-gang LU Xiao

2012, 32(10):  2827-2831.  DOI: 10.3724/SP.J.1087.2012.02827

Asbtract ( )   PDF (779KB) ( )  

References | Related Articles | Metrics

A new method for color image feature extraction was proposed in order to effectively reduce the space occupying of the existing similar algorithms, so that such type of algorithms can be used in the computing environment with only limited computing ability and space. First of all, Non-Iteration Bilateral projection based Two Dimensional Principal Component Analysis (NIB2DPCA) was employed to extract feature information from three channels of a given color image respectively. Then the three pre-extraction feature matrices of the color image was reconstructed to form a two dimensional matrix. After that, NIB2DPCA was again employed to extract features of the matrix to obtain the final features. Finally,the nearest neighbor classification was employed to verify the performance of the method. A large number of experimental results on CVL and FEI face databases show that the color image data is efficiently compressed so the memory space occupying is reduced by more than two orders of magnitude as the result of the twice feature extraction. The calculation time is largely reduced and the calculation speed is largely improved due to the reduced memory space occupying, while the recognition rate is still significantly increased.

New algorithm of remote sensing image classification based on K-type support vector machine

WANG Jing HE Jian-nong

2012, 32(10):  2832-2835.  DOI: 10.3724/SP.J.1087.2012.02832

Asbtract ( )   PDF (879KB) ( )  

References | Related Articles | Metrics

In order to improve the accuracy and recognition speed of the remote sensing image classification, this paper put forward a new algorithm of remote sensing image classification based on K-type Support Vector Machine （SVM）,and this algorithm used texture features extracted by gray level co-occurrence matrix combined with the spectral ones for classification. The classification simulation tests were done with two groups of Landsat ETM+data. The results show that the new algorithm can improve the accuracy and efficiency of the classification, raise generalization ability, and K-type SVM is a superior classifier to the Radial Basis Function (RBF) SVM.

Visibility enhancing algorithm based on optical imaging model for underwater images

GUO Xiang-feng JIA Jian-fang YANG Rui-feng GE Zhong-feng

2012, 32(10):  2836-2839.  DOI: 10.3724/SP.J.1087.2012.02836

Asbtract ( )   PDF (739KB) ( )  

References | Related Articles | Metrics

To overcome the problems of underwater images such as fuzzy texture details, low contrast and non-illumination, the underwater images imaging process was first analyzed and then a visibility enhancing algorithm was proposed. Underwater image optical imaging model was used in the low-frequency sub-band, where image with medium scattering light was estimated and eliminated using Gaussian blur, and then attenuation factor was adjusted based on local complexity method to enhance adaptively low frequency sub-image. Non-linear transform for enhancing image was used in the high-frequency sub-band, which further enhanced the high frequency information and effectively restrained the noise magnification. The experimental results show that the algorithm can effectively deal with the problem of image blurring and non-illumination, and the running time is less than that of restoration algorithm for degraded underwater images based on wavelet transform.

Image retrieval based on combined features of interest points

SONG Zhen YAN Yong-feng

2012, 32(10):  2840-2842.  DOI: 10.3724/SP.J.1087.2012.02840

Asbtract ( )   PDF (652KB) ( )  

References | Related Articles | Metrics

Due to the spatial distribution expression power of the ring areas, this paper proposed a new image retrieval algorithm based on color feature and texture feature of interest points, introducing the ring area into the Gabor wavelet texture features. At first, this algorithm used adaptive smoothing filter to eliminate noises and detected interest points by the Speeded Up Robust Feature (SURF) operator. Then, it calculated the color histogram and texture feature of interest points in the ring area, as images combined features. Finally, it output similar images according to the similarity of the combined features. The experimental results show that this algorithm improves the average retrieval accuracy by more than 7%.

Multi-threshold image segmentation based on combining Fisher criterion and potential function

ZHANG Xin-ming LI Zhen-yun ZHENG Ying

2012, 32(10):  2843-2847.  DOI: 10.3724/SP.J.1087.2012.02843

Asbtract ( )   PDF (805KB) ( )  

References | Related Articles | Metrics

The traditional multi-threshold image segmentation method has high complexity and the results are poor. In order to solve the problems, a new multi-thresholding method based on combining Fisher criterion and potential function was proposed. First, the Fisher criterion function was simplified and a recursive algorithm was used to reduce the computational complexity. Then the number of segmentation class was obtained by utilizing the histogram potential function method. Finally, the simplified Fisher criterion function was used for multi-thresholding and the segmentation results were further processed. The experimental results show that compared with the traditional multi-thresholding methods, the proposed method has better segmentation performance and that its running time is less. It can be used in the real-time applications.

New image edge detection model based on fractional-order partial differention

JIANG Wei DING Zhi-quan LIU Ya-wei

2012, 32(10):  2848-2850.  DOI: 10.3724/SP.J.1087.2012.02848

Asbtract ( )   PDF (703KB) ( )  

References | Related Articles | Metrics

The effect of existing methods for image edge detection is not ideal,and the detected image edge may be fuzzy. Therefore, combining fractional-order differentiation theory with the existing Laplacian operator method, a new image edge detection model based on fractional-order differentiation was proposed. Compared with the existing integer-order differentiation edge detection methods, the experimental results show that the model, not only can detect the image edge well, but also have a certain effect on noise. It can detect more texture detail information especially for texture rich images. It is an effective method for edge detection.

Sketch drawing method with hierarchical sketch texture

LI Zhi-hui FAN Tie-sheng TANG Chun-ge LIU Lei

2012, 32(10):  2851-2854.  DOI: 10.3724/SP.J.1087.2012.02851

Asbtract ( )   PDF (804KB) ( )  

References | Related Articles | Metrics

The existing technique of computer Non-Photorealistic Rendering (NPR) on sketch drawing always has some differences from hand-drawing. In order to solve the problem, a method was designed which can generate sketch levels, and integrate with multi-pixel-wide lines to generate sketches which has sketch texture with sense of hierarchy. First, pretreat the original image by denoising and enhancement, adopt differentiation to extract multi-pixel-wide contour lines, use dilation and erosion and subtract the result to generate multi-layer bilateral of contour lines, then take the processing of motion-blur to multi-layer bilateral of contour lines to generate sketch texture, and finally, integrate edge and sketch texture, thus completing images sketching. Through lots of experiments on images of different features, it is proved that the results of the method are more close to hand-drawing style.

Structural similarity index measurement-noise shaping algorithm and its application in image coding and transmission

FENG Tao LYU Jun-bai

2012, 32(10):  2855-2858.  DOI: 10.3724/SP.J.1087.2012.02855

Asbtract ( )   PDF (721KB) ( )  

References | Related Articles | Metrics

A proposed form of Structural Similarity Index Measurement-Noise Shaping （SSIM-NS） based on dual-tree wavelet transform algorithm was set up and applied in image coding and transmission. The algorithm investigated that Structural Similarity Index Measurement （SSIM） was introduced into the traditional noise shaping process after the dual-tree wavelet transform, adaptively adjusted the gain factor to aggregate image energy to the maximum and diminished the number of wavelet coefficients. Then SPIHT algorithm was applied to encode the coefficients after the noise shaping and transmission. The experimental results show that the proposed algorithm could effectively cut the number of wavelet coefficients and aggregate energy of the image, and it has better results for the image coding quality and provides higher Peak Signal-to-Noise Ratio （PSNR） value of the reconstructed image at low bit rate.

Lossless video compression method based on fuzzy logic

XING Long-ping LI Dong-hui HU Chuan-chuan

2012, 32(10):  2859-2862.  DOI: 10.3724/SP.J.1087.2012.02859

Asbtract ( )   PDF (578KB) ( )  

References | Related Articles | Metrics

Lossless video coding is increasingly used because of the need of high quality videos in digital video areas. For this reason, a lossless video compression algorithm based on fuzzy logic was designed in this paper. It utilized fuzzy-logic-based method to calculate the correlation between two subblocks from neighbor frames and the interior correlation in the subblock, which can be used to decide the selection between temporal prediction and spatial prediction. A new matching rule of motion estimation was defined in temporal prediction. At last, the correlation can be adopted to estimate the parameter of Golomb coding and realize fast and efficient Golomb coding without complex calculation of estimation. The experimental results show that the proposed method has significant improvement in coding efficiency compared with the JPEG-LS.

Artificial intelligence

Survey on program algorithm recognition research

LU Qiang LI Xiao-lian WANG Zhi-guang

2012, 32(10):  2863-2868.  DOI: 10.3724/SP.J.1087.2012.02863

Asbtract ( )   PDF (1015KB) ( )  

References | Related Articles | Metrics

Program Algorithm recognition (PAC), which is a subfield of program understanding research, can identify and recognize algorithm from source code. In order to analyze the problem of PAC, firstly, the formal definition of PAC and its implementation procedure were introduced. Then, the various methods of PAC implementation, which are from program understanding, were presented according to specific category. Meanwhile, the roadmaps of those methods were explained. At last, those methods were analyzed and compared, and the future work of PAC will focus on the source code from Internet environment.

Service composition in cloud manufacturing based on adaptive mutation particle swarm optimization

LIU Wei-ning LI Yi-ming LIU Bo

2012, 32(10):  2869-2874.  DOI: 10.3724/SP.J.1087.2012.02869

Asbtract ( )   PDF (959KB) ( )  

References | Related Articles | Metrics

To cope with Multi-objective Programming on Manufacturing Cloud Service Composition (MOP-MCSC) problem in cloud manufacturing (CMfg) system, a mathematical model and a solution algorithm were proposed and studied. Firstly, inspired by the resource service composition technology in manufacturing grid, a QoS-aware MOP-MCSC model in CMfg system had been explored and described. Secondly, by analyzing the characteristics of manufacturing cloud services according to the domain knowledge of manufacturing, an eight-dimensional QoS evaluation criterion with corresponding quantitative calculation formulas was defined. Then, the QoS expression of manufacturing cloud service was eventually formulated. Lastly, the MOP-MCSC model was built, and an Adaptive Mutation Particle Swarm Optimization (AMPSO) was designed to realize this model. The simulation experimental results suggest that the proposed algorithm could solve the MOP-MCSC problem efficiently and effectively with a better performance than conventional particle swarm optimization.

Research on decentralized communication decision in multi-Agent system

ZHENG Yan-bin GUO Ling-yun LIU Jing-jing

2012, 32(10):  2875-2878.  DOI: 10.3724/SP.J.1087.2012.02875

Asbtract ( )   PDF (641KB) ( )  

References | Related Articles | Metrics

Communication is the most effective and direct method of coordinating and cooperating among multi-Agents, but the cost of communication restricts the use of this method. In order to reduce traffic subject in the coordination of Multi-Agent System (MAS), this paper put forward a heuristic algorithm, which would make Agents choose the observation that is beneficial to team performance to communicate. The experimental results show that choosing beneficial observation to communicate could ensure the efficiency of limited communication bandwidth and improve system performance.

Simulation of knowledge diffusion among enterprise clusters based on cognitive perspective

NIU Jia-yang WANG Hong-guo SHAO Zeng-zhen SONG Chao-chao

2012, 32(10):  2879-2883.  DOI: 10.3724/SP.J.1087.2012.02879

Asbtract ( )   PDF (801KB) ( )  

References | Related Articles | Metrics

In order to overcome the deficiency of the previous research on knowledge structures of enterprises, this paper proposed the knowledge diffusion model among enterprise clusters based on cognitive perspective Clusters of Enterprise Knowledge Transmission Model (CEKTM). The model proposed the definition of enterprise chromosome based on cognitive perspective and learned from ant colony path selection strategy, giving the learning strategies and knowledge interactive mechanism. The simulation results indicate that the knowledge structure within a cluster has cognitive proximity principle, and the similar knowledge structure has the higher knowledge transfer probability; too high or low enterprise chromosome dimension is not good to the improvement of average knowledge level for enterprise cluster; at the initial period, the small market environment is in favor of enterprise cluster development.

Improved Chameleon algorithm using weighted nearest neighbors graph

XUE Wen-juan LIU Pei-yu LIU Dong

2012, 32(10):  2884-2887.  DOI: 10.3724/SP.J.1087.2012.02884

Asbtract ( )   PDF (628KB) ( )  

References | Related Articles | Metrics

For the Chameleon algorithm using distance function to measure the similarity of data points, resulting in that the two proximate points may only have a few common characteristics, minimum half has practical difficulties, the merger needs artificial specified threshold value, and can not be revoked once the merger is completed. Therefore, the authors improved Chameleon algorithm and proposed a new Chameleon algorithm using Weighted Shared nearest neighbors Graph (WSnnG). Firstly, it measured the similarity by using the number of shared nearest neighbors, further constructed the WSnnG. Secondly, it resolved minimum half through the introduction of the network module evaluation function, then according to the structural equivalence similarity degree as a basis for merger. Finally, a new cohesion measure was discussed to solve problems that can not be revoked after the merger. The experimental results on UCI data sets and four two-dimensional artificial data sets show that the improved Chameleon algorithm using WSnnG has greatly improved in clustering accuracy and running time.

Feature selection algorithm based on multi-label ReliefF

HUANG Li-li TANG Jin SUN Deng-di LUO Bin

2012, 32(10):  2888-2890.  DOI: 10.3724/SP.J.1087.2012.02888

Asbtract ( )   PDF (596KB) ( )  

References | Related Articles | Metrics

The traditional feature selection algorithms are limited to single-label data. Concerning this problem, multi-label ReliefF algorithm was proposed for multi-label feature selection. For multi-label data, based on label co-occurrence, this algorithm assumed the label contribution value was equal. Combined with three new methods calculating the label contribution, the updating formula of feature weights was improved. Finally a distinguishable feature subset was selected from original features. Classification experiments demonstrate that, with the same number of features, classification accuracy of the proposed algorithm is obviously higher than the traditional approaches.

Heuristic ontology search mechanism based on user behavior

LI Jiang-hua ZHENG Jian

2012, 32(10):  2891-2894.  DOI: 10.3724/SP.J.1087.2012.02891

Asbtract ( )   PDF (618KB) ( )  

References | Related Articles | Metrics

In order to search domain ontologies needed by users in higher precision, a heuristic ontology search mechanism was proposed on the basis of analyzing demands for ontology search and studying user search behavior, which took full advantages of the different search keywords belonging to same domain input by different users for their different domain knowledge to realize heuristic extension for users search keywords and improvement for search matching. The experimental results show that the proposed approach could help users to search and get the relevant ontologies at a higher precision and recall.

Multi-semantic audio classification method based on tensor neural network

XING Ling HE Mei MA Qiang ZHU Min

2012, 32(10):  2895-2898.  DOI: 10.3724/SP.J.1087.2012.02895

Asbtract ( )   PDF (624KB) ( )  

References | Related Articles | Metrics

Researches on the audio classification have involved various types of vector features. However, multi-semantics of audio information not only have their own properties, but also have some correlations among them. Whereas, to a certain extent, the simple vector representation cannot represent the multi-semantics and ignore their relations. Tensor Uniform Content Locator (TUCL) was brought forward to express the semantic information of audio, and a three-order Tensor Semantic Space (TSS) was constructed according to the semantic tensor. Tensor Semantic Dispersion (TSD) can aggregate some audio resources with the same semantics, and at the same time, the automatic audio classification can be accomplished by calculating their TSD. And Radical Basis Function Tensor Neural Network (RBFTNN) was constructed and used to train intelligent learning model. For the problem of multi-semantic audio classification, the experimental results show that our method can significantly improve the classification precision in comparison with the typical method of Gaussian Mixture Model (GMM), and the classification precision of RBFTNN model is obviously better than that of Support Vector Machine (SVM).

Multi-instance prototype selection and active learning combined with textual information in image retrieval

LI Jing GUO Hong-yu

2012, 32(10):  2899-2903.  DOI: 10.3724/SP.J.1087.2012.02899

Asbtract ( )   PDF (825KB) ( )  

References | Related Articles | Metrics

For the poor precision of region-based image retrieval, Multi-Instance Learning (MIL) prototype selection algorithm and feedback mechanism with reference to textual information were proposed. In the process of instance prototype selection, textual information was used to extend the positive examples, and negative example distribution was used to select initial instances and the iterative optimization process of instance updating and classifier training were used to obtain the true instance prototypes. In the process of relevance feedback, active learning with the combined learning methods was adopted. The switch of active learning strategy was controlled by the information value in the feedback process. The experimental results show that this algorithm is feasible, and the performance is superior to other MIL algorithms.

Improved artificial fish swarm mixed algorithm for multimodal function optimization

DENG Tao YAO Hong DU Jun

2012, 32(10):  2904-2906.  DOI: 10.3724/SP.J.1087.2012.02904

Asbtract ( )   PDF (601KB) ( )  

References | Related Articles | Metrics

In order to deal with the problems of inefficient searching and low accuracy of Artificial Fish Swarm Algorithm （AFSA） for multimodal function optimization, an improved AFSA for multimodal function optimization was proposed. In the algorithm, the strategy of the survival of the fitter suppression was adopted, eliminating artificial fish which was situated in food with low concentration of similar artificial fish to select elite artificial fish swarm. Optimization for swarming behavior and following behavior contributed to artificial fish careful search in a new optimization trajectory to enhance its local search capacity. Modifying for preying behavior, artificial fish was avoided sinking flat position. In combination with Pattern Search Method (PSM), its local accuracy search capacity was enhanced. The simulation results indicate that the proposed algorithm has stronger global optimization and local optimization capabilities, and the search for each optimal solution accuracy has reached the ideal value, and it is able to be used for complex multimodal function optimization.

Research of equation solution algorithm about Sudoku puzzle

XIAO Hua-yong CHENG Hai-jiao WANG Yue-xing

2012, 32(10):  2907-2910.  DOI: 10.3724/SP.J.1087.2012.02907

Asbtract ( )   PDF (491KB) ( )  

References | Related Articles | Metrics

It began with the requirement of Sudoku to establish the system of equations. The solution of equation system was equivalent to the original Sudoku. And many mathematical properties were derived from equation system, including candidates elimination techniques, unique determination property, contradiction property and invariance property. It also illustrated that the artificial deductive rules included these properties. Finally this paper proposed a algorithm which calculated the solution of equation system from these properties. The algorithm used a three-dimensional matrix to express the candidate matrix of an unsolved Sudoku, and according to the above properties the candidate matrix could be deleted until Sudoku was solved. The algorithm can resolve many difficult Sudoku puzzles. Two difficult Sudoku puzzles were demonstrated and solved easily with the method in this paper, which shows the method is very effective.

Differential evolution with self-accelerated property and variable neighborhood search

ZHAO Yang HE Yi-chao LI Xi

2012, 32(10):  2911-2915.  DOI: 10.3724/SP.J.1087.2012.02911

Asbtract ( )   PDF (822KB) ( )  

References | Related Articles | Metrics

The evolutionary mode of Differential Evolution (DE) was analyzed, and modified differentiation operator and selection operator with self-accelerated characteristic were proposed. Then the Self-Accelerated and Variable Neighbourhood searching of Differential Evolution (SAVNDE) algorithm was advanced using these new operators and variable neighbourhood search which improved the local search ability of algorithm. On the basis of the three evolution models, the simulation results on five classical benchmark functions show that SAVNDE has the same convergence rate of DE, and can achieve more optimization results in shorter time.

Improved AdaBoost ensemble approach based on loss function

LEI Lei WANG Xiao-danWANG

2012, 32(10):  2916-2919.  DOI: 10.3724/SP.J.1087.2012.02916

Asbtract ( )   PDF (559KB) ( )  

References | Related Articles | Metrics

As to the issue that the weight expansion for hardest samples can cause imbalance when updating the training sample in AdaBoost algorithm, an improved approach based on the Loss Function (LF) of the different patterns, namely, LF-AdaBoost, was proposed. The weight tuning was affected not only by the training error, but the performance of base classifiers for different classes, thus avoiding the excessive concentration phenomenon. The results based on UCI data sets and different base classifiers have shown that the approach can improve the speed of convergence and overcome the imbalance, as well as promote the generalization ability of ensemble classifier.

Intelligent method for word grouping based on frequent pattern mining in Uyghur language

TUERDI Tuoheti WEINILA Mushajiang AISIKAER Aimudula

2012, 32(10):  2920-2922.  DOI: 10.3724/SP.J.1087.2012.02920

Asbtract ( )   PDF (657KB) ( )  

References | Related Articles | Metrics

It is very easy to get the words in Uighur text lines by the natural delimiters such as spaces, but it is difficult to obtain the completely structured semantic words. Therefore,many kinds of text processing methods always seem not to be very effective. This paper put forward a new concept of Uyghur word grouping and introduced the frequent pattern mining method in data mining scheme, and combined the Uyghur language features, turned the pattern mining problem without prior knowledge into a pattern matching with special pattern, and proposed a fast and efficient frequent pattern mining algorithm to obtain the Uyghur words with complete semantics. The experimental results show that, words obtained by this algorithm are stable in structure, and semantically complete and independent.

Phrase based Uyghur language text categorization

ALIMJAN Aysa TURGUN Ibrahim KURBAN Obul LI Zhe

2012, 32(10):  2923-2926.  DOI: 10.3724/SP.J.1087.2012.02923

Asbtract ( )   PDF (618KB) ( )  

References | Related Articles | Metrics

Text representation is the most important phase in automatic text categorization. In the Vector Space Model (VSM) based text representation, the selection of feature granularity has the direct impact on the text categorization performance. The statistical approach based Uyghur phrase extraction algorithm was proposed and the Uyghur text categorization experiments was conducted using Support Vector Machine (SVM) algorithm based on the extracted phrases as text features. The experimental results show that the phrase based Uyghur text categorization achieves higher classification precision and recall compared to the word based categorization.

Optimization algorithm of electronic system condition monitoring data

YANG Sen MENG Chen WANG Cheng

2012, 32(10):  2927-2930.  DOI: 10.3724/SP.J.1087.2012.02927

Asbtract ( )   PDF (631KB) ( )  

References | Related Articles | Metrics

To solve the redundancy and high-dimensional problem of the electronic system condition monitoring data, a monitoring data optimization algorithm that combined the sample optimization and features optimization was put forward. Firstly, monitoring data samples were optimized by feature space sample selection algorithm, and the most representative samples were found; then monitoring data characteristics were optimized by KPCA-EDA algorithm after the sample optimization. More recognition information was retained on guarantee that the feature information was enough. Finally, a filter circuit was taken as an example to simulate, and the result shows that this method is effective.

Typical applications

E-commerce reputation alliance profit distribution based on Shapley value method with cloud gravity center

LU Zhi-gang ZHANG Xiao-xu

2012, 32(10):  2931-2934.  DOI: 10.3724/SP.J.1087.2012.02931

Asbtract ( )   PDF (798KB) ( )  

References | Related Articles | Metrics

Because the three major allocation factors of the e-commerce reputation alliance, the reputation capability, reputation costs and reputation risk are so fuzzy and random that it is difficult to quantify, and also because Shapley value method exists inherent limitations, the cloud gravity center judgment was used to revise Shapley value. The cloud theory that is mainly applied to uncertainly conversion between the qualitative and quantitative issues provides effective solution to the concept of fuzziness and randomness. Revised Shapley distribution method effectively improved the accuracy of the allocation of the e-commerce reputation Alliance. The rationality and applicability of this method were confirmed by using concrete example. This method provides the basis for the distribution of profit of the e-commerce reputation alliance.

Real-time data stream analysis and entire process quality monitoring based on plant information

BIAN Xiao-yong ZHANG Xiao-long YU Hai

2012, 32(10):  2935-2939.  DOI: 10.3724/SP.J.1087.2012.02935

Asbtract ( )   PDF (793KB) ( )  

References | Related Articles | Metrics

This paper proposed a solution to do research on real-time data stream analyzing and entire process quality tracing based on PI (Plant information) in order to solve these problems that the production information was blocked and product quality was unable to be traced in the steel production. The proposed solution focused on real-time data stream partition and process monitoring, and presented statistical monitoring methods based on Statistical Quality Control (SQC) charts and process capability indices. Furthermore, a product technique and quality monitoring system was developed. The applied results indicate the implementation of real-time data stream analysis and product quality monitoring based on PI can efficiently monitor production process quality, the identification and improvement of key production technology as well.

Simulink-based uncertain abnormal pattern recognition of quality control chart

HOU Shi-wang ZHU Hui-ming LI Rong

2012, 32(10):  2940-2943.  DOI: 10.3724/SP.J.1087.2012.02940

Asbtract ( )   PDF (559KB) ( )  

References | Related Articles | Metrics

The control chart is in uncertain abnormal state when the plotted-point is close to the critical value, or the number of points is close to the prescriptive target, or there is concurrence of many abnormities. The traditional methods are hard to complete the pattern recognition. Considering the concurrence of trend pattern and cycle pattern, the original control chart signal was decomposed by wavelets. The different abnormal signals were reconstructed with appropriate wavelet coefficients. By curve fitting, the goodness of fit to the reconstruction wavelets was taken as the characteristic number of abnormal pattern. Then the occurrence degrees of uncertain patterns were calculated by inputting the characteristic numbers into membership function of corresponding patterns. The simulation model of this approach was developed under Matlab/Simulik. Finally, an application example was given and the result shows the feasibility of this approach.

Model predictive control and PID control on servo motor

HUANG Yu-chuan QU Dao-kui XU Fang REN Xiao-lei

2012, 32(10):  2944-2947.  DOI: 10.3724/SP.J.1087.2012.02944

Asbtract ( )   PDF (554KB) ( )  

References | Related Articles | Metrics

With the purpose of stabilization control of servo motor, according to the dynamic matrix control principle, a servo motor control scheme was put forward using dynamic matrix control and Proportion-Integration-Differentiation （PID） control. Then, the unification model for direct/alternating servo model was analyzed; dynamic matrix control was used to design the current loop; rise time and stabilization value were used to form equivalent inertial element, and PID method was used to realize the control of speed loop and position loop. The calculation and simulation results show that the constant time of equivalent inertial element is in the inverse ratio of -ln(0.386); that the controller designed by PID mixed with Model Predictive Control (MPC) can well make the servo motor run smoothly and fast.

Railway freight volume prediction based on grey neural network with improved particle swarm optimization

LEI Bin TAO Hai-long XU Xiao-guang

2012, 32(10):  2948-2951.  DOI: 10.3724/SP.J.1087.2012.02948

Asbtract ( )   PDF (731KB) ( )  

References | Related Articles | Metrics

Concerning the shortcomings of the methods which forecast railway freight volume, the paper proposed Grey Neural Network (GNN) based on the Improved Particle Swarm Optimization algorithm (IPSO-GNN). To make up for the shortfall of the conventional GNN and guarantee the prediction accuracy, it optimized the GNN whitening parameters through the IPSO. And it computed the railway freight volume and the correlation degree of influential factors. It built a railway freight volume model based on IPSO-GNN with six relating factors. The simulation results show that the prediction method is effective and feasible. The prediction precision of the given model in the railway freight volume forecast is better than those of the conventional GNN prediction method and other prediction methods.

Application of ant colony algorithm for parameter optimization of water demand prediction model

HOU Jing-wei KONG Yun-feng SUN Jiu-lin

2012, 32(10):  2952-2955.  DOI: 10.3724/SP.J.1087.2012.02952

Asbtract ( )   PDF (796KB) ( )  

References | Related Articles | Metrics

To improve forecast accuracy of water demand when using Projection Pursuit (PP) model which are high-dimensional, non-normality and nonlinear, an Ant Colony Algorithm (ACA) was used for the parameter optimization of the model. ACA was improved to self-adaptive control pheromone on the grids divided by definitional domains of the model parameters. A case for water demand prediction was emulated according to the improved ACA and PP model. Then prediction accuracy from the improved ACA was compared with the results from Artificial Immune Algorithm (AIA) and BP Artificial Neural Network (BPANN) model, respectively. It is shown that: 1) the absolute relative errors of fitting accuracy are less than 2% from ACA and less than 10% from AIA and BPANN; 2) the absolute relative errors of prediction accuracy are less than 6%, 11% and 12% from ACA, AIA and BPANN, respectively; 3) ACA can converge to global optimal solution with higher convergence rate. Therefore, the improved ACA for optimizing the parameters of PP water demand prediction model is significantly better than the AIA and BPANN. This method can be applied to other similar high-dimensional and nonlinear problems.

Smith-immune predictive control for steel uncertain time-delay system

XU Xue-song OUYANG Yao

2012, 32(10):  2956-2959.  DOI: 10.3724/SP.J.1087.2012.02956

Asbtract ( )   PDF (582KB) ( )  

References | Related Articles | Metrics

Concerning the uncertainty of pure time delay system with disturbance such as steel temperature control, an evolutionary computation way based on immune feedback control was applied to Smith predictor. The way was based on the autoregressive moving average model and rolling horizon optimization by using immune clone selection, which avoided solving the Diophantine equations. It can adjust time-delay automatically and conduct a feed-forward compensation to optimize feedback error. The simulation result shows the effectiveness of the method, and shows it has a very good adaptability for interference and system modeling error. The application to steel temperature control has illustrated its excellent control effect.

Effective forecast of circular error probability in underwater robots

JI Da-xiong LIU Jian

2012, 32(10):  2960-2962.  DOI: 10.3724/SP.J.1087.2012.02960

Asbtract ( )   PDF (396KB) ( )  

References | Related Articles | Metrics

The navigation accuracy can not be tested through real experiments during the process of underwater robot design. How to forecast the Circular Error Probability (CEP) becomes an urgent problem. Therefore, linear track was used to test navigation accuracy. The sources of navigation error in linear track were presented. The expressions of errors in x-axis and y-axis were deduced. The deduced result shows that the CEP is smaller than the larger error in x-axis and y-axis if the ratio of errors is below 0.7.The CEP iterative equation was established. The results of real experiments indicate that the forecasted CEP is in accordance with actual experimental results. And the proposed method can effectively forecast the navigation accuracy of underwater robot.

Nonlinear analysis of ECG and HRV signals with two types of emotional states

YANG Min LIU Guang-yuan WEN Wan-hui

2012, 32(10):  2963-2965.  DOI: 10.3724/SP.J.1087.2012.02963

Asbtract ( )   PDF (638KB) ( )  

References | Related Articles | Metrics

According to the emotional states of calm and fear, some emotional information of the Electrocardiogram （ECG）data samples were collected, and researched in both emotional and emotionless states. By the analysis of scatter plots of QT-RR intervals, the 1/f distribution law of ECG signals spectrum and the poincare sections of Heart Rate Variability (HRV), the recognition rate of nonlinear characteristics with these two types of emotional states was calculated, and compared with the recognition rate of statistical characteristics. The results indicate that extracting nonlinear characteristics of ECG signals has a better recognition result compared with statistical characteristics when distinguishing emotional states and emotionless states.

Denosing of ECG signal based on FIR and aTrous wavelet transform

ZHONG Li-hui WEI Guan-jun SHI LiShi

2012, 32(10):  2966-2968.  DOI: 10.3724/SP.J.1087.2012.02966

Asbtract ( )   PDF (486KB) ( )  

References | Related Articles | Metrics

The weak and low-frequency Electrocardiogram （ECG） signals which can be used for disease diagnosis after preprocessing are susceptible to interference from the external environment. The wavelet decomposition and re-construction can not effectively filter out the 50Hz frequency and EMG interference of which the frequency band is the same with the ECG, the wavelet thresholding method can not effectively filter out the baseline drift, and this method can cause Pseudo-Gibbs phenomenon in the signal singular points. In order to denoise effectively, a wavelet denoising method based on aTrous algorithm was proposed in this paper, and this method was a comprehension of the wavelet reconstruction and decomposition, wavelet thresholding and 50Hz notch filter. The clinical ECG simulation results show that this method can effectively remove the ECG baseline drift, 50Hz frequency interference and EMG interference, while reducing the Gibbs phenomenon.

ECG waveform similarity analysis based on window-slope representation

LIU Tong-tong DAI Min LI Zhong-yi

2012, 32(10):  2969-2972.  DOI: 10.3724/SP.J.1087.2012.02969

Asbtract ( )   PDF (579KB) ( )  

References | Related Articles | Metrics

It is often difficult to classify Electrocardiogram （ECG） waveform automatically due to high similarity. A new feature representation of ECG waveform was proposed — window-slope method. In this method, an ECG waveform was divided into different windows in a plane, and the slope of maximum and minimum amplitude in a window was extracted as feature information to perform similarity analysis. The experimental results show that the method can not only reduce the dimension, but also can enlarge the difference between different types of waveforms under distance-based classification. The classification accuracy and efficiency can be improved by using the method; meanwhile the sensitivity and specificity of classification can be stabilized at a higher level.

Research on pressor strategy of Web application system load testing

WENG Lei-lei CAI Wan-dongCAI YAO Ye

2012, 32(10):  2973-2976.  DOI: 10.3724/SP.J.1087.2012.02973

Asbtract ( )   PDF (688KB) ( )  

References | Related Articles | Metrics

In view of the shortcomings of the existing pressor strategies in load testing, this paper proposed the index and linear combination pressor strategy, and the recording value detection pressor strategy. The effects of pressor strategies through the experiments were analyzed and compared. The experimental results show that the proposed method can improve the efficiency of the load testing.