基于几何匹配和分合算法的生物特征识别技术在公安视频监控中人脸识别的应用研究

目的研究基于几何匹配和分合算法的生物特征识别技术,及其在公安视频监控中人脸识别的应用。方法在图像分割部分,实现了经典的分合算法,并且使用成组算法改进了分合的效果。在人脸匹配部分,实现了基于眼睛和嘴的几何模型匹配,并对评价函数的构造进行了研究。结果通过对600个样本测试,正确检测率为88%,误检率为2%。结论实验证明,对于尺寸足够大的清晰的正面单个/多个人脸情形能够正确检测定位。

Exploring on Hierarchical Kalman Filtering Fusion Accuracy

Aim To analyze the traditional hierarchical Kalman filtering fusion algorithm theoretically and point out that the traditional Kalman filtering fusion algorithm is complex and can not improve the tracking precision well, even it is impractical, and to propose the weighting average fusion algorithm. Methods The theoretical analysis and Monte Carlo simulation methods were ed to compare the traditional fusion algorithm with the new one,and the comparison of the root mean square error statistics values of the two algorithms was made. Results The hierarchical fusion algorithm is not better than the weighting average fusion and feedback weighting average algorithm The weighting filtering fusion algorithm is simple in principle, less in data, faster in processing and better in tolerance.Conclusion The weighting hierarchical fusion algorithm is suitable for the defective sensors.The feedback of the fusion result to the single sersor can enhance the single sensorr's precision. especially once one sensor has great deviation and low accuracy or has some deviation of sample period and is asynchronous to other sensors.

Bi-level programming model and algorithm for optimizing headway of public transit line

Due to the fact that headway is a key factor to be considered in bus scheduling, this paper proposes a bi-level programming model for optimizing bus headway in public transit lines. In this model, with the interests of bus companies and passengers in mind, the upper-level model＇s objective is to minimize the total cost, which is affected by frequency settings, both in time and economy in the transit system. The lower-level model is a transit assignment model used to describe the assignment of passengers＇ trips to the network based on the optimal bus headway. In order to solve the proposed model, a hybrid genetic algorithm, namely the genetic algorithm and the simulated annealing algorithm （GA-SA）, is designed. Finally, the model and the algorithm are tested against the transit data, by taking some of the bus lines of Changzhou city as an example. Results indicate that the proposed model allows supply and demand to be linked, which is reasonable, and the solving algorithm is effective.

Low complexity joint source-channel decoding for transmission of wavelet compressed images

To utilize residual redundancy to reduce the error induced by fading channels and decrease the complexity of the field model to describe the probability structure for residual redundancy, a simplified statistical model for residual redundancy and a low complexity joint source-channel decoding（JSCD） algorithm are proposed. The complicated residual redundancy in wavelet compressed images is decomposed into several independent 1-D probability check equations composed of Markov chains and it is regarded as a natural channel code with a structure similar to the low density parity check （LDPC） code. A parallel sum-product （SP） and iterative JSCD algorithm is proposed. Simulation results show that the proposed JSCD algorithm can make full use of residual redundancy in different directions to correct errors and improve the peak signal noise ratio （PSNR） of the reconstructed image and reduce the complexity and delay of JSCD. The performance of JSCD is more robust than the traditional separated encoding system with arithmetic coding in the same data rate.

Joint eigenvalue estimation by balanced simultaneous Schur decomposition

The problem of joint eigenvalue estimation for the non-defective commuting set of matrices A is addressed. A procedure revealing the joint eigenstructure by simultaneous diagonalization of. A with simultaneous Schur decomposition （SSD） and balance procedure alternately is proposed for performance considerations and also for overcoming the convergence difficulties of previous methods based only on simultaneous Schur form and unitary transformations, it is shown that the SSD procedure can be well incorporated with the balancing algorithm in a pingpong manner, i. e., each optimizes a cost function and at the same time serves as an acceleration procedure for the other. Under mild assumptions, the convergence of the two cost functions alternately optimized, i. e., the norm of A and the norm of the left-lower part of A is proved. Numerical experiments are conducted in a multi-dimensional harmonic retrieval application and suggest that the presented method converges considerably faster than the methods based on only unitary transformation for matrices which are not near to normality.

Reliability analysis of earth slopes using hybrid chaotic particle swarm optimization

