• Title/Summary/Keyword: histogram equalization

Search Result 277, Processing Time 0.022 seconds

Application of Texture Features algorithm using Computer Aided Diagnosis of Papillary Thyroid Cancer in the Ultrasonography (초음파영상에서 갑상선 결절의 컴퓨터자동진단을 위한 Texture Features 알고리즘 응용)

  • Ko, Seong-Jin;Lee, Jin-Soo;Ye, Soo-Young;Kim, Changsoo
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.5
    • /
    • pp.303-310
    • /
    • 2013
  • Thyroid nodular disease is the most frequently appeared in thyroid disease. Thyroid ultrasonography offers location of nodules, size, the number, information of internal echo characteristic. Thus, it makes possible to sort high-risk nodule containing high possibility about thyroid cancer and to induct precisely when take a Fine Needle Biopsy Aspiration. On thyroid nodule, the case which is diagnosed as malignant is less than 5% but screening test is very important on ultrasound and also must be reduced unnecessary procedure. Therefore, in this study an approach for describing a region is to quantity its texture content. We applied TFA algorithm on case which has been pathologically diagnosed as papillary thyroid cancer. we obtained experiment image which set the ROI on ultrasound and cut the $50{\times}50$ pixel size, histogram equalization. Consequently, Disease recognition detection efficiency of GLavg, SKEW, UN, ENT parameter were high as 91~100%. It is suggestion about possibility on CAD which distinguishes thyroid nodule. In addition, it will be helpful to differential diagnosis of thyroid nodule. If the study on additional parameter algorithm is continuously progressed from now on, it is able to arrange practical base on CAD and it is possible to apply various disease in the thyroid US.

A New Face Tracking and Recognition Method Adapted to the Environment (환경에 적응적인 얼굴 추적 및 인식 방법)

  • Ju, Myung-Ho;Kang, Hang-Bong
    • The KIPS Transactions:PartB
    • /
    • v.16B no.5
    • /
    • pp.385-394
    • /
    • 2009
  • Face tracking and recognition are difficult problems because the face is a non-rigid object. The main reasons for the failure to track and recognize the faces are the changes of a face pose and environmental illumination. To solve these problems, we propose a nonlinear manifold framework for the face pose and the face illumination normalization processing. Specifically, to track and recognize a face on the video that has various pose variations, we approximate a face pose density to single Gaussian density by PCA(Principle Component Analysis) using images sampled from training video sequences and then construct the GMM(Gaussian Mixture Model) for each person. To solve the illumination problem for the face tracking and recognition, we decompose the face images into the reflectance and the illuminance using the SSR(Single Scale Retinex) model. To obtain the normalized reflectance, the reflectance is rescaled by histogram equalization on the defined range. We newly approximate the illuminance by the trained manifold since the illuminance has almost variations by illumination. By combining these two features into our manifold framework, we derived the efficient face tracking and recognition results on indoor and outdoor video. To improve the video based tracking results, we update the weights of each face pose density at each frame by the tracking result at the previous frame using EM algorithm. Our experimental results show that our method is more efficient than other methods.

Design of Optimized RBFNNs based on Night Vision Face Recognition Simulator Using the 2D2 PCA Algorithm ((2D)2 PCA알고리즘을 이용한 최적 RBFNNs 기반 나이트비전 얼굴인식 시뮬레이터 설계)

  • Jang, Byoung-Hee;Kim, Hyun-Ki;Oh, Sung-Kwun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.1
    • /
    • pp.1-6
    • /
    • 2014
  • In this study, we propose optimized RBFNNs based on night vision face recognition simulator with the aid of $(2D)^2$ PCA algorithm. It is difficult to obtain the night image for performing face recognition due to low brightness in case of image acquired through CCD camera at night. For this reason, a night vision camera is used to get images at night. Ada-Boost algorithm is also used for the detection of face images on both face and non-face image area. And the minimization of distortion phenomenon of the images is carried out by using the histogram equalization. These high-dimensional images are reduced to low-dimensional images by using $(2D)^2$ PCA algorithm. Face recognition is performed through polynomial-based RBFNNs classifier, and the essential design parameters of the classifiers are optimized by means of Differential Evolution(DE). The performance evaluation of the optimized RBFNNs based on $(2D)^2$ PCA is carried out with the aid of night vision face recognition system and IC&CI Lab data.

