• Title/Summary/Keyword: Histogram Analysis

Search Result 488, Processing Time 0.027 seconds

Estimation of Maximum Crack Width Using Histogram Analysis in Concrete Structures (히스토그램 분석을 이용한 콘크리트 구조물의 최대 균열 폭 평가)

  • Lee, Seok-Min;Jung, Beom-Seok
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.23 no.7
    • /
    • pp.9-15
    • /
    • 2019
  • The purpose of present study is to assess the maximum width of the surface cracks using the histogram analysis of image processing techniques in concrete structures. For this purpose, the concrete crack image is acquired by the camera. The image is Grayscale coded and Binary coded. After Binary coded image is Dilate and Erode coded, the image is then recognized as separated objects by applying Labeling techniques. Over time, dust and stains may occur naturally on the surface of concrete. The crack image of concrete may include shadows and reflections by lighting depending on a surrounding conditions. In general, concrete cracks occur in a continuous pattern and noise of image appears in the form of shot noises. Bilateral Blurring and Adaptive Threshold apply to the Grayscale image to eliminate these effects. The remaining noises are removed by the object area ratio to the Labeled area. The maximum numbers of pixels and its positions in the crack objects without noises are calculated in x-direction and y-direction by Histogram analysis. The widths of the crack are estimated by trigonometric ratio at the positions of the pixels maximum numbers for the Labeled objects. Finally, the maximum crack width estimated by the proposed method is compared to the crack width measured with the crack gauge. The proposed method by the present study may increase the reliability for the estimation of maximum crack width using image processing techniques in concrete surface images.

A Study on Gesture Recognition using Edge Orientation Histogram and HMM (에지 방향성 히스토그램과 HMM을 이용한 제스처 인식에 관한 연구)

  • Lee, Kee-Jun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.12
    • /
    • pp.2647-2654
    • /
    • 2011
  • In this paper, the algorithm that recognizes the gesture by configuring the feature information obtained through edge orientation histogram and principal component analysis as low dimensional gesture symbol was described. Since the proposed method doesn't require a lot of computations compared to the existing geometric feature based method or appearance based methods and it can maintain high recognition rate by using the minimum information, it is very well suited for real-time system establishment. In addition, to reduce incorrect recognition or recognition errors that occur during gesture recognition, the model feature values projected in the gesture space is configured as a particular status symbol through clustering algorithm to be used as input symbol of hidden Markov models. By doing so, any input gesture will be recognized as the corresponding gesture model with highest probability.

An Evaluative Study on the Content-based Trademark Image Retrieval System Based on Self Organizing Map(SOM) Algorithm (Self Organizing Map(SOM) 알고리즘을 이용한 상표의 내용기반 이미지검색 성능평가에 관한 연구)

  • Paik, Woo-Jin;Lee, Jae-Joon;Shin, Min-Ki;Lee, Eui-Gun;Ham, Eun-Mi;Shin, Moon-Sun
    • Journal of the Korean Society for information Management
    • /
    • v.24 no.3
    • /
    • pp.321-341
    • /
    • 2007
  • It will be possible to prevent the infringement of the trademarks and the insueing disputes regarding the originality of the trademarks by using an efficient content-based trademark image retrieval system. In this paper, we describe a content-based image retrieval system using the Self Organizing Map(SOM) algorithm. The SOM algorithm utilizes the visual features, which were derived from the gray histogram representation of the images. In addition, we made the objective effectiveness evaluation possible by coming up with a quantitative measure to gauge the effectiveness of the content-based image retrieval system.

An Analysis of Luminance Histogram and Correlation of Motion Vector for Unsuitable Frames for Frame Rate Up Conversion (프레임율 상향 변환에 부적합한 프레임들에 대한 밝기값 히스토그램과 모션 벡터 상관성 분석)

  • Kim, Sangchul;Nang, Jongho
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.10
    • /
    • pp.532-536
    • /
    • 2016
  • Frame Rate Up Conversion (FRUC) generate interpolated frames between existing frames using motion estimation and motion compensation interpolation considering temporal redundancy. Falsely-estimated FRUC, however, can generate poor quality frames because FRUC typically uses blending-based interpolation method. As skipping an interpolating process between frames generate mis-estimated motion vectors, could improve Quality of Services of FRUC. In this Paper we analyze luminance histogram and motion vector consistency in frames generating poor quality interpolated frames. We conclude these features could help to be a clue in classifying the frames, which often result in the poor quality of FRUC results through the analysis and experiment.

Development of a Recognition System of Smile Facial Expression for Smile Treatment Training (웃음 치료 훈련을 위한 웃음 표정 인식 시스템 개발)

  • Li, Yu-Jie;Kang, Sun-Kyung;Kim, Young-Un;Jung, Sung-Tae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.4
    • /
    • pp.47-55
    • /
    • 2010
  • In this paper, we proposed a recognition system of smile facial expression for smile treatment training. The proposed system detects face candidate regions by using Haar-like features from camera images. After that, it verifies if the detected face candidate region is a face or non-face by using SVM(Support Vector Machine) classification. For the detected face image, it applies illumination normalization based on histogram matching in order to minimize the effect of illumination change. In the facial expression recognition step, it computes facial feature vector by using PCA(Principal Component Analysis) and recognizes smile expression by using a multilayer perceptron artificial network. The proposed system let the user train smile expression by recognizing the user's smile expression in real-time and displaying the amount of smile expression. Experimental result show that the proposed system improve the correct recognition rate by using face region verification based on SVM and using illumination normalization based on histogram matching.

