• Title/Summary/Keyword: Sub-pixel estimation

Search Result 52, Processing Time 0.022 seconds

Adaptive Hierarchical Hexagon Search Using Spatio-temporal Motion Activity (시공간 움직임 활동도를 이용한 적응형 계층 육각 탐색)

  • Kwak, No-Yoon
    • Journal of Digital Contents Society
    • /
    • v.8 no.4
    • /
    • pp.441-449
    • /
    • 2007
  • In video coding, motion estimation is a process to estimate the pixel of the current frame from the reference frame, which affects directly the predictive quality and the encoding time. This paper is related to AHHS(Adaptive Hierarchical Hexagon Search) using spatio-temporal motion activity for fast motion estimation. The proposed method defines the spatio-temporal motion activity of the current macroblock using the motion vectors of its spatio-temporally adjacent macroblocks, and then conventional AHS(Adaptive Hexagon Search) is performed if the spatio-temporal motion activity is lower, otherwise, hierarchical hexagon search is performed on a multi-layered hierarchical space constructed by multiple sub-images with low frequency in wavelet transform. In the paper, based on computer simulation results for multiple video sequences with different motion characteristics, the performance of the proposed method was analysed and assessed in terms of the predictive quality and the computational time. Experimental results indicate that the proposed method is both suitable for (quasi-) stationary and large motion searches. The proposed method could keep the merit of the adaptive hexagon search capable of fast estimating motion vectors and also adaptively reduce the local minima occurred in the video sequences with higher spatio-temporal motion activity.

  • PDF

A Fast Sub-pixel Motion Estimation Algorithm Using Motion Characteristics of Variable Block Sizes (가변블록에서의 움직임 특성을 이용한 부화소 단위 고속 움직임 예측 방법)

  • Kim, Dae-Gon;Kim, Song-Ju;Yoo, Cheol-Jung;Chang, Ok-Bae
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06d
    • /
    • pp.560-565
    • /
    • 2007
  • 본 논문에서는 H.264 동영상 표준의 가변 움직임 블록을 위한 고속 움직임 예측 기법을 제안한다. 움직임 예측은 H.264의 비디오 코딩 과정에서 가장 많은 연산량을 차지하는 중요한 처리과정이다. 움직임 예측과정에서 정수배 화소 단위에서의 탐색에 비하여, 부화소 단위까지의 움직임 추정은 실제 움직임 벡터를 찾아낼 수 있지만, 이를 구하기 위한 계산량이 늘어나는 문제가 있다. 본 논문에서는 기준점을 기준으로 기준점으로부터 $\pm1$ 화소 내에서 두 번째로 작은 오차 값이 있는 특성 및 부화소 단위의 화소 보간 특성을 이용하여 움직임 추정 과정에서 탐색점을 줄임으로써 연산 처리 속도를 증가시키고, 계산의 복잡도를 줄이는 알고리즘을 제안하였다. 제안한 방법에서는 정수 화소 단위에서의 가장 작은 SATD를 갖는 점과 참조 영상으로부터 추출한 PMV를 비교하여 기준점을 정한 후, 기준점 주위의 8개의 화소 위치 가운데 두 번째로 SATD값이 작은 점을 찾아 해당 방향으로 1/2 화소 단위의 움직임 추정을 수행하였고, 1/4 화소 단위에서도 1/2 화소단위에서 두 번째로 SATD가 작은 점 방향으로 움직임 추정을 실행하였다. 그 결과 기존의 JM에서 사용한 고속 움직임 예측 알고리즘에 비해 PSNR값에 큰 변화가 없고, 움직임 벡터 예측 시간 면에서 약 18%의 시간을 줄이는 결과를 보였다.

  • PDF

Automatic assessment of post-earthquake buildings based on multi-task deep learning with auxiliary tasks

  • Zhihang Li;Huamei Zhu;Mengqi Huang;Pengxuan Ji;Hongyu Huang;Qianbing Zhang
    • Smart Structures and Systems
    • /
    • v.31 no.4
    • /
    • pp.383-392
    • /
    • 2023
  • Post-earthquake building condition assessment is crucial for subsequent rescue and remediation and can be automated by emerging computer vision and deep learning technologies. This study is based on an endeavour for the 2nd International Competition of Structural Health Monitoring (IC-SHM 2021). The task package includes five image segmentation objectives - defects (crack/spall/rebar exposure), structural component, and damage state. The structural component and damage state tasks are identified as the priority that can form actionable decisions. A multi-task Convolutional Neural Network (CNN) is proposed to conduct the two major tasks simultaneously. The rest 3 sub-tasks (spall/crack/rebar exposure) were incorporated as auxiliary tasks. By synchronously learning defect information (spall/crack/rebar exposure), the multi-task CNN model outperforms the counterpart single-task models in recognizing structural components and estimating damage states. Particularly, the pixel-level damage state estimation witnesses a mIoU (mean intersection over union) improvement from 0.5855 to 0.6374. For the defect detection tasks, rebar exposure is omitted due to the extremely biased sample distribution. The segmentations of crack and spall are automated by single-task U-Net but with extra efforts to resample the provided data. The segmentation of small objects (spall and crack) benefits from the resampling method, with a substantial IoU increment of nearly 10%.

