• Title/Summary/Keyword: constant learning rate

Search Result 51, Processing Time 0.029 seconds

An Improved Adaptive Background Mixture Model for Real-time Object Tracking based on Background Subtraction (배경 분리 기반의 실시간 객체 추적을 위한 개선된 적응적 배경 혼합 모델)

  • Kim Young-Ju
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.6 s.38
    • /
    • pp.187-194
    • /
    • 2005
  • The background subtraction method is mainly used for the real-time extraction and tracking of moving objects from image sequences. In the outdoor environment, there are many changeable environment factors such as gradually changing illumination, swaying trees and suddenly moving objects , which are to be considered for an adaptive processing. Normally, GMM(Gaussian Mixture Model) is used to subtract the background by considering adaptively the various changes in the scenes, and the adaptive GMMs improving the real-time Performance were Proposed and worked. This paper, for on-line background subtraction, employed the improved adaptive GMM, which uses the small constant for learning rate a and is not able to speedily adapt the suddenly movement of objects, So, this paper Proposed and evaluated the dynamic control method of a using the adaptive selection of the number of component distributions and the global variances of pixel values.

  • PDF

Facial Image Recognition Based on Wavelet Transform and Neural Networks (웨이브렛 변환과 신경망 기반 얼굴 인식)

  • 임춘환;이상훈;편석범
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.37 no.3
    • /
    • pp.104-113
    • /
    • 2000
  • In this study, we propose facial image recognition based on wavelet transform and neural network. This algorithm is proposed by following processes. First, two gray level images is captured in constant illumination and, after removing input image noise using a gaussian filter, differential image is obtained between background and face input image, and this image has a process of erosion and dilation. Second, a mask is made from dilation image and background and facial image is divided by projecting the mask into face input image Then, characteristic area of square shape that consists of eyes, a nose, a mouth, eyebrows and cheeks is detected by searching the edge of divided face image. Finally, after characteristic vectors are extracted from performing discrete wavelet transform(DWT) of this characteristic area and is normalized, normalized vectors become neural network input vectors. And recognition processing is performed based on neural network learning. Simulation results show recognition rate of 100 % about learned image and 92% about unlearned image.

  • PDF

The Design of Polynomial RBF Neural Network by Means of Fuzzy Inference System and Its Optimization (퍼지추론 기반 다항식 RBF 뉴럴 네트워크의 설계 및 최적화)

  • Baek, Jin-Yeol;Park, Byaung-Jun;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.2
    • /
    • pp.399-406
    • /
    • 2009
  • In this study, Polynomial Radial Basis Function Neural Network(pRBFNN) based on Fuzzy Inference System is designed and its parameters such as learning rate, momentum coefficient, and distributed weight (width of RBF) are optimized by means of Particle Swarm Optimization. The proposed model can be expressed as three functional module that consists of condition part, conclusion part, and inference part in the viewpoint of fuzzy rule formed in 'If-then'. In the condition part of pRBFNN as a fuzzy rule, input space is partitioned by defining kernel functions (RBFs). Here, the structure of kernel functions, namely, RBF is generated from HCM clustering algorithm. We use Gaussian type and Inverse multiquadratic type as a RBF. Besides these types of RBF, Conic RBF is also proposed and used as a kernel function. Also, in order to reflect the characteristic of dataset when partitioning input space, we consider the width of RBF defined by standard deviation of dataset. In the conclusion part, the connection weights of pRBFNN are represented as a polynomial which is the extended structure of the general RBF neural network with constant as a connection weights. Finally, the output of model is decided by the fuzzy inference of the inference part of pRBFNN. In order to evaluate the proposed model, nonlinear function with 2 inputs, waster water dataset and gas furnace time series dataset are used and the results of pRBFNN are compared with some previous models. Approximation as well as generalization abilities are discussed with these results.

Development of Improvement Effect Prediction System of C.G.S Method based on Artificial Neural Network (인공신경망을 기반으로 한 C.G.S 공법의 개량효과 예측시스템 개발)

  • Kim, Jeonghoon;Hong, Jongouk;Byun, Yoseph;Jung, Euiyoup;Seo, Seokhyun;Chun, Byungsik
    • Journal of the Korean GEO-environmental Society
    • /
    • v.14 no.9
    • /
    • pp.31-37
    • /
    • 2013
  • In this study installation diameter, interval, area replacement ratio and ground hardness of applicable ground in C.G.S method should be mastered through surrounding ground by conducting modeling. Optimum artificial neural network was selected through the study of the parameter of artificial neural network and prediction model was developed by the relationship with numerical analysis and artificial neural network. As this result, C.G.S pile settlement and ground settlement were found to be equal in terms of diameter, interval, area replacement ratio and ground hardness, presented in a single curve, which means that the behavior pattern of applied ground in C.G.S method was presented as some form, and based on such a result, learning the artificial neural network for 3D behavior was found to be possible. As the study results of artificial neural network internal factor, when using the number of neural in hidden layer 10, momentum constant 0.2 and learning rate 0.2, relationship between input and output was expressed properly. As a result of evaluating the ground behavior of C.G.S method which was applied to using such optimum structure of artificial neural network model, is that determination coefficient in case of C.G.S pile settlement was 0.8737, in case of ground settlement was 0.7339 and in case of ground heaving was 0.7212, sufficient reliability was known.

