• Title/Summary/Keyword: Image Decimation

Search Result 21, Processing Time 0.034 seconds

3D data Compression by Modulating Function Based Decimation (변조함수를 이용한 decimation기법에 의한 3D 데이터 압축)

  • Yang, Hun-Gi;Lee, Seung-Hyeon;Gang, Bong-Sun
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.37 no.5
    • /
    • pp.16-22
    • /
    • 2000
  • This paper presents a compression algorithm applicable for transmitting a HPO hologram data. The proposed algorithm exploits a modulating function to compress the bandwidth of the hologram pattern, resulting in decimation due to relaxed Nyquist sampling constraints. At the receiver, the compressed data will be interpolated and compensated via being divided by the modulating function. We also present compression rate and analyze the resolution of a reconstructed image and the periodicity of harmonic interferences. Finally, we shows the validity of the proposed algorithm by simulation where a reconstructed image from undersampled data is compared with a reconstructed image obtained through decimatioin by modulating function, interpolation and compensation.

  • PDF

A Method for Estimating Local Intelligibility for Adaptive Digital Image Decimation (적응형 디지털 영상 축소를 위한 국부 가해성 추정 기법)

  • 곽노윤
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.4 no.4
    • /
    • pp.391-397
    • /
    • 2003
  • This paper is about the digital image decimation algorithm which generates a value of decimated element by an average of a target pixel value and a value of neighbor intelligible element to adaptively reflect the merits of ZOD method and FOD method on the decimated image. First, a target pixel located at the center of sliding window is selected, then the gradient amplitudes of its right neighbor pixel and its lower neighbor pixel are calculated using first order derivative operator respectively. Secondly, each gradient amplitude is divided by the summation result of two gradient amplitudes to generate each intelligible weight. Next, a value of neighbor intelligible element is obtained by adding a value of the right neighbor pixel times its intelligible weight to a value of the lower neighbor pixel times its intelligible weight. The decimated image can be acquired by applying the process repetitively to all pixels in input image which generates the value of decimated element by calculating the average of the target pixel value and the value of neighbor intelligible element.

  • PDF

Amultiplierless Letter-box converter using 4:3 decimation algorithm (4:3 데시메이션 알고리즘을 이용한 멀티플라이어리스 레터박스 변환기)

  • 한선형;오승호이문기
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.1045-1048
    • /
    • 1998
  • This paper proposes a efficient algorithm of letter-box converter using 4:3 decimation algorithm. To display 16:9 wide images on a 4:3 screen, there is need to convert the 16:9 wide images. The letter-box converter is designed with multiplierless architecture. We have modeled the letter-box converter in verilog-HDL and verified to show little difference between the original image and the converte image.

  • PDF

Optimization Design of Non-Integer Decimation Filter for Compressing Satellite Synthetic Aperture Radar On-board Data (위성 탑재 영상레이다의 온보드 데이터 압축을 위한 비정수배 데시메이션 필터 최적화 설계 기법)

  • Kang, Tae-Woong;Lee, Hyon-Ik;Lee, Young-Bok
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.24 no.5
    • /
    • pp.475-481
    • /
    • 2021
  • The on-board processor of satellite Synthetic Aperture Radar(SAR) digitizes the back-scattered echoes and transmits them to the ground. As satellite SAR image of various operating conditions including broadband and high resolution is required, an enormous amount of SAR data is generated. Decimation filter is used for data compression to improve the transmission efficiency of these data. Decimation filter is implemented with the FIR(Finite Impulse Response) filter and here, the decimation ratio and tap length are constrained by resource requirements of FPGA used for implementation. This paper suggests to use a non-integer ratio decimation filter in order to optimize the data transmission efficiency. Also, it proposes a filter design method that remarkably reduces the resource constraints of the FPGA in-use via applying a polyphase filter structure. The required resources for implementing the proposed filter is analysed in this paper.

An Optimal Half-Band FIR Filter for Image Pyramied (영상 피라미드를 위한 최적 Half-Band FIR 필터)

  • 박섭형;이상욱
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.25 no.7
    • /
    • pp.826-835
    • /
    • 1988
  • In this paper, we analyze the generation of an image pyramid as a 2-dimensional decimation-interpolation process, and suggest a performance index of FIR filter for decimation and interpolation filter. Until now, most deciamtion and interpolation filters are designed via the approximation of the impulse response of an ideal filter. In this paper, however, we propose a new performance index that minimizes the maximum frequency-weighted mean square error between the desired and the generated interpolated signal, and propose an optimal half-band filter based on the proposed performance index as an example. Some simulation results with real images show that the proposed optimal half-band filter yields a higher PSNR as well as the more preferable image quality, in comparison with other currently used filters with the same computational complexity.

  • PDF

