• 제목/요약/키워드: and Sorting algorithms

검색결과 97건 처리시간 0.03초

급성저혈압에 의한 내측전정신경핵 신경세포의 흥분성 변화를 분석하기 위한 테트로드 기법의 적용 (Application of Tetrode Technology for Analysis of Changes in Neural Excitability of Medial Vestibular Nucleus by Acute Arterial Hypotension)

  • 김영;구호;박병림;문세진;양승범;김민선
    • Research in Vestibular Science
    • /
    • 제17권4호
    • /
    • pp.142-151
    • /
    • 2018
  • Objectives: Excitability o medial vestibular nucleus (MVN) in the brainstem can be affected by changes in the arterial blood pressure. Several animal studies have demonstrated that acute hypotension results in the alteration of multiunit activities and expression of cFos protein in the MVN. In the field of extracellular electrophysiological recording, tetrode technology and spike sorting algorithms can easily identify single unit activity from multiunit activities in the brain. However, detailed properties of electrophysiological changes in single unit of the MVN during acute hypotension have been unknown. Methods: Therefore, we applied tetrode techniques and electrophysiological characterization methods to know the effect of acute hypotension on single unit activities of the MVN of rats. Results: Two or 3 types of unit could be classified according to the morphology of spikes and firing properties of neurons. Acute hypotension elicited 4 types of changes in spontaneous firing of single unit in the MVN. Most of these neurons showed excitatory responses for about within 1 minute after the induction of acute hypotension and then returned to the baseline activity 10 minutes after the injection of sodium nitroprusside. There was also gradual increase in spontaneous firing in some units. In contrast small proportion of units showed rapid reduction of firing rate just after acute hypotension. Conclusions: Therefore, application of tetrode technology and spike sorting algorithms is another method for the monitoring of electrical activity of vestibular nuclear during acute hypotension.

Optimization Design for Dynamic Characters of Electromagnetic Apparatus Based on Niche Sorting Multi-objective Particle Swarm Algorithm

  • Xu, Le;You, Jiaxin;Yu, Haidan;Liang, Huimin
    • Journal of Magnetics
    • /
    • 제21권4호
    • /
    • pp.660-665
    • /
    • 2016
  • The electromagnetic apparatus plays an important role in high power electrical systems. It is of great importance to provide an effective approach for the optimization of the high power electromagnetic apparatus. However, premature convergence and few Pareto solution set of the optimization for electromagnetic apparatus always happen. This paper proposed a modified multi-objective particle swarm optimization algorithm based on the niche sorting strategy. Applying to the modified algorithm, this paper guarantee the better Pareto optimal front with an enhanced distribution. Aiming at shortcomings in the closing bounce and slow breaking velocity of electromagnetic apparatus, the multi-objective optimization model was established on the basis of the traditional optimization. Besides, by means of the improved multi-objective particle swarm optimization algorithm, this paper processed the model and obtained a series of optimized parameters (decision variables). Compared with other different classical algorithms, the modified algorithm has a satisfactory performance in the multi-objective optimization problems in the electromagnetic apparatus.

YOLOv5에서 자동차 번호판 및 문자 정렬 알고리즘에 관한 연구 (A Study on Vehicle License Plates and Character Sorting Algorithms in YOLOv5)

  • 장문석;하상현;정석찬
    • 한국산업융합학회 논문집
    • /
    • 제24권5호
    • /
    • pp.555-562
    • /
    • 2021
  • In this paper, we propose a sorting method for extracting accurate license plate information, which is currently used in Korea, after detecting objects using YOLO. We propose sorting methods for the five types of vehicle license plates managed by the Ministry of Land, Infrastructure and Transport by classifying the plates with the number of lines, Korean characters, and numbers. The results of experiments with 5 license plates show that the proposed algorithm identifies all license plate types and information by focusing on the object with high reliability score in the result label file presented by YOLO and deleting unnecessary object information. The proposed method will be applicable to all systems that recognize license plates.

