• Journal of Korea Multimedia Society
• /
• v.25 no.8
• /
• pp.1136-1140
• /
• 2022

This paper is a method for efficient traffic prediction in mobile edge computing, where many studies have recently been conducted. For distributed processing in mobile edge computing, tasks offloading from each mobile edge must be processed within the limited computing power of the edge. As a result, in the mobile nodes, it is necessary to efficiently select the surrounding edge server in consideration of performance dynamically. This paper aims to suggest the efficient clustering method by selecting edges in a cloud environment and predicting mobile traffic. Then, our dynamic clustering method is to reduce offloading overload to the edge server when offloading required by mobile terminals affects the performance of the edge server compared with the existing offloading schemes.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.01a
• /
• pp.95-96
• /
• 2018

Edge Computing은 Cloud Computing의 단점을 보완하기 위해 등장 하였으나, 자원 제한을 가지고 있는 Edge Node에서 데이터 분석 및 처리해야 하는 문제점이 있다. 이를 해결하기 위해 K-means clustering 알고리즘과 PCA 기법을 이용해 차원 추축을 이용한 계산비용과 처리시간을 줄이는 기법을 제안하였다. PCA란, 차원 축소 및 데이터 압축에 사용되는 기계학습 알고리즘 중 하나이며, 데이터에서 중요한 정보만 추출해 차원을 줄일 수 있다. 이를 통해 제안한 기법이 기존의 Reduction first clustering second(RFCS) 기법에 비해 성능이 우수한 것을 확인할 수 있었다.

• Journal of Digital Convergence
• /
• v.12 no.11
• /
• pp.281-288
• /
• 2014

A method for edge detection using K-means clustering is proposed in this paper. The method is performed through there steps. Histogram equalizing is applied to the image for the uniformed intensity distribution. Pixels are clustered by K-means clustering technique. Then Sobel mask is applied to detect edges. Experiments showed that this method detected edges better than conventional method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.4
• /
• pp.86-97
• /
• 2011

This paper presents a novel algorithm to detect more accurate road lane with image sensor-based color classification and directional edge clustering. With treatment of road region and lane as a recognizable color object, the classification of color cues is processed by an iterative optimization of statistical parameters to each color object. These clustered color objects are taken into considerations as initial kernel information for color object detection and recognition. In order to improve the limitation of object classification using the color cues, the directional edge cures within the estimated region of interest in the lane boundary (ROI-LB) are clustered and combined. The results of color classification and directional edge clustering are optimally integrated to obtain the best detection of road lane. The characteristic of the proposed system is to obtain robust result to all real road environments because of using non-parametric approach based only on information of color and edge clustering without a particular mathematical road and lane model. The experimental results to the various real road environments and imaging conditions are presented to evaluate the effectiveness of the proposed method.

• Journal of Power System Engineering
• /
• v.20 no.4
• /
• pp.32-37
• /
• 2016

This paper proposes two measurement methods for injured rate of fish surface using color image segmentation method based on K-means clustering algorithm and Otsu's threshold algorithm. To do this task, the following steps are done. Firstly, an RGB color image of the fish is obtained by the CCD color camera and then converted from RGB to HSI. Secondly, the S channel is extracted from HSI color space. Thirdly, by applying the K-means clustering algorithm to the HSI color space and applying the Otsu's threshold algorithm to the S channel of HSI color space, the binary images are obtained. Fourthly, morphological processes such as dilation and erosion, etc. are applied to the binary image. Fifthly, to count the number of pixels, the connected-component labeling is adopted and the defined injured rate is gotten by calculating the pixels on the labeled images. Finally, to compare the performances of the proposed two measurement methods based on the K-means clustering algorithm and the Otsu's threshold algorithm, the edge detection of the final binary image after morphological processing is done and matched with the gray image of the original RGB image obtained by CCD camera. The results show that the detected edge of injured part by the K-means clustering algorithm is more close to real injured edge than that by the Otsu' threshold algorithm.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.781-784
• /
• 1998

An image segmentation approach based on the fuzzy worm searching and MIN-MAx clusterng algorithm is proposed in this paper. This algorithm deals with fuzzy worm value and min-max node at a gross scene level, which investigates the edge information including fuzzy worm action. But current segmentation methods based edge extraction methods generally need the mask information for the algebraic model, and take long run times at mask operation, wheras the proposed algorithm has single operation ccording to active searching of fuzzy worms. In addition, we also genetic min-max clustering using genetic algorithm to complete clustering and fuzyz searching on grey-histogram of image for the optimum solution, which can automatically determine the size of rnages and has both strong robust and speedy calculation. The simulation results showed that the proposed algorithm adaptively divided the quantized images in histogram region and performed single searching methods, significantly alleviating the increase of the computational load and the memory requirements.

• Journal of Intelligence and Information Systems
• /
• v.18 no.2
• /
• pp.47-60
• /
• 2012

