• Title/Summary/Keyword: Edge Computation

Search Result 237, Processing Time 0.031 seconds

Analysis of 3D Microwave Oven Using Finite Element Method (전자렌지 캐비티의 전자파 해석)

  • Park, Kweong-Soo;Kim, Gweon-Jib;Shon, Jong-Chull;Kim, Sang-Gweon;Park, Yoon-Ser
    • Proceedings of the KIEE Conference
    • /
    • 1996.07c
    • /
    • pp.1753-1755
    • /
    • 1996
  • This paper presents an analysis of the 3D microwave oven considering its forming. The results were compared with experimental data. Finite Element Method(FEM) using edge clement is employed for the analysis. For solving the large sparse system matrix equation was solved using the parallelized QMR method. Analysis of the 3d cavity has troublesome difficulties such as spurious solutions, too many memory and long computation time. We overcome this difficulties by using edge clement for spurious solutions and the parallelized QMR method by the aid of Paralle Virtual Machine(PVM) for the memory and computation time.

  • PDF

A Study on Efficient Watershed Algorithm by Using Improved SUSAN Algorithm

  • Choi, Yong-Hwan;Kim, Yong-Ho;Kim, Joong-Kyu
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2003.05b
    • /
    • pp.431-434
    • /
    • 2003
  • In this paper, we propose an efficient method not only f3r producing accurate region segmentation, solving the over-segmentation problem of watershed algorithm but also f3r reducing post-processing time by reducing computation loads. Through this proposed method, region segmentation of neighboring objects and discrimination of similar intensities were effectively obtained. Input image of watershed algorithm has used the derivative-based detectors such as Sobel and Canny. But proposed method uses the pixels-similarity-based detector, that is, SUSAN. By adopting this proposed method, we can reduce the noise problem and solve the problem of over-segmentation and not lose the edge information of objects. We also propose Zero-Crossing SUSAN. With Zero-Crossing SUSAN, the edge localization, times and computation loads can be improved over those obtained from existing SUSAN

  • PDF

Edge Computing Task Offloading of Internet of Vehicles Based on Improved MADDPG Algorithm

  • Ziyang Jin;Yijun Wang;Jingying Lv
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.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%.

Straight Line Detection Using PCA and Hough Transform (주성분 분석과 허프 변환을 이용한 직선 검출)

  • Oh, Jeong-su
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.2
    • /
    • pp.227-232
    • /
    • 2018
  • In a Hough transform that is a representative algorithm for the straight line detection, a great number of edge pixels generated from noisy or complex images cause enormous amount of computation and pseudo straight lines. This paper proposes a two step straight line detection algorithm to improve the conventional Hough transform. In the first step, the proposed algorithm divides an image into non-overlapping blocks and detects the information related to the straight line of the edge pixels in the block using a principal component analysis (PCA). In the second step, it detects the straight lines by performing the Hough transform limited slope area to the pixels associated with the straight line. Simulation results show that the proposed algorithm reduces average of ${\rho}$ computation by 94.6% and prevents the pseudo straight lines although some additional computation is needed.

Joint wireless and computational resource allocation for ultra-dense mobile-edge computing networks

  • Liu, Junyi;Huang, Hongbing;Zhong, Yijun;He, Jiale;Huang, Tiancong;Xiao, Qian;Jiang, Weiheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.7
    • /
    • pp.3134-3155
    • /
    • 2020
  • In this paper, we study the joint radio and computational resource allocation in the ultra-dense mobile-edge computing networks. In which, the scenario which including both computation offloading and communication service is discussed. That is, some mobile users ask for computation offloading, while the others ask for communication with the minimum communication rate requirements. We formulate the problem as a joint channel assignment, power control and computational resource allocation to minimize the offloading cost of computing offloading, with the precondition that the transmission rate of communication nodes are satisfied. Since the formulated problem is a mixed-integer nonlinear programming (MINLP), which is NP-hard. By leveraging the particular mathematical structure of the problem, i.e., the computational resource allocation variable is independent with other variables in the objective function and constraints, and then the original problem is decomposed into a computational resource allocation subproblem and a joint channel assignment and power allocation subproblem. Since the former is a convex programming, the KKT (Karush-Kuhn-Tucker) conditions can be used to find the closed optimal solution. For the latter, which is still NP-hard, is further decomposed into two subproblems, i.e., the power allocation and the channel assignment, to optimize alternatively. Finally, two heuristic algorithms are proposed, i.e., the Co-channel Equal Power allocation algorithm (CEP) and the Enhanced CEP (ECEP) algorithm to obtain the suboptimal solutions. Numerical results are presented at last to verify the performance of the proposed algorithms.

