• Title/Summary/Keyword: 결합 알고리즘

Search Result 1,723, Processing Time 0.031 seconds

Medical Image Classification and Retrieval using MPEG-7 Visual Descriptors and Multi-Class SVM(Support Vector Machine) (MPEG-7 시각 기술자와 멀티 클래스 SVM을 이용한 의료 영상 분류와 검색)

  • Shim, Jeong-Hee;Ko, Byoung-Chul;Nam, Jae-Yeal
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.05a
    • /
    • pp.135-138
    • /
    • 2008
  • 본 논문은 의료 영상에 대한 효과적인 분류와 검색을 위한 알고리즘을 제안한다. 영상 분류와 검색을 위해서 MPEG-7 표준 기술자인 색 구조 기술자와 경계선 히스토그램 기술자를 사용해 영상들에 대한 특징 값을 추출한다. 이렇게 구해진 특징 값들을 의료 영상의 분류와 검색에 적용해 본 결과 비교적 낮은 성능을 보여줌을 확인하고 앞서 구해진 특징 값들을 교사 학습 방법인 SVM(Support Vector Machine)과 비교사 학습 방법인 FCM(Fuzzy C-means Clustering)에 적용시켰다. 기존 연구에서는 SVM과 FCM의 통합으로 의료 영상에 대한 분류와 검색을 시행하였지만 본 논문에서 실험한 결과 SVM과 MPEG-7 시각 기술자 중에 하나인 EHD(Edge Histogram Descriptor)를 가중치 선형 결합하여 실험한 결과가 더 정확한 분류와 높은 검색 성능을 나타냄을 확인하였다.

Automatic empty-bottles refund system using deep learning (딥러닝을 활용한 공병 자동 환급 시스템)

  • Do-Kyun Kim;Chang-Geun Kim;Ju-Sung Jeon;Sung-Han Shin;Young-Seok Jung
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2024.01a
    • /
    • pp.285-286
    • /
    • 2024
  • 본 연구에서는 현대 사회의 환경 보호 관심 상승과 소비자들의 재활용 참여 욕구를 고려하여 YOLOv5를 활용한 무인 공병 환급기를 개발하였다. 이 시스템은 정확한 물체 감지와 금액 추정 알고리즘을 결합하여 사용자가 간편하게 공병을 반환하고 적절한 보상을 받을 수 있는 효과적인 시스템을 제공한다. 프로젝트의 성공은 재활용 참여율 증가와 지속 가능한 소비 문화 형성에 기여할 것으로 기대된다.

  • PDF

Preference-based Recipe Recommendation System Using Machine Learning (머신러닝을 활용한 선호도 기반 레시피 추천 시스템)

  • Na-Hui Kim;Gyu-Ri Park;Min-Kyeong Lee;So-Jung Hyun;Sung-Wook Kim
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2024.05a
    • /
    • pp.644-645
    • /
    • 2024
  • COVID-19 유행 이후 배달 음식의 수요가 증가했다. 이러한 배달 음식은 재료나 영양성분 파악이 어려운 경우가 많아 원하는 음식 조건이 있거나 영양 균형을 필요로 하는 개인이 곤란을 겪는다는 문제점이 있다. 따라서 맞춤형 음식을 원하는 개인이 손쉽게 요리를 할 수 있는 방안을 마련하고자, 여러 머신러닝 알고리즘을 결합한 하이브리드 모델을 이용한 레시피 추천시스템을 구현했다. 구현 후에는 웹사이트를 제작하여 직접 적용해봄으로써 그 활용성을 확인했다.

