• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.11
• /
• pp.613-619
• /
• 2001

The IP address lookup problem is to find the longest matching IP prefix for a given IP address from the routing table and has been a central bottleneck in speeding up the Internet. In this paper, we propose a new algorithm for this problem based on the segment tree data structure. Given n IP prefixes, our algorithm can do IP address in Ο(log n) time. It also handles the insertion and deletion of IP prefixes efficiently without rebuilding the total data structure.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.94-96
• /
• 2021

Software-Defined Networking (SDN), which has emerged to overcome the limitations of existing network architectures, makes routing management simpler and more efficient through a central controller. SR (Segment Routing) is a flexible and scalable way of doing source routing, and defines the information path of the network through a list of segments arranged in the packet header. In an SDN environment, the performance of each router is almost the same, but packets tend to be concentrated on routes that are frequently used depending on routing algorithms. Routers in that path have a relatively high frequency of failure and are more likely to become bottlenecks. In this paper, we propose a routing algorithm that allows the router, which is a resource in the network, to evenly process packets in the SDN with SR, so that the administrator can utilize the resources in the network without idle routers, and at the same time facilitate the management of the router.

• Korean Journal of Remote Sensing
• /
• v.40 no.2
• /
• pp.179-190
• /
• 2024

This study aims to compare supervised classification methods with phenology-based approaches, specifically pixel-based and segment-based methods, for accurate crop mapping in agricultural landscapes. We utilized Sentinel-2A imagery, which provides multispectral data for accurate crop mapping. 31 normalized difference vegetation index (NDVI) images were calculated from the Sentinel-2A data. Next, we employed phenology-based approaches to extract valuable information from the NDVI time series. A set of 10 phenology metrics was extracted from the NDVI data. For the supervised classification, we employed the maximum likelihood (MaxLike) algorithm. For the phenology-based approaches, we implemented both pixel-based and segment-based methods. The results indicate that phenology-based approaches outperformed the MaxLike algorithm in regions with frequent rainfall and cloudy conditions. The segment-based phenology approach demonstrated the highest kappa coefficient of 0.85, indicating a high level of agreement with the ground truth data. The pixel-based phenology approach also achieved a commendable kappa coefficient of 0.81, indicating its effectiveness in accurately classifying the crop types. On the other hand, the supervised classification method (MaxLike) yielded a lower kappa coefficient of 0.74. Our study suggests that segment-based phenology mapping is a suitable approach for regions like South Korea, where continuous cloud-free satellite images are scarce. However, establishing precise classification thresholds remains challenging due to the lack of adequately sampled NDVI data. Despite this limitation, the phenology-based approach demonstrates its potential in crop classification, particularly in regions with varying weather patterns.

• ETRI Journal
• /
• v.28 no.1
• /
• pp.99-102
• /
• 2006

In this letter, we study the protection problem in wavelength division multiplexing (WDM) optical networks, and propose a novel dynamic heuristic algorithm called differentiated reliable segment protection (DRSP). Differing from previous work, DRSP can effectively avoid the trap problem and is able to find a feasible solution for each connection request. Therefore, DRSP outperforms the previous work. Simulation results have shown to be promising.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.11a
• /
• pp.601-607
• /
• 2005

In this paper, we aggregate multi-links information between boundary nodes using the line segment scheme that aggregates topology information within PG referring bandwidth and delay parameter. To do this, we propose a modified line segment algorithm using two line segment method that represents two points which consist of delay-bandwidth pair to reduce topology information and provide a flexibility to the multiple-links aggregation. And we apply it to current star topology aggregation. Through the simulation result analysis, the proposed star topology aggregation scheme presents the better performance than existing scheme.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.59-64
• /
• 2002

This paper presents a method for line segment extraction for 3-d building reconstruction. Building roofs are described as a set of planar polygonal patches, each of which is extracted by watershed-based image segmentation, line segment matching and coplanar grouping. Coplanar grouping and polygonal patch formation are performed per region by selecting 3-d line segments that are matched using epipolar geometry and flight information. The algorithm has been applied to high resolution aerial images and the results show accurate 3-d building reconstruction.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.1
• /
• pp.96-104
• /
• 1990

In this paper, a novel method of jig-saw puzzle matching is proposed using a modifided boundary matching algorithm without a priori knowledge for the matched puzzle. Specifically, a boundary tracking algorithm is utilised to segment each puzzle from low-resolution image data. Segmented puzzle is described via corner point, angle and distance between two adjacent coner point, and convexity and/or concavity of corner point. Proposed algorithm is implemented and tested in IBM PC and PC version vision system, and applied successfully to real jig-saw puzzles.

• Journal of KIISE:Software and Applications
• /
• v.36 no.10
• /
• pp.825-835
• /
• 2009

The advance in medical technology has decreased death rates from diseases such as tubercle, pneumonia, malnutrition, and hepatitis. However, death rates from cardiac diseases are still increasing. To prevent cardiac diseases and quantify cardiac function, magnetic resonance imaging not harmful to the body is used for calculating blood volumes and ejection fraction(EF) on routine clinics. In this paper, automatic left ventricle(LV) segmentation is presented to segment LV and calculate blood volume and EF, which can replace labor intensive and time consuming manual contouring. Radial threshold determination is designed to segment LV and blood volume and EF are calculated. Especially, basal slices which were difficult to segment in previous researches are segmented automatically almost without user intervention. On short axis cardiac MRI of 36 subjects, the presented algorithm is compared with manual contouring and General Electronic MASS software. The results show that the presented algorithm performs in similar to the manual contouring and outperforms the MASS software in accuracy.

• Korean Journal of Remote Sensing
• /
• v.19 no.2
• /
• pp.159-169
• /
• 2003

This paper presents a method for automatic 3-d building reconstruction using high resolution aerial imagery. First, by using edge preserving filtering, noise is eliminated and then images are segmented by watershed algorithm, which preserves location of edge pixels. To extract line segments between control points from boundary of each region, we calculate curvature of each pixel on the boundary and then find the control points. Line segment linking is performed according to direction and length of line segments and the location of line segments is adjusted using gradient magnitudes of all pixels of the line segment. Coplanar grouping and pplygonal patch formation are performed per region by selecting 3-d line segments that are matched using epipolar geometry and flight information. The algorithm has been applied to high resolution aerial images and the results show accurate 3D building reconstruction.

• Journal of Korea Water Resources Association
• /
• v.55 no.spc1
• /
• pp.1187-1195
• /
• 2022

To run the algorithm for identifying the segments of a pipe network, the relative positional relation between nodes, pipes, and valves should be prepared as input information of a segment search algorithm. In order to more accurately identify the segments of real pipe network, pipe network GIS/CAD database that contains all isolation valves is more suitable than modeled pipe network information used for a hydraulic analysis program. In this study, we developed an algorithm that can establish the relative positional relations among node-pipe-valve suitable for pipe network segment search algorithms using GIS/CAD data of a real water supply network, and developed a MATLAB program that can implement it. The effectiveness of the developed MATLAB program was confirmed by applying it to a portion of a real municipal pipe network.