• Title/Summary/Keyword: Information input algorithm

Search Result 2,444, Processing Time 0.029 seconds

A Reconstruction of Classification for Iris Species Using Euclidean Distance Based on a Machine Learning (머신러닝 기반 유클리드 거리를 이용한 붓꽃 품종 분류 재구성)

  • Nam, Soo-Tai;Shin, Seong-Yoon;Jin, Chan-Yong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.2
    • /
    • pp.225-230
    • /
    • 2020
  • Machine learning is an algorithm which learns a computer based on the data so that the computer can identify the trend of the data and predict the output of new input data. Machine learning can be classified into supervised learning, unsupervised learning, and reinforcement learning. Supervised learning is a way of learning a machine with given label of data. In other words, a method of inferring a function of the system through a pair of data and a label is used to predict a result using a function inferred about new input data. If the predicted value is continuous, regression analysis is used. If the predicted value is discrete, it is used as a classification. A result of analysis, no. 8 (5, 3.4, setosa), 27 (5, 3.4, setosa), 41 (5, 3.5, setosa), 44 (5, 3.5, setosa) and 40 (5.1, 3.4, setosa) in Table 3 were classified as the most similar Iris flower. Therefore, theoretical practical are suggested.

Visibility detection approach to road scene foggy images

  • Guo, Fan;Peng, Hui;Tang, Jin;Zou, Beiji;Tang, Chenggong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4419-4441
    • /
    • 2016
  • A cause of vehicle accidents is the reduced visibility due to bad weather conditions such as fog. Therefore, an onboard vision system should take visibility detection into account. In this paper, we propose a simple and effective approach for measuring the visibility distance using a single camera placed onboard a moving vehicle. The proposed algorithm is controlled by a few parameters and mainly includes camera parameter estimation, region of interest (ROI) estimation and visibility computation. Thanks to the ROI extraction, the position of the inflection point may be measured in practice. Thus, combined with the estimated camera parameters, the visibility distance of the input foggy image can be computed with a single camera and just the presence of road and sky in the scene. To assess the accuracy of the proposed approach, a reference target based visibility detection method is also introduced. The comparative study and quantitative evaluation show that the proposed method can obtain good visibility detection results with relatively fast speed.

The Chinese Black Box - A Scientific Model of Traditional Chinese Medicine

  • Theodorou, Matthias;Fleckenstein, Johannes
    • Journal of Acupuncture Research
    • /
    • v.36 no.1
    • /
    • pp.1-11
    • /
    • 2019
  • Models of traditional Chinese medicine (TCM) are still difficult to grasp from the view of a Western-cultural background. For proper integration into science and clinical research, it is vital to think "out of the box" of classical sciences. Modern sciences, such as quantum physics, system theory, and information theory offer new models, that reveal TCM as a method to process information. For this purpose, we apply concepts of information theory to propose a "Chinese black box model," that allows for a non-deterministic, bottom-up approach. Considering a patient as an undeterminable complex system, the process of getting information about an individual in Chinese diagnostics is compared to the input-process-output principle of information theory and quantum physics, which is further illustrated by Wheeler's "surprise 20 questions." In TCM, an observer uses a decision-making algorithm to qualify diagnostic information by the binary polarities of "yang" (latin activity) and "yin" (latin structivity) according to the so called "8 principles" (latin 8 guiding criteria). A systematic reconstruction of ancient Chinese terms and concepts illuminates a scattered scientific method, which is specified in a medical context by Latin terminology of the sinologist Porkert [definitions of the Latin terms are presented in Porkert's appendix [1] (cf. Limitations)].

SVM Classifier for the Detection of Ventricular Fibrillation (SVM 분류기를 통한 심실세동 검출)

  • Song, Mi-Hye;Lee, Jeon;Cho, Sung-Pil;Lee, Kyoung-Joung
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.42 no.5 s.305
    • /
    • pp.27-34
    • /
    • 2005
  • Ventricular fibrillation(VF) is generally caused by chaotic behavior of electrical propagation in heart and may result in sudden cardiac death. In this study, we proposed a ventricular fibrillation detection algorithm based on support vector machine classifier, which could offer benefits to reduce the teaming costs as well as good classification performance. Before the extraction of input features, raw ECG signal was applied to preprocessing procedures, as like wavelet transform based bandpass filtering, R peak detection and segment assignment for feature extraction. We selected input features which of some are related to the rhythm information and of others are related to wavelet coefficients that could describe the morphology of ventricular fibrillation well. Parameters for SVM classifier, C and ${\alpha}$, were chosen as 10 and 1 respectively by trial and error experiments. Each average performance for normal sinus rhythm ventricular tachycardia and VF, was 98.39%, 96.92% and 99.88%. And, when the VF detection performance of SVM classifier was compared to that of multi-layer perceptron and fuzzy inference methods, it showed similar or higher values. Consequently, we could find that the proposed input features and SVM classifier would one of the most useful algorithm for VF detection.

