• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1997.10a
• /
• pp.142-146
• /
• 1997

An automated surface-strain measuring system is developed in the present study, which consists of the hardware to capture and to display digital images and the software to calculate the 3-D informations of grid points. The software is implemented using the image processing technique, and includes a program for the camera calibration and the post-processor to display the strain distribution. An LDH(limitting dome height) test specimen is measured its surface-strain as an application of the present system.

• Korean Journal of Computational Design and Engineering
• /
• v.7 no.4
• /
• pp.248-253
• /
• 2002

Delaunay triangulation is well balanced in the sense that the triangles tend toward equiangularity. And so, Delaunay triangulation hasn't some slivers triangle. It's commonly used in various field of CAD applications, such as reverse engineering, shape reconstruction, solid modeling and volume rendering. For Example, In this paper, an improved Delaunay triangulation is proposed in 2-dimensions. The suggested algorithm subdivides a uniform grids into sub-quad grids, and so efficient where points are nonuniform distribution. To get the mate from quad-subdivision algorithm, the area where triangulation-patch will be most likely created should be searched first.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.4
• /
• pp.335-342
• /
• 2012

3D point cloud is widely used in Architecture, Civil Engineering, Medical, Computer Graphics, and many other fields. Due to the improvement of 3D laser scanner, a massive 3D point cloud whose gigantic file size is bigger than computer's memory requires efficient preprocessing and visualization. We suggest a data structure to solve the problem; a 3D point cloud is gradually subdivided by arbitrary-sized cube grids structure and corresponding point cloud subsets generated by the center of each grid cell are achieved while preprocessing. A massive 3D point cloud file is tested through two algorithms: QSplat and ours. Our algorithm, grid-based, showed slower speed in preprocessing but performed faster rendering speed comparing to QSplat. Also our algorithm is further designed to editing or segmentation using the original coordinates of 3D point cloud.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.16 no.1
• /
• pp.31-49
• /
• 2012

In this paper, we propose a very efficient method which reconstructs the high resolution surface from a set of unorganized points. Our method is based on the level set method using adaptive octree. We start with the surface reconstruction model proposed in [20]. In [20], they introduced a very fast and efficient method which is different from the previous methods using the level set method. Most existing methods[21, 22] employed the time evolving process from an initial surface to point cloud. But in [20], they considered the surface reconstruction process as an elliptic problem in the narrow band including point cloud. So they could obtain very speedy method because they didn't have to limit the time evolution step by the finite speed of propagation. However, they implemented that model just on the uniform grid. So they still have the weakness that it needs so much memories because of being fulfilled only on the uniform grid. Their algorithm basically solves a large linear system of which size is the same as the number of the grid in a narrow band. Besides, it is not easy to make the width of band narrow enough since the decision of band width depends on the distribution of point data. After all, as far as it is implemented on the uniform grid, it is almost impossible to generate the surface on the high resolution because the memory requirement increases geometrically. We resolve it by adapting octree data structure[12, 11] to our problem and by introducing a new redistancing algorithm which is different from the existing one[19].

• Journal of the Korea Concrete Institute
• /
• v.15 no.3
• /
• pp.377-385
• /
• 2003

Flexural characteristics of the R.C beams strengthened with newly-developed grid-type carbon fiber plastics(CFRP-GRIDS) were investigated. The tests were conducted under the four-points load to the failure to investigate the strengthening effects of CFRP-GRIDS on the beams. Results showed that initial cracks appeared in the boundary layers of fibers embedded in the newly-placed mortar concrete slowly progressed to the direction of supports and showed fracture of fiber plastics and brittle failure of concrete in compression in sequence after the yielding of steel reinforcement. Accordingly, the appropriate area of Grid-type carbon-fiber plastics in the strengthening design of deteriorated RC structures should be limited and given based on the ultimate strength design method to avoid the brittle failure of concrete structures.

• Convergence Security Journal
• /
• v.19 no.1
• /
• pp.67-78
• /
• 2019

