• Title/Summary/Keyword: 시각적 가중치

Search Result 163, Processing Time 0.026 seconds

Digital Image Watermarking Using Multiresolution Wavelet Transform (멀티해상도 웨이블릿 변환을 이용한 디지털 영상 워터마킹)

  • 이호준;고형화
    • Journal of Broadcast Engineering
    • /
    • v.7 no.4
    • /
    • pp.368-375
    • /
    • 2002
  • In this paper, we apply multiresolution wavelet transform for the digital image watermarking. For better result, we insert watermark into the images and set a proper weighting factor for each subband based on HVS model. With proposed algorithm, we confirm that the image quality is satisfactory and this method outperforms the previous methods against image compression and cropping.

A Content-based Video Rate-control Algorithm Interfaced to Human-eye (인간과 결합한 내용기반 동영상 율제어)

  • 황재정;진경식;황치규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.3C
    • /
    • pp.307-314
    • /
    • 2003
  • In the general multiple video object coder, more interested objects such as speaker or moving object is consistently coded with higher priority. Since the priority of each object may not be fixed in the whole sequence and be variable on frame basis, it must be adjusted in a frame. In this paper, we analyze the independent rate control algorithm and global algorithm that the QP value is controled by the static parameters, object importance or priority, target PSNR, weighted distortion. The priority among static parameters is analyzed and adjusted into dynamic parameters according to the visual interests or importance obtained by camera interface. Target PSNR and weighted distortion are proportionally derived by using magnitude, motion, and distortion. We apply those parameters for the weighted distortion control and the priority-based control resulting in the efficient bit-rate distribution. As results of this paper, we achieved that fewer bits are allocated for video objects which has less importance and more bits for those which has higher visual importance. The duration of stability in the visual quality is reduced to less than 15 frames of the coded sequence. In the aspect of PSNR, the proposed scheme shows higher quality of more than 2d13 against the conventional schemes. Thus the coding scheme interfaced to human- eye proves an efficient video coder dealing with the multiple number of video objects.

Salt and Pepper Noise Removal Considering Directionality of Local Mask (국부 마스크의 방향성을 고려한 Salt and Pepper 잡음 제거)

  • Hong, Sang-Woo;Kwon, Se-Ik;Kim, Nam-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.05a
    • /
    • pp.676-678
    • /
    • 2016
  • Noise occurs in the process of obtaining, transmission, and processing in image processing systems and these noises lower the resolution of image and cause visual errors. Currently, a representative filter to remove salt and pepper noise is SMF(standard median filter) but it is inadequate in preserving edge as the noise field expands. Therefore, for salt and pepper noise enviroment, the study suggested and algorithm that are places with original pixel when the central pixel is non-noise and process by applying weighted value on areas with less local mask pixel changes when there is noise.

  • PDF

Composition of Foreground and Background Images using Optical Flow and Weighted Border Blending (옵티컬 플로우와 가중치 경계 블렌딩을 이용한 전경 및 배경 이미지의 합성)

  • Gebreyohannes, Dawit;Choi, Jung-Ju
    • Journal of the Korea Computer Graphics Society
    • /
    • v.20 no.3
    • /
    • pp.1-8
    • /
    • 2014
  • We propose a method to compose a foreground object into a background image, where the foreground object is a part (or a region) of an image taken by a front-facing camera and the background image is a whole image taken by a back-facing camera in a smart phone at the same time. Recent high-end cell-phones have two cameras and provide users with preview video before taking photos. We extract the foreground object that is moving along with the front-facing camera using the optical flow during the preview. We compose the extracted foreground object into a background image using a simple image composition technique. For better-looking result in the composed image, we apply a border smoothing technique using a weighted-border mask to blend transparency from background to foreground. Since constructing and grouping pixel-level dense optical flow are quite slow even in high-end cell-phones, we compute a mask to extract the foreground object in low-resolution image, which reduces the computational cost greatly. Experimental result shows the effectiveness of our extraction and composition techniques, with much less computational time in extracting the foreground object and better composition quality compared with Poisson image editing technique which is widely used in image composition. The proposed method can improve limitedly the color bleeding artifacts observed in Poisson image editing using weighted-border blending.

An Efficient Approximation method of Adaptive Support-Weight Matching in Stereo Images (스테레오 영상에서의 적응적 영역 가중치 매칭의 효율적 근사화 방법)

  • Kim, Ho-Young;Lee, Seong-Won
    • Journal of Broadcast Engineering
    • /
    • v.16 no.6
    • /
    • pp.902-915
    • /
    • 2011
  • Recently in the area-based stereo matching field, Adaptive Support-Weight (ASW) method that weights matching cost adaptively according to the luminance intensity and the geometric difference shows promising matching performance. However, ASW requires more computational cost than other matching algorithms do and its real-time implementation becomes impractical. By applying Integral Histogram technique after approximating to the Bilateral filter equation, the computational time of ASW can be restricted in constant time regardless of the support window size. However, Integral Histogram technique causes loss of the matching accuracy during approximation process of the original ASW equation. In this paper, we propose a novel algorithm that maintains the ASW algorithm's matching accuracy while reducing the computational costs. In the proposed algorithm, we propose Sub-Block method that groups the pixels within the support area. We also propose the method adjusting the disparity search range depending on edge information. The proposed technique reduces the calculation time efficiently while improving the matching accuracy.

