• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.167-179
• /
• 2001

This paper discusses an index-based subsequence matching that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. In earlier work, we suggested an efficient method for whole matching under time warping. This method constructs a multidimensional index on a set of feature vectors, which are invariant to time warping, from data sequences. For filtering at feature space, it also applies a lower-bound function, which consistently underestimates the time warping distance as well as satisfies the triangular inequality. In this paper, we incorporate the prefix-querying approach based on sliding windows into the earlier approach. For indexing, we extract a feature vector from every subsequence inside a sliding window and construct a multi-dimensional index using a feature vector as indexing attributes. For query precessing, we perform a series of index searches using the feature vectors of qualifying query prefixes. Our approach provides effective and scalable subsequence matching even with a large volume of a database. We also prove that our approach does not incur false dismissal. To verily the superiority of our method, we perform extensive experiments. The results reseal that our method achieves significant speedup with real-world S&P 500 stock data and with very large synthetic data.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.07a
• /
• pp.457-459
• /
• 2015

본 논문에서는 원의 호 곡선에 따라 배치된 다중 RGB 카메라 영상으로 생성한 깊이 지도를 정렬하는 방법을 제안한다. 원의 호 곡선에 따라 배치된 카메라는 각 카메라의 광축이 한 점으로 만나서 수렴하는 형태가 이상적이다. 그러나 카메라 파라미터를 살펴보면 광축이 서로 수렴하지 않는다. 또한 카메라 파라미터는 오차가 존재하고 내부 파라미터도 서로 다르기 때문에 각 카메라 영상들은 수평과 수직 오차가 발생한다. 이와 같은 문제점을 해결하기 위해 첫 번째로 광축이 한 점으로 수렴하기 위해서 카메라 외부 파라미터를 보정하여 깊이 영상 정렬을 하였다. 두 번째로 내부 파라미터를 수정하여 각 깊이 영상들의 수평과 수직 오차를 감소시켰다. 일반적으로 정렬된 깊이 지도를 얻기 위해서는 초기 RGB 카메라 영상으로 정렬을 수행하고 그 결과 영상으로 깊이 영상을 생성한다. 하지만 RGB 영상으로 카메라의 회전과 위치를 보정하여 정렬하면 카메라 위치 변화에 따른 깊이 지도 변화값 적용이 복잡해 진다. 즉 정렬 계산 과정에서 소수점 단위 값이 사라지기에 최종 깊이 지도의 값에 영향을 미친다. 그래서 RGB 영상으로 깊이 지도를 생성하고 그것을 처음 RGB 카메라 파라미터로 워핑(warping)하였다. 그리고 워핑된 깊이 지도 값을 가지고 정렬을 수행하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2020.11a
• /
• pp.205-207
• /
• 2020

This paper proposes a novel deep learning-based method to upsample a depth map. Most conventional methods estimate high-resolution depth map by modifying pixel value of given depth map using high-resolution color image and low-resolution depth map. However, these methods cause under- or over-shooting problems that restrict performance improvement. To overcome these problems, the proposed method iteratively performs grid warping scheme which shifts pixel values to restore blurred image for estimating high-resolution depth map. Experimental results show that the proposed method improves both quantitative and visual quality compared to the existing method.

• Journal of Broadcast Engineering
• /
• v.18 no.6
• /
• pp.859-871
• /
• 2013

In this paper, we propose an algorithm that generates multi-view images by grid-mesh based image domain warping using occlusion mask and various image features obtained from the stereoscopic images. In the proposed algorithm, we first extract image saliency map, line segments and disparity saliency map from stereo images and then get them through a process that improves the quality of extracted features. This process is accomplished in two steps. In the first step, reliability of disparity saliency map on object boundary regions is enhanced by using occlusion information. And in the second step, we enhance the quality of image features in terms of temporal consistency by using temporal consistency information for stereo images. With these enhanced features, multi-view images are generated by grid-mesh based image domain warping technique. Experimental results show that the proposed algorithm performs better than existing algorithms in terms of visual quality.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.2
• /
• pp.35-44
• /
• 2012

Most recent infrared (IR) sensors have a focal-plane array (FPA) structure. Spatial non-uniformity of a FPA structure, however, introduces unwanted fixed pattern noise (FPN) to images. This non-uniformity correction (NUC) of a FPA can be categorized into target-based and scene-based approaches. In a target-based approach, FPN can be separated by using a uniform target such as a black body. Since the detector response randomly drifts along the time axis, however, several scene-based algorithms on the basis of a video sequence have been proposed. Among those algorithms, the state-of-the-art one based on Kalman filter uses one-directional warping for motion compensation and only compensates for offset non-uniformity of IR camera detectors. The system model using one-directional warping cannot correct the boundary region where a new scene is being introduced in the next video frame. Furthermore, offset-only correction approaches may not completely remove the FPN in images if it is considerably affected by gain non-uniformity. Therefore, for FPN reduction in IR videos, we propose a joint correction algorithm of gain and offset based on bi-directional warping. Experiment results using simulated and real IR videos show that the proposed scheme can provide better performance compared with the state-of-the art in FPN reduction.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.9
• /
• pp.363-372
• /
• 2019

