• Journal of the Korean institute of surface engineering
• /
• v.29 no.2
• /
• pp.140-145
• /
• 1996

Silver deposits formed on copper substrates by replacement reactions show poor adhesion, and a silver film plated on such a deposit does not adhere. Silver ion makes a highly stable complex with cyanide ion, so that in a silver cyanide solution, the activity of silver ion is very small. This is one of the reasons for the universal use of cyanide baths in the industrial silver plating. However, the consideration of the difference between the values of the stability constants for bath the silver-iodide complex and the copper-iodide complex suggest that the rate of replacement deposition of silver on the copper substrate in si]ver-potassium iodide solution, could be comparatively low. To confirm this, the rate of replacement deposition of silver in both a silver-potassium iodide solution ($AgNO_3$0.10 mol/L, KI 2.00 mol/L ) and a strike silver plating bath (AgCN 0.028 mol/L, KCN 1.15 mol/L ) was estimated from the current density corresponding to the point of intersection of the anodic and the cathodic polarization curves. These estimated values were almost the same, and it is suggested that the silver-potassium iodide solution is not only a cyanide free silver plating bath capable of employing a copper substrate but a silver plating bath which requires no strike plating.

• Journal of Biomedical Engineering Research
• /
• v.28 no.4
• /
• pp.520-529
• /
• 2007

An efficient method for implementing image reconstruction algorithms for Compton cameras is presented. Since Compton scattering formula establishes a cone surface from which the incident photon must have originated, it is crucial to implement a computationally efficient cone-surface integration method for image reconstruction. In this paper we assume that a cone is made up of a series of ellipses (or circles) stacked up one on top of the other. In order to reduce computational burden for tracing ellipses formed by the intersection of a cone and an image plane, we propose a new method using a series of imaginary planes perpendicular to the cone axis so that each plane contains a circle, not an ellipse. In this case the cone surface integral can be performed by simply accumulating the circles along the cone axis. To reduce the computational cost of tracing circles, only one of the circles in the cone is traced and the rest are determined by using simple trigonometric ratios. For our experiments, we used the three different schemes for tracing ellipses; (i) using the samples generated by the ellipse equation, (ii) using the fixed number of samples along a circle on the imaginary plane, and (iii) using the fixed sampling interval along a circle on the imaginary plane. We then compared performance of the above three methods by applying them to the two reconstruction algorithms - the simple back-projection method and the expectation-maximization algorithm. The experimental results demonstrate that our proposed methods (ii) and (iii) using imaginary planes significantly improve reconstruction accuracy as well as computational efficiency.

• Journal of Korean Society for Geospatial Information Science
• /
• v.19 no.1
• /
• pp.97-103
• /
• 2011

LiDAR system has become a popular tool for generating 3D surface data such as Digital Surface Model. Extraction of valuable information, such as digital building models, from LiDAR data has been an attractive research subject. This research addresses to extract planar patches from LiDAR data. Planar patches are important primitives consisting of man-made objects such as buildings. In order to determine the best fitted planes, this research proposed a method to reduce/eliminate the impact of the outliers and the intersection areas of two planes. After finishing plane fitting, planar patches are segmented by pseudo color values which are calculated by determined three plane parameters for each LiDAR point. In addition, a segmentation procedure is conducted using the pseudo color values to find planar patches. This paper evaluates the feasibility of the proposed method using both airborne and terrestrial LiDAR data.

• Journal of the Society of Naval Architects of Korea
• /
• v.30 no.2
• /
• pp.43-53
• /
• 1993

There exist two difficulties in the nonlinear wave-body problems. First is the abrupt behavior near the intersection point between the body and the free surface, and second is the far field treatment. In this paper, the far field treatment is considered. The main idea is the Taylor series expansion of free-surface geometry and the application of F.F.T. algorithm. The numerical step is as follows. The velocity potential is expressed by the Green's theorem. and the solution is obtained by iteration method. In the iteration stage, the expressions by the Green's theorem are transformed to the convolution forts with the expansion of free surface by the wave slope. Here F.F.T. is applied, so the computing time can be of O(Nlog N) where N is the number of unknowns. The numerical analysis is carried out and the results are compared with other results in linear floating body problem and nonlinear moving pressure patch problem, and good agreements are obtained. Finally nonlinear floating body radiation problem is carried out with computing time of O(Nlog N).

