• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2008.11a
• /
• pp.103-105
• /
• 2008

차세대 양방향데이터방송 (BIFS: BInary Format for Scenes) 서비스에서는 하향링크(downlink) 데이터 전송률에 상응하는 높은 상향링크(uplink) 데이터 전송률이 요구되고 있다. 이에 무선 전송 채널의 한정된 자원 환경 속에서 상향링크 전송용량 증대를 위한 주파수 효율성 제고 기술의 필요성이 대두되고 있다. 본 논문에서는 차세대 양방향데이터방송을 위한 다중 모바일(mobile) 사용자의 클러스터(cluster) 기반 상향링크 협동 다이버시티(cooperative diversity) 기법을 제안한다. 제안된 기법은 하나의 단일 안테나(single antenna) 방송 기지국과 다수의 단일 안테나 모바일 사용자가 있는 상향링크 시분할다중접속 (TDMA: Time Division Multiple Access) 시스템에서 데이터 지연허용(delay-tolerant)에 따라 클러스터를 구성하고 제곱 다이버시티 차수(square diversity order)의 협동 프로토콜(cooperative protocol)을 통해 높은 공간다이버시티 이득(spatial diversity gain)을 얻는다. 또한, 비대칭(asymmetric) 무선 채널 환경에서 공정성(fairness)을 보장한다.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2008.10a
• /
• pp.144-145
• /
• 2008

본 연구는 라이다 자료를 이용하여 건물영역을 추출하고 건물모델을 구성하는 선형과 면요소들을 추출하는 기법을 제시하였다. 라이다 자료는 지형지물의 표고값을 정확하고 직접적인 방식으로 제공함으로써 기존의 항공사진에 비하여 매칭과정을 필요로 하지 않는 장점을 가지고 있다. 하지만 라이다 점들은 해당 수평위치에 대한 표고값만을 제공하기 때문에 지표 위의 지형지물들을 추출하기 위해서는 먼저 점들간의 기하학적인 관계를 분석하여 그들을 구성하는 선이나 면요소들을 추출해야 한다. 이를 위하여 본 연구에서는 먼저 라이다 자료를 라스터 형태로 변환한 후, 이미지 프로세싱을 통하여 상대적으로 낫은 영역과 높은 영역으로 분리하여 각각 지형과 건물영역으로 분류하였다. 다음으로 건물영역 경계로부터 건물 외곽선을 추출하고 건물영역 내에 면요소들을 통계분석을 통하여 추출하였다. 실험결과를 통하여 제시한 기법들은 비교적 복잡한 형태의 건물 지붕면과 외곽선을 성공적으로 분할하고 추출할 수 있음을 보여준다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.673-675
• /
• 2005

본 논문은 3차원 텍스쳐 기반의 볼륨 가시화를 위한 GPU 대역폭에 효과적인 렌더링 기법을 제안한다. 전처리 과정에서 옥트리를 이용하여 원본 볼륨 데이터를 계층적으로 균일한 크기로 분할하여 실제 영역만을 효과적으로 검출하게 되고, 렌더링 시에는 가시순서에 따라 옥트리를 탐색하며 리프 노드의 각 부볼륨을 텍스쳐 매핑 유닛에서 처리하고 블렌딩 유닛에서 이를 합성한다. 작은 크기($16^3$ 또는 $32^3$)의 부볼륨 처리는 텍스쳐와 픽셀 캐시의 이용율을 높이고 공백 공간 생략을 가용하게 하여 GPU의 메모리 대역폭을 크게 줄여 렌더링을 가속할 수 있다. 제안하는 기법의 캐시 효율, 메모리 트래픽, 렌더링 시간 등 다양한 실험 결과와 성능분석이 제공된다. 실험 결과는 제안하는 기 법이 전통적인 렌더링 방법에 비해 평균 11배의 대역폭 감소와 3배 빠른 렌더링을 가능하게 하여 GPU를 이용한 볼륨 렌더링에 효과적인 방법임을 보여주었다.

• Journal of Korea Multimedia Society
• /
• v.8 no.4
• /
• pp.473-481
• /
• 2005

In this paper, we propose an image segmentation method preserving object's boundaries by using the number of quantized colors and merging regions using adaptive threshold values. First of all, the proposed method quantizes an original image by a vector quantization and the number of quantized colors is determined differently using PSNR each image. We obtain initial regions from the quantized image, merge initial regions in CIE Lab color space and RGB color space step by step and segment the image into semantic regions. In each merging step, we use color distance between adjacent regions as similarity-measure. Threshold values for region-merging are determined adaptively according to the global mean of the color difference between the original image and its split-regions and the mean of those variations. Also, if the segmented image of RGB color space doesn't split into semantic objects, we merge the image again in the CIE Lab color space as post-processing. Whether the post-processing is done is determined by using the color distance between initial regions of the image and the segmented image of RGB color space. Experiment results show that the proposed method splits an original image into main objects and boundaries of the segmented image are preserved. Also, the proposed method provides better results for objective measure than the conventional method.

• The Journal of the Korea Contents Association
• /
• v.14 no.10
• /
• pp.20-31
• /
• 2014

