The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
For the capacitated minimum spanning tree problem (CMST), there are still no effective algorithms to solve this problem up to now. In this paper, we present a completely new approach by using the genetic algorithms (GAs). For the adaptation to the evolutionary process, we developed a tree-based genetic representation to code the candidate solution of the CMST problem. Numerical analysis shows the...
This paper introduces a novel face recognition method based on DT-CWT feature representation using ONPP. The dual-tree complex wavelet transform (DT-CWT) used for representation features of face images, whose kernels are similar to Gabor wavelets, exhibit desirable characteristics of spatial locality and orientation selectivity. And DT-CWT outperforms Gabor with less redundancy and much efficient...
In this paper, we explore a new problem of simultaneously mining diagnostic genes and specific phenotypes from microarray data using unsupervised method. A novel type of cluster called LC-Cluster is proposed to address this problem. The idea behind the solution is motivated by recent biological discovery and origins from current bicluster model or emerging pattern, but differs substantially from either...
In this paper, a combination-tree algorithm is presented for mining frequent patterns based on inverted list. Compared with Apriori algorithm and FP-growth algorithm, our algorithm has better efficiency. Our algorithm insert items one by one with inverted list to build frequent tree, then transfer count between branches in order to make branches independent, our algorithm need only scan data set twice,...
A robust environment map with 3D spatial natural landmarks that facilitates monocular vision based mobile robot for global localization is built. The highly distinctive multi-dimensional vector descriptors associated with the features extracted through scale invariant feature transform (SIFT) can be robustly matched despite changes in illumination, scale and viewpoint. The landmarks are 3D restructured...
This paper proposes an efficient watermarking technique using adaptive differential energy watermarking (ADEW) with cross binding wavelet tree (CBWT). The ADEW embeds a secret bit string using the reference threshold with experimental statistics. The proposed method not only takes advantage of the ADEWs error resilience but corrects a secret bit string by using ECC after error occurrence. Through...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.