영상처리에 의한 장미 선별 (On-Line Sorting of Cut Roses by Color Image Processing)

  • 배영환;구현모
    • Journal of Biosystems Engineering
    • /
    • 제24권1호
    • /
    • pp.67-74
    • /
    • 1999
  • A prototype cut-flower sorter was developed and tested for its performance with five varieties of roses. Support plates driven by a chain mechanism transported the roses into an image inspection chamber. Color image processing algorithms were developed to evaluate the length, thickness, and straightness of stem and color, height, and maturity of bud. The average absolute errors of the system for the measurements of stem length, stem thickness, and height of bud were 19.7 mm, 0.5 mm, and 3.8 mm, respectively. The results of classification by the sorter were compared with those of a human inspector for straightness of stem and maturity of bud. The classification error for the straightness of stem was 8.6%, when both direct image and reflected image by a mirror were analyzed. The accuracy in classifying the maturity of bud varied among the varieties, the smallest for‘Nobless’(1.5%) and the largest for‘Rote Rose’(13.5%). The time required to process a rose averaged 2.06 seconds, equivalent to the capacity of 1,600 roses per hour.

  • PDF

DDI 칩 테스트 데이터 분석용 맵 알고리즘 (Analytic Map Algorithms of DDI Chip Test Data)

  • 황금주;조태원
    • 반도체디스플레이기술학회지
    • /
    • 제5권1호
    • /
    • pp.5-11
    • /
    • 2006
  • One of the most important is to insure that a new circuit design is qualified far release before it is scheduled for manufacturing, test, assembly and delivery. Due to various causes, there happens to be a low yield in the wafer process. Wafer test is a critical process in analyzing the chip characteristics in the EDS(electric die sorting) using analytic tools -wafer map, wafer summary and datalog. In this paper, we propose new analytic map algorithms for DDI chip test data. Using the proposed analytic map algorithms, we expect to improve the yield, quality and analysis time.

  • PDF

라인스캔 카메라 시스템을 이용(利用)한 스크랩 자동선별(自動選別) 연구(硏究) (Automated scrap-sorting research using a line-scan camera system)

  • 김찬욱;김행구
    • 자원리싸이클링
    • /
    • 제17권6호
    • /
    • pp.43-49
    • /
    • 2008
  • 본 연구에서는 라인스캔 카메라를 이용한 색도인식 스크랩 선별시스템을 설계 제작하고 제작한 시스템을 이용하여 철스크랩에 혼합되어 있는 Cu 스크랩을 자동으로 분리하는 연구를 수행하였다. 스크랩 자동선별 시스템은 크게 측정부, 이송부 그리고 이젝터로 구분되며 라인스캔 카메라, 광원 및 frame grabber로 구성된 측정부에서 스크랩 표면의 색도를 이메지 프로쎄싱 알고리즘에 의해 인식함으로써. 임의로 지정한 특정한 표면색상의 스크랩만에 에어노즐을 작동케 하여 선별하도록 되어 있다. 본 연구에서는 선별처리의 고속화에 대응하기 위하여 주파수 가변 광원시스템을 제작하여 선별시스템에 적용하였으며, 최적실험조건으로 스크랩 이송속도 25 m/min.에서 철스크랩중에 포함되어 있는 Cu스크랩을 90%이상 인식하여 약 80%의 선별효율을 얻었다.

레이더 군집화를 위한 반복 K-means 클러스터링 알고리즘 (Repeated K-means Clustering Algorithm For Radar Sorting)

  • 박동현;서동호;백지현;이원진;장동의
    • 한국군사과학기술학회지
    • /
    • 제26권5호
    • /
    • pp.384-391
    • /
    • 2023
  • In modern electronic warfare, a number of radar emitters are in operation, causing radar receivers to receive high-density signal pulses that occur simultaneously. To analyze the radar signals more accurately and identify enemies, the sorting process of high-density radar signals is very important before analysis. Recently, machine learning algorithms, specifically K-means clustering, are the subject of research aimed at improving the accuracy of radar signal sorting. One of the challenges faced by these studies is that the clustering results can vary depending on how the initial points are selected and how many clusters number are set. This paper introduces a repeated K-means clustering algorithm that aims to accurately cluster all data by identifying and addressing false clusters in the radar sorting problem. To verify the performance of the proposed algorithm, experiments are conducted by applying it to simulated signals that are generated by a signal generator.

