• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2004.03a
• /
• pp.209-214
• /
• 2004

국지적으로 단시간 내에 많은 양의 강한 비가 내리는 현상인 집중호우는 발생부터 성장, 쇠퇴까지의 과정이 단기간에 이루어지고, 그 변동성이 아주 크다. 그러므로 정확한 예보를 위해서는 단시간예보(nowcasting) 기법이 필요한데, 이를 위해서는 연속적이고, 정확한 관측이 필요하다. 집중호우의 관측에는 우량계, 레이다, 위성 관측 등이 사용되는데 이 연구에서는 GOES-9호 위성영상자료를 이용하였고, 2003년 여름의 8개 강수사례에 대해 분석하였다. 집중호우시의 강수량을 산출하기 위해 Power-law Curve를 사용하였고, NOAA/NESDIS에서 개발하여 현업에 사용 중인 Auto-Estimator의 무강수 픽셀 보정방법을 이용하여 산출된 강수량을 보정하였으며, 이를 기상청의 자동기상관측자료 (Automatic Weather Station: AWS)와 비교하였다. 위성영상자료의 시간 대표성을 분석하기 위해 위성의 관측 시간에 대해 전, 후, 중심을 기준으로 각각 15분, 30분, 60분 누적강수량과 비교하였고, AWS의 공간 대표성을 분석하기 위해 위성영상자료의 3×3, 5×5, 9×9 픽셀을 면적 평균하여 각각 비교하였다. 분석 결과 대부분의 사례에서 위성의 관측시간을 시작으로 60분 동안 누적한 강수량과 상관성이 가장 크게 나왔고, 면적에 대해서는 거의 차이가 없었다. 또한, 무강수 픽셀 보정방법의 하나로 구름의 성장률을 보정해 주었다. 그 결과 구름의 성장률을 보정해 주었을 때 상관계수가 0.05 이상 상승하였다.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.809-822
• /
• 2004

In this paper, we propose a concurrency control algorithm based on R-tree for spatial database management system. The previous proposed algorithms can't prevent problem that search operation is to be blocking during update operations. In case of multidimensional indexes like R-tree, locking of update operations may be locked to several nodes, and splitting of nodes have to lock a splitting node for a long time. Therefore search operations have to waiting a long time until update operations unlock. In this paper we propose new algorithms for lock-free search operation. First, we develop a new technique using a linked-list technique on the node. The linked-list enable lock-free search when search operations search a node. Next, we propose a new technique using a version technique. The version technique enable lock-free search on the node that update operations is to be splitting.

• Journal of Internet Computing and Services
• /
• v.4 no.4
• /
• pp.65-74
• /
• 2003

Recently, It is required that multimedia data display on not only PC but also the Mobile device such as cellar phone, PDA. Mobile divieces has not sufficient of storage space or main memory and has slow network speed. So we can't process the multimedia data with the existing way on PC. This paper presents various methods for MultimediaPresentation which are able to display on the mobile device with the low-bandwidth and small storage. There Is an analysis that Is playable on the mobile device using presentation area devision method and replayable analysis method. If the display of multimedia presentation is impossible from this analysis, to apply prefetch techniques a using EPOB apoint and as User QoS of multimedia data through prefetch techniques have keep, do so that playable. Then, it is proposed to playable smooth multimedia presentation as that each of the presentations through prefetch Scheduling techniques point and quantity of data which are prefetch.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.4 s.42
• /
• pp.1-7
• /
• 2006

Recently, studies of relevance feedback to increase the performance of image retrieval has been activated. In this Paper a new region weighting method in region based image retrieval with relevance feedback is proposed to reduce the semantic gap between the low level feature representation and the high level concept in a given query image. The new weighting method determines the importance of regions according to the spatial locations of regions in an image. Experimental results demonstrate that the retrieval quality of our method is about 18% in recall better than that of area percentage approach. and about 11% in recall better than that of region frequency weighted by inverse image frequency approach and the retrieval time of our method is a tenth of that of region frequency approach.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.948-952
• /
• 2009

Recently, a new distributed grid scheme, called DS-GRID(distributed S-GRID), has been proposed to manage the location information of moving objects in a spatial network[1]. However, because DS-GRID uses uniform grid cells, it cannot handle skewed data which frequently occur in the real application. To solve this problem, we propose a dynamic distributed grid scheme which splits a grid cell dynamically based on the density of moving objects. In addition, we propose a k-nearest neighbor processing algorithm for the proposed scheme. Finally, it is shown from the performance analysis that our scheme achieves better retrieval and update performance than the DS-GRID when the moving objects are skewed.

