In this paper we address the problem of identifying the similarity measure for face recognition. The similarity measure plays an important role in pattern classification. However, with reference to 2D image matrix bas...
详细信息
The basic operation of Delay Tolerant Sensor Network (DTSN) is to finish pervasive data gathering in networks with intermittent connectivity, while the publish/subscribe (Pub/Sub for short) paradigm is used to deliver...
详细信息
The main difficulty in face image modeling is to decompose those semantic factors contributing to the formation of the face images, such as identity, illumination and pose. One promising way is to organize the face im...
详细信息
ISBN:
(纸本)9781605586083
The main difficulty in face image modeling is to decompose those semantic factors contributing to the formation of the face images, such as identity, illumination and pose. One promising way is to organize the face images in a higher-order tensor with each mode corresponding to one contributory factor. Then, a technique called Multilinear Subspace Analysis (MSA) is applied to decompose the tensor into the mode-n product of several mode matrices, each of which represents one semantic factor. In practice, however, it is usually difficult to obtain such a complete training tensor since it requires a large amount of face images with all possible combinations of the states of the contributory factors. To solve the problem, this paper proposes a method named M2SA, which can work on the training tensor with massive missing values. Thus M2SA can be used to model face images even when there are only a small number of face images with limited variations which will cause missing values in the training tensor). Experiments on face recognition show that M2SA can work reasonably well with up to 70% missing values in the training tensor. Copyright 2009 ACM.
Vision-based motion estimation is a key technique in autonomously mobile robot. This paper presents an integrated method for motion estimation of the mobile robot based on floor plane extraction. The whole processes i...
详细信息
This paper presents a novel adaptive deformation algorithm by integrating the representations of ADFs and physically based deformable models. The octree-based adaptively sampled distance fields (ADFs) are employed as ...
详细信息
In view of the limitations that k-means clustering algorithm is sensitive to the initial points and liable to fall into local minimum point, a clustering algorithm based on multi-sampling max-min distance and dynamic ...
详细信息
The discovery of invariants and ranking functions plays a central role in program verification. In our previous work, we investigated invariant generation and non-linear ranking function discovering of polynomial prog...
详细信息
Pairwise testing, which requires that every combination of valid values of each pair of system factors be covered by at lease one test case, plays an important role in software testing since many faults are caused by ...
详细信息
Pairwise testing, which requires that every combination of valid values of each pair of system factors be covered by at lease one test case, plays an important role in software testing since many faults are caused by unexpected 2-way interactions among system factors. Although meta-heuristic strategies like simulated annealing can generally discover smaller pairwise test suite, they may cost more time to perform search, compared with greedy algorithms. We propose a new method, improved Extremal Optimization (EO) based on the Bak-Sneppen (BS) model of biological evolution, for constructing pairwise test suites and define fitness function according to the requirement of improved EO. Experimental results show that improved EO gives similar size of resulting pairwise test suite and yields an 85% reduction in solution time over SA.
Traditional access control solutions suffer from difficulties in access rights authorization and usage policy enforcement, especially in highly distributed environments. The layered nature of common digital content sh...
详细信息
The efficiency of attacking methods on secure RSA modulus was investigated. It was pointed out by analysis that since the success probability of some attack methods was neglectable, these methods could not be regarded...
详细信息
The efficiency of attacking methods on secure RSA modulus was investigated. It was pointed out by analysis that since the success probability of some attack methods was neglectable, these methods could not be regarded as the reason for choosing strongly secure RSA modulus. In consideration of the analysis of attack methods, the signification of secure RSA modulus was summarized, which enhanced the efficiency of selecting secure parameters in practice. The result that the difference between two RSA primes d=|p-q| must not be too small was further investigated, and the d might be seen as a special case when dl,m=ql-pm (l,mZ+) was small. From the analysis, it could be figured out that the randomness of the relation between the two primes should not be neglected during selecting RSA modulus. To improve the security, it should be avoided to have some specially functional relations between the two primes when choosing a larger d.
暂无评论