• 제목/요약/키워드: image complexity

검색결과 936건 처리시간 0.028초

저 복잡도 전달량 추정 및 픽셀 기반 JBDCP에 의한 효율적인 단일 영상 안개 제거 방법 (Efficient Single Image Dehazing by Pixel-based JBDCP and Low Complexity Transmission Estimation)

  • 김종호
    • 한국전자통신학회논문지
    • /
    • 제14권5호
    • /
    • pp.977-984
    • /
    • 2019
  • 본 논문에서는 안개 성분을 포함한 실외영상의 효과적인 응용을 위하여 저 복잡도를 갖는 전달량 추정 및 픽셀 기반 JBDCP(: Joint Bright and Dark Channel Prior)를 이용한 단일 영상 기반 안개 제거 방법을 제안한다. 기존의 전달량 추정은 계산량과 메모리 요구량이 큰 정련과정을 포함하는 반면, 제안하는 안개 제거 방법은 픽셀단위 및 블록단위 dark channel 정보를 결합하여 에지 정보가 보존되는 전달량을 추정하고 복잡도를 크게 감소시킨다. 또한 픽셀 기반 JBDCP를 이용하여 영상의 각 위치마다 다른 안개값을 구함으로써 영상의 특성을 반영한 전달량 추정이 가능하다. 다양한 안개 영상에 대해 수행한 실험 결과는 제안하는 방법이 기존의 방법에 비해 저 복잡도로 실행되면서 우수한 안개 제거 성능을 보여 실시간 기기를 포함한 다양한 분야에 응용될 수 있음을 나타낸다.

영상의 복잡도를 고려한 슈퍼픽셀 분할 방법 (Superpixel Segmentation Scheme Using Image Complexity)

  • 박상현
    • 한국정보기술학회논문지
    • /
    • 제16권12호
    • /
    • pp.85-92
    • /
    • 2018
  • 복잡한 영상처리 알고리즘을 사용할 때 계산량을 줄이기 위해 슈퍼픽셀을 사용한다. 슈퍼픽셀은 특성이 유사한 픽셀들을 군집화하여 하나의 그룹으로 만드는 방법이다. 슈퍼픽셀은 영상처리의 전단계로 사용되기 때문에 빠르게 생성할 수 있어야 하고 영상의 에지 성분들을 잘 보존하여야 한다. 본 논문에서는 에지 성분을 잘 보존하면서도 계산량이 많지 않은 슈퍼픽셀 생성 방법을 제안한다. 제안하는 방법에서는 먼저 기존의 k-mean 방법을 이용하여 영상의 슈퍼픽셀을 충분히 생성하고, 생성된 슈퍼픽셀들을 분석하여 유사한 슈퍼픽셀을 병합하는 방식으로 최종 슈퍼픽셀을 생성한다. 슈퍼픽셀을 병합할 때는 슈퍼픽셀에 대해서만 유사도를 측정하기 때문에 추가되는 계산량은 많지 않다. 실험 결과는 제안하는 방법으로 생성된 슈퍼픽셀이 기존 방법에 의해 생성된 슈퍼픽셀에 비해 보다 정확하게 에지 성분들을 보존하는 것을 보여준다.

Efficient Superpixel Generation Method Based on Image Complexity

  • Park, Sanghyun
    • Journal of Multimedia Information System
    • /
    • 제7권3호
    • /
    • pp.197-204
    • /
    • 2020
  • Superpixel methods are widely used in the preprocessing stage as a method to reduce computational complexity by simplifying images while maintaining the characteristics of the images in the computer vision applications. It is common to generate superpixels of similar size and shape based on the pixel values rather than considering the characteristics of the image. In this paper, we propose a method to control the sizes and shapes of generated superpixels, considering the contents of an image. The proposed method consists of two steps. The first step is to over-segment an image so that the boundary information of the image is well preserved. In the second step, generated superpixels are merged based on similarity to produce the target number of superpixels, where the shapes of superpixels are controlled by limiting the maximum size and the proposed roundness metric. Experimental results show that the proposed method preserves the boundaries of the objects in an image more accurately than the existing method.

DCT 기반의 시각 적응적 양자화 방법에 관한 연구 (A DCT-Based Bisually Adaptive Quantization)

  • 박성찬;김정현;이귀상
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제50권7호
    • /
    • pp.332-338
    • /
    • 2001
  • A visually adaptive quantization method of DCT-based images based on Human Visual System(HVS) is proposed. This approach uses the spatial masking in HVS characteristics to obtain higher compression ratio with relatively small degradation in the image quality. HVS is nonsensitive to an edge area, so a high complexity area is quantized coarsely in contrast to fine quantization of the low complexity area. The complexity of an area is estimated by the variance of DCT coefficients of the image. Experimental results demonstrate the performance of the proposed method and the resulting images show little difference from the original image in the subjective perception.

  • PDF

PIM(Picture information measure)을 이용한 Wavelet기반 워터마킹 기법 (Wavelet Based Watermarking Technique Using PIM(Picture information measure))

  • 김윤평;김영준;이동규;한수영;이두수
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
    • /
    • pp.1811-1814
    • /
    • 2003
  • In this paper, a novel watermarking technique is proposed to authenticate the owner-ship of copyright for the digital contents. Using the 2-level DWT(Discrete Wavelet Transform) we divide a specific frequency band into detailed blocks and apply PIM(picture information measure). After the complexity is calculated, the watermark is embedded in only on high complexity areas. Conventional watermarking technique damages to the original image, because it does not consider the feature of the whole area or a specific frequency band. Easily affected by noise and compression, it is difficult to extract the watermark. However, the proposed watermarking technique, considering the complexity of input image, does not damage to the original image Simulation result show that the proposed technique has the robustness of JPEG compression, noise and filtering such as a general signal processing

  • PDF

