Simplification computing for visual events based on distinct silhouette and view-independent pruning algorithm

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, a practical and efficient algorithm based on the triangulated polyhedra is proposed to calculate EV (Edge & Vertex) and EEE (Triple Edge) events for 3D viewpoint space partition. At first step a few triangular faces that contain distinct silhouette vertexes and edges are chosen in order to simplify the model, and then some of the EV and EEE events occluded by other faces is pruned by using the view-independent pruning algorithm. After the first step, the rest of EV and EEE events are actual critical events which are then calculated for space partition. Therefore we avoid calculating many EV and EEE events which are not actually existent before space partition so that it reduces computational complexity enormously. In the last section of this paper, we apply this method to two kinds of aircraft models and one kind of car model for experiments. The results show that it can effectively carry out calculation of EV and EEE events and space partition. And the representative viewpoints are placed over the viewpoint space evenly. On this foundation, actual 3D object recognitions could also be implemented. © Springer-Verlag Berlin Heidelberg 2013.

Cite

CITATION STYLE

APA

Ma, H., & Chen, X. (2013). Simplification computing for visual events based on distinct silhouette and view-independent pruning algorithm. In Communications in Computer and Information Science (Vol. 363, pp. 243–253). Springer Verlag. https://doi.org/10.1007/978-3-642-37149-3_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free