• The Korean Journal of Applied Statistics
• /
• v.33 no.5
• /
• pp.591-601
• /
• 2020

The self-organizing map (SOM) is a unsupervised learning method projecting high-dimensional data into low-dimensional nodes. It can visualize data in 2 or 3 dimensional space using the nodes and it is available to explore characteristics of data through the nodes. To understand the structure of data, cluster analysis is often used for nodes obtained from SOM. In cluster analysis, the optimal number of clusters is one of important issues. To help to determine it, various cluster validity indexes have been developed and they can be applied to clustering outcomes for nodes from SOM. However, while SOM has an advantage in that it reflects the topological properties of original data in the low-dimensional space, these indexes do not consider it. Thus, we propose a new cluster validity index for SOM based on connectivity between nodes which considers topological properties of data. The performance of the proposed index is evaluated through simulations and it is compared with various existing cluster validity indexes.

• Annual Conference of KIPS
• /
• 2018.05a
• /
• pp.481-483
• /
• 2018

AR은 VR과 달리 실세계 공간의 객체에 대한 서비스를 제공하므로 서비스 개발을 방해하는 많은 요인들이 발생한다. 이를 보완하기위해 비주얼 마커, SLAM, 객체인식 등 여러 AR 기술이 존재한다. 본 논문은 AR 기술 중에서 객체인식의 정확도 향상을 위해 지역가변 이진화(Local variable binarization)와 색상의 군집화를 사용해서 이미지에서 객체를 추출하는 방법을 제안한다. 지역 가변화는 픽셀을 순차적으로 읽어 들이면서 픽셀 주위의 값의 평균을 구하고, 이 값을 해당 픽셀의 임계 값으로 사용하는 알고리즘이다. 픽셀마다 주위 색상 값에 의해 임계 값이 변화되므로 윤곽선 표현이 기존의 이진화보다 뚜렷이 나타난다. 색상의 군집화는 객체의 중요색상과 배경의 중요색상을 중심으로 유사한 색상끼리 군집화 하는 것이다. 객체 내에서 가장 많이 나온 값과 객체 외에 가장 많이 나온 값을 각 각 기준으로 색조와 채도의 값을 Euclidean 거리를 사용해 객체의 색상과 배경 색상을 분리했다.

• Journal of the Economic Geographical Society of Korea
• /
• v.23 no.4
• /
• pp.408-424
• /
• 2020

This study attempts to analyze the spatial clustering of survived and closed coffee shops based on the land price and land use for each coffee shop location. The locational characteristics of survived and closed coffee shops for each cluster type are identified through various locational properties such as transport factors (physical accessibility), shop properties (franchise information, newly open/closed business experience), and spatial density (kernel density estimation). To this end, we categorize the clusters of survived and closed coffee shops into three types (general locational distribution type, commercialization type of residential area and location type of commercial center), and then analyze their locational characteristics. As the result, we found that the locations of newly open and closed coffee shops show different distribution characteristics, even though they are classified into the same type due to the double sidedness of new open and closed locations. The results of this study can be provided as basic data for planning the location of coffee shop as well as regional commercial district.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.3
• /
• pp.625-630
• /
• 2014

The amount of information is increasing rapidly with the development of the internet and the computer. Since these enormous information is managed by the document forms, it is necessary to search and process them efficiently. The document clustering technique which clusters the related documents through the similarity between the documents help to classify, search, and process the large amount of documents automatically. This paper proposes a method to find the initial seed points through principal component analysis when the documents represented by vectors in the feature vector space are clustered by K-means algorithm in order to increase clustering performance. The experiment shows that our method has a better performance than the traditional K-means algorithm.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1891-1894
• /
• 2003

본 논문에서는 분할 영상 좌보계 (split image coordinate: SIC)를 제안하여 3차원 영상의 주요 특징 중의 하나인 유, 무한 소실점을 그 위치의 무한성이나 카메라의 보정과 관계없이 정확하게 자동 추출하였다. 제안한 방법에서는 가우시안 구 (Gaussian sphere) 기반의 기존 방법들과는 달리 영상 공간을 누적 공간으로 활용함으로써 카메라 보정이나 영상의 사전정보가 없어도 원 영상의 정보 손실 없이 소실점을 추출할 수 있고, 영상을 무한대까지 확장한 후 분할하여 재정의 함으로써 유, 무한 소실점을 모두 추출할 수 있도록 하였다. 정확한 소실점의 검출을 위하여 직선 검출 과정에서는 방향성 마스크 (mask)를 사용하였으며, 직선들의 군집화 (clustering) 과정에서는 기울기 히스토그램 방법과 수평/수직 군집화 방법을 적응적으로 적용하였다. 제안한 방법을 합성 영상 및 건축물 (man-made environment) 영상에 적용시켜 유, 무한 소실점들을 효과적이고 정확하게 찾을 수 있음을 확인하였다.

