3D reconstruction from multiple-view images has drawn a lot of attentions in computer graphics and computer vision communities. Traditional techniques usually end at discrete 3D point clouds computed from feature corr...
详细信息
3D reconstruction from multiple-view images has drawn a lot of attentions in computer graphics and computer vision communities. Traditional techniques usually end at discrete 3D point clouds computed from feature correspondence. However, geometric structure remains ambiguous in these unstructured point clouds, especially for man-made objects like buildings, indoor scenes. This paper proposes a new method to automatically reconstruct the main geometric structure of the scene composed of planar faces. First, dense 3D point clouds are reconstructed by applying patch-based multi-view stereo (PMVS) algorithm [1]. Then 3D planar primitives are extracted using a RANSAC-based approach [2]. We present a novel method to analyze the adjacency relations of the planar primitives to estimate the 3D intersection lines on the corresponding faces. Junctions and polygonal faces are computed from the 3D intersection lines along with complementary image information to compose the topology structure. Finally, texture for each face is extracted from the image under the best view. Experimental results demonstrate the feasibility of our system by successfully reconstructing the main structure of a wide range of scenes and constructing a texture-mapped piecewise-planar 3D model from images in multiple views.
In this paper, we propose a compressive tracking method via appearance model based on structural local patchs and improved Haar-like feature. In contrast to previous compressive tracking only considering the holistic ...
详细信息
In this paper, we propose a compressive tracking method via appearance model based on structural local patchs and improved Haar-like feature. In contrast to previous compressive tracking only considering the holistic representation, an object can be represented by local image patches with spatial layout in an object. This representation takes advantage of both partial information and spatial information of the target. Each local patch has a fixed position in the target field, and all local patches can represent the whole target. In addition, our appearance model based on features extracted from image patches, which can guarantee the randomness of the rectangular boxes and the distribution of the rectangular boxes over the entire image area, avoiding the randomness of the rectangular boxes is too strong to weak the feature expression. We sample the positive and negative samples and divide them into patchs to train a binary classification via a naive Bayes classifier with online update, then the classifier is used to discriminate the candidate samples. The candidate sample which gets the highest classify score is the target. After that we draw positive and negative samples in the same way with the candidate samples to update the classifier to get ready for next frame. Our approach helps not only locate the target more accurately but also can handle partial occlusion effectively. The proposed tracker is compared with several state-of-the-art trackers on some challenging video sequences. Our proposed tracker is better and more stable in both quantitative and qualitative comparisons.
A novel edge detection method based on anisotropic mathematical morphology and scale multiplication in nonsubsampled contourlet transform (NSCT) domain is proposed to obtain a superior and robust performance under hea...
详细信息
With the widespread use of mobile devices, the location-based service (LBS) applications become increasingly popular, which introduces the new security challenge to protect user's location privacy. On one hand, a ...
详细信息
This paper designs a mixed H/Hmodel predictive algorithm for systems with energy-bounded *** formulation of H/Hperformance in previous work is improved by introducing a slack ***,we decouple the formulation of H/Hperf...
详细信息
ISBN:
(纸本)9781479900305
This paper designs a mixed H/Hmodel predictive algorithm for systems with energy-bounded *** formulation of H/Hperformance in previous work is improved by introducing a slack ***,we decouple the formulation of H/Hperformance from the formulation of input and state constraints by dilated LMI *** two aspects are combined to develop a less conservative control *** feasibility of the algorithm is able to be proved and stability of the controlled system is *** example shows the effectiveness of the proposed algorithm.
To track the wide range of operating points of fast time-varying processes, a novel multiple model off-line predictive control algorithm is presented. The proposed method is a combination of multiple model strategy an...
详细信息
ISBN:
(纸本)9781467355339
To track the wide range of operating points of fast time-varying processes, a novel multiple model off-line predictive control algorithm is presented. The proposed method is a combination of multiple model strategy and predictive control. Firstly, we locally describe the original nonlinear system around an operating point employing linear time varying (LTV) model. Then the offline model predictive control (OMPC) algorithm is adopted to design local controller for LTV model, whose low computation burden makes it be able to control the fast time-varying process. To track the wide range of operating point, the multiple-model strategy is exploited. By estimating the stable region of local OMPC and selecting appropriate middle operating points, the stable switch between controllers can be guaranteed. Finally, a numerical simulation is given to illustrate the implementation and effectiveness of the proposed method.
Improving the computational efficiency for model predictive control (MPC) becomes the focus of recent researches. This paper proposes a fast algorithm to solve the quadratic programming (QP) problem of MPC for systems...
详细信息
ISBN:
(纸本)9781467355339
Improving the computational efficiency for model predictive control (MPC) becomes the focus of recent researches. This paper proposes a fast algorithm to solve the quadratic programming (QP) problem of MPC for systems with only input constraints. This algorithm improves the efficiency of the fast gradient approach. Inspired by the multiplexed way, this algorithm searches a better solution of QP problem along the direction of one input channel in every iteration. Meanwhile, in order to further reduce the online computational complexity, the proposed algorithm applies the aggregation strategy to each input channel. Due to the aggregation strategy and the determined optimization direction, the proposed algorithm reduces the number of vector multiplications of each iteration, i.e. with less online computational complexity than previous works. Applying the proposed algorithm, simulations for a system with 3 inputs show that computational efficiency of this algorithm can reach a level of tens of microseconds in Matlab environment.
Many researches on the prediction of the penetration rate of the tunneling boring machine (TBM) have been carried out. The prediction of the penetration rate will contribute to reduce the danger of TBM construction, d...
详细信息
ISBN:
(纸本)9781467355339
Many researches on the prediction of the penetration rate of the tunneling boring machine (TBM) have been carried out. The prediction of the penetration rate will contribute to reduce the danger of TBM construction, decrease the cost and provide the support for the construction planning. Most methods for predicting penetration rate rely on the fixed equation relationship between the input parameters and output parameters. In this paper, we build up a dynamic model. We mainly make use of the partial least squares regression algorithm (PLS) and the structure of the fuzzy-neuron network (FNN) to build up the model. All the data should be normalized. We randomly select 120 groups of the data from TBM construction as the training data and 33 groups of data as the testing data. The training and testing results are analyzed by the mean square error and the correlation coefficient. At the same time, we compare the prediction of the PLS-FNN model with the prediction of the FNN model. The simulation result shows that the PLS-FNN model has the good performance for the prediction.
With the quick development of the semantic web technology, RDF data explosion has become a challenging problem. Since RDF data are always from different resources, which may have overlap with each other, they could ha...
With the quick development of the semantic web technology, RDF data explosion has become a challenging problem. Since RDF data are always from different resources, which may have overlap with each other, they could have duplicates. These duplicates may cause ambiguity and even error in reasoning. However, attentions are seldom paid to this problem. In this paper, we study the problem and give a solution, named K-radius sub graph comparison (KSC). The proposed method is based on RDF-Hierarchical Graph Model. KSC combines similar and comparison of 'context' to detect duplicate in RDF data. Experiments on publication datasets show that the proposed method is efficient in duplicate detection of RDF data. And KSC is simpler and less time-costs than other methods of graph comparison.
A saturation allowed scheduled anti-windup design method is proposed in this paper for the linear systems subject to input saturation. We introduced the scheduled controller design method into the anti-windup scheme, ...
详细信息
A saturation allowed scheduled anti-windup design method is proposed in this paper for the linear systems subject to input saturation. We introduced the scheduled controller design method into the anti-windup scheme, in which a family of controllers are designed. These controllers are activated depending on the response of the system, rather than only considering the worst noise case off-line. Also, the delayed activation scheme is introduced into the scheduled antiwindup mechanism, i.e., the physical actuator is activated when it really need to, and then the most aggressive controller is activated. In this proposed scheme, since the saturation is allowed and no hard constraint is needed to imposed on the controller input, we can makes fuller utilization of the available actuator capacity. The proposed anti-windup scheme provides the system stability and guaranteed peak-to-peak gain. The control strategy is carried out under the scheme of state feedback and the main results are presented in linear matrix inequality forms. The advantage of the proposed saturated allowed scheduling anti-windup scheme against the traditional saturation avoid method is illustrated through a numerical example.
暂无评论