Most existing facial expression recognition methods use a uniform grid method that divides the entire facial image into uniform blocks when describing facial features. The problem of this method may include non-face backgrounds, which interferes with discrimination of facial expressions, and the feature of a face included in each block may vary depending on the position, size, and orientation of the face in the input image. In this paper, we propose a variable-size block method which determines the size and position of a block that best represents meaningful facial expression change. As a part of the effort, we propose the way to determine the optimal number, position and size of each block based on the facial feature points. For the evaluation of the proposed method, we generate the facial feature vectors using LDTP and construct a facial expression recognition system based on SVM. Experimental results show that the proposed method is superior to conventional uniform grid based method. Especially, it shows that the proposed method can adapt to the change of the input environment more effectively by showing relatively better performance than exiting methods in the images with large shape and orientation changes.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.2
• /
• pp.138-142
• /
• 2014

This research presents an A* based algorithm which can be applied to Unmanned Ground Vehicle self-navigation in order to make the driving path smoother. Based on the grid map, A* algorithm generated the path by using straight lines. However, in this situation, the knee points, which are the connection points when vehicle changed orientation, are created. These points make Unmanned Ground Vehicle continuous navigation unsuitable. Therefore, in this paper, B-spline curve function is applied to transform the path transfer into curve type. And because the location of the control point has influenced the B-spline curve, the optimal control selection algorithm is proposed. Also, the optimal path tracking speed can be calculated through the curvature radius of the B-spline curve. Finally, based on this algorithm, a path created program is applied to the path results of the A* algorithm and this B-spline curve algorithm. After that, the final path results are compared through the simulation.

• Journal of the Optical Society of Korea
• /
• v.18 no.6
• /
• pp.706-713
• /
• 2014

An enhanced 360-degree integral-floating three-dimensional display system using a hexagonal lens array and a hidden point removal operator is proposed. Only the visible points of the chosen three-dimensional point cloud model are detected by the hidden point removal operator for each rotating step of the anamorphic optics system, and elemental image arrays are generated for the detected visible points from the corresponding viewpoint. Each elemental image of the elemental image array is generated by a hexagonal grid, due to being captured through a hexagonal lens array. The hidden point removal operator eliminates the overlap problem of points in front and behind, and the hexagonal lens array captures the elemental image arrays with more accurate approximation, so in the end the quality of the displayed image is improved. In an experiment, an anamorphic-optics-system-based 360-degree integral-floating display with improved image quality is demonstrated.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.10
• /
• pp.3160-3172
• /
• 1996

A search algorithm for the collision free, time optimal transport path of overhead cranes has been proposed in this paper. The map for the working environment of overhead cranes was constructed in the form of three dimensional grid. The obstacle occupied region and unoccupied region of the map has been represented using the octree model. The best-first search method with a suitable estimation function was applied to select the knot points on the collision free transport path to the octree model. The optimization technique, minimizing the travel time required for transporting objects to the goal while subjected to the dynamic constraints of the crane system, was developed to find the smooth time optimal path in the form of cubic spline functions which interpolate the selected knot points. Several simulation results showed that the selected estimation function worked effectively insearching the knot points on the collision free transport path and that the resulting transport path was time optimal path while satisfying the dynamic constraints of the crane system.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.17-24
• /
• 2006

We consider the sensor location problem (SLP) on a given sensor field. We present the sensor field as grid of points. There are several types of sensors which have different detection ranges and costs. If a sensor is placed in some point, the points inside of its detection range can be covered. The coverage ratio decreases with distance. The problem we consider in this thesis is called multiple-type differential coverage sensor location problem (MDSLP). MDSLP is more realistic than SLP. The coverage quantities of points are different with their distance form sensor location in MDSLP. The objective of MDSLP is to minimize total sensor costs while covering every sensor field. This problem is known as NP-hard. We propose a new integer programming formulation of the problem. In comparison with the previous models, the new model has a smaller number of constraints and variables. This problem has symmetric structure in its solutions. This group is used for pruning in the branch-and-bound tree. We solved this problem by branch-and-cut(B&C) approach. We tested our algorithm on about 60 instances with varying sizes.