• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.9
• /
• pp.81-92
• /
• 1998

A new hybrid technique using several sub-populations having completely different evolutionary behaviors is proposed to increase the possibility to quickly find the global optimum of continuous optimization problem. It has three sub-populations. Two NPOSA algorithms showing good performance in the problem having a rugged fitness function are applied to two sub-populations and a self-adaptive evolutionary algorithm to the other sub-population. Sub-populations evolve in different manners and the interaction among these sub-populations lead to the global optimum quickly. The efficiency of this technique is verified through benchmark test functions. Finally, the algorithm with three sub-populations has been applied to seek for the optimal camera calibration parameters. After an error function has been defined using measured feature points of a calibration block, it has been shown that the algorithm searches for the camera parameters that minimize the error function.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.2
• /
• pp.127-132
• /
• 2019

In this paper, we propose a visual inspection method of automotive parts for injection molding to improve the appearance quality and productivity of automotive parts. Exterior inspection of existing injection molding automobile parts was generally done by manual sampling inspection by human. First, we applied the edge-tolerance vision inspection algorithm ([1] - [4]) for vision inspection of electronic components (TFT-LCD and PCB) And we propose a new visual inspection method to overcome the problem. In the proposed visual inspection, the inspection images of the parts to be inspected are aligned on the basis of the reference image of good quality. Then, after partial adaptive binarization, the binary block matching algorithm is used to compare the good binary image and the test binary image. We verified the effectiveness of the edge-tolerance vision check algorithm and the proposed appearance vision test method through various comparative experiments using actual developed equipment.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.3 s.303
• /
• pp.91-98
• /
• 2005

In this paper, we propose a temporal error concealment method based on the edge adaptive masking. In the method, four regions around the corrupted block - top, bottom, left, and right - are defined and the edge features of the regions are extracted by applying an edge operator for each direction. The size of a mask for the boundary matching is determined by the edge information, which can be considered as a criterion to measure the activity of the boundary region. In other words, it is determined such that the size of the mask is proportional to the amount of edge-component extracted from each region in order to yield the higher reliability on boundary matching. This process is equivalent to applying weights depending on the edge features, which leads the improved motion vector. In experiments, it is verified that the proposed method outperforms the conventional methods in terms of image quality, and then its merits and demerits are discussed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3C
• /
• pp.288-296
• /
• 2009

In POCS (projection onto convex sets)-based reconstruction of HR (high resolution) image, the quality of reconstructed image is gradually improved through iterative motion estimation and image restoration. The amount of computation, however, increases because of the repeated inter-frame motion estimation. In this paper, an HR reconstruction algorithm is proposed where modified ARPS (adaptive rood pattern search) and POCS are simultaneously performed. In the modified ARPS, the motion estimates obtained from phase correlation or from the previous steps in POCS restoration are utilized as the initial reference in the motion estimation. Moreover, estimated motion is regularized with reference to the neighboring blocks' motion to enhance the reliability. Computer simulation results show that, when compared to conventional methods which are composed of full search block matching and POCS restoration, the proposed method is about 30 times faster and yet produces HR images of almost equal or better quality.

• Journal of Broadcast Engineering
• /
• v.5 no.2
• /
• pp.247-259
• /
• 2000

This paper introduces a new technique that reduces the search times and Improves the accuracy of motion estimation using high temporal and spatial correlation of motion vector. Instead of using the fixed first search Point of previously proposed search algorithms, the proposed method finds more accurate first search point as to compensating searching area using high temporal and spatial correlation of motion vector. Therefore, the main idea of proposed method is to find first search point to improve the performance of motion estimation and reduce the search times. The proposed method utilizes the direction of the same coordinate block of the previous frame compared with a block of the current frame to use temporal correlation and the direction of the adjacent blocks of the current frame to use spatial correlation. Based on these directions, we compute the first search point. We search the motion vector in the middle of computed first search point with two fixed search patterns. Using that idea, an efficient adaptive predicted direction search algorithm (APDSA) for block matching motion estimation is proposed. In the experimental results show that the PSNR values are improved up to the 3.6dB as depend on the Image sequences and advanced about 1.7dB on an average. The results of the comparison show that the performance of the proposed APDSA algorithm is better than those of other fast search algorithms whether the image sequence contains fast or slow motion, and is similar to the performance of the FS (Full Search) algorithm. Simulation results also show that the performance of the APDSA scheme gives better subjective picture quality than the other fast search algorithms and is closer to that of the FS algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2C
• /
• pp.291-297
• /
• 2004

In this paper, a new structure for the AEC(Acoustic Echo Canceller) is proposed in which echo signal components that can be created in mobile communications is effectively eliminated. Block Data Flow Architecture is a parallel architecture that achieves high performance, high efficiency, high throughput, and almost linear speed up. The proposed architecture employs AEC and is implemented using the TMS320C6711 for real-time applications. The proposed AEC shows improved performance by eliminating echoes at 55ms delay path. Since the proposed AEC can also be implemented in Firmware, it is believed to effectively work on various types of echoes if it is applied on CDMA mobile devices. The TMS320C6711 shows much better performance comparing to previous DSPs. For experimental verifications, filtering operation using adaptive algorithm is performed on TMS320C6711 board and error signals resulted from computations are monitored on PC, and then the performance of the implemented AEC is verified through ERLE computation. According the results of simulation, good characteristic of 100dB are shown after 500 sampling data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.11
• /
• pp.2264-2275
• /
• 1994

In this paper, image compression based on neural networks is presented with block classification and coding. Multilayer neural networks with error back-propagation learning algorithm are used to transform the normalized image date into the compressed hidden values by reducing spatial redundancies. Image compression can basically be achieved with smaller number of hidden neurons than the numbers of input and output neurons. Additionally, the image blocks can be grouped for adaptive compression rates depending on the characteristics of the complexity of the blocks in accordance with the sensitivity of the human visual system(HVS). The quantized output of the hidden neuron can also be entropy coded for an efficient transmission. In computer simulation, this approach lie in the good performances even with images outside the training set and about 25:1 compression rate was achieved using the entropy coding without much degradation of the reconstructed images.

• 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 Korea Contents Association Conference
• /
• 2004.05a
• /
• pp.396-400
• /
• 2004

In this study, we have proposed the tracking system of single moving object. The tracking system was estimated motion using differential image, and than track the moving object by controlled Pan/Tilt device of camera. Proposed tracking system is devided into image acquisition and preprocessing phase, motion estimation phase and object tracking phase. To estimation the motion, differential image method was used. In the binary differential image, decision of threshold value was used adaptive method. And in grouping the object area, block_based recursive labeling algorithm was used. As a result of experiment, motion of moving object can be estimated. The result of tracking, object was not lost and object was tracked correctly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8A
• /
• pp.669-678
• /
• 2012

In this paper, we propose an efficient fast integer-pel motion estimation for H.264/AVC using local statistics of local motion vectors. Using neighboring motion vectors, we define a new statistical property that is used to determine a mode of motion search range of current block. In addition, an adaptive motion search range compensated method that is based on cumulative statistics of previous coded blocks is addressed to solve the problem of the statistical motion search range decision method. Experimental results show that proposed algorithm has the capability to reduce the computational cost over the other methods.