• Title/Summary/Keyword: Compensated algorithm

Search Result 421, Processing Time 0.024 seconds

Interpolation Error Concealment Method of Motion Compensated Interpolated Frame for Motion Compensated Frame Rate Conversion (움직임 보상 프레임 율 변환 기법을 위한 움직임 보상 보간 프레임의 보간 오류 은닉 기법)

  • Lee, Jeong-Hun;Han, Dong-Il
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.927-928
    • /
    • 2008
  • In this paper, a interpolation error concealment algorithm of motion compensated interpolated frame for motion compensated frame rate conversion to reduce the block artifacts caused by failure of conventional motion estimation based on block matching algorithm is proposed. Experimental results show good performance of the proposed scheme with significant reduction of the block artifacts.

  • PDF

Motion Compensated Subband Video Coding with Arbitrarily Shaped Region Adaptivity

  • Kwon, Oh-Jin;Choi, Seok-Rim
    • ETRI Journal
    • /
    • v.23 no.4
    • /
    • pp.190-198
    • /
    • 2001
  • The performance of Motion Compensated Discrete Cosine Transform (MC-DCT) video coding is improved by using the region adaptive subband image coding [18]. On the assumption that the video is acquired from the camera on a moving platform and the distance between the camera and the scene is large enough, both the motion of camera and the motion of moving objects in a frame are compensated. For the compensation of camera motion, a feature matching algorithm is employed. Several feature points extracted using a Sobel operator are used to compensate the camera motion of translation, rotation, and zoom. The illumination change between frames is also compensated. Motion compensated frame differences are divided into three regions called stationary background, moving objects, and newly emerging areas each of which is arbitrarily shaped. Different quantizers are used for different regions. Compared to the conventional MC-DCT video coding using block matching algorithm, our video coding scheme shows about 1.0-dB improvements on average for the experimental video samples.

  • PDF

Frequency-Domain Adaptive Noise Canceller and Its Algorithm with Adaptive Compensator (적응보상기를 채용한 주파수영역 적응 잡음제거 시스템 및 알고리즘)

  • 손경식;김수중
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.9
    • /
    • pp.1456-1467
    • /
    • 1990
  • The time domain adaptive noise canceller (time domain ANC) with the adaptive compensator and its algorithm, so called compensated least mean squares(CLMS) algorithm, had been introduced to improve the performance of ANC[1]. In this paper the time domain ANC with the adaptive compensator is transformed into the frequency domain ANC with the adaptive ocmpensator. An compensated frequency-domain least mean squares(CFLMS) algorithm that can adapt the proposed frequency domain ANC is presented.

  • PDF

Motion Compensated Deinterlacing with Variable Block Sizes

  • Kim, In-Ho;Lee, Chul-Hee
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.469-472
    • /
    • 2005
  • In this paper, we propose a new deinterlacing algorithm based on motion estimation and compensation with variable block size. Motion compensated methods using a fixed block size tend to produce undesirable artifacts when there exist complicated motion and high frequency components. In the proposed algorithm, the initial block size of motion estimation is determined based on the existence of global motion. Then, the block is divided depending on block characteristics. Since motion compensated deinterlacing may not always provide satisfactory results, the proposed method also use an intrafield spatial deinterlacing. Experimental results show that the proposed method provides noticeable improvements compared to motion compensated deinterlacing with a fixed block size.

  • PDF

Motion Estimation Using the Relation Between Rate and Distortion (부호화율과 일그러짐의 관계를 이용하는 움직임 추정)

  • 양경호;김태정;이충웅
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.8
    • /
    • pp.66-73
    • /
    • 1992
  • This paper proposes a new motion estimation algorithm which takes into account the rate-distortion relation in encoding motion compensated error images. The proposed algorithm is based on a new block-matching criterion which is the function of not only the mean squared block-matching error but also the code length for the entropy coded motion vector. The proposed algorithm optimizes the trade-off between the bit rate for motion compensated error images and the bit rate for the motion vectors. Simulation results show that in the motion compensated image coding the proposed motion estimator improves the overall performance by 0.5 dB when compared to the motion estimator which uses MSE only.

  • PDF