Recently, cache sharing methods have been studied in order to effectively reply to user requests in mobile P2P networks. In this paper, we propose a cache sharing scheme based on a cluster considering the peer connectivity in mobile P2P networks. The proposed scheme shares caches by making a cluster that consists of peers preserving the connectivity among them for a long time. The proposed scheme reduces data duplication to efficiently use the cache space in a cluster. The cache space is divided into two parts with a data cache and a temporary cache for a cache space. It is possible to reduce the delay time when the cluster topology is changed or the cache data is replaced utilizing a temporary cache. The proposed scheme checks the caches of peers in a route to a cluster header and the caches of one-hop peers in order to reduce the communication cost. It is shown through performance evaluation that the proposed scheme outperforms the existing schemes.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.36 no.6
• /
• pp.1093-1099
• /
• 2016

Currently, there are 499 metropolitan subway stations in Korea, but there are not many studies on the influence zone of linkage between railway station and public transport. Existing studies have been studied almost in terms of accessibility.. In addition, the existing research on the influence zone of linkage using survey data and statistics, there is a limit to the theoretical basis and analysis techniques. In this paper, we propose a new method to select on the influence zone of linkage, It is a GIS analysis technique using the spatial data of the railway station user as the large data of the traffic card. We applied the GIS analysis technique for select the influence zone of linkage based on the travel time of the network for each public transportation system. As a result, it was confirmed that the influence of the link of 15 minutes on the local bus, 20 minutes on the city bus and 25 minutes on the intercity bus were clearly distinguished according to the difference in network access time.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.344-356
• /
• 2001

This paper deals with the subsequence searching problem under time-warping in sequence databases. Our work is motivated by the observation that subsequence searches slow down quadratically as the average length of data sequences increases. To resolve this problem, the Segment-Based Approach for Subsequence Searches (SBSS) is proposed. The SBASS divides data and query sequences into a series of segments, and retrieves all data subsequences that satisfy the two conditions: (1) the number of segments is the same as the number of segments in a query sequence, and (2) the distance of every segment pair is less than or equal to a tolerance. Our segmentation scheme allows segments to have different lengths; thus we employ the time warping distance as a similarity measure for each segment pair. For efficient retrieval of similar subsequences, we extract feature vectors from all data segments exploiting their monotonically changing properties, and build a spatial index using feature vectors. Using this index, queries are processed with the four steps: (1) R-tree filtering, (2) feature filtering, (3) successor filtering, and (4) post-processing. The effectiveness of our approach is verified through extensive experiments.

• Journal of KIISE:Databases
• /
• v.34 no.2
• /
• pp.119-132
• /
• 2007

In molecular biology, approximate subsequence search is one of the most important operations. In this paper, we propose an accurate and efficient method for approximate subsequence search in large DNA databases. The proposed method basically adopts a binary trie as its primary structure and stores all the window subsequences extracted from a DNA sequence. For approximate subsequence search, it traverses the binary trie in a breadth-first fashion and retrieves all the matched subsequences from the traversed path within the trie by a dynamic programming technique. However, the proposed method stores only window subsequences of the pre-determined length, and thus suffers from large post-processing time in case of long query sequences. To overcome this problem, we divide a query sequence into shorter pieces, perform searching for those subsequences, and then merge their results. To verify the superiority of the proposed method, we conducted performance evaluation via a series of experiments. The results reveal that the proposed method, which requires smaller storage space, achieves 4 to 17 times improvement in performance over the suffix tree based method. Even when the length of a query sequence is large, our method is more than an order of magnitude faster than the suffix tree based method and the Smith-Waterman algorithm.

• Journal of Korean Society for Geospatial Information Science
• /
• v.21 no.3
• /
• pp.11-17
• /
• 2013

With high social demands for the diverse utilizations of forest lands, the illegal forest land use changes have increased. We studied change detection technique to detect changes in forest land use using an object-oriented segmentation of RED bands differencing in multi-temporal aerial photographs. The new object-oriented segmentation method consists of the 5 steps, "Image Composite - Segmentation - Reshaping - Noise Remover - Change Detection". The method enabled extraction of deforested objects by selecting a suitable threshold to determine whether the objects was divided or merged, based on the relations between the objects, spectral characteristics and contextual information from multi-temporal aerial photographs. The results found that the object-oriented segmentation method detected 12% of changes in forest land use, with 96% of the average detection accuracy compared by visual interpretation. Therefore this research showed that the spatial data by the object-oriented segmentation method can be complementary to the one by a visual interpretation method, and proved the possibility of automatically detecting and extracting changes in forest land use from multi-temporal aerial photographs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3B
• /
• pp.220-230
• /
• 2011

Mobile RFID which integrates mobile network with RFID technique is the technique to get the information of products by transmitting the identifier through mobile network after reading the identifier of RFID tag. It attached on the equipment as the mobile phone. However, mobile RFID has the privacy-related problem among requested secure problems required from the existing RFID. In this paper, the random key created by mobile RFID reader and Tag during the inter-certificating and initialization procedure for mobile RFID users to receive tag information from backend server securely is divided into random sizes and any information on the tag which requires the protection of privacy shouldn't be provided to anyone. In performance analysis, previous protocol used modulo operation in registration and login computation. But the proposed protocol has higher efficiency in saving space and computation volume than MARP scheme and Kim. et. al scheme because our protocol is accomplished by mutual authentication and registering user information through one-way hash function.