News Video Shot Boundary Detection using Singular Value Decomposition and Incremental Clustering (특이값 분해와 점증적 클러스터링을 이용한 뉴스 비디오 샷 경계 탐지)

  • Lee, Han-Sung;Im, Young-Hee;Park, Dai-Hee;Lee, Seong-Whan
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.2
    • /
    • pp.169-177
    • /
    • 2009
  • In this paper, we propose a new shot boundary detection method which is optimized for news video story parsing. This new news shot boundary detection method was designed to satisfy all the following requirements: 1) minimizing the incorrect data in data set for anchor shot detection by improving the recall ratio 2) detecting abrupt cuts and gradual transitions with one single algorithm so as to divide news video into shots with one scan of data set; 3) classifying shots into static or dynamic, therefore, reducing the search space for the subsequent stage of anchor shot detection. The proposed method, based on singular value decomposition with incremental clustering and mercer kernel, has additional desirable features. Applying singular value decomposition, the noise or trivial variations in the video sequence are removed. Therefore, the separability is improved. Mercer kernel improves the possibility of detection of shots which is not separable in input space by mapping data to high dimensional feature space. The experimental results illustrated the superiority of the proposed method with respect to recall criteria and search space reduction for anchor shot detection.

A Fusion Algorithm considering Error Characteristics of the Multi-Sensor (다중센서 오차특성을 고려한 융합 알고리즘)

  • Hyun, Dae-Hwan;Yoon, Hee-Byung
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.4
    • /
    • pp.274-282
    • /
    • 2009
  • Various location tracking sensors; such as GPS, INS, radar, and optical equipment; are used for tracking moving targets. In order to effectively track moving targets, it is necessary to develop an effective fusion method for these heterogeneous devices. There have been studies in which the estimated values of each sensors were regarded as different models and fused together, considering the different error characteristics of the sensors for the improvement of tracking performance using heterogeneous multi-sensor. However, the rate of errors for the estimated values of other sensors has increased, in that there has been a sharp increase in sensor errors and the attempts to change the estimated sensor values for the Sensor Probability could not be applied in real time. In this study, the Sensor Probability is obtained by comparing the RMSE (Root Mean Square Error) for the difference between the updated and measured values of the Kalman filter for each sensor. The process of substituting the new combined values for the Kalman filter input values for each sensor is excluded. There are improvements in both the real-time application of estimated sensor values, and the tracking performance for the areas in which the sensor performance has rapidly decreased. The proposed algorithm adds the error characteristic of each sensor as a conditional probability value, and ensures greater accuracy by performing the track fusion with the sensors with the most reliable performance. The trajectory of a UAV is generated in an experiment and a performance analysis is conducted with other fusion algorithms.