폐가전의 검정색 플라스틱 재질선별에 관한 기초 연구 (A Basic Study on Sorting of Black Plastics of Waste Electrical and Electronic Equipment (WEEE))

  • 박은규;정밤빛;최우진;오성권
    • 자원리싸이클링
    • /
    • 제26권1호
    • /
    • pp.69-77
    • /
    • 2017
  • 폐소형가전의 재활용 공정에서 발생하는 플라스틱류 중 검정색 플라스틱의 경우 재질 선별이 어려워 혼합물의 형태로 저급 재활용 되고 있다. 본 연구에서는 검정색 플라스틱의 재질별 선별을 위하여 비중선별, 정전선별, 근적외선 선별 및 IR/Raman 분광법 등 기존 선별 기술의 검토를 통하여, 현장 적용에 대한 문제점 및 제한사항을 확인하였다. 검정색 플라스틱의 재질선별에 대한 기술적 한계를 극복하기 위하여 레이저유도붕괴분광법(Laser Induced Breakdown Spectroscopy, LIBS)을 이용하여 검정색 플라스틱의 각 재질별 LIBS 스펙트럼을 분석하였으며, 정규화 과정을 수행한 후 차원축소 알고리즘인 주성분 분석(Principal Component Analysis, PCA)을 수행하였다. 또한, 검정색 플라스틱의 각 재질별 LIBS 스펙트럼 분석 및 주성분 분석을 통하여 향후 재질별 인식 및 선별 기술의 현장적용을 위해서는 추가적으로 해결해야 할 문제점을 확인하였다. 검정색 플라스틱의 재질별 인식의 정확성 및 선별효율의 향상을 위하여 지능형 알고리즘 분야의 연구를 통하여 효율이 우수한 분류기를 설계하고 분류기의 성능 및 신뢰도 향상을 위한 연구가 추가적으로 진행되어야 할 것으로 사료된다.

정렬 알고리즘의 성능향상을 위한 정보블록 전처리 알고리즘 (Information Block Preprocessing Algorithm(IBPA) for Improving Performances of Sorting Algorithms)

  • 송태옥;송기상
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2000년도 가을 학술발표논문집 Vol.27 No.2 (1)
    • /
    • pp.557-559
    • /
    • 2000
  • 본 논문에서는 기존의 정렬 알고리즘의 성능을 향상시키기 위하여 정보블록 전처리알고리즘(IBPA)이라는 전처리 알고리즘을 제안한다. IBPA는 정렬된 리스트(list)에 있는 데이터에 관한 정보를 생성하고, 생성된 정보를 이용하여 각 데이터를 재배치하며, 실제적인 정렬은 기존의 정렬 알고리즘을 그대로 이용하여 이루어진다. IBPA의 성능을 측정해본 결과, 2백만개의 랜덤데이터를 정렬한 경우, O(N2)의 평균시간복잡도를 갖는 정렬알고리즘의 0.003%, O(NlogN)의 평균시간복잡도를 갖는 정렬알고리즘의 52%, 그리고 O(N)의 평균시간복잡도를 갖는 정렬알고리즘의 89%정도의 비교회수만으로도 정렬할 수 있음을 보여주었다.

  • PDF

충돌해석을 위한 병렬유한요소 알고리즘 (A Parallel Finite Element Procedure for Contact-Impact Problems)

  • 하재선
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2003년도 추계학술대회
    • /
    • pp.1286-1290
    • /
    • 2003
  • This paper presents a newly implemented parallel finite element procedure for contact-impact problems. Three sub-algorithms are includes in the proposed parallel contact-impact procedure, such as a parallel Belytschko-Lin-Tsay (BLT) shell element generation, a parallel explicit time integration scheme, and a parallel contact search algorithm based on the master slave slide-line algorithm. The underlying focus of the algorithms is on its effectiveness and efficiency for inclusion in future finite element systems on parallel computers. Throughout this research, a prototype code, named GT-PARADYN, is developed on the IBM SP2, a distributed-memory computer. Some numerical examples are provided to demonstrate the timing results of the procedure, discussing the accuracy and efficiency of the code.

  • PDF