Hough Transform Based Projecton Method for Target Tracking in Image Suquences (투사 및 허프 변환 방식에 의한 연속 영상상의 비행체 궤적 추적)

  • 최재호;곽훈성
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.11
    • /
    • pp.2094-2105
    • /
    • 1994
  • This paper contains a Hough transform based projection method derived from Radon transform for tracking dim unresolved(sub-pixel) moving targets that move along straight line parths across a time sequential image data. In contrast to several recently presented Hough transform methods using a compressed image referred to as the track map our proposed technique utilizing a set of projections taken along arbitrary orientations effectively increases the changes of target detection, and creates a robust track estimation environment by incorporating all the available knowledge obtained from the projections. Moreover, in order to quantitatively assess the estimation capability of the projection-based Hough transform algorithm, the analytical bounds on the Hough space parameter errors introduced by image space noise contamination are derived. The simulation yielded promising results of estimating the track parameters even under low signal to noise rations when our technique was tested against the time sequential sets of real infrared image data referred to as the HiCamps.

  • PDF

Evaluating MRV Potentials based on Satellite Image in UN-REDD Opportunity Cost Estimation: A Case Study for Mt. Geum-gang of North Korea (UN-REDD 기회비용 산정에서 위성영상 기반의 MRV 여건평가: 금강산을 사례로)

  • Joo, Seung-Min;Um, Jung-Sup
    • Spatial Information Research
    • /
    • v.22 no.3
    • /
    • pp.47-58
    • /
    • 2014
  • The credible measurement, reporting and verification (MRV) is among the most critical elements in UN-REDD (United Nations programme on Reducing Emissions from Deforestation and forest Degradation in Developing Countries). This study is intended to explore MRV potential in terms of UN-REDD opportunity cost estimation using satellite image for Mt. Geum-gang of North Korea. A visual interpretation were conducted to evaluate MRV conditions by sub-dividing or decomposing the images with different pixel size into a three types of hierarchical tree structure that helps dealing with spatial variability within each subarea. The permanent record of standard satellite remote sensing system demonstrated its capability of presenting area-wide visual evidences of MRV conditions in Mt. Geum-gang (such as the identification of forested area, degradation trends for forest space, three types of hierarchical land-cover and land use tree structure, carbon density in the landscape). Satellite data could be accepted as legally binding proof when it comes to REDD opportunity cost estimation since several cases exist where remote sensing has been used as legal evidence in ICJ (International Court of Justice) and UN resolution. It doesn't seem very difficult to comply with MRV requirements for UN-REDD opportunity cost calculation due to the probative value of satellite data. It is anticipated that this research output could be used as a valuable reference for Korea-based enterprises exploring REDD project sites and the carbon traders to ensure MRV potentials using satellite image in UN-REDD Opportunity Cost estimation.

A Frequency Domain DV-to-MPEG-2 Transcoding (DV에서 MPEG-2로의 주파수 영역 변환 부호화)

  • Kim, Do-Nyeon;Yun, Beom-Sik;Choe, Yun-Sik
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.2
    • /
    • pp.138-148
    • /
    • 2001
  • Digital Video (DV) coding standards for digital video cassette recorder are based mainly on DCT and variable length coding. DV has low hardware complexity but high compressed bit rate of about 26 Mb/s. Thus, it is necessary to encode video with low complex video coding at the studios and then transcode compressed video into MPEG-2 for video-on-demand system. Because these coding methods exploit DCT, transcoding in the DCT domain can reduce computational complexity by excluding duplicated procedures. In transcoding DV into MPEC-2 intra coding, multiplying matrix by transformed data is used for 4:1:1-to-4:2:2 chroma format conversion and the conversion from 2-4-8 to 8-8 DCT mode, and therefore enables parallel processing. Variance of sub block for MPEG-2 rate control is computed completely in the DCT domain. These are verified through experiments. We estimate motion hierarchically using DCT coefficients for transcoding into MPEG-2 inter coding. First, we estimate motion of a macro block (MB) only with 4 DC values of 4 sub blocks and then estimate motion with 16-point MB using IDCT of 2$\times$2 low frequencies in each sub block, and finish estimation at a sub pixel as the fifth step. ME with overlapped search range shows better PSNR performance than ME without overlapping.

  • PDF

