• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.1
• /
• pp.64-77
• /
• 2013

In this paper, we propose a joint bandwidth allocation and path selection scheme for IEEE 802.16j networks in uplink with cooperative relaying, and we evaluate the performance of the proposed scheme by using OPNET based simulation in hilly terrain with heavy tree density. The proposed scheme maximizes the system throughput in uplink with cooperative relaying in IEEE 802.16j networks. Then, we transform the proposed scheme into multi-dimensional multiple choice knapsack problem (MMKP) based scheme. We also propose uplink throughput maximization scheme and MMKP based scheme without cooperative relaying. We show that the system throughput of the proposed MMKP based scheme is higher than that of link quality based scheme, and cooperative relaying provides higher system throughput than the conventional case without cooperative relaying in uplink.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.4
• /
• pp.723-730
• /
• 2015

In this paper, a location tracking compensation algorithm based on the Least-Squares Method ($LCA_{LSM}$) was proposed to improve the autonomous tracking efficiency for the docent robot in exhibition hall, and the performance of the $LCA_{LSM}$ is analyzed by several practical experiments. The proposed $LCA_{LSM}$ compensates the collected location coordinates for the robot using the Least-Squares Method (LSM) in order to reduce the cumulated errors that occur in the Encoder/Giro sensor (E/G) and to enhance the measured tracking accuracy rates in the autonomous tracking of the robot in exhibition hall. By experiments, it was confirmed that the average error reduction rates of the $LCA_{LSM}$ are higher as 4.85% than that of the $LCA_{KF}$ in Scenario 1 (S1) and Scenario 2 (S2), respectively on the location tracking. In addition, it was also confirmed that the standard deviation in the measured errors of the $LCA_{LSM}$ are much more low and constant compared to that of the E/G sensor and the $LCA_{KF}$ in S1 and S2 respectively. Finally, we see that the suggested $LCA_{LSM}$ can execute more the stabilized location tracking than the E/G sensors and the $LCA_{KF}$ on the straight lines of S1 and S2 for the docent robot.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1239-1251
• /
• 1999

In this paper a scalable QoS-based hierarchical inter-domain routing scheme for distributed multimedia applications in a high speed wide area network. The problem of QoS-based routing is formulated as a multicriteria shortest path problem, known as NP-complete[21,30]. Our routing scheme consists of two phases. In Phase 1, two graph construction algorithms are performed to model the network under consideration as a graph. The graph contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. In Phase 2, a heuristic call-by-call algorithm is performed for selecting a feasible path efficiently in depth first search-like manner on the graph and tailoring to each application's QoS requirements, beginning at a vertex that represents the source node. In this paper, a simple rule is also produced, by which the visiting order of outgoing edges at each vertex on the graph is determined. The rule is based on each edge's the minimum normalized slackness to the QoS requested. The proposed routing scheme extends the PNNI-type hierarchical routing framework. Note that our routing scheme is one of a few QoS-based hierarchical routing schemes that address explicitly the issue of selecting a path with multiple metrics.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.6
• /
• pp.1873-1879
• /
• 2014

There are various methodologies to forecast the travel time using real-time data but the K-nearest neighborhood (KNN) method in general is regarded as the most one in forecasting when there are enough historical data. The objective of this study is to evaluate applicability of KNN method. In this study, real-time and historical data of toll collection system (TCS) traffic flow and the dedicated short range communication (DSRC) link travel time, and the historical path travel time data are used as input data for KNN approach. The proposed method investigates the path travel time which is the nearest to TCS traffic flow and DSRC link travel time from real-time and historical data, then it calculates the predicted path travel time using weight average method. The results show that accuracy increased when weighted value of DSRC link travel time increases. Moreover the trend of forecasted and real travel times are similar. In addition, the error in forecasted travel time could be further reduced when more historical data could be available in the future database.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.20 no.3
• /
• pp.67-79
• /
• 2017

Increasing transportation dependence on the metro system has lead to the convenience of passengers becoming as important as the transportation capacity. In this study, a pedestrian simulator has been developed that can quantitatively assess the pedestrian environment in terms of attributes such as speed and distance. The simulator consists of modules designed for 3D indoor map authoring and algorithmic pedestrian modeling. Module functions for 3D indoor map authoring include 3D spatial modeling, network generation, and evaluation of obtained results. The pedestrian modeling algorithm executes functions such as conducting a path search, allocation of users, and evaluation of level of service (LOS). The primary objective behind developing the said functions is to apply and analyze various scenarios repeatedly, such as before and after the improvement of the pedestrian environment, and to integrate the spatial information database with the dynamic information database. Furthermore, to demonstrate the practical applicability of the proposed simulator in the future, a test-bed was constructed for a currently operational metro station and the quantitative index of the proposed improvement effect was calculated by analyzing the walking speed of pedestrians before and after the improvement of the passage. The possibility of database extension for further analysis has also been discussed in this study.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.211-218
• /
• 2015

This paper introduces a 'divide-and-conquer' algorithm to the travelling salesman problem (TSP). Top 10n are selected beforehand from a pool of n(n-1) data which are sorted in the ascending order of each vertex's distance. The proposed algorithm then firstly selects partial paths that are interconnected with the shortest distance $r_1=d\{v_i,v_j\}$ of each vertex $v_i$ and assigns them as individual regions. For $r_2$, it connects all inter-vertex edges within the region and inter-region edges are connected in accordance with the connection rule. Finally for $r_3$, it connects only inter-region edges until one whole Hamiltonian cycle is constructed. When tested on TSP-1(n=26) and TSP-2(n=42) of real cities and on a randomly constructed TSP-3(n=50) of the Euclidean plane, the algorithm has obtained optimal solutions for the first two and an improved one from that of Valenzuela and Jones for the third. In contrast to the brute-force search algorithm which runs in n!, the proposed algorithm runs at most 10n times, with the time complexity of $O(n^2)$.