A numerical procedure for reliability analysis of earth slope based on advanced first-order second-moment method is presented,while soil properties and pore water pressure may be considered as random variables.The factor of safety and performance function is formulated utilizing a new approach of the Morgenstern and Price method.To evaluate the minimum reliability index defined by Hasofer and Lind and corresponding critical probabilistic slip surface,a hybrid algorithm combining chaotic particle swarm optimization and harmony search algorithm called CPSOHS is presented.The comparison of the results of the presented method,standard particle swarm optimization,and selected other methods employed in previous studies demonstrates the superior successful functioning of the new method by evaluating lower values of reliability index and factor of safety.Moreover,the presented procedure is applied for sensitivity analysis and the obtained results show the influence of soil strength parameters and probability distribution types of random variables on the reliability index of slopes.

Hybrid particle swarm optimization with differential evolution and chaotic local search to solve reliability-redundancy allocation problems

In order to solve reliability-redundancy allocation problems more effectively, a new hybrid algorithm named CDEPSO is proposed in this work, which combines particle swarm optimization （PSO） with differential evolution （DE） and a new chaotic local search. In the CDEPSO algorithm, DE provides its best solution to PSO if the best solution obtained by DE is better than that by PSO, while the best solution in the PSO is performed by chaotic local search. To investigate the performance of CDEPSO, four typical reliability-redundancy allocation problems were solved and the results indicate that the convergence speed and robustness of CDEPSO is better than those of PSO and CPSO （a hybrid algorithm which only combines PSO with chaotic local search）. And, compared with the other six improved meta-heuristics, CDEPSO also exhibits more robust performance. In addition, a new performance was proposed to more fairly compare CDEPSO with the same six improved recta-heuristics, and CDEPSO algorithm is the best in solving these problems.

Spectral Efficiency and Power Allocation for Mixed-ADC Massive MIMO System

This paper investigates the achievable uplink spectral efficiency(SE) of a massive multi-input multi-output(MIMO) system with a mixed analog-to-digital converter(ADC) receiver architecture, in which some antennas are equipped with full-resolution ADCs while others are deployed with low-resolution ADCs. We derive the theoretical results and corresponding approximate expressions of the achievable SE in multi-cell systems with maximum ratio combining(MRC) detector and in single-cell systems with zero-forcing(ZF) detector. Based on approximated results, the effects of physical parameters, including the transmit power, the number of antennas, the proportion of full-resolution ADCs and the quantization precision of the low-resolution ADCs on the achievable SE are revealed. Furthermore, we propose the power allocation algorithms based on the lower bound and upper bound of approximate achievable SE. Our results show that the total achievable SE improves by increasing the number of BS antennas, the signal-to-noise ratio(SNR), and the quantization precision. Results showcase that proposed power allocation algorithms remarkably improve the total achievable SE comparing to the equal power allocation algorithm, which verifies the effectiveness of our proposed schemes.

An efficient enhanced k-means clustering algorithm

In k-means clustering, we are given a set of n data points in d-dimensional space R^d and an integer k and the problem is to determine a set of k points in R^d, called centers, so as to minimize the mean squared distance from each data point to its nearest center. In this paper, we present a simple and efficient clustering algorithm based on the k-means algorithm, which we call enhanced k-means algorithm. This algorithm is easy to implement, requiring a simple data structure to keep some information in each iteration to be used in the next iteration. Our experimental results demonstrated that our scheme can improve the computational speed of the k-means algorithm by the magnitude in the total number of distance calculations and the overall time of computation.

OPTIMAL DISTRIBUTED FUSION ALGORITHM WITH ONE-STEP OUT-OF-SEQUENCE ESTIMATES

The transmission modes of multi-hop and broadcasting for Wireless Sensor Networks(WSN)often make random and unknown transmission delays appear,so multisensor data fusion based ondelayed systems attracts intense attention from lots of researchers.The existing achievements for thedelayed fusion all focus on Out-Of-Sequence Measurements(OOSM)problem which has many dis-advantages such as high communication cost,low computational efficiency,huge computational com-plexity and storage requirement,bad real-time performance and so on.In order to overcome theseproblems occurred in the OOSM fusion,the Out-Of-Sequence Estimates(OOSE)are considered tosolve the delayed fusion for the first time.Different from OOSM which belongs to the centralized fusion,the OOSE scheme transmits local estimates from local sensors to the central processor and is thus thedistributed fusion;thereby,the OOSE fusion can not only avoid the problems suffered in the OOSMfusion but also make the design of fusion algorithm highly simple and easy.Accordingly,a novel optimallinear recursive prediction weighted fusion method is proposed for one-step OOSE problem in this letter.As a tradeoff,its fusion accuracy is slightly lower than that of the OOSM method because the currentOOSM fusion is a smooth estimate and OOSE gets a prediction estimate.But,the smooth result of theOOSE problem also has good fusion accuracy.Performance analysis and computer simulation show thatthe total performance of the proposed one-step OOSE fusion algorithm is better than the current one-step OOSM fusion in the practical tracking systems.

