• Korean Journal of Cognitive Science
• /
• v.14 no.1
• /
• pp.10-10
• /
• 2003

This paper extracts the edge of main components of face with Gabor wavelets transformation in facial expression images. FCM(Fuzzy C-Means) clustering algorithm then extracts the representative feature points of low dimensionality from the edge extracted in neutral face. The feature-points of the neutral face is used as a template to extract the feature-points of facial expression images. To match point to Point feature points on an expression face against each feature point on a neutral face, it consists of two steps using a dynamic linking model, which are called the coarse mapping and the fine mapping. This paper presents an automatic extraction of feature-points by dynamic linking model based on Gabor wavelets and fuzzy C-means(FCM) algorithm. The result of this study was applied to extract features automatically in facial expression recognition based on dimension[1].

• Proceedings of the KSRS Conference
• /
• 1999.11a
• /
• pp.177-181
• /
• 1999

This paper presents an algorithm for building detection from aerial image using segment measure function and line relation. In the detection algorithm proposed, edge detection, linear approximation and line linking are used and then line measure function is applied to each line segment in order to improve the accuracy of linear approximation. Parallelisms, orthogonalities are applied to the extracted liner segments to extract building. The algorithm was applied to aerial image and the buildings were accurately detected.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.305-320
• /
• 2004

Moving object segmentation is a fundamental function for content-based application. Moving object edges are produced by matching the detected moving edges with the current frame edges. But we can often experience the object edge disconnectedness due to coincidence of similarity between the object and background colors or the decrease of movement of moving object. The edge disconnectedness is a serious problem because it degrades the object visual quality so conspicuously That it sometimes makes it inadequate to perform content-based coding. We have solved this problem by developing a robust and comprehensive edge linking algorithm. And we also developed an automatic moving object segmentation algorithm. These algorithms can produce the completely linked moving object edge boundary and the accurate moving object segmentation. These algorithms can process CIF 30 frames/sec in a PC. These algorithms can be used for the MPEG-4 content-based coding.

• KSCI Review
• /
• v.14 no.1
• /
• pp.265-271
• /
• 2006

In this paper, we propose a new automatic fingerprint identification system that identifies individuals in large databases. The algorithm consists of three steps: preprocessing, classification, and matching, in the classification, we present a new classification technique based on the statistical approach for directional image distribution. In matching, we also describe improved minutiae candidate pair extraction algorithm that is faster and more accurate than existing algorithm. In matching stage, we extract fingerprint minutiaes from its thinned image for accuracy, and introduce matching process using minutiae linking information. Introduction of linking information into the minutiae matching process is a simple but accurate way, which solves the problem of reference minutiae pair selection in comparison stage of two fingerprints quickly. This algorithm is invariant to translation and rotation of fingerprint. The proposed system was tested on 1000 fingerprint images from the semiconductor chip style scanner. Experimental results reveal false acceptance rate is decreased and genuine acceptance rate is increased than existing method.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2004.04a
• /
• pp.487-494
• /
• 2004

Resizing techniques have been recognized as practical methods for drift design of high-rise building since sensitivity analysis and iterative structural analysis are not required in implementation. In the techniques, the amount of material of a memberin a building for resizing is determined in terms of cross-sectional areas and sectional inertia moments as design variables. In this study, five drift design methods are developed by considering design variable linking strategy and fomulating resizing algorithm in terms of material properties of shear walls as a design variable. The developed methods are applied to the drift design of 20-story frame-RC shear wall structure, and then evaluated in the view points of practicality and efficiency.

• Nuclear Engineering and Technology
• /
• v.56 no.1
• /
• pp.340-356
• /
• 2024

Bridging traditional experts' disciplinary boundaries is important for nuclear knowledge management systems. However, expert competences are often described in unstructured texts and require substantial human effort to link related competences across disciplines. The purpose of this research is to develop and evaluate a natural language processing approach, based on Latent Semantic Analysis, to enable the automatic linking of related competences across different disciplines and communities of practice. With datasets of unstructured texts as input training data, our results show that the algorithm can readily identify nuclear domain-specific semantic links between words and concepts. We discuss how our results can be utilized to generate a quantitative network of links between competences across disciplines, thus acting as an enabler for identifying and bridging communities of practice, in nuclear and beyond.

• Journal of The Korean Astronomical Society
• /
• v.48 no.1
• /
• pp.75-82
• /
• 2015

We use a volume-limited sample of quasars in the Sloan Digital Sky Survey (SDSS) DR7 quasar catalog to identify quasar groups and address their statistical significance. This quasar sample has a uniform selection function on the sky and nearly a maximum possible contiguous volume that can be drawn from the DR7 catalog. Quasar groups are identified by using the Friend-of-Friend algorithm with a set of fixed comoving linking lengths. We find that the richness distribution of the richest 100 quasar groups or the size distribution of the largest 100 groups are statistically equivalent with those of randomly-distributed points with the same number density and sky coverage when groups are identified with the linking length of $70h^{-1}Mpc$. It is shown that the large-scale structures like the huge Large Quasar Group (U1.27) reported by Clowes et al. (2013) can be found with high probability even if quasars have no physical clustering, and does not challenge the initially homogeneous cosmological models. Our results are statistically more reliable than those of Nadathur (2013), where the test was made only for the largest quasar group. It is shown that the linking length should be smaller than $50h^{-1}Mpc$ in order for the quasar groups identified in the DR7 catalog not to be dominated by associations of quasars grouped by chance. We present 20 richest quasar groups identified with the linking length of $70h^{-1}Mpc$ for further analyses.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.49-60
• /
• 2002

We propose an algorithm for extracting the boundary of a desired object with shape information obtained from sample images. Considering global shape obtained from sample images and edge orientation as well as edge magnitude, the Proposed method composed of two steps finds the boundary of an object. The first step is the approximate segmentation that extracts a rough boundary with a probability map and an edge map. And the second step is the detailed segmentation for finding more accurate boundary based on the SEEL (seed-point extraction and edge linking) algorithm. The experiment results using IR images show robustness to low-quality image and better performance than conventional segmentation methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.5073-5086
• /
• 2015

The rock fracture detection by image analysis is significant for fracture measurement and assessment engineering. The paper proposes a novel image segmentation algorithm for the centerline tracing of a rock fracture based on Hessian Matrix at Multi-scales and Steger algorithm. A traditional fracture detection method, which does edge detection first, then makes image binarization, and finally performs noise removal and fracture gap linking, is difficult for images of rough rock surfaces. To overcome the problem, the new algorithm extracts the centerlines directly from a gray level image. It includes three steps: (1) Hessian Matrix and Frangi filter are adopted to enhance the curvilinear structures, then after image binarization, the spurious-fractures and noise are removed by synthesizing the area, circularity and rectangularity; (2) On the binary image, Steger algorithm is used to detect fracture centerline points, then the centerline points or segments are linked according to the gap distance and the angle differences; and (3) Based on the above centerline detection roughly, the centerline points are searched in the original image in a local window along the direction perpendicular to the normal of the centerline, then these points are linked. A number of rock fracture images have been tested, and the testing results show that compared to other traditional algorithms, the proposed algorithm can extract rock fracture centerlines accurately.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.570-574
• /
• 1990

Detection of left ventricular boundary for the functional analysis of LV(left ventricle)is obtained using automatic boundary detection algorithm based on dynamic programming method. This scheme reduces the edge searching time and ensures connective edge detection, since it does not require general edge operator, edge thresholding and linking process of other edge. detection methods. The left ventricular diastolic volume and systolic volume and systolic volume were computed after this automatic boundary detection, and these Volume data wm applied to analyze LV ejection fraction.