Bin Samma A.S.Talib A.Z.Salam R.A.2024-05-292024-05-292010978077000000010.1109/CGIV.2010.252-s2.0-77958188026https://www.scopus.com/inward/record.uri?eid=2-s2.0-77958188026&doi=10.1109%2fCGIV.2010.25&partnerID=40&md5=4d145d9a5e38f2ebf3ddb8482189a061https://oarep.usim.edu.my/handle/123456789/9867Basically, detecting convex and concave points on the boundary of an object plays an important role in computer vision, object recognition and image understanding. In this paper a method that combines boundary and skeleton information for detecting these critical points is proposed. Specifically, the method is developed with the aim of obtaining high performance and efficiency, and producing a more robust method in detecting concave and convex points with minimum cost of computation. Furthermore, for faster execution of the proposed method, the detection of convex and concave points can be run concurrently. In order to evaluate the performance of the proposed method, the results of the proposed method are compared with three related convex and concave points detection methods. The experimental results have shown that the proposed method provides better output and detection rate. � 2010 IEEE.en-USBoundary informationConcaveConveSkeleton informationBoundary informationConcaveConveCritical pointsDetection methodsDetection ratesMinimum costRobust methodsSkeleton informationComputer graphicsComputer visionObject recognitionVisualizationComputational methodsConference Paper1131175576199