• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.7
• /
• pp.62-71
• /
• 1998

In this paper, we describe the object-oriented motioncompensation technique using the hierarchical grid interpolation(HGI). By noting that the HGI does not exploit effetively the rate-distortion (R-D) trade-off inherent in the quadtree decomposition, we propose an objectoriented HGI technique employing the greedy method. In the proposed technique, input image is decomposed in a quadtree basis using the greedy method, yielding maximum split gain in the R-D sense. Then, the motion compensation is performed using the HGI technique. The performance of the proposed technique is examined in simulation, and it will be show that the proposed technique provides better performance than the conventional object-oriented motion compensation techniques.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.609-611
• /
• 2012

논문에서는 로우듀티사이클 환경을 고려하여 목적지까지 데이터 전송의 신뢰성뿐만 아니라 낮은 데이터 지연도 보장하는 DIGF (Delay Improvement Greedy Forwarding) 기법을 제안한다. 초기에 제안된 그리디 포워텅 기법들은 무선링크가 갖는 비신뢰성 및 비대칭성의 문제점을 해결하기 위해 데이터 전송 성공률과 에너지 효율을 높이는 기법이 제안되었다. 하지만 많은 그리디 포워텅 기법들은 노드들이 데이터를 송수신하기 위해 대기하고 있는 수신대기상태로 인한 많은 에너지 소모를 고려하지 않아 네트워크 라이프타임을 감소시킨다. 이러한 문제점을 해결하고자 제안기법인 DIGF는 무선링크의 비신뢰성과 비대칭성을 고려할 뿐만 아니라 로우듀티사이클 환경을 고려한다. 또한 로우듀티사이클 환경을 고려할 때 발생되는 높은 수면지연성 (Sleep latency) 을 해결하기 위한 알고리즘을 제안하여 낮은 전송지연과 신뢰성 있는 데이터 전송을 보장한다.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.9
• /
• pp.69-76
• /
• 2022

The traveling salesman problem(TSP) is one of the most famous combinatorial optimization problem. So far, many metaheuristic search algorithms have been proposed to solve the problem, and one of them is local search. One of the very important factors in local search is neighbor generation method, and random-based neighbor generation methods such as inversion have been mainly used. This paper proposes 4 new greedy-based neighbor generation methods. Three of them are based on greedy insertion heuristic which insert selected cities one by one into the current best position. The other one is based on greedy rotation. The proposed methods are applied to first-choice hill-climbing search and simulated annealing which are representative local search algorithms. Through the experiment, we confirmed that the proposed greedy-based methods outperform the existing random-based methods. In addition, we confirmed that some greedy-based methods are superior to the existing local search methods.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.2
• /
• pp.99-105
• /
• 2012

The focus of this paper is a proposal for a computationally efficient dynamic subcarrier allocation (DSA) algorithm for orthogonal frequency-division multiple access (OFDMA) systems. The proposed DSA algorithm considerably reduces the computational complexity and the amount of channel quality information (CQI) compared to amplitude craving greedy (ACG) algorithms, which use full CQI. At the same time, the performance of the proposed algorithm closely appear to ACG algorithms. Moreover, the authors present a new bandwidth-assignment algorithm produced by modifying bandwidth assignment based on the signal-to-noise ratio (BABS). This modified BABS algorithm enables the proposed DSA algorithm to produce a strong outage performance gain over the conventional scheme.

• Journal of Broadcast Engineering
• /
• v.17 no.6
• /
• pp.954-963
• /
• 2012

As a greedy algorithm reconstructing the sparse signal from underdetermined system, orthogonal matching pursuit (OMP) algorithm has received much attention. In this paper, we multiple candidate matching pursuit (MuCaMP), which builds up candidate support set in every iteration and uses the minimum residual at last iteration. Using the restricted isometry property (RIP), we derive the sufficient condition for MuCaMP to recover the sparse signal exactly. The MuCaMP guarantees to reconstruct the K-sparse signal when the sensing matrix satisfies the RIP constant ${\delta}_{N+K}<\frac{\sqrt{N}}{\sqrt{K}+3\sqrt{N}}$. In addition, we show a recovery performance both noiseless and noisy measurements.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.3
• /
• pp.185-191
• /
• 2019

During the modern battlefields of multi-batches flight formation attack situation, it is an essential task for a commander to make a proper fire distribution of air defense missile launch platforms for threat targets with effectively and quickly. Pan et al. try to solve this problem using genetic algorithm, but they are fails. This paper gets the initial feasible solution using high threat target first destroying strategy only use 75% available fire of each missile launch platform. Then, the assigned missile is moving to another target in the case of decreasing total threat. As a result of experiment, while the proposed algorithm is polynomial-time complexity greedy algorithm but this can be improve the solution than genetic algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3B
• /
• pp.453-461
• /
• 2010

A critical issue in wireless sensor networks is an energy-efficiency since the sensor batteries have limited energy power and, in most cases, are not rechargeable. The most practical manner relate to this issue is to use a node wake-up scheduling protocol that some sensor nodes stay active to provide sensing service, while the others are inactive for conserving their energy. Especially, CTC (Connected Target Coverage) problem has been considered as a representative energy-efficiency problem considering connectivity as well as target coverage. In this paper, we propose a new energy consumption model considering multiple-targets and create a new problem, CMTC (Connected Multiple-Target Coverage) problem, of which objective is to maximize the network lifetime based on the energy consumption model. Also, we present SPT (Shortest Path based on Targets)-Greedy algorithm to solve the problem. Our simulation results show that SPT-Greedy algorithm performs much better than previous algorithm in terms of the network lifetime.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.63-69
• /
• 1998

The area optimization of the power distribution network is an important problem in the layout design of VLSI systems. In this paper we propose noval methods to solve the problem of designing minimal area power distribution nets, while satisfying voltage drop and electromigration constraints. We propose two novel greedy heuristics for power net design-one based on bottom-up tree construction using greedy merging and the other based on top-down linearly separable partitioning.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1244-1246
• /
• 2016

Influence maximization problem is to select seed node set, which maximizes information spread in social networks. Greedy algorithm shows an optimum solution, but has a high computational cost. A few heuristic algorithms were proposed to reduce the complexity, but their performance in influence maximization is limited. In this paper, we propose general degree discount algorithm, and show that it has better performance while keeping complexity low.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.10
• /
• pp.29-39
• /
• 2008

Greedy routing which is easy to apply to geographic wireless sensor networks is frequently used. Greedy routing works well in dense networks whereas in sparse networks it may fail. When greedy routing fails, it needs a recovery algorithm to get out of the communication void. However, additional recovery algorithm causes problems that increase both the amount of packet transmission and energy consumption. Communication void is a condition where all neighbor nodes are further away from the destination than the node currently holding a packet and it therefore cannot forward a packet using greedy forwarding. Therefore we propose a VODUA(Virtually Ordered Distance Upgrade Algorithm) as a novel idea to improve and solve the problem of void. In VODUA, nodes exchange routing graphs that indicate information of connection among the nodes and if there exist a stuck node that cannot forward packets, it is terminated using Distance Cost(DC). In this study, we indicate that packets reach successfully their destination while avoiding void through upgrading of DC. We designed the VODUA algorithm to find valid routes through faster delivery and less energy consumption without requirement for an additional recovery algorithm. Moreover, by using VODUA, a network can be adapted rapidly to node's failure or topological change. This is because the algorithm utilizes information of single hop instead of topological information of entire network. Simulation results show that VODUA can deliver packets from source node to destination with shorter time and less hops than other pre-existing algorithms like GPSR and DUA.