Plane detection is a prerequisite for many computer vision tasks. This paper proposes a new method which can automatically detect planes from two projective images. Firstly, we modify Scott’s feature point matching m...Plane detection is a prerequisite for many computer vision tasks. This paper proposes a new method which can automatically detect planes from two projective images. Firstly, we modify Scott’s feature point matching method by post-processing its result with the concept of similarity, and then get the lines matching according to feature points matching based on the approximate invariance of the features’ distribution between two images. Finally, we group all feature points into subsets in terms of their geometric relations with feature lines as initial sets to estimate homography rather than by a random search strategy (like RANSAC) as in most existing methods. The proposed method is especially suitable to detecting planes in man-made scenes. This method is validated on real images.展开更多
In a CPM network, the longest path problem is one of the most important subjects. According to the intrinsic principle of CPM network, the length of the paths between arbitrary two nodes is presented. Furthermore, the...In a CPM network, the longest path problem is one of the most important subjects. According to the intrinsic principle of CPM network, the length of the paths between arbitrary two nodes is presented. Furthermore, the length of the longest path from start node to arbitrary node and from arbitrary node to end node is proposed. In view of a scheduling problem of two activities with float in the CPM scheduling, we put forward Barycenter Theory and prove this theory based on the algorithm of the length of the longest path. By this theory, we know which activity should be done firstly. At last, we show our theory by an example.展开更多
文摘Plane detection is a prerequisite for many computer vision tasks. This paper proposes a new method which can automatically detect planes from two projective images. Firstly, we modify Scott’s feature point matching method by post-processing its result with the concept of similarity, and then get the lines matching according to feature points matching based on the approximate invariance of the features’ distribution between two images. Finally, we group all feature points into subsets in terms of their geometric relations with feature lines as initial sets to estimate homography rather than by a random search strategy (like RANSAC) as in most existing methods. The proposed method is especially suitable to detecting planes in man-made scenes. This method is validated on real images.
基金Sponsored by the National Natural Science Foundation of China(Grant No.70671040)and Specialized Research Fund for the Doctoral Program of High Education(Grant No.20050079008).
文摘In a CPM network, the longest path problem is one of the most important subjects. According to the intrinsic principle of CPM network, the length of the paths between arbitrary two nodes is presented. Furthermore, the length of the longest path from start node to arbitrary node and from arbitrary node to end node is proposed. In view of a scheduling problem of two activities with float in the CPM scheduling, we put forward Barycenter Theory and prove this theory based on the algorithm of the length of the longest path. By this theory, we know which activity should be done firstly. At last, we show our theory by an example.
