• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.28 no.1
• /
• pp.5-12
• /
• 2010

It is very important to get the accurate calculation of pit-excavation volume in many civil engineering projects. There have been common drawbacks to earlier methods of ground profiling, such dealing with sharp corners or the grid points any two straight lines. There are several papers of using spline surfaces to obtain more accurate calculations of the earthwork. In this paper, we propose an algorithm of finding a spline surface without boundary conditions which interpolates the given data and an appropriate method to calculate the earthwork. We present some computational results showing that our proposed method provides good accuracy.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.16 no.4
• /
• pp.696-706
• /
• 1992

In sheet metal fabrication using NCT(numerically controlled turret), the automatic tool selection for the NCT operation is the major problem to be solved first to improve its production performance. However, the punching tool selection has been done by human experts either manually or semi-automatically. In this paper, we have introduced the shape-index-set to handle the shape of sheet metal parts and developed an algorithm through which one can find easily the successive matching curves between two curve lists, one from the punching tool and the other from the boundaries of the sheet metal part. Based on this algorithm, we have also devised the method that can select automatically the tools to punch out the boundaries of sheet metal parts. The result of several computational experiments shows the successful tool selection without any fail.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.15 no.5
• /
• pp.205-214
• /
• 2020

With the recent development of hardware and software technology, interest in the development of wearable devices is increasing. In particular, wearable devices require algorithms suitable for low-power and low-capacity embedded devices. Among them, there is an increasing demand for a signal compression algorithm that reduces communication overhead, in order to increase the efficiency of storage and transmission of electrocardiogram (ECG) signals requiring long-time measurement. Because normal beats occupy most of the signal with similar shapes, a high rate of signal compression is possible if normal beats are represented by a template. In this paper, we propose an algorithm for determining the normal beat template using the template cluster and Pearson similarity. Also, the template is expressed effectively as a few vertices through linear approximation algorithm. In experiment of Datum 234 of MIT-BIH arrhythmia database (MIT-BIH ADB) provided by Physionet, a compression ratio was 33.44:1, and an average distribution of root mean square error (RMSE) was 1.55%.

• Korean Journal of Optics and Photonics
• /
• v.11 no.2
• /
• pp.80-84
• /
• 2000

Parabolic almninium mlITOr of m.5('||'&'||'cent; 50 nun) was fabncated by a diamond tummg machine. Computer generated hologram (CGH) for the test of parabolic mirror was encoded by binary phase hologram Approximation of curved fringe to line was made by staircase encoding. After fringe data 1ransformed mto a Post Scnpt file. magnified master CGH was printed by a laser printer, and then it reduced to the photographIc film. Parabolic mirror was tested by Twyman-Green interferometer with CGH at VIewing arm. Its experimental result was compared with those of surface profile and auto-collimatIon test, and then the errors were analyzed.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2004.05b
• /
• pp.512-515
• /
• 2004

횡월류 위어는 수로에서 일정한 월류량을 얻기 위해서 또는 홍수시 하천에서 하류의 유량을 감소시킬 목적으로 설치되는 off-line 저류지에서의 구조물이다. 이러한 횡월류 위어의 단면 설계 시 계획 월류량 산정을 위하여 일반적으로 De marchi공식이 사용되며 De marchi공식은 유량계수($C_M$)와 월류수심의 함수이며, 유량 계수는 여러 연구자들이 실험을 통하여 여러 가지 유량계수 공식으로 제시되었다. 하지만 기존의 제시된 유량계수식($C_M$)들은 동일한 Froude수에 대한 유량계수($C_M$)값이 큰 편차를 보인다. 이는 개개의 유량계수식들이 서로 다른 실험조건에 의한 자료들의 회귀분석으로 산정된 식들이기 때문이다. 본 인구에서는 수리모형실험을 통하여 횡월류 위어의 월류량에 영향을 미치는 유량계수를 산정하고, 기존의 유량계수 공식들과 비교 분석하여 적합한 유량계수식을 제안하였다. 실험은 폭 0.3m의 직선개수로에서 위어의 폭과 유량을 변화시키며 실험을 반복 수행하였으며, 실험결과 유량계수는 Froude수에 반비례하는 경향을 나타냈다. 산정된 유량계수를 Borghei, Subramanya, Hager, Ranga Raju 공식들과 비교한 결과 Borghei 공식에 의한 계산치와 실험치가 $7.5\%$의 오차를 보이던 가장 근사한 값을 보였다.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.10
• /
• pp.94-102
• /
• 1999

In this paper, an algorithm for estimating the scene-illuminant color directly from an image is proposed. To determine the scene-illuminant color in the image. the intersection point between the light locus of camera (CCD) reponses and an approximated lines for the cluster of pixels in a highlight area on chromaticity coordinates is used. By using the predetermined characteristics of the used camera for some illuminants, this algorithm allows us to obtain more accurate estimation of the scene-illuminatnt color from a captured image than that the previous methods provide.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2018.05a
• /
• pp.279-283
• /
• 2018