High-Performance and Low-Complexity Image Pre-Processing Method Based on Gradient-Vector Characteristics and Hardware-Block Sharing

  • Kim, Woo Suk;Lee, Juseong;An, Ho-Myoung;Kim, Jooyeon
    • Transactions on Electrical and Electronic Materials
    • /
    • 제18권6호
    • /
    • pp.320-322
    • /
    • 2017
  • In this paper, a high-performance, low-area gradient-magnitude calculator architecture is proposed, based on approximate image processing. To reduce the computational complexity of the gradient-magnitude calculation, vector properties, the symmetry axis, and common terms were applied in a hardware-resource-shared architec-ture. The proposed gradient-magnitude calculator was implemented using an Altera Cyclone IV FPGA (EP4CE115F29) and the Quartus II v.16 device software. It satisfied the output-data quality while reducing the logic elements by 23% and the embedded multipliers by 76%, compared with previous work.

영상의 복잡도를 고려한 H.264 기반 비트 율-왜곡 최적화 매크로블록 모드 결정 기법 (Adaptive mode decision based on R-D optimization in H.264 using sequence statistics)

  • 김성제;최윤식
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2006년도 하계종합학술대회
    • /
    • pp.291-292
    • /
    • 2006
  • This paper presents rate-distortion optimization that is considered sequence statistics(complexity) to choose the best macroblock mode decision in H.264. In previous work, Lagrange multiplier is derived by the function of constant value 0.85 and QP so that is not the proper Lagrange multilplier for any image sequence. The proposed algorithm solves the problem by changing constant value 0.85 into adaptive value which is influenced by image complexity, and by reducing the encoder complexity to estimate the image statistics with the multiplication of transformed, quantized rate and distortion. Proposed algorithm is achieved the bit-rate saving up to 5% better than previous method.

  • PDF

고주파 서브벤드를 이용한 임계 계층적 블록 매칭 알고리즘에 관한 연구 (A Study on the thresholding hierarchical block matching algorithm using the high frequency subband)

  • 안종구;이승협;추형석
    • 융합신호처리학회논문지
    • /
    • 제7권4호
    • /
    • pp.155-160
    • /
    • 2006
  • 본 논문에서는 웨이브릿 변환 영역의 4개의 서브밴드와 임계값 처리를 이용하는 계층적 블록 매칭 알고리즘을 제안하였다. 제안한 알고리즘은 다분해능의 첫 번째 레벨에서 웨이브릿 변환 영역의 4개 서브밴드를 이용함으로써 복원된 영상의 PSNR 성능을 향상시켰고, 움직임 벡터에 대한 임계값 처리를 하여 계산량을 줄였다. Carphone 영상과 Mother and Daughter 영상에 대한 실험에서 기존의 계층적 움직임 추정 알고리즘과 비교하여 임계값을 0으로 하였을 경우에 계산량은 최대 16%까지 증가하였으나 복원된 영상의 PSNR 성능은 최대 0.16dB 정도 향상된 결과를 보였고, 임계값을 증가시킴에 따라서 계산량은 최대 8%정도 줄고 복원된 영상의 PSNR은 비슷한 성능을 보였다.

  • PDF

Modified Cubic Convolution Interpolation for Low Computational Complexity

  • Jun, Young-Hyun;Yun, Jong-Ho;Choi, Myung-Ryul
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 한국정보디스플레이학회 2006년도 6th International Meeting on Information Display
    • /
    • pp.1259-1262
    • /
    • 2006
  • In this paper, we propose a modified cubic convolution interpolation for the enlargement or reduction of digital images using a pixel difference value. The proposed method has a low complexity: the number of multiplier of weighted value to calculate one pixel of a scaled image has seven less than that of cubic convolution interpolation has sixteen. We use the linear function of the cubic convolution and the difference pixel value for selecting interpolation methods. The proposed method is compared with the conventional one for the computational complexity and the image quality. The simulation results show that the proposed method has less computational complexity than one of the cubic convolution interpolation.

  • PDF

문양 이미지에 관한 연구[ 1 ] -문양 이미지 포지셔닝 기준 개발을 중심으로- (A Study on Image of Patterns [ 1 ] - With a focus on Development on Image Positioning of Patterns -)

  • 유현정;김민자
    • 복식
    • /
    • 제59권2호
    • /
    • pp.29-41
    • /
    • 2009
  • Perception between real object and recognized subject of human on objective subject is not the same. The reason Is that individual perception of visual design components are transmitted as the image of whole. It is required process of visual perception. Therefore, I developed the vision of seeing image of pattern which is based on Gestalt visual perception theory in clothes. The summary of this study's results is like followings. Extremely antagonistic terms which are specialized by formative characteristics of formative components are clearness and blur of outline/ fixed shape and non-fixed shape/ visuality and tangibility of representation/ simplicity and complexity of structure/ invariability and variability of mobility/ symmetry and asymmetry of arrangements singularity and plurality of group number. The expression of motive shows that clearness, fixed shape, visuality and simplicity pursuit Determination image, and blur, non-fixed shape, tangibility and complexity pursuit Ambiguity image. The arrangements of motive shows that invariability, symmetry and singularity pursuit Order image, and variability asymmetry and plurality pursuit Disorder image. Therefore, the standard of the coordinator of Pattern image positioning is established as Determination and Ambiguity of motive are X-axis, and Order and Disorder of pattern are Y-axis. As the frame of Pattern image positioning, four separated dimensions have made.