排序方式: 共有24条查询结果,搜索用时 15 毫秒
21.
A stable skeleton is very important to some applications such as vehicle navigation, object represent and pattern recognition. The connection skeleton is just one that not only can be computed stably but also can figure the connectivity structure of contour. A new method named continuous connectivity detection and a new model named approximate regular polygon (ARP) were proposed for connection skeleton extraction. Both the method and the model were tested by the real maps of road network including flyovers, interchanges and other common object contours. Satisfactory results were obtained. 相似文献
22.
In this paper, we use 1D rotating objects to calibrate camera. The calibration object has three collinear points. It is not
necessary for the object to rotate around one of its endpoints as before; instead, it rotates around the middle point in a
plane. In this instance, we can use two calibration constraints to compute the intrinsic parameters of a camera. In addition,
when the 1D object moves in a plane randomly, the proposed technique remains valid to compute the intrinsic parameters of
a camera. Experiments with simulated data as well as with real images show that our technique is accurate and robust. 相似文献
23.
24.
In this paper,we introduce a novel class of coplanar conies,the pencil of which can doubly contact to calibrate camera and estimate pose.We first analyze the properties of con-axes and con-eccentricity ellipses, which consist of a natural extending pattern of concentric circles.Then the general case that two ellipses have two repeated complex intersection points is presented.This degenerate configuration results in a one-parameter family of homographies which map the planar pattern to its image.Although it is unable to compute the complete homography,an indirect 3-degree polynomial or 5-degree polynomial constraint on intrinsic parameters from one image can also be used for camera calibration and pose estimation under the minimal conditions.Furthermore, this nonlinear problem can be treated as a polynomial optimization problem(POP) and the global optimization solution can be also obtained by using SparsePOP(a sparse semidefinite programming relaxation of POPs). Finally,the experiments with simulated data and real images are shown to verify the correctness and robustness of the proposed technique. 相似文献