• Title/Summary/Keyword: Image processing algorithms

Search Result 901, Processing Time 0.029 seconds

A Global Framework for Parallel and Distributed Application with Mobile Objects (이동 객체 기반 병렬 및 분산 응용 수행을 위한 전역 프레임워크)

  • Han, Youn-Hee;Park, Chan-Yeol;Hwang, Chong-Sun;Jeong, Young-Sik
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.6
    • /
    • pp.555-568
    • /
    • 2000
  • The World Wide Web has become the largest virtual system that is almost universal in scope. In recent research, it has become effective to utilize idle hosts existing in the World Wide Web for running applications that require a substantial amount of computation. This novel computing paradigm has been referred to as the advent of global computing. In this paper, we implement and propose a mobile object-based global computing framework called Tiger, whose primary goal is to present novel object-oriented programming libraries that support distribution, dispatching, migration of objects and concurrency among computational activities. The programming libraries provide programmers with access, location and migration transparency for distributed and mobile objects. Tiger's second goal is to provide a system supporting requisites for a global computing environment - scalability, resource and location management. The Tiger system and the programming libraries provided allow a programmer to easily develop an objectoriented parallel and distributed application using globally extended computing resources. We also present the improvement in performance gained by conducting the experiment with highly intensive computations such as parallel fractal image processing and genetic-neuro-fuzzy algorithms.

  • PDF

Recovery of Missing Motion Vectors Using Modified ALA Clustering Algorithm (수정된 ALA 클러스터링 알고리즘을 이용한 손실된 움직임 벡터 복원 방법)

  • Son, Nam-Rye;Lee, Guee-Sang
    • The KIPS Transactions:PartB
    • /
    • v.12B no.7 s.103
    • /
    • pp.755-760
    • /
    • 2005
  • To transmit a video bit stream over low bandwith, such as mobile, channels, encoding algorithms for high bit rate like H.263+ are used. In transmitting video bit-streams, packet losses cause severe degradation in image quality. This paper proposes a new algorithm for the recovery of missing or erroneous motion vectors when H.263+ bit-stream is transmitted. Considering that the missing or erroneous motion vectors are closely related with those of neighboring blocks, this paper proposes a temporal-spatial error concealment algorithm. The proposed approach is that missing or erroneous Motion Vectors(MVs) are recovered by clustering the movements of neighboring blocks by their homogeneity. MVs of neighboring blocks we clustered according to ALA(Average Linkage Algorithm) clustering and a representative value for each cluster is determined to obtain the candidate MV set. By computing the distortion of the candidates, a MV with the minimum distortion is selected. Experimental results show that the proposed algorithm exhibits better performance in subjective and objective evaluation than existing methods.

An Optimal Cluster Analysis Method with Fuzzy Performance Measures (퍼지 성능 측정자를 결합한 최적 클러스터 분석방법)

  • 이현숙;오경환
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.6 no.3
    • /
    • pp.81-88
    • /
    • 1996
  • Cluster analysis is based on partitioning a collection of data points into a number of clusters, where the data points in side a cluster have a certain degree of similarity and it is a fundamental process of data analysis. So, it has been playing an important role in solving many problems in pattern recognition and image processing. For these many clustering algorithms depending on distance criteria have been developed and fuzzy set theory has been introduced to reflect the description of real data, where boundaries might be fuzzy. If fuzzy cluster analysis is tomake a significant contribution to engineering applications, much more attention must be paid to fundamental questions of cluster validity problem which is how well it has identified the structure that is present in the data. Several validity functionals such as partition coefficient, claasification entropy and proportion exponent, have been used for measuring validity mathematically. But the issue of cluster validity involves complex aspects, it is difficult to measure it with one measuring function as the conventional study. In this paper, we propose four performance indices and the way to measure the quality of clustering formed by given learning strategy.

  • PDF

Application of object detection algorithm for psychological analysis of children's drawing (아동 그림 심리분석을 위한 인공지능 기반 객체 탐지 알고리즘 응용)

  • Yim, Jiyeon;Lee, Seong-Oak;Kim, Kyoung-Pyo;Yu, Yonggyun
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.26 no.5
    • /
    • pp.1-9
    • /
    • 2021
  • Children's drawings are widely used in the diagnosis of children's psychology as a means of expressing inner feelings. This paper proposes a children's drawings-based object detection algorithm applicable to children's psychology analysis. First, the sketch area from the picture was extracted and the data labeling process was also performed. Then, we trained and evaluated a Faster R-CNN based object detection model using the labeled datasets. Based on the detection results, information about the drawing's area, position, or color histogram is calculated to analyze primitive information about the drawings quickly and easily. The results of this paper show that Artificial Intelligence-based object detection algorithms were helpful in terms of psychological analysis using children's drawings.

Implementation of Neural Network Accelerator for Rendering Noise Reduction on OpenCL (OpenCL을 이용한 랜더링 노이즈 제거를 위한 뉴럴 네트워크 가속기 구현)

  • Nam, Kihun
    • The Journal of the Convergence on Culture Technology
    • /
    • v.4 no.4
    • /
    • pp.373-377
    • /
    • 2018
  • In this paper, we propose an implementation of a neural network accelerator for reducing the rendering noise using OpenCL. Among the rendering algorithms, we selects a ray tracing to assure a high quality graphics. Ray tracing rendering uses ray to render, less use of the ray will result in noise. Ray used more will produce a higher quality image but will take operation time longer. To reduce operation time whiles using fewer rays, Learning Base Filtering algorithm using neural network was applied. it's not always produce optimize result. In this paper, a new approach to Matrix Multiplication that is based on General Matrix Multiplication for improved performance. The development environment, we used specialized in high speed parallel processing of OpenCL. The proposed architecture was verified using Kintex UltraScale XKU6909T-2FDFG1157C FPGA board. The time it takes to calculate the parameters is about 1.12 times fast than that of Verilog-HDL structure.

