• 제목/요약/키워드: Detection algorithms

Search Result 1,873, Processing Time 0.03 seconds

Computer Vision-based Continuous Large-scale Site Monitoring System through Edge Computing and Small-Object Detection

  • Kim, Yeonjoo;Kim, Siyeon;Hwang, Sungjoo;Hong, Seok Hwan
    • International conference on construction engineering and project management
    • /
    • 2022.06a
    • /
    • pp.1243-1244
    • /
    • 2022
  • In recent years, the growing interest in off-site construction has led to factories scaling up their manufacturing and production processes in the construction sector. Consequently, continuous large-scale site monitoring in low-variability environments, such as prefabricated components production plants (precast concrete production), has gained increasing importance. Although many studies on computer vision-based site monitoring have been conducted, challenges for deploying this technology for large-scale field applications still remain. One of the issues is collecting and transmitting vast amounts of video data. Continuous site monitoring systems are based on real-time video data collection and analysis, which requires excessive computational resources and network traffic. In addition, it is difficult to integrate various object information with different sizes and scales into a single scene. Various sizes and types of objects (e.g., workers, heavy equipment, and materials) exist in a plant production environment, and these objects should be detected simultaneously for effective site monitoring. However, with the existing object detection algorithms, it is difficult to simultaneously detect objects with significant differences in size because collecting and training massive amounts of object image data with various scales is necessary. This study thus developed a large-scale site monitoring system using edge computing and a small-object detection system to solve these problems. Edge computing is a distributed information technology architecture wherein the image or video data is processed near the originating source, not on a centralized server or cloud. By inferring information from the AI computing module equipped with CCTVs and communicating only the processed information with the server, it is possible to reduce excessive network traffic. Small-object detection is an innovative method to detect different-sized objects by cropping the raw image and setting the appropriate number of rows and columns for image splitting based on the target object size. This enables the detection of small objects from cropped and magnified images. The detected small objects can then be expressed in the original image. In the inference process, this study used the YOLO-v5 algorithm, known for its fast processing speed and widely used for real-time object detection. This method could effectively detect large and even small objects that were difficult to detect with the existing object detection algorithms. When the large-scale site monitoring system was tested, it performed well in detecting small objects, such as workers in a large-scale view of construction sites, which were inaccurately detected by the existing algorithms. Our next goal is to incorporate various safety monitoring and risk analysis algorithms into this system, such as collision risk estimation, based on the time-to-collision concept, enabling the optimization of safety routes by accumulating workers' paths and inferring the risky areas based on workers' trajectory patterns. Through such developments, this continuous large-scale site monitoring system can guide a construction plant's safety management system more effectively.

  • PDF

A Quantitative Approach to Minimize Energy Consumption in Cloud Data Centres using VM Consolidation Algorithm

  • M. Hema;S. KanagaSubaRaja
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.2
    • /
    • pp.312-334
    • /
    • 2023
  • In large-scale computing, cloud computing plays an important role by sharing globally-distributed resources. The evolution of cloud has taken place in the development of data centers and numerous servers across the globe. But the cloud information centers incur huge operational costs, consume high electricity and emit tons of dioxides. It is possible for the cloud suppliers to leverage their resources and decrease the consumption of energy through various methods such as dynamic consolidation of Virtual Machines (VMs), by keeping idle nodes in sleep mode and mistreatment of live migration. But the performance may get affected in case of harsh consolidation of VMs. So, it is a desired trait to have associate degree energy-performance exchange without compromising the quality of service while at the same time reducing the power consumption. This research article details a number of novel algorithms that dynamically consolidate the VMs in cloud information centers. The primary objective of the study is to leverage the computing resources to its best and reduce the energy consumption way behind the Service Level Agreement (SLA)drawbacks relevant to CPU load, RAM capacity and information measure. The proposed VM consolidation Algorithm (PVMCA) is contained of four algorithms: over loaded host detection algorithm, VM selection algorithm, VM placement algorithm, and under loading host detection algorithm. PVMCA is dynamic because it uses dynamic thresholds instead of static thresholds values, which makes it suggestion for real, unpredictable workloads common in cloud data centers. Also, the Algorithms are adaptive because it inevitably adjusts its behavior based on the studies of historical data of host resource utilization for any application with diverse workload patterns. Finally, the proposed algorithm is online because the algorithms are achieved run time and make an action in response to each request. The proposed algorithms' efficiency was validated through different simulations of extensive nature. The output analysis depicts the projected algorithms scaled back the energy consumption up to some considerable level besides ensuring proper SLA. On the basis of the project algorithms, the energy consumption got reduced by 22% while there was an improvement observed in SLA up to 80% compared to other benchmark algorithms.