Video data comes in the form of the unstructured and the complex structure. As the importance of efficient management and retrieval for video data increases, studies on the video parsing based on the visual features contained in the video contents are researched to reconstruct video data as the meaningful structure. The early studies on video parsing are focused on splitting video data into shots, but detecting the shot boundary defined with the physical boundary does not cosider the semantic association of video data. Recently, studies on structuralizing video shots having the semantic association to the video scene defined with the semantic boundary by utilizing clustering methods are actively progressed. Previous studies on detecting the video scene try to detect video scenes by utilizing clustering algorithms based on the similarity measure between video shots mainly depended on color features. However, the correct identification of a video shot or scene and the detection of the gradual transitions such as dissolve, fade and wipe are difficult because color features of video data contain a noise and are abruptly changed due to the intervention of an unexpected object. In this paper, to solve these problems, we propose the Scene Detector by using Color histogram, corner Edge and Object color histogram (SDCEO) that clusters similar shots organizing same event based on visual features including the color histogram, the corner edge and the object color histogram to detect video scenes. The SDCEO is worthy of notice in a sense that it uses the edge feature with the color feature, and as a result, it effectively detects the gradual transitions as well as the abrupt transitions. The SDCEO consists of the Shot Bound Identifier and the Video Scene Detector. The Shot Bound Identifier is comprised of the Color Histogram Analysis step and the Corner Edge Analysis step. In the Color Histogram Analysis step, SDCEO uses the color histogram feature to organizing shot boundaries. The color histogram, recording the percentage of each quantized color among all pixels in a frame, are chosen for their good performance, as also reported in other work of content-based image and video analysis. To organize shot boundaries, SDCEO joins associated sequential frames into shot boundaries by measuring the similarity of the color histogram between frames. In the Corner Edge Analysis step, SDCEO identifies the final shot boundaries by using the corner edge feature. SDCEO detect associated shot boundaries comparing the corner edge feature between the last frame of previous shot boundary and the first frame of next shot boundary. In the Key-frame Extraction step, SDCEO compares each frame with all frames and measures the similarity by using histogram euclidean distance, and then select the frame the most similar with all frames contained in same shot boundary as the key-frame. Video Scene Detector clusters associated shots organizing same event by utilizing the hierarchical agglomerative clustering method based on the visual features including the color histogram and the object color histogram. After detecting video scenes, SDCEO organizes final video scene by repetitive clustering until the simiarity distance between shot boundaries less than the threshold h. In this paper, we construct the prototype of SDCEO and experiments are carried out with the baseline data that are manually constructed, and the experimental results that the precision of shot boundary detection is 93.3% and the precision of video scene detection is 83.3% are satisfactory.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.5 no.2
• /
• pp.44-57
• /
• 1995

In this paper GFI (Generalized Fuzzy Isodata) and FI (Fuzzy Isodata) algorithms are studied and applied to the tire tread pattern classification problem. GFI algorithm which repeatedly grouping the partitioned cluster depending on the fuzzy partition matrix is general form of GI algorithm. In the constructing the binary tree using GFI algorithm cluster validity, namely, whether partitioned cluster is feasible or not is checked and construction of the binary tree is obtained by FDH clustering algorithm. These algorithms show the good performance in selecting the prototypes of each patterns and classifying patterns. Directions of edge in the preprocessed image of tire tread pattern are selected as features of pattern. These features are thought to have useful information which well represents the characteristics of patterns.

• Korean Journal of Cognitive Science
• /
• v.11 no.2
• /
• pp.53-58
• /
• 2000

This paper reconstructs local region of a facial expression image from extracted feature points of facial expression image using FCM(Fuzzy C-Meang) clustering algorithm with Gabor wavelets. The feature extraction in a face is two steps. In the first step, we accomplish the edge extraction of main components of face using average value of 2-D Gabor wavelets coefficient histogram of image and in the next step, extract final feature points from the extracted edge information using FCM clustering algorithm. This study presents that the principal components of facial expression images can be reconstructed with only a few feature points extracted from FCM clustering algorithm. It can also be applied to objects recognition as well as facial expressions recognition.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3239-3267
• /
• 2018

Image and video dehazing is a popular topic in the field of computer vision and digital image processing. A fast, optimized dehazing algorithm was recently proposed that enhances contrast and reduces flickering artifacts in a dehazed video sequence by minimizing a cost function that makes transmission values spatially and temporally coherent. However, its fixed-size block partitioning leads to block effects. The temporal cost function also suffers from the temporal non-coherence of newly appearing objects in a scene. Further, the weak edges in a hazy image are not addressed. Hence, a video dehazing algorithm based on well designed spectral clustering is proposed. To avoid block artifacts, the spectral clustering is customized to segment static scenes to ensure the same target has the same transmission value. Assuming that edge images dehazed with optimized transmission values have richer detail than before restoration, an edge intensity function is added to the spatial consistency cost model. Atmospheric light is estimated using a modified quadtree search. Different temporal transmission models are established for newly appearing objects, static backgrounds, and moving objects. The experimental results demonstrate that the new method provides higher dehazing quality and lower time complexity than the previous technique.