• Title/Summary/Keyword: Histogram Decomposition

Search Result 17, Processing Time 0.039 seconds

DWTHE: Decomposable Weighted and Thresholded Histogram Equalization (DWTHE: 분할 기반의 히스토그램 평활화)

  • Kim, Mary;Chung, Min-Gyo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.11
    • /
    • pp.856-860
    • /
    • 2009
  • Wang and Ward developed an image contrast enhancement method called WTHE (Weighted and Thresholded Histogram Equalization). In this paper, we propose an improved variant of WTHE called DWTHE(Decomposable WTHE) that enhances WTHE through the use of histogram decomposition. Specifically, DWTHE divides an input histogram by using image's mean brightness or equally-spaced brightness points, computes a probability value for each sub-histogram, modifies the sub-histograms by using those probability values as weights, and then performs histogram equalization on the modified input histogram. As opposed to WTHE that uses a single weight, DWTHE uses multiple weights derived from histogram decomposition. Experimental results show that the proposed method outperforms the previous histogram equalization based methods.

Image Contrast Enhancement based on Histogram Decomposition and Weighting (히스토그램 분할과 가중치에 기반한 영상 콘트라스트 향상 방법)

  • Kim, Ma-Ry;Chung, Min-Gyo
    • Journal of Internet Computing and Services
    • /
    • v.10 no.3
    • /
    • pp.173-185
    • /
    • 2009
  • This paper proposes two new image contrast enhancement methods, RSWHE (Recursively Separated and Weighted Histogram Equalization) and RSWHS (Recursively Separated and Weighted Histogram Specification). RSWHE is a histogram equalization method based on histogram decomposition and weighting, whereas RSWHS is a histogram specification method based on histogram decomposition and weighting. The two proposed methods work as follows: 1) decompose an input histogram based on the image's mean brightness, 2) compute the probability for the area corresponding to each sub-histogram, 3) modify the sub-histogram by weighting it with the computed probability value, 4) lastly, perform histogram equalization (in the case of RSWHE) or histogram specification (in the case of RSWHS) on the modified sub-histograms independently. Experimental results show that RSWHE and RSWHS outperform other methods in terms of contrast enhancement and mean brightness preservation as well.

  • PDF

Histogram-Based Singular Value Decomposition for Object Identification and Tracking (객체 식별 및 추적을 위한 히스토그램 기반 특이값 분해)

  • Ye-yeon Kang;Jeong-Min Park;HoonJoon Kouh;Kyungyong Chung
    • Journal of Internet Computing and Services
    • /
    • v.24 no.5
    • /
    • pp.29-35
    • /
    • 2023
  • CCTV is used for various purposes such as crime prevention, public safety reinforcement, and traffic management. However, as the range and resolution of the camera improve, there is a risk of exposing personal information in the video. Therefore, there is a need for new technologies that can identify individuals while protecting personal information in images. In this paper, we propose histogram-based singular value decomposition for object identification and tracking. The proposed method distinguishes different objects present in the image using color information of the object. For object recognition, YOLO and DeepSORT are used to detect and extract people present in the image. Color values are extracted with a black-and-white histogram using location information of the detected person. Singular value decomposition is used to extract and use only meaningful information among the extracted color values. When using singular value decomposition, the accuracy of object color extraction is increased by using the average of the upper singular value in the result. Color information extracted using singular value decomposition is compared with colors present in other images, and the same person present in different images is detected. Euclidean distance is used for color information comparison, and Top-N is used for accuracy evaluation. As a result of the evaluation, when detecting the same person using a black-and-white histogram and singular value decomposition, it recorded a maximum of 100% to a minimum of 74%.

An Improved Histogram Specification using Multiresolution in the Spatial Domain for Image Enhancement (이미지 향상을 위해 공간영역에서 다중해상도를 이용한 개선된 히스토그램 특정화 방법)

  • Huh, Kyung-Moo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.20 no.6
    • /
    • pp.657-662
    • /
    • 2014
  • Usually, spatial information can be incorporated into histograms by taking histograms of a multiresolution image. For these reasons, many researchers are interested in multiresolution histogram processing. If the relation and sensitivity of the multiresolution images are well combined without loss of information, we can obtain satisfactory results in several fields of image processing including histogram equalization, specification and pattern matching. In this paper, we propose a multiresolution histogram specification method that improves the accuracy of histogram specification. The multiresolution decomposition technique is used in order to overcome the unique feature of a histogram specification affected by a quantization error of a digitalized image. The histogram specification is processed after the reduction of image resolution in order to enhance the accuracy of the results by histogram specification methods. The experimental results show that the proposed method enhances the accuracy of specification compared to conventional methods.

Enhanced Reversible data hiding scheme

  • Sachnev, V.;Kim, Dong-Hoi;Kim, Hyoung-Joong
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2007.02a
    • /
    • pp.127-133
    • /
    • 2007
  • We propose new reversible watermarking method for images. Being reversibility, original image and watermarked message should be recovered exactly. We propose different technique for hiding data to pairs. We use new type of histogram (pair histogram), which shows frequencies of each pair in image. We use histogram shift method for data embedding to pairs. We also propose improved version of method which allow hiding data with good performance for high capacities. This algorithm has better result compare to Tian's difference expansion method based on the Haar wavelet decomposition. For proposed algorithm capacity is higher under same PSNR.

  • PDF