Image Retrieval based on Kansei-Processing of compound Visual-Information (복합시각정보의 감성처리기반 이미지 검색)

  • Baek, Sun-Kyoung;Hwang, Kwang-Su;Kim, Pan-Koo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10b
    • /
    • pp.106-110
    • /
    • 2006
  • 현재 공학분야에서 감성을 소재로 진행되는 연구가 급격히 증가되고 있다. 그 중 상품 디자인과 이미지 검색 그리고 HCI(Human Computer Interaction) 분야에서 감성은 더욱 중요한 토픽이 되고 있다. 본 논문은 감성기반의 지능형 이미지 검색을 위한 감성처리 방법을 제안한다. 기존 연구에서는 단일 시각정보만을 고려하였고 이는 감성에 적합한 검색을 위해서 너무 단편적인 결과를 갖는다. 인간의 감성에 보다 적합한 검색을 위하여 우리는 컬러와 형태가 복합된 이미지에 대한 감성을 처리한다. 이를 위해 첫째, 컬러와 형태의 속성을 공통으로 갖는 대표감성을 정의하고 각 속성에 감성 가중치를 부여한다. 둘째, 사용자의 감성의 적합한 이미지 검색을 위하여 각 이미지의 감성정보량을 측정한다. 이를 이미지 검색에 적용하고, 본 저자의 이전 연구 중 단일 정보만을 고려한 감성기반 검색시스템과 사용자 만족도를 이용하여 비교 평가한다. 제안된 방법은 기존의 단일시각정보만을 고려했던 감성기반 이미지 검색보다 향상된 결과를 얻을 수 있었다. 그리고 복합시각정보에 대한 감성을 동시에 처리할 수 있는 연구로써의 의의를 갖는다.

  • PDF

DCT Classifier based on HVS and Pyramidal Image Coding using VQ (인간시각 기반 DCT 분류기와 VQ를 이용한 계층적 영상부호화)

  • 김석현;하영호;김수중
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.1
    • /
    • pp.47-56
    • /
    • 1993
  • In this paper, pyramidal VQ image coding by DCT classifier based on HVS is studied. The proposed DCT classifier based on HVS is that the transform subblocks of the image are mlultiplied by MTF which is a sort of band pass filter and sorted by the magnitude of their ac energy levels and classifeid into three classes such as low, middle and high variance class by the threshold and then edges are detected in comparison of the energy sum of ac transform coefficients corresponding to the different edge directions.

  • PDF

Adaptive Image Enhancement Algorithm using Local Statistics (국부통계특성을 이용한 적응적 영상 Enhancement 알고리듬)

  • Kim Kyoung Ho;Hong Min-Cheol
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2004.11a
    • /
    • pp.71-74
    • /
    • 2004
  • 본 논문에서는 MAP(maximum a posteriori) 추정방식과 국부통계특성을 이용한 적응적 영상 향상 방법을 제안한다. 원 영상의 에지를 보존 할 수 있는 MAP추정 방식과 인간의 시각 특성을 나타내는 시각 함수를 이용한 가중치 행렬을 사용하였다. MAP 추정 방식은 컨벡스 함수를 최적화하여 원 영상의 에지를 보존하는 방법을 이용하였으며, 시각 함수는 국부 정보의 평균, 분산을 이용하여 정의하였다. 제안 방식으로부터 국부영역의 비용함수에 의해 발생되는 스무딩 정도를 다르게 하여 보간된 영상의 화질을 개선시킨다. 제안된 방식의 성능을 실험 결과로부터 확인한 수 있었다.

  • PDF

Color Saturation Improvement using the Maximum Color Difference Table (최대색차신호 표를 이용한 컬러 채도 향상)

  • Kim, Sun-Jung;Hong, Sung-Hoon
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.2
    • /
    • pp.119-130
    • /
    • 2013
  • In this paper, we propose a new color image enhancement method to improve the color saturation as well as luminance contrast in the YCbCr color space. The proposed method uses the maximum color difference table to compensate the perceived saturation changes due to luminance contrast changes. To improve the color saturation, the method first calculates the weighting factor by using the maximum color difference table and then multiplies the weighting factor to the input color difference signals. In this step, it maps color difference signals to proper color region to prevent the color distortion by considering the correlation of color saturations depending on the luminance and hue. The experimental results show that our method effectively improves color saturation compared to the conventional methods.

Comparison with various approach algorithms for Fast Stereo Matching in Real-time system (실시간 시스템에서의 빠른 스테레오 매칭을 위한 다양한 접근 알고리즘의 성능비교)

  • Kim, Ho-Young;Lee, Seong-Won
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2011.07a
    • /
    • pp.303-304
    • /
    • 2011
  • 영역기반 스테레오 매칭의 분야에서 최근 인간의 시각체계(Human Visual System)에 기반하여 영역내의 밝기값과 거리값에 따라 적응적으로 가중치를 부여하는 적응적 영역 가중치(Adaptive Support-Weight) 방법이 좋은 매칭 결과를 보이고 있다. 하지만 이 방법은 영역 윈도우의 크기가 커짐에 따라 기하급수적으로 계산량이 많아지는 단점을 보이고 있다. 이에 Bilateral filter 수식으로 근사화 후 Integral Histogram 기법을 적용하여 영역 윈도우의 크기에 상관없이 상수 시간 O(1) 내에 매칭을 수행하는 연구가 진행되었다. 하지만 이 방법은 근사화 과정에서의 원 ASW 수식을 왜곡하기 때문에 매칭 정확도의 손실을 가져오게 된다. 이에 본 논문에서는 Bilateral 접근 방식, Sub-Block 방식 및 적응적 시차 탐색 방식에 대하여 각 방식에서 필요한 메모리 자원과 소모되는 계산량의 비용과 동시에 매칭 결과 정확도 면에서 비교하고 가장 좋은 접근 방식을 도출하고자 한다.

  • PDF