26657378
Palmprint Identification using Boosting Local Binary Pattern
Local binary pattern (LBP) is a powerful texture descriptor that is gray-scale and rotation invariant according to T. Ojala et al. (2002). Because texture is one of the most clearly observable features in low-resolution palmprint images, we think local binary pattern based features are very discriminative for palmprint identification. In this paper, we propose a palmprint identification approach using boosted local binary pattern based classifiers. The palmprint area is scanned with a scalable sub-window from which local binary pattern histograms are extracted to represent the local features of a palmprint image. The multi-class problem is transformed into a two-class one of intra- and extra-class by classifying every pair of palmprint images as intra-class or extra-class ones in the work of B. Moghaddam et al. (1996). We use the AdaBoost algorithm in the work of Y. Freund and R.E. Schapire (1997) to select those sub-windows that are more discriminative for classification. Weak classifiers are constructed based on the Chi square distance between two corresponding local binary pattern histograms. Experiments on the UST-HK palmprint database show competitive performance
17592710
Full-Space LDA With Evolutionary Selection for Face Recognition
Linear discriminant analysis (LDA) is a popular feature extraction technique for face recognition. However, it often suffers from the small sample size problem when dealing with the high dimensional face data. Some approaches have been proposed to overcome this problem, but they usually utilize all eigenvectors of null or range subspaces of within-class scatter matrix (Sw). However, experimental results testified that not all the eigenvectors in the full space of S w are positive to the classification performance, some of which might be negative. As far as we know, there have been no effective ways to determine which eigenvectors should be adopted. This paper proposes a new method EDA+Full-space LDA, which takes full advantage of the discriminative information of the null and range subspaces of Sw by selecting an optimal subset of eigenvectors. An estimation of distribution algorithm (EDA) is used to pursuit a subset of eigenvectors with significant discriminative information in full space of Sw middot EDA+Full-space LDA is tested on ORL face image database. Experimental results show that our method outperforms other LDA methods
29843270
A Self-adaptive Mixed Distribution Based Uni-variate Estimation of Distribution Algorithm for Large Scale Global Optimization
Large scale global optimization (LSGO), which is highly needed for many scientific and engineering applications, is a very important and very difficult task in optimization domain. Various algorithms have been proposed to tackle this challenging problem, but the use of estimation of distribution algorithms (EDAs) to it is rare. This chapter aims at investigating the behavior and performances of uni-variate EDAs mixed with different kernel probability densities via fitness landscape analysis. Based on the analysis, a self-adaptive uni-variate EDA with mixed kernels (MUEDA) is proposed. To assess the effectiveness and efficiency of MUEDA, function optimization tasks with dimension scaling from 30 to 1500 are adopted. Compared to the recently published LSGO algorithms, MUEDA shows excellent convergence speed, final solution quality and dimensional scalability.
3197098
A Multi-Objective Hw-sw Co-Synthesis Algorithm Based on Quantum-Inspired Evolutionary Algorithm
Hardware–Software (HW–SW) co-synthesis is one of the key steps in modern embedded system design. Generally, HW–SW co-synthesis is to optimally allocate processors, assign tasks to processors, and schedule the processing of tasks to achieve a good balance among performance, cost, power consumption, etc. Hence, it is a typical multi-objective optimization problem. In this paper, a new multi-objective HW–SW co-synthesis algorithm based on the quantum-inspired evolutionary algorithm (MQEAC) is proposed. MQEAC utilizes multiple quantum probability amplitude vectors to model the promising areas of solution space. Meanwhile, this paper presents a new crossover operator to accelerate the convergence to the Pareto front and introduces a PE slot-filling strategy to improve the efficiency of scheduling. Experimental results show that the proposed algorithm can solve the typical multi-objective co-synthesis problems effectively and efficiently.
26519336
Iris Recognition Algorithm Using Modified Log-Gabor Filters
In this paper, we presented an iris recognition algorithm based on modified Log-Gabor filters. The algorithm is similar as the method proposed by Daugman in general procedure while modified Log-Gabor filters are adopted to extract the iris phase information instead of complex Gabor filters used in Daugman's method. The advantage of Log-Gabor filters over complex Gabor filters is the former are strictly bandpass filters and the latter are not. The property of strictly bandpass makes the Log-Gabor filters more suitable to extract the iris phase features regardless of the background brightness. The comparison experiments between complex Gabor filters based methods and the proposed method are also presented in this paper
9214943
A restart univariate estimation of distribution algorithm: sampling under mixed Gaussian and Lévy probability distribution
A univariate EDA denoted as ldquoLSEDA-glrdquo for large scale global optimization (LSGO) problems is proposed in this paper. Three efficient strategies: sampling under mixed Gaussian and Levy probability distribution, standard deviation control strategy and restart strategy are adopted to improve the performance of classical univariate EDA on LSGO problems. The motivation of such work is to extend EDAs to LSGO domain reasonably. Comparison among LSEDA-gl, EDA with standard deviation control strategy only (EDA-STDC) and similar EDA version ldquocontinuous univariate marginal distribution algorithmrdquo UMDAc is carried out on classical test functions. Based on the general comparison standard, the strengths and weaknesses of the algorithms are discussed. Besides, LSEDA-gl is tested on 7 functions with 100, 500, 1000 dimensions provided in the CECpsila2008 Special Session on LSGO. This work is also expected to provide a comparison result for the CECpsila2008 special session.
15051068
Study on Epipolar Geometry Restoration of Parallel Binocular Vision
The epipolar geometry restoration offline and online for the parallel binocular vision system were discussed in this paper. For the former, a method that uses a common calibration board to realize automatic and accurate matching of the image corner pairs was developed; for the latter, a connotative constraint was proved by geometry theory and the corresponding cross-correlation sparse matching algorithm was introduced. The constraint was that for any space point projected into two images, the horizontal coordinate in the left image of this point is bigger than that in the right image. Standard and real images experiments were made for each kind of problem and the results show that the algorithms for each problem were valid.
13764046
A Parallel and Distributed Method for Computing High Dimensional MOLAP
Data cube has been playing an essential role in fast OLAP(on-line analytical processing) in many multidimensional data warehouse. We often execute range queries on aggregate cube computed by pre-aggregate technique in MOLAP. For the cube with d dimensions, it can generate 2d cuboids. But in a high-dimensional data warehouse (such as the applications of bioinformatics and statistical analysis, etc.), we build all these cuboids and their indices and full materialized the data cube impossibly. In this paper, we propose a multi-dimensional hierarchical fragmentation of the fact table based on dimension hierarchical encoding. This method partition the high dimensional data cube into shell mini-cubes. Using dimension hierarchical encoding and pre-aggregated results, OLAP queries are computed online by dynamically constructing cuboids from the fragment data cubes. Such an approach permits a significant reduction of processing and I/O overhead for many queries by restricting the number of fragments to be processed for both the fact table and bitmap encoding data. This method also supports parallel I/O and parallel processing as well as load balancing for disks and processors. We have compared the methods of our parallel method with the other existed ones such as partial cube by experiment. The analytical and experimental results show that the method of our parallel method proposed in this paper is more efficient than the other existed ones.
40380992
The Deformed Cube: A Visualization Technique for 3D Velocity Vector Field
This paper presents a visualization method called the deformed cube for visualizing 3D velocity vector field. Based on the decomposition of the tensor which describes the changes of the velocity, it provides a technique for visualizing local flow. A deformed cube,a cube transformed by a tensor in a local coordinate frame, shows the local stretch, shear and rigid body rotation of the local flow corresponding to the decomposed component of the tensor. User can interactively view the local deformation or any component of the changes. The animation of the deformed cube moving along a streamline achieves a more global impression of the flow field. This method is intended as a complement to global visualization methods.
11047335
Dynamic modeling for locomotion-manipulation of a snake-like robot by using geometric methods
A snake-like robot can locomote in various environments; and it can manipulate objects when one end is fixed. A method of dynamic modeling for locomotion-manipulation of the snake-like robot is developed in order to unify the dynamic equations of two states. A virtual structure for orientation and position and the product-of-exponentials formula describe the mechanism and the kinematics of the robot. The dynamics of the robot are established in a Riemannian manifold. Furthermore, the dynamics of manipulation can be directly degenerated from those of locomotion. This method unifies the dynamics of locomotion and manipulation of the snake-like robot in the differential geometry formulation. Finally, simulation results of the method are presented.
2728620
Mixture-based bone segmentation and its application in computer aided diagnosis and treatment planning
The developmental dysplasia of the hip (DDH) is a congenital malformation of the acetabulum with different degrees. Leaving it partially treated or untreated is a major cause of disability. In this paper, we implemented a computer-aided system for the diagnosis and treatment planning of DDH. Instead of labeling each voxel with a unique label or tissue type, the percentage of different tissues within each voxel, which we call a mixture, was considered in establishing a maximum a posterior probability (MAP) framework for more accurate segmentation. A graphical module displayed the segmented bone in a 3D view to show the spatial relationship between acetabulum and femurs. This virtual image, together with quantitative measurement indexes, helps physicians make diagnosis. The system also provides physicians a virtual treatment planning on screen for acetabular and femoral osteotomy. It is currently under clinical trial on patient datasets.