Development of an Obstacle Avoidance Algorithm for a Network-based Autonomous Mobile Robot (네트워크 기반 자율이동로봇을 위한 장애물 회피 알고리즘 개발)

  • Kim Hongryeol;Kim Dae Won;Kim Hong-Seok;Sohn SooKyung
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.54 no.5
    • /
    • pp.291-299
    • /
    • 2005
  • An obstacle avoidance algorithm for a network-based autonomous mobile robot is proposed in this paper. The obstacle avoidance algorithm is based on the VFH(Vector Field Histogram) algorithm and two delay compensation methods with the VFH algorithm are proposed for a network-based robot with distributed environmental sensors, mobile actuators, and the VFH controller. Firstly, the environmental sensor information is compensated by prospection with acquired environmental sensor information, measured network delays, and the kinematic model of the robot. The compensated environmental sensor information is used for building polar histogram with the VFH algorithm. Secondly, a sensor fusion algorithm for localization of the robot is proposed to compensate the delay of odometry sensor information and the delay of environmental sensor information. Through some simulation tests, the performance enhancement of the proposed algorithm in the viewpoint of efficient path generation and accurate goal positioning is shown here.

Effects of Motion Estimation Accuracy on the Motion compensated Coding (움직임 추정 정확도가 움직임 보상 부호화에 미치는 영향)

  • 김린철;이상욱;김재균
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.25 no.3
    • /
    • pp.327-334
    • /
    • 1988
  • In this paper, the performance of PRA (pel recurdive algorithm) and BMA(block matching algorithm), which are the most well-known motion estimation techniques, is compared and the effects of the motion estimation accuracy on the motion compensated coding are described. Results of computer simulation on the real images indicate that the TSS (three step search), which is one of the BMA,is slightly better than the PRA in terms of the accuracy however, the required bit rate is 6.6-8.2 Kbps higher that of the PRA because the TSS requires a transmission of motion estimation vectors.

  • PDF

A Calibration Technique for a Two-Axis Magnetic Compass in Telematics Devices

  • Cho, Seong-Yun;Park, Chan-Gook
    • ETRI Journal
    • /
    • v.27 no.3
    • /
    • pp.280-288
    • /
    • 2005
  • This paper presents an efficient algorithm for using the two-axis magnetic compass in portable devices. The general magnetic compass module consists of a three-axis magnetic compass and a two-axis inclinometer to calculate tilt-compensated azimuth information. In this paper, the tilt error is compensated using just a two-axis magnetic compass and two-axis accelerometer. The third-axis data of the magnetic compass is estimated using coordinate information that includes the extended dip angle and tilt information. The extended dip angle is estimated during the normalization process. This algorithm can be used to provide the tilt-compensated heading information to small portable devices such as navigation systems, PDAs, cell phones, and so on.

  • PDF

정형가곡을 위한 공구경로 보상 : 윤곽가공을 중심으로

  • 서석환;조정훈
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1992.10a
    • /
    • pp.34-38
    • /
    • 1992
  • Geometry based CAD/CAM system is hard to achieve "net shape machining" For a net shape machining, the machining errors should be compensated by off-line CAD/CAM system followed by on-line control system. In this paper, we investigate an off-line compensation scheme for the machining errors due to tool deflection in contouring operation. The significance of the deflection errors is first shown, and a compensation is sought via modifying the nominal tool path. In modification, tool deflection amount is iteratively compensated until the deflection amount is iteratively compensated until the deflected path results in the desired contour within a tolerance. The path modification algorithm has been tested via computer simulation. The developed algorithm can be used as a postprocessor for the current CAD/CAM system based on geometric modeling as a means for enhancing the machining accuracy.

A New Motion Compensated Frame Interpolation Algorithm Using Adaptive Motion Estimation (적응적 움직임 추정 기법을 활용하는 새로운 움직임 보상 프레임 보간 알고리즘)

  • Hwang, Inseo;Jung, Ho Sun;Sunwoo, Myung Hoon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.6
    • /
    • pp.62-69
    • /
    • 2015
  • In this paper, a new frame rate up conversion (FRUC) algorithm using adaptive motion estimation (AME-FRUC) is proposed. The proposed algorithm performs extended bilateral motion estimation (EBME) conducts motion estimation (ME) processes on the static region, and extract region of interest with the motion vector (MV). In the region of interest block, the proposed AME-FRUC uses the texture block partitioning scheme and the unilateral motion estimation for improving ME accuracy. Finally, motion compensated frame interpolation (MCFI) are adopted to interpolate the intermediate frame in which MCFI is employed adaptively based on ME scheme. Experimental results show that the proposed algorithm improves the PSNR up to 3dB, the SSIM up to 0.07 and 68% lower SAD calculations compared to the EBME and the conventional FRUC algorithms.