• 제목/요약/키워드: Step number detection algorithm

검색결과 56건 처리시간 0.022초

Lost gamma source detection algorithm based on convolutional neural network

  • Fathi, Atefeh;Masoudi, S. Farhad
    • Nuclear Engineering and Technology
    • /
    • 제53권11호
    • /
    • pp.3764-3771
    • /
    • 2021
  • Based on the convolutional neural network (CNN), a novel technique is investigated for lost gamma source detection in a room. The CNN is trained with the result of a GEANT4 simulation containing a gamma source inside a meshed room. The dataset for the training process is the deposited energy in the meshes of different n-step paths. The neural network is optimized with parameters such as the number of input data and path length. Based on the proposed method, the place of the gamma source can be recognized with reasonable accuracy without human intervention. The results show that only by 5 measurements of the energy deposited in a 5-step path, (5 sequential points 50 cm apart within 1600 meshes), the gamma source location can be estimated with 94% accuracy. Also, the method is tested for the room geometry containing the interior walls. The results show 90% accuracy with the energy deposition measurement in the meshes of a 5-step path.

Hybrid Model Based Intruder Detection System to Prevent Users from Cyber Attacks

  • Singh, Devendra Kumar;Shrivastava, Manish
    • International Journal of Computer Science & Network Security
    • /
    • 제21권4호
    • /
    • pp.272-276
    • /
    • 2021
  • Presently, Online / Offline Users are facing cyber attacks every day. These cyber attacks affect user's performance, resources and various daily activities. Due to this critical situation, attention must be given to prevent such users through cyber attacks. The objective of this research paper is to improve the IDS systems by using machine learning approach to develop a hybrid model which controls the cyber attacks. This Hybrid model uses the available KDD 1999 intrusion detection dataset. In first step, Hybrid Model performs feature optimization by reducing the unimportant features of the dataset through decision tree, support vector machine, genetic algorithm, particle swarm optimization and principal component analysis techniques. In second step, Hybrid Model will find out the minimum number of features to point out accurate detection of cyber attacks. This hybrid model was developed by using machine learning algorithms like PSO, GA and ELM, which trained the system with available data to perform the predictions. The Hybrid Model had an accuracy of 99.94%, which states that it may be highly useful to prevent the users from cyber attacks.

Online Video Synopsis via Multiple Object Detection

  • Lee, JaeWon;Kim, DoHyeon;Kim, Yoon
    • 한국컴퓨터정보학회논문지
    • /
    • 제24권8호
    • /
    • pp.19-28
    • /
    • 2019
  • In this paper, an online video summarization algorithm based on multiple object detection is proposed. As crime has been on the rise due to the recent rapid urbanization, the people's appetite for safety has been growing and the installation of surveillance cameras such as a closed-circuit television(CCTV) has been increasing in many cities. However, it takes a lot of time and labor to retrieve and analyze a huge amount of video data from numerous CCTVs. As a result, there is an increasing demand for intelligent video recognition systems that can automatically detect and summarize various events occurring on CCTVs. Video summarization is a method of generating synopsis video of a long time original video so that users can watch it in a short time. The proposed video summarization method can be divided into two stages. The object extraction step detects a specific object in the video and extracts a specific object desired by the user. The video summary step creates a final synopsis video based on the objects extracted in the previous object extraction step. While the existed methods do not consider the interaction between objects from the original video when generating the synopsis video, in the proposed method, new object clustering algorithm can effectively maintain interaction between objects in original video in synopsis video. This paper also proposed an online optimization method that can efficiently summarize the large number of objects appearing in long-time videos. Finally, Experimental results show that the performance of the proposed method is superior to that of the existing video synopsis algorithm.

