• Title/Summary/Keyword: Local Histogram

Search Result 247, Processing Time 0.027 seconds

Comparison of Based on Histogram Equalization Techniques by Using Normalization in Thoracic Computed Tomography (흉부 컴퓨터 단층 촬영에서 정규화를 사용한 다양한 히스토그램 평준화 기법을 비교)

  • Lee, Young-Jun;Min, Jung-Whan
    • Journal of radiological science and technology
    • /
    • v.44 no.5
    • /
    • pp.473-480
    • /
    • 2021
  • This study was purpose to method that applies for improving the image quality in CT and X-ray scan, especially in the lung region. Also, we researched the parameters of the image before and after applying for Histogram Equalization (HE) such as mean, median values in the histogram. These techniques are mainly used for all type of medical images such as for Chest X-ray, Low-Dose Computed Tomography (CT). These are also used to intensify tiny anatomies like vessels, lung nodules, airways and pulmonary fissures. The proposed techniques consist of two main steps using the MATLAB software (R2021a). First, the technique should apply for the process of normalization for improving the basic image more correctly. In the next, the technique actively rearranges the intensity of the image contrast. Second, the Contrast Limited Adaptive Histogram Equalization (CLAHE) method was used for enhancing small details, textures and local contrast of the image. As a result, this paper shows the modern and improved techniques of HE and some advantages of the technique on the traditional HE. Therefore, this paper concludes that various techniques related to the HE can be helpful for many processes, especially image pre-processing for Machine Learning (ML), Deep Learning (DL).

Contrast Enhancement Using a Density based Sub-histogram Equalization Technique (밀도기반의 분할된 히스토그램 평활화를 통한 대비 향상 기법)

  • Yoon, Hyun-Sup;Han, Young-Joon;Hahn, Hern-Soo
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.46 no.1
    • /
    • pp.10-21
    • /
    • 2009
  • In order to enhance the contrast in the regions where the pixels have similar intensities, this paper presents a new histogram equalization scheme. Conventional global equalization schemes over-equalizes those regions so that too bright or dark pixels are resulted and local equalization schemes produce unexpected discontinuities at the boundaries of the blocks. The proposed algorithm segments the original histogram into sub-histograms with reference to brightness level and equalizes each sub-histogram with the limited extents of equalization considering its mean and variance. The final image is determined as the weighted sum of the equalized images obtained by using the sub-histogram equalizations. By limiting the maximum and minimum ranges of equalization operations on individual sub-histograms, the over-equalization effect is eliminated. Also the result image does not miss feature information in low density histogram region since the remaining these area is applied separating equalization. This paper includes how to determine the segmentation points in the histogram. The proposed algorithm has been tested with more than 100 images having various contrast in the images and the results are compared to the conventional approaches to show its superiority.

A Study on Image Segmentation Method Based on a Histogram for Small Target Detection (소형 표적 검출을 위한 히스토그램 기반의 영상분할 기법 연구)

  • Yang, Dong Won;Kang, Suk Jong;Yoon, Joo Hong
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.11
    • /
    • pp.1305-1318
    • /
    • 2012
  • Image segmentation is one of the difficult research problems in machine vision and pattern recognition field. A commonly used segmentation method is the Otsu method. It is simpler and easier to implement but it fails if the histogram is unimodal or similar to unimodal. And if some target area is smaller than background object, then its histogram has the distribution close to unimodal. In this paper, we proposed an improved image segmentation method based on 1D Otsu method for a small target detection. To overcome drawbacks by unimodal histogram effect, we depressed the background histogram using a logarithm function. And to improve a signal to noise ratio, we used a local average value by the neighbor window for thresholding using 1D Otsu method. The experimental results show that our proposed algorithm performs better segmentation result than a traditional 1D Otsu method, and needs much less computational time than that of the 2D Otsu method.

