• Title/Summary/Keyword: histogram grouping

Search Result 9, Processing Time 0.027 seconds

Flickering Effect Reduction Based on the Modified Transformation Function for Video Contrast Enhancement

  • Yang, Hyeonseok;Park, Jinwook;Moon, Youngshik
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.3 no.6
    • /
    • pp.358-365
    • /
    • 2014
  • This paper proposes a method that reduces the flickering effect caused by A-GLG (Adaptive Gray-Level Grouping) during video contrast enhancement. Of the GLG series, A-GLG shows the best contrast enhancement performance. The GLG series is based on histogram grouping. Histogram grouping is calculated differently between the continuous frames with a similar histogram and causes a subtle change in the transformation function. This is the reason for flickering effect when the video contrast is enhanced by A-GLG. To reduce the flickering effect caused by A-GLG, the proposed method calculates a modified transformation function. The modified transformation function is calculated using a previous and current transformation function applied with a weight separately. The proposed method was compared with A-GLG for flickering effect reduction and video contrast enhancement. Through the experimental results, the proposed method showed not only a reduced flickering effect, but also video contrast enhancement.

Scene Change Detection with 3-Step Process (3단계 과정의 장면 전환검출)

  • Yoon, Shin-Seong;Won, Rhee-Yang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.6
    • /
    • pp.147-154
    • /
    • 2008
  • First, this paper compute difference value between frames using the composed method of $X^2$ histogram and color histogram and the normalization. Next, cluster representative frame was decided by using the clustering for distance and the k-mean grouping. Finally, representative frame of group was decided by using the likelihood ratio. Proposed method can be known by experiment as outstanding of detection rather than other methods, due to computing of difference value, clustering and grouping, and detecting of representative frame.

  • PDF

The Design an Implementation of Content-based Image Retrieval System Using Color Features (칼라 특징을 이용한 내용기반 화상검색시스템의 설계 및 구현)

  • 정원일;박정찬;최기호
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.6
    • /
    • pp.111-118
    • /
    • 1996
  • A content-based image retrieval system is designed and implemetned using the color featurees which are histogram intersection and color pairs. The preprocessor for the image retrieval manage linearly the existing HSI(hue, saturation, saturation, intensity). Hue and intensity histogram thresholding for each color attribute is performed to split the chromatic and achromatic regions respectively. Grouping te indexes produced by the histogram intersection is used to save the retrieval times. Each image is divided into the cells of 32$\times$32 pixels, and color pairs are used to represent the query during retrievals. The recall/precision of histogram intersection is 0.621/0.663 and recall/precision of color pairs is 0.438/0.536. And recall/precision of proposed method is 0.765/0.775/. It is shown that the proposed method using histogram intersection and color pairs improves the retrieval rates.

  • PDF

A New Face Detection Method by Hierarchical Color Histogram Analysis

  • Kwon, Ji-Woong;Park, Myoung-Soo;Kim, Mun-Hyuk;Park, Jin-Young
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.138.3-138
    • /
    • 2001
  • Because face has non-rigid structure and is influenced by illumination, we need robust face detection algorithm with the variations of external environments (orientation of lighting and face, complex background, etc.). In this paper we develop a new face detection algorithm to achieve robustness. First we transform RGB color into other color space, in which we can reduce lighting effect much. Second, hierarchical image segmentation technique is used for dividing a image into homogeneous regions. This process uses not only color information, but also spatial information. One of them is used in segmentation by histogram analysis, the other is used in segmentation by grouping. And we can select face region among the homogeneous regions by using facial features.

  • PDF

Robust Optical Flow Detection Using 2D Histogram with Variable Resolution (가변 분해능을 가진 2차원 히스토그램을 이용한 강건한 광류검출)

  • CHON Jaechoon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.23 no.1
    • /
    • pp.49-57
    • /
    • 2005
  • The proposed algorithm is to achieve the robust optical flow detection which is applicable for the case that the outlier rate is over 80%. If the outlier rate of optical flows is over 30%, the discrimination between the inliers and outlier with the conventional algorithm is very difficult. The proposed algorithm is to overcome such difficulty with three steps of grouping algorithm; 1) constructing the 2D histogram with two axies of the lengths and the directions of optical flows. 2) sorting the number of optical flows in each bin of the two-dimensional histogram in the descending order and removing some bins with lower number of optical flows than threshold. 3) increasing the resolution of the two-dimensional histogram if the number of optical flows in a specific bin is over 20% and decreasing the resolution if the number of optical flows is less than 10%. Such processing is repeated until the number of optical flows falls into the range of 10%-20% in all the bins. The proposed algorithm works well on the different kinds of images with many of wrong optical flows. Experimental results are included.

