• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.10a
• /
• pp.995-997
• /
• 2018

본 논문에서는 운영체제나 하드웨어에 종속되지 않고 IoT 환경을 구축할 수 있는 EdgeX Foundry를 이용하여 EdgeX와 두 대의 라즈베리파이 간의 통신을 구현한다. 두 라즈베리파이가 보낸 센서값은 EdgeX를 거쳐 EdgeX Client로 전해지며, 처리된 값은 두 라즈베리파이 중 특정 명령을 수행할 라즈베리파이로 command 메시지가 전송되어 디바이스를 작동시킨다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2024.05a
• /
• pp.151-153
• /
• 2024

Edge AI 기술은 자동차, 가전, 스마트폰 등 우리 주변의 다양한 기기에 탑재되어 있다. Edge AI 를 구동하는 프로세서는 여러 종류로 나뉘는데, 대표적으로 저성능의 Microprocessor와 고성능 Microcomputer로 분류할 수 있다. 그중에서도 Microprocessor는 메모리와 저장 용량이 작아 Edge AI 를 구동하기 위한 빅 데이터를 메모리와 저장공간에 저장할 수 없기 때문에 통신을 사용하여 다른 기기로부터 데이터를 받아 연산을 수행해야 한다. 하지만 Microprocessor에서 통신은 빅 데이터와 같은 숫자로 이루어진 값을 전송하는 데에만 사용되는 것이 아니다. 디버깅이나 Processor의 정보 표시 등 문자열을 함께 사용하는 경우가 많은데, 문자열과 숫자 데이터를 함께 주고받으면 빅데이터와 같은 많은 데이터를 전송할때 시간이 오래 걸린다는 문제가 있다. 본 논문에서는 Edge AI에서의 빅데이터를 빠르게 전송할 수 있는 방법을 제안한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.328-330
• /
• 2015

Edge is a characteristic information that can easily obtain the size, direction and location of objects included in the image, and the edge detection is utilized as a preprocess processing in various image processing application sectors such as object detection and object recognition, etc. For the conventional edge detection methods, there are Sobel, Prewitt and Roberts. These existing edge detection methods are easy to implement but the edge detection characteristics are somewhat insufficient as fixed weighted mask is applied. Therefore, in order to compensate the problems of existing edge detection methods, in this paper, an edge detection algorithm was proposed after applying the weighted value according to the standard deviation and means within the local mask.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1156-1161
• /
• 2007

Edge representing the boundary between two regions with the large briskness difference in mage includes diverse information about object. Therefore, this information has been utilized in fields such as image segmentation and object recognition. There are many kinds of edge according to duration time and the amplitude of brightness variation and edge is generally detected through the differential. Recently, in fields of image processing and computer vision, edge detection methods have been proposed to use in specific applications. Hence, in this paper the wavelet function for improved edge detection properties was proposed and detected line-edge components of images and its performance was proven through simulations.

• Journal of Information Processing Systems
• /
• v.10 no.2
• /
• pp.223-239
• /
• 2014

New IIR digital differintegrators (differentiator and integrator) with very minor absolute relative errors are presented in this paper. The digital integrator is designed by interpolating some of the existing integrators. The optimum value of the interpolation ratio is obtained through linear programming optimization. Subsequently, by modifying the transfer function of the proposed integrator appropriately, new digital differentiator is obtained. Simulation results demonstrate that the proposed differintegrator are a more accurate approximation of ideal ones, than the existing differintegrators. Furthermore, the proposed differentiator has been tested in an image processing application. Edges characterize boundaries and are, therefore, a problem of fundamental importance in image processing. For comparison purpose Prewitt, Sobel, Roberts, Canny, Laplacian of Gaussian (LOG), Zerocross operators were used and their results are displayed. The results of edge detection by some of the existing differentiators are also provided. The simulation results have shown the superiority of the proposed approach over existing ones.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2565-2574
• /
• 2000

The error diffusion method is good for reproducing continuous image to binary image. However the reproduction of edge characteristic is weak in power spectrum analysis of display error. In this paper. we present an edge-enhanced error-diffusion method which include pre-processing algorithm for edge characteristic enhancement. Pre-processing algorithm consists of the difference value between current pixel and local average of original image and weighting function of pre-filter. First. it is obtained the difference value between current pixel and the local average of peripheral pixels(5x5) in original image. Second, weighting function of pre-filter is composed by function including absolute value and sign of difference value. The improved Error diffusion algorithm using pre-processing algorithm, present a good result visually which edge characteristic is enhanced. The performance of the proposed algorithm is compared with that of the conventional edge-enhanced error diffusion by measuring the RAPSD of display error, the egde correlation and the local average accordance.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2000.04a
• /
• pp.115-120
• /
• 2000

This study is on the application the image processing algorithm for inspection of the aluminium mill strip surface defect. The image of surface defect data was obtained using the CCD camera with the digital signal board. The edge was found from the difference of pixel intensity between the normal image and defect image. Two step were taken to find the edge in the image processing algorithm. First, noise was removed by using the median filter in the image. Second, the edge was sharpened in detail by using the sharpening convolution filter in the image. Canny algorithm was used to defect the exact edge. The defect section was separated from the original image is to find the coordination point p1 and p2 which include the defect image

• Journal of the Semiconductor & Display Technology
• /
• v.22 no.4
• /
• pp.59-65
• /
• 2023

Edge detection in image processing and computer vision is one of the most fundamental operations. Canny edge detection algorithm has excellent performance and is currently widely used. However, it is difficult to process the algorithm in real-time because the algorithm is complex. In this study, the equations required in the algorithm were simplified to facilitate hardware implementation, and the calculation speed was increased by using a parallel structure. In particular, the size and management of local buffers were selected in consideration of parallel processing and filter size so that data could be processed without bottlenecks. It was designed in verilog and implemented in FPGA to verify operation and performance.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.11
• /
• pp.319-328
• /
• 2023

Unlike cloud computing, edge computing technology analyzes and judges data close to devices and users, providing advantages such as real-time service, sensitive data protection, and reduced network traffic. EdgeX Foundry, a representative open source of edge computing platforms, is an open source-based edge middleware platform that provides services between various devices and IT systems in the real world. EdgeX Foundry provides a service for handling camera devices, along with a service for handling existing sensed data, which only supports simple streaming and camera device management and does not store or process image data obtained from the device inside EdgeX. This paper presents a technique that can store and process image data inside EdgeX by applying some of the services provided by EdgeX Foundry. Based on the proposed technique, a service pipeline for object detection services used core in the field of autonomous driving was created for experiments and performance evaluation, and then compared and analyzed with existing methods.

• ETRI Journal
• /
• v.31 no.2
• /
• pp.240-242
• /
• 2009

A computationally efficient implementation of the progressive edge-growth algorithm is presented. This implementation uses an array of red-black (RB) trees to manage the layered structure of check nodes and adopts a new strategy to expand the Tanner graph. The complexity analysis and the simulation results show that the proposed approach reduces the computational effort effectively. In constructing a low-density parity check code with a length of $10^4$, the RB-tree-array-based implementation takes no more 10% of the time required by the original method.