• Design Convergence Study
• /
• v.16 no.4
• /
• pp.1-16
• /
• 2017

As the local manufacturing industry has entered a phase of stagnation, service and product design based on user experience has been highlighted as an alternative for the innovation. However, SMEs(Small and Medium-sized Enterprises) are still struggling to overcome the current crisis. One of the reasons is that SMEs do not have enough contact points with the validated UX firms and experts. Thus, SMEs has a high barrier to invest in new opportunity area, user experience. In this study, we aim to figure out UX experts' competence to perform the UX method to solve the UX problems based on the KSA framework(Knowledge, Skill, Attitude). Based on the literature review and expert workshop, we grouped the UX method according to the similarity of the competence required to conduct the method. With cluster analysis, 5 different groups of UX method were defined based on the competence, Panoramic Analysis, Meticulous Observation and Analysis, Intuitive Interpretation, Agile Visualization, and Logical Inspection. The results would be applied to compose a portfolio of UX experts and to implement a mechanism that could recommend the professional experts to the company.

• Journal of the Korean Geographical Society
• /
• v.30 no.3
• /
• pp.296-310
• /
• 1995

Classification of spatial units into meaningful sets is an important procedure in spatial analysis. It is crucial in characterizing and identifying spatial structures. But traditional classification methods such as cluster analysis require an exact database and impose a clear-cut boundary between classes. Scrutiny of realistic classification problems, however, reveals that available infermation may be vague and that the boundary may be ambiguous. The weakness of conventional methods is that they fail to capture the fuzzy data and the transition between classes. Fuzzy subsets theory is useful for solving these problems. This paper aims to come to the understanding of theoretical foundations of fuzzy spatial analysis, and to find the characteristics of fuzzy classification methods. It attempts to do so through the literature review and the case study of urban classification of the Cities and Eups of Kyung-Nam Province. The main findings are summarized as follows: 1. Following Dubois and Prade, fuzzy information has an imprecise and/or uncertain evaluation. In geography, fuzzy informations about spatial organization, geographical space perception and human behavior are frequent. But the researcher limits his work to numerical data processing and he does not consider spatial fringe. Fuzzy spatial analysis makes it possible to include the interface of groups in classification. 2. Fuzzy numerical taxonomic method is settled by Deloche, Tranquis, Ponsard and Leung. Depending on the data and the method employed, groups derived may be mutually exclusive or they may overlap to a certain degree. Classification pattern can be derived for each degree of similarity/distance $\alpha$. By takina the values of $\alpha$ in ascending or descending order, the hierarchical classification is obtained. 3. Kyung-Nam Cities and Eups were classified by fuzzy discrete classification, fuzzy conjoint classification and cluster analysis according to the ratio of number of persons employed in industries. As a result, they were divided into several groups which had homogeneous characteristies. Fuzzy discrete classification and cluste-analysis give clear-cut boundary, but fuzzy conjoint classification delimit the edges and cores of urban classification. 4. The results of different methods are varied. But each method contributes to the revealing the transparence of spatial structure. Through the result of three kinds of classification, Chung-mu city which has special characteristics and the group of Industrial cities composed by Changwon, Ulsan, Masan, Chinhai, Kimhai, Yangsan, Ungsang, Changsungpo and Shinhyun are evident in common. Even though the appraisal of the fuzzy classification methods, this framework appears to be more realistic and flexible in preserving information pertinent to urban classification.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.2
• /
• pp.1-14
• /
• 2000

The rosette-scan seeker, mounted on the infrared guided missile, is a device that tracks the target It can acquire the 2D image of the target by scanning a space about target in rosette pattern with a single detector Since the detected image is changed according to the position of the object in the field of view and the number of the object is not fixed, the unsupervised methods are employed in clustering it The conventional ISODATA method clusters the objects by using the distance between the seed points and pixels So, the clustering result varies in accordance with the shape of the object or the values of the merging and splitting parameters In this paper, we propose an Array Linkage Clustering Algorithm (ALCA) as a new clustering algorithm improving the conventional method The ALCA has no need for the initial seed points and the merging and splitting parameters since it clusters the object using the connectivity of the array number of the memory stored the pixel Therefore, the ALCA can cluster the object regardless of its shape With the clustering results using the conventional method and the proposed one, we confirm that our method is better than the conventional one in terms of the clustering performance We simulate the rosette scanning infrared seeker (RSIS) using the proposed ALCA as an infrared counter countermeasure The simulation results show that the RSIS using our method is better than the conventional one in terms of the tracking performance.

