• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.1
• /
• pp.8-14
• /
• 2017

Deinterlacing is a method to convert interlaced video, including two fields (even and odd), to progressive video. It can be divided into spatial and temporal methods. The deinterlacing method in the spatial domain can easily be hardware-implemented, but yields image degradation if information about the deinterlaced pixel does not exist in the same field. On the other hand, the method in the temporal domain yields a deinterlaced image with higher quality but uses more memory, and hardware implementation is more difficult. Furthermore, the deinterlacing method in the temporal domain degrades image quality when motion is not estimated properly. The proposed method is for deinterlacing in the spatial domain. It uses several deinterlacing methods according to statistical characteristics in neighboring pixel locations. In this procedure, the proposed method uses the C4.5 algorithm, a typical classification algorithm based on entropy for choosing optimal methods from among the candidates. The simulation results show that the proposed algorithm outperforms previous deinterlacing methods in terms of objective and subjective image quality.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4908-4928
• /
• 2017

Recent research into wireless sensor network (WSN)-related technology that senses various data has recognized the need for spatio-temporal queries for searching necessary data from wireless sensor nodes. Answers to the queries are transmitted from sensor nodes, and for the efficient transmission of the sensed data to the application server, research on index processing methods that increase accuracy while reducing the energy consumption in the node and minimizing query delays has been conducted extensively. Previous research has emphasized the importance of accuracy and energy efficiency of the sensor node's routing process. In this study, we propose an itinerary-based R-tree (IR-tree) to solve the existing problems of spatial query processing methods such as efficient processing and expansion of the query to the spatio-temporal domain.

• Journal of Broadcast Engineering
• /
• v.17 no.1
• /
• pp.191-194
• /
• 2012

The split flag and the skip flag in CU syntax have high correlation on spatial domain as well as temporal domain. This paper suggests a method for enhancing coding efficiency by using not only spatial correlation but also temporal correlation when coding CU information. In the CABAC case, temporal collocated CU information is used for selecting context model of the split flag and the skip flag. In the CAVLC case, current CU information is estimated from temporal collocated CU information then encoded. As a result, a coding efficiency was increased by 0.1%~0.6% in CABAC, 0.1%~0.4% in CAVLC compared with HM 3.0. This method shows better performance on lowdelay condition which uses reference frame close to current frame.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.454-457
• /
• 2005

Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns. And calendar based on temporal association rules proposes the discovery of association rules along with their temporal patterns in terms of calendar schemas, but this approach is also adopt an Apriori-like candidate set generation. In this paper, we propose an efficient temporal frequent pattern mining using TFP-tree (Temporal Frequent Pattern tree). This approach has three advantages: (1) this method separates many partitions by according to maximum size domain and only scans the transaction once for reducing the I/O cost. (2) This method maintains all of transactions using FP-trees. (3) We only have the FP-trees of I-star pattern and other star pattern nodes only link them step by step for efficient mining and the saving memory. Our performance study shows that the TFP-tree is efficient and scalable for mining, and is about an order of magnitude faster than the Apriori algorithm and also faster than calendar based on temporal frequent pattern mining methods.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.726-729
• /
• 2004

Spatiotemporal phenomena are ubiquitous aspects of real world. In the spatial and temporal databases, integrity constraints maintain the semantics of specific application domain and relationship between domains when proceed update in the database. Efficient maintenance of data integrity has become a critical problem, since testing the validity of a large number of constraints in a large database and after each transaction is an expensive task. Especially, in spatiotemporal domain, data is more complex than traditional domains and very active. Additionally, it is not considered that unified frameworks deal with both spatial and temporal properties to handle integrity constraints. Therefore, there need a model to maintain integrity constraints in the unified frameworks and enforcement and management techniques in order to preserve consistence.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.05a
• /
• pp.369-373
• /
• 2005

This paper proposes a variable step size parameter method in frequency domain ICA (FDICA). The FDICA and the temporal analysis (TA) algorithm are experimented for blind source separation (BSS). This paper will compare the separation qualities of these two algorithms in various reverberation environments. Furthermore, it is shown that the proposed technique has the better separation performance than those of two methods especially in recorded data.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.9-12
• /
• 2002

In this Paper, we propose an efficient de-interlacing algorithm using temporal and spatial domain information. In the proposed scheme, motion estimation is performed same parity fields, i.e., if current field is even field, reference fields are previous even field and forward even field. And then motion vector refinement is performed to improve the accuracy of motion vectors. In the interpolating step, we use median filter to reduce the interpolation error caused by incorrect motion vector. Simulations conducted for various video sequences have shown the efficiency of the proposed interpolator with significant improvement over previous methods in terms of both PSNR and perceived image quality.

• International Journal of Computer Science & Network Security
• /
• v.23 no.5
• /
• pp.212-220
• /
• 2023

Ontologies are knowledge containers in which information about a specified domain can be shared and reused. An event happens within a specific time and place and in which some actors engage and show specific action features. The fact is that several ontology models are based on events called Event-Based Models, where the event is an individual entity or concept connected with other entities to describe the underlying ontology because the event can be composed of spatiotemporal extents. However, current event-based ontologies are inadequate to bridge the gap between spatiotemporal extents and participants to describe a specific domain event. This paper reviews, describes, and compares the existing event-based ontologies. The paper compares and contrasts various ways of representing the events and how they have been modelled, constructed, and integrated with the ontologies. The primary criterion for comparison is based on the events' ability to represent spatial and temporal extent and the participants in the event.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.764-767
• /
• 2004

The performance of a speech recognition system is generally degraded in telephone environment because of distortions caused by background noise and various channel characteristics. In this paper, data-driven temporal filters are investigated to improve the performance of a specific recognition task such as telephone speech. Three different temporal filtering methods are presented with recognition results for Korean connected-digit telephone speech. Filter coefficients are derived from the cepstral domain feature vectors using the principal component analysis.

• Journal of information and communication convergence engineering
• /
• v.2 no.1
• /
• pp.26-31
• /
• 2004

In the last few years, The Semantic Web has increased the interest in ontologies. Ontology is an essential component of the semantic web. Ontologies continue to change and evolve. We consider the management of versions in ontology. We study a set of changes based on domain changes, changes in conceptualization, metadata changes, and temporal dimension. In many cases, we want to be able to search in historical versions, query changes in versions, retrieve versions on the temporal dimension. In order to support an ontology query language that supports temporal operations, we consider temporal dimension includes transaction time and valid time. Ontology versioning brings about massive amount of versions to be stored and maintained. We present the storage policies that are storing all the versions, all the sequence of changed element, all the change sets, the aggregation of change sets periodically, and the aggregation of change sets using a criterion. We conduct a set of experiments to compare the performance of each storage policies. We present the experimental results for evaluating the performance of different storage policies from scheme 1 to scheme 5.