• Title/Summary/Keyword: Greedy 기법

Search Result 109, Processing Time 0.026 seconds

Extraction and Revision of Building Information from Single High Resolution Image and Digital Map (단일 고해상도 위성영상과 수치지도로부터 건물 정보 추출 및 갱신)

  • Byun, Young-Gi;Kim, Hye-Jin;Choi, Jae-Wan;Han, You-Kyung;Kim, Yong-Il
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.26 no.2
    • /
    • pp.149-156
    • /
    • 2008
  • In this paper, we propose a method aiming at updating the building information of the digital maps using single high resolution satellite image and digital map. Firstly we produced a digital orthoimage through the automatic co-registration of QuickBird image and 1:1,000 digital map. Secondly we extracted building height information through the template matching of digital map's building vector data and the image's edges obtained by Canny operator. Finally we refined the shape of some buildings by using the result from template matching as the seed polygon of the greedy snake algorithm. In order to evaluate the proposed method's effectiveness, we estimated accuracy of the extracted building information using LiDAR DSM and 1:1,000 digital map. The evaluation results showed the proposed method has a good potential for extraction and revision of building information.

Energy Efficient Electric Vehicle Driving Optimization Method Satisfying Driving Time Constraint (제한 주행시간을 만족하는 에너지 효율적인 전기자동차 주행 최적화 기법)

  • Baek, Donkyu
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.25 no.2
    • /
    • pp.39-47
    • /
    • 2020
  • This paper introduces a novel system-level framework that derives energy efficient electric vehicle (EV) driving speed profile to extend EV driving range without additional cost. This paper first implements an EV power train model considering forces acting on a driving vehicle and motor efficiency. Then, it derivate the minimum-energy driving speed profile for a given driving mission defined by the route. This framework first formulates an optimization problem and uses the dynamic programming algorithm with a weighting factor to derive a speed profile minimizing both of energy consumption and driving time. This paper introduces various weighting factor tracking methods to satisfy the driving time constraint. Simulation results show that runtime of the proposed scaling algorithm is 34% and 50% smaller than those of the binary search algorithm and greedy algorithm, respectively.

