• Journal of information and communication convergence engineering
• /
• 제6권2호
• /
• pp.204-206
• /
• 2008

In this paper, we proposed the recognition method that automatically extracts cracks from a surface image acquired by a digital camera and recognizes the directions (horizontal, vertical, -45 degree, and 45 degree) of cracks using the fuzzy single layer perceptron. We compensate an effect of light on a concrete surface image by applying the closing operation, which is one of the morphological techniques, extract the edges of cracks by Sobel masking, and binarize the image by applying the iterated binarization technique. Two times of noise reduction are applied to the binary image for effective noise elimination. After the specific regions of cracks are automatically extracted from the preprocessed image by applying Glassfire labeling algorithm to the extracted crack image, the cracks of the specific region are enlarged or reduced to $30{\times}30$ pixels and then used as input patterns to the fuzzy single layer perceptron. The experiments using concrete crack images showed that the cracks in the concrete crack images were effectively extracted and the fuzzy single layer perceptron was effective in the recognition of the extracted cracks directions.

• 한국CDE학회논문집
• /
• 제11권3호
• /
• pp.157-163
• /
• 2006

Surfaces of many engineering structures, especially, those of ships are commonly made out of either single- or double-curved surfaces to meet functional requirements. The first step in the fabrication process of a three-dimensional design surface is unfolding or flattening the surface, otherwise known as planar development, so that manufacturers can determine the initial flat plate which is required to form the design shape. In this paper, an algorithm for optimal approximated development of a general curved surface, including both single- and double-curved surfaces, is established by minimizing the strain energy of deformation from its planar development to the design surface. The unfolding process is formulated into a constrained nonlinear programming problem, based on the deformation theory and finite element. Constraints are subjected to the characteristics of the fabrication method. And the design surface, or the curved shell plate is subdivided by automatic mesh generation.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2002년도 가을 학술발표회 논문집
• /
• pp.25-32
• /
• 2002

Free vibration analysis of radialiy multi-delaminated beams with through-the-width multi-delamination is performed in the present study. The multiple delaminations are considered to be in a radial manner through the thickness from the top surface of the beam. The natural frequencies of the radially multi-delaminated beams are calculated from a new algorithm that is based on the single compound delaminated beam model. That is, beams with radial multi-delaminations are regarded as the sum of a single compound delamlnated beam that is the single sub-delaminated beam from the top surface of global beam. Each result of frequency equation for the single delaminated beam with unknown boundary conditions obtained through continuity conditions Is updated to the next one, With these sequential operations, the final frequency equation of radially multi-delaminated beams is obtained for both ends boundary conditions of global beam. The numerical results carried out for the beams are compared with those of some references to give the reliance on the proposed algorithm and to investigate the effects of the shape, number, size of multi-delaminations on the natural frequency. Compared with the other previously presented model, the proposed algorithm is more flexible in modeling and formulating as the total array size of frequency equation is always four by four. Therefore, the proposed algorithm will reduce the effort of user in formulating the physical model to the numerical model.

• 한국정밀공학회지
• /
• 제20권12호
• /
• pp.148-158
• /
• 2003

In this paper, efficient and accurate contact search algorithm is proposed for the contact problems by the finite element method. A slave node and a maser contact segment is defined using the side of a finite element on the contact surface. The specific goal is to develop techniques of reducing the nonsmoothness of the contact interactions arising from the finite element discretization of the contact surface. Contact detection is accomplished by monitoring the territory of the slave nodes throughout the calculation for possible penetration of a master surface. To establish the validity of the proposed algorithm, some different process and geometries examples were simulated. Efforts are focused on the error rate that is based on the penetrated area through the simulations fur large deformation with contact surface between deformable bodies. A proposed algorithm offers improvements in contact detection from the simulation results.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2006년도 Proceedings of ISRS 2006 PORSEC Volume I
• /
• pp.232-235
• /
• 2006

Using 30 days of hourly visible channel data and DIScrete Ordinate Radiative Transfer (DISORT) model (6S), Aerosol optical depth (AOD) at $0.55{\mu}m$ was retrieved over the East Asia. In contrast with the AOD retrieval using low-earth-orbit satellites such as MODIS (Moderate-Res olution Spectroradiometer) or MISR (Multiangle Imaging SpectroRadiometer), this algorithm with geostationary satellite can improve the monitoring of AOD without the limitation of temporal resolution. Due to the limited number of channels in the conventional meteorological imager onboard the geostationary satellite, an AOD retrieval algorithm utilizing a single visible channel has been introduced. This single channel algorithm has larger retrieval error of AOD than other multiple-channel algorithm due to errors in surface reflectance and atmospheric property. In this study, the effects of manifold atmospheric and surface properties on the retrieval of AOD from the geostationary satellite, are investigated and compared with the AODs from AERONET and MODIS. To improve the accuracy of retrieved AOD, efforts were put together to minimize uncertainties through extensive sensitivity tests. This algorithm can be utilized to retrieve aerosol information from previous geostationary satellite for long-term climate studies.

• 한국CDE학회논문집
• /
• 제8권4호
• /
• pp.262-269
• /
• 2003

