计算机科学 ›› 2023, Vol. 50 ›› Issue (11A): 230300237-5.doi: 10.11896/jsjkx.230300237

• 交叉&应用 • 上一篇    下一篇

二维多边形物体剖分研究

金建国   

  1. 浙江工业大学理学院应用数学系 杭州 310032
  • 发布日期:2023-11-09
  • 通讯作者: 金建国(npy20022003@zjut.edu.cn)
  • 基金资助:
    国家自然科学基金(61972458)

Study on Decomposition of Two-dimensional Polygonal Objects

JIN Jianguo   

  1. Applied Mathematics Department of Science College,Zhejiang University of Technology,Hangzhou 310032,China
  • Published:2023-11-09
  • About author:JIN Jianguo,born in 1970,Ph.D,asso-ciate professor.His main research interests include computer graphics and applied mathematics.
  • Supported by:
    National Natural Science Foundation of China(61972458).

摘要: 文中对二维多边形物体有意义剖分进行了研究。心理学家通过研究后发现对物体进行有意义的剖分是人类识别物体的一个重要过程。研究对二维多边形物体的剖分,对于图像识别具有重要意义。在进行图像识别时可首先提取图像中物体的边缘,并用封闭多边形表示。研究如何对该多边形进行有意义的剖分,是正确识别该图像中的物体很关键的一步。文中首先用谱分析结合K-均值的方法,对要剖分的多边形的顶点进行聚类,然后用计算多边形剖分线段适合度的方法,递归地在顶点类内部和顶点类之间选择最佳剖分线段,实验结果表明了该方法的有效性。该算法剖分结果和知名的人工剖分结果的定量分析比较表明,算法剖分结果符合人类思维,取得了较好的剖分结果。

关键词: 模式识别, 多边形剖分, 谱分析, 聚类, 凸率

Abstract: This paper studies how to decompose the two-dimensional polygonal objects into meaningful parts.Psychologists have found that meaningful decomposition of objects is an important process for human beings to recognize objects.Especially,in image recognition,after the edge of the object in the image has been detected,the edge can be expressed as a closed polygon.So how to decompose the polygon is a very important step to recognize the object in image.In this paper,we first separate the vertices of polygon into several clusters by spectral analysis combined with K-means,and then by computing cut line fitness proposed in the paper,the algorithm choose the best cut line recursively on between-cluster and within-cluster.Experimental results show the effectiveness of this method.The quantitative analysis and comparison between the algorithm and the well-known artificial decomposition data set show that the algorithm decomposition results are in line with human thinking and have achieved good decomposition results.

Key words: Pattern recognition, Polygon decomposition, Spectral analysis, Clustering, Convexity

中图分类号: 

  • TP391
[1]SIDDIQI K,KIMIA B B.Parts of Visual Form:ComputationalAspects[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,1995,17:239-251.
[2]LATECKI L J,LAKAMPER R.Convexity Rule for Shape Decomposition Based on Discrete Contour Evolution[J].Computer Vision and Image Understanding,1999,73(3):441-454.
[3]LIEN J M,AMATO N M.Approximate Convex Decomposition of Polygons[C]//SCG’04.Brooklyn,New York,USA,2004:9-11.
[4]BERTAMINI M,WAGEMANS J.Processing convexity andconcavity along a 2-D contour:figure-ground,structural shape,and attention[J].Psychon Bull Rev,2013,20:191-207.
[5]MENG F M,LI H L,WU Q B,et al.Seeds-Based Part Segmentation by Seeds propagation and Region Convexity Decomposition[J].IEEE Transactions on multimedia,2018,20(2):310-322.
[6]LI Z Y,QU W Y,QI H,et al.Near-convex decomposition of 2D shape using visibility range[J].Computer Vision and Image Understing,2021,210(9):103243.
[7]HOFFMAN D D,SINGH M.Salience of visual parts[J].Cognition,1997,63(1):29-78.
[8]BRAUNSTEIN M L,HOFFMAN D D,SAIDPOUR A.Parts of visual objects:an experimental test of the minima rule[J].Perception,1989,18:817-826.
[9]XU Y,EARLY S M.Computation of part structure:Evidence from visual search[J].Perception and Psychophysics,2002,64:1039-1054.
[10]LIN H Y S,LIAO H Y M,LIN J C.Visual Salience-Guided Mesh Decomposition[J].IEEE Transactions on Multimedia,2007,9(1):46-57.
[11]SINGH M,SEYRANIAN G D,HOFFMAN D D.Parsing Silhouettes:The Short-Cut rule[J].Perception and Psychophysics,1999,61:636-660.
[12]LUO L,SHEN C H,LIU X W,et al.A Computational Model of the Short-Cut Rule for 2D Shape Decomposition[J].IEEE Transactions on Image Processing,2015,24(1):273-283.
[13]TANASE M,VELTKAMP R C.Polygon Decomposition based on the Straight Line Skeleton[C]//SOCG’03.San Diego,USA,2002:58-67.
[14]LIEN J M,KEYSER J,AMATO N M.Simultaneous Shape Decomposition and Skeletonization[C]//ACM Symposium on Solid and Physical Modeling(SPM 2006).Cardiff,UK,2006:219-228.
[15]PAPANELOPOULOS N,AVRITHIS Y,KOLLIAS S.Revisiting the Medial Axis for Planar Shape Decomposition[J].Computer Vision and Image Understanding,2019,179:66-78.
[16]DE WINTER J,WAGEMANS J.Segmentation of object outlines into parts:A large-scale integrative study[J].Cognition,2006,99:275-325.
[17]LIU R,ZHANG H.Segmentation of 3D Meshes through Spectral Clustering[C]//Proceedings of the 12th Pacific Conference on Computer Graphics and Applictaions.2004.
[18]CHAHHOU M,MOUMOUN L,El FAR M,et al.Segmentation of 3D Meshes Using p-Spectral Clustering[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2014,36(8):1687-1693.
[19]PANG Y W,XIE J,NIE F P,et al.Spectral Clustering by Joint Spectral Embedding and Spectral Rotation[J].IEEE Transactions on Cybernetics,2020,50(1):247-258.
[20]DUDA R O,HART P E,STORK D G.Pattern Classification,Second Edition[M].Wiley-Interscience Publication,2001:117-124.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!