• Journal of Broadcast Engineering
• /
• v.16 no.4
• /
• pp.647-656
• /
• 2011

Motion estimation using one-bit transform and two-bit transform reduces the complexity for computation of matching error; however, the peak signal-to-noise ratio (PSNR) is degraded. Modified 1BT (M1BT) and modified 2BT (M2BT) have been proposed to compensate degraded PSNR by adding conditional local search. However, these algorithms require many additional search points in fast moving sequences with a block size of $16{\times}16$. This paper provides more efficient search method by preparing candidate blocks using the number of non-matching points (NNMP) than the conditional local search. With this NNMP-based search, we can easily obtain candidate blocks with small NNMP and efficiently search final motion vector. Experimental results show that the proposed algorithm not only reduces computational complexity, but also improves PSNR on average compared with conventional search algorithm used in M1BT, M2BT and AM2BT.

• Journal of the Korea Computer Graphics Society
• /
• v.18 no.1
• /
• pp.29-34
• /
• 2012

High-quality tetrahedral meshes are crucial for FEM-based simulation of large elasto-plastic deformation and tetrahedral-mesh-based simulation of fluid flow. This paper proposes a volume meshing method that exploits an octree-based adaptive signed distance field to fill the inside of a polygonal object with tetrahedra, of which dihedral angles are good. The suggested method utilizes an octree structure to reduce the total number of tetrahedra by space-efficiently filling an object with graded tetrahedra. To obtain a high-quality mesh with good dihedral angles, we restrict the octree in such a way that any pair of neighboring cells only differs by one level. In octree-based tetrahedral meshing, the signed distance computation of a point to the surface of a given object is a very important and frequently-called operation. To accelerate this operation, we develop a method that computes a signed distance field directly on the vertices of the octree cells while constructing the octree using a top-down approach. This is the main focus of the paper. The suggested tetrahedral meshing method is fast, stable and easy to implement.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.18 no.5
• /
• pp.162-168
• /
• 2004

Service restoration is an emergency control in distribution control centers to restore out-of-service area as soon as possible when a fault occurs in distribution networks. Therefore, it requires fast computation time and high quality solutions for load balancing. In this paper, a load balance index and heuristic guided best-first search are proposed for these problem. The proposed algorithm consists of two parts. One is to set up a decision tree to represent the various switching operations available. Another is to identify the most effective the set of switches using proposed search technique and a feeder load balance index. Test results on the KEPCO's 108 bus distribution system show that the performance is efficient and robust.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.8
• /
• pp.375-387
• /
• 2005

This paper presents an application of parallel Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a service restoration in distribution systems. The main objective of service restoration of distribution systems is, when a fault or overload occurs, to restore as much load as possible by transferring the do-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints, which is a combinatorial optimization problem. This problem has many constraints with many local minima to solve the optimal switch position. This paper develops parallel GA-TS algorithm for service restoration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solutions of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper $10\%$ of the population to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC cluster system consists of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through ethernet switch based fast ethernet. To show the validity of the proposed method, proposed algorithm has been tested with a practical distribution system in Korea. From the simulation results, we can find that the proposed algorithm is efficient for the distribution system service restoration in terms of the solution quality, speedup, efficiency and computation time.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.25-36
• /
• 2004

This paper proposes and measures the performance of a distributed EIT (Electrical Impedance Tomography) image reconstruction algorithm which has a master-slave structure. The image construction is a computation based application of which the execute time is proportional to the cube of the unknowns. After receiving a specific frame from the master, each computing node extracts the basic elements by executing the first iteration of Kalman Filter in parallel. Then the master merges the basic element lists into one group and then performs the sequential iterations with the reduced number of unknowns. Every computing node has MATLAB functions as well as extended library implemented for the exchange of MATLAB data structure. The master implements another libraries such as threaded multiplication, partitioned inverse, and fast Jacobian to improve the speed of the serial execution part. The parallel library reduces the reconstruction time of image visualization about by half, while the distributed grouping scheme further reduces by about 12 times for the given target object when there are 4 computing nodes.

• Journal of KIISE
• /
• v.42 no.10
• /
• pp.1286-1293
• /
• 2015

Most e-marketplaces build a reputation system that provides potential buyers with reputation scores of sellers in order for buyers to identify the sellers that are more reliable and trustworthy. The reputation scores are computed based on the aggregation of buyers' ratings. However, when these ratings are used to compute the reputation scores, the existing reputation systems do not make a distinction according to the following two criteria: the capability of the seller and the quality of an item. We claim that a reputation system needs to separate the two criteria in order to provide more precise information about the seller. In this paper, we propose a method to compute seller's reputation by separating the rating into the seller's score and the item's score. The proposed method computes the reputation of the seller's capability by using only the 'seller's score' and helps potential buyers to find reliable sellers who provide fast delivery and better service. In experiments, we propose a simulation strategy that reflects the real life of an E-marketplace and verify the effectiveness of our method by using the generated simulation data.

