• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2008년도 제39차 동계학술발표논문집 16권2호
• /
• pp.207-210
• /
• 2009

Edge detection is an important process in low level image processing. But many proposed methods for edge detection are not very robust to the image noise and are not flexible for different images. To solve the both problems, an algorithm is proposed which eliminate the noise by mean shift algorithm in advance, and then adaptively determine the double thresholds based on gradient histogram and minimum interclass variance, With this algorithm, it can fade out almost all the sensitive noise and calculate the both thresholds for different images without necessity to setup any parameter artificially, and choose edge pixels by fuzzy algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권2호
• /
• pp.327-347
• /
• 2024

Edge computing is frequently employed in the Internet of Vehicles, although the computation and communication capabilities of roadside units with edge servers are limited. As a result, to perform distributed machine learning on resource-limited MEC systems, resources have to be allocated sensibly. This paper presents an Improved MADDPG algorithm to overcome the current IoV concerns of high delay and limited offloading utility. Firstly, we employ the MADDPG algorithm for task offloading. Secondly, the edge server aggregates the updated model and modifies the aggregation model parameters to achieve optimal policy learning. Finally, the new approach is contrasted with current reinforcement learning techniques. The simulation results show that compared with MADDPG and MAA2C algorithms, our algorithm improves offloading utility by 2% and 9%, and reduces delay by 29.6%.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2022년도 춘계학술대회
• /
• pp.437-440
• /
• 2022

현대 사회는 4차 산업 혁명과 IoT 기술 등의 발전으로 영상 처리 분야의 활용이 급증하고 있다. 특히, 에지 검출은 이미지 분류, 객체 검출 등 영상 처리 응용에서 필수적인 전처리 과정으로 여러 분야에서 널리 사용되고 있다. 에지를 검출하기 위한 기존의 방법에는 소벨 필터(Sobel edge detection filter), 로버츠 필터(Roberts edge detection filter), 프리윗 필터(Prewitt edge detection filter), LoG(Laplacian of Gaussian) 등이 있다. 하지만 기존의 방법들은 명암도가 낮은 저조도 환경에서 에지 검출 특성이 다소 미흡한 성능을 보인다는 단점이 있다. 따라서 본 논문에서는 저조도 환경에서도 에지 검출 특성을 높이기 위해 명암도 분석에 기반한 에지 검출 알고리즘을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권7호
• /
• pp.3329-3350
• /
• 2017

Installing caching and computing facilities in mobile edge networks is a promising solution to cope with the challenging capacity and delay requirements imposed on future mobile communication systems. The problem of optimal facility placement in mobile edge networks has not been fully studied in the literature. This is a non-trivial problem because the mobile edge network has a unidirectional topology, making existing solutions inapplicable. This paper considers the problem of optimal placement of a fixed number of facilities in a mobile edge network with an arbitrary tree topology and an arbitrary demand distribution. A low-complexity sequential algorithm is proposed and proved to be convergent and optimal in some cases. The complexity of the algorithm is shown to be $O(H^2{\gamma})$, where H is the height of the tree and ${\gamma}$ is the number of facilities. Simulation results confirm that the proposed algorithm is effective in producing near-optimal solutions.

• 정보저장시스템학회논문집
• /
• 제2권3호
• /
• pp.184-188
• /
• 2006

In recent years the flying height of the head/slider has been decreasing in order to increase the recording density of hard disk drive (HDD). Accordingly, it was predicted that direct contact between slider and disk surface (slider slap) can cause defects on the disk such as scratch and particle generation. In this work, we theoretically demonstrate the effect of rounded-edge slider using Hertzian contact theory. Depth and width of scratch were predicted by plowing model. Furthermore, as we fabricated rounded-edge slider, rounded-edge slider was tested and compared with sharp-edge slider. The experimental results show rounded-edge was effective for reducing scratch depth.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 추계학술대회 논문집 학회본부 B
• /
• pp.569-571
• /
• 1998