Automated Vessels Detection on Infant Retinal Images

  • Sukkaew, Lassada;Uyyanonvara, Bunyarit;Barman, Sarah A;Jareanjit, Jaruwat
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2004년도 ICCAS
    • /
    • pp.321-325
    • /
    • 2004
  • Retinopathy of Prematurity (ROP) is a common retinal neovascular disorder of premature infants. It can be characterized by inappropriate and disorganized vessel. This paper present a method for blood vessel detection on infant retinal images. The algorithm is designed to detect the retinal vessels. The proposed method applies a Lapalacian of Gaussian as a step-edge detector based on the second-order directional derivative to identify locations of the edge of vessels with zero crossings. The procedure allows parameters computation in a fixed number of operations independent of kernel size. This method is composed of four steps : grayscale conversion, edge detection based on LOG, noise removal by adaptive Wiener filter & median filter, and Otsu's global thresholding. The algorithm has been tested on twenty infant retinal images. In cooperation with the Digital Imaging Research Centre, Kingston University, London and Department of Opthalmology, Imperial College London who supplied all the images used in this project. The algorithm has done well to detect small thin vessels, which are of interest in clinical practice.

  • PDF

애니메이션 속도에 무관한 충돌 탐지 알고리즘 (An Animation Speed-independent Collision Detection Algorithm)

  • 김형석
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제31권3_4호
    • /
    • pp.247-256
    • /
    • 2004
  • 본 논문에서는 애니메이션 속도에 무관한 충돌 탐지 알고리즘을 제안한다. 현재까지 개발된 대부분의 충들 탐지 알고리즘들은 점진적(incremental) 알고리즘들로서, 현 시점에서의 가까운 점(근점)을 찾기 위하여 이전 시점의 근점 주위를 먼저 찾는다. 그런데 만일 움직이는 물체가 충돌 반응에 의해서 큰 토크를 받게 된다면 회전 속도가 증가하게 되어, 다음 시점에서의 실제 근점은 현 시점에서의 근점과는 매우 동떨어져 있어 엉뚱한 위치에서 근점을 찾게 되는 단점을 가진다. 그러므로, 최악의 경우에는 각 시점에서 $O(n^2)$, 시간이 소요될 수 있다. 또한 애니메이션 속도에 따라 이러한 점진적 계산 회수가 변하게 되어 전체적인 알고리즘의 소요 시간이 변하게 되는 단점을 가지고 있다. 본 논문에서는 이러한 문제점을 근본적으로 해결하고자 새로운 방법을 제안하고자 한다. 먼저, 기하학 특성을 내포하는 구면 근점 다이아그램을 생성하고, 이를 이용하여 두 물체간의 단일 거리 함수를 생성한다. 충돌 시점을 효율적으로 찾기 위해서 구간 뉴튼 방법을 거리함수에 적용한다.

Design of a 6-bit 500MS/s CMOS A/D Converter with Comparator-based Input Voltage Range Detection Circuit

  • Dae, Si;Yoon, Kwang Sub
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제14권6호
    • /
    • pp.706-711
    • /
    • 2014
  • A low power 6-bit flash ADC that uses an input voltage range detection algorithm is described. An input voltage level detector circuit has been designed to overcome the disadvantages of the flash ADC which consume most of the dynamic power dissipation due to comparators array. In this work, four digital input voltage range detectors are employed and each input voltage range detector generates the specific clock signal only if the input voltage falls between two adjacent reference voltages applied to the detector. The specific clock signal generated by the detector is applied to turn the corresponding latched comparators on and the rest of the comparators off. This ADC consumes 68.82 mW with a single power supply of 1.2V and achieves 4.3 effective number of bits for input frequency up to 1 MHz at 500 MS/s. Therefore it results in 4.6 pJ/step of Figure of Merit (FoM). The chip is fabricated in 0.13-um CMOS process.

Feature Selection Algorithm for Intrusions Detection System using Sequential Forward Search and Random Forest Classifier

  • Lee, Jinlee;Park, Dooho;Lee, Changhoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권10호
    • /
    • pp.5132-5148
    • /
    • 2017
  • Cyber attacks are evolving commensurate with recent developments in information security technology. Intrusion detection systems collect various types of data from computers and networks to detect security threats and analyze the attack information. The large amount of data examined make the large number of computations and low detection rates problematic. Feature selection is expected to improve the classification performance and provide faster and more cost-effective results. Despite the various feature selection studies conducted for intrusion detection systems, it is difficult to automate feature selection because it is based on the knowledge of security experts. This paper proposes a feature selection technique to overcome the performance problems of intrusion detection systems. Focusing on feature selection, the first phase of the proposed system aims at constructing a feature subset using a sequential forward floating search (SFFS) to downsize the dimension of the variables. The second phase constructs a classification model with the selected feature subset using a random forest classifier (RFC) and evaluates the classification accuracy. Experiments were conducted with the NSL-KDD dataset using SFFS-RF, and the results indicated that feature selection techniques are a necessary preprocessing step to improve the overall system performance in systems that handle large datasets. They also verified that SFFS-RF could be used for data classification. In conclusion, SFFS-RF could be the key to improving the classification model performance in machine learning.

