• Journal of Korea Game Society
• /
• v.17 no.4
• /
• pp.17-24
• /
• 2017

This paper describes the general process of making augmented reality game for real objects without markers. In this paper, point cloud data created by using slam technology is edited using a separate editing tool to optimize performance in mobile environment. Also, in the game execution stage, a lot of load is generated due to the extraction of feature points and the matching of descriptors. In order to reduce this, optical flow is used to track the matched feature points in the previous input image.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.699-702
• /
• 2015

다중의 영상을 이용하여 하나의 파노라마 영상을 제작하는 기법은 컴퓨터 비전, 컴퓨터 그래픽스 등과 같은 여러 분야에서 널리 연구되고 있다. 파노라마 영상은 하나의 카메라에서 얻을 수 있는 영상의 한계, 즉 예를 들어 화각, 화질, 정보량 등의 한계를 극복할 수 있는 좋은 방법으로서 가상현실, 로봇비전 등과 같이 광각의 영상이 요구되는 다양한 분야에서 응용될 수 있다. 파노라마 영상은 단일 영상과 비교하여 보다 큰 몰입감을 제공한다는 점에서 큰 의미를 갖는다. 현재 다양한 파노라마 영상 제작 기법들이 존재하지만, 대부분의 기법들이 공통적으로 파노라마 영상을 구성할 때 각 영상에 존재하는 특징점 및 대응점을 검출하는 방식을 사용하고 있다. 본 논문에서 사용한 SURF(Speeded Up Robust Features) 알고리즘은 영상의 특징점을 검출할 때 영상의 흑백정보와 지역 공간 정보를 활용하는데, 영상의 크기 변화와 시점 검출에 강하며 SIFT(Scale Invariant Features Transform) 알고리즘에 비해 속도가 빠르다는 장점이 있어서 널리 사용되고 있다. 본 논문에서는 두 영상 사이 또는 하나의 영상과 여러 영상 사이에 대응되는 매칭을 계산하여 파노라마영상을 생성하는 처리 방법을 구현하고 기술하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.11a
• /
• pp.49-52
• /
• 2014

본 논문에서는 비문(鼻紋)을 이용한 개의 개체인식 시스템을 제안하고자 한다. 기존의 비문을 기반으로 한신원 확인 시스템에서는 종이에 비문을 찍어내어 일반화(generalization)된 데이터를 만드는 과정을 거치거나, 기계학습을 위해 한 개체에 대한 여러 장의 사진을 요구하는 문제점을 가지고 있다. 본 논문에서는 한 개체에 대한 두 장의 사진과 SURF(Speeded-Up Robust Features) 알고리듬을 이용한 특징점 추출(feature detection), FREAK(Fast Retina Keypoint) 특징 기술자(feature descriptor)를 사용한 개체인식 시스템을 제안한다. 비문 이미지에는 개 코의 특성상 반사로 인한 다수의 노이즈가 생기게 되는데 이를 극복하기 위한 전처리 과정이 제안 알고리듬에 포함되어 있다. 실험결과 두 장의 사진으로도 비문 기반의 개체인식을 할 수 있다는 것을 알 수 있다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.6
• /
• pp.1214-1218
• /
• 2006

This paper presents method to speed up processing time in construction of panoramic images. The method based on invariant feature uses image down-scaling and image edge information. Reducing image size and applying feature descriptor to image portions superimposed with edge causes to reduce the number of features and to improve processing speed. In the experiments, it was shown that the proposed method was 3.26$\sim$13.87% shorter in processing time than the exiting method fer 24-bit color images of 640$\times$480 size.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06c
• /
• pp.496-500
• /
• 2010

본 논문에서는 SIFT(Scale Invariant Feature Transform) 기술자를 이용하여 오프라인 필기체 문자 인식을 위한 특징 추출방법을 제안한다. 제안하는 방법은 문자의 획의 방향 정보를 제공하는 특징 벡터를 추출함으로써 오프라인 문자 인식에서 성능 향상을 기대할 수 있다. 테스트를 위해 MNIST 필기체 데이터베이스와 UJI Penchar2 필기체 데이터베이스를 이용하였고, BP(backpropagation)신경망과 LDA(Linear Discriminant Analysis), SVM(Support Vector Machine) 분류기에서 성능 테스트를 하였다. 본 논문의 실험결과에서는 일반적으로 사용되는 특징추출로부터 얻어진 특징에 제안된 특징추출을 정합하여 성능항샹을 보인다.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.6 no.6
• /
• pp.345-359
• /
• 2011