Short-Distance Gate Subtree Algorithm for Capacitated Minimum Spanning Tree Problem (능력한정 최소신장트리 문제의 근거리 게이트 서브트리 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.6
    • /
    • pp.33-41
    • /
    • 2021
  • This paper proposes heuristic greedy algorithm that can be find the solution within polynomial time with solution finding rule for the capacitated minimum spanning tree(CMST) problem, known as NP-hard. The CMST problem can be solved by computer-aided meta-heuristic because of the Esau-Williams heuristic polynomial time algorithm has a poor performance. Nevertheless the meta-heuristic methods has a limit performance that can't find optimal solution. This paper suggests visual by handed solution-finding rule for CMST. The proposed algorithm firstly construct MST, and initial feasible solution of CMST from MST, then optimizes the CMST with the subtree gates more adjacent to root node. As a result of total 30 cases of OR-LIB 10 data, Q=3,5,10, the proposed algorithm gets the best performance.

A Compressed Sensing-Based Signal Detection Technique for Generalized Space Shift Keying Systems (일반화된 공간천이변조 시스템에서 압축센싱기술을 이용한 수신신호 복호 알고리즘)

  • Park, Jeonghong;Ban, Tae Won;Jung, Bang Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.7
    • /
    • pp.1557-1564
    • /
    • 2014
  • In this paper, we propose a signal detection technique based on the parallel orthogonal matching pursuit (POMP) is proposed for generalized shift space keying (GSSK) systems, which is a modified version of the orthogonal matching pursuit (OMP) that is widely used as a greedy algorithm for sparse signal recovery. The signal recovery problem in the GSSK systems is similar to that in the compressed sensing (CS). In the proposed POMP technique, multiple indexes which have the maximum correlation between the received signal and the channel matrix are selected at the first iteration, while a single index is selected in the OMP algorithm. Finally, the index yielding the minimum residual between the received signal and the M recovered signals is selected as an estimate of the original transmitted signal. POMP with Quantization (POMP-Q) is also proposed, which combines the POMP technique with the signal quantization at each iteration. The proposed POMP technique induces the computational complexity M times, compared with the OMP, but the performance of the signal recovery significantly outperform the conventional OMP algorithm.

Performance Improvement of Cooperating Agents through Balance between Intensification and Diversification (강화와 다양화의 조화를 통한 협력 에이전트 성능 개선에 관한 연구)

  • 이승관;정태충
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.40 no.6
    • /
    • pp.87-94
    • /
    • 2003
  • One of the important fields for heuristic algorithm is how to balance between Intensification and Diversification. Ant Colony Optimization(ACO) is a new meta heuristic algorithm to solve hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as Breedy search It was first Proposed for tackling the well known Traveling Salesman Problem(TSP). In this paper, we deal with the performance improvement techniques through balance the Intensification and Diversification in Ant Colony System(ACS). First State Transition considering the number of times that agents visit about each edge makes agents search more variously and widen search area. After setting up criteria which divide elite tour that receive Positive Intensification about each tour, we propose a method to do addition Intensification by the criteria. Implemetation of the algorithm to solve TSP and the performance results under various conditions are conducted, and the comparision between the original An and the proposed method is shown. It turns out that our proposed method can compete with the original ACS in terms of solution quality and computation speed to these problem.

New Flash Memory Management Method for Reliable Flash Storage Systems (신뢰성 있는 플래시메모리 저장시스템 구축을 위한 플래시메모리 저장 공간 관리 방법)

  • Kim, Han-Joon;Lee, Sang-Goo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.6
    • /
    • pp.567-582
    • /
    • 2000
  • We propose a new way of managing flash memory space for flash memory-specific file system based on log-structured file system. Flash memory has attractive features such as non-volatility, and fast I/O speed, but it also suffers from inability to update in place and limited usage cycles. These drawbacks require many changes to conventional storage (file) management techniques. Our focus is on lowering cleaning cost and evenly utilizing flash memory cells while maintaining a balance between the two often-conflicting goals. The proposed cleaning method performs well especially when storage utilization and the degree of locality are high. The cleaning efficiency is enhanced by dynamically separating cold data and non-cold data. The second goal, cycle-leveling is achieved to the degree where the maximum difference between erase cycles is below the error range of the hardware. Simulation results show that the proposed method has significant benefit over naxve methods: maximum of 35% reduction in cleaning cost with even spreading writes across segments.

  • PDF

Optimization Algorithm for k-opt Swap of Generalized Assignment Problem (일반화된 배정 문제의 k-opt 교환 최적화 알고리즘)

  • Sang-Un Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.5
    • /
    • pp.151-158
    • /
    • 2023
  • The researchers entirely focused on meta-heuristic method for generalized assignment problem(GAP) that is known as NP-hard problem because of the optimal solution within polynomial time algorithm is unknown yet. On the other hand, this paper proposes a heuristic greedy algorithm with rules for finding solutions. Firstly, this paper reduces the weight matrix of original data to wij ≤ bi/l in order to n jobs(items) pack m machines(bins) with l = n/m. The maximum profit of each job was assigned to the machine for the reduced data. Secondly, the allocation was adjusted so that the sum of the weights assigned to each machine did not exceed the machine capacity. Finally, the k-opt swap optimization was performed to maximize the profit. The proposed algorithm is applied to 50 benchmarking data, and the best known solution for about 1/3 data is to solve the problem. The remaining 2/3 data showed comparable results to metaheuristic techniques. Therefore, the proposed algorithm shows the possibility that rules for finding solutions in polynomial time exist for GAP. Experiments demonstrate that it can be a P-problem from an NP-hard.

Self-optimizing feature selection algorithm for enhancing campaign effectiveness (캠페인 효과 제고를 위한 자기 최적화 변수 선택 알고리즘)

  • Seo, Jeoung-soo;Ahn, Hyunchul
    • Journal of Intelligence and Information Systems
    • /
    • v.26 no.4
    • /
    • pp.173-198
    • /
    • 2020
  • For a long time, many studies have been conducted on predicting the success of campaigns for customers in academia, and prediction models applying various techniques are still being studied. Recently, as campaign channels have been expanded in various ways due to the rapid revitalization of online, various types of campaigns are being carried out by companies at a level that cannot be compared to the past. However, customers tend to perceive it as spam as the fatigue of campaigns due to duplicate exposure increases. Also, from a corporate standpoint, there is a problem that the effectiveness of the campaign itself is decreasing, such as increasing the cost of investing in the campaign, which leads to the low actual campaign success rate. Accordingly, various studies are ongoing to improve the effectiveness of the campaign in practice. This campaign system has the ultimate purpose to increase the success rate of various campaigns by collecting and analyzing various data related to customers and using them for campaigns. In particular, recent attempts to make various predictions related to the response of campaigns using machine learning have been made. It is very important to select appropriate features due to the various features of campaign data. If all of the input data are used in the process of classifying a large amount of data, it takes a lot of learning time as the classification class expands, so the minimum input data set must be extracted and used from the entire data. In addition, when a trained model is generated by using too many features, prediction accuracy may be degraded due to overfitting or correlation between features. Therefore, in order to improve accuracy, a feature selection technique that removes features close to noise should be applied, and feature selection is a necessary process in order to analyze a high-dimensional data set. Among the greedy algorithms, SFS (Sequential Forward Selection), SBS (Sequential Backward Selection), SFFS (Sequential Floating Forward Selection), etc. are widely used as traditional feature selection techniques. It is also true that if there are many risks and many features, there is a limitation in that the performance for classification prediction is poor and it takes a lot of learning time. Therefore, in this study, we propose an improved feature selection algorithm to enhance the effectiveness of the existing campaign. The purpose of this study is to improve the existing SFFS sequential method in the process of searching for feature subsets that are the basis for improving machine learning model performance using statistical characteristics of the data to be processed in the campaign system. Through this, features that have a lot of influence on performance are first derived, features that have a negative effect are removed, and then the sequential method is applied to increase the efficiency for search performance and to apply an improved algorithm to enable generalized prediction. Through this, it was confirmed that the proposed model showed better search and prediction performance than the traditional greed algorithm. Compared with the original data set, greed algorithm, genetic algorithm (GA), and recursive feature elimination (RFE), the campaign success prediction was higher. In addition, when performing campaign success prediction, the improved feature selection algorithm was found to be helpful in analyzing and interpreting the prediction results by providing the importance of the derived features. This is important features such as age, customer rating, and sales, which were previously known statistically. Unlike the previous campaign planners, features such as the combined product name, average 3-month data consumption rate, and the last 3-month wireless data usage were unexpectedly selected as important features for the campaign response, which they rarely used to select campaign targets. It was confirmed that base attributes can also be very important features depending on the type of campaign. Through this, it is possible to analyze and understand the important characteristics of each campaign type.

A Effective Ant Colony Algorithm applied to the Graph Coloring Problem (그래프 착색 문제에 적용된 효과적인 Ant Colony Algorithm에 관한 연구)

  • Ahn, Sang-Huck;Lee, Seung-Gwan;Chung, Tae-Choong
    • The KIPS Transactions:PartB
    • /
    • v.11B no.2
    • /
    • pp.221-226
    • /
    • 2004
  • Ant Colony System(ACS) Algorithm is new meta-heuristic for hard combinational optimization problem. It is a population-based approach that uses exploitation of positive feedback as well as greedy search. Recently, various methods and solutions are proposed to solve optimal solution of graph coloring problem that assign to color for adjacency node($v_i, v_j$) that they has not same color. In this paper introducing ANTCOL Algorithm that is method to solve solution by Ant Colony System algorithm that is not method that it is known well as solution of existent graph coloring problem. After introducing ACS algorithm and Assignment Type Problem, show the wav how to apply ACS to solve ATP And compare graph coloring result and execution time when use existent generating functions(ANT_Random, ANT_LF, ANT_SL, ANT_DSATUR, ANT_RLF method) with ANT_XRLF method that use XRLF that apply Randomize to RLF to solve ANTCOL. Also compare graph coloring result and execution time when use method to add re-search to ANT_XRLF(ANT_XRLF_R) with existent generating functions.