• Journal of Computational Design and Engineering
• /
• v.2 no.1
• /
• pp.67-72
• /
• 2015

Recently, along with the improvements of geometry modeling methods using sketch-based interface, there have been a lot of developments in research about generating surface model from 3D curves. However, surfacing a 3D curve network remains an ambiguous problem due to the lack of geometric information. In this paper, we propose a new algorithm for estimating the normal vectors of the 3D curves which accord closely with user intent. Bending energy is defined by utilizing RMF(Rotation-Minimizing Frame) of 3D curve, and we estimated this minimal energy frame as the one that accords design intent. The proposed algorithm is demonstrated with surface model creation of various curve networks. The algorithm of estimating geometric information in 3D curves which is proposed in this paper can be utilized to extract new information in the sketch-based modeling process. Also, a new framework of 3D modeling can be expected through the fusion between curve network and surface creating algorithm.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.05a
• /
• pp.462-465
• /
• 2002

This paper deals with the problem of synthesis of stable and optimal grasps with unknown objects by 3-finger hand. Previous robot grasp research has analyzed mainly with either unknown objects 2D by vision sensor or unknown objects, cylindrical or hexahedral objects, 3D. Extending the previous work, in this paper we propose an algorithm to analyze grasp of unknown objects 3D by vision sensor. This is archived by two steps. The first step is to make a 3D geometrical model of unknown objects by stereo matching which is a kind of 3D computer vision technique. The second step is to find the optimal grasping points. In this step, we choose the 3-finger hand because it has the characteristic of multi-finger hand and is easy to modeling. To find the optimal grasping points, genetic algorithm is used and objective function minimizing admissible farce of finger tip applied to the object is formulated. The algorithm is verified by computer simulation by which an optimal grasping points of known objects with different angles are checked.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.1
• /
• pp.1-10
• /
• 1992

This study presents a complete octree construction algorithm for 2D depth images obtained from orthogonal face views, which can represent 3D objects exactly. In constructing quadtree, optimal quadtree construction algorithm is applied to depth images for efficient use of memory and reduction of tree construction time. In addition, pseudo-octrees are constructed by using our proposed method, which construct pseudo-octrees according to the resolution value given in each node of constructed quadtree and mapping relation between quadrants and octants. Finally, a complete octree, which represents a 3D object, is constructed by volume intersection with each constructed pseudo-octree. The representation accuracy of a complete octree constructed by our algorithm is investigated by using a 3D display method and a volume ratio method for a complete octree.

• The Journal of the Korea Contents Association
• /
• v.6 no.11
• /
• pp.302-309
• /
• 2006

This paper propose a practical algorithm to reuse and expand the objects. This algorithm is based on the Motion Path Modification rules. We focus on reusing of the existing motions for synthesizing new motions for the objects. Both the linear and the nonlinear curve-fitting algorithm are applied to modify an animation by keyframe interpolation and to make the motion appear realistic. We also proposes a framework of the scenario-based 3D image synthesizing system that allows common users, who envision a scenario in their minds, to realize it into segments of a cool animation. The framework is useful in building a 3D animation in game programming with a limited set of 3D objects.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.228-246
• /
• 2011

A 3D model based approach for a face representation and recognition algorithm has been investigated as a robust solution for pose and illumination variation. Since a generative 3D face model consists of a large number of vertices, a 3D model based face recognition system is generally inefficient in computation time and complexity. In this paper, we propose a novel 3D face representation algorithm based on a pixel to vertex map (PVM) to optimize the number of vertices. We explore shape and texture coefficient vectors of the 3D model by fitting it to an input face using inverse compositional image alignment (ICIA) to evaluate face recognition performance. Experimental results show that the proposed face representation and recognition algorithm is efficient in computation time while maintaining reasonable accuracy.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.217-224
• /
• 2002

