• Journal of Digital Contents Society
• /
• v.7 no.1
• /
• pp.67-74
• /
• 2006

In current video-conferencing systems. user's face movements are restricted by fixed camera, therefore it is inconvenient to users. To solve this problem, tracking of face movements is needed. Tracking using whole face needs much computing time and whole face is difficult to define as an one feature. Thus, using several feature points in face is more desirable to track face movements efficiently. This paper addresses an effective eye location algorithm which is essential process of automatic human face tracking system for natural video-conferencing. The location of eye is very important information for face tracking, as eye has most clear and simplest attribute in face. The proposed algorithm is applied to candidate face regions from the face region extraction. It is not sensitive to lighting conditions and has no restriction on face size and face with glasses. The proposed algorithm shows very encouraging results from experiments on video-conferencing environments.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.79-86
• /
• 2008

As the rapid development of the Internet, the embedded images in HTML web pages nowadays become predominant. For its amazing function in describing the content and attracting attention, images become substantially important in web pages. All these images consist a considerable database. What's more, the semantic meanings of images are well presented by the surrounding text and links. But only a small minority of these images have precise assigned keyphrases. and manually assigning keyphrases to existing images is very laborious. Therefore it is highly desirable to automate the keyphrases extraction process. In this paper, we first introduce WWW image annotation methods, based on low level features, page tags, overall word frequency and local word frequency. Then we put forward our method of multi-cues integration image annotation. Also, show multi-cue image annotation method is more superior than other method through an experiment.

• Journal of Digital Contents Society
• /
• v.15 no.6
• /
• pp.675-682
• /
• 2014

Prostate is only an organ of men. To diagnose the disease of the prostate, generally transrectal ultrasound(TRUS) images are used. Detecting its boundary is a challenging and difficult task due to weak prostate boundaries, speckle noise and the short range of gray levels. In this paper a method for automatic prostate segmentation in TRUS images using Support Vector Machine(SVM) is presented. This method involves preprocessing, extracting Gabor feature, training, and prostate segmentation. The speckle reduction for preprocessing step has been achieved by using stick filter and top-hat transform has been implemented for smoothing. Gabor filter bank for extraction of rotation-invariant texture features has been implemented. SVM for training step has been used to get each feature of prostate and nonprostate. Finally, the boundary of prostate is extracted. A number of experiments are conducted to validate this method and results shows that the proposed algorithm extracted the prostate boundary with less than 10% relative to boundary provided manually by doctors.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.169-174
• /
• 2008

Recently, biometric systems are of interest for the reliable security system. Iris recognition technology is one of the biometric system with the highest reliability. Various iris recognition methods have been proposed for automatic personal identification and verification. These methods require accurate iris segmentation for successful processing because the iris is a small part of an acquired image. The iris boundaries have been parametrically modeled and subsequently detected by circles or parabolic arcs. Since the iris boundaries have a wide range of edge contrast and irregular border shapes, the assumption that they can be fit to circles or parabolic arcs is not always valid. In some cases, the shape of a dilated pupil is slightly different from a constricted one. This is especially true when the pupil has an irregular shape. This is why this research is important. This paper addresses how to accurately detect iris boundaries for improved iris recognition, which is robust to noises.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.2
• /
• pp.44-51
• /
• 2009

Text understand in natural images has become an active research field in the past few decades. In this paper, we present an automatic recognition system in Korean signboards with a complex background. The proposed algorithm includes detection, binarization and extraction of text for the recognition of shop names. First, we utilize an elaborate detection algorithm to detect possible text region based on edge histogram of vertical and horizontal direction. And detected text region is segmented by clustering method. Second, the text is divided into individual characters based on connected components whose center of mass lie below the center line, which are recognized by using a minimum distance classifier. A shape-based statistical feature is adopted, which is adequate for Korean character recognition. The system has been implemented in a mobile phone and is demonstrated to show acceptable performance.