Experimental studies on impact damage location in composite aerospace structures using genetic algorithms and neural networks

  • Mahzan, Shahruddin;Staszewski, Wieslaw J.;Worden, Keith
    • Smart Structures and Systems
    • /
    • v.6 no.2
    • /
    • pp.147-165
    • /
    • 2010
  • Impact damage detection in composite structures has gained a considerable interest in many engineering areas. The capability to detect damage at the early stages reduces any risk of catastrophic failure. This paper compares two advanced signal processing methods for impact location in composite aircraft structures. The first method is based on a modified triangulation procedure and Genetic Algorithms whereas the second technique applies Artificial Neural Networks. A series of impacts is performed experimentally on a composite aircraft wing-box structure instrumented with low-profile, bonded piezoceramic sensors. The strain data are used for learning in the Neural Network approach. The triangulation procedure utilises the same data to establish impact velocities for various angles of strain wave propagation. The study demonstrates that both approaches are capable of good impact location estimates in this complex structure.

Impulsive noise filtering in severely corrupted color images using detection-estimation based approaches (심하게 손상된 칼라 영상의 잡음 검출 방식을 이용한 임펄스 잡음 제거 기술)

  • 이규철;최윤정;손광훈
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.6B
    • /
    • pp.1021-1027
    • /
    • 2000
  • In this paper, we propose two new detection-estimation based algorithms that effectively remove impulsive noises in severely corrupted color images. The existing methods for enhancing corrupted color images with impulsive noises commonly possess the inherent problems of excessive computing time and smoothing out edges. However, since our proposed algorithms classify corrupted pixels first in each channel or in each pixel and then perform marginal or vector median filtering only for them, are computationally efficient and preserve edges well. In addition, since there are no appropriate criteria to evaluate the performance of impulsive noise detectors for color images, the objective comparison of noise detectors is difficult. Thus, we introduce a new efficiency factor to compare the performance of noise detectors in digital color images. Simulation results show that the proposed algorithms perform better than the existing methods in terms of both objective and subjective evaluat ons.

  • PDF

Review on Digital Image Watermarking Based on Singular Value Decomposition

  • Wang, Chengyou;Zhang, Yunpeng;Zhou, Xiao
    • Journal of Information Processing Systems
    • /
    • v.13 no.6
    • /
    • pp.1585-1601
    • /
    • 2017
  • With the rapid development of computer technologies, a number of image modification methods have emerged, which have great impacts on the security of image information. Therefore, it is necessary to protect the integrity and authenticity of digital images, and digital watermarking technique consequently becomes a research hotspot. An effort is made to survey and analyze advancements of image watermarking algorithms based on singular value decomposition (SVD) in recent years. In the first part, an overview of watermarking techniques is presented and then mathematical theory of SVD is given. Besides, SVD watermarking model, features, and evaluation indexes are demonstrated. Various SVD-based watermarking algorithms, as well as hybrid watermarking algorithms based on SVD and other transforms for copyright protection, tamper detection, location, and recovery are reviewed in the last part.

Structural damage detection based on MAC flexibility and frequency using moth-flame algorithm

  • Ghannadi, Parsa;Kourehli, Seyed Sina
    • Structural Engineering and Mechanics
    • /
    • v.70 no.6
    • /
    • pp.649-659
    • /
    • 2019
  • Vibration-based structural damage detection through optimization algorithms and minimization of objective function has recently become an interesting research topic. Application of various objective functions as well as optimization algorithms may affect damage diagnosis quality. This paper proposes a new damage identification method using Moth-Flame Optimization (MFO). MFO is a nature-inspired algorithm based on moth's ability to navigate in dark. Objective function consists of a term with modal assurance criterion flexibility and natural frequency. To show the performance of the said method, two numerical examples including truss and shear frame have been studied. Furthermore, Los Alamos National Laboratory test structure was used for validation purposes. Finite element model for both experimental and numerical examples was created by MATLAB software to extract modal properties of the structure. Mode shapes and natural frequencies were contaminated with noise in above mentioned numerical examples. In the meantime, one of the classical optimization algorithms called particle swarm optimization was compared with MFO. In short, results obtained from numerical and experimental examples showed that the presented method is efficient in damage identification.

