• Title/Summary/Keyword: Bilinear interpolation method

Search Result 81, Processing Time 0.021 seconds

Low-power VLSI Architecture Design for Image Scaler and Coefficients Optimization (영상 스케일러의 저전력 VLSI 구조 설계 및 계수 최적화)

  • Han, Jae-Young;Lee, Seong-Won
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.47 no.6
    • /
    • pp.22-34
    • /
    • 2010
  • Existing image scalers generally adopt simple interpolation methods such as bilinear method to take cost-benefit, or highly complex architectures to achieve high quality resulting images. However, demands for a low power, low cost, and high performance image scaler become more important because of emerging high quality mobile contents. In this paper we propose the novel low power hardware architecture for a high quality raster scan image scaler. The proposed scaler architecture enhances the existing cubic interpolation look-up table architecture by reducing and optimizing memory access and hardware components. The input data buffer of existing image scaler is replaced with line memories to reduce the number of memory access that is critical to power consumption. The cubic interpolation formula used in existing look-up table architecture is also rearranged to reduce the number of the multipliers and look-up table size. Finally we analyze the optimized parameter sets of look-up table, which is a trade-off between quality of result image and hardware size.

Elevation Restoration of Natural Terrains Using the Fractal Technique (프랙탈 기법을 이용한 자연지형의 고도 복원)

  • Jin, Gang-Gyoo;Kim, Hyun-Jun
    • Journal of Navigation and Port Research
    • /
    • v.35 no.1
    • /
    • pp.51-56
    • /
    • 2011
  • In this paper, we presents an algorithm which restores lost data or increases resolution of a DTM(Digital terrain model) using fractal theory. Terrain information(fractal dimension and standard deviation) around the patch to be restored is extracted and then with this information and original data, the elevations of cells are interpolated using the random midpoint displacement method. The results of the proposed algorithm are compared with those of the bilinear and bicubic methods on a fractal terrain map.

Hierarchical Motion Estimation Method for MASF (MASF 적용을 위한 계층적 움직임 추정 기법)

  • 김상연;김성대
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1995.06a
    • /
    • pp.137-141
    • /
    • 1995
  • MASF is a kind of temporal filter proposed for noise reduction and temporal band limitation. MASF uses motion vectors to extract temporal information in spatial domain. Therefore, inaccurate motion information causes some distortions in MASF operation. Currently, bilinear interpolation after MBA(Block Matching Algorithm) is used for the motion estimation sheme of MASF. But, this method results in unreliable estimation when the object in image sequence has larger movement than the maximum displacement assumed in BMA or the input images are severely corrupted with noise. In order to solve this problem, we propose a hierarchical motion estimation algorithm for MASF. Experimental results show that the proposed method produces reliable output under large motion and noisy situations.

Estimation of Rotation Center and Rotation Angle for Real-time Image Stabilization of Roll Axis. (실시간 회전영상 안정화를 위한 회전중심 및 회전각도 추정 방법)

  • Cho, Jae-Soo;Kim, Do-Jong
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.153-155
    • /
    • 2004
  • This paper proposes a real-time approach on the rotational motion estimation and correction for the roll stabilization of the sight system. This method first estimates a rotation center by the least-mean square algorithm based on the motion vectors of some feature points. And, then, a rotation angle is searched for a best matching block between a reference block image and seccessive input images using MPC(maximum pixel count) matching criterion. Finally, motion correction is performed by the bilinear interpolation technique. Various computer simulations show that the estimation performance is good and the proposed algorithm is a real-time implementable one to the TMS320C6415(500MHz) DSP.

  • PDF

Joint Demosaicing and Super-resolution of Color Filter Array Image based on Deep Image Prior Network

  • Kurniawan, Edwin;Lee, Suk-Ho
    • International journal of advanced smart convergence
    • /
    • v.11 no.2
    • /
    • pp.13-21
    • /
    • 2022
  • In this paper, we propose a learning based joint demosaicing and super-resolution framework which uses only the mosaiced color filter array(CFA) image as the input. As the proposed method works only on the mosaicied CFA image itself, there is no need for a large dataset. Based on our framework, we proposed two different structures, where the first structure uses one deep image prior network, while the second uses two. Experimental results show that even though we use only the CFA image as the training image, the proposed method can result in better visual quality than other bilinear interpolation combined demosaicing methods, and therefore, opens up a new research area for joint demosaicing and super-resolution on raw images.