• Journal of Bio-Environment Control
• /
• v.20 no.4
• /
• pp.277-282
• /
• 2011

We carried out shape recognition. We found out cucumber's feature shape by means of neural network and back propagation algorithm. We developed an algorithm which finds object position and shape in real image and we gained following conclusion as a result. It was processed for feature shape extraction of cucumber to detect automatic. The output pattern rates of the miss-detected objects was 0.1~4.2% in the output pattern which was recognized as cucumber. We were gained output pattern according to image resolution $445{\times}363$, $501{\times}391$, $450{\times}271$, $297{\times}421$. It was appeared that no change was detected. When learning pattern was increased to 25, miss-detection ratio was 16.02%, and when learning pattern had 2 pattern, it didn't detect 8 cucumber in 40 images.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.203-211
• /
• 2005

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.

• The Journal of Korean Association of Computer Education
• /
• v.12 no.6
• /
• pp.21-32
• /
• 2009

This paper proposes a method to extract a user's intention automatically and implementation of intention map that support a user can appropriate search results using a user' information need accurately. It selects user intention based on searching history obtained from previous users' same queries and extracts user intentions by using clustering algorithm and user intention extraction algorithm, extracted user intentions are represented in an intention map base on a theory of knowledge representation. For the efficiency analysis of intention map, we extracted user intentions using 2,600 search history data which provided by a current domestic commercial search engine. The experimental results using the information intention map search when using general search engines represent more than satisfaction was statistically significant.

• Journal of The Korean Astronomical Society
• /
• v.45 no.6
• /
• pp.167-173
• /
• 2012

Inter-granular Bright Points (igBPs) are small-scale objects in the Solar photosphere which can be seen within dark inter-granular lanes. We present a new algorithm to automatically detect and extract igBPs. Laplacian and Morphological Dilation (LMD) technique is employed by the algorithm. It involves three basic processing steps: (1) obtaining candidate "seed" regions by Laplacian; (2) determining the boundary and size of igBPs by morphological dilation; (3) discarding brighter granules by a probability criterion. For validating our algorithm, we used the observed samples of the Dutch Open Telescope (DOT), collected on April 12, 2007. They contain 180 high-resolution images, and each has a $85{\times}68\;arcsec^2$ field of view (FOV). Two important results are obtained: first, the identified rate of igBPs reaches 95% and is higher than previous results; second, the diameter distribution is $220{\pm}25km$, which is fully consistent with previously published data. We conclude that the presented algorithm can detect and extract igBPs automatically and effectively.

• Annual Conference on Human and Language Technology
• /
• 2002.10e
• /
• pp.277-284
• /
• 2002

본 논문은 신문기사에서 중요한 문장을 추출(Extract)하는데 있어서, 기존에 기장 우수한 방법인 전문기반 방법(Lead-based method)과 제목을 이용한 유사도 측정방법(Title-based method)의 문제점을 해결하기 위해서, 육하원칙 활성화도를 이용하여 신문기사를 효과적으로 요약할 수 있는 방법과 알고리즘을 제안하였다. 본 연구에서는 먼저, 제목(Title)과 전문(Lead)에서 중복출현하지 않는 육하원칙 구성성분을 결합하고, 본문은 각 문장에서 육하원칙 구성성분의 재사용성과 육하원칙 구성성분의 범주 증감을 파악하여 육하원칙 활성화도를 구하고, 전문기반 방법을 응용하여 각 문장의 상대적인 중요도에 따라 최종적인 가중치를 부여함으로써, 신문기사에서 중요한 문장을 효과적으로 추출할 수 있는 가중치 계산식을 제안하였다. 실험문서는 조선일보 웹사이트에서 제공하는 신문기사 100건을 대상으로 하였으며, 요약율이 30%일 경우 제안한 방법의 정확률은 74.7%로 기존의 전문기반(Lead-based method)방법보다 6.7% 향상되었다.