Pace and Facial Element Extraction in CCD-Camera Images by using Snake Algorithm (스네이크 알고리즘에 의한 CCD 카메라 영상에서의 얼굴 및 얼굴 요소 추출)

  • 판데홍;김영원;김정연;전병환
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2002.11a
    • /
    • pp.535-542
    • /
    • 2002
  • 최근 IT 산업이 급성장하면서 화상 회의, 게임, 채팅 등에서의 아바타(avatar) 제어를 위한 자연스러운 인터페이스 기술이 요구되고 있다. 본 논문에서는 동적 윤곽선 모델(active contour models; snakes)을 이용하여 복잡한 배경이 있는 컬러 CCD 카메라 영상에서 얼굴과 눈, 입, 눈썹, 코 등의 얼굴 요소에 대해 윤곽선을 추출하거나 위치를 파악하는 방법을 제안한다. 일반적으로 스네이크 알고리즘은 잡음에 민감하고 초기 모델을 어떻게 설정하는가에 따라 추출 성능이 크게 좌우되기 때문에 주로 단순한 배경의 영상에서 정면 얼굴의 추출에 사용되어왔다 본 연구에서는 이러한 단점을 파악하기 위해, 먼저 YIQ 색상 모델의 I 성분을 이용한 색상 정보와 차 영상 정보를 사용하여 얼굴의 최소 포함 사각형(minimum enclosing rectangle; MER)을 찾고, 이 얼굴 영역 내에서 기하학적인 위치 정보와 에지 정보를 이용하여 눈, 입, 눈썹, 코의 MER을 설정한다. 그런 다음, 각 요소의 MER 내에서 1차 미분과 2차 미분에 근거한 내부 에너지와 에지에 기반한 영상 에너지를 이용한 스네이크 알고리즘을 적용한다. 이때, 에지 영상에서 얼굴 주변의 복잡한 잡음을 제거하기 위하여 색상 정보 영상과 차 영상에 각각 모폴로지(morphology)의 팽창(dilation) 연산을 적용하고 이들의 AND 결합 영상에 팽창 연산을 다시 적용한 이진 영상을 필터로 사용한다. 총 7명으로부터 양 눈이 보이는 정면 유사 방향의 영상을 20장씩 취득하여 총 140장에 대해 실험한 결과, MER의 오차율은 얼굴, 눈, 입에 대해 각각 6.2%, 11.2%, 9.4%로 나타났다. 또한, 스네이크의 초기 제어점을 얼굴은 44개, 눈은 16개, 입은 24개로 지정하여 MER추출에 성공한 영상에 대해 스네이크 알고리즘을 수행한 결과, 추출된 영역의 오차율은 각각 2.2%, 2.6%, 2.5%로 나타났다.해서 Template-based reasoning 예를 보인다 본 방법론은 검색노력을 줄이고, 검색에 있어 Feasibility와 Admissibility를 보장한다.매김할 수 있는 중요한 계기가 될 것이다.재무/비재무적 지표를 고려한 인공신경망기법의 예측적중률이 높은 것으로 나타났다. 즉, 로지스틱회귀 분석의 재무적 지표모형은 훈련, 시험용이 84.45%, 85.10%인 반면, 재무/비재무적 지표모형은 84.45%, 85.08%로서 거의 동일한 예측적중률을 가졌으나 인공신경망기법 분석에서는 재무적 지표모형이 92.23%, 85.10%인 반면, 재무/비재무적 지표모형에서는 91.12%, 88.06%로서 향상된 예측적중률을 나타내었다.ting LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity of computation. Adaptive transversal filter with proposed data recycling buffer algorithm could efficiently reject ISI of channel and increase speed of convergence in avoidance burden of computational complexity in reality when it was experimented having the same condition of

  • PDF

A Study-on Context-Dependent Acoustic Models to Improve the Performance of the Korea Speech Recognition (한국어 음성인식 성능향상을 위한 문맥의존 음향모델에 관한 연구)

  • 황철준;오세진;김범국;정호열;정현열
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.2 no.4
    • /
    • pp.9-15
    • /
    • 2001
  • In this paper we investigate context dependent acoustic models to improve the performance of the Korean speech recognition . The algorithm are using the Korean phonological rules and decision tree, By Successive State Splitting(SSS) algorithm the Hidden Merkov Netwwork(HM-Net) which is an efficient representation of phoneme-context-dependent HMMs, can be generated automatically SSS is powerful technique to design topologies of tied-state HMMs but it doesn't treat unknown contexts in the training phoneme contexts environment adequately In addition it has some problem in the procedure of the contextual domain. In this paper we adopt a new state-clustering algorithm of SSS, called Phonetic Decision Tree-based SSS (PDT-SSS) which includes contexts splits based on the Korean phonological rules. This method combines advantages of both the decision tree clustering and SSS, and can generated highly accurate HM-Net that can express any contexts To verify the effectiveness of the adopted methods. the experiments are carried out using KLE 452 word database and YNU 200 sentence database. Through the Korean phoneme word and sentence recognition experiments. we proved that the new state-clustering algorithm produce better phoneme, word and continuous speech recognition accuracy than the conventional HMMs.

  • PDF

