Complete labeling set for 3D-sketch with occlusion

doi:10.3778/j.issn.1002-8331.2009.21.055

Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (21): 189-192.DOI: 10.3778/j.issn.1002-8331.2009.21.055

• 理论科学研究 • Previous Articles Next Articles

Complete labeling set for 3D-sketch with occlusion

GUO Jing ^1，2，LIAO Shi-zhong¹

1.School of Computer Science and Technology，Tianjin University，Tianjin 300072，China
2.School of Computer Technology and Automation，Tianjin Polytechnic University，Tianjin 300160，China

Received:2009-05-05 Revised:2009-06-05 Online:2009-07-21 Published:2009-07-21
Contact: GUO Jing

有遮挡三维草图的标注完备集

郭景^1，2，廖士中¹

1.天津大学计算机科学与技术学院，天津 300072
2.天津工业大学计算机与自动化学院，天津 300160

通讯作者: 郭景

Abstract

Abstract: Line labeling is an essential approach to spatial semantics representation for 3D-sketch.Almost all of the previous works converted sketches to tidy line drawings before labeling，as they used the label sets derived from perfect projections of 3D objects.This paper addresses 3D-sketch labeling problem in the blocks world，and proposes a complete labeling set for 3D-sketch with occlusion，which can be used to label 3D-sketches directly without tidying.This label set can not only realize the labeling of true 3D-sketch，but also shed new light on the semantics representation of 3D-sketch.

Key words: 3D-sketch understanding, semantics representation, line labeling, completeness

摘要： 线型标注是三维草图语义描述的基本方法。已有工作大都应用三维实体精确投影图所产生的标号集来标注规整后的草图，没有实现真正意义上的三维草图标注。研究积木世界三维草图的标注问题，提出了一个有遮挡三维草图标注的标号集，并证明了其完备性。该标号集能够直接标注草图而无需对草图进行规整，从而实现了真正意义上的三维草图标注，为三维草图语义描述提供了一种新思路。

关键词: 三维草图理解, 语义描述, 线型标注, 完备性

GUO Jing ^1，2，LIAO Shi-zhong¹. Complete labeling set for 3D-sketch with occlusion[J]. Computer Engineering and Applications, 2009, 45(21): 189-192.

郭景^1，2，廖士中¹. 有遮挡三维草图的标注完备集[J]. 计算机工程与应用, 2009, 45(21): 189-192.

[1]	ZHANG Kaibi, ZHOU Zhen, WEI Pengcheng, LI Li. Multi-Keyword Verifiable Ciphertext Search Scheme in Outsourced Database [J]. Computer Engineering and Applications, 2019, 55(17): 76-81.
[2]	BAI Zhi’an1, ZENG Jianping2. Optimal Selection Method for LDA Topics Based on Degree of Overlap and Completeness [J]. Computer Engineering and Applications, 2019, 55(12): 155-161.
[3]	HE Zhaoyang, DU Yuyue, WANG Lu. Process mining algorithm for discovering special loop structures [J]. Computer Engineering and Applications, 2018, 54(22): 42-50.
[4]	LI Shiyang, WANG Xiaoming. Multi-user verifying completeness and integrity encrypted keyword query in cloud storage [J]. Computer Engineering and Applications, 2016, 52(7): 132-138.
[5]	LV Jianghua1, LIU Zhifeng1, XU Yatao2, ZHOU Conghua1. Verification of correctness of attribute based access control [J]. Computer Engineering and Applications, 2016, 52(18): 98-103.
[6]	ZOU Muquan, WANG Lizhen, YAO Huachuan. Spatial colocation patterns discovery in fuzzy spatial [J]. Computer Engineering and Applications, 2014, 50(7): 108-115.
[7]	PENG Li, YANG Hengfu. ABox consistency decision algorithm for description logic SHIN [J]. Computer Engineering and Applications, 2013, 49(20): 55-62.
[8]	SHI Huixian¹，WANG Guojun^1，2. Logic system MTL_▽and its completeness [J]. Computer Engineering and Applications, 2011, 47(6): 30-33.
[9]	ZHANG Sheng-li^1，2，PAN Zheng-hua². One new model of infinite valued for medium proposition logic and its meaning [J]. Computer Engineering and Applications, 2010, 46(31): 45-49.
[10]	SHENG Gang¹，CUI Xin-chun². Query completeness verification of outsourced databases [J]. Computer Engineering and Applications, 2009, 45(28): 145-147.
[11]	CHEN Jian-nan. Preliminary study of balanced perfect magic square of prime order [J]. Computer Engineering and Applications, 2009, 45(21): 179-182.
[12]	LIU Yun,GAN Zhi-jie. Study on hand completeness checking algorithm based on Hu moments and SVM and its application [J]. Computer Engineering and Applications, 2008, 44(30): 223-225.
[13]	LI Pei-wu. Authorization specification of usage control with Petri net [J]. Computer Engineering and Applications, 2008, 44(2): 60-62.
[14]	Liu Yuzhen. Results on decision of the minimal covering members for regular separable relation [J]. Computer Engineering and Applications, 2007, 43(5期): 28-29.
[15]	. Complexity Analysis of A Class of Problems on Batch Scheduling and Its Approximated Algorithm [J]. Computer Engineering and Applications, 2007, 43(3期): 175-175.

Complete labeling set for 3D-sketch with occlusion

有遮挡三维草图的标注完备集

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics