• Title/Summary/Keyword: Information Processing Time

Search Result 8,180, Processing Time 0.038 seconds

Routing Techniques for Data Aggregation in Sensor Networks

  • Kim, Jeong-Joon
    • Journal of Information Processing Systems
    • /
    • v.14 no.2
    • /
    • pp.396-417
    • /
    • 2018
  • GR-tree and query aggregation techniques have been proposed for spatial query processing in conventional spatial query processing for wireless sensor networks. Although these spatial query processing techniques consider spatial query optimization, time query optimization is not taken into consideration. The index reorganization cost and communication cost for the parent sensor nodes increase the energy consumption that is required to ensure the most efficient operation in the wireless sensor node. This paper proposes itinerary-based R-tree (IR-tree) for more efficient spatial-temporal query processing in wireless sensor networks. This paper analyzes the performance of previous studies and IR-tree, which are the conventional spatial query processing techniques, with regard to the accuracy, energy consumption, and query processing time of the query results using the wireless sensor data with Uniform, Gauss, and Skew distributions. This paper proves the superiority of the proposed IR-tree-based space-time indexing.

A Study on the Analysis Method of Artificial Intelligence for Real-Time Data Prediction. (실시간 데이터 예측을 위한 인공지능 분석 방법 연구)

  • Hong, Phil-Doo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.05a
    • /
    • pp.547-549
    • /
    • 2021
  • In Artificial Intelligence analysis, the process of creating a model and verifying it is a task that requires computational processing time because it is Batch Processing performed with already generated data. We need to model, validate, and predict real-time data, such as stocks and defense information, with data generated directly in front of us. As a solution to this, we solve it by applying techniques to segment the data required for artificial intelligence modeling tasks in order of time processing and distribute the data across multiple processes.

  • PDF

Real-time comprehensive image processing system for detecting concrete bridges crack

  • Lin, Weiguo;Sun, Yichao;Yang, Qiaoning;Lin, Yaru
    • Computers and Concrete
    • /
    • v.23 no.6
    • /
    • pp.445-457
    • /
    • 2019
  • Cracks are an important distress of concrete bridges, and may reduce the life and safety of bridges. However, the traditional manual crack detection means highly depend on the experience of inspectors. Furthermore, it is time-consuming, expensive, and often unsafe when inaccessible position of bridge is to be assessed, such as viaduct pier. To solve this question, the real-time automatic crack detecting system with unmanned aerial vehicle (UAV) become a choice. This paper designs a new automatic detection system based on real-time comprehensive image processing for bridge crack. It has small size, light weight, low power consumption and can be carried on a small UAV for real-time data acquisition and processing. The real-time comprehensive image processing algorithm used in this detection system combines the advantage of connected domain area, shape extremum, morphology and support vector data description (SVDD). The performance and validity of the proposed algorithm and system are verified. Compared with other detection method, the proposed system can effectively detect cracks with high detection accuracy and high speed. The designed system in this paper is suitable for practical engineering applications.

Novel Parallel Approach for SIFT Algorithm Implementation

  • Le, Tran Su;Lee, Jong-Soo
    • Journal of information and communication convergence engineering
    • /
    • v.11 no.4
    • /
    • pp.298-306
    • /
    • 2013
  • The scale invariant feature transform (SIFT) is an effective algorithm used in object recognition, panorama stitching, and image matching. However, due to its complexity, real-time processing is difficult to achieve with current software approaches. The increasing availability of parallel computers makes parallelizing these tasks an attractive approach. This paper proposes a novel parallel approach for SIFT algorithm implementation using a block filtering technique in a Gaussian convolution process on the SIMD Pixel Processor. This implementation fully exposes the available parallelism of the SIFT algorithm process and exploits the processing and input/output capabilities of the processor, which results in a system that can perform real-time image and video compression. We apply this implementation to images and measure the effectiveness of such an approach. Experimental simulation results indicate that the proposed method is capable of real-time applications, and the result of our parallel approach is outstanding in terms of the processing performance.

Implementation of Query Processing System in Temporal Databases (시간지원 데이터베이스의 질의처리 시스템 구현)

  • Lee, Eon-Bae;Kim, Dong-Ho;Ryu, Keun-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.6
    • /
    • pp.1418-1430
    • /
    • 1998
  • Temporal databases support an efficient historical management by means of valid time and transaction time. Valid time stands for the time when a data happens in the real world. And transaction time stands for the time when a data is stored in the database, Temporal Query Processing System(TQPS) should be extended so as tc process the temporal operations for the historical informations in the user query as well as the conventional relational operations. In this paper, the extended temporal query processing systems which is based on the previous temporal query processing system for TQuel(Temporal Query Language) consists of the temporal syntax analyzer, temporal semantic analyzer, temporal code generator, and temporal interpreter is to be described, The algorithm for additional functions such as transaction time management, temporal aggregates, temporal views, temporal joins and the heuristic optimization functions and their example how to be processed is shown.

  • PDF

Processing-Node Status-based Message Scattering and Gathering for Multi-processor Systems on Chip

  • Park, Jongsu
    • Journal of information and communication convergence engineering
    • /
    • v.17 no.4
    • /
    • pp.279-284
    • /
    • 2019
  • This paper presents processing-node status-based message scattering and gathering algorithms for multi-processor systems on chip to reduce the communication time between processors. In the message-scattering part of the message-passing interface (MPI) scatter function, data transmissions are ordered according to the proposed linear algorithm, based on the processor status. The MPI hardware unit in the root processing node checks whether each processing node's status is 'free' or 'busy' when an MPI scatter message is received. Then, it first transfers the data to a 'free' processing node, thereby reducing the scattering completion time. In the message-gathering part of the MPI gather function, the data transmissions are ordered according to the proposed linear algorithm, and the gathering is performed. The root node receives data from the processing node that wants to transfer first, and reduces the completion time during the gathering. The experimental results show that the performance of the proposed algorithm increases at a greater rate as the number of processing nodes increases.

Spatiotemporal Data Model and Extension of their Operations for a Layered Temporal Geographic Information System (계층적 시간지원 지리정보 시스템을 위한 시공간 데이터 모델과 그 연산자 확장)

  • Kim, Dong-Ho;Lee, Jong-Yun;Joo, Young-Do;Ryu, Keun-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.5
    • /
    • pp.1083-1097
    • /
    • 1998
  • The conventional geographic information systems(GIS) is a software which handles spatial and aspatial information of objects in the real world. The system can not support users time-varying information because it manipulates their snapshot data in the spatial database. Also even though it supports time-varying information, it is very limited and hs many difficulties in presenting and processing queries. This paper therefore describes an integrated spatiotemporal data model using loosely-coupled approach which is extended a time dimension for the previous spatial database and which handles time-varying historical information of spatial objects. Conclusionally this paper not only designed a data structure for spatiotemporal database, but also implemented spatial comparison operations varying over time.

  • PDF

Video Quality Assessment Based on Short-Term Memory

  • Fang, Ying;Chen, Weiling;Zhao, Tiesong;Xu, Yiwen;Chen, Jing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.7
    • /
    • pp.2513-2530
    • /
    • 2021
  • With the fast development of information and communication technologies, video streaming services and applications are increasing rapidly. However, the network condition is volatile. In order to provide users with better quality of service, it is necessary to develop an accurate and low-complexity model for Quality of Experience (QoE) prediction of time-varying video. Memory effects refer to the psychological influence factor of historical experience, which can be taken into account to improve the accuracy of QoE evaluation. In this paper, we design subjective experiments to explore the impact of Short-Term Memory (STM) on QoE. The experimental results show that the user's real-time QoE is influenced by the duration of previous viewing experience and the expectations generated by STM. Furthermore, we propose analytical models to determine the relationship between intrinsic video quality, expectation and real-time QoE. The proposed models have better performance for real-time QoE prediction when the video is transmitted in a fluctuate network. The models are capable of providing more accurate guidance for improving the quality of video streaming services.

Improvement of Processing Speed for UAV Attitude Information Estimation Using ROI and Parallel Processing

  • Ha, Seok-Wun;Park, Myeong-Chul
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.1
    • /
    • pp.155-161
    • /
    • 2021
  • Recently, researches for military purposes such as precision tracking and mission completion using UAVs have been actively conducted. In particular, if the posture information of the leading UAV is estimated and the mission UAV uses this information to follow in stealth and complete its mission, the speed of the posture information estimation of the guide UAV must be processed in real time. Until recently, research has been conducted to accurately estimate the posture information of the leading UAV using image processing and Kalman filters, but there has been a problem in processing speed due to the sequential processing of the processing process. Therefore, in this study we propose a way to improve processing speed by applying methods that the image processing area is limited to the ROI area including the object, not the entire area, and the continuous processing is distributed to OpenMP-based multi-threads and processed in parallel with thread synchronization to estimate attitude information. Based on the experimental results, it was confirmed that real-time processing is possible by improving the processing speed by more than 45% compared to the basic processing, and thus the possibility of completing the mission can be increased by improving the tracking and estimating speed of the mission UAV.

The Data Processing Method for Small Samples and Multi-variates Series in GPS Deformation Monitoring

  • Guo-Lin, Liu;Wen-Hua, Zheng;Xin-Zhou, Wang;Lian-Peng, Zhang
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.1
    • /
    • pp.185-189
    • /
    • 2006
  • Time series analysis is a frequently effective method of constructing model and prediction in data processing of deformation monitoring. The monitoring data sample must to be as more as possible and time intervals are equal roughly so as to construct time series model accurately and achieve reliable prediction. But in the project practice of GPS deformation monitoring, the monitoring data sample can't be obtained too much and time intervals are not equal because of being restricted by all kinds of factors, and it contains many variates in the deformation model moreover. It is very important to study the data processing method for small samples and multi-variates time series in GPS deformation monitoring. A new method of establishing small samples and multi-variates deformation model and prediction model are put forward so as to resolve contradiction of small samples and multi-variates encountered in constructing deformation model and improve formerly data processing method of deformation monitoring. Based on the system theory, a deformation body is regarded as a whole organism; a time-dependence linear system model and a time-dependence bilinear system model are established. The dynamic parameters estimation is derived by means of prediction fit and least information distribution criteria. The final example demonstrates the validity and practice of this method.

  • PDF