• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2008.04a
• /
• pp.727-734
• /
• 2008

This research presents a laboratory study about difference of subjective response between with and without pictures. A main source is impulsive sound caused by leisure shooting. The sources are sampled from outdoor noise and their levels range from 40 to 75 dB at the interval of 5dB. The noise unit is based on A-weighted sound exposure level (ASEL; $L_{AE}$). To make equal ASEL of outdoor noise, finite impulse response (FIR) filter is applied to the originally sampled source to include the effect of distance attenuation. The evaluation method of the jury test adopted a Semantic Difference(SD) Method. The intersection point which two lines crossed was used as reference point. The intersecting point of mean response rating between with and without pictures was approximately 44ASEL and that of %HA was about 60ASEL. In the result of the test, the negative effect of pictures was given at a lower levels than intersection point while the positive effect was given at a higher levels than that.

• Korean Journal of Computational Design and Engineering
• /
• v.21 no.3
• /
• pp.341-352
• /
• 2016

Manual 3D pipeline modeling from LiDAR scanned point cloud data is laborious and time-consuming process. This paper presents a method to extract the pipe, elbow and branch information which is essential to the automatic modeling of the pipeline connection. The pipe geometry is estimated from the point cloud data through the Hough transform and the elbow position is calculated by the medial axis intersection for assembling the nearest pair of pipes. The branch is also created for a pair of pipe segments by estimating the virtual points on one pipe segment and checking for any feasible intersection with the other pipe's endpoint within the pre-defined range of distance. As a result of the automatic modeling, a complete 3D pipeline model is generated by connecting the extracted information of pipes, elbows and branches.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.31-34
• /
• 2000

This paper proposes a reconstruction scheme for overlapping characters in Thai printed document. Overlapping characters are characters that overlap with surrounding characters. The problem of overlapping characters is still an unsolved problem In commercially available software of Thai character recognition systems. The algorithm of reconstruction scheme is based on structural analysis of overlapping Thai printed characters. It consists of 2 steps: overlapping point determination and reconstruction of segmented characters. The overlapping point is defined as the intersection point between characters and can be determined by using templates. Then, an overlapping character is separated into segments at the intersection point. The structure of each segment may be an incomplete character and is not identical to the original one. Therefore, the reconstruction process is employed to add the incomplete part of these segments. The proposed scheme has been implemented and tested with 70 patterns of conventionally found in overlapping printed Thai characters with different typefaces and type sizes. The experimental results show that the proposed scheme can segment and reconstruct overlapping characters correctly. The proposed scheme can improve the recognition rate of commercially available software, ThaiOCR1.5 and ArnThai1.0, more than 60 percents

• Explosives and Blasting
• /
• v.28 no.1
• /
• pp.27-39
• /
• 2010

Blast design equations based on the concept of scaled distances can be obtained from the statistical analysis on measured peak particle velocity data of ground vibrations. These equations represents the minimum scale distance of various recommendations for safe blasting. Two types of scaled distance widely used in Korea are the square root scaled distance (SRSD) and cube root scaled distance (CRSD). Thus, the design equations have the forms of $D/\sqrt{W}{\geq}30m/kg^{1/2}$ and $D/\sqrt[3]{W}{\geq}60m/kg^{1/3}$ in the cases of SRSD and CRSD, respectively. With these equations and known distance, we can calculate the maximum charge weight per delay that can assure the safety of nearby structures against ground vibrations. The maximum charge weights per delay, however, are in the orders of $W=O(D^2)$ and $W=O(D^3)$ for SRSD and CRSD, respectively. So, compared with SRSD, the maximum charge for CRSD increases without bound especially after the intersection point of these two charge functions despite of the similar goodness of fits. To prevent structural damage that may be caused by the excessive charge in the case of CRSD, we suggest that CRSD be used within a specified distance slightly beyond the intersection point. The exact limit is up to the point, beyond which the charge difference of SRSD and CRSD begins to exceed the maximum difference between the two within the intersection point.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.1
• /
• pp.188-196
• /
• 2007

In this paper we propose an efficient offset curve generation algorithm for open and closed 2D point sequence curve(PS curve) with line segments in the plane. One of the most difficult problems of offset generation is the loop intersection problem caused by the interference of offset curve segments. We propose an algorithm which removes global as well as local intersection loop without making an intermediate offset curve by forward tracing of tangential circle. Experiment in computer sewing machine shows that proposed method is very useful and simple.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.2
• /
• pp.121-126
• /
• 1998

It is one of important issues to find intersection curve? in representation of complex surfaces on a computer. Three typical methods, i.e. the tracing method, the subdivision method, and hybrid method, are often applied to find intersection curves between sculptured surfaces. In this paper two topics are dealt with for efficiency and robustness of the hybrid method. One tropic is about how to determine step sizes variably during tracing, the ethel is about how to find tangential points between surfaces. Tracing by variable step size finds intersections rapidly and requires less memory size. Some illustrations show tangential points between surfaces.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.1022-1030
• /
• 2003

In this paper we propose a efficient offset curve construction algorithm for $C^0$-continuous Open and Closed 2D sequence curve with line segment in the plane. One of the most difficult problems of offset construction is the loop problem caused by the interference of offset curve segments. Prior work[1-10] eliminates the formation of local self-intersection loop before constructing a intermediate(or raw) offset curve, whereas the global self-intersection loop are detected and removed explicitly(such as a sweep algorithm[13]) after constructing a intermediate offset curve. we propose an algorithm which removes global as well as local intersection loop without making a intermediate offset curve by forward tracing of tangential circle. Offset of both open and closed poly-line segment sequence curve in the plane constructs using the proposed approach.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.2
• /
• pp.152-158
• /
• 2003

A machine-vision guided inspection system with go-no gauges for inspecting eggcrate assemblies in steam generators is considered. To locate the gauge at the right place, periodic corrective actions for its position and traveling direction are required. We present a machine vision algorithm for determining inserting position and traveling direction of the go-no gauge. The overall procedure of the algorithm is composed of camera calibration, eggcrate image preprocessing, grid-height adjustment, intersection point estimation between two intersecting grids, and adjustment of position and traveling direction of the gauge. The intersection point estimation is performed by using linear regression with a constraint. A test with a real eggcrate specimen shows the feasibility of the algorithm.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.190-199
• /
• 1999

Presented in this paper is an algorithm for finding all intersections among polygonal chains with an O((n+k)·log m) worst-case time complexity, where n is the number of lien segments in the polygonal chains, k is the number of intersections, and m is the number of monotone chains. The proposed algorithm is based on the sweep line algorithm. Unlike the previous polygonal-chain intersection algorithms that are designed to handle special only cases, such as convex polygons or C-oriented polygons, the proposed algorithm can handle arbitrarily shaped polygonal chains having self-intersections and singularities (tangential contact, multiple intersections). The algorithms has been implemented and applied to 1) testing simplicity of a polygon, 2) finding intersections among polygons and 3) offsetting planar point-sequence curves.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.04b
• /
• pp.429-433
• /
• 1995

Compound solid is maded for specially fixed object. A number of compound soild are devided as a unit germetric solid. The special case of rotation about an arbitrary axis makes according selection modelfor transformation. View plane and View region are estiblished for back face removal. After back-face removal eachedge is checked for point of intersection. The designing of of fset surface id maded and tool-path gernerted on the part surface. In tersection point is checked among the offset surfaces. The paper used an efficient algorithm for generating tool paths to apply a notion view volume. Through machining experiments with a 3-axis machining centre, the adequacy of the analysis was confirmed.