• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.2
• /
• pp.211-219
• /
• 1988

In this paper effective block matching algorithms are proposed to find the motion vector. There are two approaches to the estimation of the motion vector in MCC (motion compensated coding), i.e.pel(pixel element) recursive algorithm and block matching algorithm. The search algorithm in this paper is based on the block matching method. The advantage of this algorithm is the reduction of the computation time. In order to reduce the computation time, three mathods are proposed in this paper. These new algorithms are faster than other methods. Compared with the three step algorithm by Koga et al., the average ratio of the computational savings obtained from the proposed algorithm is about 3-4.

• Journal of Power System Engineering
• /
• v.2 no.3
• /
• pp.60-67
• /
• 1998

Edge detection is the first step and very important step in image analysis. We cast edge detection as a problem in cost minimization. This is achieved by the formulation of a cost function that evaluates the quality of edge configurations. The cost function can be used as a basis for comparing the performances of different detectors. This cost function is made of desirable characteristics of edges such as thickness, continuity, length, region dissimilarity. And we use a simulated annealing algorithm for minimum of cost function. Simulated annealing are a class of adaptive search techniques that have been intensively studied in recent years. We present five strategies for generating candidate states. Experimental results(building image and test image) which verify the usefulness of our simulated annealing approach to edge detection are better than other operator.

• Journal of Advanced Marine Engineering and Technology
• /
• v.21 no.3
• /
• pp.293-301
• /
• 1997

Edge detection is the first step and very important step in image analysis. We cast edge detec¬tion as a problem in cost maximization. This is acheived by the formulation of a cost function that evaluates the quality of edge configurations. The cost function can be used as a basis for compar¬ing the performances of different detectors. We used a Genetic Algorithm for maximizing cost func¬tion. Genetic algorithms are a class of adaptive search techniques that have been intensively stud¬ied in recent years and have been prone to converge prematurely before the best solution has been found. This paper shows that carefully chosen modifications(three factors of the crossover opera¬tor) are implemented can be effective in alleviating this problem.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.3
• /
• pp.823-832
• /
• 2013

We present a new algorithm for solving a system of nonlinear equations with convex constraints which combines proximal point and projection methodologies. Compared with the existing projection methods for solving the problem, we use a different system of linear equations to obtain the proximal point; and moreover, at the step of getting next iterate, our projection way and projection region are also different. Based on the Armijo-type line search procedure, a new hyperplane is introduced. Using the separate property of hyperplane, the new algorithm is proved to be globally convergent under much weaker assumptions than monotone or more generally pseudomonotone. We study the convergence rate of the iterative sequence under very mild error bound conditions.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.3
• /
• pp.17-27
• /
• 1996

More fuzzy hardware are expected to be utilized in the future to construct fuzzy logic controllers (FLCs). It is hard to find an existing fuzzy hardware which is adopting advanced functions such as self-tuning algorithm in addition to the conventional inference calculation. That is mainly because conventional self-tuning algorithms designed to implement with some hardware circuits is required for fuzzy hardwares to have self-tuning capability. As a first step toward the feature, a novel self-tuning algorithm is proposed in this paper. Based on the search method, the main idea of the proposed algorithm is to detemine valid ranges of input variables of an FLC in order to maximize performance indices fo the control system. The performance indices are so ismple as to be realized by hardware circuit. in dadditon to the conventional scaling-factor adjustment, the algorithm adjusts offset values as well, which, in effect, modifies fuzzy rules of the FLC. To justify the performance of the proposed algorithm, a simulation study is executed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.352-358
• /
• 2004

This paper is studied the improvement of performance for moving picture encoder using H.263. This is used the new motion vector search algorithm using a relation with neighborhood search point and is applied the integer DCT for the encoder. The integer DCT behaves DCT by the addition operation of the integer using WHT and a integer lifting than conventional DCT that needs the multiplication operation of a floating point number. Therefore, the integer Dn can reduce the operation amount than basis DCT with having an equal PSNR. The new motion vector search algorithm is showed almost similar PSNR as reducing the operation amount than the conventional motion vector search algorithm. To experiment a compatibility of the integer DCT and the conventional DCT, according to result compare case that uses a method only and case that uses the alternate two methods of the integer DCT or the conventional DCT to H.263 encoder and decoder, case that uses the alternate two methods is showed doing not deteriorate PSNR-and being each other compatible visually than case that uses an equal method only.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.9
• /
• pp.243-250
• /
• 2021

Recently, with the development of cloud computing, interest in database outsourcing is increasing. However, when the database is outsourced, there is a problem in that the information of the data owner is exposed to internal and external attackers. Therefore, in this paper, we propose a parallel range query processing algorithm that supports privacy protection. The proposed algorithm uses the Paillier encryption system to support data protection, query protection, and access pattern protection. To reduce the operation cost of a checking protocol (SRO) for overlapping regions in the existing algorithm, the efficiency of the SRO protocol is improved through a garbled circuit. The proposed parallel range query processing algorithm is largely composed of two steps. It consists of a parallel kd-tree search step that searches the kd-tree in parallel and safely extracts the data of the leaf node including the query, and a parallel data search step through multiple threads for retrieving the data included in the query area. On the other hand, the proposed algorithm provides high query processing performance through parallelization of secure protocols and index search. We show that the performance of the proposed parallel range query processing algorithm increases in proportion to the number of threads and the proposed algorithm shows performance improvement by about 5 times compared with the existing algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.9
• /
• pp.139-147
• /
• 2012

This paper suggests simple search algorithm for optimal solution in assignment problem. Generally, the optimal solution of assignment problem can be obtained by Hungarian algorithm. The proposed algorithm reduces the 4 steps of Hungarian algorithm to 1 step, and only selects the minimum cost of row and column then gets the optimal solution simply. For the 27 balanced and 7 unbalanced assignment problems, this algorithm finds the optimal solution but the genetic algorithm fails to find this values. This algorithm improves the time complexity O($n^3$) of Hungarian algorithm to O(n). Therefore, the proposed algorithm can be general algorithm for assignment problem replace Hungarian algorithm.

• Journal of IKEEE
• /
• v.17 no.1
• /
• pp.36-43
• /
• 2013

This paper proposes a motion estimation algorithm with run-time adaptive workload control. It has optimized performance within limited hardware resources while guaranteeing hard realtime operation. It performs maximum searches within hard realtime constraints, since it determines search steps and workload adaptively. It reduces the hardware size to 1/4~1/400 of conventional algorithms, while its PSNR degradation is only 0.02~0.44 dB. It can be easily applied to most conventional fast algorithms, so it is useful to design realtime encoder chips.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.3
• /
• pp.395-400
• /
• 2011

In this paper, we propose an study of the facial emotion recognition considering the dynamical variation of emotional state in facial image sequences. The proposed system consists of two main step: facial image based emotional feature extraction and emotional state classification/recognition. At first, we propose a method for extracting and analyzing the emotional feature region using a combination of Active Shape Model (ASM) and Facial Action Units (FAUs). And then, it is proposed that emotional state classification and recognition method based on Hidden Markov Model (HMM) type of dynamic Bayesian network. Also, we adopt a Harmony Search (HS) algorithm based heuristic optimization procedure in a parameter learning of HMM in order to classify the emotional state more accurately. By using all these methods, we construct the emotion recognition system based on variations of the dynamic facial image sequence and make an attempt at improvement of the recognition performance.