• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.16 no.1
• /
• pp.111-118
• /
• 1998

Today Geo-Spatial Information System(GSIS) has developed and used more widely, and especially it has been more greatly asked for Land Information System as a part of GSIS. Now it has been planning and monitoring for remaking of cadastral maps by the Ministry of Government Administration and Home Affairs. But this is long term project because of the importance of itself. And then it has been needed to computerize cadastral maps for implementation of relative tasks and services. Cadastral maps have some problems; for example, map join in different scales, different administration boundary and so on. In this study General topology algorithm, Polygonization algorithm and Pseudo-topology algorithm was adapted in computerization of cadastral maps. This is called digital map. The area and shape of parcels do not change. As a result it was found that Polygonization algorithm is the best of 3 algorithm and General topology algorithm is the worst.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.1
• /
• pp.1-8
• /
• 1999

In order to provide appropriate Quality of Service(QoS) guarantee to each traffic flow in intergrated service networks, an efficient traffic scheduling algorithm as well as resource reservation must be adopted in host and transit routers. In this paper, a new efficient fair queueing algorithm which adopts a linearly increasing virtual time is presented. The proposed algorithm is fair and the maximum and mean delay guaranteed of each flow are less than those of the SCFQ(self clocked fair queueing) algorithm which is one of the most promising traffic scheduling algorithm, while providing low implementation complexity as the SCFQ scheme. And, it has the better isolation provided than SCFQ, which means that each flow is much less influenced by the violating traffic flows provided its allocated bandwidth gurantee. The fairness of the proposed algorithm is proved and simulation results of maximum and mean delay presented.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.9
• /
• pp.37-43
• /
• 2010

An Interference Cancellation Wireless Repeater transmitts directly amplified the RF signal input to extend the coverage of the base station. Such a repeater inevitably suffers from the feedback interferences due to the environment and the adaptive Interference Cancelling System(ICS) is necessary. In this paper, the Variable Stepsize Complex Sign -Sign(VSCSS) LMS algorithm for ICS is presented. The algorithm can be implemented without multiplication/division arithmetic operation so that the required logic resources can be dramatically reduced in FPGA implementation. The performance of the proposed algorithm was analyzed in comparison with CSS-LMS algorithm and the learning curves obtained from simulation showed an excellent agreement with the theorical prediction. The simulation result with ICS in fading feedback channel environment showed the performance of the proposed algorithm is competible with NLMS algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4B
• /
• pp.300-308
• /
• 2012

Many indoor location tracking technologies have been proposed. Generally indoor location tracking using TOA signal is used, there is a weak point that it's difficult to track the location due to obstacles like a refraction, reflection and dispersion of radio wave. In this paper, we apply ETOA(Estimated-TOA) algorithm in NLOS(Non-Line-Of-Sight) environment to solve above problem. In NLOS environment, TOA value between Beacon and Mobile node is predicted by ETOA algorithm and the tracking of indoor location is also possible to identify using two NLOS beacons of three beacons by this algorithm. We show that the proposed algorithm is accurate location tracking is accomplished using the applying the proposed algorithm to indoor moving robot and the inertia sensor of robot and Kalman filter algorithm.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.7
• /
• pp.81-89
• /
• 1999

Image obtained by incomplete communication always include noise, blur and distortion, etc. In this paper, we propose and apply the new spatial filter algorithm, called an optimal adaptive generalized stack filter(AGSF), which optimizes adaptive generalized stack filter(AGSF) using neural network weight learning algorithm of back-propagation learning algorithm for improving noise removal and edge preservation rate. AGSF divides into two parts: generalized stack filter(GSF) and adaptive multistage median filter(AMMF), GSF improves the ability of stack filter algorithm and AMMF proposes the improved algorithm for reserving the sharp edge. Applied to neural network theory, the proposed algorithm improves the performance of the AGSF using two weight learning algorithms, such as the least mean absolute(LAM) and least mean square (LMS) algorithms. Simulation results of the proposed filter algorithm are presented and discussed.

• Journal of the Society of Naval Architects of Korea
• /
• v.53 no.2
• /
• pp.115-126
• /
• 2016

