• The Journal of Korea Robotics Society
• /
• v.17 no.3
• /
• pp.255-263
• /
• 2022

3D object detection pipelines often incorporate RGB-based object detection methods such as YOLO, which detects the object classes and bounding boxes from the RGB image. However, in complex environments where objects are heavily cluttered, bounding box approaches may show degraded performance due to the overlapping bounding boxes. Mask based methods such as Mask R-CNN can handle such situation better thanks to their detailed object masks, but they require much longer time for data preparation compared to bounding box-based approaches. In this paper, we present a 3D object recognition pipeline which uses either the YOLO or Mask R-CNN real-time object detection algorithm, K-nearest clustering algorithm, mask reduction algorithm and finally Principal Component Analysis (PCA) alg orithm to efficiently detect 3D poses of objects in a complex environment. Furthermore, we also present an improved YOLO based 3D object detection algorithm that uses a prioritized heightmap clustering algorithm to handle overlapping bounding boxes. The suggested algorithms have successfully been used at the Artificial-Intelligence Robot Challenge (ARC) 2021 competition with excellent results.

• Journal of the Korean Society of Safety
• /
• v.11 no.1
• /
• pp.39-45
• /
• 1996

In this study, clustering of black BADUK stones' image were performed to recognize the individual stone from its closely spaced and partially occluded Image. And the clustering perfomance was compared between the classical methods and fuzzy C-means method. As a result, 2 BADUK stones' image was segmented precisely in every methods, but more than 3 stones the segmentation was depended on its shape. Fuzzy C-means method could be segmented correctly to 4 stones regardless of its shape, and It could be applied to the unknown number of clusters.

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.293-298
• /
• 2006

Many data are stored in database. For getting any information from many data, we use the query sentences. These information is basic and simple. Data mining method is various. In this paper, we manage clustering and association rules. We present a method for finding the better association rules, and we solve a problem of the existing association rules. We propose and apply a new clustering method to fit for association rules. It is not clustering of the existing distance basis or category basis. If we find association rules of each clusters, we can get not only existing rules found in all transaction but also rules that will be characteristics of clusters. Through this study, we can expect that we will reduce the number of many transaction access in large databases and find association of small group.

• The KIPS Transactions:PartD
• /
• v.15D no.2
• /
• pp.171-178
• /
• 2008

Since the XML standard was introduced by the W3C in 1998, documents that have been written in XML have been gradually increasing. Accordingly, several systems have been developed in order to efficiently manage and retrieve massive XML documents. BitCube-a bitmap indexing system-is a representative system for this field of research. Based on the bitmap indexing technique, the path bitmap indexing system(LH06), which performs the clustering of similar paths, improved the problem that the existing BitCube system could not solve, namely, determining similar paths. The path bitmap indexing system has the advantage of a higher retrieval speed in not only exactly matched path searching but also similar path searching. However, the similarity calculation algorithm of this system has a few particular problems. Consequently, it sometimes cannot calculate the similarity even though some of two paths have extremely similar relationships; further, it results in an increment in the number of meaningless clusters. In this paper, we have proposed a novel method that clustering, the similarity between the paths in order to solve these problems. The proposed system yields a stable result for clustering, and it obtains a high score in clustering precision during a performance evaluation against LH06.

• Journal of the Korea Computer Graphics Society
• /
• v.15 no.3
• /
• pp.19-26
• /
• 2009

In this paper, a new adaptive vertex clustering using a KD-tree is presented for 3D mesh partitioning. A vertex clustering is used to divide a huge 3D mesh into several partitions for various mesh processing. An octree-based clustering and K-means clustering are currently leading techniques. However, the octree-based methods practice uniform space divisions and so each partitioned mesh has non-uniformly distributed number of vertices and the difference in its size. The K-means clustering produces uniformly partitioned meshes but takes much time due to many repetitions and optimizations. Therefore, we propose to use a KD-tree to efficiently partition meshes with uniform number of vertices. The bounding box region of the given mesh is adaptively subdivided according to the number of vertices included and dynamically determined axis. As a result, the partitioned meshes have a property of compactness with uniformly distributed vertices.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.3D
• /
• pp.347-356
• /
• 2009

