• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.493-496
• /
• 2009

Many AR (Augmented Reality) applications have been interested in a marker-less tracking since the tracking methods give camera poses without attaching explicit markers. In this paper, we propose a new marker-less page recognition and tracking algorithm for an AR book application such as DigilogBook. The proposed method only requires orthogonal images of pages, which need not to be trained for a long time, and the algorithm works in real-time. The page recognition is done in two steps by using SIFT (Scale Invariant Feature Transform) descriptors and the comparison evaluation function. And also, the method provides real-time tracking with 25fps ~ 30fps by separating the page recognition and the frame-to-frame matching into two multi-cores. The proposed algorithm will be extended to various AR applications that require multiple objects tracking.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.92-103
• /
• 2010

In this paper, a method for the recognition of dynamic hand gestures in various backgrounds using Dynamic Space Time Warping(DSTW) algorithm is proposed. The existing method using DSTW algorithm compares multiple candidate hand regions detected from every frame of the query sequence with the model sequences in terms of the time. However the existing method can not exactly recognize the models because a false path can be generated from the candidates including not-hand regions such as background, elbow, and so on. In order to solve this problem, in this paper, we use the invariant moments extracted from the candidate regions of hand and compare the similarity of invariant moments among candidate regions. The similarity is utilized as a weight and the corresponding value is applied to the matching cost between the model sequence and the query sequence. Experimental results have shown that the proposed method can recognize the dynamic hand gestures in the various backgrounds. Moreover, the recognition rate has been improved by 13%, compared with the existing method.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.41-51
• /
• 2010

In the research for driver assistance systems, traffic sign information to the driver must be a very important information. Therefore, the detection system of traffic signs located on the road should be able to handel real-time. To detect the traffic signs, color and shape of traffic signs is to use the information after images obtained using the CCD camera. In the road environment, however, using color information to detect traffic sings will cause many problems due to changes of weather and environmental factors. In this paper, to solve it, the candidate traffic sign regions are detected from road images obtained in a variety of the illumination changes using the HSI eign-color model. And then, using the invariant moment-based SVM classifier to detect traffic signs are proposed. Experimental results show that, traffic sign detection rate is 91%, and the processing time per frame is 0.38sec. Proposed method is useful for real-time intelligent traffic guidance systems can be applied.

• The Korean Journal of Applied Statistics
• /
• v.34 no.5
• /
• pp.837-848
• /
• 2021

Evaluating or predicting the effectiveness of economic policies is an important issue, but it is difficult to find an economic variable which causes a significant result because there are numerous variables that cannot be taken into account. A randomized controlled experiment is the best way to investigate causality, but it is not realistically possible to control through randomization and intervention in time series data such as macroeconomic data. Although some analysis methods have been proposed to find causality, the methods such as Granger causality method and Chow test are insufficient to explain causality. Recently, Pfister et al. (2019) proposed invariant causal prediction methods which can be applicable in time series data. In this paper, we introduce the method of Pfister et al. (2019) and use the method to find macroeconomic variables invariantly affecting the won-dollar exchange rate.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1175-1178
• /
• 1998

we propose the Walsh-Hadamard Transform adaptive filter with time-varying step size. The performance of the proposed algorithm is evealuated in system identification where computer simulations are performed for both time-invariant and time-varying system. It is shown that the proposed algorithm produces good results compared with similar algorithms under different conditions, particularly in case of time-varying circumstance.

• Proceedings of the IEEK Conference
• /
• 2001.06e
• /
• pp.29-32
• /
• 2001

This paper presents matrix inequality conditions for H$_2$optimal control of linear time-invariant descriptor systems in continuous and discrete time cases, respectively. First, the necessary and sufficient condition for H$_2$control and H$_2$controller design method are expressed in terms of LMls(linear matrix inequalities) with no equality constraints in continuous time case. Next, the sufficient condition for H$_2$control and H$_2$controller design method are proposed by matrix inequality approach in discrete time case. A numerical example is given in each case.

• The KIPS Transactions:PartD
• /
• v.18D no.1
• /
• pp.9-22
• /
• 2011

In this paper we present an efficient solution to rotation?invariant boundary image matching. Computing the rotation-invariant distance between image time-series is a time-consuming process since it requires a lot of Euclidean distance computations for all possible rotations. In this paper we propose a novel solution that significantly reduces the number of distance computations using the envelope-based lower bound. To this end, we first present how to construct a single envelope from a query sequence and how to obtain a lower bound of the rotation-invariant distance using the envelope. We then show that the single envelope-based lower bound can reduce a number of distance computations. This approach, however, may cause bad performance since it may incur a larger lower bound by considering all possible rotated sequences in a single envelope. To solve this problem, we present a concept of rotation interval, and using the rotation interval we generalize the envelope-based lower bound by exploiting multiple envelopes rather than a single envelope. We also propose equi-width and envelope minimization divisions as the method of determining rotation intervals in the multiple envelope approach. Experimental results show that our envelope-based solutions outperform existing solutions by one or two orders of magnitude.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.12
• /
• pp.2865-2870
• /
• 2015

Recently, due to the hardware computing enhancement such as quantum computers, the amount of information that can be processed in a short period of time is growing exponentially. The cryptography system proposed by Koblitz and Fellows has a problem that it can not be guaranteed that the problem finding perfect dominating set is NP-complete in specific 3-regular graphs because the number of invariant polynomial can not be generated enough. In this paper, we propose an enhanced method to improve the vulnerability in 3-regular graph by generating plenty of invariant polynomials.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.2075-2092
• /
• 2017

Person re-identification is to match pedestrians observed from non-overlapping camera views. It has important applications in video surveillance such as person retrieval, person tracking, and activity analysis. However, it is a very challenging problem due to illumination, pose and viewpoint variations between non-overlapping camera views. In this work, we propose a viewpoint invariant method for matching pedestrian images using orientation of pedestrian. First, the proposed method divides a pedestrian image into patches and assigns angle to a patch using the orientation of the pedestrian under the assumption that a person body has the cylindrical shape. The difference between angles are then used to compute the similarity between patches. We applied the proposed method to real-time global multi-object tracking across multiple disjoint cameras with non-overlapping field of views. Re-identification algorithm makes global trajectories by connecting local trajectories obtained by different local trackers. The effectiveness of the viewpoint invariant method for person re-identification was validated on the VIPeR dataset. In addition, we demonstrated the effectiveness of the proposed approach for the inter-camera multiple object tracking on the MCT dataset with ground truth data for local tracking.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.6
• /
• pp.97-101
• /
• 1989

Scale and rotation invariant polar-logarithmic coordinate transformation is used to achieve deformation invariant pattern recognition. The coordinate transformation is produce by a computer generated hologram (CGH). The mask fabricated by a photo (UV light) pattern generator for the 1nr-$theta$ coordinate transformation is made of the CGH whose transmission function is derived by the use of Lee's method. The optically produced coordinate transformed function is derived by the use of Lee's method. The optically produced coordinate transmission input pattern is interfaced on real-time holography. Variations of autocorrelation for scaled and rotated input patterns are suggested experimentally using implemented optical correlator.