• Journal of the Korean Society for Precision Engineering
• /
• v.11 no.4
• /
• pp.165-173
• /
• 1994

Retroreflector is different from other reflecting surfaces as it mades reflection in which radiation is returned in directions close to its incoming direction. Because of this characteristics, retroreflectors find many applications in traffic safety related areas. Retroreflectors are usually made using comer cubes, or partially coated glass beads. These glass beads can be made very small, so that they can be coated on sheets or mixed with paints. The design of glass type retroreflector depends on glass bead's shape and material, and its optical characteristics are related to the refractive index of glass. In this paper, a method of anlyzing glass bead type retroreflector's sptical characteristics with respect to shape and optica property of the glass, is presented. First, the coefficient of retroreflection, which is a measure of retroreflector's optical characteristics, is derived analytically using geometrical optics method. And the result is plotted using numerical methods. The results show good match with those obtained experimentally, which were supplied from a commercial retroreflector manufacturer.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.4
• /
• pp.633-636
• /
• 2022

The reduction of energy consumption at the base station (BS) has become more important recently. In this paper, we consider the adaptive muting of the antennas based on the predicted future traffic load to reduce the energy consumption where the number of active antennas is adaptively adjusted according to the predicted future traffic load. Given that traffic load is sequential data, three different RNN structures, namely long-short term memory (LSTM), gated recurrent unit (GRU), and bidirectional LSTM (Bi-LSTM) are considered for the future traffic load prediction. Through the performance evaluation based on the actual traffic load collected from the Afghanistan telecom company, we confirm that the traffic load can be estimated accurately and the overall power consumption can also be reduced significantly using the antenna musing.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.601-604
• /
• 2008

전위그래프와 버블정렬그래프는 스타그래프가 갖는 노드대칭성, 재귀적구조, 최대 고장허용도 등 그래프이론 관점에서 좋은 성질을 갖는 상호연결망이다. 본 논문에서는 버블정렬(bubblesort)그래프 $B_n$와 버블정렬-스타(bubblesort star)그래프가 전위(Transposition) 그래프 $T_n$의 서브그래프임을 보인다. 또한, 전위(Transposition)그래프 $T_n$을 버블정렬(Bubblesort)그래프 $B_n$으로 임베딩하는 연장율이 O(n)임을 보인다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.259-267
• /
• 2013

GIS-based web map service is all the more accessible to the public. Among others, location query services are most frequently utilized, which are currently restricted to only one keyword search. Although there increases the demand for the service for querying multiple keywords corresponding to sequential activities(banking, having lunch, watching movie, and other activities) in various locations POI, such service is yet to be provided. The objective of the paper is to develop the k-IPS algorithm for quickly and accurately querying multiple POIs that internet users input and locating the search outcomes on a web map. The algorithm is developed by utilizing hierarchical tree structure of $R^*$-tree indexing technique to produce overlapped geometric regions. By using recursive $R^*$-tree index based spatial join process, the performance of the current spatial join operation was improved. The performance of the algorithm is tested by applying 2, 3, and 4 multiple POIs for spatial query selected from 159 keyword set. About 90% of the test outcomes are produced within 0.1 second. The algorithm proposed in this paper is expected to be utilized for providing a variety of location-based query services, of which demand increases to conveniently support for citizens' daily activities.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.5
• /
• pp.515-521
• /
• 2015

The SymMerge algorithm is an efficient merging algorithm for input sequences u and v of sizes $\left|u \right|=m$ and $\left|v \right|=n$, $m{\leq}n$. We consider complexity analysis for SymMerge algorithm regarding to the required number of comparisons. The focus of the previous complexity analysis was on finding the values of upper bounds, i.e. showing the asymptotical optimality. In this paper, in a different way from the previous complexity analysis, we show that the overall required number of comparisons for two representative special cases "symmetric case" and "maximum spanning case" can be calculated exactly i.e. the least upper bounds regarding to the required number of comparisons are calculated. Symmerge requires exactly $m\;log\frac{n}{m}+4m-logm-3$ comparisons for symmetric case of sizes $m=2^k,\;n=2^l,l{\geq}k$ of input sequences and exactly $\frac{1}{2}m^2+(m+1)logm-\frac{3}{2}m+2$ comparisons for maximum spanning case of sizes $m=2^k,n=2^m-m$ of input sequences. Additionally we show that the complexity of the Symmerge algorithm regarding to the overall required number of comparisons for these special cases can be defined by recurrence relations.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.4
• /
• pp.327-336
• /
• 2007

