• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.12
• /
• pp.1465-1474
• /
• 1992

This paper describes a new overlapped object recognition method using extended local features. At first, we extract the extended local features consisting of corners, arcs, parallel-lines, and corner-arcs from the images consisting of model objects. Based on the extended local features we construct a knowledge-base. In order to match objects, we also extract the extended local features from the input image, and then check the compatibility between the extracted features and the features in the knowledge-base. From the set of compatible features, we compute geometric transforms. If any geometric transforms are clustered, we generate the hypothesis of the objects as the centers of the clusters, and then verify the hypothesis by a reverse geometric transform. An experiment shows that the proposed method increases the recognition rate and the accuracy as compared with existing methods.

• Proceedings of the Korean Society of Disaster Information Conference
• /
• 2015.11a
• /
• pp.96-99
• /
• 2015

본 논문에서는 중복되지 않는 서로 다른 카메라의 영상을 활용한 동일 객체 판단 및 추적 기술에 대하여 소개한다. 영상분석에서 색상 정보는 가장 기본이 되는 중요한 정보라 할 수 있다. 특히 색상 정보를 이용하는 히스토그램은 일반적으로 추적, 인식 등에 많이 사용되고 있으나 이동 객체나 조도 변화 등에 따라 성능에 차이를 보인다. 이러한 문제점을 해결하고자 본 연구에서는 동일 객체 판단을 위해 대표적으로 사용되는 히스토그램 정합의 두 알고리즘(HSV 공간에서의 Histogram matching 방법과 RGB 공간에서의MCSHR 알고리즘) 결합을 통해 분할 히스토그램은 객체를 3조각으로 나누어 전체와 각각의 히스토그램을 구하며 MCSHR을 RGB공간이 아니 Hue 공간 히스토그램으로 변경하여 유사도를 도출 하였으며 조도 변화에 강인한 모델을 만들기 위해 Controlled equalization기법을 사용하여 원 영상의 히스토그램의 확률과 평활화한 히스토그램의 확률 융합을 시도 하였다. 해당 실험의 비교 결과 기존 HSV공간에서 Histogram matching을 통한 유사도 비교보다 12.9% 향상된 정합율의 결과를 보였다. 또한 영상 정보와 스마트 기기를 통한 인식 방법의 융합을 통해 영상 내에서 동일 객체 판단에 대한 추가 정보 제공에 대해 방법론 적인 부분을 제안 하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.3 s.35
• /
• pp.173-182
• /
• 2005

In this paper, we propose a landmark recognition method which is irrelevant to the camera viewpoint on the navigation for localization. Features in previous research is variable to camera viewpoint, therefore due to the wealth of information, extraction of visual landmarks for positioning is not an easy task. The proposed method in this paper, has the three following stages; first, extraction of features, second, learning and recognition, third, matching. In the feature extraction stage, we set the interest areas of the image. where we extract the corner points. And then, we extract features more accurate and resistant to noise through statistical analysis of a small eigenvalue. In learning and recognition stage, we form robust feature models by testing whether the feature model consisted of five corner points is an invariant feature irrelevant to viewpoint. In the matching stage, we reduce time complexity and find correspondence accurately by matching method using similarity evaluation function and Graham search method. In the experiments, we compare and analyse the proposed method with existing methods by using various indoor images to demonstrate the superiority of the proposed methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11C
• /
• pp.929-939
• /
• 2010

The growth of multimedia technology forces the development of video detection for large database management and illegal copy detection. To meet this demand, this paper proposes a fast video detection method to apply to a large database. The fast video detection algorithm uses spatial features using the gray value distribution from frames and temporal features using the temporal similarity map. We form the video signature using the extracted spatial feature and temporal feature, and carry out a stepwise matching method. The performance was evaluated by accuracy, extraction and matching time, and signature size using the original videos and their modified versions such as brightness change, lossy compression, text/logo overlay. We show empirical parameter selection and the experimental results for the simple matching method using only spatial feature and compare the results with existing algorithms. According to the experimental results, the proposed method has good performance in accuracy, processing time, and signature size. Therefore, the proposed fast detection algorithm is suitable for video detection with the large database.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.5
• /
• pp.892-898
• /
• 2012

Rough classification methods are used to improving the recognition speed in many character recognition problems. In this case, some irreversible result can occur by an error in rough classification. Methods for duplicating each model in several classes are used in order to reduce this risk. But the errors by rough classfication can not be completely ruled out by these methods. In this paper, an recognition method is proposed to increase speed that matches models selectively without any increase in error. This method constructs a model graph using similarity between models. Then a search process begins from a particular point in the model graph. In this process, matching of unnecessary models are reduced that are not similar to the input pattern. In this paper, the proposed method is applied to the recognition problem of handwriting numbers and upper/lower cases of English alphabets. In the experiments, the proposed method was compared with the basic method that matches all models with input pattern. As a result, the same recognition rate, which has shown as the basic method, was obtained by controlling the out-degree of the model graph and the number of maintaining candidates during the search process thereby being increased the recognition speed to 2.45 times.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.269-277
• /
• 2006

