• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1367-1376
• /
• 1998

In this paper we propose an real time marker detection algorithm for motion analysis both in 2 dimensions and 3 dimensions with CCD camera and rfame grabber only which has no image processor. The main algorithm consists of the following 3 algorithms; 1) the tracing algorithm that makes it possible to predict the expected marker location by narrowing the searching boundary, 2) the searching algorithm that detects the marker in the expected boundary using Ad-hoc previous screen search technique, tornado search method rotate diagonal search method search technique, 3) the algorithm that finds the central point of the detected marker. We try to narrow the searching boundary for real time processing. Also, it is able to find the central point of the detected marker much faster than typical contour tracing algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.2
• /
• pp.31-36
• /
• 2003

This paper proposes an acceleration method of PCA(Principal Component Analysis) based feature detection. The feature detection method makes decision whether the target feature is included in a given image, and if included, calculates the position and extent of the target feature. The position and scale of the target feature or face is not known previously, all the possible locations should be tested for various scales to detect the target. This is a search Problem in huge search space. This Paper proposes a fast face and feature detection method by reducing the search space using the multi-stage prediction map and contour Prediction map. A Proposed method compared to the existing whole search way, and it was able to reduce a computational complexity below 10％ by experiment.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.1
• /
• pp.1-11
• /
• 1998

This paper describes design and implementation of the system that is used to efficiently retrieve music information at a digital music library. Unlike typical music information retrieval systems, this system allows the user to sing a part of the melody through the microphone which he/she wants to find rather than using title, composer or the subject catalog to search. The system then recognizes the musical notes information through the signal processing of the sounds of the entered melody, and the intervals contour is created based on this information and used as a search pattern. By running the proposed notes string search algorithm that uses the musical notes information processed with the user input, and it produces the approximate search results. Therefore, users are able to retrieve and appreciate the music whenever he/she can sing any portion of the desired music.

• The Journal of Information Technology and Database
• /
• v.4 no.2
• /
• pp.97-104
• /
• 1998

본 논문은 디지털 오디오 도서관에 대규모 선율 데이터베이스로부터 임의의 곡을 효율적으로 탐색하기 위하여 음정곡선을 색인키로 사용하는 방법에 대해 기술했다. 사용자가 검색하고자 하는 음악의 일부 선율을 노래하면 입력된 음신호를 인식하여 음높이 정보를 추출한다. 그리고, 음표간의 음정을 계산하여 음표순으로 배열함으로써 음정 곡선을 만든다. 제안한 은표열 탐색 알고리즘에 생성된 음정 곡선을 탐색 패턴으로 입력하여 선율 데이터베이스의 음표열을 비교 조사한다. 그러면 근사 음정 곡선을 가진 후보곡을 탐색할 수 있다. 제안한 음표열 탐색 알고리즘은 실험을 통해 동적 프로그래밍 및 상태 대조 알고리즘과 비교한 결과 탐색 시간이 2배이상 향상되었다.

• Journal of Digital Contents Society
• /
• v.3 no.2
• /
• pp.197-209
• /
• 2002

If we reduce the number of vertexes to decrease bit rate in polygon-based shape coding, the distortion of approximated contour increases rapidly. On the other hand, if we reduce the distortion, the number of vertexes increases rapidly and many bits are required to encode the vertexes. To improve this problem, in this paper we propose the approximation vertex search method. The encoder in the proposed method searches the type of distortion patterns that is the most similar to the shape which polygon edge and contour segment form and then encodes it. And then, the decoder mathematically finds the approximated vertexes from decoded distortion pattern information. Therefore, the proposed algorithm results in encoding many vertexes at a low bit rate and having the smoother shape than conventional method. As shown in computer simulation, the proposed method has less distortion than conventional method. It costs less bit rate by $10{\sim}20%$ than conventional algorithm in same distortion.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.2
• /
• pp.55-60
• /
• 2011