• Journal of Korean Society for Quality Management
• /
• v.47 no.4
• /
• pp.739-754
• /
• 2019

Purpose: The purpose of this paper is to develop a reliability estimation procedure for the underground gas pipeline in the presence of corrosion defects. Methods: Corrosion is one of the major causes of the gas pipeline failure. Several failure forms caused by corrosion have been studied. Among them, small leak and burst are considered in this paper. The composite failure of the two is defined by limit state function, and it is expressed with pipe parameters. Given a modified corrosion dataset, in order to obtain reliability estimations, the method of first order and second moment is adopted because of its simplicity. The computation processes are conducted with MATLAB coding. Results: According to numerical results, the probability of composite failure is affected by both small leak and burst. In particular, when corrosion depth stays at low level, it is consistent with the probability of burst failure. On the contrary, it is more influenced by the small leak failure as corrosion depth is increasing. In such case, the probability of composite failure is fast approaching to the safety limit. Conclusion: By considering the composite failure, more practical predictions of remaining life can be obtained. The proposed method is useful for maintenance planning of the underground gas pipeline.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.4
• /
• pp.1527-1539
• /
• 2015

In this paper the hardware implementation of the direct torque control based on the fuzzy logic technique of induction motor on the Field-Programmable Gate Array (FPGA) is presented. Due to its complexity, the fuzzy logic technique implemented on a digital system like the DSP (Digital Signal Processor) and microcontroller is characterized by a calculating delay. This delay is due to the processing speed which depends on the system complexity. The limitation of these solutions is inevitable. To solve this problem, an alternative digital solution is used, based on the FPGA, which is characterized by a fast processing speed, to take the advantage of the performances of the fuzzy logic technique in spite of its complex computation. The Conventional Direct Torque Control (CDTC) of the induction machine faces problems, like the high stator flux, electromagnetic torque ripples, and stator current distortions. To overcome the CDTC problems many methods are used such as the space vector modulation which is sensitive to the parameters variations of the machine, the increase in the switches inverter number which increases the cost of the inverter, and the artificial intelligence. In this paper an intelligent technique based on the fuzzy logic is used because it is allows controlling the systems without knowing the mathematical model. Also, we use a new method based on the Xilinx system generator for the hardware implementation of Direct Torque Fuzzy Control (DTFC) on the FPGA. The simulation results of the DTFC are compared to those of the CDTC. The comparison results illustrate the reduction in the torque and stator flux ripples of the DTFC and show the Xilinx Virtex V FPGA performances in terms of execution time.

• Journal of Korean Society of Transportation
• /
• v.22 no.2 s.73
• /
• pp.43-54
• /
• 2004

This study analyzes characteristics and applicability of genetic algorithms and genetic operators to optimize highway alignments. Genetic algorithms, one of artificial intelligence techniques, are fast and efficient search algorithms for generating, evaluation and finding optimal highway alignment alternatives. The performance of genetic algorithms as an optimal search tool highly depends on genetic operators that are designed as a problem-specific. This study adopts low mutation operators(uniform mutation operator, straight mutation operator, non-uniform mutation operator whole non-uniform mutation operator) to explore whole search spaces, and four crossover operators(simple crossover operator, two-point crossover operator, arithmetic crossover operator, heuristic crossover operator) to exploit food characteristics of the best chromosome in previous generations. A case study and a sensitivity analysis have shown that the eight problem-specific operators developed for optimizing highway alignments enhance the search performance of genetic algorithms, and find good solutions(highway alignment alternatives). It has been also found that a mixed and well-combined use of mutation and crossover operators is very important to balance between pre-matured solutions when employing more crossover operators and more computation time when adopting more mutation operators.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.4
• /
• pp.1254-1259
• /
• 2010

In this paper, Low Computational Adaptive Expanded Block Search Motion Estimation Method is proposed. Proposed method classifies ME blocks as Average Motion Block(AMB) and Local Motion Block(LMB) according to correlation of reference frame. It could reduce the computational complexity with performing Modified Fast Search(MFS). And accuracy of MV is also increased by 4 sub-blocks on LMB and Block Expansion(BE). The experimental results show that the proposed method has better performance that increased 1.8dB than Diamond Search and 0.6dB than Full Search with 7.5 % computation of Full Search. The proposed method could be applied to video compression and Frame Rate Conversion(FRC).