• Journal of the Optical Society of Korea
• /
• v.16 no.4
• /
• pp.372-380
• /
• 2012

The optical method Digital Speckle Correlation Measurement (DSCM) has been extensively applied due its capability to measure the entire displacement field over a body surface. A formula of displacement measurement errors by the gradient-based DSCM method was derived. The errors were found to explicitly relate to the image grayscale errors consisting of sub-pixel interpolation algorithm errors, image noise, and subset deformation mismatch at each point of the subset. A power-law dependence of the standard deviation of displacement measurement errors on the subset size was established when the subset deformation was rigid body translation and random image noise was dominant and it was confirmed by both the numerical and experimental results. In a gradient-based algorithm the basic assumption is rigid body translation of the interrogated subsets, however, this is in contradiction to the real circumstances where strains exist. Numerical and experimental results also indicated that, subset shape function mismatch was dominant when the order of the assumed subset shape function was lower than that of the actual subset deformation field and the power-law dependence clearly broke down. The power-law relationship further leads to a simple criterion for choosing a suitable subset size, image quality, sub-pixel algorithm, and subset shape function for DSCM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3C
• /
• pp.258-263
• /
• 2006

Each pixel in a matching block does not equally contribute to block matching and the matching error is greatly affected by image complexity. On the basis of the facts, this paper proposes a fast motion estimation algorithm using some sub-blocks selected by the image complexity. The proposed algorithm divides a matching block into 16 sub-blocks, computes the image complexity in every sub-block, executes partial block matching using some sub-blocks with large complexity, and detects a motion vector. The simulation results show that the proposed algorithm brings about negligible image degradation, but can reduce a large amount of computation in comparison with conventional algorithms.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.339-342
• /
• 2002

The feature points in the uncalibrated stereo vision should represent all the characteristics of an image in multiple resolution, have high precision, and have the robustness against mismatching. This paper proposed an algorithm which detects the corner points in multi-resolution for stereo computer vision. The algorithm has sub-pixel precision, rejects the mismatched points, and corrects the lens distortion. We show the performance of the algorithm by estimating the homography with it.

• Journal of Industrial Technology
• /
• v.28 no.A
• /
• pp.35-42
• /
• 2008

Recently, there are a lot of multimedia products to using image interpolation system. However, most interpolation systems in existence suffer visually to some extents the effects of blurred edges and jagged artifacts in the image. I in this paper, we propose the adaptive linear interpolation system that uses the sub-pixel. We system calculate the warped distance among the pixels of an image, and use data for Optimize length parameter. Our experimental results show that our new algorithm significantly outperforms linear interpolation in subjective quality, and in most cases, in terms of PSNR as well.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.11a
• /
• pp.106-109
• /
• 2011

본 논문에서는 연속된 프레임을 갖는 영상의 프레임간 움직임 추정 기법을 응용하여 고해상도 영상을 획득하는 초고 해상도 기법을 제안한다. 기존의 단일 영상을 이용한 초고해상도 기법의 경우 영상에서의 고주파 대역을 찾기 위해 확률 기반의 다양한 방법이 제시되었으나 연산에 사용할 수 있는 정보가 제한적이라는 문제가 존재한다. 이러한 문제를 해결하기 위해 연속된 프레임을 이용한 다양한 초고해상도 기법이 제안되었다. 본 논문에서는 주어진 영상의 전, 후의 다수 프레임을 정하여 6-tap FIR(finite impulse response) 필터를 이용하여 프레임들의 부화소(sub-pixel)를 구한 뒤에, 부화소 정밀도의 움직임 추정을 통하여 보다 정확한 고주파성분을 복원하고자 한다. 실험을 통하여 제안하는 기법이 기존의 고등차수(bi-cubic)보간법 보다 선명한 영상을 획득할 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.2
• /
• pp.372-379
• /
• 2015