• ETRI Journal
• /
• v.31 no.5
• /
• pp.628-630
• /
• 2009

Recently, Ratha and others proposed a cancelable biometrics scheme which transforms an original fingerprint template into a new one using a noninvertible transformation. However, we show that the original template is recovered by a dictionary attack if two transformed templates originating from it are revealed. In our attack, we simulate the transformation and construct a set of possible pre-images for each transformed template. Then, we find the correct pre-image by computing the intersection of these sets. We present an algorithm implementing this idea as well as successful experimental results.

• International Journal of CAD/CAM
• /
• v.5 no.1
• /
• pp.91-98
• /
• 2005

This paper presents a scheme for interpolating intersecting uniform cubic B-spline curves by Catmull-Clark subdivision surfaces. The curves are represented by polygonal complexes and the neighborhoods of intersection points are modeled by X-Configurations. When these structures are embedded within a control polyhedron, the corresponding curves will automatically be interpolated by the surface limit of subdivision of the polyhedron. The paper supplies a construction which clearly shows that interpolation can still be guaranteed even in the absence of symmetry at the X-configurations. In this sense, this scheme generalizes an already existing technique by the same authors, thereby allowing more freedom to designers.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.1
• /
• pp.67-84
• /
• 1995

Five-axis NC machining is advanced machining technology by which highly geometrically complicated parts can be machined accurately with high machinability. In this paper, we investigate the problems of determining the machinability and part setup orientation for a given surface models. We first develop kinematic model of the five-axis machines based on the axis configuration, then develop algorithms for determining the feasibility of machining by one setup(machinability) and the part orientation for the C,A and A,B type configuration. The machinability is determined by computationally efficient procedure for finding the intersection between the feasible area on the sphere and the numerical map called binary spherical map(BSM), and the part setup is chosen such that the rotational range is minimized among the feasible configurations. The developed algorithms are tested by numerical simulations, convincing they can be readily implemented on the CAD/CAM system as an automated process planner giving the efficient machine type and setup for NC machining.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.2 s.95
• /
• pp.176-182
• /
• 1999

This paper presents a new autonomous kinematic calibration technique by using a laser-vision sensor called "Perceptron TriCam Contour". Because the sensor measures by capturing the image of a projected laser line on the surface of the object, we set up a long, straight line of a very fine string inside the robot workspace, and then allow the sensor mounted on a robot to measure the point intersection of the line of string and the projected laser line. The point data collected by changing robot configuration and sensor measuring are constrained to on a single straght line such that the closed-loop calibration method can be applied. The obtained calibration method is simple and accurate and also suitable for on-site calibration in an industrial environment. The method is implemented using Hyundai VORG-35 for its effectiveness.

• Transactions of Materials Processing
• /
• v.12 no.3
• /
• pp.194-201
• /
• 2003

An automatic quadrilateral mesh generator for large deformation finite element analysis such as metal forming simulation was developed. The NURBS interpolation method is used for modeling arbitrary 2-D free surface. This mesh generation technique is the modified paving algorithm, which is an advancing front technique with element-by-element resolving method for paving boundary intersection problem. The mesh density for higher analysis accuracy and less analysis time can be easily controlled with high-density points, maximum and minimum element size. A couple of application to large deformation finite element analysis is given as an example, which shows versatility and applicability of the proposed approach and the developed mesh generator for large deformation finite element analysis.

• Journal of the Society of Naval Architects of Korea
• /
• v.30 no.4
• /
• pp.17-22
• /
• 1993

The intersection problem of three-dimensional free form surfaces can be solved by geometrical and numerical methods. Up to now, the subdivision technique, which is classified under the former, has been largely employed to find the cross section of ship hull form. In this paper, an algorithm is presented for intersecting ship hull form in high speed. The high speed calculation algorithm is based on simple numerical methods, such as the secant method, false position method and bisection method. The algorithm is directly applicable to depicting arbitrary ship cross sections, drawing ship lines and constructing the offset table.