• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.621-624
• /
• 1999

This paper describes a distance estimation method of object's motion in soccer image sequence by tracking field features. And we quantitatively evaluate the estimation accuracy We suppose that the input image sequence is taken with a camera on static axis and includes only zooming and panning transformation between frames. Adaptive template matching is adopted for non-rigid object tracking. For background compensation, feature templates selected from reference frame image are matched in following frames and the matched feature point pairs are used in computing Affine motion parameters. A perspective displacement field model is used for estimating the real distance between two position on Input Image. To quantitatively evaluate the accuracy of the estimation, we synthesized a 3 dimensional virtual stadium with graphic tools and experimented on the synthesized 2 dimensional image sequences. The experiment shows that the average of the error between the actual moving distance and the estimated distance is 1.84%.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.250-278
• /
• 2004

The product rate variation problem, to be called the PRVP, is to sequence different type units that minimizes the maximum value of a deviation function between ideal and actual rates. The PRVP is an important scheduling problem that arises on mixed-model assembly lines. A surge of research has examined very interesting methods for the PRVP. We believe, however, that several issues are still open with respect to this problem. In this study, we consider convex bipartite graphs, perfect matchings, permanents and balanced sequences. The ultimate objective of this study is to show that we can provide a more efficient and in-depth procedure with a graph theoretic approach in order to solve the PRVP. To achieve this goal, we propose formal alternative proofs for some of the results stated in the previous studies, and establish several new results.

• Mycobiology
• /
• v.43 no.4
• /
• pp.408-414
• /
• 2015

Amanita (Agaricales, Basidiomycota) is one of the most well-known genera composed of poisonous mushrooms. This genus of almost 500 species is distributed worldwide. Approximately 240 macrofungi were collected through an ongoing survey of indigenous fungi of Mt. Jeombong in Inje County, Korea in 2014. Among these specimens, 25 were identified as members of Amanita using macroscopic features. Specimens were identified to the species level by microscopic features and molecular sequence analyses of the internal transcribed spacer and large subunit of nuclear ribosomal RNA. We molecularly identified 13 Amanita species, with seven species matching previously recorded species, four species (A. caesareoides, A. griseoturcosa, A. imazekii, and A. sepiacea) new to Korea, and two unknown species.

• Journal of The Korean Astronomical Society
• /
• v.52 no.5
• /
• pp.145-158
• /
• 2019

We conducted a survey of open clusters within 1 kpc from the Sun using the astrometric and photometric data of the Gaia Data Release 2. We found 655 cluster candidates by visual inspection of the stellar distributions in proper motion space and spatial distributions in l - b space. All of the 655 cluster candidates have a well defined main-sequence except for two candidates if we consider that the main sequence of very young clusters is somewhat broad due to differential extinction. Cross-matching of our 653 open clusters with known open clusters in various catalogs resulted in 207 new open clusters. We present the physical properties of the newly discovered open clusters. The majority of the newly discovered open clusters are of young to intermediate age and have less than ~50 member stars.

• ETRI Journal
• /
• v.31 no.4
• /
• pp.463-465
• /
• 2009

In this letter, we present an event stream processing system that can evaluate a pattern query for a data sequence with predicates. We propose a pattern query language and develop a pattern query processing system. In our system, we propose novel techniques for run-time aggregation and negation processing and apply our system to stream data generated from vehicles to monitor unusual driving patterns.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.3
• /
• pp.1-7
• /
• 1992

This paper discusses the self-adaptive equalization technique which has adaptibility to channel characteristics varation without training sequence. The criterion function used in this paper is based on the concept of cumulant matching. This function can be applied to nonminimum phase channel, and we can verify the fact that if the constrained condition is satisfied. this criterion has no local optimum. As the adaption algorithm, the normalized gradient-searching technique is used. Simulations verify the performance of our method in case of 8PAM, 8PSK(CCITT V.27), 16QAM(CCITT V.29) sources and three type nonminimum phase channels.

• Journal of Broadcast Engineering
• /
• v.18 no.3
• /
• pp.349-361
• /
• 2013

This paper proposes a fast face tracking method with only depth information. It is basically a template matching method, but it uses a early termination scheme and a sparse search scheme to reduce the execution time to solve the problem of a template matching method, large execution time. Also a refinement process with the neighboring pixels is incorporated to alleviate the tracking error. The depth change of the face being tracked is compensated by predicting the depth of the face and resizing the template. Also the search area is adjusted on the basis of the resized template. With home-made test sequences, the parameters to be used in face tracking are determined empirically. Then the proposed algorithm and the extracted parameters are applied to the other home-made test sequences and a MPEG multi-view test sequence. The experimental results showed that the average tracking error and the execution time for the home-made sequences by Kinect ($640{\times}480$) were about 3% and 2.45ms, while the MPEG test sequence ($1024{\times}768$) showed about 1% of tracking error and 7.46ms of execution time.

• 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 applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.49-58
• /
• 2009

For $1{\leq}k{\leq}r$, let ${\sigma}$($K_{r,r}$ - ke, n) be the smallest even integer such that every n-term graphic sequence ${\pi}$ = ($d_1$, $d_2$, ..., $d_n$) with term sum ${\sigma}({\pi})$ = $d_1$ + $d_2$ + ${\cdots}$ + $d_n\;{\geq}\;{\sigma}$($K_{r,r}$ - ke, n) has a realization G containing $K_{r,r}$ - ke as a subgraph, where $K_{r,r}$ - ke is the graph obtained from the $r\;{\times}\;r$ complete bipartite graph $K_{r,r}$ by deleting k edges which form a matching. In this paper, we determine ${\sigma}$($K_{r,r}$ - ke, n) for even $r\;({\geq}4)$ and $n{\geq}7r^2+{\frac{1}{2}}r-22$ and for odd r (${\geq}5$) and $n{\geq}7r^2+9r-26$.

• Journal of Korea Multimedia Society
• /
• v.12 no.4
• /
• pp.492-501
• /
• 2009

Information on movement of objects in videos can be used as an important part in categorizing and separating the contents of a scene. This paper is proposing a shape-based movement-matching algorithm to effectively find the movement of an object in video streams. Information on object movement is extracted from the object boundaries from the input video frames becoming expressed in continuous 2D shape information while individual 2D shape information is converted into a lD shape feature using the shape descriptor. Object movement in video can be found as simply as searching for a word in a text without a separate movement segmentation process using the sequence of the shape descriptor listed according to order. The performance comparison results with the MPEG-7 shape variation descriptor showed that the proposed method can effectively express the movement information of the object and can be applied to movement search and analysis applications.