In this paper, we propose a method of restoring blurred images by an edge-sensitive adaptive filter. The direction of the edge is estimated using the properties of 2-D block FFT. Reduction of blurring due to the added noise during image transfer and the focus of lens caused by shooting a fast moving object is very important. To remove this phenomenon effectively, we can use the edge information obtained by processing the blurred images. The proposed algorithm estimates both the existence and the direction of the edge. On the basis of the acquired edge direction information, we choose the appropriate edge-sensitive adaptive filter, which enables us to get better images than images obtained by methods not considering the direction of the edge. The performance of the proposed algorithm is shown in the simulation result.

• 융합신호처리학회 학술대회논문집
• /
• 한국신호처리시스템학회 2000년도 추계종합학술대회논문집
• /
• pp.81-84
• /
• 2000

Digital Halftoning convert a continuous-tone images to a binary images. Inverse halftoning addresses the problem of recovering a continuous image from a halftoned binary image. Simple low pass filtering can remove the high frequency noise but it also removes the edge information. Thus the edge information should be separated from the halftoning noise. As a result, the edge of result image is blurring. This paper present that we obtain continuous-tone-image which using Anisotropic diffusion filter. To reduce noise without blurring the edges of reconstructed image use edge map. The experimental results show that proposed method gives a higher PSNR and better subjective quality than conventional methods. As a result, the edge information of reconstructed image reduce blurring.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권11호
• /
• pp.2068-2086
• /
• 2011

Based on the quincunx sub-sampling grid, the New Interleaved Hierarchical INTerpolation (NIHINT) method is recognized as a superior pyramid data structure for the lossless and progressive coding of natural images. In this paper, we propose a new image interpolation algorithm, Edge Adaptive Hierarchical INTerpolation (EAHINT), for a further reduction in the entropy of interpolation errors. We compute the local variance of the causal context to model the strength of a local edge around a target pixel and then apply three statistical decision rules to classify the local edge into a strong edge, a weak edge, or a medium edge. According to these local edge types, we apply an interpolation method to the target pixel using a one-directional interpolator for a strong edge, a multi-directional adaptive weighting interpolator for a medium edge, or a non-directional static weighting linear interpolator for a weak edge. Experimental results show that the proposed algorithm achieves a better compression bit rate than the NIHINT method for lossless image coding. It is shown that the compression bit rate is much better for images that are rich in directional edges and textures. Our algorithm also shows better rate-distortion performance and visual quality for progressive image transmission.

• 한국멀티미디어학회논문지
• /
• 제19권6호
• /
• pp.990-1002
• /
• 2016

In this paper, we propose a new compression method for the edge image by analyzing the characteristics and the distribution of pixel values of the edge image. The pixel values of the edge image have the Gaussian distribution around '0', and most of the pixel values are `0`. By these analyses we suggest the Zero-Based codec that expresses all values in a CU by a single bit flag. Also, in order to reduce the computational complexity of the proposed codec, the block partition and the intra-prediction techniques are proposed by using edge information like the number of each edge direction, the distribution and the amplitude of a major edge direction in the CU. Experimental results show that the proposed codec leads to a slighter distortion in Y domain than that of HEVC, but has far faster processing speed up to 53 times while it maintains the similar image quality compared to HEVC.

• 한국컴퓨터정보학회논문지
• /
• 제3권2호
• /
• pp.85-97
• /
• 1998

기존의 윤곽선 추출 방법은 중첩된 두꺼운 선으로 추출되어 물체의 실제 경계선을정확하게 표시하지를 못하거나 윤곽선에 끊어짐이 많아 연결성이 떨어지는 문제점을 지니고있었다. 본 논문은 이러한 문제점을 해결하기 위하여 윤곽선 추출에 유전자 알고리즘을 적용하였으며 에너지 함수는 픽셀의 윤곽선 만족도를 수치로 산정해 주는 식으로 함수로 화상구조 형에 대한 평가 에너지와 이웃 윤곽선과의 연속성에 대한 평가 에너지, 윤곽선이 정확한 위치에 1 픽셀로 나타냈는지에 대한 평가함수로 구성하였다. 제안된 방법은 기존의 방법에 비해 잡음제거에 우수하였고 또한 연결성이 강하고 최적의 위치에 놓인 픽셀을 찾음으로서 보다 선명하고 정확한 윤곽선 추출을 가능케 하였다.