Many systems handle 3D-image were used. High-performance computer systems and techniques of compressing images to handle 3D-image were used. But there will be cost Problems, if GIS system is implemented, using the high-performance system. And if GIS system is implemented, using the techniques of compressing images, there will be some loss of a image. It will take a long processing time to handle 3D-images using a general PC because the size of 3D-image files are very huge. The parallel algorithm presented in the paper can improve speed to handle 3D-image using parallel computer system. The system uses the method of displacing images from nodes to screens, dividing a 3D-image into multiple sub images on multiple nodes. The performance of the presented algorithm showers improving speed by experiments.

• Journal of Korea Game Society
• /
• v.3 no.2
• /
• pp.24-29
• /
• 2003

The market of digital avatar with internet and digital technology is increasing rapidly. The users want to express any free-formed motion of their avatars in the cyber space. The user s motion capturing method as the avatar's motion can express any free-formed motion of the avatar in real-time but the methods are expensive and inconvenient. In this paper, we proposed a new method of expressing any free-formed motion of the avatar in real-time. The proposed method is an algorithm for real-time control of a 3D avatar in symmetry-formed free motion. Specially, the algorithm aims at the motion control of a 3D avatar for online dancing games. The proposed algorithm uses the skeleton character model and controls any one of two hands of the character model by a joystick with two sticks. In the symmetry-formed motion, the position and orientation of one hand can determine the position and orientation of the other hand. And the position and orientation of a hand as an end-effector can determine the pose of the arm by Inverse Kinematics. So the algorithm can control the symmetry-formed free motions of two arms by one joystick with two sticks. In the dance game, the algorithm controls the arm motion by the joystick and the other motion by the motion captured DB.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.139-142
• /
• 2000

$\mu$BGA(Ball Grid Array) is growing in response to a great demand for smaller and lighter packages for the use in laptop, mobile phones and other evolving products. However it is not easy to find its defect by human visual due to in very small dimension. From this point of view, we are interested its development of a vision based automated inspection algorithm. For this, first a 2D view of $\mu$BGA is described under a special blue illumination. Second, a notation-invariant 2D inspection algorithm is developed. Finally a 3D inspection algorithm is proposed for the case of stereo vision system. As a simulation result, it is shown that 3D defect not easy to find by 2D algorithm can be detected by the proposed inspection algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.1
• /
• pp.54-59
• /
• 2004

We suggest a 3D vision inspection algorithm which is based on the external shape feature. Because many electronic parts have the regular shape, if we have the database of pattern and can recognize the object using the database of the object s pattern, we can inspect many types of electronic parts. Our proposed algorithm uses the geometrical pattern matching method and 3D database on the electronic parts. We applied our suggested algorithm fer inspecting several objects including typical IC and capacitor. Through the experiments, we could find that our suggested algorithm is more effective and more robust to the inspection environment(rotation angle, light source, etc.) than conventional 2D inspection methods. We also compared our suggested algorithm with the feature space trajectory method.

• Journal of Information Processing Systems
• /
• v.16 no.2
• /
• pp.343-359
• /
• 2020

In this paper, a new algorithm is proposed for three-dimensional (3D) shape recognition using local features of model views and its sparse representation. The algorithm starts with the normalization of 3D models and the extraction of 2D views from uniformly distributed viewpoints. Consequently, the 2D views are stacked over each other to from view cubes. The algorithm employs the descriptors of 3D local features in the view cubes after applying Gabor filters in various directions as the initial features for 3D shape recognition. In the training stage, we store some 3D local features to build the prototype dictionary of local features. To extract an intermediate feature vector, we measure the similarity between the local descriptors of a shape model and the local features of the prototype dictionary. We represent the intermediate feature vectors of 3D models in the sparse domain to obtain the final descriptors of the models. Finally, support vector machine classifiers are used to recognize the 3D models. Experimental results using the Princeton Shape Benchmark database showed the average recognition rate of 89.7% using 20 views. We compared the proposed approach with state-of-the-art approaches and the results showed the effectiveness of the proposed algorithm.