Previous | [ 1] | [ 2] | [ 3] | [ 4] | [ 5] | [ 6] | [ 7] | [ 8] | [ 9] | [ 10] | [ 11] | [ 12] | [ 13] | [ 14] | [ 15] | [ 16] | [ 17] | [ 18] | [ 19] | [ 20] |

¡@

JUNG-SHIONG CHANG, ARTHUR CHUN-CHIEH SHIH^{+}, HSIAO-RONG TYAN^{++} AND WEN-HSIEN FANG

* Department of Electronic
Engineering
National Taiwan University of Science and Technology
Taipei, 106 Taiwan
*

We propose an automatic mesh decomposition technique based on principal component analysis (PCA) and Boolean operations. First, we calculate the normalized protrusion degree of each dual vertex on a smoothed 3-D mesh. The protrusion degree of a vertex and the vertex¡¦s 3-D coordinates form a 4-D feature vector, which we use to represent the polygon mesh. Then, we apply PCA to the set of 4-D feature vectors. The projected data along the first principal axis reveals the salient structures of the 3-D object. Therefore, by using the first component axis as the search basis, we can identify all the salient parts of an arbitrary 3-D object.

* Keywords: * mesh decomposition,
Boolean operation, PCA, protrusion degree, 3-D object

Retrieve PDF document
(**200907_01.pdf**)

Received April 25, 2008; revised May 1, 2008; accepted
May 8, 2008.

Communicated by Tsan-sheng Hsu.

^{*} The preliminary version has been presented in IEEE International
Workshop on Multimedia Signal Processing (MMSP 2007), Chania, Crete, Greece,
October 2007.