We propose a new expert system for recovering the broken fragments of relics into an original form using computer graphics and image processing. This paper presents a system with an application to tombstones objects of flat plane with letters carved in for assembling the fragments by placing their respective fragments in the right position. The matching process contains three sub-processes: aligning the front and letters of an object, identifying the matching directions, and determining the detailed matching positions. We apply least squares fitting, vector inner product, and geometric and RGB errors to the matching process. It turned out that 2-D translations via fragments-alignment enable us to save the computational load significantly. Based on experimental results from the damaged cultural fragments, the performance of the proposed method is illustrated.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06b
• /
• pp.345-347
• /
• 2012

본 논문에서는 4-조각 전립선 병리조직 영상을 기하 보정 및 강체 정합하여 자동 스티칭하는 방법을 제안한다. 4-조각 병리영상에 대하여 총 3번의 스티칭을 수행하는데, 좌, 우 조각영상의 상, 하 영상 간 스티칭을 각각 수행 한 후 좌, 우 조각 영상 간 스티칭을 수행한다. 강체 정합 전 병리 조각의 코너를 이용해 x-축, y-축 방향의 위치보정과 회전보정을 수행하는 기하보정 단계를 거침으로서 지역적 최적해로의 수렴을 방지하며, 강체 정합의 정확성을 높인다. 병리영상은 전체적으로 밝기값이 유사하므로 밝기값이 아닌 외곽선 정보를 이용하여 조각 영상간의 거리를 최소화시켜 강체 정합한다. 실험 결과, 4-조각 전립선 병리조직 영상이 지역적 최적해에 수렴하지 않고, 조각 영상 간 거리를 최소화 하며, 하나로 스티칭 됨을 확인할 수 있었다. 제안 방법의 총 수행 시간은 평균 10.32초로 측정되었다. 본 논문의 제안 방법은 4조각으로 나뉜 전립선 병리조직 영상을 하나로 스티칭 함으로서 해당 조직의 전체 구조 파악 및 조직 내에서의 암의 위치 파악에 사용 될 수 있으며 이를 통한 전립선암의 확진에도 사용 될 수 있다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.117-128
• /
• 2001

In order to achieve optimal retrieval, i.e., to find the best match to a query according to a certain similarity measure, the exhaustive search should be performed literally for all the images in a database. However, the straightforward exhaustive search algorithm is computationally expensive in large image databases. To reduce its heavy computational cost, this paper presents a fast exhaustive multi-resolution search algorithm based on image database clustering. Firstly, the proposed algorithm partitions the whole image data set into a pre-defined number of clusters having similar feature contents. Next, for a given query, it checks the lower bound of distances in each cluster, eliminating disqualified clusters. Then, it only examines the candidates in the remaining clusters. To alleviate unnecessary feature matching operations in the search procedure, the distance inequality property is employed based on a multi-resolution data structure. The proposed algorithm realizes a fast exhaustive multi-resolution search for either the best match or multiple best matches to the query. Using luminance histograms as a feature, we prove that the proposed algorithm guarantees optimal retrieval with high searching speed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.12 no.1
• /
• pp.19-26
• /
• 1987

The broadband microwave amplifier in the 3~4GHz frequency range has been designed by using potentially unstable GaAs FET. Input matching network is designed by 14dB available power gain circles which are in the stable region. In order to obtain maximu, transducer power gain, output matching network which is in the stable region can be designed using Fano's bandpass matching network. The measured values of transducer power gain, $S_11$and $S_22$ show close agreements with the theoretical valuse.

• Smart Media Journal
• /
• v.3 no.3
• /
• pp.15-19
• /
• 2014

Fingerprint Recognition System is made up of Off-line treatment and On-line treatment; the one is registering all the information of there trier features which are retrieved in the digitalized fingerprint getting out of the analog fingerprint through the fingerprint acquisition device and the other is the treatment making the decision whether the users are approved to be accessed to the system or not with matching them with the fingerprint features which are retrieved and database from the input fingerprint when the users are approaching the system to use. In this paper, Among various biometrics recognition systems, statistical fingerprint recognition matching methods are considered using minutiae on fingerprints. We define similarity distance measures based on the coordinate and angle of the minutiae, and suggest a fingerprint recognition model following statistical distributions.