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

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.3
• /
• pp.82-88
• /
• 2014

We study the effect of mesh reordering on Laplacian smoothing for parallel high performance computing systems. Specifically, we use the Reverse-Cuthill McKee algorithm to reorder meshes and use Laplacian Smoothing to improve the mesh quality on Nonuniform memory access architecture-based parallel high performance computing systems. First, we investigate the effect of using mesh reordering on Laplacian smoothing for a single core system and extend the idea to NUMA-based high performance computing systems.

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

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

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

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.11
• /
• pp.1185-1198
• /
• 1992

In this paper, the differential weighted algorithm proposed in order to improve th noise smoothing characteristics of conventional Median filter and FIR-Median Hybrid filter. Performance of some image restoration filter(median filter, FIR-Median Hybird filter, FIR-Median Hybrid filter to proposed differential weighted algorithm) are compared and evaluated on the noise smoothing characteristics and sharp edge conservation characteristics. Test and Real images used in this paper are Lenna and Urological images corrupted by impulse, gaussian, exponential and laplacian noise. Experimental results show that the FIR-Median Hybrid filter applied to the differential weighted algorithm are comparatively superior to others. But the filter orders have increased, the more time consumed to image processing. Hence if the adequate filtering by the type of image is selected. now after a great support will be take consideration into the various parts of application by computer science and of medical image processing.

• 제어로봇시스템학회:학술대회논문집
• /
• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06c
• /
• pp.539-544
• /
• 2008

이 논문에서 크기의 변화에 강인한 인공물 축출 알고리듬을 제안한다. 인공물은 크기 및 카메라 센서의 특성에 따라 영상에 다양한 크기로 나타난다. 이 논문은 이러한 크기 변화에 강인한 인공물 축출 방법을 제안한다. 우선 LoG(Laplacian of Gaussian)를 이용하여 최적의 크기를 찾아낸다. 이를 이용하여 우리는 이웃한 정보를 포함할 수 있는 MAP-MRF(Maximum A Posterior-Markov Random Field) 레이블링(Labeling) 방법을 기반으로 인공물 축출을 위한 비용함수를 제안하였다. 인공물은 서로 근처에 존재하기 때문이다. 여기서 정보 비용함수(Data cost function)는 방향 히스토그램(Orientation histogram)을 이용하여 정의하였고, 스무딩 비용함수(Smoothing cost function)는 ICM(Iterated Conditional Modes)을 이용하여 정의한다. 최종적으로 이 알고리듬을 위성영상에 적용하여 알고리듬의 성능을 증명한다.

• Journal of the Korean Society for Precision Engineering
• /
• v.27 no.11
• /
• pp.30-36
• /
• 2010

Previous researches show that linearly integrated Hall sensor arrays (LIHaS) can detect cracks in the steel structure fast and effectively This paper proposes an algorithm that estimates the size and shape of cracks for the developed LIHaS. In most nondestructive testing (NDT), just crack existence and location are obtained by processing 1-dimensional data from the sensor that scans the object with relative speed in single direction. The proposed method is composed with two steps. The first step is constructing 2-dimensionally mapped data space by combining the converted position data from the time-based scan data with the position information of sensor arrays those are placed in the vertical direction to the scan direction. The second step is applying designed Laplacian filter and smoothing filter to estimate the size and shape of cracks. The experimental results of express train wheels show that the proposed algorithm is not only more reliable and accurate to detecting cracks but also effective to estimate the size and shape of cracks.