• The Journal of the Korea Contents Association
• /
• v.13 no.2
• /
• pp.211-219
• /
• 2013

The analysis method using Big Data has evolved based on the Big data Management Technology. There are quite a few researching institutions anticipating new era in data analysis using Big Data and IT vendors has been sided with them launching standardized technologies for Big Data management technologies. Big Data is also affected by improvements of IT gadgets IT environment. Foreran by social media, analyzing method of unstructured data is being developed focusing on diversity of analyzing method, anticipation and optimization. In the past, data analyzing methods were confined to the optimization of structured data through data mining, OLAP, statics analysis. This data analysis was solely used for decision making for Chief Officers. In the new era of data analysis, however, are evolutions in various aspects of technologies; the diversity in analyzing method using new paradigm and the new data analysis experts and so forth. In addition, new patterns of data analysis will be found with the development of high performance computing environment and Big Data management techniques. Accordingly, this paper is dedicated to define the possible analyzing method of social media using Big Data. this paper is proposed practical use analysis for social media analysis through data mining analysis methodology.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.465-472
• /
• 2006

Recently, many suggestions have been made in image segmentation methods for extracting human organs or disease affected area from huge amounts of medical image datasets. However, images from some areas, such as brain, which have multiple structures with ambiruous structural borders, have limitations in their structural segmentation. To address this problem, clustering technique which classifies voxels into finite number of clusters is often employed. This, however, has its drawback, the influence from noise, which is caused from voxel by voxel operations. Therefore, applying image enhancing method to minimize the influence from noise and to make clearer image borders would allow more robust structural segmentation. This research proposes an efficient structural segmentation method by filtering based clustering to extract detail structures such as white matter, gray matter and cerebrospinal fluid from brain MR. First, coherence enhancing diffusion filtering is adopted to make clearer borders between structures and to reduce the noises in them. To the enhanced images from this process, fuzzy c-means clustering method was applied, conducting structural segmentation by assigning corresponding cluster index to the structure containing each voxel. The suggested structural segmentation method, in comparison with existing ones with clustering using Gaussian or general anisotropic diffusion filtering, showed enhanced accuracy which was determined by how much it agreed with the manual segmentation results. Moreover, by suggesting fine segmentation method on the border area with reproducible results and minimized manual task, it provides efficient diagnostic support for morphological abnormalities in brain.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.2
• /
• pp.123-129
• /
• 2017

This paper proposes a new nonnegative matrix factorization (NMF) based direction-of-arrival (DOA) estimation method for multiple sound sources using a dual microphone array. First of all, sound signals coming from the dual microphone array are segmented into consecutive analysis frames, and a steered-response power phase transform (SRP-PHAT) beamformer is applied to each frame so that stereo signals of each frame are represented in a time-direction domain. The time-direction outputs of SRP-PHAT are stored for a pre-defined number of frames, which is referred to as a time-direction block. Next, In order to estimate DOAs robust to noise, each time-direction block is normalized along the time by using a block subtraction technique. After that, an unsupervised NMF method is applied to the normalized time-direction block in order to cluster the directions of each sound source in a multiple sound source environments. In particular, the activation and basis matrices are used to estimate the number of sound sources and their DOAs, respectively. The DOA estimation performance of the proposed method is evaluated by measuring a mean absolute error (MAE) and the standard deviation of errors between the oracle and estimated DOAs under a three source condition, where the sources are located in [$-35{\circ}$, 5m], [$12{\circ}$, 4m], and [$38{\circ}$, 4.m] from the dual microphone array. It is shown from the experiment that the proposed method could relatively reduce MAE by 56.83%, compared to a conventional SRP-PHAT based DOA estimation method.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.367-380
• /
• 2002