Robust Hierarchical GLOCAL Hash Generation based on Image Histogram (히스토그램 기반의 강인한 계층적 GLOCAL 해쉬 생성 방법)

  • Choi, Yong-Soo;Kim, Hyoung-Joong;Lee, Dal-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.1
    • /
    • pp.133-140
    • /
    • 2011
  • Recently, Web applications, such as Stock Image and Image Library, are developed to provide the integrated management for user's images. Image hash techniques are used for the image registration, management and retrieval as the identifier and many researches have been performed to raise the hash performance. This paper proposes GLOCAL image hashing method utilizing the hierarchical histogram which based on histogram bin population method. So far, many researches have proven that image hashing techniques based on histogram are robust image processing and geometrical attack. We modified existing image hashing method developed by our research team. The main idea is that it makes more fluent hash string if we have histogram bin of specific length as shown in the body of paper. Finally, we can raise the magnitude of hash string within same context or feature and strengthen the robustness of hash.

Texture Classification Using Local Neighbor Differences (지역 근처 차이를 이용한 텍스쳐 분류에 관한 연구)

  • Saipullah, Khairul Muzzammil;Peng, Shao-Hu;Park, Min-Wook;Kim, Deok-Hwan
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.04a
    • /
    • pp.377-380
    • /
    • 2010
  • This paper proposes texture descriptor for texture classification called Local Neighbor Differences (LND). LND is a high discriminating texture descriptor and also robust to illumination changes. The proposed descriptor utilizes the sign of differences between surrounding pixels in a local neighborhood. The differences of those pixels are thresholded to form an 8-bit binary codeword. The decimal values of these 8-bit code words are computed and they are called LND values. A histogram of the resulting LND values is created and used as feature to describe the texture information of an image. Experimental results, with respect to texture classification accuracies using OUTEX_TC_00001 test suite has been performed. The results show that LND outperforms LBP method, with average classification accuracies of 92.3% whereas that of local binary patterns (LBP) is 90.7%.

Local Prominent Directional Pattern for Gender Recognition of Facial Photographs and Sketches (Local Prominent Directional Pattern을 이용한 얼굴 사진과 스케치 영상 성별인식 방법)

  • Makhmudkhujaev, Farkhod;Chae, Oksam
    • Convergence Security Journal
    • /
    • v.19 no.2
    • /
    • pp.91-104
    • /
    • 2019
  • In this paper, we present a novel local descriptor, Local Prominent Directional Pattern (LPDP), to represent the description of facial images for gender recognition purpose. To achieve a clearly discriminative representation of local shape, presented method encodes a target pixel with the prominent directional variations in local structure from an analysis of statistics encompassed in the histogram of such directional variations. Use of the statistical information comes from the observation that a local neighboring region, having an edge going through it, demonstrate similar gradient directions, and hence, the prominent accumulations, accumulated from such gradient directions provide a solid base to represent the shape of that local structure. Unlike the sole use of gradient direction of a target pixel in existing methods, our coding scheme selects prominent edge directions accumulated from more samples (e.g., surrounding neighboring pixels), which, in turn, minimizes the effect of noise by suppressing the noisy accumulations of single or fewer samples. In this way, the presented encoding strategy provides the more discriminative shape of local structures while ensuring robustness to subtle changes such as local noise. We conduct extensive experiments on gender recognition datasets containing a wide range of challenges such as illumination, expression, age, and pose variations as well as sketch images, and observe the better performance of LPDP descriptor against existing local descriptors.

Contrast Enhancement based on Gaussian Region Segmentation (가우시안 영역 분리 기반 명암 대비 향상)

  • Shim, Woosung
    • Journal of Broadcast Engineering
    • /
    • v.22 no.5
    • /
    • pp.608-617
    • /
    • 2017
  • Methods of contrast enhancement have problem such as side effect of over-enhancement with non-gaussian histogram distribution, tradeoff enhancement efficiency against brightness preserving. In order to enhance contrast at various histogram distribution, segmentation to region with gaussian distribution and then enhance contrast each region. First, we segment an image into several regions using GMM(Gaussian Mixture Model)fitting by that k-mean clustering and EM(Expectation-Maximization) in $L^*a^*b^*$ color space. As a result region segmentation, we get the region map and probability map. Then we apply local contrast enhancement algorithm that mean shift to minimum overlapping of each region and preserve brightness histogram equalization. Experiment result show that proposed region based contrast enhancement method compare to the conventional method as AMBE(AbsoluteMean Brightness Error) and AE(Average Entropy), brightness is maintained and represented detail information.