Design of Optimized pRBFNNs-based Face Recognition Algorithm Using Two-dimensional Image and ASM Algorithm (최적 pRBFNNs 패턴분류기 기반 2차원 영상과 ASM 알고리즘을 이용한 얼굴인식 알고리즘 설계)

  • Oh, Sung-Kwun;Ma, Chang-Min;Yoo, Sung-Hoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.6
    • /
    • pp.749-754
    • /
    • 2011
  • In this study, we propose the design of optimized pRBFNNs-based face recognition system using two-dimensional Image and ASM algorithm. usually the existing 2 dimensional face recognition methods have the effects of the scale change of the image, position variation or the backgrounds of an image. In this paper, the face region information obtained from the detected face region is used for the compensation of these defects. In this paper, we use a CCD camera to obtain a picture frame directly. By using histogram equalization method, we can partially enhance the distorted image influenced by natural as well as artificial illumination. AdaBoost algorithm is used for the detection of face image between face and non-face image area. We can butt up personal profile by extracting the both face contour and shape using ASM(Active Shape Model) and then reduce dimension of image data using PCA. The proposed pRBFNNs consists of three functional modules such as the condition part, the conclusion part, and the inference part. In the condition part of fuzzy rules, input space is partitioned with Fuzzy C-Means clustering. In the conclusion part of rules, the connection weight of RBFNNs is represented as three kinds of polynomials such as constant, linear, and quadratic. The essential design parameters (including learning rate, momentum coefficient and fuzzification coefficient) of the networks are optimized by means of Differential Evolution. The proposed pRBFNNs are applied to real-time face image database and then demonstrated from viewpoint of the output performance and recognition rate.

An Algorithm of Welding Bead Detection and Evaluation Using and Multiple Filters Geodesic Active Contour (다중필터와 축지적 활성 윤곽선 알고리즘을 이용한 용접 비드 검출 및 판단 알고리즘)

  • Milyahilu, John;Kim, Young-Bong;Lee, Jae Eun;Kim, Jong-Nam
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.22 no.3
    • /
    • pp.141-148
    • /
    • 2021
  • In this paper, we propose an algorithm of welding bead detection and evaluation using geodesic active contour algorithm and high pass filter with image processing technique. The algorithm uses histogram equalization and high pass filter as gaussian filter to improve contrast. The image processing techniques smoothens the welding beads reduce the noise on an image. Then, the algorithm detects the welding bead area by applying the geodesic active contour algorithm and morphological ooperation. It also applies the balloon force that either inflates in, or deflates out the evolving contour for a better segmentation. After that, we propose a method for determining the quality of welding bead using effective length and width of the detected bead. In the experiments, our algorithm achieved the highest recall, precision, F-measure and IOU as 0.9894, 0.9668, 0.9780, and 0.8957 respectively. We compared the proposed algorithm with the conventional algorithms to evaluate the performance of the proposed algorithm. The proposed algorithm achieved better performance compared to the conventional ones with a maximum computational time of 0.6 seconds for segmenting and evaluating one welding bead.

Application Feasibility Study of Non-local Means Algorithm in a Miniaturized Vein Near-infrared Imaging System (정맥 관찰용 소형 근적외선 영상 시스템에서의 비지역적평균 알고리즘 적용 가능성 연구)

  • Hyun-Woo Jeong;Youngjin Lee
    • Journal of the Korean Society of Radiology
    • /
    • v.17 no.5
    • /
    • pp.679-684
    • /
    • 2023
  • Venous puncture is widely used to obtain blood samples for pathological examination. Because the invasive venipuncture method using a needle is repeatedly performed, the pain suffered by the patient increases, so our research team pre-developed a miniaturized near-infrared (NIR) imaging system in advance. To improve the image quality of the acquired NIR images, this study aims to model the non-local means (NLM) algorithm, which is well known to be efficient in noise reduction, and analyze its applicability in the system. The developed NIR imaging system is based on the principle that infrared rays pass through dichroic and long-pass filters and are detected by a CMOS sensor module. The proposed NLM algorithm is modeled based on the principle of replacing the pixel from which noise is to be removed with a value that reflects the distances between surrounding pixels. After acquiring an NIR image with a central wavelength of 850 nm, the NLM algorithm was applied to segment the final vein area through histogram equalization. As a result, the coefficient of variation of the NIR image of the vein using the NLM algorithm was 0.247 on average, which was an excellent result compared to conventional filtering methods. In addition, the dice similarity coefficient value of the NLM algorithm was improved by 62.91 and 9.40%, respectively, compared to the median filter and total variation methods. In conclusion, we demonstrated that the NLM algorithm can acquire accurate segmentation of veins acquired with a NIR imaging system.

Wavelet Transform-based Face Detection for Real-time Applications (실시간 응용을 위한 웨이블릿 변환 기반의 얼굴 검출)

  • 송해진;고병철;변혜란
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.9
    • /
    • pp.829-842
    • /
    • 2003
  • In this Paper, we propose the new face detection and tracking method based on template matching for real-time applications such as, teleconference, telecommunication, front stage of surveillance system using face recognition, and video-phone applications. Since the main purpose of paper is to track a face regardless of various environments, we use template-based face tracking method. To generate robust face templates, we apply wavelet transform to the average face image and extract three types of wavelet template from transformed low-resolution average face. However template matching is generally sensitive to the change of illumination conditions, we apply Min-max normalization with histogram equalization according to the variation of intensity. Tracking method is also applied to reduce the computation time and predict precise face candidate region. Finally, facial components are also detected and from the relative distance of two eyes, we estimate the size of facial ellipse.