An Adversarial Attack Type Classification Method Using Linear Discriminant Analysis and k-means Algorithm (선형 판별 분석 및 k-means 알고리즘을 이용한 적대적 공격 유형 분류 방안)

  • Choi, Seok-Hwan;Kim, Hyeong-Geon;Choi, Yoon-Ho
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.31 no.6
    • /
    • pp.1215-1225
    • /
    • 2021
  • Although Artificial Intelligence (AI) techniques have shown impressive performance in various fields, they are vulnerable to adversarial examples which induce misclassification by adding human-imperceptible perturbations to the input. Previous studies to defend the adversarial examples can be classified into three categories: (1) model retraining methods; (2) input transformation methods; and (3) adversarial examples detection methods. However, even though the defense methods against adversarial examples have constantly been proposed, there is no research to classify the type of adversarial attack. In this paper, we proposed an adversarial attack family classification method based on dimensionality reduction and clustering. Specifically, after extracting adversarial perturbation from adversarial example, we performed Linear Discriminant Analysis (LDA) to reduce the dimensionality of adversarial perturbation and performed K-means algorithm to classify the type of adversarial attack family. From the experimental results using MNIST dataset and CIFAR-10 dataset, we show that the proposed method can efficiently classify five tyeps of adversarial attack(FGSM, BIM, PGD, DeepFool, C&W). We also show that the proposed method provides good classification performance even in a situation where the legitimate input to the adversarial example is unknown.

Development of Music Recommendation System based on Customer Sentiment Analysis (소비자 감성 분석 기반의 음악 추천 알고리즘 개발)

  • Lee, Seung Jun;Seo, Bong-Goon;Park, Do-Hyung
    • Journal of Intelligence and Information Systems
    • /
    • v.24 no.4
    • /
    • pp.197-217
    • /
    • 2018
  • Music is one of the most creative act that can express human sentiment with sound. Also, since music invoke people's sentiment to get empathized with it easily, it can either encourage or discourage people's sentiment with music what they are listening. Thus, sentiment is the primary factor when it comes to searching or recommending music to people. Regard to the music recommendation system, there are still lack of recommendation systems that are based on customer sentiment. An algorithm's that were used in previous music recommendation systems are mostly user based, for example, user's play history and playlists etc. Based on play history or playlists between multiple users, distance between music were calculated refer to basic information such as genre, singer, beat etc. It can filter out similar music to the users as a recommendation system. However those methodology have limitations like filter bubble. For example, if user listen to rock music only, it would be hard to get hip-hop or R&B music which have similar sentiment as a recommendation. In this study, we have focused on sentiment of music itself, and finally developed methodology of defining new index for music recommendation system. Concretely, we are proposing "SWEMS" index and using this index, we also extracted "Sentiment Pattern" for each music which was used for this research. Using this "SWEMS" index and "Sentiment Pattern", we expect that it can be used for a variety of purposes not only the music recommendation system but also as an algorithm which used for buildup predicting model etc. In this study, we had to develop the music recommendation system based on emotional adjectives which people generally feel when they listening to music. For that reason, it was necessary to collect a large amount of emotional adjectives as we can. Emotional adjectives were collected via previous study which is related to them. Also more emotional adjectives has collected via social metrics and qualitative interview. Finally, we could collect 134 individual adjectives. Through several steps, the collected adjectives were selected as the final 60 adjectives. Based on the final adjectives, music survey has taken as each item to evaluated the sentiment of a song. Surveys were taken by expert panels who like to listen to music. During the survey, all survey questions were based on emotional adjectives, no other information were collected. The music which evaluated from the previous step is divided into popular and unpopular songs, and the most relevant variables were derived from the popularity of music. The derived variables were reclassified through factor analysis and assigned a weight to the adjectives which belongs to the factor. We define the extracted factors as "SWEMS" index, which describes sentiment score of music in numeric value. In this study, we attempted to apply Case Based Reasoning method to implement an algorithm. Compare to other methodology, we used Case Based Reasoning because it shows similar problem solving method as what human do. Using "SWEMS" index of each music, an algorithm will be implemented based on the Euclidean distance to recommend a song similar to the emotion value which given by the factor for each music. Also, using "SWEMS" index, we can also draw "Sentiment Pattern" for each song. In this study, we found that the song which gives a similar emotion shows similar "Sentiment Pattern" each other. Through "Sentiment Pattern", we could also suggest a new group of music, which is different from the previous format of genre. This research would help people to quantify qualitative data. Also the algorithms can be used to quantify the content itself, which would help users to search the similar content more quickly.

