• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.381-384
• /
• 2003

Among digital halftoning methods, error diffusion is a procedure for generating high quality bilevel images from continuous-tone images but blurs the edge information in the bilevel images. To solve the problem, we propose the edge enhanced error diffusion using the edge information of the original images. The edge enchanted weights is computed by adding local characteristic weights and input pixels multiplied a constant. Also, we combined the edge enhanced method with the adaptive error diffusion using human spatial and frequency perception characteristic. The performance of the proposed method is compared with conventional method by measuring the edge correlation. The halftoned images applied the proposed method get more fine quality due to the enchanced edge and better quality in halftoned image. And the detailed edge is preserved in the halftoned images by the proposed method.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.8
• /
• pp.1074-1084
• /
• 1995

In this paper, we investigate edge extraction and segmentation of range images. We first discuss problems that arise in the conventional region-based segmentation methods and edge-based ones using principal curvatures, then we propose an edge-based algorithm. In the proposed algorithm, we extract edge contours by using the Gaussian filter and directional derivatives, and segment a range image based on extracted edge contours, Also we present the problem that arises in the conventional thresholding, then we propose a new threshold selection method. To solve the problem that local maxima of the first- and second- order derivatives gather near step edges, we first find closed roof edge contours, fill the step edge region, and finally thin edge boundaries. Computer simulations with several range images show that the proposed method yields better performance than the conventional one.

• The Journal of the Society of Korean Medicine Diagnostics
• /
• v.20 no.1
• /
• pp.37-44
• /
• 2016

Ultrasonic imaging is the most widely modality among modern imaging device for medical diagnosis. Nevertheless, medical ultrasound images suffer from speckle noise and low contrast. In this paper, we propose probabilistic edge map for ultrasound image edge enhancement using automatic alien algorithm. The proposed method used applied speckle reduced ultrasound imaging for edge improvement using sequentially acquired ultrasound imaging. To evaluate the performance of method, the similarity between the reference and edge enhanced image was measured by quantity analysis. The experimental results show that the proposed method considerably improves the image quality with region edge enhancement.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.210-212
• /
• 2016

인터넷 시대가 가속화 되면서 파편화 되었던 web에 대한 규격 통일을 외치는 목소리가 높아졌고 그에 따른 대안으로 HTML5.0이 부상하게 되었다. 그로인해 Adobe Flash는 통일 규격에 벗어나게 되었고 더 나가 보안에도 문제가 있어 점차 퇴출당하고 있는 실정이다. 이에 대한 대안으로 Adobe사에서는 Edge를 런칭하게 되었다. Edge는 Flash를 대신하여 웹 애니메이션을 빠르게 만들 수 있는 프로그램이며, 웹 전용 디자인 페이지는 간단하면서 효과적인 css 디자인 및 레이아웃 특징을 나타낼 수 있다. 또한 edge는 html5에 대한 전반적인 지식이 없어도 html5 기반이 되는 다양한 애니메이션 결과물들을 만들어 낼 수 있는 장점이 있다. 그리고 edge에서는 Flash 플레이어 플러그인이 없어도 웹 사이트에서 사용이 가능하다. 본 논문에서는 Adobe edge와 HTML 5.0을 비교 분석하여 각각의 장, 단점을 분석해보고, Adobe edge가 어떤 점에 있어서 HTML5.0보다 비교우위에 있는지, 혹은 더 나가 Flash나 HTML5.0의 대체제가 될 수 있는지에 대해 알아보며 프로그래머들 측면이 아닌 디자이너 측면에서 효용성에 대해 알아보고자 한다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.4
• /
• pp.38-45
• /
• 2003

This paper presents a meta-heuristic solution technique, Ant System (AS)algerian to solve edge detection problem. We define the quality of edge in terms of dissimilarity, continuity, thickness and length. We cast edge detection as a problem in cost minimization. This is achieved by the formulation of a cost function that inversely evaluates the quality of edge configuration. Twelve windows for enhancing dissimilarity regions based on the valid edge structures are used. The AS algorithm finds the optimal set of edge pixels based on the cost function. The experimental results show that the properly reduced set of edge pixels could be found regardless how complicated the image is.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.3
• /
• pp.41-48
• /
• 2012

In this paper, we propose a method of edge detection for noisy image. The proposed method uses a progressive filter for noise reduction and a Sobel operator for edge detection. The progressive filter combines a median filter and a modified rational filter. The proposed method for noise reduction adjusts rational filter direction according to an edge in the image which is obtained by median filtering. Our method effectively attenuates the noise while preserving the image details. Edge detection is performed by a Sobel operator. This operator can be implemented by integer operation and is therefore relatively fast. Our proposed method not only preserves edge, but also reduces noise in uniform region. Thus, edge detection is well performed. Our proposed method could improve results using further developed Sobel operator. Experimental results show that our proposed method has better edge detection with correct positions than those by existing median and rational filtering methods for noisy image.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.1
• /
• pp.167-177
• /
• 2022

A vertex v of a graph G = (V, E) is said to ve-dominate every edge incident to v, as well as every edge adjacent to these incident edges. A set S ⊆ V is called a double vertex-edge dominating set if every edge of E is ve-dominated by at least two vertices of S. The minimum cardinality of a double vertex-edge dominating set of G is the double vertex-edge domination number γ_dve(G). In this paper, we provide an upper bound on the double vertex-edge domination number of trees in terms of the order n, the number of leaves and support vertices, and we characterize the trees attaining the upper bound. Finally, we design a polynomial time algorithm for computing the value of γ_dve(T) for any trees. This gives an answer of an open problem posed in [4].

• Electronics and Telecommunications Trends
• /
• v.37 no.5
• /
• pp.44-53
• /
• 2022

The Internet of Things (IoT) is growing exponentially, with the number of IoT devices multiplying annually. Accordingly, the paradigm is changing from cloud computing to edge computing and even tiny edge computing because of the low latency and cost reduction. Machine learning is also shifting its role from the cloud to edge or tiny edge according to the paradigm shift. However, the fragmented and resource-constrained features of IoT devices have limited the development of artificial intelligence applications. Edge MLaaS (Machine Learning as-a-Service) has been studied to easily and quickly adopt machine learning to products and overcome the device limitations. This paper briefly summarizes what Edge MLaaS is and what element of research it requires.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.450-470
• /
• 2023

Traditional cloud computing faces some challenges such as huge energy consumption, network delay and single point of failure. Edge computing is a typical distributed processing platform which includes multiple edge servers closer to the users, thus is more robust and can provide real-time computing services. Although outsourcing data to edge servers can bring great convenience, it also brings serious security threats. In order to provide image retrieval while ensuring users' data privacy, a privacy preserving image retrieval scheme in edge environment is proposed. Considering the distributed characteristics of edge computing environment and the requirement for lightweight computing, we present a privacy-preserving image retrieval scheme in edge computing environment, which two or more "honest but curious" servers retrieve the image quickly and accurately without divulging the image content. Compared with other traditional schemes, the scheme consumes less computing resources and has higher computing efficiency, which is more suitable for resource-constrained edge computing environment. Experimental results show the algorithm has high security, retrieval accuracy and efficiency.