Image Segmentation of Teeth Region by Color Image Analysis (컬러 영상 분할 기법을 활용한 치아 영역 자동 검출)

  • Lee, Seong-Taek;Kim, Kyeong-Seop;Yoon, Tae-Ho;Kim, Kee-Deog;Park, Won-Se
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.6
    • /
    • pp.1207-1214
    • /
    • 2009
  • In this study, we propose a novel color-image segmentation algorithm to discern the teeth region utilizing RG intensity and its relevant RGB histogram features with resolving the variations of its maximum intensity in terms of peaks and valleys. Tooth candidates in a CCD image are first extracted by applying RGB color multi-threshold levels and consequently the successive morphological image operations and a Sobel-mask edge processing are performed to resolve the teeth region and its contour.

Segmentation of Millimeter-wave Radiometer Image via Classuncertainty and Region-homogeneity

  • Singh, Manoj Kumar;Tiwary, U.S.;Kim, Yong-Hoon
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.862-864
    • /
    • 2003
  • Thresholding is a popular image segmentation method that converts a gray-level image into a binary image. The selection of optimum threshold has remained a challenge over decades. Many image segmentation techniques are developed using information about image in other space rather than the image space itself. Most of the technique based on histogram analysis information-theoretic approaches. In this paper, the criterion function for finding optimal threshold is developed using an intensity-based classuncertainty (a histogram-based property of an image) and region-homogeneity (an image morphology-based property). The theory of the optimum thresholding method is based on postulates that objects manifest themselves with fuzzy boundaries in any digital image acquired by an imaging device. The performance of the proposed method is illustrated on experimental data obtained by W-band millimeter-wave radiometer image under different noise level.

  • PDF

3-D Analysis and Inspection of Surface Mounted Solder Pastes by Point-to-Surface (가변 구속상자를 이용한 점-표면배정방법에 의한 표면실장 솔거페이스트의 삼차원 해석 및 검사)

  • 신동원
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.20 no.3
    • /
    • pp.210-220
    • /
    • 2003
  • This work presents a method of point to surface assignment fur 3D metrology of solder pastes on PCB. A bounding box enclosing the solder paste tightly on all sides is introduced to avoid incorrect assignment. The shape of bounding box fur solder paste brick is variable according to geometry of measured points. The surface geometry of bounding box is obtained by using five peaks selected in the histogram of normalized gradient vectors. By using the bounding box enclosing the solder pastes, the task of point-to-surface assignment has been successfully conducted, then geometrical features are obtained through the task of surface fitting.

An Experimental Analysis of High Dynamic Range Algorithm for Image Signal Processor (Image Signal Processor 를 위한 High Dynamic Range Algorithm 성능 분석 연구)

  • Chan-Hwi Lim;Seok-In Hong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2024.05a
    • /
    • pp.18-19
    • /
    • 2024
  • High Dynamic Range 는 디지털 카메라에 내장된 영상 보정 장치인 Image Signal Processor 의 주요 기능 중 하나로서, 영상의 밝고 어두운 정도의 범위를 넓혀, 피사체가 더 또렷하게 보이도록 한다. 초당 수십 프레임을 촬영하는 경우, 실시간 보정처리를 위해 ISP 에 사용되는 기능 및 알고리즘은 신속성과 효율성이 요구된다. 본 연구는 ISP 에 적합한 HDR 알고리즘을 선정을 목표로 하여, Histogram Equalization 과 Contrast Limited Adaptive Histogram Equalization 을 소개한다. 이어 해당 알고리즘들을 컴퓨터 프로그래밍으로 구현, CMOS 이미지 센서를 통해 추출한 raw image 를 보정하여 각 알고리즘의 성능을 검토하였다.

Reversible DNA Information Hiding based on Circular Histogram Shifting (순환형 히스토그램 쉬프팅 기반 가역성 DNA 정보은닉 기법)

  • Lee, Suk-Hwan;Kwon, Seong-Geun;Kwon, Ki-Ryong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.12
    • /
    • pp.67-75
    • /
    • 2016
  • DNA computing technology makes the interests on DNA storage and DNA watermarking / steganography that use the DNA information as a newly medium. DNA watermarking that embeds the external watermark into DNA information without the biological mutation needs the reversibility for the perfect recovery of host DNA, the continuous embedding and detecting processing, and the mutation analysis by the watermark. In this paper, we propose a reversible DNA watermarking based on circular histogram shifting of DNA code values with the prevention of false start codon, the preservation of DNA sequence length, and the high watermark capacity, and the blind detection. Our method has the following features. The first is to encode nucleotide bases of 4-character variable to integer code values by code order. It makes the signal processing of DNA sequence easy. The second is to embed the multiple bits of watermark into -order coded value by using circular histogram shifting. The third is to check the possibility of false start codon in the inter or intra code values. Experimental results verified the our method has higher watermark capacity 0.11~0.50 bpn than conventional methods and also the false start codon has not happened in our method.