• Journal of Korea Multimedia Society
• /
• v.21 no.3
• /
• pp.342-347
• /
• 2018

We proposed a fast detection of copy-move image forgery using four step search algorithm in the spatial domain. In the four-step search algorithm, the search area is 21 (-10 ~ +10), and the number of pixels to be scanned is 33. Our algorithm reduced computational complexity more than conventional copy move image forgery methods. The proposed method reduced 92.34 % of computational complexity compare to exhaustive search algorithm.

• Journal of Korea Multimedia Society
• /
• v.22 no.5
• /
• pp.527-534
• /
• 2019

Recently, Photo editing softwares such as digital cameras, Paintshop Pro, and Photoshop digital can create counterfeit images easily. Various techniques for detection of tamper images or forgery images have been proposed in the literature. A form of digital forgery is copy-move image forgery. Copy-move is one of the forgeries and is used wherever you need to cover a part of the image to add or remove information. Copy-move image forgery refers to copying a specific area of an image itself and pasting it into another area of the same image. The purpose of copy-move image forgery detection is to detect the same or very similar region image within the original image. In this paper, we proposed fast detection of forgery image using four step search based on discrete cosine transform and a four step search algorithm using discrete cosine transform (FSSDCT). The computational complexity of our algorithm reduced 34.23 % than conventional DCT three step search algorithm (DCTTSS).

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.9
• /
• pp.86-94
• /
• 1998

This paper proposes a new fast block-matching algorithm, named MFSS(Modified Four-Step Search) algorithm, which has better performance and is more adequate for hardware realization than the existing fast algorithms. The proposed algorithm is suitable for hardware realization since it has a unique regularity during the search procedure. It is shown from simulation results that its performance is close to that of FS(Full Search) algorithm. This paper also proposes a VLSI architecture and presents some design results of a motion estimator and compensator which adopted the MFSS algorithm. The important aspects considered in designing a motion estimator and compensator are hardware complexity of design results, and total delay needed to generate the motion compensated data after finding the motion vectors. Hardware complexity is minimized by using just nine PE(Process Element)'s, and total delay is minimized by sharing search memory of the motion estimator and compensator.

• Journal of the Korea Computer Graphics Society
• /
• v.6 no.3
• /
• pp.35-40
• /
• 2000

There are two problems in H.26X compression technique. One is compressing time in encoding process and the other is degradation of the decoded video quality due to high compression rate. For transferring moving pictures in real-time, it is required to adopt massively high compression. In this case, there are a lot of losses of an original video data and that results in degradation of quality. Especially degradation called by blocking artifact may be produced. The blocking artifact effect is produced by DCT-based coding techniques because they operate without considering correlation between pixels in block boundaries. So it represents discontinuity between adjacent blocks. This paper describes methods of quality compensation for H.26x decoded data and enhancing encoding speed for real-time operation. Our goal of the quality compensation is not to make the decoded video identical to a original video but to make it perceived better through human eyes. We suggest an algorithm that reduces block artifact and clears decoded video in decoder. To enhance encoding speed, we adopt new four-step search algorithm. As shown in the experimental result, the quality compensation provides better video quality because of reducing blocking artifact. And then new four-step search algorithm with $MMX^{TM}$ implementation improves encoding speed from 2.5 fps to 17 fps.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.3
• /
• pp.221-230
• /
• 1988

This paper presents an effective block matching algorithm(BMA) in which the number of search point is about a half of that of three step search, and the number of search step is fixed a four. The performance of the proposed algorithm is compared with those of three step search and one-at-at time search(OTS) for three video sequences composed of 16 framse. Moreover the performance of applying subsampling or integral projection to each BMA for further reducing the amount of computation is considered.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.5
• /
• pp.373-378
• /
• 2001

The optimization method based on an enhanced genetic algorithms is for multimodal function optimization in this paper. This method is consisted of two main steps. The first step is a global search step using the genetic algorithm(GA) and function assurance criterion(FAC). The belonging of an population to initial solution group is decided according to the FAC. The second step is to decide the similarity between individuals, and to research the optimum solutions by single point method in reconstructive search space. Four numerical examples are also presented in this papers to comparing with conventional methods.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.13-20
• /
• 2003

Based on the studies on the motion vector distributions estimated on the image sequences, we proposed constrained diamond search (DS) algorithm for fast block-matching motion estimation. By considering the fact that motion vectors are searched within the 2 pixels distance in vertically and horizontally on average, we confirmed that DS algorithm achieves close performance on error ratio and requires less computation compared with new three-step search (NTSS) algorithm. Also, by applying displaced frame difference (DFD) to DS algorithm, we reduced the computational loads needed to estimate the motion vectors within the stable block that do not have motions. And we reduced the possibilities falling into the local minima in the course of estimation of motion vectors by applying DFD to DS algorithm. So, we knew that proposed constrained DS algorithm achieved enhanced results as aspects of error ratio and the number of search points to be necessary compared with conventional DS algorithm, four step search (FSS) algorithm, and block-based gradient-descent search algorithm

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06a
• /
• pp.246-247
• /
• 2010

This paper proposes a fast motion estimation algorithm based on motion speed and multiple initial center points. The proposed method predicts initial search points by means of the spatio-temporal neighboring motion vectors. A dynamic search pattern based on motion speed and the predicted initial center points is proposed to quickly obtain the motion vector. Due to the usage of the spatio-temporal information and the dynamic search pattern, the proposed method greatly accelerates the search speed while maintaining a good predicted image quality. Experimental results show that the proposed method has a good predicted image quality in terms of PSNR with less search time as compared to the Full Search, New Three-Step Search, and Four-Step Search.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.12
• /
• pp.1219-1223
• /
• 2010

This paper proposes a fast motion estimation algorithm based on motion speed and multiple initial center points. The proposed method predicts initial search points by means of the spatio-temporal neighboring motion vectors. A dynamic search pattern based on the motion speed and the predicted initial center points is proposed to quickly obtain the motion vector. Due to the usage of the spatio-temporal information and the dynamic search pattern, the proposed method greatly accelerates the search speed while keeping a good predicted image quality. Experimental results show that the proposed method has a good predicted image quality in terms of PSNR with less searching time comparing with the Full Search, New Three-Step Search, and Four-Step Search.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1999.10a
• /
• pp.464-469
• /
• 1999

Recently, the need for designing multi-stage gear drive has been increased as the hear drives are used more in the applications with high-speed and small volume. The design of multi-stage gear drives includes not only dimensional design but also configuration design of various machine elements. Until now, however, the researches on the design of gear drives are mainly focused on the single-stage gear drives and the design practices for multi-stage gear drives, especially in configuration design activity, mainly depend on the experiences and 'sense' of the designer by trial and error. We propose a design algorithm to automate the dimension design and the configuration design of multi-stage gear drives. The design process consists of four steps. The number of stage should be determined in the first step. In second step, the gear ratios of each reduction stage are determined using random search, and the ratios are basic input for the dimension design of gears, which is performed by the exhaustive search in third step. The designs of gears are guaranteed by the pitting resistance and bending strength rating practices by AGMA rating formulas. In configuration design, the positions of gears are determined to minimize the volume of gearbox using simulated annealing algorithm. The effectiveness of the algorithm is assured by the design example of a 4-stage gear drive.