Contrast Enhancement Algorithm Using Temporal Decimation Method (영상의 공간적 축소방법을 이용한 콘트라스트 향상 알고리즘)

  • Yun Jong-Ho;Cho Hwa-Hyun;Park Jin-Sung;Choi Myung-Ryul;Choi In-Seok
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.9
    • /
    • pp.1187-1194
    • /
    • 2005
  • In this paper, new contrast enhancement algorithms that use temporal decimation method and approximated CDF(Cumulative Distribution Function) are proposed. They reduce the amount of computation which is required for image contrast enhancement. Simulation results show that the algorithms can achieve significant reduction in the computational cost and the hardware complexity. Visual test and standard deviation of their histogram have been introduced to evaluate the resultant output images of the proposed method and the original ones.

  • PDF

Performance Analysis of Adaptive Corner Shrinking Algorithm for Decimating the Document Image (문서 영상 축소를 위한 적응형 코너 축소 알고리즘의 성능 분석)

  • Kwak No-Yoon
    • Journal of Digital Contents Society
    • /
    • v.4 no.2
    • /
    • pp.211-221
    • /
    • 2003
  • The objective of this paper is performance analysis of the digital document image decimation algorithm which generates a value of decimated element by an average of a target pixel value and a value of neighbor intelligible element to adaptively reflect the merits of ZOD method and FOD method on the decimated image. First, a target pixel located at the center of sliding window is selected, then the gradient amplitudes of its right neighbor pixel and its lower neighbor pixel are calculated using first order derivative operator respectively. Secondly, each gradient amplitude is divided by the summation result of two gradient amplitudes to generate each local intelligible weight. Next, a value of neighbor intelligible element is obtained by adding a value of the right neighbor pixel times its local intelligible weight to a value of the lower neighbor pixel times its intelligible weight. The decimated image can be acquired by applying the process repetitively to all pixels in input image which generates the value of decimated element by calculating the average of the target pixel value and the value of neighbor intelligible element. In this paper, the performance comparison of proposed method and conventional methods in terms of subjective performance and hardware complexity is analyzed and the preferable approach for developing the decimation algorithm of the digital document image on the basis of this analysis result has been reviewed.

  • PDF

Coronary Vessel Segmentation by Coarse-to-Fine Strategy using Otsu Algorithm and Decimation-Free Directional Filter Bank

  • Trinh, Tan Dat;Tran, Thieu Bao;Thuy, Le Nhi Lam;Shimizu, Ikuko;Kim, Jin Young;Bao, Pham The
    • Journal of IKEEE
    • /
    • v.23 no.2
    • /
    • pp.557-570
    • /
    • 2019
  • In this study, a novel hierarchical approach is investigated to extract coronary vessel from X-ray angiogram. First, we propose to combine Decimation-free Directional Filter Bank (DDFB) and Homographic Filtering (HF) in order to enhance X-ray coronary angiographic image for segmentation purposes. Because the blood vessel ensures that blood flows in only one direction on vessel branch, the DDFB filter is suitable to be used to enhance the vessels at different orientations and radius. In the combination with HF filter, our method can simultaneously normalize the brightness across the image and increases contrast. Next, a coarse-to-fine strategy for iterative segmentation based on Otsu algorithm is applied to extract the main coronary vessels in different sizes. Furthermore, we also propose a new approach to segment very small vessels. Specifically, based on information of the main extracted vessels, we introduce a new method to extract junctions on the vascular tree and level of nodes on the tree. Then, the window based segmentation is applied to locate and extract the small vessels. Experimental results on our coronary X-ray angiography dataset demonstrate that the proposed approach can outperform standard method and attain the accuracy of 71.34%.

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

Image site reduction and expansion for multiresolution (다해상도를 위한 영상의 숙소 및 확대 algorithm)

  • Yeum, Sun-Sook;Kim, Jun-Woo;Kim, Min-Gi
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1993 no.11
    • /
    • pp.194-197
    • /
    • 1993
  • A technique for fast image reduction or expansion, in which the reduction(expansion) factor is either any integer or any rational number M/L Is represented. The multiresolution is modeled as an interpolation and filtering followed by a decimation. The model enables frequency domain analysts of the muitiresolution representations as well as convenient design of the Kernels(filters). Using any rin linear phase(Type I) filters a fine to coarse multiresolution structure can be generated.

  • PDF