• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.187-194
• /
• 2011

In this paper, JPEG(Joint Photographic Experts Group) image data video decoding technique is presented, it is Huffman decoding method and fractal image method which is very complexive algorithm and the time required much it to implement this method and the first image is decoded to video frame image. This have defect of overlap decoding and transport work because of impossible to represent objective value of resemblance. The proposed method was calculated the mathematical absolute image resemblance and simplify the moving picture process to reducing the step of moving picture codefying. The results show that smoothed moving picture compared recent methods.

• International Journal of Computer Science & Network Security
• /
• v.21 no.9
• /
• pp.203-211
• /
• 2021

Image tampering detection and localization have become an active area of research in the field of digital image forensics in recent times. This is due to the widespread of malicious image tampering. This study presents a new method for image tampering detection and localization that combines the advantages of dilated convolution, residual network, and UNET Architecture. Using the UNET architecture as a backbone, we built the proposed network from two kinds of residual units, one for the encoder path and the other for the decoder path. The residual units help to speed up the training process and facilitate information propagation between the lower layers and the higher layers which are often difficult to train. To capture global image tampering artifacts and reduce the computational burden of the proposed method, we enlarge the receptive field size of the convolutional kernels by adopting dilated convolutions in the residual units used in building the proposed network. In contrast to existing deep learning methods, having a large number of layers, many network parameters, and often difficult to train, the proposed method can achieve excellent performance with a fewer number of parameters and less computational cost. To test the performance of the proposed method, we evaluate its performance in the context of four benchmark image forensics datasets. Experimental results show that the proposed method outperforms existing methods and could be potentially used to enhance image tampering detection and localization.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2108-2111
• /
• 2003

This paper introduces a new local feature extraction method and image matching method for the localization and classification of targets. Proposed method is based on the block-by-block projection associated with directional pattern of blocks. Each pattern has its own eigen-vertors called as CEBs(Classified Eigen-Blocks). Also proposed block-based image matching method is robust to translation and occlusion. Performance of proposed feature extraction and matching method is verified by the face localization and FLIR-vehicle-image classification test.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.3
• /
• pp.215-219
• /
• 2000

The purpose of this paper is to propose a method to maximize the efficiency of a content-based image retrieval for various kinds of images. This paper discuss the self-adaptivity for the change of image domain and the self-selection of optimal features for query image, and present the efficient method to maximize content-based retrieval for various kinds of images. In this method, a content-based retrieval system is adopted to select automatically distinctive feature patterns which have a maximum efficiency of image retrieval in various kinds of images. Experimental results show that the Proposed method is improved 3% than the method using individual features.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.10
• /
• pp.69-76
• /
• 2016

In this paper, an efficient image denoising method using non-local means (NL-means) method in the transform domain is proposed. Survey for various image denoising methods has been given, and the performances of the image denoising method using NL-means method have been analyzed. We propose an efficient implementation method for NL-means method by calculating the weights for NL-means method in the DCT and LiftLT transform domain. By using the proposed method, the computational complexity is reduced, and the image denoising performance improves by using the characteristics of images in the tranform domain efficiently. Moreover, the proposed method can be applied efficiently for performing image denoising and image rescaling simultaneously. Extensive computer simulations show that the proposed method shows superior performance to the conventional methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.12
• /
• pp.2343-2348
• /
• 2006

Image magnification is among the basic image processing operations. The most commonly used technique for image magnification are based on interpolation method(such as nearest neighbor, bilinear and cubic interpolation). However, the magnified images produced by the techniques that often appear a variety of undesirable image artifacts such as 'blocking' and 'blurring' or too takes the processing time into the several processing for image magnification. In this paper, we propose image magnification method which uses input image's sub-band information such as edge information to enhance the image magnification method. We use the whole image and not use the one's neighborhood pixels to detect the edge information of the image that isn't occurred the blocking phenomenon. And then we emphasized edge information to remove the blurring phenomenon which incited of edge information. Our method, which improves the performance of the traditional image magnification methods in the processing time, is presented. Experiment results show that the proposed method solves the drawbacks of the image magnification such as blocking and blurring phenomenon, and has a higher PSNR and Correlation than the traditional methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7A
• /
• pp.676-682
• /
• 2002

In this paper, an effective stereo image compression and reconstruction technique using a new adaptively compensated-disparity prediction scheme is proposed. That is, by adaptively predicting the mutual correlation between the stereo image using the proposed method, the bandwidth of the stereo input image can be compressed to the level of the conventional 2D image and the predicted image also can be effectively reconstructed using this transmitted reference image and disparity data in the receiver. Especially, in the proposed method, once the feature values are extracted from the input stereo image, then the matching window size for the predicted image reconstruction is adaptively selected in accordance with the magnitude of this feature values. From this adaptive disparity estimation method, reduction of the mismatching probability of the disparity vectors is expected and as a result, the image quality in the reconstructed image can be improved. In addition, from some experiments using the CCETT's stereo images of 'Fichier', 'Manege' and 'Tunnel', it is shown that the proposed method improves the PSNR of the reconstructed image to about 9.08 dB on average by comparing with that of the conventional methods. And also, it is found that there is almost no difference between the original image and the predicted image reconstructed through the proposed method by comparison to that of the conventional methods.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.1
• /
• pp.38-42
• /
• 2002

A fast iterative solving method of fuzzy relational equation is proposed. It is derived by eliminating a redundant comparison process in the conventional iterative solving method (Pedrycz, 1983). The proposed method is applied to image reconstruction, and confirmed that the computation time is decreased to 1 / 40 with the compression rate of 0.0625. Furthermore, in order to make any initial solution converge on a reconstructed image with a good quality, a new cost function is proposed. Under the condition that the compression rate is 0.0625, it is confirmed that the root mean square error of the proposed method decreases to 27.34% and 86.27% compared with those of the conventional iterative method and a non iterative image reconstruction method, respectively.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.46 no.3
• /
• pp.268-274
• /
• 2023

Image mosaicking is one of the basic and important technologies in the field of application using images. The key of image mosaicking is to extract seamlines from a joint image. The method proposed in this paper for image mosaicking is as follows. The feature points of the images to be joined are extracted and the joining form between the two images is identified. A reference position for detection the seamlines were selected according to the joint form, and an image pyramid was created for efficient image processing. The outlines of the image including buildings and roads are extracted from the overlapping area with low resolution, and the seamlines are determined by considering the components of the outlines. Based on this, the seamlines in the high-resolution image was re-searched and finally the seamline for image mosaicking was determined. In addition, in order to minimize color distortion of the image with the determined seamline, a method of improving the quality of the mosaic image by fine correction of the mosaic area was applied. It was confirmed that the quality of the seamline extraction results applying the method proposed was reasonable.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.33 no.1
• /
• pp.68-75
• /
• 1997

In this paper, we propose the improved initial image estimation method for a fast fractal image decoding. When the correlation between a domain and a range is given as the linear equation, the value of initial image estimation using the conventional method is the intersection between its linear equation and y=x. If the gradient of linear equation is large, that the difference of the value between each adjacent pixels is large, the conventional method has disadvantage which has the impossibility of exact estimation. The method of the proposed initial image estimation performs well by two steps. he first step can improve the disadvantage of the conventional method. The second step upgrades the range value which was found previous step by referring information of its domain. Though the computational complexity for the initial image estimation increses slightly, the total computational complexity decreases by 30% than that of the conventional method because of diminishing in the number of iterations.