• 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.

• Research in Mathematical Education
• /
• v.15 no.1
• /
• pp.1-14
• /
• 2011

Logo has influenced many researchers and learners for the past decades as a 20 turtle geometry environment in the perspective of constructionism. Logo uses the metaphor of 'playing turtle' that is intrinsic, local and procedural. We, then, design an environment in which the metaphor of 'playing turtle' is applied to construct 3D objects, and we figure out ways to represent 3D objects in terms action symbols and 3D building blocks. For this purpose, design three kinds of representation systems, and asked students make various 3D artifacts using various representation systems. We briefly introduce the results of our investigation into students' cognitive burden when they use those representation systems, and discuss the future application measures and the design principles of Logo-based 3D microworld.

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

Octree representation has the advantage of being able to represent complex shapes approximately through the repetition of simple primitive shapes. Due to this reason, octree representation together with VRML(Virtual Reality Modelling Language) is usually used for approximating 3D shapes. Since the data size of octree representation increases rapidly as 3D shape to be represented is more and more complicated, its transmission time also increase. In this paper, provided is the new octree representation and encoding/decoding scheme for real-time transmission through the internet in order to visualize 3D geometric data of large size approximately.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2002.09a
• /
• pp.429-431
• /
• 2002

Metabolic analysis of biological tissues, the interventional radiology in MRT (Magnetic Resonance Treatment) and for clinical diagnoses, representation of 4-Dimensional (4D) structural information (x,y,z,t) of biological tissues is required. This paper discusses image representation techniques for those 4D MR Images. We have proposed an image reconstruction method for ultra-fast 3D MRI. It is based on image interpolation and prediction of un-acquired pictorial data in both of the real and the k-space (the acquisition domain in MRI). A 4D MR image is reconstructed from only two 3D MR images and acquired a few echo signals that are optimized by prediction of the tissue motion. This prediction can be done by the phase of acquired echo signal is proportioned to the tissue motion. On the other hand, reconstructed 4D MR images are represented as a 3D-movie by using computer graphics techniques. Rendered tissue surfaces and/or ROIs are displayed on a CRT monitor. It is represented in an arbitrary plane and/or rendered surface with their motion. As examples of the proposed representation techniques, the finger and the lung motion of healthy volunteers are demonstrated.

• BMB Reports
• /
• v.41 no.3
• /
• pp.217-222
• /
• 2008

Based on a five-letter model of the 20 amino acids, we propose a new 2-D graphical representation of protein sequence. Then we transform the 2-D graphical representation into a numerical characterization that will facilitate quantitative comparisons of protein sequences. As an application, we construct the phylogenetic tree of 56 coronavirus spike proteins. The resulting tree agrees well with the established taxonomic groups.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.6
• /
• pp.429-439
• /
• 2006

The purpose of this study is to support the integration from current 2D drawing-based design to future 3D model-based design. In this paper, an important theme is the combination between the STEP-based 2D drawing standards (i.e., AP202) and the IFC-based 3D building model standards. To achieve the purpose, two methodologies are proposed as follows: the development of IFC extension model for the 2D shape data representation by harmonizing ISO/STEP AP202; and the development of mapping solution between IFC 2D extension model and KOSDIC by constructing the exchange scenario for 2D shape data representation. It is expected that the proposed IFC2X2 2D extension model and mapping solution will offer the basis of development of the integrated standards model in AEC industry.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.914-916
• /
• 2003

Most current 3D digital maps are 2.5 dimension models based on DEM, which can only be recognized, browsed and operated by a special software, far from meeting the needs of a modern digital city (global) with the distributed, isomerous and multiple application on the real 3D representation and open sharing models. In this paper, a new generation digital city oriented 3D digital map is studied. Firstly, a real 3D digital map representation is presented. And then, some key techniques and methods for browser-based 3D digital map’s representation, display and operation are introduced, which can realized the open sharing of 3D map in distributed, isomerous and multiple application environment. Furthermore, the scale driving technique of proposed 3D digital map is also studied. And currently, some developments based on some of the above methods are being carried to provide key and general platform for other application software’s development.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.4
• /
• pp.632-638
• /
• 2002

Extensible 3D(X3D) is a software standard for defining interactive web and broadcast-based 3D content integrated with multimedia. The data size of Web3D representation based on polygon meshes is so large that transferring practical data fast is a hard problem. This paper proposes 3D object structure, a new framework for compact 3D representation with high quality surface shape. By utilizing a free form surface technique, qualified surface are transferred with limited amount of data size and rendered. 3D graphic structure can be regarded ad both polygon meshes and free form surfaces. Therefore, it can be easily integrated to existing Web3D data formats, for example VRML ＆ XML. 3D object structure also enables modeling free form surface shapes intuitively with polygon modeling like operations.

• 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.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.1031-1032
• /
• 2006

A 3D model based face recognition system is generally inefficient in computation time because 3D face model consists of a large number of vertices. In this paper, we propose a novel 3D face representation algorithm to reduce the number of vertices and optimize its computation time.