The 3D building modeling is one of crucial components in building 3D geospatial information. The existing methods for 3D building modeling depend mainly on manual photogrammetric processes by stereoplotter compiler, which indeed take great amount of time and efforts. In addition, some automatic methods that were proposed in research papers and experimental trials have limitations of describing the details of buildings with lack of geometric accuracy. It is essential in automatic fashion that the boundary and shape of buildings should be drawn effortlessly by a sophisticated algorithm. In recent years, airborne LiDAR data representing earth surface in 3D has been utilized in many different fields. However, it is still in technical difficulties for clean and correct boundary extraction without human intervention. The usage of airborne LiDAR data will be much feasible to reconstruct the roof tops of buildings whose boundary lines could be taken out from existing digital maps. The paper proposed a method to reconstruct the roof tops of buildings using airborne LiDAR data with building boundary lines from digital map. The primary process is to perform octree-based segmentation to airborne LiDAR data recursively in 3D space till there are no more airborne LiDAR points to be segmented. Once the octree-based segmentation has been completed, each segmented patch is thereafter merged based on geometric spatial characteristics. The experimental results showed that the proposed method were capable of extracting various building roof components such as plane, gable, polyhedric and curved surface.

• Journal of Broadcast Engineering
• /
• v.27 no.1
• /
• pp.104-123
• /
• 2022

Style transfer based on neural network provides very high quality results by reflecting the high level structural characteristics of images, and thereby has recently attracted great attention. This paper deals with the problem of resolution limitation due to GPU memory in performing such neural style transfer. We can expect that the gradient operation for style transfer based on partial image, with the aid of the fixed size of receptive field, can produce the same result as the gradient operation using the entire image. Based on this idea, each component of the style transfer loss function is analyzed in this paper to obtain the necessary conditions for partitioning and padding, and to identify, among the information required for gradient calculation, the one that depends on the entire input. By structuring such information for using it as auxiliary constant input for partition-based gradient calculation, this paper develops a recursive algorithm for super high-resolution image style transfer. Since the proposed method performs style transfer by partitioning input image into the size that a GPU can handle, it can perform style transfer without the limit of the input image resolution accompanied by the GPU memory size. With the aid of such super high-resolution support, the proposed method can provide a unique style characteristics of detailed area which can only be appreciated in super high-resolution style transfer.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.07a
• /
• pp.115-116
• /
• 2019

SVM (Support Vector Machine)은 견고성으로 인해 다양한 분류 문제에 적용 할 수 있는 효율적인 기계 학습 기술이다. 그러나 훈련 데이터의 수가 증가함에 따라 시간 복잡도가 급격히 증가하므로 대규모 데이터 세트의 경우 SVM이 비실용적이다. 본 논문에서는 SVM을 사용하여 중복 된 학습 데이터를 효율적으로 제거하는 새로운 병렬 평면(Parallel Hyperplane) 기법을 소개한다. 제안 기법에서 PH는 재귀 적으로 형성되는 반면 PH의 외부에 있는 데이터 포인트의 클러스터는 매 반복마다 제거된다. 시뮬레이션 결과 제안 기법은 기존의 클러스터링 기반 감축 기법과 SMO 기법에 비해 학습 시간을 크게 단축시키면서 데이터 축소 없이 분류의 정확성을 높일 수 있음을 확인 하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.310-317
• /
• 2006

In this paper, we propose a new sequential message-passing decoding algorithm of low-density parity-check (LDPC) codes by partitioning check nodes. This new decoding algorithm shows better bit error rate(BER) performance than that of the conventional message-passing decoding algorithm, especially for small number of iterations. Analytical results tell us that as the number of partitioned subsets of check nodes increases, the BER performance becomes better. We also derive the recursive equations for mean values of messages at variable nodes by using density evolution with Gaussian approximation. Simulation results also confirm the analytical results.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.353-356
• /
• 2014

역공학 방지 기법이 적용되지 않은 어플리케이션은 악의적인 역공학에 취약할 수밖에 없다. 악의적인 역공학은 사회적으로 여러가지 손실을 가져온다. 그러므로 역공학 방지 기법을 적용하여 어플리케이션을 보호해야 한다. 역공학 방지 기법은 다양하며, 크게 자바 소스 난독화, Smali 코드 조작, Dex 파일 포맷 조작, 그리고 Zip 파일 포맷 조작 기법으로 나눌 수 있다. 자바 소스 난독화는 코드의 가독성을 떨어트려 안드로이드 어플리케이션의 역공학을 어렵게 하는 기법이다. Smali 코드 조작 기법은 Goto 문 추가, 예외 처리 재귀 기법 등을 통하여 역공학을 막는 기법이다. Dex 파일 포맷 조작 기법에는 클래스명 길이 변경, 헤더 크기 변경 등을 통해 역공학을 어렵게 만드는 기법이다. Zip 파일 포맷 조작 기법은 Zip 파일 포맷에서 헤더 값을 조작하여 마치 암호화된 것처럼 보이도록 만드는 기법이다. 본 논문에서는 이러한 다양한 기법들에 대해서 설명하고 이를 비교 분석한다.