하천의 조도계수는 흐름에 대한 하도의 저항 정도를 표시하는 지표로서, 하천의 다양한 수리 계산을 실시할 때 가장 중요한 기본 자료 중 하나이다. 이러한 조도계수는 하도의 형상, 하상 재료, 유량의 크기 등에 의해 영향을 받는다. 본 연구에서는 하천의 유량 규모에 따른 조도계수의 변화 정도를 수리 실험과 수치 모의를 통해 간접적으로 검토하였다. 유량 조건별 수리 실험은 한국건설기술연구원의 하천실험센터 내 직선 수로에서 수행하였고, 수치 모의는 HEC-RAS를 이용하였다. 유량 조건은 하천실험센터의 펌프 가동의 정도를 고려하여 5개로 구분하였고, 각각의 유량 조건에 대하여 유량을 실측하였다. 실측에 따른 유량의 규모는 $0.23{\sim}1.91m^3/s$로 나타났다. 각각의 유량 조건에 대하여 수치 모의의 검증을 위해 6개 지점에서 수위표와 초음파 수위계를 이용하여 수위를 계측하였고, 이 가운데 최하류 지점의 수위는 HEC-RAS 모형의 하류단 경계조건으로 이용하였다. 실험 하도 구간의 총 연장은 372 m 이고, 횡단구조물이 없는 지점을 제외하면 대부분 20 m 간격으로 총 21개의 하천 단면을 입력하여 HEC-RAS를 구성하였다. 각각의 유량 조건에 대한 수치 모의 모형은 5개 수위 계측 지점의 수위 오차가 최소화되도록 조도계수를 변화시켜 보정되었다. 그 결과, 각각의 유량 조건에 대한 수치 모의 결과의 평균 오차는 0.01~0.02 m로 계산치와 관측치가 매우 근사하였다. 결정된 조도계수는 0.041~0.075의 범위를 가지는 것으로 분석되었고, 유량의 증가에 따라 큰 폭으로 감소하다가 특정한 값에 수렴하는 것으로 검토되었다.

• Korean Journal of Agricultural Science
• /
• v.14 no.2
• /
• pp.373-383
• /
• 1987

No-fines concrete is concrete from which the fine aggregate fraction has been omitted. The concrete so formed, consisting only of coarse aggregate, cement, and water, has large voids uniformly distributed through its mass. This study was performed to obtain the basic data which can be applied to the use of no-fines concrete. The data was based on the properties of no-fines concrete depending upon various mixing ratios. The results obtained were summarized as follows. 1. Test result of the consistency, suitable water-cement ratio was increased with the increasing of mixing ratio. 2. At the suitable water-cement ratio, the highest strengths were showed. But it gradually was decreased with the increasing of mixing ratio and strengths are considerably lower than that of conventional portland cement concrete. 3. The relations between compressive and tensile strength were highly singnificant as a straight line shaped. The strength ratio was decreased with the increasing of mixing ratio and considerably lower than of conventional portland cement concrete. 4. Bulk density was decreased with the increasing of the mixing ratio, and was similar to that of the conventional portland cement concrete at mixing ratio 1:4. 5. The relations between strength and bulk density were highly significant as a straight line shaped. The decreasing ratio of strengths was higher than that of bulk density.

• Journal of Korean Association for Spatial Structures
• /
• v.12 no.1
• /
• pp.109-119
• /
• 2012

For membrane structure, there are three main steps in design and construction, which are form finding, statistical load analysis, and cutting patterning. Unlike the first two stages, the step of cutting pattern involves the translation of a double-curved surface in 3D space into a 2D plane with minimal error. For economic reasons, the seam lines of generated cutting patterns rely greatly on the geodesic line. Generally, as searching regions of the seam line are plane elements in the step of shape analysis, the seam line is not a smooth curve, but an irregularly divided straight line. So, it is how we make an irregularly divided straight line a smooth curve that defines the quality of the pattern. Accordingly, in this paper, we analyzed interpolation schemes using spline, and apply these methods to cutting pattern generation on the curved surface. To generate the pattern, three types of spline functions were used, i.e., cubic spline function, B-spline, and least-square spline approximation, and simple model and the catenary-shaped membrane was adopted to examine the result of generation. The result of comparing the approximation curves by the number of elements and the number of extracted nodes of simple model revealed that the seam line for less number of extracted nodes with large number of elements were more efficient, and the least-square spline approximation provided smoother seam line than other methods.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.652-657
• /
• 2014

Given a starting point, destination point and various Points Of Interest (POIs), which contain a full or partial order, for a user to visit we wish to create, a sequenced route from the starting point to the destination point that includes one member of each POI type in a particular order. This paper proposes a method for finding the approximate shortest route between the start point, destination point and one member of each POI type. There are currently two algorithms that perform this task but they both have weaknesses. One of the algorithms only considers the distance between the visited POI (or starting point) and POI to visit next. The other algorithm chooses candidate points near the straight-line distance between the start point and destination but does not consider the order of visits on the corresponding network path. This paper outlines an algorithm that chooses the candidate points that are nearer to the network path between the start point and destination using network search. The algorithm looks for routes using the candidate points and finds the approximate shortest route by assigning an adaptive priority to the route that visits more POIs in a short amount of time.