Curvature and Histogram of oriented Gradients based 3D Face Recognition using Linear Discriminant Analysis

  • Lee, Yeunghak
    • Journal of Multimedia Information System
    • /
    • v.2 no.1
    • /
    • pp.171-178
    • /
    • 2015
  • This article describes 3 dimensional (3D) face recognition system using histogram of oriented gradients (HOG) based on face curvature. The surface curvatures in the face contain the most important personal feature information. In this paper, 3D face images are recognized by the face components: cheek, eyes, mouth, and nose. For the proposed approach, the first step uses the face curvatures which present the facial features for 3D face images, after normalization using the singular value decomposition (SVD). Fisherface method is then applied to each component curvature face. The reason for adapting the Fisherface method maintains the surface attribute for the face curvature, even though it can generate reduced image dimension. And histogram of oriented gradients (HOG) descriptor is one of the state-of-art methods which have been shown to significantly outperform the existing feature set for several objects detection and recognition. In the last step, the linear discriminant analysis is explained for each component. The experimental results showed that the proposed approach leads to higher detection accuracy rate than other methods.

An Empirical Evaluation of Color Distribution Descriptor for Image Search (이미지 검색을 위한 칼라 분포 기술자의 성능 평가)

  • Lee, Choon-Sang;Lee, Yong-Hwan;Kim, Young-Seop;Rhee, Sang-Burm
    • Journal of the Semiconductor & Display Technology
    • /
    • v.5 no.2 s.15
    • /
    • pp.27-31
    • /
    • 2006
  • As more and more digital images are made by various applications, image retrieval becomes a primary concern in technology of multimedia. This paper presents color based descriptor that uses information of color distribution in color images which is the most basic element for image search and performance of proposed visual feature is evaluated through the simulation. In designing the image search descriptor used color histogram, HSV, Daubechies 9/7 and 2 level wavelet decomposition provide better results than other parameters in terms of computational time and performances. Also histogram quadratic matrix outperforms the sum of absolute difference in similarity measurements, but spends more than 60 computational times.

  • PDF

Object Recognition Using the Edge Orientation Histogram and Improved Multi-Layer Neural Network

  • Kang, Myung-A
    • International Journal of Advanced Culture Technology
    • /
    • v.6 no.3
    • /
    • pp.142-150
    • /
    • 2018
  • This paper describes the algorithm that lowers the dimension, maintains the object recognition and significantly reduces the eigenspace configuration time by combining the edge orientation histogram and principle component analysis. By using the detected object region as a recognition input image, in this paper the object recognition method combined with principle component analysis and the multi-layer network which is one of the intelligent classification was suggested and its performance was evaluated. As a pre-processing algorithm of input object image, this method computes the eigenspace through principle component analysis and expresses the training images with it as a fundamental vector. Each image takes the set of weights for the fundamental vector as a feature vector and it reduces the dimension of image at the same time, and then the object recognition is performed by inputting the multi-layer neural network.

Block Based Blind & Secure Gray Image Watermarking Technique Based on Discrete Wavelet Transform and Singular Value Decomposition

  • Imran, Muhammad;Harvey, Bruce A.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.2
    • /
    • pp.883-900
    • /
    • 2017
  • In this paper block based blind secure gray image watermarking scheme based on discrete wavelet transform and singular value decomposition is proposed. In devising the proposed scheme, security is given high importance along with other two requirements: robustness and imperceptibility. The use of discrete wavelet transform not only improves robustness but the selection of bands with high tolerance towards noise caused an improvement in terms of imperceptibility. The robustness further improved due to the involvement of singular vectors along with singular values in watermark embedding and extraction process. Finally, to achieve security, the selected DWT band is decomposed into smaller blocks and random blocks are chosen for modification. Furthermore, the elements of left and right singular vectors of selected blocks are chosen based on their dependence upon each other for watermark embedding. Various experiments using different images as host and watermark were conducted to examine and validate the proposed technique. Additionally, the proposed technique is tested against various attacks like compression, affine transformation, cropping, translation, X shearing, scaling, Y shearing, filtering, blurring, different kinds of noises, histogram equalization, rotation, etc. Lastly, the proposed technique is compared with state-of-the-art watermarking techniques and their comparison shows significant improvement of proposed scheme over existing techniques.

Robust Algorithm using SVD for Data Hiding in the Color Image against Various Attacks (특이값 분해를 이용한 다양한 이미지 변화에 강인한 정보 은닉 알고리즘)

  • Lee, Donghoon;Heo, Jun
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2011.07a
    • /
    • pp.28-30
    • /
    • 2011
  • 본 논문에서는 특이값 분해(Singular Value Decomposition)을 이용하여 이미지의 주파수 영역 내에 정보를 은닉하는 방법을 제시한다. 이미지를 주파수 영역으로 변환하기 위하여 블록 단위로 이산 코사인 변환(Discrete Cosine Transform)을 수행한다. 이후 인접한 네 블록의 DC 값들로 구성된 행렬의 특이값을 은닉하고자 하는 정보에 따라 변환한다. 원래의 DC 값은 정보에 따라 변환된 DC 값으로 대체되고 역 이산 코사인 변환(Inverse Discrete Cosine Transform)을 수행하여 정보가 은닉된 이미지를 얻는다. 제안하는 알고리즘의 성능을 분석하기 위해 JPEG(Joint Photographic Coding Experts Group), 선명화(Sharpening), 히스토그램 등화(Histogram Equalization)와 같이 다양한 이미지 변화를 거친 후, 은닉된 정보의 신뢰도를 비교한다.

  • PDF