Analysis of Level of Difficulty of Fingerprint Database by matching Orientation field (Orientation field의 정합을 이용한 지문영상 DB의 난이도 분석)

  • Park Noh-Jun;Moon Ji-Hyun;Kim Hak-Il
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.16 no.4
    • /
    • pp.91-103
    • /
    • 2006
  • This paper proposes a methodology to evaluate the quality and level of difficulty of fingerprint image databases, which leads to objective evaluation for the performance of fingerprint recognition system. Influencing factors to fingerprint matching are defined and the matching performance between two fingerprint images is evaluated using segmentation and orientation filed. In this study, a hierarchical processing method is proposed to measure an orientation field, which is able to improve the matching speed and accuracy. The results of experiments demonstrate that the defined influencing factors can describe the characteristics of fingerprint databases. Level of difficulty for fingerprint databases enables the performance of fingerprint recognition algorithms to be evaluated and compared even with different databases.

Detection Algorithm of Road Surface Damage Using Adversarial Learning (적대적 학습을 이용한 도로 노면 파손 탐지 알고리즘)

  • Shim, Seungbo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.20 no.4
    • /
    • pp.95-105
    • /
    • 2021
  • Road surface damage detection is essential for a comfortable driving environment and the prevention of safety accidents. Road management institutes are using automated technology-based inspection equipment and systems. As one of these automation technologies, a sensor to detect road surface damage plays an important role. For this purpose, several studies on sensors using deep learning have been conducted in recent years. Road images and label images are needed to develop such deep learning algorithms. On the other hand, considerable time and labor will be needed to secure label images. In this paper, the adversarial learning method, one of the semi-supervised learning techniques, was proposed to solve this problem. For its implementation, a lightweight deep neural network model was trained using 5,327 road images and 1,327 label images. After experimenting with 400 road images, a model with a mean intersection over a union of 80.54% and an F1 score of 77.85% was developed. Through this, a technology that can improve recognition performance by adding only road images was developed to learning without label images and is expected to be used as a technology for road surface management in the future.

Design of visitor counting system using edge computing method

  • Kim, Jung-Jun;Kim, Min-Gyu;Kim, Ju-Hyun;Lee, Man-Gi;Kim, Da-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.7
    • /
    • pp.75-82
    • /
    • 2022
  • There are various exhibition halls, shopping malls, theme parks around us and analysis of interest in exhibits or contents is mainly done through questionnaires. These questionnaires are mainly depend on the subjective memory of the person being investigated, resulting in incorrect statistical results. Therefore, it is possible to identify an exhibition space with low interest by tracking the movement and counting the number of visitors. Based on this, it can be used as quantitative data for exhibits that need replacement. In this paper, we use deep learning-based artificial intelligence algorithms to recognize visitors, assign IDs to the recognized visitors, and continuously track them to identify the movement path. When visitors pass the counting line, the system is designed to count the number and transmit data to the server for integrated management.

Micro-computed tomography for assessing the internal and external voids of bulk-fill composite restorations: A technical report

  • Tosco, Vincenzo;Monterubbianesi, Riccardo;Furlani, Michele;Giuliani, Alessandra;Putignano, Angelo;Orsini, Giovanna
    • Imaging Science in Dentistry
    • /
    • v.52 no.3
    • /
    • pp.303-308
    • /
    • 2022
  • Purpose: This technical report aims to describe and detail the use of micro-computed tomography for a reliable evaluation of the bulk-fill composite/tooth interface. Materials and Methods: Bulk-fill composite restorations in tooth cavities were scanned using micro-computed tomography to obtain qualitatively and quantitatively valuable information. Two-dimensional information was processed using specific algorithms, and ultimately a 3-dimensional (3D) specimen reconstruction was generated. The 3D rendering allowed the visualization of voids inside bulk-fill composite materials and provided quantitative measurements. The 3D analysis software VG Studio MAX was used to perform image analysis and assess gap formation within the tooth-restoration interface. In particular, to evaluate internal adaptation, the Defect Analysis addon module of VG Studio Max was used. Results: The data, obtained with the processing software, highlighted the presence and the shape of gaps in different colours, representing the volume of porosity within a chromatic scale in which each colour quantitatively represents a well-defined volume. Conclusion: Micro-computed tomography makes it possible to obtain several quantitative parameters, providing fundamental information on defect shape and complexity. However, this technique has the limit of not discriminating materials without radiopacity and with low or no filler content, such as dental adhesives, and hence, they are difficult to visualise through software reconstruction.

A Study of Tram-Pedestrian Collision Prediction Method Using YOLOv5 and Motion Vector (YOLOv5와 모션벡터를 활용한 트램-보행자 충돌 예측 방법 연구)

  • Kim, Young-Min;An, Hyeon-Uk;Jeon, Hee-gyun;Kim, Jin-Pyeong;Jang, Gyu-Jin;Hwang, Hyeon-Chyeol
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.10 no.12
    • /
    • pp.561-568
    • /
    • 2021
  • In recent years, autonomous driving technologies have become a high-value-added technology that attracts attention in the fields of science and industry. For smooth Self-driving, it is necessary to accurately detect an object and estimate its movement speed in real time. CNN-based deep learning algorithms and conventional dense optical flows have a large consumption time, making it difficult to detect objects and estimate its movement speed in real time. In this paper, using a single camera image, fast object detection was performed using the YOLOv5 algorithm, a deep learning algorithm, and fast estimation of the speed of the object was performed by using a local dense optical flow modified from the existing dense optical flow based on the detected object. Based on this algorithm, we present a system that can predict the collision time and probability, and through this system, we intend to contribute to prevent tram accidents.