A Design on Face Recognition System Based on pRBFNNs by Obtaining Real Time Image (실시간 이미지 획득을 통한 pRBFNNs 기반 얼굴인식 시스템 설계)

  • Oh, Sung-Kwun;Seok, Jin-Wook;Kim, Ki-Sang;Kim, Hyun-Ki
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.12
    • /
    • pp.1150-1158
    • /
    • 2010
  • In this study, the Polynomial-based Radial Basis Function Neural Networks is proposed as one of the recognition part of overall face recognition system that consists of two parts such as the preprocessing part and recognition part. The design methodology and procedure of the proposed pRBFNNs are presented to obtain the solution to high-dimensional pattern recognition problem. First, in preprocessing part, we use a CCD camera to obtain a picture frame in real-time. By using histogram equalization method, we can partially enhance the distorted image influenced by natural as well as artificial illumination. We use an AdaBoost algorithm proposed by Viola and Jones, which is exploited for the detection of facial image area between face and non-facial image area. As the feature extraction algorithm, PCA method is used. In this study, the PCA method, which is a feature extraction algorithm, is used to carry out the dimension reduction of facial image area formed by high-dimensional information. Secondly, we use pRBFNNs to identify the ID by recognizing unique pattern of each person. The proposed pRBFNNs architecture consists of three functional modules such as the condition part, the conclusion part, and the inference part as fuzzy rules formed in 'If-then' format. 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 pRBFNNs is represented as three kinds of polynomials such as constant, linear, and quadratic. Coefficients of connection weight identified with back-propagation using gradient descent method. The output of pRBFNNs model is obtained by fuzzy inference method in the inference part of fuzzy rules. The essential design parameters (including learning rate, momentum coefficient and fuzzification coefficient) of the networks are optimized by means of the Particle Swarm Optimization. The proposed pRBFNNs are applied to real-time face recognition system and then demonstrated from the viewpoint of output performance and recognition rate.

A Study on Improved Image Matching Method using the CUDA Computing (CUDA 연산을 이용한 개선된 영상 매칭 방법에 관한 연구)

  • Cho, Kyeongrae;Park, Byungjoon;Yoon, Taebok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.4
    • /
    • pp.2749-2756
    • /
    • 2015
  • Recently, Depending on the quality of data increases, the problem of time-consuming to process the image is raised by being required to accelerate the image processing algorithms, in a traditional CPU and CUDA(Compute Unified Device Architecture) based recognition system for computing speed and performance gains compared to OpenMP When character recognition has been learned by the system to measure the input by the character data matching is implemented in an environment that recognizes the region of the well, so that the font of the characters image learning English alphabet are each constant and standardized in size and character an image matching method for calculating the matching has also been implemented. GPGPU (General Purpose GPU) programming platform technology when using the CUDA computing techniques to recognize and use the four cores of Intel i5 2500 with OpenMP to deal quickly and efficiently an algorithm, than the performance of existing CPU does not produce the rate of four times due to the delay of the data of the partition and merge operation proposed a method of improving the rate of speed of about 3.2 times, and the parallel processing of the video card that processes a result, the sequential operation of the process compared to CPU-based who performed the performance gain is about 21 tiems improvement in was confirmed.

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.

Laparoscopic Assisted Total Gastrectomy (LATG) with Extracorporeal Anastomosis and using Circular Stapler for Middle or Upper Early Gastric Carcinoma: Reviews of Single Surgeon's Experience of 48 Consecutive Patients (원형 자동문합기를 이용한 체외문합을 시행한 복강경 보조 위전절제술: 한 술자에 의한 연속적인 48명 환자의 수술성적분석)

  • Cheong, Oh;Kim, Byung-Sik;Yook, Jeong-Hwan;Oh, Sung-Tae;Lim, Jeong-Taek;Kim, Kab-Jung;Choi, Ji-Eun;Park, Gun-Chun
    • Journal of Gastric Cancer
    • /
    • v.8 no.1
    • /
    • pp.27-34
    • /
    • 2008
  • Purpose: Many recent studies have reported on the feasibility and usefulness of laparoscopy assisted distal gastrectomy (LADG) for treating early gastric cancer. On the other hand, there has been few reports about laparoscopy assisted total gastrectomy (LATG) because upper located gastric cancer is relatively rare and the surgical technique is more difficult than that for LADG, We now present our procedure and results of performing LATG for the gastric cancer located in the upper or middle portion of the stomach. Materials and Methods: From Jan 2005 to Sep 2007, 96 patients underwent LATG by four surgeons at the Asan Medical Center, Seoul, Korea. Among them, 48 consecutive patients who were operated on by asingle surgeon were analyzed with respect to the clinicopathological features, the surgical results and the postoperative courses with using the prospectively collected laparoscopy surgery data. Results: There was no conversion to open surgery during LATG. For all the reconstructions, Roux-en Y esophago-jejunostomy and D1+beta lymphadenectomy were the standard procedures. The mean operation time was $212{\pm}67$ minutes. The mean total number of retrieved lymph nodes was $28.9{\pm}10.54$ (range: $12{\sim}64$) and all the patients had a clear proximal resection margin in their final pathologic reports. The mean time to passing gas, first oral feeding and discharge from the hospital was 2.98, 3.67 and 7.08 days, respectively. There were 5 surgical complications and 2 non-surgical complications for 5 (10.4%) patients, and there was no mortality. None of the patients needed operation because of complications and they recovered with conservative treatments. The mean operation time remained constant after 20 cases and so a learning curve was present. The morbidity rate was not different between the two periods, but the postoperative course was significantly better after the learning curve. Analysis of the factors contributing to the postoperative morbidity, with using logistic regression analysis, showed that the 8MI is the only contributing factor forpostoperative complications (P=0.029, HR=2.513, 95% CI=1.097-5.755). Conclusions: LATG with regional lymph node dissection for upper and middle early gastric cancer is considered to be a safe, feasible method that showed an excellent postoperative course and acceptable morbidity. BMI should be considered in the patient selection at the beginning period because of the impact of the BMI on the postoperative morbidity.

  • PDF