Modified electromagnetism-like algorithm and its application to slope stability analysis

In the view of the disadvantages of complex method (CM) and electromagnetism-like algorithm (EM), complex electromagnetism-like hybrid algorithm (CEM) was proposed by embedding complex method into electromagnetism-like algorithm as local optimization algorithm. CEM was adopted to search the minimum safety factor in slope stability analysis and the results show that CEM holds advantages over EM and CM. It combines the merits of two and is more stable and efficient. For further improvement, two CEM hybrid algorithms based on predatory search (PS) strategies were proposed, both of which consist of modified algorithms and the search area of which is dynamically adjusted by changing restriction. The CEM-PS1 adopts theoretical framework of original predatory search strategy. The CEM-PS2 employs the idea of area-restricted search learned from predatory search strategy, but the algorithm structure is simpler. Both the CEM-PS1 and CEM-PS2 have been demonstrated more effective and efficient than the others. As for complex method which locates in hybrid algorithm, the optimization can be achieved at a convergence precision of 1×10-3, which is recommended to use.

Geometric Mean Decomposition Based Hybrid Precoding for Millimeter-Wave Massive MIMO

Hybrid precoding can reduce the number of required radio frequency(RF)chains in millimeter-Wave(mmWave) massive MIMO systems. However, existing hybrid precoding based on singular value decomposition(SVD) requires the complicated bit allocation to match the different signal-to-noise-ratios(SNRs) of different sub-channels. In this paper,we propose a geometric mean decomposition(GMD)-based hybrid precoding to avoid the complicated bit allocation. Specifically,we seek a pair of analog and digital precoders sufficiently close to the unconstrained fully digital GMD precoder. To achieve this, we fix the analog precoder to design the digital precoder, and vice versa. The analog precoder is designed based on the orthogonal matching pursuit(OMP) algorithm, while GMD is used to obtain the digital precoder. Simulations show that the proposed GMD-based hybrid precoding achieves better performance than the conventional SVD-based hybrid precoding with only a slight increase in complexity.

Groundwater level prediction based on hybrid hierarchy genetic algorithm and RBF neural network

As the traditional non-linear systems generally based on gradient descent optimization method have some shortage in the field of groundwater level prediction, the paper, according to structure, algorithm and shortcoming of the conventional radial basis function neural network （RBF NN）, presented a new improved genetic algorithm （GA）： hybrid hierarchy genetic algorithm （HHGA）. In training RBF NN, the algorithm can automatically determine the structure and parameters of RBF based on the given sample data. Compared with the traditional groundwater level prediction model based on back propagation （BP） or RBF NN, the new prediction model based on HHGA and RBF NN can greatly increase the convergence speed and precision.

An Experimental Comparative Study on Three Classification Algorithms

Classification algorithm is one of the key techniques to affect text automatic classification system’s performance, play an important role in automatic classification research area. This paper comparatively analyzed k-NN. VSM and hybrid classification algorithm presented by our research group. Some 2000 pieces of Internet news provided by ChinaInfoBank are used in the experiment. The result shows that the hybrid algorithm’s performance presented by the groups is superior to the other two algorithms.

Automated retinal blood vessels segmentation based on simplified PCNN and fast 2D-Otsu algorithm

According to the characteristics of dynamic firing in pulse coupled neural network (PCNN) and regional configuration in retinal blood vessel network, a new method combined with simplified PCNN and fast 2D-Otsu algorithm was proposed for automated retinal blood vessels segmentation. Firstly, 2D Gaussian matched filter was used to enhance the retinal images and simplified PCNN was employed to segment the blood vessels by firing neighborhood neurons. Then, fast 2D-Otsu algorithm was introduced to search the best segmentation results and iteration times with less computation time. Finally, the whole vessel network was obtained via analyzing the regional connectivity. Experiments implemented on the public Hoover database indicate that this new method gets a 0.803 5 true positive rate and a 0.028 0 false positive rate on an average. According to the test results, compared with Hoover algorithm and method of PCNN and 1D-Otsu, the proposed method shows much better performance.