• The Journal of the Korea Contents Association
• /
• v.6 no.12
• /
• pp.121-127
• /
• 2006

As information technologies are improving, geographical information system (GIS) technologies are also developing rapidly and demands for spatial analysis with GIS are increasing. Particularly, the spatial analyses with GIS researches have been noted rather than general GIS researches. However, most GIS researches focus on space dimension: a density-based clustering method (DBSCAN) or a DBSCAN algorithm using region expressed as Weight (DBSCAN-W) but the importance of rational decision making based on time dimension has been neglected. This study adopts system dynamics in order to put time dimension in GIS-based optimum allocation.

• Spatial Information Research
• /
• v.13 no.4 s.35
• /
• pp.355-364
• /
• 2005

Vector data sets (e.g. maps) are currently major sources of displaying, querying, and identifying locations of spatial features in a variety of applications. Especially in mobile environment, the needs for using spatial data is increasing, and the relative large size of vector maps need to be smaller. Recently, there have been several studies about vector map compression. There was clustering-based compression method with novel encoding/decoding scheme. However, precedent studies did not consider that spatial data have to be updated periodically. This paper explores the problem of existing clustering-based compression method. We propose an adaptive approximation method that is capable of handling data updates as well as reducing error levels. Experimental evaluation showed that when an updated event occurred the proposed adaptive approximation method showed enhanced positional accuracy compared with simple cluster based compression method.

• Journal of Digital Contents Society
• /
• v.18 no.7
• /
• pp.1249-1257
• /
• 2017

Due to the 4th industrial revolution and an aged society, many studies are being conducted to apply virtual reality to medical field. Research on dementia is especially active. This paper proposes virtual reality based on cognitive rehabilitation contents using image recognition and clustering method to improve cognitive and physical disabilities caused by dementia. Unlike the existing cognitive rehabilitation system, this paper uses travel photos that reflect the memories of the subjects to be treated. In order to generate automated cognitive rehabilitation contents, we extract face information, food pictures, place information, and time information from photographs, and normalization is performed for clustering. And we present scenarios that can be used as cognitive rehabilitation contents using travel photos in virtual reality space.

• Journal of the Korean Society for information Management
• /
• v.29 no.2
• /
• pp.45-70
• /
• 2012

There have been many methods and algorithms proposed for multidimensional scaling to mapping the relationships between data objects into low dimensional space. But traditional techniques, such as PROXSCAL or ALSCAL, were found not effective for visualizing the proximities between objects and the structure of clusters of large data sets have more than 50 objects. The CLUSCAL(CLUster-oriented SCALing) technique introduced in this paper differs from them especially in that it uses cluster structure of input data set. The CLUSCAL procedure was tested and evaluated on two data sets, one is 50 authors co-citation data and the other is 85 words co-occurrence data. The results can be regarded as promising the usefulness of CLUSCAL method especially in identifying clusters on MDS maps.

• Journal of the Korea Computer Graphics Society
• /
• v.16 no.4
• /
• pp.25-33
• /
• 2010

With the popularization of digital photography, people are now capturing and storing far more photos than ever before. However, the enormous number of photos often discourages the users to identify desired photos. In this paper, we present a novel method for fast and intuitive browsing through large collections of geo-referenced photographs. Given a set of photos, we construct a hierarchical structure of clusters such that each cluster includes a set of spatially adjacent photos and its sub-clusters divide the photo set disjointly. For each cluster, we pre-compute its convex hull and the corresponding polygon area. At run-time, this pre-computed data allows us to efficiently visualize only a fraction of the clusters that are inside the current view and have easily recognizable sizes with respect to the current zoom level. Each cluster is displayed as a single polygon representing its convex hull instead of every photo location included in the cluster. The users can quickly transfer from clusters to clusters by simply selecting any interesting clusters. Our system automatically pans and zooms the view until the currently selected cluster fits precisely into the view with a moderate size. Our user study demonstrates that these new visualization and interaction techniques can significantly improve the capability of navigating over large collections of geo-referenced photos.