Real Time Enhancement of Images Degraded by Bad Weather (악천후로 저하된 영상 화질의 실시간 개선)

  • Kim, Jaemin;Yeon, Sungho
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.2
    • /
    • pp.143-151
    • /
    • 2014
  • In images degraded by bad weather, edges representing object boundaries become weak and faint. In this paper we present an image enhancement method, which increases image visibility by making edges as clear as possible. First, we choose edge candidate regions by finding local maxima and minima in an image intensity field, and then build a histogram using image intensities of pixels located at the two sides of candidate edges. Second, we decompose this histogram into multiple modes, which are determined by local minima in the histogram. Once modes are computed, we find modes connected by edges in the image intensity field and build link chains of connected modes. Finally we choose the longest link chain of modes and make the distances between every connected modes as large as possible. The darkest mode and the brightest mode should be within the image intensity range. This stretch makes edges clear and increases image visibility. Experiments show that the proposed method real-time enhances images degraded by bad weather as good as well known time-consuming methods.

Mixed Noise Removal using Histogram and Pixel Information of Local Mask (히스토그램 및 국부 마스크의 화소 정보를 이용한 복합잡음 제거)

  • Kwon, Se-Ik;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.3
    • /
    • pp.647-653
    • /
    • 2016
  • Recently, the data image processing has been applied to a variety of fields including broadcasting, communication, computer graphics, medicine, and so on. Generally, the image data may develop the noise during their transmission. Therefore, the studies have been actively conducted to remove the noise on the image. There are diverse types of noise on the image including salt and pepper noise, AWGN, and mixed noise. Hence, the filter algorithm for the image recovery was proposed that salt and pepper noise was processed by histogram and spatial weighted values after defining the noise to lessen the impact of mixed noise added in the image, and AWGN was processed by the pixel information of local mask establishing the weighted values in this study. Regarding the processed results by applying Lena images which were corrupted by salt and pepper noise(P=50%) and AWGN(${\sigma}=10$), suggested algorithm showed the improvement by 7.06[dB], 10.90[dB], 5.97[dB] respectively compared with the existing CWMF, A-TMF, AWMF.

Real-time Traffic Sign Recognition using Rotation-invariant Fast Binary Patterns (회전에 강인한 고속 이진패턴을 이용한 실시간 교통 신호 표지판 인식)

  • Hwang, Min-Chul;Ko, Byoung Chul;Nam, Jae-Yeal
    • Journal of Broadcast Engineering
    • /
    • v.21 no.4
    • /
    • pp.562-568
    • /
    • 2016
  • In this paper, we focus on recognition of speed-limit signs among a few types of traffic signs because speed-limit sign is closely related to safe driving of drivers. Although histogram of oriented gradient (HOG) and local binary patterns (LBP) are representative features for object recognition, these features have a weakness with respect to rotation, in that it does not consider the rotation of the target object when generating patterns. Therefore, this paper propose the fast rotation-invariant binary patterns (FRIBP) algorithm to generate a binary pattern that is robust against rotation. The proposed FRIBP algorithm deletes an unused layer of the histogram, and eliminates the shift and comparison operations in order to quickly extract the desired feature. The proposed FRIBP algorithm is successfully applied to German Traffic Sign Recognition Benchmark (GTSRB) datasets, and the results show that the recognition capabilities of the proposed method are similar to those of other methods. Moreover, its recognition speed is considerably enhanced than related works as approximately 0.47second for 12,630 test data.