• Proceedings of the Korea Contents Association Conference
• /
• 2006.11a
• /
• pp.200-204
• /
• 2006

They use emoticons as assistance to express their emotion on CMC communications. Emoticons have been developed into diverse forms like text emoticon, image emoticon, animation emoticon. However emoticons represent the emotion only in simple way, not in specific because the shortage of grouping expressions of the emotion. So, the emoticons used nowadays should be grouped specifically in order to help produce the modulated animation emoticons those are able to represent the feeling in specific and diverse way and be used conveniently. Therefore, this thesis is going to propose the design method of a new kind of animation emoticons those can make what animation emoticons used nowadays are not able to through the grouping and analyzing expression images according to faces, gesture(hand), and backgrounds(decoration) focused on the animation emoticons in messenger programs.

• Korean Journal Plant Pathology
• /
• v.13 no.1
• /
• pp.37-45
• /
• 1997

Disease incidence (DI), pre-emergence damping-off (PDO), days until the first symptom appeared (DUS), disease progress curve (DPC), and area under disease progress curve (AUDPC) were investigated in vivo after sowing ginseng seeds in each of 37 ginseng-cultivated soils which were sampled from 4 regions in Korea. Non linear fitting parameters, A, B, K and M, were estimated from the Richards' function, one of the disease progress models, by using the DI at each day from the bioassay. Inter- and intra-relationships between disease variables and stand-missing rate (SMR) in fields were investigated by using the simple correlation analysis. Disease variables of the root rot were divided into two groups: variables related to disease incidence, e.g., DI, AUDPC and A parameter, and variables related to disease progress, e.g., B, K and M parameters. DI, AUDPC, and DUS had significant correlations with SMR in ginseng fields, and then it showed that the disease development in vivo corresponded with that in fields. Soil samples could be separated into 3 and 4 groups, respectively, on the basis of the principal component 1 (PC1) and the principal component 2 (PC2), which were derived from the principal component analysis (PCA) of Richards' parameters, A, B, K and M. PC1 accounted for B, K and M parameters, and PC2 accounted for A parameter.

• Journal of the Institute of Convergence Signal Processing
• /
• v.15 no.4
• /
• pp.128-134
• /
• 2014

In this paper, we propose a detection method of the leukocyte motions in a microvessel by using spatiotemporal image analysis. The leukocyte motions that adhere to blood vessel walls can be visualized to move along the blood vessel wall's contours in a sequence of images. In this proposal method, we use the constraint that the leukocytes move along the blood vessel wall's contours and detect the leukocyte motions by using the spatiotemporal image analysis method. The generated spatiotemporal image is processed by a special-purpose orientation-selective filter and then subsequent grouping processes are done. The subsequent grouping processes select and group the leukocyte trace segments among all the segments obtained by simple thresholding and skeletonizing operations. Experimental results show that the proposed method can stably detect the leukocyte motions even when multiple leukocyte traces intersect each other.

• Journal of Intelligence and Information Systems
• /
• v.17 no.1
• /
• pp.111-125
• /
• 2011

Clustering is a process of grouping similar or relevant documents into a cluster and assigning a meaningful concept to the cluster. By this process, clustering facilitates fast and correct search for the relevant documents by narrowing down the range of searching only to the collection of documents belonging to related clusters. For effective clustering, techniques are required for identifying similar documents and grouping them into a cluster, and discovering a concept that is most relevant to the cluster. One of the problems often appearing in this context is the detection of a complex concept that overlaps with several simple concepts at the same hierarchical level. Previous clustering methods were unable to identify and represent a complex concept that belongs to several different clusters at the same level in the concept hierarchy, and also could not validate the semantic hierarchical relationship between a complex concept and each of simple concepts. In order to solve these problems, this paper proposes a new clustering method that identifies and represents complex concepts efficiently. We developed the Hierarchical Overlapping Clustering (HOC) algorithm that modified the traditional Agglomerative Hierarchical Clustering algorithm to allow overlapped clusters at the same level in the concept hierarchy. The HOC algorithm represents the clustering result not by a tree but by a lattice to detect complex concepts. We developed a system that employs the HOC algorithm to carry out the goal of complex concept detection. This system operates in three phases; 1) the preprocessing of documents, 2) the clustering using the HOC algorithm, and 3) the validation of semantic hierarchical relationships among the concepts in the lattice obtained as a result of clustering. The preprocessing phase represents the documents as x-y coordinate values in a 2-dimensional space by considering the weights of terms appearing in the documents. First, it goes through some refinement process by applying stopwords removal and stemming to extract index terms. Then, each index term is assigned a TF-IDF weight value and the x-y coordinate value for each document is determined by combining the TF-IDF values of the terms in it. The clustering phase uses the HOC algorithm in which the similarity between the documents is calculated by applying the Euclidean distance method. Initially, a cluster is generated for each document by grouping those documents that are closest to it. Then, the distance between any two clusters is measured, grouping the closest clusters as a new cluster. This process is repeated until the root cluster is generated. In the validation phase, the feature selection method is applied to validate the appropriateness of the cluster concepts built by the HOC algorithm to see if they have meaningful hierarchical relationships. Feature selection is a method of extracting key features from a document by identifying and assigning weight values to important and representative terms in the document. In order to correctly select key features, a method is needed to determine how each term contributes to the class of the document. Among several methods achieving this goal, this paper adopted the $x^2$�� statistics, which measures the dependency degree of a term t to a class c, and represents the relationship between t and c by a numerical value. To demonstrate the effectiveness of the HOC algorithm, a series of performance evaluation is carried out by using a well-known Reuter-21578 news collection. The result of performance evaluation showed that the HOC algorithm greatly contributes to detecting and producing complex concepts by generating the concept hierarchy in a lattice structure.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.4
• /
• pp.120-125
• /
• 2000

