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.
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.
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.
Plan recognition,the inverse problem of plan synthesis,is important wherever a system is expected to produce a kind of cooperative or competitive *** plan recognizers,however,suffer the problem of acquisition and hand...
详细信息
Plan recognition,the inverse problem of plan synthesis,is important wherever a system is expected to produce a kind of cooperative or competitive *** plan recognizers,however,suffer the problem of acquisition and hand-coding a larger plan *** paper is aims to show that modern planning techniques can help build plan recognition systems without suffering such ***,we show that the planning graph,which is an important component of the classical planning system Graphplan,can be used as an implicit,dynamic planning library to represent actions,plans and *** also show that modern plan generating technology can be used to find valid plans in this *** this sense,this method can be regarded as a bridge that connects these two research *** and theoretical results also show that the method is efficient and scalable.
We augment Naive Bayes models by using divide and conquer strategy to address shortcomings of the standard Naive Bayes text classifier. The result is a generalized Bayes classifier which allows for local dependence am...
详细信息
We augment Naive Bayes models by using divide and conquer strategy to address shortcomings of the standard Naive Bayes text classifier. The result is a generalized Bayes classifier which allows for local dependence among feature subset;a model we refer to as the Augmented Naive Bayes (ANB) classifier. ANB relaxes the independence assumptions of Naive Bayes while still permitting efficient inference and learning. Experimental studies on a set of natural domains show that ANB has clear advantages with respect to the generalization ability.
This paper proposed a novel hybrid probabilistic network,which is a good tradeoff between the model complexity and learnability in *** relaxes the conditional independence assumptions of Naive Bayes while still permit...
详细信息
This paper proposed a novel hybrid probabilistic network,which is a good tradeoff between the model complexity and learnability in *** relaxes the conditional independence assumptions of Naive Bayes while still permitting efficient inference and *** studies on a set of natural domains prove its clear advantages with respect to the generalization ability.
Previous methods of volume rendering are very slow and thus impractical. We present volume rendering based on marching cubes iso-surfacing and transfer function. For an iso-surface, we divide the voxels into logical c...
详细信息
Previous methods of volume rendering are very slow and thus impractical. We present volume rendering based on marching cubes iso-surfacing and transfer function. For an iso-surface, we divide the voxels into logical cubes according to a predefined threshold value, the tangent planes and normal vectors at each voxel are calculated and the normal vectors are orientated to the outside of surface based on wide first searching (WFS), and the 3D surface model is then obtained using marching cubes. Transfer function is used to specify the optical properties for volume rendering technology. We employ a 2D function. The end-user interacts with a set of direct manipulation widgets (triangles and rectangles). Each widget precisely corresponds to a different material and widgets are blended automatically to compute an overall transfer function. Compared to traditional techniques, the overall specification process takes a fraction of the time.
The necessary and sufficient condition for the existence of prewavelets with finite decomposition and finite reconstruction is presented. Especially when r = 1, we show that {φj(x-k) | 1 &le j &le r, k ∈ s} ...
详细信息
The necessary and sufficient condition for the existence of prewavelets with finite decomposition and finite reconstruction is presented. Especially when r = 1, we show that {φj(x-k) | 1 &le j &le r, k ∈ s} is shift-orthogonal if there exist prewavelets with finite decomposition and finite reconstruction, i.e., non-trivial prewavelets with finite decomposition and finite reconstruction does not exist. As an example, when r = 2 we construct a prewavelet with finite decomposition and finite reconstruction where the scale function is not shift-orthogonal, which demonstrate that there exist vector prewavelets with finite decomposition and finite reconstruction.
This paper presents a new interest local regions descriptors method based on Hilbert-Huang Transform. The neighborhood of the interest local region is decomposed adaptively into oscillatory components called intrinsic...
详细信息
ISBN:
(纸本)1901725340
This paper presents a new interest local regions descriptors method based on Hilbert-Huang Transform. The neighborhood of the interest local region is decomposed adaptively into oscillatory components called intrinsic mode functions (IMFs). Then the Hilbert transform is applied to each component and get the phase and amplitude information. The proposed descriptors samples the phase angles information and amalgamates them into 10 overlap squares with 8-bin orientation histograms. The experiments show that the proposed descriptors are better than SIFT and other standard descriptors. Essentially, the Hilbert-Huang Transform based descriptors can belong to the class of phase-based descriptors. So it can provides a better way to overcome the illumination changes. Additionally, the Hilbert-Huang transform is a new tool for analyzing signals and the proposed descriptors is a new attempt to the Hilbert-Huang transform.
In this paper, we introduce two improvements on Ant Colony Optimization (ACO) algorithm: route optimization and individual variation. The first is an optimized implementation of ACO, by which the running time of ants ...
详细信息
暂无评论