A Study on Threshold-based Denoising by UDWT (UDWT을 이용한 경계법에 기초한 노이즈 제거에 관한 연구)

  • 배상범;김남호;류지구
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2001.06a
    • /
    • pp.77-80
    • /
    • 2001
  • This paper presents a new threshold-based denoising method by using undecimated discrete wavelet transform (UDWT). It proved excellency of the UDWT compared with orthogonal wavelet transform (OWT), spatia1ly selective noise filtration (SSNF) and NSSNF added new parameter. Methods using the spatial correlation are effectual at edge detection and image enhancement, whereas algorithm is complex and needs more computation However, UDWT is effective at denoising and needs less computation and simple algorithm.

  • PDF

Functional Privacy-preserving Outsourcing Scheme with Computation Verifiability in Fog Computing

  • Tang, Wenyi;Qin, Bo;Li, Yanan;Wu, Qianhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.1
    • /
    • pp.281-298
    • /
    • 2020
  • Fog computing has become a popular concept in the application of internet of things (IoT). With the superiority in better service providing, the edge cloud has become an attractive solution to IoT networks. The data outsourcing scheme of IoT devices demands privacy protection as well as computation verification since the lightweight devices not only outsource their data but also their computation. Existing solutions mainly deal with the operations over encrypted data, but cannot support the computation verification in the same time. In this paper, we propose a data outsourcing scheme based on an encrypted database system with linear computation as well as efficient query ability, and enhance the interlayer program in the original system with homomorphic message authenticators so that the system could perform computational verifying. The tools we use to construct our scheme have been proven secure and valid. With our scheme, the system could check if the cloud provides the correct service as the system asks. The experiment also shows that our scheme could be as effective as the original version, and the extra load in time is neglectable.

Face Detection Using Edge Orientation Map and Local Color Information (에지 방향 지도와 영역 컬러 정보를 이용한 얼굴 추출 기법)

  • Kim, Jae-Hyup;Moon, Young-Shik
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.987-990
    • /
    • 2005
  • An important issue in the field of face recognitions and man-machine interfaces is an automatic detection of faces in visual scenes. it should be computationally fast enough to allow an online detection. In this paper we describe our ongoing work on face detection that models the face appearance by edge orientation and color distribution. We show that edge orientation is a powerful feature to describe objects like faces. We present a method for face region detection using edge orientation and a method for face feature detection using local color information. We demonstrate the capability of our detection method on an image database of 1877 images taken from more than 700 people. The variations in head size, lighting and background are considerable, and all images are taken using low-end cameras. Experimental results show that the proposed scheme achieves 94% detection rate with a resonable amount of computation time.

  • PDF

Convex Sharp Edge Detection of CAD Surfaces without Topology (토폴로지 정보가 없는 CAD 곡면의 꺾인 모서리 탐색)

  • 박정환;이정근
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.17 no.2
    • /
    • pp.73-79
    • /
    • 2000
  • The part-surface of mold or stamping-dies consists of a compound surface which consists of lots of composite surfaces, and may have various types of feature shapes including convex sharp edge (CSE). Those CSE features should be considered with care in machining the surface, which necessitates extraction of CSE curves on a compound surface. This work can be done rather easily for a solid model which has a complete topology information. In case of the compound surface without topology information, however, such CSE curves must be gathered through some geometrical calculations paying much computation time. In the paper, extracting CSE curves by the construction of a CSE region-map which can reduce time, and detecting various common edge types are presented.

  • PDF

AERODYNAMIC ANALYSIS ON LEADING-EDGE SWEEPBACK ANGLES OF FLYING-WING CONFIGURATIONS (전익기 형상의 앞전후퇴각 변화에 따른 공력해석)

  • Lee, J.M.;Chang, J.W.
    • Journal of computational fluids engineering
    • /
    • v.11 no.4 s.35
    • /
    • pp.48-55
    • /
    • 2006
  • A computational study was carried out in order to investigate aerodynamic characteristics on leading edge sweepback angles of Flying-Wing configurations. The viscous-compressible Navire-Stokes equation and Spalart-Allmaras turbulence model of the commercial CFD code were adopted for this computation analysis. This investigation examined aerodynamic characteristics of three different types of leading edge sweepback angles: $30^{\circ}C,\;35^{\circ}C\;and\;40^{\circ}C$. The freestream Mach number was M=0.80 and the angle of attack ranged from ${\alpha}=0^{\circ}C\;to\;{\alpha}=20^{\circ}C$. The results show that the increases in sweepback angle of the Flying-Wing configuration creates more efficient aerodynamic performance.