In the process of ship building, it is known that the maintenance of working period and saving cost are one of the important part during the logistics of blocks transportation. Precise operational planning inside the shipyard plays a big role for a smooth transportation of blocks. But many problems arise in the process of block transportation such as the inevitable road damage during the transportation of the blocks, unpredictable stockyard utilization of the road associated with a particular lot number, addition of unplanned blocks. Therefore, operational plan needs to be re-established frequently in real time for an efficient block management. In order to find the shortest path between lot numbers, there are several representative methods such as Floyd algorithm that has the characteristics of many-to-many mapping, Dijkstra algorithm that has the characteristic of one-to-many mapping, and the A* algorithm which has the one-to-one mapping, but many authors have published without the mutual comparisons of these algorithms. In this study, some appropriate comparison have been reviewed about the advantages and disadvantages of these algorithms in terms of precision and cost analysis of calculating the paths and planning system to operate the transporters. The flexible operating plan is proposed to handle a situation such as damaged path, changing process during block transportation. In addition, an operational algorithm of a vacant transporter is proposed to cover the shortest path in a minimum time considering the situation of transporter rotation for practical use.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.10
• /
• pp.397-406
• /
• 2014

In order to answer the questions successfully on behalf of the human in DeepQA environments such as Jeopardy! of the American quiz show, the computer is required to have the capability of fast temporal and spatial reasoning on a large-scale commonsense knowledge base. In this paper, we present a scalable spatial reasoning algorithm for deriving efficiently new directional and topological relations using the MapReduce framework, one of well-known parallel distributed computing environments. The proposed reasoning algorithm assumes as input a large-scale spatial knowledge base including CSD-9 directional relations and RCC-8 topological relations. To infer new directional and topological relations from the given spatial knowledge base, it performs the cross-consistency checks as well as the path-consistency checks on the knowledge base. To maximize the parallelism of reasoning computations according to the principle of the MapReduce framework, we design the algorithm to partition effectively the large knowledge base into smaller ones and distribute them over multiple computing nodes at the map phase. And then, at the reduce phase, the algorithm infers the new knowledge from distributed spatial knowledge bases. Through experiments performed on the sample knowledge base with the MapReduce-based implementation of our algorithm, we proved the high performance of our large-scale spatial reasoner.

• The KIPS Transactions:PartB
• /
• v.11B no.5
• /
• pp.603-610
• /
• 2004

The distributed Information Retrieval System centrally controlled by mediator or meta search engine result in congestion of heavy traffic and int he problem of increment of cost for the reason of the design of complicated algorithm for central control and installation of hardware. So to figure out this problem, the way is needed that has independent retrieval functionality and can cooperate each other without dependency. In this paper, we overview a few works involved in distributed information retrieval system, then, implement algorithm and design the frame-work of distributed information retrieval system using sequential transferring method(STM) including multiple information retrieval system separated from central control. For this first of all, we present a web partition policy which devide and manage web logically and we present the sequential query processing way by means of illustration through changing numbered information retrieval system. Then, we also present 3-layered structure of framework and function and module of each layer suitable for information retrieval system. Last of ail, for effective implementation of STM algorithm we analysis module structure and present description of pseudocode of this, and show that the proposed STM algorithm works smoothly by demonstration of sequential query transfer process between servers.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.1
• /
• pp.102-110
• /
• 2017

In this paper, we have implemented an real-time adaptive feedback cancellation(AFC) algorithm that can be applied to multi-channel digital hearing aid. Multichannel digital hearing aid typically use the FFT filterbank based Wide Dynamic Range Compression(WDRC) algorithm to compensate for hearing loss. The implemented real-time acoustic feedback cancellation algorithm has one integrated structure using the same FFT filter bank with WDRC, which can be beneficial in terms of computation affecting the hearing aid battery life. In addition, when the AFC fails to operate due to nonlinear input and output, the reduction gain is applied to improve robustness in practical environment. The implemented algorithm can be further improved by adding various signal processing algorithm such as speech enhancement.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.5
• /
• pp.1225-1233
• /
• 2008

In this paper, the 2D/3D converting algorithm is proposed. The single frame of 2D image is used fur the real-time processing of the proposed algorithm. The proposed algorithm creates a 3D image with the depth map by using the vertical position information of a object in a single frame. In order to real-time processing and improve the hardware complexity, it performs the generation of a depth map using the image sampling, the object segmentation with the luminance standardization and the boundary scan. It might be suitable to a still image and a moving image, and it can provide a good 3D effect on a image such as a long distance image, a landscape, or a panorama photo because it uses a vertical position information. The proposed algorithm can adapt a 3D effect to a image without the restrictions of the direction, velocity or scene change of an object. It has been evaluated with the visual test and the comparing to the MTD(Modified Time Difference) method using the APD(Absolute Parallax Difference).