Image Segmentation Using an Improved Watershed Algorithm

As watershed algorithm suffers from over-segmentation problem, this paper presented an efficient method to resolve this problem. First, pre-process of the image using median filter is made to reduce the effect of noise. Second, watershed algorithm is employed to provide initial regions. Third, regions are merged according to the information between the region and boundary. In the merger processing based on the region information, an adaptive threshold of the difference between the neighboring regions is used as the region merge criteria, which is based on the human visual character. In the merger processing on the boundary information, the gradient is used to judge the true boundary of the image to avoid merging the foreground with the background regions. Finally, post-process to the regions using mathematical morphology open and close filter is done to smooth object boundaries. The experimental results show that this method is very efficient.

An Improved Hybrid Genetic Algorithm for Chemical Plant Layout Optimization with Novel Non-overlapping and Toxic Gas Dispersion Constraints

New approaches for facility distribution in chemical plants are proposed including an improved non-overlapping constraint based on projection relationships of facilities and a novel toxic gas dispersion constraint. In consideration of the large number of variables in the plant layout model, our new method can significantly reduce the number of variables with their own projection relationships. Also, as toxic gas dispersion is a usual incident in a chemical plant, a simple approach to describe the gas leakage is proposed, which can clearly represent the constraints of potential emission source and sitting facilities. For solving the plant layout model, an improved genetic algorithm (GA) based on infeasible solution fix technique is proposed, which improves the globe search ability of GA. The case study and experiment show that a better layout plan can be obtained with our method, and the safety factors such as gas dispersion and minimum distances can be well handled in the solution.

A novel hybrid estimation of distribution algorithm for solving hybrid flowshop scheduling problem with unrelated parallel machine

The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this work, a novel mathematic model for the hybrid flow shop scheduling problem with unrelated parallel machine(HFSPUPM) was proposed. Additionally, an effective hybrid estimation of distribution algorithm was proposed to solve the HFSPUPM, taking advantage of the features in the mathematic model. In the optimization algorithm, a new individual representation method was adopted. The(EDA) structure was used for global search while the teaching learning based optimization(TLBO) strategy was used for local search. Based on the structure of the HFSPUPM, this work presents a series of discrete operations. Simulation results show the effectiveness of the proposed hybrid algorithm compared with other algorithms.

Effective use of FibroTest to generate decision trees in hepatitis C

AIM： To assess the usefulness of FibroTest to forecast scores by constructing decision trees in patients with chronic hepatitis C.METHODS： We used the C4.5 classification algorithm to construct decision trees with data from 261 patients with chronic hepatitis C without a liver biopsy. The FibroTest attributes of age, gender, bilirubin, apolipoprotein, haptoglobin, α2 macroglobulin, and γ-glutamyl transpeptidase were used as predictors, and the FibroTest score as the target. For testing, a 10-fold cross validation was used.RESULTS： The overall classification error was 14.9% （accuracy 85.1%）. FibroTest＇s cases with true scores of FO and F4 were classified with very high accuracy （18/20 for FO, 9/9 for FO-1 and 92/96 for F4） and the largest confusion centered on F3. The algorithm produced a set of compound rules out of the ten classification trees and was used to classify the 261 patients. The rules for the classification of patients in FO and F4 were effective in more than 75% of the cases in which they were tested.CONCLUSION： The recognition of clinical subgroups should help to enhance our ability to assess differences in fibrosis scores in clinical studies and improve our understanding of fibrosis progression,

Hierarchical Scene Analysis Method for Audio Sensor Networks

Abstract： A hierarchical method for scene analysis in audio sensor networks is proposed. This meth-od consists of two stages： element detection stage and audio scene analysis stage. In the former stage, the basic audio elements are modeled by the HMM models and trained by enough samples off-line, and we adaptively add or remove basic ele- ment from the targeted element pool according to the time, place and other environment parameters. In the latter stage, a data fusion algorithm is used to combine the sensory information of the same ar-ea, and then, a role-based method is employed to analyze the audio scene based on the fused data. We conduct some experiments to evaluate the per-formance of the proposed method that about 70% audio scenes can be detected correctly by this method. The experiment evaluations demonstrate that our method can achieve satisfactory results.