Due to recent increase in applications requiring huge amount of data such as spatial data analysis and image analysis, clustering on large databases has been actively studied. In a hierarchical clustering method, a tree representing hierarchical decomposition of the database is first created, and then, used for efficient clustering. Existing hierarchical clustering methods mainly adopted the bottom-up approach, which creates a tree from the bottom to the topmost level of the hierarchy. These bottom-up methods require at least one scan over the entire database in order to build the tree and need to search most nodes of the tree since the clustering algorithm starts from the leaf level. In this paper, we propose a novel top-down hierarchical clustering method that uses multidimensional indexes that are already maintained in most database applications. Generally, multidimensional indexes have the clustering property storing similar objects in the same (or adjacent) data pares. Using this property we can find adjacent objects without calculating distances among them. We first formally define the cluster based on the density of objects. For the definition, we propose the concept of the region contrast partition based on the density of the region. To speed up the clustering algorithm, we use the branch-and-bound algorithm. We propose the bounds and formally prove their correctness. Experimental results show that the proposed method is at least as effective in quality of clustering as BIRCH, a bottom-up hierarchical clustering method, while reducing the number of page accesses by up to 26～187 times depending on the size of the database. As a result, we believe that the proposed method significantly improves the clustering performance in large databases and is practically usable in various database applications.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.287-296
• /
• 2003

There has been much research focused on collaborative filtering technique in Recommender System. However, these studies have shown the First-Rater Problem and the Sparsity Problem. The main purpose of this Paper is to solve these Problems. In this Paper, we suggest the user's predicting preference method using Bayesian estimated value and the associative user clustering for the recalculation of preference. In addition to this method, to complement a shortcoming, which doesn't regard the attribution of item, we use Representative Attribute-Neighborhood method that is used for the prediction when we find the similar neighborhood through extracting the representative attribution, which most affect the preference. We improved the efficiency by using the associative user's clustering analysis in order to calculate the preference of specific item within the cluster item vector to the collaborative filtering algorithm. Besides, for the problem of the Sparsity and First-Rater, through using Association Rule Hypergraph Partitioning algorithm associative users are clustered according to the genre. New users are classified into one of these genres by Naive Bayes classifier. In addition, in order to get the similarity value between users belonged to the classified genre and new users, and this paper allows the different estimated value to item which user evaluated through Naive Bayes learning. As applying the preference granted the estimated value to Pearson correlation coefficient, it can make the higher accuracy because the errors that cause the missing value come less. We evaluate our method on a large collaborative filtering database of user rating and it significantly outperforms previous proposed method.

• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.2
• /
• pp.109-114
• /
• 2012

Honeycombs are dense structures that small cysts, which generally have about 2~10 mm in diameter, are surrounded by the wall of fibrosis. When honeycomb is found in the patients, the incidence of acute exacerbation is generally very high. Thus, the observation and quantitative measurement of honeycomb are considered as a significant marker for clinical diagnosis. In this point of view, we propose an automatic segmentation method using morphological image processing and assessment of the degree of clustering techniques. Firstly, image noises were removed by the Gaussian filtering and then a morphological dilation method was applied to segment lung regions. Secondly, honeycomb cyst candidates were detected through the 8-neighborhood pixel exploration, and then non-cyst regions were removed using the region growing method and wall pattern testing. Lastly, final honeycomb regions were segmented through the extraction of dense regions which are consisted of two or more cysts using cluster analysis. The proposed method applied to 80 High resolution computed tomography (HRCT) images and achieved a sensitivity of 89.4% and PPV (Positive Predictive Value) of 72.2%.

• Horticultural Science & Technology
• /
• v.29 no.4
• /
• pp.366-373
• /
• 2011

To analyze the genetic relationships among Korean potato cultivars and to develop cultivar identification method using DNA markers, we carried out genotyping using simple sequence repeats (SSR) analysis and developed multiplex-SSR set. Initially, we designed 92 SSR primer combinations reported previously and applied them to twenty four Korean potato cultivars. Among the 92 SSR markers, we selected 14 SSR markers based on polymorphism information contents (PIC) values. PIC values of the selected 14 markers ranged from 0.48 to 0.89 with an average of 0.76. PIC value of PSSR-29 was the lowest with 0.48 and PSSR-191 was the highest with 0.89. UPGMA clustering analysis based on genetic distances using 14 SSR markers classified 21 potato cultivars into 2 clusters. Cluster I and II included 16 and 5 cultivars, respectively. And 3 cultivars were not classified into major cluster group I and II. These 14 SSR markers generated a total of 121 alleles and the average number of alleles per SSR marker was 10.8 with a range from 3 to 34. Among the selected markers, we combined three SSR markers, PSSR-17, PSSR-24 and PSSR-24, as a multiplex-SSR set. This multiplex-SSR set used in the study can distinguish all the cultivars with one time PCR and PAGE (Polyacrylamide gel electrophoresis) analysis and PIC value of multiplex-SSR set was 0.95.