• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06d
• /
• pp.101-105
• /
• 2010

현재 인터넷 보급의 우수한 발달로 인해 우리는 정보의 바다 또는 인터넷 시대에 살고 있다. 우리는 이러한 인터넷 시대에 살고 있는 만큼 많은 정보를 인터넷을 통하여 검색하고 원하고자 하는 정보를 인터넷을 통해 얻고 있다. 하지만 인터넷을 통하여 웹서핑 또는 정보를 검색하다보면 스팸이나 자동화 도구를 이용하여 광고성 또는 해당 정보와는 상관없는 글들이 무수히 등록되어 있는 것을 볼 수 있다. 이와 같은 것을 방지하기 위하여 CAPTCHA 시스템이 개발되었다. 하지만 기존에 존재하는 CATPCHA 시스템은 텍스트 기반의 시스템이고, 현재 쉽게 통과될 수 있는 많은 기법들이 제시되고 있다. 그리하여 우리는 이러한 단점을 보완하고자 새로운 이미지 기반의 CAPTCHA 시스템을 전 연구를 통하여 새롭게 제안했다[4]. 제안된 시스템은 일반적인 이미지에서 사각형 형태의 서브 이미지를 추출, 추출된 서브 이미지를 무작위 회전을 가하여 사용자에게 올바른 교정을 통해 사용자를 인증하였다. 우리는 이와 같은 연구를 바탕으로 본 논문에서는 서브 이미지를 추출 시 정사각형의 형태가 아닌 N다각형의 형태를 통하여 서브 이미지를 추출한다. 본 논문에서는 N다각형 형태의 서브 이미지 추출시 전 연구와는 다른 방법으로 서브 이미지를 추출하고, 실험을 통하여 사용자에게 가장 인식률이 높은 다각형을 찾고, 전 연구와는 다른 방법의 서브 이미지 추출 방법을 통해 사용자에게 보다 효과적인 서브 이미지를 제공한다. 본 논문에서 제공되는 다각형은 정삼각형에서부터 정16각형이다.

• Korean Journal of Plant Taxonomy
• /
• v.40 no.2
• /
• pp.130-133
• /
• 2010

An unrecorded species of Oldenlandia brachypoda DC. is newly reported from Seogwipo-si, Jejudo, This species is distinguished from Oldenlandia diffusa, the related taxa by the surface and length of the pedicel, the number of flowerd, the shape of the calyx and capsule. The new Korean name 'je-ju-baeg-un-pul', was given considering the collect locality. The illustration, description and key of characters are provided.

• Journal of the Korea Computer Graphics Society
• /
• v.12 no.2
• /
• pp.9-11
• /
• 2006

본 논문은 원 영상의 세부 묘사를 유지하는 사진 타일 모자이크 방법을 제안한다. 이 방법은 타일 내부의 세부 묘사를 위한 사진 타일의 사용과 타일간의 빈 공간을 제거하기 위한 겹쳐진 타일의 사용을 통해 구현된다. 본 논문에서 제시한 방법은 다음 세 단계로 구성된다. 첫째, 에지 회피 기법이 적용된 CVD를 통해 메인 타일의 위치를 얻고, 딜로니 삼각형화를 이용해 서브 타일의 위치를 계산한다. 둘째, 타일간의 관계를 고려해 타일의 크기와 방향성을 구한다. 셋째, 사진 타일을 사용하기 위해 포토 모자이크 기법을 사용한다. 이때, 다단계 인덱싱기법을 통해 사진 검색의 속도를 높인다. 위의 과정을 통해 타일 간의 빈공간이 최소화되고 타일 내부의 세부 묘사가 극대화된 모자이크 영상을 얻는다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.05d
• /
• pp.741-746
• /
• 2002

본 논문에서는 학습자 스스로가 학습 능력을 조절하고 학습 내용과 시험 평가를 객관적으로 판단할 있는 자기 주도적 학습 내용 및 시험 평가 방법을 제안하였다. 제안된 자기 주도적 학습 내용 및 시험평가 방법은 삼각형 타입의 소속 함수와 퍼지 논리를 이용하여 학습 능력과 시험 능력의 소속도를 계산하고 각각에 대해 퍼지 등급도를 부여하였다. 학습 능력의 소속도와 시험 능력의 소속도에 대해서 퍼지 관계의 연산 및 합성에 의해 최종 소속도를 계산하고 퍼지 등급도를 결정하여 학습자가 학습 능력의 소속도와 시험 능력의 소속도 및 최종 퍼지 등급도를 분석하여 스스로 학습을 조정할 수 있도록 하였다. 그리고 제안된 연구 내용을 정보 검색사 필기 과목에 적용하여 구현하였다.

• Journal of Plant Biology
• /
• v.37 no.1
• /
• pp.43-51
• /
• 1994

Spore morphology of 14 species of Ophioglossaceae is examined, and descriptions and key based on spore morphology are provided. In addition, spores of one species of Angiopteris and three species of Osmunda are examined for comparision with those of Ophioglossaceae. Spore shape at proximal face is sub triangular or triquete in Botrychium and circular in Ophiog~ lossum, Angiopteris and Osmunda. Based on the wall sculpturing patterns, three groups can be recognized within Botrychium, and the differences of wall sculpturing among these groups are smaller as compared to those among Botrychium, Ophioglossum, Osmunda and Angiopteris. This result supports the previous infrafamilial system of Clausen, which was mainly based on the characteristics of vernation, habit, fertile and sterile segments of the leaf, and gametophyte. Spores of nine species of Ophioglossum, which are circular in proximal face and fossulate or foveolate in wall sculpturing, are quite uniform as compared to those of Botrychium. Therefore they should be kept under a single genus rather than split into four genera suggested by Nishida (1952).(1952).

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1483-1495
• /
• 2006

