• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.577-590
• /
• 2003

The shape-based retrieval is defined as the operation that searches for the (sub) sequences whose shapes are similar to that of a query sequence regardless of their actual element values. In this paper, we propose a similarity model suitable for shape-based retrieval and present an indexing method for supporting the similarity model. The proposed similarity model enables to retrieve similar shapes accurately by providing the combination of various shape-preserving transformations such as normalization, moving average, and time warping. Our indexing method stores every distinct subsequence concisely into the disk-based suffix tree for efficient and adaptive query processing. We allow the user to dynamically choose a similarity model suitable for a given application. More specifically, we allow the user to determine the parameter p of the distance function $L_p$ when submitting a query. The result of extensive experiments revealed that our approach not only successfully finds the subsequences whose shapes are similar to a query shape but also significantly outperforms the sequence search.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8A
• /
• pp.679-688
• /
• 2012

In this paper, performance improved hole-filling algorithm including boundary noise removing pre-process which can be used for an arbitrary view synthesis with given two views is proposed. Boundary noise usually occurs because of the boundary mismatch between the reference image and depth map and common-hole is defined as the occluded region. These boundary noise and common-hole created while synthesizing a virtual view result in some defects and they are usually very difficult to be completely recovered by using only given two images as references. The spiral weighted average algorithm gives a clear boundary of each object by using depth information and the gradient searching algorithm is able to preserve details. In this paper, we combine these two algorithms by using a weighting factor ${\alpha}$ to reflect the strong point of each algorithm effectively in the virtual view synthesis process. The experimental results show that the proposed algorithm performs much better than conventional algorithms.

• Smart Media Journal
• /
• v.4 no.1
• /
• pp.9-15
• /
• 2015

Nonverbal communications such as eye gazing, posture, and gestures send forceful messages. In regard to nonverbal communication, eye gazing is one of the most strong forms that an individual can use. However, lack of mutual gazing occurs when we use video conferencing system. The displacement between locations of the eyes and a camera gets in the way of eye contact. The lack of eye gazing can give unapproachable and unpleasant feeling. In this paper, we propose an eye gazing correction for video conferencing. We use two cameras installed at the top and the bottom of the television. The captured two images are rendered with 2D warping at virtual position. We implement view morphing to the detected face, and synthesize the face and the warped image. The result shows that eye gazing is corrected and correctly preserved and the image was synthesized seamlessly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.1093-1103
• /
• 2009

In this paper, we propose a new depth map based distributed multi-view video coding algorithm through an efficient side information generation. A distributed video coding scheme corrects errors between an original image and side information generated at a decoder by using channel coding techniques. Therefore, the more accurate side information is generated, the better performance of distributed video coding scheme is achieved. In the proposed algorithm, a distributed video coding scheme is applied to multi-view video coding based on depth map. Side information is also generated from images of adjacent views through 3D warping by using a depth map and is also combined with MCTI(motion compensated temporal interpolation) which uses images on a temporal axis, and 3D warping. Experimental results show that side information generated by using the proposed algorithm has 0.97dB better average PSNR compared with using MCTI and 3D warping separated. In addition, 8.01% of average bit-rate has been decreased while the same PSNR in R-D curves is kept.

• The KIPS Transactions:PartB
• /
• v.14B no.3 s.113
• /
• pp.191-198
• /
• 2007

In this paper, we present a marker detection and recognition method from camera image for a disabled person to interact with a server system which can control appliance of surrounding environment. It converts the camera image to a binary image by using multi-threshold and extracts contours of objects in the binary image. After that, it approximates the contours to a list of line segments. It finds rectangular markers by using geometrical features which are extracted from the approximated line segments. It normalizes the shape of extracted markers into exact squares by using the warping technique. It extracts feature vectors from marker image by using principal component analysis and then recognizes the marker. The proposed marker recognition system is robust for light change by using multi-threshold. Also, it is robust for angular variation of camera by using warping technique and principal component analysis. Experimental results show that the proposed method achieves 100% recognition rate at maximum for 21 markers and execution speed of 12 frames/sec.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.3
• /
• pp.551-561
• /
• 2014

Since the depth and texture images have been widely used for generating 3-dimensional stereoscopic image, the security of them have been focused. In this paper, we propose a new watermarking technique for copyright of stereo and multiview images which is generated in an arbitrary viewpoint by depth and texture image. After the mark space is selected for preserving watermark through DIBR (depth-image-based rendering) process which uses 3D warping, the texture image is transformed to the frequency coefficient using 2D DCT (discrete cosine transform). Some parts of them are quantized, which is the corresponding process to watermarking. The embedded watermark is not conformed by eyes, so we identified the invisibility of the proposed method. In case of appling attacks of general image process, we also identified the robustness of it.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.381-392
• /
• 2002