An approach to compute characteristic curves such as section curves, reflection characteristic lines, and asymptotic curves on a surface is introduced. Each problem is formulated as a surface-plane inter-section problem. A single-valued function that represents the characteristics of a problem constructs a property surface on parametric space. Using a contouring algorithm, the property surface is intersected with a horizontal plane. The solution of the intersection yields a series of points which are mapped into object space to become characteristic curves. The approach proposed in this paper eliminates the use of traditional searching methods or non-linear differential equation solvers. Since the contouring algorithm has been known to be very robust and rapid, most of the problems are solved efficiently in realtime for the purpose of visualization. This approach can be extended to any geometric problem, if used with an appropriate formulation.

• 전자공학회논문지B
• /
• 제29B권11호
• /
• pp.73-84
• /
• 1992

In this paper, an algorithm for recovering the 3-D shape from a single shaded image is proposed. In the proposed algorithm, by using the relation between the height and surface gradient (p, q), a set of linear equations is derived from the linearized reflectance function. Then the 3-D surface is recovered by employing the conjugate gradient technique. In order to improve the convergence speed of the solution, we also employ the hierarchical basis function and multiresolution images in the algorithm. A method for determining the regularization parameter, which is determined by trial and error in the conventional approach, is also introduced. In addition, the proposed algorithm attempts to recover the 3-D surface without requiring the boundary conditions, making it suitable for a real-time implementation. Simulation results for real image as well as synthetic image are provided to demonstrate the performance of the proposed algorithm.

• 대한원격탐사학회지
• /
• 제39권3호
• /
• pp.355-361
• /
• 2023

지구 표면에 대한 정보는 기상 및 대기 역학의 이해나 인간을 포함한 동물에 큰 영향을 미치는 극한 열현상에 대응함에 있어서 핵심적인 지구 물리량이다. 지구 영역에 대한 온도를 추정하기 위하여 위성에 탑재된 열적외 센서가 널리 활용되어 왔는데, 정밀한 활용을 위해서는 온도 추정 과정의 불확도에 대한 이해가 선행되어야 한다. 하지만 온도추정 불확도에 영향을 미치는 많은 요소 중에서 한반도 주변의 환경 하에서의 온도추정 알고리즘의 불확도 산정에 대한 연구는 미미하였다. 본 연구에서는 한반도 주변의 대기 및 해양 조건하에서 범용성이 높은 single-channel 알고리즘의 불확도를 추정하는 연구를 수행하였다. 알고리즘의 입력자료로 필요한 재분석자료(reanalysis)의 영향성을 평가하기 위하여 두 가지의 재분석자료, 즉 fifth generation of European Centre for Medium-Range Weather Forecasts reanalysis of the global climate and weather (ERA5)와 Modern-Era Retrospective analysis for Research and Applications-2 (MERRA-2)를 사용하였고, 복사전달모델은 MODerate resolution atmospheric TRANsmission (MODTRAN)을 사용하였다. MODTRAN 모의와 온도 추정 정확도 검증에 사용되는 현장 관측 수온은 한반도 인근 해역에 위치한 해양 기상 부이(buoy)로부터 획득했다. 실험 결과, 알고리즘 불확도는 대기 수증기량에 따라서 선형에 가깝게 증가하는 것을 확인하였고, 가장 건조한 조건에서는 약 0.35K 그리고 평균적으로 0.45K 가량의 불확도가 발생함을 확인하였다. 이러한 결과는 재분석자료의 종류에 상관없이 유사하게 도출되어 알고리즘이 가지는 순수한 불확도라고 추정할 수 있었다.

• Journal of the Optical Society of Korea
• /
• 제18권4호
• /
• pp.335-340
• /
• 2014

Based on Zernike polynomial fitting, we propose an algorithm believed to be new for interferometric measurements of rotationally asymmetric surface deviation of optics. This method tests and calculates each angular surface by choosing specified rotation angles with lowest error. The entire figure can be obtained by superimposing these sub-surfaces. Simulation and experiment studies for verifying the proposed algorithm are presented. The results show that the accuracy of the proposed method is higher than single-rotation algorithm and almost comparable to the rotation-averaging algorithm with fewer rotation measurements. The new algorithm can achieve a balance between the efficiency and accuracy.

• International Journal of CAD/CAM
• /
• 제5권1호
• /
• pp.19-27
• /
• 2005

As three-dimensional range scanners make large point clouds a more common initial representation of real world objects, a need arises for algorithms that can efficiently process point sets. In this paper, we present a method for extracting smooth surfaces from dense point clouds. Given an unorganized set of points in space as input, our algorithm first uses principal component analysis to estimate the surface variation at each point. After defining conditions for determining the geometric compatibility of a point and a surface, we examine the points in order of increasing surface variation to find points whose neighborhoods can be closely approximated by a single surface. These neighborhoods become seed regions for region growing. The region growing step clusters points that are geometrically compatible with the approximating surface and refines the surface as the region grows to obtain the best approximation of the largest number of points. When no more points can be added to a region, the algorithm stores the extracted surface. Our algorithm works quickly with little user interaction and requires a fraction of the memory needed for a standard mesh data structure. To demonstrate its usefulness, we show results on large point clouds acquired from real-world objects.