• Title/Summary/Keyword: Dynamic Programming

Search Result 955, Processing Time 0.041 seconds

Robust Depth Measurement Using Dynamic Programming Technique on the Structured-Light Image (구조화 조명 영상에 Dynamic Programming을 사용한 신뢰도 높은 거리 측정 방법)

  • Wang, Shi;Kim, Hyong-Suk;Lin, Chun-Shin;Chen, Hong-Xin;Lin, Hai-Ping
    • Journal of Internet Computing and Services
    • /
    • v.9 no.3
    • /
    • pp.69-77
    • /
    • 2008
  • An algorithm for tracking the trace of structured light is proposed to obtain depth information accurately. The technique is based on the fact that the pixel location of light in an image has a unique association with the object depth. However, sometimes the projected light is dim or invisible due to the absorption and reflection on the surface of the object. A dynamic programming approach is proposed to solve such a problem. In this paper, necessary mathematics for implementing the algorithm is presented and the projected laser light is tracked utilizing a dynamic programming technique. Advantage is that the trace remains integrity while many parts of the laser beam are dim or invisible. Experimental results as well as the 3-D restoration are reported.

  • PDF

An Efficient Job Scheduling Strategy for Computational Grid (계산 그리드를 위한 효율적인 작업 스케줄링 정책)

  • Jo, Ji-Hun;Lee, Won-Joo;Jeon, Chang-Ho
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.8
    • /
    • pp.753-757
    • /
    • 2008
  • In this paper, we propose a new scheduling strategy for dynamic programming in Grid environment. The key idea of this scheme is to reduce the execution time of a job by dividing the dynamic table based on the locality of table and allocating jobs to nodes which minimize network latency. This scheme obtains optimal concurrency by constructing the dynamic table using a distributed top down method. Through simulation, we show that the proposed Grid strategy improves the performance of Grid environment compared to previous branch-bound strategies.

Stereo Matching using Dynamic Programming in Scale-Space (스케일 공간에서 동적 계획을 이용한 스테레오 정합)

  • 최우영;박래홍
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.8
    • /
    • pp.44-53
    • /
    • 1992
  • In this paper, a matching method is proposed to improve the correct matching rate in stereo correspondence matching in which the fingerprint of zero-crossing points on the scale-space is used as the robust matching feature. The dynamic programming, which is appropriate for the fingerprint feature, is introduced for correspondence matching. We also improve the matching rate by using the post-processing for correcting mismatched points. In simulation, we apply the proposed algorithm to the synthetic and real images and obtain good matching results.

  • PDF

Minimization of Cell-based Handoff Delays to Balance the Load in Fiber Optic Micro-cellular Systems (광마이크로셀 이동통신 시스템의 균등부하를 위한 셀단위 핸드오프 순서결정)

  • 이채영;장세헌
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.26 no.2
    • /
    • pp.1-11
    • /
    • 2001
  • This paper considers the scheduling of cell-based handoffs to balance the traffic in a fiber-optic microcelluar system. In the system depending on the order of cell based handoff, periodical balancing of the traffic among microcells can be achieved. The cell based handoff problem is formulated as a dynamic programming and the computational complexity is analyzed. Since the scheduling problem requires real time solution, heuristic algorithms are proposed and the computational results are discussed.

  • PDF

A Multiobjective Dynamic Programming Model for Sequenetial Testing Strategy Selection (축차검사전략의 선정을 위한 다목적. 동적계획 모형)

  • 최병돈
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.18 no.1
    • /
    • pp.55-69
    • /
    • 1993
  • The tests in a battery can be performed in different sequences, and different sequential testing strategies will have exactly the same overall performances for that battery, but at different expected total costs and expected time consumptions. By using a multiobjective dynamic programming model, we are able to find all noninferior testing strategies for a given battery of tests and a stopping rule.

  • PDF

Impulse Noise Cancelling of Signals Using a Dynamic Programming Algorithm (동적 프로그래밍 알고리즘에 의한 신호의 임펄스 잡음제거)

  • Shin, Hyun-Ik;Lee, Kuhn-Il
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1587-1590
    • /
    • 1987
  • A non-linear filtering for the noise cancelling of signals degraded by random impulsive noise is proposed. The non-linear algorithm is based on a criterion for the overall smoothness of the signal. The smoothness criterion is optimized by a dynamic programming strategy. It performs considerably better than a LDNF(low-distortion nonlinear filter), although being comparable in computing time.

  • PDF

Global Path Planning Algorithm Using a Skeleton Map and Dynamic Programming (골격지도와 동적 계획법을 이용한 전역경로계획 알고리즘)

  • Yang, Dong-Hoon;Hong, Suk-Kyo
    • Proceedings of the KIEE Conference
    • /
    • 2005.07d
    • /
    • pp.2790-2792
    • /
    • 2005
  • This paper proposes a path-planning algorithm that enables a robot to reach the goal position while avoiding obstacles. The proposed method, which is based on dynamic programming, finds an optimum path to follow using a modified skeleton map method which exploits information on obstacle positions. Simulation results show the feasibility of the proposed method.

  • PDF

Optimum Redundant Design by Dynamic Programming (동적계획을 이용한 최적신뢰도 설계)

  • Park Tae-Hoon
    • Journal of the military operations research society of Korea
    • /
    • v.5 no.2
    • /
    • pp.73-80
    • /
    • 1979
  • In military applications of equipment, it is of the utmost importance that the equipment operates without breakdown for a specified length of time. We can increase the reliability of a system by adding redundant components to the basic nonredundant system. This study introduces a dynamic programming algorithm of finding optimum redundant design that maximizes the system reliability with constraints.

  • PDF

고속정보 전파특성을 갖는 실시간 비터비 디코더

  • Kim, Jong-Man;Sin, Dong-Yong;Seo, Beom-Su
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2010.03b
    • /
    • pp.3-3
    • /
    • 2010
  • The Characteristics of Digital Vterbi Decoder utilizing the analog parallel processing circuit technology is proposed. The Analog parallel structure of the viterbi decoder acted by a replacement of the conventional digital viterbi Decoder is progressing fastly. The proposed circuits design han, low distortion, high accuracy over the previous implementation and dynamic programming.

  • PDF

A study on the 3-stage 3-dimensional guillotine cutting-stock problem (3차원 기로틴 3단계 자재절단 방법에 관한 연구)

  • 김상열;박순달
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.04a
    • /
    • pp.276-279
    • /
    • 1996
  • This paper deals with the method providing an exact solution to the 3-dimensional guillotine cutting stock problem. We suggest a 3-stage sutting method using the property that cubic material has to be cut into 2-dimensional planes firstly. This method requires more stocks that the general guillotine cutting methods but can save work force. By using the 1-dimensional dynamic programming, we reduce the computational time and the memory requirement in the 3-stage guillotine cutting method.

  • PDF