This paper deals with the problem of shape-based retrieval in time-series databases. The shape-based retrieval is defined as the operation that searches for the (sub)sequences whose shapes are similar to that of a given query sequence regardless of their actual element values. In this paper, we propose an effective and efficient approach for shape-based retrieval of subsequences. We first introduce a new similarity model for shape-based retrieval that supports various combinations of transformations such as shifting, scaling, moving average, and time warping. For efficient processing of the shape-based retrieval based on the similarity model, we also propose the indexing and query processing methods. To verify the superiority of our approach, we perform extensive experiments with the real-world S&P 500 stock data. The results reveal that our approach successfully finds all the subsequences that have the shapes similar to that of the query sequence, and also achieves significant speedup up to around 66 times compared with the sequential scan method.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.1
• /
• pp.19-26
• /
• 2022

This paper presents a pre-processing method to facilitate the container's BIC-code recognition. We propose a network that can find ROI(Region Of Interests) containing a BIC-code region and estimate a homography matrix for warping. Taking the structure of STN(Spatial Transformer Networks), the proposed network consists of next 3 steps, ROI detection, homography matrix estimation, and warping using the homography estimated in the previous step. It contributes to improving the accuracy of BIC-code recognition by estimating ROI and matrix using the proposed network and correcting perspective distortion of ROI using the estimated matrix. For performance evaluation, five evaluators evaluated the output image as a perfect score of 5 and received an average of 4.25 points, and when visually checked, 224 out of 312 photos are accurately and perfectly corrected, containing ROI.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.7
• /
• pp.25-32
• /
• 2009

In this paper, we propose a new handwriting verification method using pattern analysis in off-line environments. The proposed method first segments character regions in a document and extracts effective features from the segmented regions. It then estimates the similarity between the extracted non-linear features and reference ones by using dynamic time warping and principal component analysis. Our handwriting verification method extracts handwriting features effectively and enables the verification of handwriting with various lengths of features as well as ones of short patterns. The experimental results show that our method outperforms others in terms as accuracy. We expect that the proposed method will automate the manual handwriting verification tasks and provide much objectivity on handwriting identification.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.173-173
• /
• 2021

현재까지 상수도관망 내 수질적 거동에 대한 분석은 (1) 네트워크 수질 모델(EPANET 수질모의 등)에 기반한 방법과 (2) 시공간적 저해상도 데이터에 기반한 데이터 분석법이 주를 이루었다. 그러나 현존 네트워크 수질 모델은 수질 사고의 복잡한 물리·화학적 거동을 상세히 모의하기 어렵다. 반면 계측 및 통신기술의 발달로 고해상도 수질 데이터의 실시간 수집이 가능해지면서 사고의 사전감지, 발생시 즉각적 탐지 및 대응을 위한 데이터 분석법에 관심이 증가하고 있다. 서울 문래동, 인천, 포항의 경우에서도 알 수 있듯이, 수질사고 발생 시 원인물질의 시공간적 이송 또는 전파에 대한 정보는 사고대응에 유용하게 활용된다. 본 연구는, 비정상적인 수질변화의 계통 내 전달 시간을 계산하기 위해 고해상도 수질 스마트 미터 데이터에 기반한 데이터 분석법을 개발하였다. 물공급 하류방향의 수질변화 전달 시간 정량화를 위해 화음탐색법 기반 동적시간워핑(Dynamic time warping; DTW) 기술을 이용하였고, 원데이터의 전처리를 위해 이동평균필터링을 수행하였다. 개발된 분석법은 A시 생산 및 배·급수과정의 감시지점에서 10초 단위로 계측된 다양한 수질변수(pH, 탁도, 잔류염소, 전기전도도, 수온 등)의 공간적 변이 전파시간을 결정하기 위해 적용되었다. 분석에 활용한 데이터는 데이터 통신 및 측정 기기에 의한 이상값과 운영상황의 변화에 따라 변동한 값을 처리하기 이전의 데이터이다. 데이터 품질에 의한 영향을 배제하기 위해 이상값이 발생하지 않은 기간을 파악한 후, 그 기간에 대하여 분석하였다. 계통 내 위계에 따라 두 지점의 측정값의 전파시간을 정량화한 결과, 지점에 따라 전파시간이 다르게 나타났다. 또한, 같은 두 지점에 적용한 결과라도 DTW를 적용하는 기간과 이동평균필터링의 크기에 따라 수질변화 전달 시간이 다르게 나타나는 것을 확인할 수 있었다. 본 연구에서 개발된 분석법은 다변량 수질변수 간의 영향관계를 파악하는데 확장 적용이 가능하다. 또한, 이 방법의 실시간 적용을 통해 동적으로 변화하는 전달시간을 주기적, 공간적으로 갱신하여 관망 수질 변화 모니터링이 가능하다.