• Title/Summary/Keyword: vector algorithm

Search Result 3,108, Processing Time 0.026 seconds

Self-Diagnosing Disease Classification System for Oriental Medical Science with Refined Fuzzy ART Algorithm (Refined Fuzzy ART 알고리즘을 이용한 한방 자가 질병 분류 시스템)

  • Kim, Kwang-Baek
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.7
    • /
    • pp.1-8
    • /
    • 2009
  • In this paper, we propose a home medical system that integrates a self-diagnosing disease classification system and a tele-consulting system by communication technology. The proposed disease classification system supports to self-diagnose the health condition based on oriental medical science using fuzzy neural network algorithm. The prepared database includes 72 different diseases and their associated symptoms based on a famous medical science book "Dong-eui-bo-gam". The proposed system extracts three most prospective diseases from user's symptoms by analyzing disease database with fuzzy neural network technology. Technically, user's symptoms are used as an input vector and the clustering algorithm based upon a fuzzy neural network is performed. The degree of fuzzy membership is computed for each probable cluster and the system infers the three most prospective diseases with their degree of membership. Such information should be sent to medical doctors via our tele-consulting system module. Finally a user can take an appropriate consultation via video images by a medical doctor. Oriental medical doctors verified the accuracy of disease diagnosing ability and the efficacy of overall system's plausibility in the real world.

Adaptive Vehicle License Plate Recognition System Using Projected Plane Convolution and Decision Tree Classifier (투영면 컨벌루션과 결정트리를 이용한 상태 적응적 차량번호판 인식 시스템)

  • Lee Eung-Joo;Lee Su Hyun;Kim Sung-Jin
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.11
    • /
    • pp.1496-1509
    • /
    • 2005
  • In this paper, an adaptive license plate recognition system which detects and recognizes license plate at real-time by using projected plane convolution and Decision Tree Classifier is proposed. And it was tested in circumstances which presence of complex background. Generally, in expressway tollgate or gateway of parking lots, it is very difficult to detect and segment license plate because of size, entry angle and noisy problem of vehicles due to CCD camera and road environment. In the proposed algorithm, we suggested to extract license plate candidate region after going through image acquisition process with inputted real-time image, and then to compensate license size as well as gradient of vehicle with change of vehicle entry position. The proposed algorithm can exactly detect license plate using accumulated edge, projected convolution and chain code labeling method. And it also segments letter of license plate using adaptive binary method. And then, it recognizes license plate letter by applying hybrid pattern vector method. Experimental results show that the proposed algorithm can recognize the front and rear direction license plate at real-time in the presence of complex background environments. Accordingly license plate detection rate displayed $98.8\%$ and $96.5\%$ successive rate respectively. And also, from the segmented letters, it shows $97.3\%$ and $96\%$ successive recognition rate respectively.

  • PDF

Tuple Pruning Using Bloom Filter for Packet Classification (패킷 분류를 위한 블룸 필터 이용 튜플 제거 알고리즘)

  • Kim, So-Yeon;Lim, Hye-Sook
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.3
    • /
    • pp.175-186
    • /
    • 2010
  • Due to the emergence of new application programs and the fast growth of Internet users, Internet routers are required to provide the quality of services according to the class of input packets, which is identified by wire-speed packet classification. For a pre-defined rule set, by performing multi-dimensional search using various header fields of an input packet, packet classification determines the highest priority rule matching to the input packet. Efficient packet classification algorithms have been widely studied. Tuple pruning algorithm provides fast classification performance using hash-based search against the candidate tuples that may include matching rules. Bloom filter is an efficient data structure composed of a bit vector which represents the membership information of each element included in a given set. It is used as a pre-filter determining whether a specific input is a member of a set or not. This paper proposes new tuple pruning algorithms using Bloom filters, which effectively remove unnecessary tuples which do not include matching rules. Using the database known to be similar to actual rule sets used in Internet routers, simulation results show that the proposed tuple pruning algorithm provides faster packet classification as well as consumes smaller memory amount compared with the previous tuple pruning algorithm.

