We present a novel object localization approach based on the global structure constraint model (GSC) and optimal algorithm. In GSC, Objects are described as constellations of points satisfied with their specific globa...
详细信息
ISBN:
(纸本)9781424431977;9780769531618
We present a novel object localization approach based on the global structure constraint model (GSC) and optimal algorithm. In GSC, Objects are described as constellations of points satisfied with their specific global structure constraints. The spatial relations among all the patches having stable color information and their representative color information around patches are encoded. Then, the searching algorithm, i.e. genetic algorithm, is used to locate target objects in images by finding out the exactly matched position. In the experiment, we tested the approach on a collection of human face images and the results demonstrated the approach is simple, effective and efficient.
Attribute discretization is one of the key issues for the Rough Set theory. First, a method is proposed to compute an initial cut points set. The indistinguishable relation of decision tables did not change, and the n...
详细信息
Attribute discretization is one of the key issues for the Rough Set theory. First, a method is proposed to compute an initial cut points set. The indistinguishable relation of decision tables did not change, and the number of elements in the initial cut points set was reduced. Then, the cut point information entropy was defined to measure the importance of a cut point. Finally, an attribute discretization algorithm based on the Rough Set and information entropy was proposed. The consistence of decision tables did not change, and the mixed decision table was considered, which contains continuous and discrete attributes. The experimental results show that this algorithm is effective and is competent for processing the large-scale datasets.
An efficient methodology for recognizing features is presented. The part information is taken from the B-rep solid date library then broken down into sub-graph. Once the sub-graphs are generated, they are first checke...
详细信息
An efficient methodology for recognizing features is presented. The part information is taken from the B-rep solid date library then broken down into sub-graph. Once the sub-graphs are generated, they are first checked to see whether they match with the predefined feature library. If so, a feature vector is assigned to them. Otherwise, base faces are obtained as heuristic information and used to restore missing faces, meanwhile, update the sub-graphs. The sub-graphs are transformed into vectors, and these vectors are presented to the neural network which classifies them into feature classes.
Aiming at the dynamic policy trigger problem in policy based network management, this thesis first introduces the uncertain information generated by one-point coverage random sets theory and also the unified framework...
详细信息
Aiming at the dynamic policy trigger problem in policy based network management, this thesis first introduces the uncertain information generated by one-point coverage random sets theory and also the unified framework of fuzzy information. On the basis of which, according to the feature of policy based network management, a model used to update the predicted information using present known information, experience, and knowledge is designed. At the same time, this thesis put forward that, take the semblance of policy as constant probability in product space conditional event algebra, so as to execute information fusion of multiple sets of related policy. In the end, compared with the policy based inference system and then analyze the result.
A framework of hiberarchy trusted network basedon the grade division was put forward,and thepartition rules of trusted attributes as well as themethods of grade division were explained in ***,the potential application...
详细信息
A framework of hiberarchy trusted network basedon the grade division was put forward,and thepartition rules of trusted attributes as well as themethods of grade division were explained in ***,the potential applications of this frameworkin trusted network were discussed,and the accessprocedure of terminals in hiberarchy trusted networkwas given based on the existing research *** show that by the proposed framework,notonly the safety and reliability of network can beensured,but also the flexibility of ways to accessnetwork is strengthened,and that the framework canprovide supports for interoperability of differentequipment suppliers.
Internet is a complex network with the characteristic of self-organized criticality. The cascading dynamics of Internet are presented and two reasons are pointed out, which may cause cascading failures. Different from...
详细信息
Internet is a complex network with the characteristic of self-organized criticality. The cascading dynamics of Internet are presented and two reasons are pointed out, which may cause cascading failures. Different from betweenness centrality, a congestion function to represent the extent of congestion is proposed. By introducing the concept of "delay time", the correlation between permanent removing and non-removing is built. And a new evaluation function of network efficiency based on congestion function is given in order to measure the damage of cascading failures. Moreover some effects of network structure and size, delay time on congestion propagation are also investigated, and cascading process composed of three phases and some factors affecting cascade propagation are uncovered.
This paper demonstrates the necessity of the use of PSC-CEA for dynamic policy triggering in the process of mobile IP switching; in the mean time, according to the characteristics of policy based network management, p...
详细信息
This paper demonstrates the necessity of the use of PSC-CEA for dynamic policy triggering in the process of mobile IP switching; in the mean time, according to the characteristics of policy based network management, propose a dynamic policy trigger model, and designs a mechanism which is used to update dynamic policy according to known information, experience and knowledge to satisfy the QoS of mobile services and use current network resource sufficiently.
In this paper, we apply the least-square support vector machine (LS-SVM) to operon prediction of Escherichia coli (***), with different combinations of intergenic distance, gene expression data, and phylogenetic profi...
详细信息
ISBN:
(纸本)9781424440085
In this paper, we apply the least-square support vector machine (LS-SVM) to operon prediction of Escherichia coli (***), with different combinations of intergenic distance, gene expression data, and phylogenetic profile. Experimental results demonstrate that the WO pairs tend to have shorter intergenic distances, higher correlation coefficient and much stronger relation of co-envoled between phylogenetic profiles. Also, we dealt with the data sets extracted from WOs¿ and TUBs¿, processed the intergenic distances with log-energy entropy, de-noised the Pearson correlation coefficients of two genes expression data with wavelet transform, and computed the Hamming distances of two phylogenetic profiles. Then we trained LS-SVM using part of the data sets and tested the trained classifier model using the rest data sets. It shows that different combinations of features could affect the prediction results. When the combination of intergenic distance, gene expression data and phylogenetic profile is taken as the input of LS-SVM in the linear kernel type, good results can be obtained, of which the accuracy, sensitivity and specificity are 92.34%, 93.54%, and 90.73%, respectively.
In this paper an efficient copyright protection watermarking algorithm is proposed. By embedding orthogonal vector into the wavelet-tree structure of the host image, we get the watermarked image. At the same time huma...
详细信息
In this paper an efficient copyright protection watermarking algorithm is proposed. By embedding orthogonal vector into the wavelet-tree structure of the host image, we get the watermarked image. At the same time human vision system is considered to get perceptual results. We design an elaborate function for blind watermarking scheme. This function can dynamically determine the embedding position. The theory and experimental results show that our method successfully survives image processing operation, noise adding, the JPEG lossy compression and image cropping. Especially, the scheme is robust towards image sharpening and image enhancement.
暂无评论