• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.26-28
• /
• 2007

The motion estimation is the most important technique in the image compression of the video standards. In the case of next generation standards in the video codec as H.264, a high compression-efficiency can be also obtained by using a motion compensation. To obtain the accurate motion search, a motion estimation should be achieved up to 1/2 pixel and 1/4 pixel uiuts. To do this, the computational complexity is increased although the image compression rate is increased. Therefore, in this paper, we propose the advanced sub-pixel block matching algorithm to reduce the computational complexity by using a statistical characteristics of SAD(Sum of Absolute Difference). Generally, the probability of the minimum SAD values is high when searching point is in the distance 1 from the reference point. Thus, we reduced the searching area and then we can overcome the computational complexity problem. The main concept of proposed algorithm, which based on TSS(Three Step Search) method, first we find three minimum SAD points which is in integer distance unit, and then, in second step, the optimal point is in 1/2 pixel unit either between the most minimum SAD value point and the second minimum SAD point or between the most minimum SAD value point and the third minimum SAD point In third step, after finding the smallest SAD value between two SAD values on 1/2 pixel unit, the final optimized point is between the most minimum SAD value and the result value of the third step, in 1/2 pixel unit i.e., 1/4 pixel unit in totally. The conventional TSS method needs an eight.. search points in the sub-pixel steps in 1/2 pixel unit and also an eight search points in 1/4 pixel, to detect the optimal point. However, in proposed algorithm, only total five search points are needed. In the result. 23 % improvement of processing speed is obtained.

• 대한원격탐사학회지
• /
• 제31권4호
• /
• pp.303-319
• /
• 2015

The objectives of this paper are to measure surface imperviousness using three different classification methods: per-pixel, sub-pixel, and object-oriented classification. They are tested on high-spatial resolution QuickBird data at 2.4 meters (four spectral bands and three principal component bands) as well as a medium-spatial resolution Landsat TM image at 30 meters. To measure impervious surfaces, we selected 30 sample sites with different land uses and residential densities across image representing the city of Phoenix, Arizona, USA. For per-pixel an unsupervised classification is first conducted to provide prior knowledge on the possible candidate spectral classes, and then a supervised classification is performed using the maximum-likelihood rule. For sub-pixel classification, a Linear Spectral Mixture Analysis (LSMA) is used to disentangle land cover information from mixed pixels. For object-oriented classification several different sets of scale parameters and expert decision rules are implemented, including a nearest neighbor classifier. The results from these three methods show that the object-oriented approach (accuracy of 91%) provides more accurate results than those achieved by per-pixel algorithm (accuracy of 67% and 83% using Landsat TM and QuickBird, respectively). It is also clear that sub-pixel algorithm gives more accurate results (accuracy of 87%) in case of intensive and dense urban areas using medium-resolution imagery.

• Korean Journal of Geomatics
• /
• 제4권1호
• /
• pp.1-8
• /
• 2004

In the middle-resolution remote sensing, the Ground Sampled Distance (GSD) that the detector senses and samples is generally larger than the actual size of the objects (or materials) of interest, and so several objects are embedded in a single pixel. In this case, as it is impossible to detect these objects by the conventional spatial-based image processing techniques, it has to be carried out at sub-pixel level through spectral properties. In this paper, we explain the sub-pixel analysis algorithm, also known as the Linear Spectral Mixing (LSM) model, which has been experimented using the Hyperion data. To find Endmembers used as the prior knowledge for LSM model, we applied the concept of the convex geometry on the two-dimensional scatter plot. The Atmospheric Correction and Minimum Noise Fraction techniques are presented for the pre-processing of Hyperion data. As LSM model is the simplest approach in sub-pixel analysis, the results of our experiment is not good. But we intend to say that the sub-pixel analysis shows much more information in comparison with the image classification.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.1727-1730
• /
• 2003

In this paper we propose a sub-pixel point spread function (PSF) estimation method for a fully digital auto-focusing system. We assume that the amount of out-of-focus is the same along the concentric circle. In order to estimate the accurate PSF, sub-pixel information is considered in the proposed PSF estimation procedure. The feasibility of the proposed algorithm is experimentally demonstrated.

• 한국통신학회논문지
• /
• 제37권6A호
• /
• pp.464-472
• /
• 2012

본 논문에서는 연속된 프레임을 갖는 영상의 프레임간 움직임 추정 기법을 응용하여 고해상도 영상을 생성하는 초해상도 기법을 제안한다. 단일 영상을 이용한 초해상도 기법의 경우 영상에서의 고주파 대역을 찾기 위해 확률 및 이산 웨이블릿 변환(discrete wavelet transform: DWT) 기반 등 다양한 방법이 제시되었으나, 연산에 사용할 수 있는 정보가 제한적이라는 문제가 존재한다. 이러한 문제를 해결하기 위해 연속된 프레임을 이용한 초해상도 기법이 다양하게 제안되었다. 연속 프레임 기반 초해상도 기법의 핵심인 입력 저해상도 영상 간 정합(registration)의 정확도는 초해상도 기법의 결과에 큰 영향을 갖는다. 본 논문에서는 영상 간 정합의 정확도를 높이기 위하여 6-tap FIR(finite impulse response) 필터를 부화소(sub-pixel) 단위의 정합에 사용한다. 실험을 통하여 제안하는 기법의 결과영상이 기존의 최단입점(nearest neighborhood), 이중선형(bi-linear), 고등차수(bi-cubic) 보간법 보다는 우수하고 DWT 기반의 초해상도 기법과는 비슷한 성능을 가진다는 것을 확인할 수 있었다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.639-642
• /
• 2005

