• Title/Summary/Keyword: Temporal processing

Search Result 741, Processing Time 0.024 seconds

Applying Lexical Semantics to Automatic Extraction of Temporal Expressions in Uyghur

  • Murat, Alim;Yusup, Azharjan;Iskandar, Zulkar;Yusup, Azragul;Abaydulla, Yusup
    • Journal of Information Processing Systems
    • /
    • v.14 no.4
    • /
    • pp.824-836
    • /
    • 2018
  • The automatic extraction of temporal information from written texts is a key component of question answering and summarization systems and its efficacy in those systems is very decisive if a temporal expression (TE) is successfully extracted. In this paper, three different approaches for TE extraction in Uyghur are developed and analyzed. A novel approach which uses lexical semantics as an additional information is also presented to extend classical approaches which are mainly based on morphology and syntax. We used a manually annotated news dataset labeled with TIMEX3 tags and generated three models with different feature combinations. The experimental results show that the best run achieved 0.87 for Precision, 0.89 for Recall, and 0.88 for F1-Measure in Uyghur TE extraction. From the analysis of the results, we concluded that the application of semantic knowledge resolves ambiguity problem at shallower language analysis and significantly aids the development of more efficient Uyghur TE extraction system.

A Simplified Pre-processing Method for Efficient Video Noise Reduction (효과적인 영상 잡음 제거를 위한 간략한 전처리 방법)

  • 박운기;이상희;전병우
    • Journal of Broadcast Engineering
    • /
    • v.6 no.2
    • /
    • pp.139-147
    • /
    • 2001
  • Since various noises degrade not only image quality but also compression efficiency in MPEG and H.263, pre-processing is necessary to reduce spatial and temporal noise and to increase ceding efficiency as well. In this paper, we propose a simplified method for noise detection, spatial and temporal noise reduction. Noise detection is based on correlation of the current pixel with its neighboring 4 pixels. Spatial noose reduction utilizes a non-rectangular median filter that is less complex than the conventional rectangular median filter. The proposed temporal filter is an IIR average filter using LUT(Look-up Table) to enhance subjective video quality. The proposed pre-processing method is very simple and efficient.

  • PDF

Joint Spatial-Temporal Quality Improvement Scheme for H.264 Low Bit Rate Video Coding via Adaptive Frameskip

  • Cui, Ziguan;Gan, Zongliang;Zhu, Xiuchang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.1
    • /
    • pp.426-445
    • /
    • 2012
  • Conventional rate control (RC) schemes for H.264 video coding usually regulate output bit rate to match channel bandwidth by adjusting quantization parameter (QP) at fixed full frame rate, and the passive frame skipping to avoid buffer overflow usually occurs when scene changes or high motions exist in video sequences especially at low bit rate, which degrades spatial-temporal quality and causes jerky effect. In this paper, an active content adaptive frame skipping scheme is proposed instead of passive methods, which skips subjectively trivial frames by structural similarity (SSIM) measurement between the original frame and the interpolated frame via motion vector (MV) copy scheme. The saved bits from skipped frames are allocated to coded key ones to enhance their spatial quality, and the skipped frames are well recovered based on MV copy scheme from adjacent key ones at the decoder side to maintain constant frame rate. Experimental results show that the proposed active SSIM-based frameskip scheme acquires better and more consistent spatial-temporal quality both in objective (PSNR) and subjective (SSIM) sense with low complexity compared to classic fixed frame rate control method JVT-G012 and prior objective metric based frameskip method.

Efficient Processing of Temporal Aggregation including Selection Predicates (선택 프레디키트를 포함하는 시간 집계의 효율적 처리)

  • Kang, Sung-Tak;Chung, Yon-Dohn;Kim, Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.35 no.3
    • /
    • pp.218-230
    • /
    • 2008
  • The temporal aggregate in temporal databases is an extension of the conventional aggregate to include the time on the range condition of aggregation. It is a useful operation for Historical Data Warehouses, Call Data Records, and so on. In this paper, we propose a structure for the temporal aggregation with multiple selection predicates, called the ITA-tree, and an aggregate processing method based on the structure. In the ITA-tree, we transform the time interval of a record into a single value, called the T-value. Then, we index records according to their T-values like a $B^+$-tree style. For possible hot-spot situations, we also propose an improvement of the ITA-tree, called the eITA-tree. Through analyses and experiments, we evaluate the performance of the proposed method.