등각원형배열을 고려한 코히어런트 다중신호 방향탐지 기법 연구 (The Study of Direction Finding Algorithms for Coherent Multiple Signals in Uniform Circular Array)

  • 박철순;이호주;장원
    • 한국군사과학기술학회지
    • /
    • 제12권1호
    • /
    • pp.97-105
    • /
    • 2009
  • In this paper, the performance of AP(Alternating Projection) and EM(Expectation Maximization) algorithms is investigated in terms of detection of multiple signals, resolvability of coherent signals and the efficiency of sensor array processing. The basic idea of these algorithms is utilization of relaxation technique of successive 1D maximization to solve a direction finding problem by maximizing the multidimensional likelihood function. It means that the function is maximized over only for a single parameter while the other parameters are fixed at each step of the iteration. According to simulation results, the algorithms showed good performance for both incoherent and coherent multiple signals. Moreover, some advantages are identified for direction finding with very small samples and fast convergence. The performance of AP algorithm is compared with that of EM using multiple criteria such as the number of sensor, SNR, the number of samples, and convergence speed over uniform circular array. It is resulted AP algorithm is superior to EM overally except for one criterion, convergence speed. Especially, for EM algorithm there is no performance difference between incoherent and coherent case. In conclusion, AP and EM are viable and practical alternatives, which can be applied to a direction under due to the resolvability of multi-path signals, reliable performance and no troublesome eigen-decomposition of the sample-covariance matrix.

PCB 검사를 위한 YOLO 네트워크 기반의 PCB 부품 분류 알고리즘 (PCB Component Classification Algorithm Based on YOLO Network for PCB Inspection)

  • 윤형조;이준재
    • 한국멀티미디어학회논문지
    • /
    • 제24권8호
    • /
    • pp.988-999
    • /
    • 2021
  • AOI (Automatic Optical Inspection) of PCB (Printed Circuit Board) is a very important step to guarantee the product performance. The process of registering components called teaching mode is first perform, and AOI is then carried out in a testing mode that checks defects, such as recognizing and comparing the component mounted on the PCB to the stored components. Since most of registration of the components on the PCB is done manually, it takes a lot of time and there are many problems caused by mistakes or misjudgement. In this paper, A components classifier is proposed using YOLO (You Only Look Once) v2's object detection model that can automatically register components in teaching modes to reduce dramatically time and mistakes. The network of YOLO is modified to classify small objects, and the number of anchor boxes was increased from 9 to 15 to classify various types and sizes. Experimental results show that the proposed method has a good performance with 99.86% accuracy.

A TRUS Prostate Segmentation using Gabor Texture Features and Snake-like Contour

  • Kim, Sung Gyun;Seo, Yeong Geon
    • Journal of Information Processing Systems
    • /
    • 제9권1호
    • /
    • pp.103-116
    • /
    • 2013
  • Prostate cancer is one of the most frequent cancers in men and is a major cause of mortality in the most of countries. In many diagnostic and treatment procedures for prostate disease accurate detection of prostate boundaries in transrectal ultrasound(TRUS) images is required. This is a challenging and difficult task due to weak prostate boundaries, speckle noise and the short range of gray levels. In this paper a method for automatic prostate segmentation in TRUS images using Gabor feature extraction and snake-like contour is presented. This method involves preprocessing, extracting Gabor feature, training, and prostate segmentation. The speckle reduction for preprocessing step has been achieved by using stick filter and top-hat transform has been implemented for smoothing the contour. A Gabor filter bank for extraction of rotation-invariant texture features has been implemented. A support vector machine(SVM) for training step has been used to get each feature of prostate and nonprostate. Finally, the boundary of prostate is extracted by the snake-like contour algorithm. A number of experiments are conducted to validate this method and results showed that this new algorithm extracted the prostate boundary with less than 10.2% of the accuracy which is relative to boundary provided manually by experts.