The latest video compression standard (such as H.264/AVC and HEVC) utilizes quarter-pel accuracy motion estimation in order to retain detailed motion information. Many sub-pixel motion estimation algorithms used in the spatial domain usually encounters increment of computational complexity due to embedded interpolation algorithm. In this paper, an approach to measure sub-pixel accuracy motion estimation in frequency domain using shifting matrix is proposed. Complexity can be reduced utilizing shifting matrix algorithm in frequency domain and simulation results demonstrate not only higher PSNR but lower bit rates than spatial domain algorithms.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.12 no.2
• /
• pp.41-49
• /
• 2016

Lossless encryption methods are more applicable than lossy encryption methods when marginal distortion is not tolerable. In this research, the author propose a novel lossless symmetric key encryption/decryption technique. In the proposed algorithm, the image is transformed into the frequency domain using the lifting wavelet transform, then the image sub-bands are encrypted in a such way that guarantees a secure, reliable, and an unbreakable form. The encryption involves scattering the distinguishable frequency data in the image using a reversible weighting factor amongst the rest of the frequencies. The algorithm is designed to shuffle and reverse the sign of each frequency in the transformed image before the image frequencies are transformed back to the pixel domain. The results show a total deviation in pixel values between the original and encrypted image. The decryption algorithm reverses the encryption process and restores the image to its original form. The proposed algorithm is evaluated using standard security and statistical methods; results show that the proposed work is resistant to most known attacks and more secure than other algorithms in the cryptography domain.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.5-10
• /
• 2010

This paper introduces a new fast motion estimation based on estimating a block matching error (i.e., sum of absolute difference (SAD)) between blocks which can eliminate an impossible candidate block much earlier than a conventional partial distortion elimination (PDE) scheme. The basic idea of the proposed scheme is based on predicting the total SAD of a candidate block using its partial SAD. In particular, in order to improve prediction accuracy and computational efficiency, a sub-sample based block matching and a selective pixel-based approaches are employed. In order to evaluate the proposed scheme, several baseline approaches are described and compared. The experimental results show that the proposed algorithm can reduce the computations by about 44% for motion estimation at the cost of 0.0005 dB quality degradation versus the general PDE algorithm.

• Proceedings of the KSRS Conference
• /
• 1998.09a
• /
• pp.252-256
• /
• 1998

Accurate mapping of satellite images is one of the most important Parts in many remote sensing applications. Since the position and the attitude of a satellite during image acquisition cannot be determined accurately enough, it is normal to have several hundred meters' ground-mapping errors in the systematically corrected images. The users which require a pixel-level or a sub-pixel level mapping accuracy for high-resolution satellite images must use a number of Ground Control Points (GCPs). In this paper, the performance of two geometric correction algorithms is tested and compared. One is the polynomial warping algorithm which is simple and popular enough to be implemented in most of the commercial satellite image processing software. The other is full camera modelling algorithm using Physical orbit-sensor-Earth geometry which is used in satellite image data receiving, pre-processing and distribution stations. Several criteria were considered for the performance analysis : ultimate correction accuracy, GCP representatibility, number of GCPs required, convergence speed, sensitiveness to inaccurate GCPs, usefulness of the correction results. This paper focuses on the usefulness of the precision correction algorithm for regular image pre-processing operations. This means that not only final correction accuracy but also the number of GCPs and their spatial distribution required for an image correction are important factors. Both correction algorithms were implemented and will be used for the precision correction of KITSAT-3 images.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.30 no.3B
• /
• pp.233-242
• /
• 2010

SEBAL (Surface Energy Balance Algorithm for Land) developed by Bastiaanssen (1995) is an image-processing model comprisedof twenty-five sub models that calculates spatial evapotranspiration (ET) and other energy exchanges at the surface. SEBAL uses image data from Landsat or other satellites measuring thermal infrared radiation, visible and near infrared. In this study, the model was applied to Gyeongancheon watershed, the main tributary of Han river Basin. ET was computed on apixel-by-pixel basis from an energy balance using 4 years (2001-2004) Landsat and MODIS images. The scale effect between Landsat (30 m) and MODIS (1 km) was evaluated. The results both from Landsat and MODIS were compared with FAO Penman-Monteith ET. The absolute errors between satellite ETs and Penman-Monteith ET were within 12%. The spatial and temporal characteristics of ET distribution within the watershed were also analyzed.