Fast Analysis of Fractal Antenna by Using FMM (FMM에 의한 프랙탈 안테나 고속 해석)

  • Kim, Yo-Sik;Lee, Kwang-Jae;Kim, Kun-Woo;Oh, Kyung-Hyun;Lee, Taek-Kyung;Lee, Jae-Wook
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.19 no.2
    • /
    • pp.121-129
    • /
    • 2008
  • In this paper, we present a fast analysis of multilayer microstrip fractal structure by using the fast multipole method (FMM). In the analysis, accurate spatial green's functions from the real-axis integration method(RAIM) are employed to solve the mixed potential integral equation(MPIE) with FMM algorithm. MoM's iteration and memory requirement is $O(N^2)$ in case of calculation using the green function. the problem is the unknown number N can be extremely large for calculation of large scale objects and high accuracy. To improve these problem is fast algorithm FMM. FMM use the addition theorem of green function. So, it reduce the complexity of a matrix-vector multiplication and reduce the cost of calculation to the order of $O(N^{1.5})$, The efficiency is proved from comparing calculation results of the moment method and Fast algorithm.

Detecting near-duplication Video Using Motion and Image Pattern Descriptor (움직임과 영상 패턴 서술자를 이용한 중복 동영상 검출)

  • Jin, Ju-Kyong;Na, Sang-Il;Jenong, Dong-Seok
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.4
    • /
    • pp.107-115
    • /
    • 2011
  • In this paper, we proposed fast and efficient algorithm for detecting near-duplication based on content based retrieval in large scale video database. For handling large amounts of video easily, we split the video into small segment using scene change detection. In case of video services and copyright related business models, it is need to technology that detect near-duplicates, that longer matched video than to search video containing short part or a frame of original. To detect near-duplicate video, we proposed motion distribution and frame descriptor in a video segment. The motion distribution descriptor is constructed by obtaining motion vector from macro blocks during the video decoding process. When matching between descriptors, we use the motion distribution descriptor as filtering to improving matching speed. However, motion distribution has low discriminability. To improve discrimination, we decide to identification using frame descriptor extracted from selected representative frames within a scene segmentation. The proposed algorithm shows high success rate and low false alarm rate. In addition, the matching speed of this descriptor is very fast, we confirm this algorithm can be useful to practical application.

Traffic Sign Recognition using SVM and Decision Tree for Poor Driving Environment (SVM과 의사결정트리를 이용한 열악한 환경에서의 교통표지판 인식 알고리즘)

  • Jo, Young-Bae;Na, Won-Seob;Eom, Sung-Je;Jeong, Yong-Jin
    • Journal of IKEEE
    • /
    • v.18 no.4
    • /
    • pp.485-494
    • /
    • 2014
  • Traffic Sign Recognition(TSR) is an important element in an Advanced Driver Assistance System(ADAS). However, many studies related to TSR approaches only in normal daytime environment because a sign's unique color doesn't appear in poor environment such as night time, snow, rain or fog. In this paper, we propose a new TSR algorithm based on machine learning for daytime as well as poor environment. In poor environment, traditional methods which use RGB color region doesn't show good performance. So we extracted sign characteristics using HoG extraction, and detected signs using a Support Vector Machine(SVM). The detected sign is recognized by a decision tree based on 25 reference points in a Normalized RGB system. The detection rate of the proposed system is 96.4% and the recognition rate is 94% when applied in poor environment. The testing was performed on an Intel i5 processor at 3.4 GHz using Full HD resolution images. As a result, the proposed algorithm shows that machine learning based detection and recognition methods can efficiently be used for TSR algorithm even in poor driving environment.

A Study on the Automatic Speech Control System Using DMS model on Real-Time Windows Environment (실시간 윈도우 환경에서 DMS모델을 이용한 자동 음성 제어 시스템에 관한 연구)

  • 이정기;남동선;양진우;김순협
    • The Journal of the Acoustical Society of Korea
    • /
    • v.19 no.3
    • /
    • pp.51-56
    • /
    • 2000
  • Is this paper, we studied on the automatic speech control system in real-time windows environment using voice recognition. The applied reference pattern is the variable DMS model which is proposed to fasten execution speed and the one-stage DP algorithm using this model is used for recognition algorithm. The recognition vocabulary set is composed of control command words which are frequently used in windows environment. In this paper, an automatic speech period detection algorithm which is for on-line voice processing in windows environment is implemented. The variable DMS model which applies variable number of section in consideration of duration of the input signal is proposed. Sometimes, unnecessary recognition target word are generated. therefore model is reconstructed in on-line to handle this efficiently. The Perceptual Linear Predictive analysis method which generate feature vector from extracted feature of voice is applied. According to the experiment result, but recognition speech is fastened in the proposed model because of small loud of calculation. The multi-speaker-independent recognition rate and the multi-speaker-dependent recognition rate is 99.08% and 99.39% respectively. In the noisy environment the recognition rate is 96.25%.

  • PDF

