• Title/Summary/Keyword: Laplacian smoothing Method

Search Result 14, Processing Time 0.029 seconds

Optimisation of pipeline route in the presence of obstacles based on a least cost path algorithm and laplacian smoothing

  • Kang, Ju Young;Lee, Byung Suk
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.9 no.5
    • /
    • pp.492-498
    • /
    • 2017
  • Subsea pipeline route design is a crucial task for the offshore oil and gas industry, and the route selected can significantly affect the success or failure of an offshore project. Thus, it is essential to design pipeline routes to be eco-friendly, economical and safe. Obstacle avoidance is one of the main problems that affect pipeline route selection. In this study, we propose a technique for designing an automatic obstacle avoidance. The Laplacian smoothing algorithm was used to make automatically generated pipeline routes fairer. The algorithms were fast and the method was shown to be effective and easy to use in a simple set of case studies.

대변형 해석에서 평활화를 이용한 사면체 요소망의 재조성

  • Gwon, Gi-Hwan;Chae, Su-Won;Sin, Sang-Yeop
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.9 s.180
    • /
    • pp.2397-2405
    • /
    • 2000
  • The remeshing is a method to replace a distorted mesh by a new mesh without interrupting the finite element calculation. The remeshing procedure in this paper refers to the rezoning, for which a sm oothing process is developed to alleviate the distortions of mesh. In the paper, an automatic finite element rezoning system with tetrahedral elements for large deformation analysis has been developed. Our smoothing process is composed of two steps, a surface smoothing and a volume smoothing. In the surface smoothing, checking the dihedral angle and projection on surface patch reduced the change of shape and nodes penetrating die. The constrained Laplacian smoothing has been employed for the volume smoothing process. The state variables are mapped from old mesh to new mesh by using volume coordinates within a tetrahedral element. All these procedures have been linked to the NIKE3D program As illustrated in the examples the overall strategy ensures a robust and efficient rezoning scheme for finite element simulation of metal-forming processes.

A Study on the Effecient Mesh Generation for Finite Element Analysis of Electric Machinery (전기기기의 유한 요소 해석을 위한 효율적인 요소 생성에 관한 연구)

  • Kim, Jin-Tae;Jeong, Tae-Gyeong;Kim, Hyeong-Seok
    • The Transactions of the Korean Institute of Electrical Engineers B
    • /
    • v.48 no.4
    • /
    • pp.174-181
    • /
    • 1999
  • To obtain more accurate result in the finite element analysis for electric machinery, it is important to have a mesh being of good quality. This paper describes a new technique of mesh generation for the finite element method. When the list of points defining the region of analysis is given, an appropriate distribution of interior points is generated first. Secondly the points are connected to from the trianlges. Finally the connectivity data are used to reposition the interior points using Laplacian smoothing and mesh relaxation technique. In this paper, a mesh searching technique of Lawson which modifies the start mesh is proposed in addition to the above three steps. This algorithm is simple and produces the meshes being of good quality with high speed in comparison with the existing one.

  • PDF

Automatic mesh generation on ship hull surface (선체 곡면의 자동 요소화)

  • 윤태경;김동준
    • Journal of Ocean Engineering and Technology
    • /
    • v.11 no.2
    • /
    • pp.138-144
    • /
    • 1997
  • This is describes the automatic mesh generation on the ship hull surface. At first ship hull is defined as a cillocation of composite surface patches which satisfy the geometic continuity between adjoining patches by using Gregory surface method. Node points that would be mesh points are ganerated by considering the surface curvature. The triangulation of the node points is by the combination of Ohtsubo's method and Choi's one. After triangulation, shape improvement and quadrilateralization is done with specific criterin. An application to the actual ship and the results are shown.

  • PDF

The Image Restoration using Dual Adaptive Regularization Operators (이중적 정칙화 연산자를 사용한 영상복원)

  • 김승묵;전우상;이태홍
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.1B
    • /
    • pp.141-147
    • /
    • 2000
  • In the restoration of degraded noisy motion blurred image, we have trade-off problem between smoothing the noise and restoration of the edge region. While the noise is smoothed, die edge or details will be corrupted. On the other hand, restoring the edge will amplify the noise. To solve this problem we propose an adaptive algorithm which uses I- H regularization operator for flat region and Laplacian regularization operator for edge region. Through the experiments, we verify that the proposed method shows better results in the suppression of the noise amplification in flat region, introducing less ringing artifacts in edge region and better ISNR than those of the conventional ones.

  • PDF

