• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.333-336
• /
• 2007

We propose a simple method for tracking a nonparameterized subject contour in a single video stream with a moving camera and changing background. Then we present a method to eliminate the tracked contour object by replacing with the background scene we get from other frame. Our method consists of two parts: first we track the object using LOD (Level-of-Detail) canny edge maps, then we generate background of each image frame and replace the tracked object in a scene by a background image from other frame that is not occluded by the tracked object. Our tracking method is based on level-of-detail (LOD) modified Canny edge maps and graph-based routing operations on the LOD maps. To reduce side-effects because of irrelevant edges, we start our basic tracking by using strong Canny edges generated from large image intensity gradients of an input image. We get more edge pixels along LOD hierarchy. LOD Canny edge pixels become nodes in routing, and LOD values of adjacent edge pixels determine routing costs between the nodes. We find the best route to follow Canny edge pixels favoring stronger Canny edge pixels. Our accurate tracking is based on reducing effects from irrelevant edges by selecting the stronger edge pixels, thereby relying on the current frame edge pixel as much as possible. This approach is based on computing camera motion. Our experimental results show that our method works nice for moderate camera movement with small object shape changes.

• Journal of Korea Multimedia Society
• /
• v.8 no.2
• /
• pp.174-180
• /
• 2005

Points of sharp variations in image are the most important components when we analyze the features of image. And they include a variety of information about image's shape and location etc. So a lot of researches for detecting edges have been continued. Edge detection operators which were used at the early stage of the research were to utilize relations among neighboring pixels. These methods detect edge at all boundaries, therefore they perform edge detection twice about curves below some width such as line-edge. In the meantime, wavelet transform which is presented as a new technique of signal processing field provides multiscale edge detection and is being applied widely in many fields that analyze edge-like characteristic. Therefore, in this paper we detected line-edge with new 2-D wavelet function which is independent of line's width.

• 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.137-140
• /
• 1996

Finding line segments in an intensity image has been one of the most fundamental issues in computer vision. In complex scenes, it is hard to detect the locations of point features. Line features are more robust in providing greater positional accuracy. In this paper we present a robust "line features extraction" algorithm which extracts line feature in a single pass without using any assumptions and constraints. Our algorithm consists of five steps: (1) edge scanning, (2) edge normalization, (3) line-blob extraction, (4) line-feature computation, and (5) line linking. By using edge scanning, the computational complexity due to too many edge pixels is drastically reduced. Edge normalization improves the local quantization error induced from the gradient space partitioning and minimizes perturbations on edge orientation. We also analyze the effects of edge processing, and the least squares-based method and the principal axis-based method on the computation of line orientation. We show its efficiency with some real images.al images.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.3
• /
• pp.75-81
• /
• 2014

In a distribution of the digital image, there is a serious problem that is distributed an illegal forgery image by pirates. For the problem solution, this paper proposes an image forensic decision algorithm using an edge energy information of forgery image. The algorithm uses SA (Streaking Artifacts) and SPAM (Subtractive Pixel Adjacency Matrix) to extract the edge energy informations of original image according to JPEG compression rate(QF=90, 70, 50 and 30) and the query image. And then it decides the forge whether or not by comparing the edge informations between the original and query image each other. According to each threshold in TCJCR (Threshold by Combination of JPEG Compression Ratios), the matching of the edge informations of original and query image is excused. Through the matching experiments, TP (True Positive) and FN (False Negative) is 87.2% and 13.8% respectively. Thus, the minimum average decision error is 0.1349. Also, it is confirmed that the performed class evaluation of the proposed algorithm is 'Excellent(A)' because of the AUROC (Area Under Receiver Operating Characteristic) curve is 0.9388 by sensitivity and 1-specificity.

• Nuclear Engineering and Technology
• /
• v.56 no.6
• /
• pp.2057-2062
• /
• 2024

Among photon counting detector (PCD)-based technologies, the K-edge subtraction (KES) method has a very high material decomposition efficiency. Yet, since the increase in noise in the X-ray image to which the KES method is applied is inevitable, research on image quality improvement is essential. Here, we modeled a block-matching and 3D filtering (BM3D) algorithm and applied it to PCD-based X-ray images with the improved KES (IKES) method. For PCD modeling, Monte Carlo simulation was used, and a phantom composed of iodine substances with different concentrations was designed. The IKES method was modeled by adding a log term to KES, and the X-ray image used for subtraction was obtained by applying the 3.0 keV range based on the K-edge region of iodine. As a result, the IKES image using the BM3D algorithm showed the lowest normalized noise power spectrum value. In addition, we confirmed that the contrast-to-noise ratio and no-reference-based evaluation results when the BM3D algorithm was applied to the IKES image were improved by 29.36 % and 20.56 %, respectively, compared to the noisy image. In conclusion, we demonstrated that the IKES imaging technique using a PCD-based detector and the BM3D algorithm fusion technique were very efficient for X-ray imaging.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.1140-1154
• /
• 2015

Multiple Description (MD) coding is a promising alternative for the robust transmission of information over error-prone channels. Lattice vector quantization (LVQ) is a significant version of MD techniques to design an MD image coder. However, different from the traditional 2D texture image, the 3D depth image has its own special characteristics, which should be taken into account for efficient compression. In this paper, an optimized MDLVQ scheme is proposed in view of the characteristics of 3D depth image. First, due to the sparsity of depth image, the image blocks can be classified into edge blocks and smooth blocks, which are encoded by different modes. Furthermore, according to the boundary contents in edge blocks, the step size of LVQ can be regulated adaptively for each block. Experimental results validate the effectiveness of the proposed scheme, which show better rate distortion performance compared with the conventional MDLVQ.

• Journal of the Semiconductor & Display Technology
• /
• v.15 no.3
• /
• pp.67-71
• /
• 2016

This paper addresses a problem of defocus map recovery from single image. We describe a simple effective approach to estimate the spatial value of defocus blur at the edge location of the image. At first, we perform a re-blurring process using Gaussian function with input image, and calculate a gradient magnitude ratio with blurring amount between input image and re-blurred image. Then we get a full defocus map by propagating the blur amount at the edge location. Experimental result reveals that our method outperforms a reliable estimation of depth map, and shows that our algorithm is robust to noise, inaccurate edge location and interferences of neighboring edges within input image.

• Journal of Convergence for Information Technology
• /
• v.11 no.2
• /
• pp.41-46
• /
• 2021

The method of the edge detection algorithm based on grayscale mathematical morphology has the advantage that image noise can be removed and processed in parallel, and the operation speed is fast. However, the method of detecting the edge of an image using a single structural scale element may be affected by image information. The characteristics of grayscale morphology may be limited to the edge information result of the operation result by repeatedly performing expansion, erosion, opening, and containment operations by repeating structural elements. In this paper, we propose an edge detection algorithm that applies a structural element with strong directionality to noise and then applies weighted entropy to each pixel information in the element. The result of applying the multi-scale structural element applied to the image and the result of applying the directional weighted entropy were compared and analyzed, and the simulation result showed that the proposed algorithm is superior in edge detection.

• 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.