Two new recognition methods for the spatial planar POlygon using perspective invariants are presented. The corss-ratio (R c) of a vetex and the co-base area rotio (RA) of a edge in a spatial planar polygon are propose...Two new recognition methods for the spatial planar POlygon using perspective invariants are presented. The corss-ratio (R c) of a vetex and the co-base area rotio (RA) of a edge in a spatial planar polygon are proposed and used as the invariant primitive of the recognition eigenvector. The second distance error decision rule (SD EDR) estimating the relative error of RA is introduced also too. The mthods could recognize a spatial planar polygon with an arbitrary orientation through only a single perspective view. Experimental examples are gievn.展开更多
Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS)...Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS), a near optimal polygonal approximation was obtained. Compared to the famous Teh chin algorithm, our algorithms have obtained the approximated polygons with less number of vertices and less approximation error. Compared to the dynamic programming algorithm, the processing time of our algorithms are much less expensive.展开更多
文摘Two new recognition methods for the spatial planar POlygon using perspective invariants are presented. The corss-ratio (R c) of a vetex and the co-base area rotio (RA) of a edge in a spatial planar polygon are proposed and used as the invariant primitive of the recognition eigenvector. The second distance error decision rule (SD EDR) estimating the relative error of RA is introduced also too. The mthods could recognize a spatial planar polygon with an arbitrary orientation through only a single perspective view. Experimental examples are gievn.
文摘Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS), a near optimal polygonal approximation was obtained. Compared to the famous Teh chin algorithm, our algorithms have obtained the approximated polygons with less number of vertices and less approximation error. Compared to the dynamic programming algorithm, the processing time of our algorithms are much less expensive.