Paper Info
Title
Efficient 3D region guarding for multimedia data processing
Abstract
With the advance of scanning devices, 3-d geometric models have been captured and widely used in animation, video, interactive virtual environment design nowadays. Their effective analysis, integration, and retrieval are important research topics in multimedia. This paper studies a geometric modeling problem called 3D region guarding. The 3D region guarding is a well known NP-hard problem; we present an efficient hierarchical integer linear programming (HILP) optimization algorithm to solve it on massive data sets. We show the effectiveness of our algorithm and briefly illustrate its applications in multimedia data processing and computer graphics such as shape analysis and retrieval, and morphing animation.
Year
DOI
Venue
2011
10.1109/ICME.2011.6011953
ICME
Keywords
Field
DocType
effective analysis,geometric modeling problem,optimization algorithm,3-d geometric model,shape analysis,np-hard problem,computer graphics,multimedia data processing,morphing animation,massive data set,computational modeling,interpolation,np hard problem,skeleton,optimization,computer graphic,shape,approximation algorithms,geometric model
Data processing,Virtual machine,Computer science,Theoretical computer science,Integer programming,Artificial intelligence,Computer graphics,Morphing,Approximation algorithm,Computer vision,Geometric modeling,Animation,Multimedia
Conference
ISSN
Citations 
PageRank 
1945-7871
0
0.34
References 
Authors
16
4
Name
Order
Citations
PageRank
Wuyi Yu1574.94
Maoqing Li2608.53
S. S. Iyengar3668.80
Xin Li432.48