A sequence refers to data in which the order exists on the two items, and purchase transaction data in which the products purchased by one customer are listed is one of the representative sequence data. In general, all goods have a product taxonomy, such as category/ sub-category/ sub-sub category, and if they are similar to each other, they are classified into the same category according to their characteristics. Therefore, in this paper, we not only consider the purchase order of products to compare two purchase transaction sequences, but also calculate their similarity by giving a higher score if they are in the same category in spite of their difference. Especially, in order to choose the best similarity measure that directly affects the calculation performance of the purchase transaction sequences, we have compared the performance of three representative similarity measures, the Levenshtein distance, dynamic time warping distance, and the Needleman-Wunsch similarity. We have extended the existing methods to take into account the product taxonomy. For conventional similarity measures, the comparison of goods in two sequences is calculated by simply assigning a value of 0 or 1 according to whether or not the product is matched. However, the proposed method is subdivided to have a value between 0 and 1 using the product taxonomy tree to give a different degree of relevance between the two products, even if they are different products. Through experiments, we have confirmed that the proposed method was measured the similarity more accurately than the previous method. Furthermore, we have confirmed that dynamic time warping distance was the most suitable measure because it considered the degree of association of the product in the sequence and showed good performance for two sequences with different lengths.

• Journal of Broadcast Engineering
• /
• v.24 no.5
• /
• pp.713-725
• /
• 2019

Automatic License Plate Recognition (ALPR) is a technology required for many applications such as Intelligent Transportation Systems and Video Surveillance Systems. Most of the studies have studied were about the detection and recognition of license plates on cars, and there is very little about detecting and recognizing license plates on motorbikes. In the case of a car, the license plate is located at the front or rear center of the vehicle and is a straight or slightly sloped license plate. Also, the background of the license plate is mainly monochromatic, and license plate detection and recognition process is less complicated. However since the motorbike is parked by using a kickstand, it is inclined at various angles when parked, so the process of recognizing characters on the motorbike license plate is more complicated. In this paper, we have developed a 2-stage YOLOv2 algorithm to detect the area of a license plate after detection of a motorbike area in order to improve the recognition accuracy of license plate for motorbike data set parked at various angles. In order to increase the detection rate, the size and number of the anchor boxes were adjusted according to the characteristics of the motorbike and license plate. Image warping algorithms were applied after detecting tilted license plates. As a result of simulating the license plate character recognition process, the proposed method had the recognition rate of license plate of 80.23% compared to the recognition rate of the conventional method(YOLOv2 without image warping) of 47.74%. Therefore, the proposed method can increase the recognition of tilted motorbike license plate character by using the adjustment of anchor boxes and the image warping which fit the motorbike license plate.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04c
• /
• pp.205-207
• /
• 2003

본 논문에서는 카메라 렌즈에서 흔히 발견할 수 있는 렌즈계 왜곡에 의한 영상 품질 저하 현상을 소개하고 이를 보정하는 방법을 제시한다. 렌즈계 왜곡은 크게 두 가지로 나눌 수 있는데 기하학적 왜곡과 광도 왜곡이 그것이다. 이상적인 렌즈계가 아닌 경우 이러한 왜곡 현상은 필연적으로 발생을 하게 되는데 왜곡 보정을 위해서 기존의 카메라 캘리브레이션과는 다른 방식의 접근이 필요하게 된다. 본 논문에서는 기하학적 왜곡 보정을 위한 이미지 워핑 방법을 제시하며 아울러 광도 왜곡 보정을 위한 보정 방법을 다루고자 한다.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2017.11a
• /
• pp.88-90
• /
• 2017

현재 한국해양과학기술원에서는 선박비행체 탑재용 복합센서를 개발 및 시험 적용 중에 있다. 그러나 얻어진 영상 데이터를 통해서는 목표물에 대한 정확한 위치 정보를 파악할 수 없다. 또한 크기가 큰 물체도 거리가 멀면 영상에선 작아 보이기 때문에 목표물의 크기 또한 파악하기 힘들다. 이를 보완하기 위해 본 연구에서는 복합센서를 통해 획득한 영상에 대해 warping 및 기하보정, 선박 및 익수자 자동 탐지 알고리듬, 위치 및 계수 정보 산출에 대해 소개한다. 또한 실제 실험을 통해 해당 알고리듬을 검증하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.178-180
• /
• 2001

모양 기반 검색은 주어진 질의 시퀸스의 요소 값에 상관없이, 모양이 유사한 시퀸스 혹은 부분시퀸스를 찾는 연산이다. 본 논문에서는 시프트, 스케일링, 타임 워핑 등 동일 모양 변환의 다양한 조합을 지원할 수 있는 새로운 모양 기반유사 검색 모델을 제안하고, 효과적인 유사 부분 시퀸스 검색을 위한 인덱싱과 질의 처리 방법을 제안한다. 또한 실세계의 증권데이터를 이용한 다양한 실험 결과에 의하여, 본 방식이 질의 시퀸스와 유사한 모양의 모든 서브시퀸스를 성공적으로 찾는 것은 물론 순차검색 방법과 비교하여 매우 빠른 검색 효율을 가짐을 보인다.