Academic Registration Text Classification Using Machine Learning

  • Alhawas, Mohammed S;Almurayziq, Tariq S
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.1
    • /
    • pp.93-96
    • /
    • 2022
  • Natural language processing (NLP) is utilized to understand a natural text. Text analysis systems use natural language algorithms to find the meaning of large amounts of text. Text classification represents a basic task of NLP with a wide range of applications such as topic labeling, sentiment analysis, spam detection, and intent detection. The algorithm can transform user's unstructured thoughts into more structured data. In this work, a text classifier has been developed that uses academic admission and registration texts as input, analyzes its content, and then automatically assigns relevant tags such as admission, graduate school, and registration. In this work, the well-known algorithms support vector machine SVM and K-nearest neighbor (kNN) algorithms are used to develop the above-mentioned classifier. The obtained results showed that the SVM classifier outperformed the kNN classifier with an overall accuracy of 98.9%. in addition, the mean absolute error of SVM was 0.0064 while it was 0.0098 for kNN classifier. Based on the obtained results, the SVM is used to implement the academic text classification in this work.

Performance Evaluation of Pixel Clustering Approaches for Automatic Detection of Small Bowel Obstruction from Abdominal Radiographs

  • Kim, Kwang Baek
    • Journal of information and communication convergence engineering
    • /
    • v.20 no.3
    • /
    • pp.153-159
    • /
    • 2022
  • Plain radiographic analysis is the initial imaging modality for suspected small bowel obstruction. Among the many features that affect the diagnosis of small bowel obstruction (SBO), the presence of gas-filled or fluid-filled small bowel loops is the most salient feature that can be automatized by computer vision algorithms. In this study, we compare three frequently applied pixel-clustering algorithms for extracting gas-filled areas without human intervention. In a comparison involving 40 suspected SBO cases, the Possibilistic C-Means and Fuzzy C-Means algorithms exhibited initialization-sensitivity problems and difficulties coping with low intensity contrast, achieving low 72.5% and 85% success rates in extraction. The Adaptive Resonance Theory 2 algorithm is the most suitable algorithm for gas-filled region detection, achieving a 100% success rate on 40 tested images, largely owing to its dynamic control of the number of clusters.

Comparison of similarity measures and community detection algorithms using collaboration filtering (협업 필터링을 사용한 유사도 기법 및 커뮤니티 검출 알고리즘 비교)

  • Ugli, Sadriddinov Ilkhomjon Rovshan;Hong, Minpyo;Park, Doo-Soon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.05a
    • /
    • pp.366-369
    • /
    • 2022
  • The glut of information aggravated the process of data analysis and other procedures including data mining. Many algorithms were devised in Big Data and Data Mining to solve such an intricate problem. In this paper, we conducted research about the comparison of several similarity measures and community detection algorithms in collaborative filtering for movie recommendation systems. Movielense data set was used to do an empirical experiment. We applied three different similarity measures: Cosine, Euclidean, and Pearson. Moreover, betweenness and eigenvector centrality were used to detect communities from the network. As a result, we elucidated which algorithm is more suitable than its counterpart in terms of recommendation accuracy.

A Studyon Implementation of Edge Detection Algorithms Based on fuzzy Membership Models (퍼지모델을 기반으로한 에지검출 알고리즘 구현에관한 연구)

  • Lee, Bae-Ho;Kim, So-Yeon;Kim, Kwang-Hee
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.9
    • /
    • pp.2447-2456
    • /
    • 1998
  • Edge detection in the presence of noise is a well-known problem. this pper atempts to implement edge detection algorithms using fuzzy reasoning of fuzzy membership models. It examines an application-motived approach for solving the problem. Our approach is divided into three stages; fitering, segmentation and tracing. Filtering removes the noise from the original image and segmentation determines the edges and deects them. Finally, tracing assembles the edges into the related structure. Proposed method can be used effectively on these procedures by using fuzzy reasoning based on fuzzy models. In is compared with the previous edge detectio algorithms with fvorable results. Simulation results of the research are presented and discussed.

  • PDF