Protein-Protein Interaction Reliability Enhancement System based on Feature Selection and Classification Technique (특징 추출과 분석 기법에 기반한 단백질 상호작용 데이터 신뢰도 향상 시스템)

  • Lee, Min-Su;Park, Seung-Soo;Lee, Sang-Ho;Yong, Hwan-Seung;Kang, Sung-Hee
    • The KIPS Transactions:PartB
    • /
    • v.13B no.7 s.110
    • /
    • pp.679-688
    • /
    • 2006
  • Protein-protein interaction data obtained from high-throughput experiments includes high false positives. In this paper, we introduce a new protein-protein interaction reliability verification system. The proposed system integrates various biological features related with protein-protein interactions, and then selects the most relevant and informative features among them using a feature selection method. To assess the reliability of each protein-protein interaction data, the system construct a classifier that can distinguish true interacting protein pairs from noisy protein-protein interaction data based on the selected biological evidences using a classification technique. Since the performance of feature selection methods and classification techniques depends heavily upon characteristics of data, we performed rigorous comparative analysis of various feature selection methods and classification techniques to obtain optimal performance of our system. Experimental results show that the combination of feature selection method and classification algorithms provide very powerful tools in distinguishing true interacting protein pairs from noisy protein-protein interaction dataset. Also, we investigated the effects on performances of feature selection methods and classification techniques in the proposed protein interaction verification system.

State of the Art Technology Trends and Case Analysis of Leading Research in Harmony Search Algorithm (하모니 탐색 알고리즘의 선도 연구에 관한 최첨단 기술 동향과 사례 분석)

  • Kim, Eun-Sung;Shin, Seung-Soo;Kim, Yong-Hyuk;Yoon, Yourim
    • Journal of the Korea Convergence Society
    • /
    • v.12 no.11
    • /
    • pp.81-90
    • /
    • 2021
  • There are various optimization problems in real world and research continues to solve them. An optimization problem is the problem of finding a combination of parameters that maximizes or minimizes the objective function. Harmony search is a population-based metaheuristic algorithm for solving optimization problems and it is designed to mimic the improvisation of jazz music. Harmony search has been actively applied to optimization problems in various fields such as civil engineering, computer science, energy, medical science, and water quality engineering. Harmony search has a simple working principle and it has the advantage of finding good solutions quickly in constrained optimization problems. Especially there are various application cases showing high accuracy with a low number of iterations by improving the solution through the empirical derivative. In this paper, we explain working principle of Harmony search and classify the leading research in recent 3 years, review them according to category, and suggest future research directions. The research is divided into review by field, algorithmic analysis and theory, and application to real world problems. Application to real world problems is classified according to the purpose of optimization and whether or not they are hybridized with other metaheuristic algorithms.

Performance Analysis of Trading Strategy using Gradient Boosting Machine Learning and Genetic Algorithm

  • Jang, Phil-Sik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.11
    • /
    • pp.147-155
    • /
    • 2022
  • In this study, we developed a system to dynamically balance a daily stock portfolio and performed trading simulations using gradient boosting and genetic algorithms. We collected various stock market data from stocks listed on the KOSPI and KOSDAQ markets, including investor-specific transaction data. Subsequently, we indexed the data as a preprocessing step, and used feature engineering to modify and generate variables for training. First, we experimentally compared the performance of three popular gradient boosting algorithms in terms of accuracy, precision, recall, and F1-score, including XGBoost, LightGBM, and CatBoost. Based on the results, in a second experiment, we used a LightGBM model trained on the collected data along with genetic algorithms to predict and select stocks with a high daily probability of profit. We also conducted simulations of trading during the period of the testing data to analyze the performance of the proposed approach compared with the KOSPI and KOSDAQ indices in terms of the CAGR (Compound Annual Growth Rate), MDD (Maximum Draw Down), Sharpe ratio, and volatility. The results showed that the proposed strategies outperformed those employed by the Korean stock market in terms of all performance metrics. Moreover, our proposed LightGBM model with a genetic algorithm exhibited competitive performance in predicting stock price movements.