Derivation of Green Coverage Ratio Based on Deep Learning Using MAV and UAV Aerial Images (유·무인 항공영상을 이용한 심층학습 기반 녹피율 산정)

  • Han, Seungyeon;Lee, Impyeong
    • Korean Journal of Remote Sensing
    • /
    • v.37 no.6_1
    • /
    • pp.1757-1766
    • /
    • 2021
  • The green coverage ratio is the ratio of the land area to green coverage area, and it is used as a practical urban greening index. The green coverage ratio is calculated based on the land cover map, but low spatial resolution and inconsistent production cycle of land cover map make it difficult to calculate the correct green coverage area and analyze the precise green coverage. Therefore, this study proposes a new method to calculate green coverage area using aerial images and deep neural networks. Green coverage ratio can be quickly calculated using manned aerial images acquired by local governments, but precise analysis is difficult because components of image such as acquisition date, resolution, and sensors cannot be selected and modified. This limitation can be supplemented by using an unmanned aerial vehicle that can mount various sensors and acquire high-resolution images due to low-altitude flight. In this study, we proposed a method to calculate green coverage ratio from manned or unmanned aerial images, and experimentally verified the proposed method. Aerial images enable precise analysis by high resolution and relatively constant cycles, and deep learning can automatically detect green coverage area in aerial images. Local governments acquire manned aerial images for various purposes every year and we can utilize them to calculate green coverage ratio quickly. However, acquired manned aerial images may be difficult to accurately analyze because details such as acquisition date, resolution, and sensors cannot be selected. These limitations can be supplemented by using unmanned aerial vehicles that can mount various sensors and acquire high-resolution images due to low-altitude flight. Accordingly, the green coverage ratio was calculated from the two aerial images, and as a result, it could be calculated with high accuracy from all green types. However, the green coverage ratio calculated from manned aerial images had limitations in complex environments. The unmanned aerial images used to compensate for this were able to calculate a high accuracy of green coverage ratio even in complex environments, and more precise green area detection was possible through additional band images. In the future, it is expected that the rust rate can be calculated effectively by using the newly acquired unmanned aerial imagery supplementary to the existing manned aerial imagery.

Fuzzy sliding mode controller design for improving the learning rate (퍼지 슬라이딩 모드의 속도 향상을 위한 제어기 설계)

  • Hwang, Eun-Ju;Cho, Young-Wan;Kim, Eun-Tai;Park, Mignon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.6
    • /
    • pp.747-752
    • /
    • 2006
  • In this paper, the adaptive fuzzy sliding mode controller with two systems is designed. The existing sliding mode controller used to $approximation{\^{u}}(t)$ with discrete sgn function and sat function for keeping the state trajectories on the sliding surface[1]. The proposed controller decrease the disturbance for uncertain control gain and This paper is concerned with an Adaptive Fuzzy Sliding Mode Control(AFSMC) that the fuzzy systems ate used to approximate the unknown functions of nonlinear system. In the adaptive fuzzy system, we adopt the adaptive law to approximate the dynamics of the nonlinear plant and to adjust the parameters of AFSMC. The stability of the suggested control system is proved via Lyapunov stability theorem, and convergence and robustness properties ate demonstrated. Futhermore, fuzzy tuning improve tracking abilities by changing some sliding conditions. In the traditional sliding mode control, ${\eta}$ is a positive constant. The increase of ${\eta}$ has led to a significant decrease in the rise time. However, this has resulted in higher overshoot. Therefore the proposed ${\eta}$ tuning AFSMC improve the performances, so that the controller can track the trajectories faster and more exactly than ordinary controller. The simulation results demonstrate that the performance is improved and the system also exhibits stability.