• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.8-14
• /
• 2002

This article presents a new algorithm for the K Shortest Paths Problem which develops initial K shortest paths, and repeal to expose hidden shortest paths with dual approach and to replace the longest path in the present K paths. The initial solution which comprises K shortest paths among shortest paths to traverse each arc is made from bidirectional Dijkstra algorithm. When a crossing node that have two or more inward arcs is found at least three time by turns in this K shortest paths, one inward arc of this crossing node, which has minimum detouring distance, is chosen, and a new path is exposed with joining a detouring subpath from source to this inward arc and a spur of a feasible path from this crossing node to sink. This algorithm, requires worst case time complexity of $O(Kn^2),\;and\;O(n^2)$ in the case $K{\leq}3$.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.437-438
• /
• 2006

Virtual view synthesis is essential for 3DTV systems, which utilizes the motion parallax cue. In this paper, we propose a multi-step view synthesis algorithm to efficiently reconstruct an arbitrary view from limited number of known views of a 3D scene. We describe an efficient image rectification procedure which guarantees that an interpolation process produce valid views. This rectification method can deal with all possible camera motions. The idea consists of using a polar parameterization of the image around the epipole. Then, to generate intermediate views, we use an efficient dense disparity estimation algorithm considering features of stereo image pairs. Main concepts of the algorithm are based on the region dividing bidirectional pixel matching. The estimated disparities are used to synthesize intermediate view of stereo images. We use computer simulation to show the result of the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8B
• /
• pp.1487-1492
• /
• 2000

WDM SHR has advantages compared to SDH SHR in both cost and capacity But, wavelengths should be carefully assigned not to clash with each other and the number should be minimum. In this study, a heuristic algorithm, which is efficient in practical situations where the traffic pattern is not full-mesh or more than one wavelength is required for connecting some specific nodes, is suggested. The performance of the suggested algorithm is compared with that of the convential algorithm.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.9
• /
• pp.983-989
• /
• 2014

In this paper, a new active noise control method was proposed to decrease a weight of car, and to increase a fuel efficiency and to provide passengers' comfort and calmness, instead of a passive noise control method such as sound absorbing and insulating materials. The proposed method is an enhanced active noise controller operating by a bidirectional control algorithm. The algorithm is simple to implement and available to analyze mathematically with nearly equivalent complexity of computation. Through simulations for engine noises of a car, the proposed controller was verified that its performances of time and frequency domain were superior to those of both feedforward and feedback controllers, and it had better capability of controlling the noises when the impulsive disturbance was flow in and the response of secondary path was varied.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.727-730
• /
• 2002

In this paper. we propose an algorithm to automatically generate a novel scene along the alternated viewing positions using the bidirectional disparity morphing. To compute the disparity between two reference images, we use the 2-step block based matching algorithm and define three occluding patterns so as to smooth the computed disparities, especially for occluded regions. We discuss the advantages of this algorithm compared to the commonly used schemes and show some experimental results with real data.

• Smart Media Journal
• /
• v.7 no.2
• /
• pp.9-14
• /
• 2018

The k-ary n-cube $Q^k_n$ is widely used in the design and implementation of parallel and distributed processing architectures. It consists of $k^n$ identical nodes, each node having degree 2n is connected through bidirectional, point-to-point communication channels to different neighbors. On $Q^k_n$ we would like to transmit packets from a source node to 2n destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $0{\leq}i{\leq}2n-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(n^3)$ routing algorithm on $Q^k_n$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.

• ETRI Journal
• /
• v.46 no.2
• /
• pp.205-217
• /
• 2024

We propose a bandwidth prediction approach based on deep learning. The approach is intended to accurately predict the bandwidth of various types of mobile networks. We first use a machine learning technique, namely, the gradient boosting algorithm, to recognize the connected mobile network. Second, we apply a handover detection algorithm based on network recognition to account for vertical handover that causes the bandwidth variance. Third, as the communication performance offered by 3G, 4G, and 5G networks varies, we suggest a bidirectional long short-term memory model with time distribution for bandwidth prediction per network. To increase the prediction accuracy, pretraining and fine-tuning are applied for each type of network. We use a dataset collected at University College Cork for network recognition, handover detection, and bandwidth prediction. The performance evaluation indicates that the handover detection algorithm achieves 88.5% accuracy, and the bandwidth prediction model achieves a high accuracy, with a root-mean-square error of only 2.12%.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.1043_1044
• /
• 2009

본 논문에서는 하루 24시간동안의 전원의 특성과 사용시간, 사용량을 고려한 부하를 전기적으로 모델링 하고 그를 통해 양방향 DC-DC 컨버터가 최적으로 동작할 수 있는 알고리즘을 제안하였다. 양방향 DC-DC 컨버터의 최적 알고리즘 제안을 위해 전체 시스템의 에너지 밸런싱에 초점을 맞춰 분석하였으며 하루 중 잉여 및 부족 전력에 따라 양방향 DC-DC 컨버터를 제어하도록 시뮬레이션을 구성하였고 그 결과를 통해 타당성을 검증하였다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.125-128
• /
• 1996

In this paper, we consider a ring loading problem, which arises in the design of SONET bidirectional rings. We deal with the case where demands are allowed to be split and routed in two different directions. Even if integral . demands are given, the optimal solution of the problem doesn't always have integral values. We present an efficient algorithm which produces an integral optimal solution.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2295-2298
• /
• 2003

The correspondence problem for stereo image matching plays an important role in expanding view points as multi view video applications become more popular. The conventional disparity estimation algorithms have limitation to find exact disparities because they consider not image features but similiar intensity points. Thus we propose an efficient disparity estimation algorithm considering features of stereo image pairs. As simulation results, our proposed method confirms better intermediate views than the existing block-matching methods.