In high performance embedded systems, the use of multiple on-chip memories is an essential architectural feature for exploiting inherent parallelism in multimedia applications. This feature allows multiple data accesses to be executed in parallel. However, it remains difficult to effectively exploit of multiple on-chip memories. The successful use of this architecture strongly depends on how to efficiently detect and exploit memory parallelism in target applications. In this paper, we propose a technique based on a linear array access descriptor [1], which is generated from profiled data, to detect and exploit memory parallelism. The proposed technique tackles an array reorganization problem to maximize memory parallelism in multimedia applications. We present preliminary experiments applying the proposed technique onto a representative coarse grained reconfigurable array processor (CGRA) with multimedia kernel codes. Our experimental results demonstrate that our technique optimizes data placement by putting independent data on separate storage. The results exhibit 9.8% higher performance on average compared to the existing method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.549-550
• /
• 2019

In this paper, we propose a method to detect the scene change using deep learning. To extract feature points, we use a deep neural network and express extracted feature points as 128 dimensional vectors using SIFT descriptor. If it is less than 25%, it is determined that the scene is changed.

• Journal of Korea Multimedia Society
• /
• v.25 no.1
• /
• pp.52-60
• /
• 2022

Few-shot learning is a sub-area of machine learning problems, which aims to classify target images that only contain a few labeled samples for training. As a representative few-shot learning method, the Prototypical network has been received much attention due to its simplicity and promising results. However, the Prototypical network uses the sample mean of samples from the same class as the prototypes of that class, which easily results in learning uncharacteristic features in the low-data scenery. In this study, we propose to use local descriptors (i.e., patches along the channel within feature maps) from the same class to explicitly obtain more representative prototypes for Prototypical Network so that significant intra-class feature information can be maintained and thus improving the classification performance on few-shot learning tasks. Experimental results on various benchmark datasets including mini-ImageNet, CUB-200-2011, and tiered-ImageNet show that the proposed method can learn more discriminative intra-class features by the local descriptors and obtain more generic prototype representations under the few-shot setting.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1748-1759
• /
• 2018

Weber Local Descriptor (WLD) is a stable and effective feature extraction algorithm, which is based on Weber's Law. It calculates the differential excitation information and direction information, and then integrates them to get the feature information of the image. However, WLD only considers the center pixel and its contrast with its surrounding pixels when calculating the differential excitation information. As a result, the illumination variation is relatively sensitive, and the selection of the neighbor area is rather small. This may make the whole information is divided into small pieces, thus, it is difficult to be recognized. In order to overcome this problem, this paper proposes Weber Symmetrical Local Graph Structure (WSLGS), which constructs the graph structure based on the $5{\times}5$ neighborhood. Then the information obtained is regarded as the differential excitation information. Finally, we demonstrate the effectiveness of our proposed method on the database of ORL, JAFFE and our own built database, high-definition infrared faces. The experimental results show that WSLGS provides higher recognition rate and shorter image processing time compared with traditional algorithms.

• The KIPS Transactions:PartB
• /
• v.16B no.4
• /
• pp.281-288
• /
• 2009

This paper proposes a novel algorithm for the efficient classification and annotation of medical images, especially X-ray images. Since X-ray images have a bright foreground against a dark background, we need to extract the different visual descriptors compare with general nature images. In this paper, a Color Structure Descriptor (CSD) based on Harris Corner Detector is only extracted from salient points, and an Edge Histogram Descriptor (EHD) used for a textual feature of image. These two feature vectors are then applied to a multi-class Support Vector Machine (SVM), respectively, to classify images into one of 20 categories. Finally, an image has the Annotation Code Array based on the pre-defined hierarchical relations of categories and priority code order, which is given the several optimal keywords by the Annotation Code Array. Our experiments show that our annotation results have better annotation performance when compared to other method.