This paper is described clustering analysis of traffic characteristics-based highway classification in order to deviate from methodologies of existing highway functional classification. This research focuses on comparing the clustering techniques performance based on the total within-group errors and deriving the optimal number of cluster. This research analyzed statistical clustering method (Hierarchical Ward's minimum-variance method, Nonhierarchical K-means method) and Kohonen self-organizing maps clustering method for highway characteristic classification. The outcomes of cluster techniques compared for the number of samples and traffic characteristics from subsets derived by the optimal number of cluster. As a comprehensive result, the k-means method is superior result to other methods less than 12. For a cluster of more than 20, Kohonen self-organizing maps is the best result in the cluster method. The main contribution of this research is expected to use important the basic road attribution information that produced the highway characteristic classification.

• The Journal of the Korea Contents Association
• /
• v.8 no.2
• /
• pp.18-26
• /
• 2008

This paper presents a phased visualization method of facial expression space that enables the user to control facial expression of 3D avatars by select a sequence of facial frames from the facial expression space. Our system based on this method creates the 2D facial expression space from approximately 2400 facial expression frames, which is the set of neutral expression and 11 motions. The facial expression control of 3D avatars is carried out in realtime when users navigate through facial expression space. But because facial expression space can phased expression control from radical expressions to detail expressions. So this system need phased visualization method. To phased visualization the facial expression space, this paper use fuzzy clustering. In the beginning, the system creates 11 clusters from the space of 2400 facial expressions. Every time the level of phase increases, the system doubles the number of clusters. At this time, the positions of cluster center and expression of the expression space were not equal. So, we fix the shortest expression from cluster center for cluster center. We let users use the system to control phased facial expression of 3D avatar, and evaluate the system based on the results.

• Journal of the Korean Society of Food Science and Nutrition
• /
• v.46 no.3
• /
• pp.374-380
• /
• 2017

Image analysis and k-mean clustering were conducted to develop a grading system of dried sea cucumber (SC) based on rehydration rate. The SC images were obtained by taking pictures in a box under controlled light conditions. The region of interest was extracted to depict the shape of the SC in a 2D graph, and those 2D shapes were rendered to build a 3D model. The results from the image analysis provided the morphological features of the SC, including length, width, surface area, and volume, to obtain the parameters of the k-mean clustering weight. The k-mean clustering classified the SC samples into three different grades. Each SC sample was rehydrated at $30^{\circ}C$ for 40 h. During rehydration, the flux of each grade was analyzed. Our study demonstrates that the mass transfer rate of SC increased as the surface area increased, and the grade of SC was classified based on rehydration rate. This study suggests that the optimal rehydration process for SC can be achieved by applying a suitable grading system.

• Korean Journal of Remote Sensing
• /
• v.27 no.3
• /
• pp.289-301
• /
• 2011

In this paper an attempt has been made to classify Asia land cover considering climatic and vegetative characteristics. The sub-class clustering based on the 13 MODIS land cover classes (except water) over Asia was performed with the climate map and the NOVI derived from SPOT 5 VGT D10 data. The unsupervised classification for the sub-class clustering was performed in each land cover class, and total 74 clusters were determined over the study area. Via these clusters, the annual variations (from 1999 to 2007) of precipitation rate and temperature were analyzed as an example by a simple linear regression model. The various annual variations (negative or positive pattern) were represented for each cluster because of the various climate zones and NOVI annual cycles. Therefore, the detailed land cover map as the classification result by the sub-class clustering in this study can be useful information in modelling works for requiring the detailed climatic and vegetative information as a boundary condition.

• Journal of the Korean institute of surface engineering
• /
• v.55 no.3
• /
• pp.164-172
• /
• 2022

Hot-dip galvanized steel(GI) is widely used throughout the industry as a corrosion resistance material. Corrosion of steel is a common phenomenon that results in the gradual degradation under various environmental conditions. Corrosion monitoring is to track the degradation progress for a long time. Corrosion on steel plate appears as discoloration and any irregularities on the surface. This study developed a quantitative evaluation method of the rust formed on GI steel plate using a superpixel-based DBSCAN clustering method and k-means clustering from the corroded area in a given image. The superpixel-based DBSCAN clustering method decrease computational costs, reaching automatic segmentation. The image color of the rusty surface was analyzed quantitatively based on HSV(Hue, Saturation, Value) color space. In addition, two segmentation methods are compared for the particular spatial region using their histograms.