Robust Semi-auto Calibration Method for Various Cameras and Illumination Changes (다양한 카메라와 조명의 변화에 강건한 반자동 카메라 캘리브레이션 방법)

  • Shin, Dong-Won;Ho, Yo-Sung
    • Journal of Broadcast Engineering
    • /
    • v.21 no.1
    • /
    • pp.36-42
    • /
    • 2016
  • Recently, many 3D contents have been produced through the multiview camera system. In this system, since a difference of the viewpoint between color and depth cameras is inevitable, the camera parameter plays the important role to adjust the viewpoint as a preprocessing step. The conventional camera calibration method is inconvenient to users since we need to choose pattern features manually after capturing a planar chessboard with various poses. Therefore, we propose a semi-auto camera calibration method using a circular sampling and an homography estimation. Firstly, The proposed method extracts the candidates of the pattern features from the images by FAST corner detector. Next, we reduce the amount of the candidates by the circular sampling and obtain the complete point cloud by the homography estimation. Lastly, we compute the accurate position having the sub-pixel accuracy of the pattern features by the approximation of the hyper parabola surface. We investigated which factor affects the result of the pattern feature detection at each step. Compared to the conventional method, we found the proposed method released the inconvenience of the manual operation but maintained the accuracy of the camera parameters.

An Efficient Vehicle Image Compensation Algorithm based on Histogram Equalization (히스토그램 균등화 기반의 효율적인 차량용 영상 보정 알고리즘)

  • Hong, Sung-Il;Lin, Chi-Ho
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.3
    • /
    • pp.2192-2200
    • /
    • 2015
  • In this paper, we propose an efficient vehicle image compensation algorithm based on Histogram Equalization. The proposed a vehicle image compensation algorithm was elimination to the vehicle image shake using motion compensation and motion estimation. And, algorithm was calculated the histogram of pixel values from each sub-image by dividing the image as the constant size areas in order to image enhancement. Also, it had enhancement to the image by adjusting the gradient. The proposed algorithm was evaluate the difference between of performance and time, image by applied to the IP, and were confirmed the image enhancement with removing of vehicle camera image shake. In this paper, the proposed vehicle image enhancement algorithm was demonstrated effectiveness when compared to existing vehicle image stabilization, because the elimination of shake for the vehicle images used real-time processing without using a memory. And it was obtained the reduction effect of the computation time by the calculated through block matching, and obtained the better restoration result for naturalness of the image with the lowest noise.

A Comparison of Systematic Sampling Designs for Forest Inventory

  • Yim, Jong Su;Kleinn, Christoph;Kim, Sung Ho;Jeong, Jin-Hyun;Shin, Man Yong
    • Journal of Korean Society of Forest Science
    • /
    • v.98 no.2
    • /
    • pp.133-141
    • /
    • 2009
  • This study was conducted to support for determining an efficient sampling design for forest resources assessments in South Korea with respect to statistical efficiency. For this objective, different systematic sampling designs were simulated and compared based on an artificial forest population that had been built from field sample data and satellite data in Yang-Pyeong County, Korea. Using the k-NN technique, two thematic maps (growing stock and forest cover type per pixel unit) across the test area were generated; field data (n=191) and Landsat ETM+ were used as source data. Four sampling designs (systematic sampling, systematic sampling for post-stratification, systematic cluster sampling, and stratified systematic sampling) were employed as optimum sampling design candidates. In order to compute error variance, the Monte Carlo simulation was used (k=1,000). Then, sampling error and relative efficiency were compared. When the objective of an inventory was to obtain estimations for the entire population, systematic cluster sampling was superior to the other sampling designs. If its objective is to obtain estimations for each sub-population, post-stratification gave a better estimation. In order to successfully perform this procedure, it requires clear definitions of strata of interest per field observation unit for efficient stratification.

Hybrid Super-Resolution Algorithm Robust to Cut-Change (컷 전환에 적응적인 혼합형 초고해상도 기법)

  • Kwon, Soon-Chan;Lim, Jong-Myeong;Yoo, Jisang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.7
    • /
    • pp.1672-1686
    • /
    • 2013
  • In this paper, we propose a hybrid super-resolution algorithm robust to cut-change. Existing single-frame based super-resolution algorithms are usually fast, but quantity of information for interpolation is limited. Although the existing multi-frame based super-resolution algorithms generally robust to this problem, the performance of algorithm strongly depends on motions of input video. Furthemore at boundary of cut, applying of the algorithm is limited. In the proposed method, we detect a define boundary of cut using cut-detection algorithm. Then we adaptively apply a single-frame based super-resolution method to detected cut. Additionally, we propose algorithms of normalizing motion vector and analyzing pattern of edge to solve various problems of existing super-resolution algorithms. The experimental results show that the proposed algorithm has better performance than other conventional interpolation methods.