Robust Optical Flow Detection Using 2D histogram with Variable Resolution (가변 분해능을 가진 2차원 히스토그램을 이용한 강건한 광류인식)

  • CHON Jaechoon;KIM Hyongsuk
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.3 s.303
    • /
    • pp.51-64
    • /
    • 2005
  • The proposed algorithm is to achieve the robust optical flow detection which is applicable for the case that the outlier rate is over $80\%$. If the outlier rate of optical flows is over $30\%$, the discrimination between the inliers and outlier with the conventional algorithm is very difficult. The proposed algorithm is to overcome such difficulty withthree steps of grouping algorithm; 1) constructing the 2 D histogram with two axies of the lengths and the directions of optical flows. 2) sorting the number of optical flows in each bin of the two-dimensional histogram in the descendingorder and removing some bins with lower number of optical flows than threshold 3) increasing the resolution of the two-dimensional histogram if the number of optical flows in a specific bin is over $20\%$ and decreasing theresolution if the number of optical flows is less than $10\%$. Such processing is repeated until the the number of optical flows falls into the range of $10\%-20\%$ in all the bins. The proposed algorithm works well on the different kinds of images with many of wrong optical flows. Experimental results are included.

A Lightweight Integrity Authentication Scheme based on Reversible Watermark for Wireless Body Area Networks

  • Liu, Xiyao;Ge, Yu;Zhu, Yuesheng;Wu, Dajun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4643-4660
    • /
    • 2014
  • Integrity authentication of biometric data in Wireless Body Area Network (WBAN) is a critical issue because the sensitive data transmitted over broadcast wireless channels could be attacked easily. However, traditional cryptograph-based integrity authentication schemes are not suitable for WBAN as they consume much computational resource on the sensor nodes with limited memory, computational capability and power. To address this problem, a novel lightweight integrity authentication scheme based on reversible watermark is proposed for WBAN and implemented on a TinyOS-based WBAN test bed in this paper. In the proposed scheme, the data is divided into groups with a fixed size to improve grouping efficiency; the histogram shifting technique is adopted to avoid possible underflow or overflow; local maps are generated to restore the shifted data; and the watermarks are generated and embedded in a chaining way for integrity authentication. Our analytic and experimental results demonstrate that the integrity of biometric data can be reliably authenticated with low cost, and the data can be entirely recovered for healthcare applications by using our proposed scheme.

Robust Method of Video Contrast Enhancement for Sudden Illumination Changes (급격한 조명 변화에 강건한 동영상 대조비 개선 방법)

  • Park, Jin Wook;Moon, Young Shik
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.11
    • /
    • pp.55-65
    • /
    • 2015
  • Contrast enhancement methods for a single image applied to videos may cause flickering artifacts because these methods do not consider continuity of videos. On the other hands, methods considering the continuity of videos can reduce flickering artifacts but it may cause unnecessary fade-in/out artifacts when the intensity of videos changes abruptly. In this paper, we propose a robust method of video contrast enhancement for sudden illumination changes. The proposed method enhances each frame by Fast Gray-Level Grouping(FGLG) and considers the continuity of videos by an exponential smoothing filter. The proposed method calculates the smoothing factor of an exponential smoothing filter using a sigmoid function and applies to each frame to reduce unnecessary fade-in/out effects. In the experiment, 6 measurements are used for the performance analysis of the proposed method and traditional methods. Through the experiment. it has been shown that the proposed method demonstrates the best quantitative performance of MSSIM and Flickering score and show the adaptive enhancement under sudden illumination change through the visual quality comparison.

Deinterleaving of Multiple Radar Pulse Sequences Using Genetic Algorithm (유전자 알고리즘을 이용한 다중 레이더 펄스열 분리)

  • 이상열;윤기천
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.6
    • /
    • pp.98-105
    • /
    • 2003
  • We propose a new technique of deinterleaving multiple radar pulse sequences by means of genetic algorithm for threat identification in electronic warfare(EW) system. The conventional approaches based on histogram or continuous wavelet transform are so deterministic that they are subject to failing in detection of individual signal characteristics under real EW signal environment that suffers frequent signal missing, noise, and counter-EW signal. The proposed algorithm utilizes the probabilistic optimization procedure of genetic algorithm. This method, a time-of-arrival(TOA) only strategy, constructs an initial chromosome set using the difference of TOA. To evaluate the fitness of each gene, the defined pulse phase is considered. Since it is rare to meet with a single radar at a moment in EW field of combat, multiple solutions are to be derived in the final stage. Therefore it is designed to terminate genetic process at the prematured generation followed by a chromosome grouping. Experimental results for simulated and real radar signals show the improved performance in estimating both the number of radar and the pulse repetition interval.