• Journal of the Korea Computer Graphics Society
• /
• v.20 no.1
• /
• pp.1-11
• /
• 2014

Patients with cerebral palsy or arthritis have deformities in lower limb which cause unstable gait or posture and pains. Surgeons perform a deformity correction osteotomy with surgical plan. But sometimes they find the unexpected angular or rotational deformation after surgery. The problems are that there is no method to predict the result of a surgical plan and also there are so many factors to must consider in surgical planning step such as clinical measurements, rotation angle, wedge angle, morphology of lower limb, etc. This paper presents new methods for planning the deformity correction osteotomy efficiently. There are two approaches based on the 3D mesh model and the accurate assessment of the patient's lower limb. One is the manual pre-simulation of surgery using forward kinematics. And the other is the automatic surgical planning using inverse kinematics and nonlinear optimization. Using these methods, we can predict and verify the results of various surgical treatments and also we can find a more effective surgical plan easily compared to conventional methods.

• Korean Journal of Remote Sensing
• /
• v.38 no.6_1
• /
• pp.1257-1271
• /
• 2022

Recently, many Earth observation optical satellites have been developed, as their demands were increasing. Therefore, a rapid preprocessing of satellites became one of the most important problem for an active utilization of satellite images. Satellite image matching is a technique in which two images are transformed and represented in one specific coordinate system. This technique is used for aligning different bands or correcting of relative positions error between two satellite images. In this paper, we propose an automatic image matching method among satellite images with different ground sampling distances (GSDs). Our method is based on improved feature matching and robust estimation of transformation between satellite images. The proposed method consists of five processes: calculation of overlapping area, improved feature detection, feature matching, robust estimation of transformation, and image resampling. For feature detection, we extract overlapping areas and resample them to equalize their GSDs. For feature matching, we used Oriented FAST and rotated BRIEF (ORB) to improve matching performance. We performed image registration experiments with images KOMPSAT-3A and RapidEye. The performance verification of the proposed method was checked in qualitative and quantitative methods. The reprojection errors of image matching were in the range of 1.277 to 1.608 pixels accuracy with respect to the GSD of RapidEye images. Finally, we confirmed the possibility of satellite image matching with heterogeneous GSDs through the proposed method.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.2
• /
• pp.65-76
• /
• 2004

Today, most documents are electronically produced and their paleography is digitalized by imaging, resulting in a tremendous number of electronic documents in the shape of images. Therefore, to process these document images, many methods of document structure analysis and recognition have already been proposed, including font classification. Accordingly, the current paper proposes a font classification method for document images that uses non-negative matrix factorization (NMF), which is able to learn part-based representations of objects. In the proposed method, spatially total features of font images are automatically extracted using NMF, then the appropriateness of the features specifying each font is investigated. The proposed method is expected to improve the performance of optical character recognition (OCR), document indexing, and retrieval systems, when such systems adopt a font classifier as a preprocessor.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.41 no.1
• /
• pp.55-62
• /
• 2004

A semi-automatic registration process of determining specified points is presented, which is required to register brain MR images based on Talairach atlas. Generally, ten specified points that define Talairach coordinates are anterior commissure(AC), posterior commissure (PC), anterior feint (AP), posterior point (PP), superior point (SP), inferior point (IP), left point (LP), right point (RP) and two points for the midline of the brain. The suggested method reduces user interaction for S points, and finds the necessary points for registration in a more stable manner by finding AC and PC using two-level shape matching of the corpus callosum (CC) in an edge-enhanced brain M image. Remaining points are found using the intensity information of cutview.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.1
• /
• pp.71-80
• /
• 2011

Thresholding is important step for detecting binary change/non-change information in the unsupervised change detection. This study proposes new unsupervised change detection method using Hyperion hyperspectral images, which are expected with data increased demand. A graph is drawn with applying the range average method for the result value through pixel-based similarity measurement, and thresholding value is decided at the maximum distance point from a straight line. The proposed method is assessed in comparison with expectation-maximization algorithm, coner method, Otsu's method using synthetic images and Hyperion hyperspectral images. Throughout the results, we validated that the proposed method can be applied simply and had similar or better performance than the other methods.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.15 no.1
• /
• pp.23-41
• /
• 2004

