• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1485-1490
• /
• 2004

Recently, we have remarkable developments in intelligent robot systems. The remarkable features of intelligent robot are that it can track user, does face recognition and vital for many surveillance based systems. Advantage of face recognition when compared with other biometrics recognition is that coerciveness and contact that usually exist when we acquire characteristics do not exist in face recognition. However, the accuracy of face recognition is lower than other biometric recognition due to decrease in dimension from of image acquisition step and various changes associated with face pose and background. Factors that deteriorate performance of face recognition are many such as distance from camera to face, lighting change, pose change, and change of facial expression. In this paper, we implement a new 3D active camera system to prevent various pose variation that influence face recognition performance and propose face recognition algorithm for intelligent surveillance system and mobile robot system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1937-1945
• /
• 1999

In paper, we propose a 3D polygonal mesh simplification technique based on vertex clustering. The proposed method differentiates the size of each cluster according to the local property of a 3D object. We determine the size of clusters by considering the normal vector of triangles and the vertex distribution. The subdivisions of cluster are represented by octree. In this paper, we use the Harsdorff distance between the original mesh and the simplified one as a meaningful error value. Because proposed method adaptively determine the size of cluster according to the local property of the mesh, it has smaller error as compared with the previous methods and represent the small regions on detail. Also it can generate a multiresolution model and selectively refine the local regions.

• Journal of Broadcast Engineering
• /
• v.13 no.6
• /
• pp.962-965
• /
• 2008

2-D shape descriptors, which are vectors representing characteristics of shapes, enable comparison and classification of shapes and are mainly applied to image and 3-D model retrieval. Existing descriptors have limitations that they only describe shapes of single closed contours or lack in precision, making it difficult to be applied to shapes with multiple contours. Therefore, in this paper, we propose a new shape descriptor called Multi-Curvature-Scale Space that can be applied to shapes with multiple contours. Specifically, we represent the topology of the sub-contours in the multi-contour along with Curvature-Scale Space descriptors to represent the shapes of each sub-contours. Also, by allowing the weight of each component to be controlled when computing the distance between descriptors the weight, we deal with ambiguities in measuring similarity between shapes. Results of various experiments that prove the effectiveness of proposed descriptor are presented.

• Investigative Magnetic Resonance Imaging
• /
• v.24 no.3
• /
• pp.123-131
• /
• 2020

Purpose: Joint label fusion (JLF) is a popular multi-atlas-based segmentation algorithm, which compensates for dependent errors that may exist between atlases. However, in order to get good segmentation results, it is very important to set the several free parameters of the algorithm to optimal values. In this study, we first investigate the feasibility of a JLF algorithm for prostate segmentation in MR images, and then suggest the optimal set of parameters for the automatic prostate segmentation by validating the results of each parameter combination. Materials and Methods: We acquired T2-weighted prostate MR images from 20 normal heathy volunteers and did a series of cross validations for every set of parameters of JLF. In each case, the atlases were rigidly registered for the target image. Then, we calculated their voting weights for label fusion from each combination of JLF's parameters (r_pxy, r_pz, r_sxy, r_sz, β). We evaluated the segmentation performances by five validation metrics of the Prostate MR Image Segmentation challenge. Results: As the number of voxels participating in the voting weight calculation and the number of referenced atlases is increased, the overall segmentation performance is gradually improved. The JLF algorithm showed the best results for dice similarity coefficient, 0.8495 ± 0.0392; relative volume difference, 15.2353 ± 17.2350; absolute relative volume difference, 18.8710 ± 13.1546; 95% Hausdorff distance, 7.2366 ± 1.8502; and average boundary distance, 2.2107 ± 0.4972; in parameters of r_pxy = 10, r_pz = 1, r_sxy = 3, r_sz = 1, and β = 3. Conclusion: The evaluated results showed the feasibility of the JLF algorithm for automatic segmentation of prostate MRI. This empirical analysis of segmentation results by label fusion allows for the appropriate setting of parameters.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.9 no.2
• /
• pp.196-204
• /
• 2016

World Health Organization reported that heart-related diseases such as coronary artery stenoses show the highest occurrence rate which may cause heart attack. Using Computed Tomography angiography images will allow radiologists to detect and have intervention by creating 3D roadmapping of the vessels. However, it is often complex and difficult do reconstruct 3D vessel which causes very large amount of time and previous researches were studied to segment vessels more accurate automatically. Therefore, in this paper, Region Competition, Geodesic Active Contour (GAC), Multi-atlas based segmentation and Active Shape Model algorithms were applied to segment aortic root from CTA images and the results were analyzed by using mean Hausdorff distance, volume to volume measure, computational time, user-interaction and coronary ostium detection rate. As a result, Extracted 3D aortic model using GAC showed the highest accuracy but also showed highest user-interaction results. Therefore, it is important to improve automatic segmentation algorithm in future

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.4
• /
• pp.294-300
• /
• 2004

According to the development of digital media technologies various algorithms for video clip matching have been proposed to match the video sequences efficiently. A large number of video search methods have focused on frame-wise query, whereas a relatively few algorithms have been presented for video clip matching or video shot matching. In this paper, we propose an efficient algorithm to index the video sequences and to retrieve the sequences for video clip query. To improve the accuracy and performance of video sequence matching, we employ the Cauchy function as a similarity measure between histograms of consecutive frames, which yields a high performance compared with conventional measures. The key frames extracted from segmented video shots can be used not only for video shot clustering but also for video sequence matching or browsing, where the key frame is defined by the frame that is significantly different from the previous frames. Experimental results with color video sequences show that the proposed method yields the high matching performance and accuracy with a low computational load compared with conventional algorithms.

• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.555-562
• /
• 2004

Both global volume reduction and local shape changes of hippocampus within the brain indicate their abnormal neurological states. Hippocampal shape analysis consists of two main steps. First, construct a hippocampal shape representation model ; second, compute a shape similarity from this representation. This paper proposes a novel method for the analysis of hippocampal shape using integrated Octree-based representation, containing meshes, voxels, and skeletons. First of all, we create multi-level meshes by applying the Marching Cube algorithm to the hippocampal region segmented from MR images. This model is converted to intermediate binary voxel representation. And we extract the 3D skeleton from these voxels using the slice-based skeletonization method. Then, in order to acquire multiresolutional shape representation, we store hierarchically the meshes, voxels, skeletons comprised in nodes of the Octree, and we extract the sample meshes using the ray-tracing based mesh sampling technique. Finally, as a similarity measure between the shapes, we compute $L_2$ Norm and Hausdorff distance for each sam-pled mesh pair by shooting the rays fired from the extracted skeleton. As we use a mouse picking interface for analyzing a local shape inter-actively, we provide an interaction and multiresolution based analysis for the local shape changes. In this paper, our experiment shows that our approach is robust to the rotation and the scale, especially effective to discriminate the changes between local shapes of hippocampus and more-over to increase the speed of analysis without degrading accuracy by using a hierarchical level-of-detail approach.