In this paper, we propose a new method for extracting muscles from lumbar images. The proposed method sets areas without distortions with field expert's assistance as areas of measuring interest and removing noises from initial ultrasonic videos. Then, the method emphasizes the brightness contrast with Ends-in search stretching algorithm and separate thoracic vertebra from subcutaneous fat area using morphological characteristics. 4-directions contour tracing algorithm is applied to extract the bottom of subcutaneous fat area. Extracting thoracic vertebra area requires noise removal and morphological characteristics as well among candidate areas obtained by controlling min-max brightness. The thickness of muscles is then defined as the length between subcutaneous fat area and extracted thoracic vertebra. The experiment which consists of 368 image analysis verifies that the proposed method is more effective in measuring the thickness of muscles than before.

• Journal of KIISE:Software and Applications
• /
• v.32 no.11
• /
• pp.1013-1020
• /
• 2005

This paper presents an effective and robust leaf image retrieval system based on shape feature. Specifically, we propose an improved MPP algorithm for more effective representation of leaf images and show a new dynamic matching algorithm that basically revises the Nearest Neighbor search to reduce the matching time. In particular, both leaf shape and leaf arrangement can be sketched in the query for better accuracy and efficiency. In the experiment, we compare our proposed method with other methods including Centroid Contour Distance(CCD), Fourier Descriptor, Curvature Scale Space Descriptor(CSSD), Moment Invariants, and MPP. Experimental results on one thousand leaf images show that our approach achieves a better performance than other methods.

• Korean Journal of Oriental Medicine
• /
• v.16 no.1
• /
• pp.93-99
• /
• 2010

When researchers plan R&D projects, they usually use patent map or paper map for the objective decision-making, but in traditional korean medicine field, domestic patents and papers have been mainly proposed as results of many R&D projects, while most of patent or paper map tools support international patents and SCI papers, respectively. Therefore, as an alternative one KIOM constructed the project map which can provide the technology landscape for R&D project information in traditional korean medicine field. But the functions of the system is limited to the search and analysis with chart. So sophisticated analysis results are hard to get from the existing system. This research's goal is to upgrade the web based project map analysis system to provide researcher rich functionality and advanced analysis tools.

• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.311-315
• /
• 1987

In this paper an efficient algorithm to estimate the volume and surface area and the reconstruction algorithm for 3-dimensional graphics are presented. The graph theory is used to estimate the optimal quantitative factors. To improve the computing efficiency, the algorithm to get proper contour points is performed by applying several tolerances. The search and the given arc cost is limited according to the change of curvature of the cross-sectional contour. For mathematical model, these algorithms for volume estimation based on polyhedral approximation are applied to the selected optimal surface. The results show that the values of the volume and surface area for tolerances 1.0005, 1.001 and 1.002 approximate to values for tolerances 1.000 resulting in small errors. The reconstructed three-dimensional images are sparse and consist of larger triangular tiles between two cross sections as tolerance is increasing.

• Fashion & Textile Research Journal
• /
• v.25 no.6
• /
• pp.739-744
• /
• 2023

With the popularization of 5G networks and the development of AI (artificial intelligence) technology, Metaverse, which creates production capacity by combining virtual space and reality, is attracting attention. In this study, we searched for makeup applications with more than 100 million downloads from October 11, 2020 to November 3, 2020 through the Google Play Store. As a result of the search, four applications were found: YouCam Makeup, YouCam Perfect, Beauty Plus, and Sweet Snap. Based on the functions provided by the four applications, we attempted to suggest makeup functions applicable to Zepeto's avatar. Functions for the eyes (eyeliner, eyelashes, mascara, eye shadow, eye shape, eyebrow shape, lenses, double eyelids), functions for the nose (nose shape), functions for the mouth (lipstick, lip shape, smile function) ) Functions corresponding to the facial contour (contour, skin foundation, blusher, shading, highlighter, face painting, theme makeup) and functions corresponding to the body (body adjustment) were proposed. This study is the first in the beauty field to propose a method of applying the functions of the Metaverse platform as the importance of digital platforms is highlighted, and is the first to propose a makeup function applied to the Metaverse so that it can be used as important basic data in the future.