• Title/Summary/Keyword: Horn and Schunck algorithm

Search Result 6, Processing Time 0.02 seconds

Optical Flow Estimation of Large Displacements from Real Sequential Images

  • Kim, Jin-Woo
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.3
    • /
    • pp.319-324
    • /
    • 2011
  • In computing the optical flow. Horn and Schunck's method which is a representative algorithm is based on differentiation. But it is difficult to estimate the velocity for a large displacement by this algorithm. To cope with this problem multigrid method has been proposed. In this paper, we have proposed a scaled multigrid algorithm which the initial flow for a level is calculated by the summation of the optimally scaled flow and error flow. The optimally scaled flow is the scaled expanded flow of the previous level, which can generate an estimated second image having the least RMS error with respect to the original second image, and the error flow is the flow between the estimated second image (generated by the optimally scaled flow) and the original second image. The flow for this level is then estimated using the original first and second images and the initial flow for that level. From among the various coarsest starting levels of the multigrid algorithm, we select the one that finally gives the best estimated flow. Better results were achieved using our proposed method compared with Horn and Schunck's method and a conventional multigrid algorithm.

Adaptive Detection of a Moving Target Undergoing Illumination Changes against a Dynamic Background

  • Lu, Mu;Gao, Yang;Zhu, Ming
    • Journal of the Optical Society of Korea
    • /
    • v.20 no.6
    • /
    • pp.745-751
    • /
    • 2016
  • A detection algorithm, based on the combined local-global (CLG) optical-flow model and Gaussian pyramid for a moving target appearing against a dynamic background, can compensate for the inadaptability of the classic Horn-Schunck algorithm to illumination changes and reduce the number of needed calculations. Incorporating the hypothesis of gradient conservation into the traditional CLG optical-flow model and combining structure and texture decomposition enable this algorithm to minimize the impact of illumination changes on optical-flow estimates. Further, calculating optical-flow with the Gaussian pyramid by layers and computing optical-flow at other points using an optical-flow iterative with higher gray-level points together reduce the number of calculations required to improve detection efficiency. Finally, this proposed method achieves the detection of a moving target against a dynamic background, according to the background motion vector determined by the displacement and magnitude of the optical-flow. Simulation results indicate that this algorithm, in comparison to the traditional Horn-Schunck optical-flow algorithm, accurately detects a moving target undergoing illumination changes against a dynamic background and simultaneously demonstrates a significant reduction in the number of computations needed to improve detection efficiency.

An Efficient Motion Estimation Method Using Hierarchical Structure (계층적 구조를 이용한 효율적인 변위 추정 방법)

  • 황신환;이상욱
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.28B no.11
    • /
    • pp.913-924
    • /
    • 1991
  • In this paper, we propose a motion estimation algorithm using hierarchical structure. The algorithm uses the image pyramids from the repetitive application of Gaussian filtering and decimation, and performs an inter-level displacement propagation in its motion estimation process. The motion estimation algorithm based on the hierarchical structure is shown to be very effective since this scheme utilizes the local imformation as well as the global imformation. The experimental results on the various data imdicate that compared to the Horn and Schunck's method, the proposed algorithm yields an accurate motion estimation with a fast convergence behaviour.

  • PDF

Corresponding Points Estimation of Motion Images by Orthogonal Function Expansion (직교 함수 전개법에 의한 동영상의 대응점 추출)

  • 김진우;김경태
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.4
    • /
    • pp.380-388
    • /
    • 2000
  • In computing the optical flow, Horn and Schunck's method which is a representative algorithm is based on differentiation. Therefore it is difficult to estimate the velocity for a large displacement by this algorithm. In this paper, we propose a method for estimating nonuniform motion from sequential images which is based on integral brightness constancy constraints. The equations which transform a source image to a target image are expressed as a function of the displacement field. If marginal effects can be neglected, the form of the transformation integral transform or orthogonal expansion can be determined from the expansion coefficients of the two images. The apparent displacement field is then computed iteratively by a projection method which utilities the functional derivatives of the linearized moment equations. We demonstrate that the performance of the orthogonal function transform on the data set of large motion.

  • PDF

Optical flow of heart images by image-flow conservation equation and functional expansion (영상유체보존식과 함수전개법에 의한 심장영상의 광류)

  • Kim, Jin-Woo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.7
    • /
    • pp.1341-1347
    • /
    • 2007
  • The displacement field (Optical flow) has been calculated by bottom-up approaches based on local processing. In contrast with them, in this paper, a top-down approach based on expanding in turn from the lowest order mode the whole motion in an image pair of sequential images is proposed. The intensity of medical images usually represents a quantity which is conserved during the motion. Hence sequential images are ideally related by a coordinate transformation. The displacement field can be determined from the generalized moments of the two images. The equations which transform arbitrary generalized moments from a source image to a target image are expressed as a function of the displacement field. The appareent displacement field is then computed iteratively by a projection method which utilizes the functional derivatives of the linearized moment equations. This method is demonstrated using a pair of sequential heart images. For comparative evaluation, we applied Horn and Schunck's method, a standard multigrid method, and our proposed algorithm to sequential image.

A Study of Detecting Fish Robot Position using the Comparing Image Data Algorithm (이미지 비교 알고리즘을 이용한 물고기 로봇 위치 탐지 연구)

  • Musunuri, Yogendra Rao;Jeon, UYeol;Shin, KyooJae
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2015.10a
    • /
    • pp.1341-1344
    • /
    • 2015
  • In this paper, the designed fish robot is researched and developed for aquarium underwater robot. This paper is a study on how the outside technology merely to find the location of fish robots without specific sensor or internal devices. This model is designed to detect the position of the Robotic Fish in the Mat lab and Simulink. This intends to recognize the shape of the tank via a video device such as a camera or camcorder using an image processing technique to identify the location of the robotic fishes. Here, we are applied the two methods, one is Hom - Schunk Method and second one is newly proposed method that is the comparing image data algorithm. The Horn - Schunck Method is used to obtain the velocity for each pixel in the image and the comparing image data algorithm is proposed to obtain the position with comparing two video frames and assumes a constant velocity in each video frame.