Gaps-In-Noise Test Performance in Children with Speech Sound Disorder and Cognitive Difficulty

  • Jung, Yu Kyung;Lee, Jae Hee
    • Journal of Audiology & Otology
    • /
    • v.24 no.3
    • /
    • pp.133-139
    • /
    • 2020
  • Background and Objectives: The Gaps-In-Noise (GIN) test is a clinically effective measure of the integrity of the central auditory nervous system. The GIN procedure can be applied to a pediatric population above 7 years of age. The present study conducted the GIN test to compare the abilities of auditory temporal resolution among typically developing children, children with speech sound disorder (SSD), and children with cognitive difficulty (CD). Subjects and Methods: Children aged 8 to 11 years-(total n=30) participated in this study. There were 10 children in each of the following three groups: typically developing children, children with SSD, and children with CD. The Urimal Test of Articulation and Phonology was conducted as a clinical assessment of the children's articulation and phonology. The Korean version of the Wechsler Intelligence Scale for Children-III (K-WISC-III) was administered as a screening test for general cognitive function. According to the procedure of Musiek, the pre-recorded stimuli of the GIN test were presented at 50 dB SL. The results were scored by the approximated threshold and the overall percent correct score (%). Results: All the typically developing children had normal auditory temporal resolution based on the clinical cutoff criteria of the GIN test. The children with SSD or CD had significantly reduced gap detection performance compared to age-matched typically developing children. The children's intelligence score measured by the K-WISC-III test explained 37% of the variance in the percent-correct score. Conclusions: Children with SSD or CD exhibited poorer ability to resolve rapid temporal acoustic cues over time compared to the age-matched typically developing children. The ability to detect a brief temporal gap embedded in a stimulus may be related to the general cognitive ability or phonological processing.

Gaps-In-Noise Test Performance in Children with Speech Sound Disorder and Cognitive Difficulty

  • Jung, Yu Kyung;Lee, Jae Hee
    • Korean Journal of Audiology
    • /
    • v.24 no.3
    • /
    • pp.133-139
    • /
    • 2020
  • Background and Objectives: The Gaps-In-Noise (GIN) test is a clinically effective measure of the integrity of the central auditory nervous system. The GIN procedure can be applied to a pediatric population above 7 years of age. The present study conducted the GIN test to compare the abilities of auditory temporal resolution among typically developing children, children with speech sound disorder (SSD), and children with cognitive difficulty (CD). Subjects and Methods: Children aged 8 to 11 years-(total n=30) participated in this study. There were 10 children in each of the following three groups: typically developing children, children with SSD, and children with CD. The Urimal Test of Articulation and Phonology was conducted as a clinical assessment of the children's articulation and phonology. The Korean version of the Wechsler Intelligence Scale for Children-III (K-WISC-III) was administered as a screening test for general cognitive function. According to the procedure of Musiek, the pre-recorded stimuli of the GIN test were presented at 50 dB SL. The results were scored by the approximated threshold and the overall percent correct score (%). Results: All the typically developing children had normal auditory temporal resolution based on the clinical cutoff criteria of the GIN test. The children with SSD or CD had significantly reduced gap detection performance compared to age-matched typically developing children. The children's intelligence score measured by the K-WISC-III test explained 37% of the variance in the percent-correct score. Conclusions: Children with SSD or CD exhibited poorer ability to resolve rapid temporal acoustic cues over time compared to the age-matched typically developing children. The ability to detect a brief temporal gap embedded in a stimulus may be related to the general cognitive ability or phonological processing.