• The KIPS Transactions:PartA
• /
• v.12A no.1 s.91
• /
• pp.13-22
• /
• 2005

Similarly to the edges defined in a 2D image, we can define the geometric features representing the boundary of the distinctive parts appearing on 3D meshes. The geometric features have been used as basic primitives in several applications such as mesh simplification, mesh deformation, and mesh editing. In this paper, we propose geometric livewire and geometric livelane for extracting geometric features in a 3D mesh, which are the extentions of livewire and livelane methods in images. In these methods, approximate curvatures are adopted to represent the geometric features in a 3D mesh and the 3D mesh itself is represented as a weighted directed graph in which cost functions are defined for the weights of edges. Using a well-known shortest path finding algorithm in the weighted directed graph, we extracted geometric features in the 3D mesh among points selected by a user. In this paper, we also visualize the results obtained from applying the techniques to extracting geometric features in the general meshes modeled after human faces, cows, shoes, and single teeth.

• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.4
• /
• pp.184-188
• /
• 2006

This paper presents DSP based narrow band satellite communication signal power detector for tracking control of mobile satellite antenna system. An analog filter based conventional power detector has poor performance due to frequency drift of carrier. Also, it is very difficult to change an analog filter bandwidth according to changed bandwidth of transmitted signal. To solve these difficulties, we proposed DSP based signal power detector, which is easy to change bandwidth of filter and to match shifted frequency of carrier. The proposed signal power detector consists of a FFT function to measure frequency drift of carrier, a programmable filter bank function to limit of received signal bandwidth and a power calculation function to measure power of filtered signal in 12-bit linear scale. Test results of implemented signal power detector, based on TMS320C5402 DSP, showed that it satisfied required functions and performances and properly operated.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2022.05a
• /
• pp.88-88
• /
• 2022

하천법 개정 및 수자원의 조사·계획 및 관리에 관한 법률 제정으로 하상변동조사를 정기적으로 실시하는 것이 의무화 되었고, 지자체가 계획적으로 수자원을 관리할 수 있도록 제도가 마련되고 있다. 하상의 지형측량은 직접 측량할 수 없기 때문에 수심 측량을 통해 간접적으로 이루어지고 있으며, 그 방법은 레벨측량이나 음향측심기를 활용한 접촉식으로 이루어지고 있다. 접촉식 수심측량법은 자료수집이 제한적이기 때문에 공간해상도가 낮고 연속적인 측량이 불가능하다는 한계가 있어 최근에는 LiDAR나 초분광영상을 이용한 원격탐사를 이용한 수심측정 기술이 개발되고있다. 개발된 초분광영상을 이용한 수심측정 기술은 접촉식 조사보다 넓은 지역을 조사할 수 있고, 잦은 빈도로 자료취득이 용이한 드론에 경량 초분광센서를 탑재하여 초분광영상을 취득하고, 최적 밴드비 탐색 알고리즘을 적용해 수심맵 산정이 가능하다. 기존의 초분광 원격탐사 기법은 드론의 경로비행으로 획득한 초분광영상을 면단위의 영상으로 정합한 후 특정 물리량에 대한 분석이 수행되었으며, 수심측정의 경우 모래하천을 대상으로 한 연구가 주를 이루었으며, 하상재료에 대한 평가는 이루어지지 않았었다. 본 연구에서는 기존의 초분광영상을 활용한 수심산정 기법을 식생이 있는 하천에 적용하고, 동일지역에서 식생을 제거한 후의 2가지 케이스에 대해서 시공간(Spatio-temporal)초분광영상과 단면초분광영상에 모두 적용해 보았다. 연구결과, 식생이 없는 경우의 수심산정이 더 높은 정확도를 보였으며, 식생이 있는 경우에는 식생의 높이를 바닥으로 인식한 수심이 산정되었다. 또한, 기존의 단면초분광영상을 이용한 수심산정뿐만 아니라 시공간 초분광영상에서도 수심산정의 높은 정확도를 보여 시공간 초분광영상을 활용한 하상변동(수심변동) 추적의 가능성을 확인하였다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.11
• /
• pp.66-76
• /
• 2009

The motion estimation in video encoding system occupies the biggest part. So, we require the motion estimator with efficient structure for real-time operation. And for motion estimator's implementation, it is desired to design hardware module of an exclusive use that perform the encoding process at high speed. This paper proposes motion estimation detection block(MED), 41 SADs(Sum of Absolute Difference) calculation block, minimum SAD calculation and motion vector generation block based on parallel processing. The parallel processing can reduce effectively the amount of the operation. The minimum SAD calculation and MED block uses the pre-computation technique for reducing switching activity of the input signal. It results in high-speed operation. The MED and 41 SADs calculation blocks are composed of adder tree which causes the problem of critical path. So, the structure of adder tree has changed the most commonly used ripple carry adder(RCA) with carry skip adder(CSA). It enables adder tree to operate at high speed. In addition, as we enabled to easily control key variables such as control signal of search range from the outside, the efficiency of hardware structure increased. Simulation and FPGA verification results show that the delay of MED block generating the critical path at the motion estimator is reduced about 19.89% than the conventional strukcture.