• Title/Summary/Keyword: SWEET algorithm

Search Result 18, Processing Time 0.024 seconds

Beam Control Method of Multiple Array Antenna Using The Modified Genetic Algorithm (변형된 유전자 알고리즘을 이용한 Multiple Array 안테나의 빔 제어방식)

  • Hyun, Kyo-Hwan;Jung, Kyung-Kwon;Eom, Ki-Hwan
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.44 no.2 s.314
    • /
    • pp.39-45
    • /
    • 2007
  • This paper presents a novel scheme that quickly searches for the sweet spot of multiple array antennas, and locks on to it for high-speed millimeter wavelength transmissions, when communications to another antenna array are disconnected. The proposed method utilizes a modified genetic algorithm, which selects a superior initial group through preprocessing in order to solve the local solution in agenetic algorithm. TDD (Time Division Duplex) is utilized as the transfer method and data controller for the antenna. Once the initial communication is completed for the specific number of individuals, no longer antenna's data will be transmitted until each station processes GA in order to produce the next generation. After reproduction, individuals of the next generation become the data, and communication between each station is made again. Simulation results of 1:1, 1:2, 1:5 array antennas confirmed the efficiency of the proposed method. The 16bit split is 8bit, but it has similar performance as 16bit gene.

Sweet spot search of multi peak beam using Genetic Algorithm (Genetic Algorithm을 이용한 멀티 피크 빔의 최적방향탐색)

  • Hwang Jong Woo;Lim Sung Jin;Eom Ki Hwan;Sato Yoichi
    • Proceedings of the IEEK Conference
    • /
    • 2004.06a
    • /
    • pp.301-304
    • /
    • 2004
  • In this paper, we propose a method to find the optimal direction of the multi beam between each station on the point-to-point link by genetic algorithm. In the proposed method, maximum value in optimal direction on each station is used as a fitness function. The beam of millimeter wave generates a lot of multi-peak because of much influence of noise. About each gene, we simulated this method using 16bit, 32bit, and 32bit split algorithm. 32bit split uses 16bit gene information. Each antenna makes 32bit gene information by adding gene information of two antennas having 16bit gene. Through the proposed method, we could have gotten a good output without 32bit gene information.

  • PDF

Beam Control of Multiple Array Antenna Using The Modified Genetic Algorithm (변형된 유전자 알고리즘을 이용한 Multiple Array Antenna의 Beam 제어방식)

  • Hyun, Kyo-Hwan;Jung, Kyung-Kwon;Eom, Ki-hwan
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.921-922
    • /
    • 2006
  • This paper presents a novel scheme that quickly searches for the sweet spot of multiple array antennas, and locks on to it for high-speed millimeter wavelength transmissions. The proposed method utilizes a modified genetic algorithm, which selects a superior initial group through preprocessing in order to solve the local solution in a genetic algorithm. TDD (Time Division Duplex) is utilized as the transfer method and data controller for the antenna. Once the initial communication is completed for the specific number of individuals, no longer antenna's data will be transmitted until each station processes GA in order to produce the next generation. After reproduction, individuals of the next generation become the data, and communication between each station is made again. Simulation results confirmed the efficiency of the proposed method.

  • PDF

Input Pattern Vector Extraction and Pattern Recognition of Taste using fMRI (fMRI를 이용한 맛의 입력패턴벡터 추출 및 패턴인식)

  • Lee, Sun-Yeob;Lee, Yong-Gu;Kim, Dong-Ki
    • Journal of radiological science and technology
    • /
    • v.30 no.4
    • /
    • pp.419-426
    • /
    • 2007
  • In this paper, the input pattern vectors are extracted and the learning algorithms is designed to recognize taste(bitter, sweet, sour and salty) pattern vectors. The signal intensity of taste are used to compose the input pattern vectors. The SOM(Self Organizing Maps) algorithm for taste pattern recognition is used to learn initial reference vectors and the ot-star learning algorithm is used to determine the class of the output neurons of the sunclass layer. The weights of the proposed algorithm which is between the input layer and the subclass layer can be learned to determine initial reference vectors by using SOM algorithm and to learn reference vectors by using LVQ(Learning Vector Quantization) algorithm. The pattern vectors are classified into subclasses by neurons in the subclass layer, and the weights between subclass layer and output layer are learned to classify the classified subclass, which is enclosed a class. To classify the pattern vectors, the proposed algorithm is simulated with ones of the conventional LVQ, and it is confirmed that the proposed learning method is more successful classification than the conventional LVQ.

  • PDF