Development of Learning Algorithm using Brain Modeling of Hippocampus for Face Recognition (얼굴인식을 위한 해마의 뇌모델링 학습 알고리즘 개발)

  • Oh, Sun-Moon;Kang, Dae-Seong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.5 s.305
    • /
    • pp.55-62
    • /
    • 2005
  • In this paper, we propose the face recognition system using HNMA(Hippocampal Neuron Modeling Algorithm) which can remodel the cerebral cortex and hippocampal neuron as a principle of a man's brain in engineering, then it can learn the feature-vector of the face images very fast and construct the optimized feature each image. The system is composed of two parts. One is feature-extraction and the other is teaming and recognition. In the feature extraction part, it can construct good-classified features applying PCA(Principal Component Analysis) and LDA(Linear Discriminants Analysis) in order. In the learning part, it cm table the features of the image data which are inputted according to the order of hippocampal neuron structure to reaction-pattern according to the adjustment of a good impression in the dentate gyrus region and remove the noise through the associate memory in the CA3 region. In the CA1 region receiving the information of the CA3, it can make long-term memory learned by neuron. Experiments confirm the each recognition rate, that are face changes, pose changes and low quality image. The experimental results show that we can compare a feature extraction and learning method proposed in this paper of any other methods, and we can confirm that the proposed method is superior to existing methods.

Fast Scene Change Detection Using Macro Block Information and Spatio-temporal Histogram (매크로 블록 정보와 시공간 히스토그램을 이용한 빠른 장면전환검출)

  • Jin, Ju-Kyong;Cho, Ju-Hee;Jeong, Jae-Hyup;Jeong, Dong-Suk
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.1
    • /
    • pp.141-148
    • /
    • 2011
  • Most of the previous works on scene change detection algorithm focus on the detection of abrupt rather than gradual changes. In general, gradual scene change detection algorithms require heavy computation. Some of those approaches don't consider the error factors such as flashlights, camera or object movements, and special effects. Many scenes change detection algorithms based on the histogram show better performances than other approaches, but they have computation load problem. In this paper, we proposed a scene change detection algorithm with fast and accurate performance using the vertical and horizontal blocked slice images and their macro block informations. We apply graph cut partitioning algorithm for clustering and partitioning of video sequence using generated spatio-temporal histogram. When making spatio-temporal histogram, we only use the central block on vertical and horizontal direction for performance improvement. To detect camera and object movement as well as various special effects accurately, we utilize the motion vector and type information of the macro block.

Content based Video Copy Detection Using Spatio-Temporal Ordinal Measure (시공간 순차 정보를 이용한 내용기반 복사 동영상 검출)

  • Jeong, Jae-Hyup;Kim, Tae-Wang;Yang, Hun-Jun;Jin, Ju-Kyong;Jeong, Dong-Seok
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.49 no.2
    • /
    • pp.113-121
    • /
    • 2012
  • In this paper, we proposed fast and efficient algorithm for detecting near-duplication based on content based retrieval in large scale video database. For handling large amounts of video easily, we split the video into small segment using scene change detection. In case of video services and copyright related business models, it is need to technology that detect near-duplicates, that longer matched video than to search video containing short part or a frame of original. To detect near-duplicate video, we proposed motion distribution and frame descriptor in a video segment. The motion distribution descriptor is constructed by obtaining motion vector from macro blocks during the video decoding process. When matching between descriptors, we use the motion distribution descriptor as filtering to improving matching speed. However, motion distribution has low discriminability. To improve discrimination, we decide to identification using frame descriptor extracted from selected representative frames within a scene segmentation. The proposed algorithm shows high success rate and low false alarm rate. In addition, the matching speed of this descriptor is very fast, we confirm this algorithm can be useful to practical application.