In indexing and organizing Web resources, there have been two basic methods: automatic indexing by extracting key words and library classification schemes or subject directories of search engines. But, both methods have failed to satisfy the user's information needs, due to the lack of standard criteria and the irrationality of its structural system. In this paper I have examined the limits of library classification scheme's structures and the problems related to the nature of Web resources such as specificity and exhaustivity. I have also attempted to explain the logicality of Web resources organization by facet analysis and its strengths and limitations. In so doing, I have proposed three specific methods in using facet analysis: firstly, indexing system by facet analysis; secondly, the alternative transformation of the enumerative classification scheme into facet classification scheme; and finally, the facet model of subject directory of domestic search engine. After examining the three methods, my study concludes that a controlled vocabulary by facet analysis can be employed as a useful method in organizing Web resources.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.567-571
• /
• 2009

Sports game broadcasting system uses multiple video cameras in order to offer exciting and dynamic scenes for the TV audiences. Since, however, the traditional broadcasting system edits the multiple views into a static video stream, it is difficult to provide the intelligent broadcasting service that summarizes or retrieves specific scenes or events based on the user preference. In this paper, we propose the summarization and retrieval system for the soccer videos based on multiple cameras. It extracts the highlights such as shot on goal, crossing, foul, and set piece using dynamic Bayesian network based on soccer players' primitive behaviors annotated on videos, and selects a proper view for each highlight according to its type. The proposed system, therefore, offers users the highlight summarization or preferred view selection, and can provide personalized broadcasting services by considering the user's preference.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.255-262
• /
• 2002

A boundary sequence can be a good representation of arbitrary shapes, because it can represent them simply and precisely. However, boundary sequences have not been used as a representation of arbitrary shapes, because the pixel-based shape-features such as area, centroid, orientation, projection and so forth, could not be computed directly from them. In this paper, we show that the shape-features can be easily computed from the boundary sequences by introducing the cross-sections that are defined as vertical (or horizontal) line segments in a shape. A cross-section generation method is proposed, which generates cross-sections of the shape efficiently by tracing the boundary sequence of the shape once. Furthermore, a boundary sequence extraction method is also proposed, which generates a boundary sequence for each shape in a binary image automatically The proposed methods work well even if a shape has holes. Eventually, we show that a boundary sequence can be used effectively for representing arbitrary shapes.

• The Journal of the Korea Contents Association
• /
• v.14 no.11
• /
• pp.1-6
• /
• 2014

Emotion recognition is defined as that machines automatically recognize human emotions. Because the human emotions is very subjective, it is impossible to measure objectively. Therefore, the goal of emotion recognition is to obtain a measure that is agreed by as many people as possible. Emotion recognition in a image is implemented as the method that matches human emotions to the various features of the image. In the paper, we propose an emotion recognition system using color features of clothing image based on the Kobayashi's image scale. The proposed system stores colors of image scale into a database. And extracted major colors from a input clothing image are compared with those in the database. The proposed system can obtain three emotions maximally. In order to evaluate the system performance 70 observers are tested. The test results shows that recognized emotions of the proposed system are very similar to the observers emotions.

• Journal of Broadcast Engineering
• /
• v.9 no.2
• /
• pp.151-163
• /
• 2004

In this paper, we propose a content-based video indexing and retrieval system using MPEG-7 standard to retrieve and manage videos efficiently. The proposed system consists of video indexing module for a video DB and video retrieval module to allow various query methods on a web environment. Video indexing module stores metadata such as manually typed in keywords, automatically recognized character names, and MPEG-7 visual descriptors extracted by indexing module into a DB in a sever side. A user can access to retrieval module by a web and retrieve desired videos through various query methods like keywords, faces, example and sketch. For this retrieval system, we propose ATC(Adaptive Twin Comparison) as a cut detection method for efficient video indexing and QBME(Query By Modified Example) as an improved content-based query method for the convenience of users. Experimental results show that the proposed ATC method detects cuts well and the proposed QBME method provides the conveniences better than existing query methods such as QBE(Query By Example) and QBS(Query By Sketch).