Research for Bit-depth Conversion Development by Detection Lost Information to Resizing Process for Digital Photography (디지털 사진영상의 크기조절과정에서 유실되는 정보를 이용한 비트심도의 확장)

  • Cho, Do-Hee;Maik, Vivek;Paik, Joon-Ki;Har, Dong-Hwan
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.4
    • /
    • pp.189-197
    • /
    • 2009
  • A digital image usually has 8 bits of depth basically representing pixel intensity ranging for [0 255]. These pixel range allow 256 step levels of pixel values in the image. Thus the greyscale value for a given image is an integer. When we carry out interpolation of a given image for resizing we have to round the interpolated value to integer which can result in loss of quality on perceived color values. This paper proposes a new method for recovering this loss of information during interpolation process. By using the proposed method the pixels tend to regain more original values which yields better looking images on resizing.

View Morphing for Generation of In-between Scenes from Un-calibrated Images (비보정 (un-calibrated) 영상으로부터 중간영상 생성을 위한 뷰 몰핑)

  • Song Jin-Young;Hwang Yong-Ho;Hong Hyun-Ki
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.1
    • /
    • pp.1-8
    • /
    • 2005
  • Image morphing to generate 2D transitions between images may be difficult even to express simple 3D transformations. In addition, previous view morphing method requires control points for postwarping, and is much affected by self- occlusion. This paper presents a new morphing algorithm that can generate automatically in-between scenes from un-calibrated images. Our algorithm rectifies input images based on the fundamental matrix, which is followed by linear interpolation with bilinear disparity map. In final, we generate in-between views by inverse mapping of homography between the rectified images. The proposed method nay be applied to photographs and drawings, because neither knowledge of 3D shape nor camera calibration, which is complex process generally, is required. The generated in-between views can be used in various application areas such as simulation system of virtual environment and image communication.

An effective quality improvement scheme of magnified image using the surface characteristics in image (영상의 곡면 특성을 활용한 효과적인 확대영상의 화질 향상 기법)

  • Jung, Soo-Mok;On, Byung-Won
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.8
    • /
    • pp.45-54
    • /
    • 2014
  • In this paper, we proposed an effective quality improvement scheme of magnified image using the surface characteristics in image. If the surface in image is estimated as simple convex surface or simple concave surface, the interpolated value can be calculated to have the surface characteristics by using the other method in the proposed scheme. The calculated value becomes the interpolated pixel value inmagnified image. So, themagnified image reflects the surface characteristics of the real image. If the surface is not estimated as simple convex surface or simple concave surface, the interpolated value is calculated more accurately than bilinear interpolation by using the method of the proposed scheme. The PSNR values of the magnified images using the proposed schemes are greater than those of the magnified images using the previous interpolation schemes.

A Hardware Design for Realtime Correction of a Barrel Distortion Using the Nearest Pixels on a Corrected Image (보정 이미지의 최 근접 좌표를 이용한 실시간 방사 왜곡 보정 하드웨어 설계)

  • Song, Namhun;Yi, Joonhwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.12
    • /
    • pp.49-60
    • /
    • 2012
  • In this paper, we propose a hardware design for correction of barrel distortion using the nearest coordinates in the corrected image. Because it applies the nearest distance on corrected image rather than adjacent distance on distorted image, the picture quality is improved by the image whole area, solve the staircase phenomenon in the exterior area. But, because of additional arithmetic operation using design of bilinear interpolation, required arithmetic operation is increased. Look up table(LUT) structure is proposed in order to solve this, coordinate rotation digital computer(CORDIC) algorithm is applied. The results of the synthesis using Design compiler, the design of implementing all processes of the interpolation method with the hardware is higher than the previous design about the throughput, In case of the rear camera, the design of using LUT and hardware together can reduce the size than the design of implementing all processes with the hardware.

Motion Estimation using Hierarchical Triangular Mesh and Fast Node Convergence (계층적 삼각형 메쉬를 이용한 움직임 추정과 노드의 수렴 고속화)

  • 이동규;이두수
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.17 no.2
    • /
    • pp.88-94
    • /
    • 2003
  • In this paper, we propose a hierarchical triangular mesh generation method based on the motion information and a fast rude convergence method. From the variance of Image difference we decide the region that subdivision is required and perform the adequate triangulation method that is possible to yield a successive hierarchical triangulation. For fast node convergence, in initial search, we use the refinement method that separate the backgroung and object region and maintain the mesh connection by using the bilinear interpolation. The simulation result demonstrate that proposed triangulation method have performance in PSNR than the conventional BMA or order mesh based method and refinement is appropriate for the case of the mesh size is small.