An Image Denoising Algorithm for the Mobile Phone Cameras (스마트폰 카메라를 위한 영상 잡음 제거 알고리즘)

  • Kim, Sung-Un
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.9 no.5
    • /
    • pp.601-608
    • /
    • 2014
  • In this study we propose an image denoising algorithm appropriate for mobile smart phone equipped with limited computing ability, which has better performance and at the same time comparable quality comparing with previous studies. The proposed image denoising algorithm for mobile smart phone cameras in low level light environment reduces computational complexity and also prevents edge smoothing by extracting just Gaussian noises from the noisy input image. According to the experiment result, we verified that our algorithm has much better PSNR value than methods applying mean filter or median filter. Also the result image from our algorithm has better clear quality since it preserves edges while smoothing input image. Moreover, the suggested algorithm reduces computational complexity about 52% compared to the method applying original Laplacian mask computation, and we verified that our algorithm has good denoising quality by implementing the algorithm in Android smart phone.

Automated Visual Inspection System of Double Gear using Inspection System (더블기어 자동 시각 검사 시스템 실계 및 구현)

  • Lee, Young Kyo;Kim, Young Po
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.7 no.4
    • /
    • pp.81-88
    • /
    • 2011
  • Mini Double Gears Frame is critical part of PDP and also produces couple hundred thousand every month. In the process of mass production, product inspection is very important process. Double Gear, one of the part of machine, was inspected by human eyes which caused mistakes and slow progress. To achieve the speed and accuracy the system was compensated by vision system which is inspecting automatically. The focus value is measured based on the fact that high contrast images have much high frequency edge information. High frequency term of the image is extracted using the high-pass filter and the sum of the high frequency term is used as the focus value. We used a Gaussian smoothing filter to reduce the noise and then measures the focus value using the modified Laplacian filter called a Sum modified Laplacian Focus values for the various lens positions are calculated and the position with the maximum focus value is decided as the focused position. The focus values calculated in various lens position showed the Gaussian distribution. We proposed a method to estimate the best focus position using the Gaussian curve fitting. Focus values of the uniform interval lens positions are calculated and the values are used to estimate the Gaussian distribution parameters to find the best focus position.

Noise Smoothing using the 2D/3D Magnitude Ratio of Mesh Data (메쉬 데이터의 2D/3D 면적비를 이용한 잡음 평활화)

  • Hyeon, Dae-Hwan;WhangBo, Taeg-Keun
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.4
    • /
    • pp.473-482
    • /
    • 2009
  • Reconstructed 3D data from computer vision includes necessarily a noise or an error. When these data goes through a mesh process, the different 3D mesh data from original shape comes to make by a noise or an error. This paper proposed the method that smooths a noise effectively by noise analysis in reconstructed 3D data. Because the proposed method is smooths a noise using the area ratio of the mesh, the pre-processing of unusable mesh is necessary in 3D mesh data. This study detects a peak noise and Gaussian noise using the ratio of 3D volume and 2D area of mesh and smooths the noise with respect of its characteristics. The experimental results using synthetic and real data demonstrated the efficacy and performance of proposed algorithm.

  • PDF

Raised characters rocognition of rubber tires using neural network (Neural Network를 이용한 고무 타이어의 돌출 문자 인식)

  • 김경민;박중조;김민기;박귀태
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10a
    • /
    • pp.864-869
    • /
    • 1993
  • This paper presents the problem of automatically recognizing embossed or molded characters which are raised from the side wall on rubber tire. In the tire image objects have approximately the same gray-value as the background and because of the tire geometry, illumination of the surface is nonhomogenous. Therefore it is difficult to recognize the raised tire character. In this paper, for describing the process of processing three steps have been proposed: 1) MIN & MAX smoothing operation filter, 2) edge detection algorithm using modified laplacian operator, 3) noise rejection. Afterwards, segmentation is done to attain characters from tire image by projection method. The recognition of the characters in the segmented image is carried out by using multilayered neural network, which is insensitive to the noise.

  • PDF

A New Mapping Algorithm for Depth Perception in 3D Screen and Its Implementation (3차원 영상의 깊이 인식에 대한 매핑 알고리즘 구현)

  • Ham, Woon-Chul;Kim, Seung-Hwan
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.45 no.6
    • /
    • pp.95-101
    • /
    • 2008
  • In this paper, we present a new smoothing algorithm for variable depth mapping for real time stereoscopic image for 3D display. Proposed algorithm is based on the physical concept, called Laplacian equation and we also discuss the mapping of the depth from scene to displayed image. The approach to solve the problem in stereoscopic image which we adopt in this paper is similar to multi-region algorithm which was proposed by N.Holliman. The main difference thing in our algorithm compared with the N.Holliman's multi-region algorithm is that we use the Laplacian equation by considering the distance between viewer and object. We implement the real time stereoscopic image generation method for OpenGL on the circular polarized LCD screen to demonstrate its real functioning in the visual sensory system in human brain. Even though we make and use artificial objects by using OpenGL to simulate the proposed algorithm we assure that this technology may be applied to stereoscopic camera system not only for personal computer system but also for public broad cast system.