Recognition of Printed Hangeul Characters Based on the Stable Structure Information and Neural Networks (안정된 구조정보와 신경망을 기반으로 한 인쇄체 한글 문자 인식)

  • 장희돈;남궁재찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.11
    • /
    • pp.2276-2290
    • /
    • 1994
  • In this paper, we propose an algorithm for character recognition using the subdivided type and the stable structure information. The subdivided type of character is acquired from the stable structure information of character which is extracted from an input character. Firstly, the character is obtained from a scanner and classified into on of 6 types by using directional density vector. And then, the stable structure information is extracted from each character and the character is subdivided into on of 26 types. Finally, the classified character is recognized by using neural network which is inputted the directional density vector equivalent to JASO area or recognized direct. Aa a result of experiment with KS C 5601 2350 printed Hangeul characters, we obtain the recognition rate of 94%.

  • PDF

Salient Object Detection via Adaptive Region Merging

  • Zhou, Jingbo;Zhai, Jiyou;Ren, Yongfeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4386-4404
    • /
    • 2016
  • Most existing salient object detection algorithms commonly employed segmentation techniques to eliminate background noise and reduce computation by treating each segment as a processing unit. However, individual small segments provide little information about global contents. Such schemes have limited capability on modeling global perceptual phenomena. In this paper, a novel salient object detection algorithm is proposed based on region merging. An adaptive-based merging scheme is developed to reassemble regions based on their color dissimilarities. The merging strategy can be described as that a region R is merged with its adjacent region Q if Q has the lowest dissimilarity with Q among all Q's adjacent regions. To guide the merging process, superpixels that located at the boundary of the image are treated as the seeds. However, it is possible for a boundary in the input image to be occupied by the foreground object. To avoid this case, we optimize the boundary influences by locating and eliminating erroneous boundaries before the region merging. We show that even though three simple region saliency measurements are adopted for each region, encouraging performance can be obtained. Experiments on four benchmark datasets including MSRA-B, SOD, SED and iCoSeg show the proposed method results in uniform object enhancement and achieve state-of-the-art performance by comparing with nine existing methods.

An \alpha$-trimmed mean orientation extraction algorithm which is robust to scarred fingerprint (손상된 지문에 강건한 \alpha$-trimmed mean 방향성 추출 알고리즘)

  • 신종욱;윤병우;송종관
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.4
    • /
    • pp.854-860
    • /
    • 2004
  • The result of fingerprint matching is different as the quality or the state of input fingerprint image. We can extract the false direction information when the quality of fingerprint is degraded by the noise or the scars of the ridges. The information of the direction is very important for the elimination of the false minutia, the measurement of the ridge distance, matching, finding of cores and deltas. We need the method which can compensate or correct the false information of directions because the false directions include serious errors in the fingerprint recognition. We propose a method which can compensate or correct the false direction of fingerprint with a \alpha$-trimmed mean filter followed by LPF to reconstruct the false direction information when fingerprints are corrupted by scars.

Resource allocation for Millimeter Wave mMIMO-NOMA System with IRS

  • Bing Ning;Shuang Li;Xinli Wu;Wanming Hao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.7
    • /
    • pp.2047-2066
    • /
    • 2024
  • In order to improve the coverage and achieve massive spectrum access, non-orthogonal multiple access (NOMA) technology is applied in millimeter wave massive multiple-input multiple-output (mMIMO) communication network. However, the power assumption of active sensors greatly limits its wide applications. Recently, Intelligent Reconfigurable Surface (IRS) technology has received wide attention due to its ability to reduce power consumption and achieve passive transmission. In this paper, spectral efficiency maximum problem in the millimeter wave mMIMO-NOMA system with IRS is considered. The sparse RF chain antenna structure is designed at the base station based on continuous phase modulation. Furthermore, a joint optimization problem for power allocation, power splitting, analog precoding and IRS reconfigurable matrices are constructed, which aim to achieve the maximum spectral efficiency of the system under the constraints of user's quality of service, minimum energy harvesting and total transmit power. A three-stage iterative algorithm is proposed to solve the above mentioned non-convex optimization problems. We obtain the local optimal solution by fixing some optimization parameters firstly, then introduce the relaxation variables to realize the global optimal solution. Simulation results show that the spectral efficiency of the proposed scheme is superior compared to the conventional system with phase shifter modulation. It is also demonstrated that IRS can effectively assist mmWave communication and improve the system spectral efficiency.