Motion Estimation(ME) is an important part of video compression, because it requires a large amount of computation. Half-pixel and quarter-pixel motion estimation allows high video compression rates but it also has high computation complexity. In this paper we suggest a new and efficient motion estimation algorithm for half-pixel and quarter-pixel motion estimation using SAD values. In the method, an integer-pixel motion vector is found and then only three neighboring points of the integer-pixel motion vector is evaluated to find the half-pixel motion vector. The quarter-pixel motion vector is also found by using a similar method. Experimental results of our method shows 20% reduction in computation time, when compared with those of a conventional method, while producing same quality motion vectors.

• 대한전자공학회논문지SP
• /
• 제41권3호
• /
• pp.73-81
• /
• 2004

지문영상에서 신뢰할 만한 특징을 추출하기 위한 세선화 알고리즘은 전처리 과정에 있어서 매우 중요한 부분을 차지한다. 본 논문에서 제안하는 세선화 알고리즘은 2치화된 지문영상의 연결성을 파괴하지 않고, 중심선에 가장 관접한 골격선을 최소 1화소 두께로 만들 수 있는 강건한 병렬 세선화 알고리즘을 제안하는 것이다. 제안한 기법은 3개의 부반복에 의해 반복 수행되며, 첫 번째 부반복은 내부점에 의해 최외각 경계 화소만을 제거하는 것이며, 두 번째 부반복은 2화소 두께의 골격선을 찾아 한쪽 골격선만을 추출한다. 세 번째 부반복은 골격선에 여분으로 존재하는 2화소 두께의 화소를 제거한다. 따라서 제안하는 세선화 방법은 회전과 잡음에 강건하며 균형 잡힌 중심선을 만들어낸다. 세선화 알고리즘의 성능을 평가하기 위하여 이전에 발표된 알고리즘들과 비교 분석하였다.

• Journal of Multimedia Information System
• /
• 제8권4호
• /
• pp.203-210
• /
• 2021

Deep leaning convolutional neural networks (CNN) have successfully been applied to image super-resolution (SR). Despite their great performances, SR techniques tend to focus on a certain upscale factor when training a particular model. Algorithms for single model multi-scale networks can easily be constructed if images are upscaled prior to input, but sub-pixel convolution upsampling works differently for each scale factor. Recent SR methods employ multi-scale and multi-path learning as a solution. However, this causes unshared parameters and unbalanced parameter distribution across various scale factors. We present a multi-scale single-path upsample module as a solution by exploiting the advantages of sub-pixel convolution and interpolation algorithms. The proposed model employs sub-pixel convolution for the highest scale factor among the learning upscale factors, and then utilize 1-dimension interpolation, compressing the learned features on the channel axis to match the desired output image size. Experiments are performed for the single-path upsample module, and compared to the multi-path upsample module. Based on the experimental results, the proposed algorithm reduces the upsample module's parameters by 24% and presents slightly to better performance compared to the previous algorithm.

• 한국측량학회:학술대회논문집
• /
• 한국측량학회 2003년도 춘계학술발표회 논문집
• /
• pp.161-166
• /
• 2003

Hyperspectral imagery have high spectral resolution and provide the potential for more accurate and detailed information extraction than any other type of remotely sensed data. In this paper, the "Linear Spectral Unmixing" model which is one solution to overcome the limit of spatial resolution for remote sensing data was introduced and we applied the algorithm to hyperspectral image. The result was not good because of some problems such as image calibration and used endmembers. Therefore, we analyzed the cause and had a search for a solution.

• Journal of Electrical Engineering and Technology
• /
• 제11권4호
• /
• pp.1020-1026
• /
• 2016

Motion estimation (ME) algorithms supporting quarter-pixel accuracy have been recently introduced to retain detailed motion information for high quality of video in the state-of-the-art video compression standard of H.264/AVC. Conventional sub-pixel ME algorithms in the spatial domain are faced with a common problem of computational complexity because of embedded interpolation schemes. This paper proposes a low-complexity sub-pixel motion estimation algorithm in the transform domain utilizing shifting matrix. Simulations are performed to compare the performances of spatial-domain ME algorithms and transform-domain ME algorithms in terms of peak signal-to-noise ratio (PSNR) and the number of bits per frame. Simulation results confirm that the transform-domain approach not only improves the video quality and the compression efficiency, but also remarkably alleviates the computational complexity, compared to the spatial-domain approach.