the close photogrammetric 3-D coordinate measurement is a newmeasuring technology in the fields of the coordinate measurementmachine (CMM) in recent years. In this method, we usually place sometargets on the measured ...the close photogrammetric 3-D coordinate measurement is a newmeasuring technology in the fields of the coordinate measurementmachine (CMM) in recent years. In this method, we usually place sometargets on the measured object and take image of targets to determinethe object coordinate. The subpixel location of target image plays animportant role in high accuracy 3-D coordinate measuring procedure.In this paper, some subpixel location methods are reviewed and somefactors which affect location precision are analyzed.展开更多
This paper divides the vertex set into several disjoined subsets and provides an optimal fault-tolerance routing algorithm based on the vertex set partition. This algorithm is efficient and convergent, in polynomial t...This paper divides the vertex set into several disjoined subsets and provides an optimal fault-tolerance routing algorithm based on the vertex set partition. This algorithm is efficient and convergent, in polynomial time, we can get the output if the vertex is given.展开更多
文摘the close photogrammetric 3-D coordinate measurement is a newmeasuring technology in the fields of the coordinate measurementmachine (CMM) in recent years. In this method, we usually place sometargets on the measured object and take image of targets to determinethe object coordinate. The subpixel location of target image plays animportant role in high accuracy 3-D coordinate measuring procedure.In this paper, some subpixel location methods are reviewed and somefactors which affect location precision are analyzed.
基金This project is supported by National Natural Science Foundation of Chins （10371049） and Science Foundation of Three Gorges University
文摘This paper divides the vertex set into several disjoined subsets and provides an optimal fault-tolerance routing algorithm based on the vertex set partition. This algorithm is efficient and convergent, in polynomial time, we can get the output if the vertex is given.