SNMP(Simple Network Management Protocol) could have the overhead of network, if the number of the agent system which is managed by the management system is increased by the polling for the collection of network management information and the reply traffic for it. In this Paper, the polling method used in SNMP is improved, and Group Polling method is proposed. This can reduce the overhead of network, on case that the agent system is to be increased. The proposed method collects information by grouping agent systems, and have smaller reply latency time and communication overhead than the previous method. So if the number of agent system or the Polling count is numerous, the proposed method is more efficient. As the result of the prototype test, the increasement of agent system can have small variation of traffic and transmission delay time.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.4
• /
• pp.277-285
• /
• 2004

We present a new hybrid stereo matching technique in terms of the co-operation of area-based stereo and feature-based stereo. The core of our technique is that feature matching is carried out by the reference of the disparity evaluated by area-based stereo. Since the reference of the disparity can significantly reduce the number of feature matching combinations, feature matching error can be drastically minimized. One requirement of the disparity to be referenced is that it should be reliable to be used in feature matching. To measure the reliability of the disparity, in this paper, we employ the self-consistency of the disunity Our suggested technique is applied to the detection of 3D line segments by 2D line matching using our hybrid stereo matching, which can be efficiently utilized in the generation of the rooftop model from urban imagery. We carry out the experiments on our hybrid stereo matching scheme. We generate synthetic images by photo-realistic simulation on Avenches data set of Ascona aerial images. Experimental results indicate that the extracted 3D line segments have an average error of 0.5m and verify our proposed scheme. In order to apply our method to the generation of 3D model in urban imagery, we carry out Preliminary experiments for rooftop generation. Since occlusions are occurred around the outlines of buildings, we experimentally suggested multi-image hybrid stereo system, based on the fusion of 3D line segments. In terms of the simple domain-specific 3D grouping scheme, we notice that an accurate 3D rooftop model can be generated. In this context, we expect that an extended 3D grouping scheme using our hybrid technique can be efficiently applied to the construction of 3D models with more general types of building rooftops.

• Korean Journal of Construction Engineering and Management
• /
• v.10 no.2
• /
• pp.111-120
• /
• 2009

The conceptual cost estimation used the construction project needs for confirm budget not only at the planning phase but also at the preliminary design phase of the construction project. Present, the conceptual cost estimation model have problems the rate of error is very large because the linear simple model calculate by use the cost of the unit meter or the unit square. This study development the model used grouping and the key quantity method, the mixed unit cost for solve problem of the very large rate of error. The result of this study reduced difference of between the real design construction cost therefor it expect that contribute to the client or the service company estimate budget of RC rahmen bridge.

• IE interfaces
• /
• v.15 no.2
• /
• pp.182-188
• /
• 2002

Clustering is widely used in various fields in order to investigate structural characteristics of the given data. One of the main tasks of clustering is to partition a set of objects into homogeneous groups for the purpose of data reduction. In this paper a simple but computationally efficient clustering procedure is devised and some statistical techniques to validate its clustered results are discussed. In the given procedure, the proper number of clusters and the clustered groups can be determined simultaneously. The whole procedure is applied to a practical clustering problem for the classification of reusable fuels in nuclear power plants.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.2
• /
• pp.1-11
• /
• 2009

This study presents HCWS algorithm for researcher grouping on a weighted researcher network. The weights represent intensity of connections among researchers based on the number of co-authors and the number of co-authored research papers. To confirm the validity of the proposed technique, this study conducted an experimentation on about 80 research papers. As a consequence, it is proved that HCWS algorithm is able to bring about more realistic clustering compared with HCS algorithm which presents semantic relations among researchers in simple connections. In addition, it is found that HCWS algorithm can address the problems of existing HCS algorithm; researchers are disconnected since their connections are classified as weak even though they are strong, and vise versa. The technique described in this research paper can be applied to efficiently establish social networks of researchers considering relations such as collaboration histories among researchers or to create communities of researchers.

• Journal of Ocean Engineering and Technology
• /
• v.17 no.1
• /
• pp.67-71
• /
• 2003

This paper presents the use of an evert system to automate process planning of block assembly, a task that is usually completed manually. In order to determine the sequence of assembly operation, a search method guided by rules, such as merging of related operations, grouping of similar operations, and precedence rules based on know-hows and geometrical reasoning, is used. In this paper, the expert system developed is explained in detail regarding a global database, control strategies, and rule bases. For verification purposes, the evert system has been applied to simple examples. Since the rule bases are isolated from the inference engine in the developed system, it is easy to add more rules in the future.