This paper describes a region-based retrieval system based on graph-cuts and global/local feature. We also use dynamic partial function (DPF), indexing by locality sensitive hashing (LSH) and learning feedback for imp...
详细信息
This paper describes a region-based retrieval system based on graph-cuts and global/local feature. We also use dynamic partial function (DPF), indexing by locality sensitive hashing (LSH) and learning feedback for improving system performance. Such a system is useful for finding a sub-object from a large image database. In order to obtain the sub-object from a sample image, we propose an efficient graph-cuts segmentation method to cut out the object. The system utilizes the segmentation results to capture the higher-level concept of images and gets a stable and accurate result. Also the feedback method is efficient. Experimental and comparison results, which are performed using a general purpose database containing 5,000 images, are encouraging.
A new 3D reconstruction algorithm based on particle swarm optimization (PSO) is proposed. This is the first time to introduce PSO to the multi-views problem. The proposed algorithm designs a scheme to represent the 3D...
详细信息
A new 3D reconstruction algorithm based on particle swarm optimization (PSO) is proposed. This is the first time to introduce PSO to the multi-views problem. The proposed algorithm designs a scheme to represent the 3D parameters using a particle. Then the PSO algorithm is used to search the solution space and optimizes the fitness function. Finally, the algorithm can efficiently get the correct solution with less time and less complexity. Additionally, some details of implement are discussed which influence the performance of the algorithm. Experiments and comparisons are given in real data. The accuracy of the recovered solution is compared to the existing algorithms and outperformed them.
Texture synthesis is a very active research area in computer vision and graphics, and temporal texture synthesis is one subset of it. A new temporal texture synthesis algorithm is presented, in which genetic algorithm...
详细信息
Texture synthesis is a very active research area in computer vision and graphics, and temporal texture synthesis is one subset of it. A new temporal texture synthesis algorithm is presented, in which genetic algorithm is introduced into the processes of synthesizing videos. In the algorithm, by analyzing and processing a finite source video clip, infinite video sequences that are played smoothly in vision can be obtained. Comparing with many existing temporal texture synthesis algorithms, this algorithm can get high-quality video results without complicated pre-processing of source video while it improves the efficiency of synthesis. This paper analyzes to determine the population size and the Max number of generations which influence the speed and quality of synthesis.
Currently, the research for the extraction of information in deep web is pretty active. Although many researchers already adopted ontology in the data extraction, many problems still exist. This paper proposed an onto...
详细信息
Classical genetic algorithm suffers heavy pressure of fitness evaluation for time-consuming optimization problems, e.g., aerodynamic design optimization, qualitative model learning in bioinformatics. To address this p...
详细信息
Linearizability is an important correctness criterion for concurrent objects and automatic checking of linearizability often involves searching a sequential witness in an exponentially growing space of traces. We pres...
详细信息
A large number of techniques have been implemented mostly based on abundance of data statistics and they usually do not harness the semantic relationships between attributes. This paper proposes a novel ontology-based...
详细信息
The three-dimensional structure of a biomolecule rather than its one-dimensionM sequence determines its biological function. At present, the most accurate structures are derived from experimental data measured mainly ...
详细信息
The three-dimensional structure of a biomolecule rather than its one-dimensionM sequence determines its biological function. At present, the most accurate structures are derived from experimental data measured mainly by two techniques: X-ray crystallog- raphy and nuclear magnetic resonance (NMR) spec- troscopy. Because neither X-ray crystallography nor NMR spectroscopy could directly measure the positions of atoms in a biomolecule, algorithms must be designed to compute atom coordinates from the data. One salient feature of most NMR structure computation algorithms is their reliance on stochastic search to find the lowest energy conformations that satisfy the experimentally- derived geometric restraints. However, neither the cor- rectness of the stochastic search has been established nor the errors in the output structures could be quantified. Though there exist exact algorithms to compute struc- tures from angular restraints, similar algorithms that use distance restraints remain to be developed. An important application of structures is rational drug design where protein-ligand docking plays a crit- ical role. In fact, various docking programs that place a compound into the binding site of a target protein have been used routinely by medicinal chemists for both lead identification and optimization. Unfortunately, de- spite ongoing methodological advances and some success stories, the performance of current docking algorithms is still data-dependent. These algorithms formulate the docking problem as a match of two sets of feature points. Both the selection of feature points and the search for the best poses with the minimum scores are accomplished through some stochastic search methods. Both the un- certainty in the scoring function and the limited sam- pling space attained by the stochastic search contribute to their failures. Recently, we have developed two novel docking algorithms: a data-driven docking algorithm and a general docking algorithm that does not re
In designing a focused crawler, the choice of strategy for prioritizing unvisited URLs is vital. The text surrounding a link or the link context on the HMTL page is a good summary of the target page. This paper invest...
详细信息
In designing a focused crawler, the choice of strategy for prioritizing unvisited URLs is vital. The text surrounding a link or the link context on the HMTL page is a good summary of the target page. This paper investigates some alternative methods and advocates that the link-context derived from reference page's HTML tag tree can provide a wealth of illumination for domain-specific web resource discovery guided by SVM classifier with uneven margins, which is particularly helpful for small training datasets. Little work has been done to utilize the beneficial link context information about the seed URLs. In order that crawler can acquire enough illumination from link-context, we initially look for some referring pages by traversing backward from seed URLs. The method collects this kind of resources beforehand and then uses it to steer resource discovery. A comprehensive experiment has been conducted using multiple crawls over 10 topics covering thousands of pages allowing us to derive statistically strong results.
Mining outliers in heterogeneous networks is crucial to many applications,but challenges *** this paper,we focus on identifying meta-path-based outliers in heterogeneous information network(HIN),and calculate the simi...
详细信息
Mining outliers in heterogeneous networks is crucial to many applications,but challenges *** this paper,we focus on identifying meta-path-based outliers in heterogeneous information network(HIN),and calculate the similarity between different types of *** propose a meta-path-based outlier detection method(MPOutliers)in heterogeneous information network to deal with problems in one go under a unified *** calculates the heterogeneous reachable probability by combining different types of objects and their *** discovers the semantic information among nodes in heterogeneous networks,instead of only considering the network *** also computes the closeness degree between nodes with the same type,which extends the whole heterogeneous ***,each node is assigned with a reliable weighting to measure its authority *** experiments on two real datasets(AMiner and Movies dataset)show that our proposed method is very effective and efficient for outlier detection.
暂无评论