• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.159-171
• /
• 2007

This paper proposes a software tool MADE that is useful to develop a practical Korean morphological analyzer. A morphological analysis is performed by using adjacency conditions provided by a morphological dictionary. This means that developing a morphological analyzer is reduced merely to constructing a morphological dictionary. No programming skill is required in this process, MADE provides with useful functions that facilitate the construction of a dictionary. Once a dictionary is constructed, the morphological analysis engine embedded in MADE may be used as a stand-alone morphological analyzer or be integrated into an application software which requires a Korean morphological analysis module.

• Journal of the Korean housing association
• /
• v.7 no.1
• /
• pp.117-126
• /
• 1996

The purpose of this paper is to develop formal design principles towards flexible house plan. A flexible house plan accomodates spatial requirements corresponding to change of life style and provides a way of saving architectural materials. Design properties as a basis for manipulation of room includes adjacency, orientation and geometrical information which are suited well to flexible design. This paper has developed a formal grammar of shape which can be utilized to transform house plan. Flexible design presented here is based on the idea of various operations of the shape grammar. The shape grammar, as a set of rules, specifies manipulations of shapes for reorganization of spatial relationships of rooms in a house plan. It lists exemplary rules in control knowledge which guides design processes for modifying a plan. An example taken from house plan design is used to ilustrate important aspects of the flexible design which fundamentally provides the basis for architectural material saving.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.1137-1139
• /
• 2003

This paper proposed a practical method for building detection and extraction using airborne laser scanning data. The proposed method consists mainly of two processes: low and high level processes. The major distinction from the previous approaches is that we introduce a concept of pseudogrid (or binning) into raw laser scanning data to avoid the loss of information and accuracy due to interpolation as well as to define the adjacency of neighboring laser point data and to speed up the processing time. The approach begins with pseudo-grid generation, noise removal, segmentation, grouping for building detection, linearization and simplification of building boundary , and building extraction in 3D vector format. To achieve the efficient processing, each step changes the domain of input data such as point and pseudo-grid accordingly. The experimental results shows that the proposed method is promising.

• Korean Journal of Remote Sensing
• /
• v.23 no.3
• /
• pp.199-209
• /
• 2007

Traditionally, aerial images have been used as main sources for compiling topographic maps. In recent years, lidar data has been exploited as another type of mapping data. Regarding their performances, aerial imagery has the ability to delineate object boundaries but omits much of these boundaries during feature extraction. Lidar provides direct information about heights of object surfaces but have limitations with respect to boundary localization. Considering the characteristics of the sensors, this paper proposes an approach to extracting buildings from lidar and aerial imagery, which is based on the complementary characteristics of optical and range sensors. For detecting building regions, relationships among elevation contours are represented into directional graphs and searched for the contours corresponding to external boundaries of buildings. For generating building models, a wing model is proposed to assemble roof surface patches into a complete building model. Then, building models are projected and checked with features in aerial images. Experimental results show that the proposed approach provides an efficient and accurate way to extract building models.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.123-129
• /
• 2009

It is important to locate nodes in the research of wireless sensor network. In this paper, we propose a method that estimates the positions of nodes by using adjacent node information and signal strength in wireless sensor network. With this method, we can find positions of nodes easily because we use Information that nodes have. And we can make a map for all the nodes because we can measure a relative position for an node whose position is not known based on anchor nodes whose positions are already known. In addition, we can confirm whether nodes are placed appropriately. We confirmed that we can locate positions of unknown nodes with small error through verifying the proposed method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.2016-2022
• /
• 2010

We propose a new algorithm for reconstructing curves with self-intersections from sample points. In general, the result of curve reconstruction depends on how to select and order the representative points to resemble the shape of sample points. Most of the previous point ordering approaches utilize the Euclidean distance to compute the proximity of sample points without directional information, so they can not solve the non-simple curve reconstruction problem. In this paper, we develop a new distance estimating the adjacency between sample points, which is derived from the standard normal distribution of Brownian motion. Experimental results show that this approach is very effective to non-simple curve reconstruction.

• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.1
• /
• pp.89-98
• /
• 2016

In this paper, we proposed an automated areal feature matching method based on geometric similarity without user intervention and is applied into areal features of many-to-many relation, for confusion of spatial data-sets of different scale and updating cycle. Firstly, areal feature(node) that a value of inclusion function is more than 0.4 was connected as an edge in adjacency matrix and candidate corresponding areal features included many-to-many relation was identified by multiplication of adjacency matrix. For geometrical matching, these multiple candidates corresponding areal features were transformed into an aggregated polygon as a convex hull generated by a curve-fitting algorithm. Secondly, we defined matching criteria to measure geometrical quality, and these criteria were changed into normalized values, similarity, by similarity function. Next, shape similarity is defined as a weighted linear combination of these similarities and weights which are calculated by Criteria Importance Through Intercriteria Correlation(CRITIC) method. Finally, in training data, we identified Equal Error Rate(EER) which is trade-off value in a plot of precision versus recall for all threshold values(PR curve) as a threshold and decided if these candidate pairs are corresponding pairs or not. To the result of applying the proposed method in a digital topographic map and a base map of address system(KAIS), we confirmed that some many-to-many areal features were mis-detected in visual evaluation and precision, recall and F-Measure was highly 0.951, 0.906, 0.928, respectively in statistical evaluation. These means that accuracy of the automated matching between different spatial data-sets by the proposed method is highly. However, we should do a research on an inclusion function and a detail matching criterion to exactly quantify many-to-many areal features in future.

• Journal of Korean Society for Geospatial Information Science
• /
• v.13 no.4 s.34
• /
• pp.33-38
• /
• 2005

The goal of this study is to segment building points effectively utilizing scan-line characteristics of airborne laser scanner. Points are classified as to their altitude similarity and adjacency with other classified points, and point searching range for the classification is restricted within some number of scan-lines, preventing classification speed from lowering as the process goes on. Besides, we detected wrong discrimination of one object into more than two classes, then integrated them into a single class. Consequently we could discriminate points of each building from others, its annexes and none building points simultaneously.

• Language and Information
• /
• v.9 no.2
• /
• pp.69-83
• /
• 2005

This paper discusses the distribution of a null complementizer C, as opposed to an overt counterpart 'that', presenting empirical support both for and against the PF-merge analysis of C proposed by Boscovic and Lasnik (2003, henceafter B&L) who in turn attribute to the proposal in Pesetsky (1992) and Halle & Marantz (1993). In Section I, as a background, I discuss B&L's proposal that a null complementizer C is a PF-affix which undergoes a PF-merger operation at the PF component. In Section 2, after a brief sketch of the distribution of a null C mostly in bare-relatives, I explore the possibility of extending B&L's analysis to accomodate the null C's in the bare-relative constructions. In Section 3, I argue that despite some empirical difficulties, B&L's analysis of a null C as a PF-affix can still be maintained, if Adverb Fronting is an operation to Spec-C position. Furthermore, I propose a rule - PF Spell-Out Constraint - to account for the C-trace (i.e. that-trace) effect in relative constructions. With the PF Spell-Out Constraint and B&L's PF-merge account, the distribution of a null C can better be analyzed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.686-710
• /
• 2019

This work proposes a model to solve the problem of Network Coding over a one-session multicast network. The model is based on a system of restrictions that defines the packet flows received in the sink nodes as functions of the outgoing flows from the source node. A multicast network graph is used to derive a directed labeled line graph (DLLG). The successive powers of the DLLG adjacency matrix to the convergence in the null matrix permits the construction of the jump matrix Source-Sinks. In its reduced form, this shows the dependency of the incoming flows in the sink nodes as a function of the outgoing flows in the source node. The emerging packets for each outgoing link from the source node are marked with a tag that is a linear combination of variables that corresponds to powers of two. Restrictions are built based on the dependence of the outgoing and incoming flows and the packet tags as variables. The linear independence of the incoming flows to the sink nodes is mandatory. The method is novel because the solution is independent of the Galois field size where the packet contents are defined.