A development of a new tongue diagnosis model in the oriental medicine by the color analysis of tongue (혀의 색상 분석에 의한 새로운 한방 설진(舌診) 모델 개발)

  • Choi, Min;Lee, Min-taek;Lee, Kyu-won
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.05a
    • /
    • pp.801-804
    • /
    • 2013
  • We propose a new tongue examination model according to the taste division of tongue. The proposed sytem consists of image acquisition, region segmentation, color distribution analysis and abnormality decision of tongue. Tongue DB which is classified into abnormality is constructed with tongue images captured from oriental medicine hospital inpatients. We divided 4 basic taste(bitter, sweet, salty and sour) regions and performed color distribution analysis targeting each region under HSI(Hue Saturation Intensity) color model. To minimize the influence of illumination, the histograms of H and S components only except I are utilized. The abnormality of taste regions each by comparing the proposed diagnosis model with diagnosis results by a doctor of oriental medicine. We confirmed the 87.5% of classification results of abnormality by proposed algorithm is coincide with the doctor's results.

  • PDF

Fruit Grading Algorithms of Multi-purpose Fruit Grader Using Black at White Image Processing System (흑백영상처리장치를 이용한 다목적 과실선별기의 등급판정 알고리즘 개발)

  • 노상하;이종환;황인근
    • Journal of Biosystems Engineering
    • /
    • v.20 no.1
    • /
    • pp.95-103
    • /
    • 1995
  • A series of study has been conducted to develop a multi-purpose fruit grader using a black & white image processing system equipped with a 550 nm interference filter. A device and high performance algorithms were developed for sizing and color grading of Fuji apple in the previous study. In this study an emphasis was put on finding correlations between weights of several kinds of fruits and their area fractions(AF), and on compensating the blurring effect upon sizing and color grading by conveying speed of fruit. Also, the effect of orientation and direction of fruit on conveyor during image forming was analyzed to identify any difficulty (or utilizing an automatic fruit feeder. The results are summarized as follows. 1. The correlation coefficients(r) between the weights of fruits and their image sizes were 0.984~0.996 for apples, 0.983~0.990 for peachs, 0.995 for tomato, 0.986 for sweet persimmon and 0.970~0.993 for pears. 2. It was possible to grade fruits by color with the area weighted mean gray values(AWMGV) based on the mean gray valves of direct image and the compensated values of reflected image of a fruit, and also possible to sort fruits by size with AF. Accuracies in sizing and color grading ranged over 81.0% ~95.0% and 82.0% ~89.7% respectively as compared with results from sizing by electronic weight scale and grading by expert. 3. The blurring effect on the sizing and color grading depending on conveying speed was identified and regression equations were derived. 4. It was found that errors in sizing and coloring grading due to the change in direction and orientation of Fuji apple on the conveyor were not significant as far as the stem end of apple keeping upward.

  • PDF

Classifying Indian Medicinal Leaf Species Using LCFN-BRNN Model

  • Kiruba, Raji I;Thyagharajan, K.K;Vignesh, T;Kalaiarasi, G
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.10
    • /
    • pp.3708-3728
    • /
    • 2021
  • Indian herbal plants are used in agriculture and in the food, cosmetics, and pharmaceutical industries. Laboratory-based tests are routinely used to identify and classify similar herb species by analyzing their internal cell structures. In this paper, we have applied computer vision techniques to do the same. The original leaf image was preprocessed using the Chan-Vese active contour segmentation algorithm to efface the background from the image by setting the contraction bias as (v) -1 and smoothing factor (µ) as 0.5, and bringing the initial contour close to the image boundary. Thereafter the segmented grayscale image was fed to a leaky capacitance fired neuron model (LCFN), which differentiates between similar herbs by combining different groups of pixels in the leaf image. The LFCN's decay constant (f), decay constant (g) and threshold (h) parameters were empirically assigned as 0.7, 0.6 and h=18 to generate the 1D feature vector. The LCFN time sequence identified the internal leaf structure at different iterations. Our proposed framework was tested against newly collected herbal species of natural images, geometrically variant images in terms of size, orientation and position. The 1D sequence and shape features of aloe, betel, Indian borage, bittergourd, grape, insulin herb, guava, mango, nilavembu, nithiyakalyani, sweet basil and pomegranate were fed into the 5-fold Bayesian regularization neural network (BRNN), K-nearest neighbors (KNN), support vector machine (SVM), and ensemble classifier to obtain the highest classification accuracy of 91.19%.