• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.3
• /
• pp.153-161
• /
• 2002

In this paper, we propose a Probabilistic Tabu Search(PTS) method for hydro-thermal scheduling. Hydro scheduling has many constraints and very difficult to solve the optical schedule because it has many local minima. To solve the problem effectively, the proposed method uses two procedures, one is Tabu search procedure that plays a role in local search, and the other is Restarting procedure that enables to diversify its search region. To adjust Parameters such as a reducing rate and initial searching region, search strategy is selected according to its probability after restarting procedure. Dynamic decoding method was also used to restrict a search region and to handle water balance constraints. In order to show the usefulness of the proposed method, the PTS is applied on two cases which have independent or dependent hydro plants and compared to those of other method. The simulation results show it is very efficient and useful algorithm to solve the hydro-thermal scheduling problem.

• Journal of Korea Multimedia Society
• /
• v.3 no.4
• /
• pp.356-364
• /
• 2000

Block based fast motion estimation algorithm use the fixed search pattern to reduce the search point, and are based on the assumption that the error in the mean absolute error space monotonically decreases to the global minimum. Therefore, in case of many local minima in a search region we are likely to find local minima instead of the global minimum and highly rely on the initial search points. This situation is evident in the motion boundary. In this paper we define the candidate regions within the search region using the motion information of the neighbor blocks and we propose the multiple local search method (MLSM) which search for the solution throughout the candidate regions to reduce the possibilities of isolation to the local minima. In the MLSM we mark the candidate region in the search point map and we avoid to search the candidate regions already visited to reduce the calculation. In the simulation results the proposed method shows more excellent results than that of other gradient based method especially in the search of motion boundary. Especially, in PSNR the proposed method obtains similar estimate accuracy with the significant reduction of search points to that of full search.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1851-1854
• /
• 2003

This paper suggests an algorithm which can retrieval images using correlations between the region classification of spatial image and the wavelet transform even though the images are rotated in a ${\pm}$90 degree arc. Owing to this proposed method, it was confirmed from experiments that the search about the whole image is not processed and only a few amount of informations are saved by using the mathematical statistics from the block map and transformed band which is resulted from region classification, and by performing the image search based on these, the improvement of search speed and the efficient search can be done.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.128-140
• /
• 2000

In this paper, we propose a fast block matching algorithm using the mean absolute error (MAE) of neighbor search point and search region reduction. The proposed algorithm is composed of two stages. At the first stage,the search region is divided into nonoverlapped 3$\times$3 areas and MAE of the center point of each area iscalculated. The minimum MAE value of all the calculated MAE's is determined as reference MAE. At thesecond stage, because the possibility that final motion vector exist near the position of reference MAE is veryhigh, we use smaller search region than first stage, And, using the MAE of center point of each area, the lowerbound of rest search point of each area is calculated and block matching process is performed only at the searchpoints that the lower bound is smaller than reference MAE. By doing so, we can significantly reduce thecomputational complexity while keep the increasement of motion estimation error small.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1011-1014
• /
• 1999

In this paper, a new algorithm has been presented that helps to preserve diversity as well as to enhance the convergence speed of the evolutionary programming. This algorithm is based on the cell partitioning of search region for preserving the diversity. Until now, the greater part of researches is not concerned about preserving the diversity of individuals in a population but improving convergence speed. Although these evolutions are started from multi-point search at the early phase, but at the end those search points are swarming about a one-point, the strong candidate. These evolutions vary from the original idea in some points such as multi-point search. In most case we want to find the only one point of the best solution not several points in the vicinity of that. That is why the cell partitioning of search region has been used. By restricting the search area of each individual, the diversity of individual in solution space is preserved and the convergence speed is enhanced. The efficiency of the proposed algorithm has been verified through benchmark test functions.

• Proceedings of the KIEE Conference
• /
• 2002.11b
• /
• pp.76-79
• /
• 2002

In this paper, we propose a Probabilistic Tabu Search(PTS) method for hydro-thermal scheduling. Hydro scheduling has many constraints and very difficult to solve the optimal schedule because it has many local minima. To solve the problem effectively, the proposed method uses two procedures, one is Tabu search procedure that plays a role in local search, and the other is Restarting procedure that enables to diversify its search region. To adjust parameters such as a reducing rate and initial searching region, search strategy is selected according to its probability after Restarting procedure. In order to show the usefulness of the proposed method, the PTS is applied on two cases which have dependent hydro plants and compared to those of other method. The simulation results show it is very efficient and useful algorithm to solve the hydro-thermal scheduling problem.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.9
• /
• pp.85-91
• /
• 2013

This paper proposes the data reusable search scan methods for full search and fast search to implement low power Motion Estimation (ME). The proposed Optimized Sub-region Partitioning (OSP) method which divide search region into several sub-region can reduce the number of the required Reconfigurable Register Array (RRA) by half compared to the existing smart snake scan method for the same data reusability. In addition, the proposed Center Biased Search Scan method (CBSS) for various fast search algorithms can improve the data reusability. The performance comparisons show that the proposed search scan methods can reduce the average redundant data loading about 26.9% and 16.1% compared with the existing rater scan and snake scan methods, respectively. Due to the reduction of memory accesses, the proposed search scan methods are quite suitable for low power and high performance ME implementation.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.1
• /
• pp.161-169
• /
• 1996

This paper presents a new search region prediction method using vector quantization for the motion estimation. We find motion vectors using the full search BMA from two successive frame images first. Then the motion vectors are used for training a codebook. The trained codebook is the predicted search region. We used the unsupervised neural network for VQ encoding and codebook design. A major advantage of formulating VQ as neural networks is that the large number of adaptive training algorithm that are used for neural networks can be applied to VQ. The proposed method reduces the computation and reduce the bits required to represent the motion vectors because of the smaller search points. The computer simulation results show the increased PSNR as compared with the other block matching algorithms.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.47-49
• /
• 2000

In this paper we propose the multiple local search method(MLSM) based on the motion information of the neighbor blocks. In the proposed method motions are estimated from the multiple searches of many candidate local search regions. To reduce the additional search points we avoid to search the same candidate regions previously visited using the distance from the initial search point to the recently found vector points. In the simulation the proposed method shows more excellent results than that of other gradient based method especially in the search of motion boundary.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.2
• /
• pp.204-210
• /
• 2010

The tactical effectiveness, which is the result of applying decision-making algorithms to respond a specific situation with weapons and sensors, is required to analyze according to the integrated combat situation, because each situation, which is intimately involved with each other, influences the surface ship to complete missions successfully. However, the tactical effectiveness have been analyzed in separation of each tactical situation due to the complexity of the integrated tactical situation. This paper is originated from the needs for analyzing the anti-submarine search region of the surface ship after it evades the torpedo by operation of the torpedo countermeasure tactics. It also describes simulation results of effectiveness analysis for the search patterns in the search region.