The navigation mesh represents a terrain as a set of triangles on which characters may move around. The navigation mesh cab be generated automatically, and it is more flexible in representing 3D surface. The number of triangles to represent a terrain may vary according to the structure of the terrain. As characters are moving around on a navigation mesh, the path planning can be performed more easily by projecting the 3D surfaces into 2D space. However, when the terrain is represented with an elaborated mesh of large number of triangles to achieve more realistic movements, the path finding can be very inefficient because there are too many states(triangles) to be searched. In this paper, we propose an efficient method of path finding in 3D games where the terrain is represented by navigation meshes. Our method uses the visibility tests. When the graph-based search is applied to elaborated polygonal meshes for detailed terrain representation, the path finding can be very inefficient because there are too many states(polygons) to be searched. In our method, we reduce the search space by using visibility tests so that the search can be fast even on the detailed terrain with large number of polygons. First we find the visible vertices of the obstacles, and define the heuristic function as the distance to the goal through those vertices. By doing that, the number of states that the graph-based search visits can be substantially reduced compared to the plane search with straight-line distance heuristic.

• The Journal of Korean Association of Computer Education
• /
• v.7 no.2
• /
• pp.77-84
• /
• 2004

In this thesis, We propose the self-directed learning and test-performing abilities assessment method to evaluate the learning and the test-performing abilities in which learners can not only control their own learning abilities for themselves, but also judge objectively learning and test-performing abilities. This method shows the membership degree of learning and test-performing abilities by using both the triangle-type membership function and the fuzzy logic. In addition, it gives the fuzzy grades to each item. The final membership degrees are calculated and the fuzzy grades are decided by the operation and composition of fuzzy relations on the membership degrees of learning and test-performing abilities. In this method, which is applicable to a writing subject for information searchers, learners are asked to analyse the membership degrees of the learning and test-performing abilities and the final fuzzy grades and to adjust a learning process for themselves.

• Korean Journal of Ichthyology
• /
• v.8 no.2
• /
• pp.23-32
• /
• 1996

External morphology of three species of damselfishes, Chromis notata, C. analis and C. fumea were studied based on the samples collected from the Korean waters from 1993 to 1994. In morphology of the black spot at base of pectoral fins, C. notata has a large triangluar spot at Cheju population and a small circular spot at Sin - am. In the length of pelvic fin, C. notata of Korea can be classified into 3 groups. First group has a pelvic fin that extends to the origin of anal fin, second extends to the anus, third not extend to the anus. C. analis has higher body depth than C. notata and C. fumea in % of standard length. C. fumea has a minute serrate preopercle and no black spot at base of pectoral fins. In distribution, C. notata has a more widly distriubtion area than C. analis and C. fumea. Therefore, C. notata has more tolerance of cold waters than C. analis and C. fumea.

• The KIPS Transactions:PartD
• /
• v.9D no.2
• /
• pp.173-184
• /
• 2002

This paper discuss an index-based subsequence matching that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. In earlier work, Kim et al. suggested an efficient method for whole matching under time warping. This method constructs a multidimensional index on a set of feature vectors, which are invariant to time warping, from data sequences. For filtering at feature space, it also applies a lower-bound function, which consistently underestimates the time warping distance as well as satisfies the triangular inequality. In this paper, we incorporate the prefix-querying approach based on sliding windows into the earlier approach. For indexing, we extract a feature vector from every subsequence inside a sliding window and construct a multidimensional index using a feature vector as indexing attributes. For query processing, we perform a series of index searches using the feature vectors of qualifying query prefixes. Our approach provides effective and scalable subsequence matching even with a large volume of a database. We also prove that our approach does not incur false dismissal. To verify the superiority of our approach, we perform extensive experiments. The results reveal that our approach achieves significant speedup with real-world S&P 500 stock data and with very large synthetic data.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.12
• /
• pp.3275-3284
• /
• 1998

In this paper, we deseribe a Medical Image Information System. Our system stores and manages 5 dimensional medical image data and provides the 3 dimensional medical data via the Internet. The Internet standard VR format. VRML(Virtual Reality Modeling Language) is used to represent the 3I) medical image data. The 3D images are reconstructed from medical image data which are enerated by medical imaging systems such ans CT(Computerized Tomography). MRI(Magnetic Resonance Imaging). PET(Positron Emission Tomograph), SPECT(Single Photon Emission Compated Tomography). We implemented the medical image information system shich rses a surface-based rendering method for the econstruction of 3D images from 2D medical image data. In order to reduce the size of image files to be transfered via the Internet. The system can reduce more than 50% for the triangles which represent the surfaces of the generated 3D medical images. When we compress the 3D image file, the size of the file can be redued more than 80%. The users can promptly retrieve 3D medical image data through the Internet and view the 3D medical images without a graphical acceleration card, because the images are represented in VRML. The image data are generated by various types of medical imaging systems such as CT, MRI, PET, and SPECT. Our system can display those different types of medical images in the 2D and the 3D formats. The patient information and the diagnostic information are also provided by the system. The system can be used to implement the "Tele medicaine" systems.