• Tunnel and Underground Space
• /
• v.33 no.6
• /
• pp.508-518
• /
• 2023

This paper presents a new approach for the automatic mapping of discontinuities in a tunnel face based on its 3D digital model reconstructed by LiDAR scan or photogrammetry techniques. The main idea revolves around the identification of discontinuity areas in the 3D digital model of a tunnel face by segmenting its 2D projected images using a deep-learning semantic segmentation model called U-Net. The proposed deep learning model integrates various features including the projected RGB image, depth map image, and local surface properties-based images i.e., normal vector and curvature images to effectively segment areas of discontinuity in the images. Subsequently, the segmentation results are projected back onto the 3D model using depth maps and projection matrices to obtain an accurate representation of the location and extent of discontinuities within the 3D space. The performance of the segmentation model is evaluated by comparing the segmented results with their corresponding ground truths, which demonstrates the high accuracy of segmentation results with the intersection-over-union metric of approximately 0.8. Despite still being limited in training data, this method exhibits promising potential to address the limitations of conventional approaches, which only rely on normal vectors and unsupervised machine learning algorithms for grouping points in the 3D model into distinct sets of discontinuities.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.19 no.3
• /
• pp.352-357
• /
• 2008

We present a space-time trellis coded OFDM system in slow fading channels. Generalized principal ratio combining (GPRC) is also analyzed theoretically in frequency domain. The analysis shows that the decoding metric of GPRC includes the metrics of maximum likelihood(ML) and PRC. The computer simulations with M-PSK modulation are obtained in frequency flat and frequency selective fading channels. The decoding complexity and simulation running times are also evaluated among the decoding schemes.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.137-146
• /
• 2002

In VOD server, in order to guarantee playback of continuous media, such as video, without hiccups for multiusers, the server has to manage its buffer sophisticatedly by prefeching a part of the data into the buffer As the continuous media data buffered by one user can be used again by the others, the number of disk accesses is reduced and then the latency time far the users is also reduced. In this paper, we propose a new buffer management technique for continuous media in VOD server. Our basic algorithm partitions the buffer into groups and then a group of buffer which has the lowest utilization is chosen and partitioned again for a new user. The basic algorithm is extended for supporting multiple streams and clip data and for providing VCR functions. Our proposed technique is able to increase in the number of concurrent users as increasing the utilization of the buffer and to minimize the average waiting time for multiuser accesses as the bandwidth of storage is slowly reached to the limit. In the simulation study for comparing the performance of our technique with that of the existing techniques, we show that the average waiting time is reduced mere than 50% and the number of concurrent users increases by 1 ∼5% as compared with those of the exiting techniques.

• Journal of KIISE:Databases
• /
• v.34 no.4
• /
• pp.328-342
• /
• 2007

We propose a new cache conscious indexing structure for processing frequently updated data efficiently. Our proposed index structure is based on a KDB-Tree, one of the representative index structures based on space partitioning techniques. In this paper, we propose a data compression technique and a pointer elimination technique to increase the utilization of a cache line. To show our proposed index structure's superiority, we compare our index structure with variants of the CR-tree(e.g. the FF CR-tree and the SE CR-tree) in a variety of environments. As a result, our experimental results show that the proposed index structure achieves about 85%, 97%, and 86% performance improvements over the existing index structures in terms of insertion, update and cache-utilization, respectively.

• The Journal of the Acoustical Society of Korea
• /
• v.27 no.8
• /
• pp.418-426
• /
• 2008

In this paper, we propose an algorithm for the frequency channel segmentation using peaks and valleys in spectrogram. The frequency channel segments means that local groups of channels in frequency domain that could be arisen from the same sound source. The proposed algorithm is based on the smoothed spectrum of the input sound. Peaks and valleys in the smoothed spectrum are used to determine centers and boundaries of segments, respectively. To evaluate a suitableness of the proposed segmentation algorithm before that the grouping stage is applied, we compare the synthesized results using ideal mask with that of proposed algorithm. Simulations are performed with mixed speech signals with narrow band noises, wide band noises and other speech signals.