Range Query Processing of Distributed Moving Object Databases using Scheduling Technique (스케쥴링 기법을 이용한 분산 이동 객체 데이타베이스의 범위 질의 처리)

  • Jeon, Se-Gil;Hwang, Jae-Il;Nah, Youn-Mook
    • Journal of Korea Spatial Information System Society
    • /
    • v.6 no.2 s.12
    • /
    • pp.51-62
    • /
    • 2004
  • Recently, the location-based service for moving customers is becoming one of the most important service in mobile communication area. For moving object applications, there are lots of update operations and such update loads are concentrated on some particular area unevenly. The primary processing of LBS application is spatio-temporal range queries. To improve the throughput of spatio-temporal range queries, the time of disk I/O in query processing should be reduced. In this paper, we adopt non-uniform two-level grid index structures of GALIS architecture,which are designed to minimize update operations. We propose query scheduling technique using spatial relationship and time relationship and a combined spatio-temporal query processing method using time zone concepts to improve the throughput of query processing. Some experimental results are shown for range queries with different query range to show the performance tradeoffs of the proposed methods.

  • PDF

An Efficient Range Query Processing of Distributed Moving Object (분산 이동 객체 데이터베이스의 효율적인 범위 질의 처리)

  • Jeon, Se-Gil;Woo, Chan-Il
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.42 no.1
    • /
    • pp.35-40
    • /
    • 2005
  • Recently, the location based service for moving customers is becoming one of the most important service in mobile communication area and for moving object applications, there are lots of update operations and such update loads are concentrated on some particular area unevenly. The primary processing of LBS application is spatio-temporal range queries and to improve the throughput of spatio-temporal range queries, the time of disk I/O in query processing should be reduced. In this paper, we adopt non-uniform two-level grid index structure, which are designed to minimize update operations. We propose query scheduling technique using spatial relationship and time relationship and a combined spatio-temporal query processing method using time zone concepts to improve the throughput of query processing. Some experimental results are shown for range queries with different query range to show the performance tradeoffs of the proposed methods.

Implementation and Evaluation of Time Interval Partitioning Algorithm in Temporal Databases (시간 데이타베이스에서 시간 간격 분할 알고리즘의 구현 및 평가)

  • Lee, Kwang-Kyu;Shin, Ye-Ho;Ryu, Keun-Ho;Kim, Hong-Gi
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.1
    • /
    • pp.9-16
    • /
    • 2002
  • Join operation exert a great effect on the performance of system in temporal database as in the relational database. Especially, as for the temporal join, the optimization of interval partition decides the performance of query processing. In this paper, to improve the efficiency of parallel join query in temporal database. I proposed Minimum Interval Partition(MIP) scheme that time interval partitioning. The validity of this MIP algorithm that decides minimum breakpoint of the partition is proved by example scenario and I confirmed improved efficiency as compared with existing partition algorithm.

Temporal Data Mining Framework (시간 데이타마이닝 프레임워크)

  • Lee, Jun-Uk;Lee, Yong-Jun;Ryu, Geun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.9D no.3
    • /
    • pp.365-380
    • /
    • 2002
  • Temporal data mining, the incorporation of temporal semantics to existing data mining techniques, refers to a set of techniques for discovering implicit and useful temporal knowledge from large quantities of temporal data. Temporal knowledge, expressible in the form of rules, is knowledge with temporal semantics and relationships, such as cyclic pattern, calendric pattern, trends, etc. There are many examples of temporal data, including patient histories, purchaser histories, and web log that it can discover useful temporal knowledge from. Many studies on data mining have been pursued and some of them have involved issues of temporal data mining for discovering temporal knowledge from temporal data, such as sequential pattern, similar time sequence, cyclic and temporal association rules, etc. However, all of the works treated data in database at best as data series in chronological order and did not consider temporal semantics and temporal relationships containing data. In order to solve this problem, we propose a theoretical framework for temporal data mining. This paper surveys the work to date and explores the issues involved in temporal data mining. We then define a model for temporal data mining and suggest SQL-like mining language with ability to express the task of temporal mining and show architecture of temporal mining system.