• Title/Summary/Keyword: post data processing

Search Result 558, Processing Time 0.027 seconds

Improvement of Environmental Sounds Recognition by Post Processing (후처리를 이용한 환경음 인식 성능 개선)

  • Park, Jun-Qyu;Baek, Seong-Joon
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.7
    • /
    • pp.31-39
    • /
    • 2010
  • In this study, we prepared the real environmental sound data sets arising from people's movement comprising 9 different environment types. The environmental sounds are pre-processed with pre-emphasis and Hamming window, then go into the classification experiments with the extracted features using MFCC (Mel-Frequency Cepstral Coefficients). The GMM (Gaussian Mixture Model) classifier without post processing tends to yield abruptly changing classification results since it does not consider the results of the neighboring frames. Hence we proposed the post processing methods which suppress abruptly changing classification results by taking the probability or the rank of the neighboring frames into account. According to the experimental results, the method using the probability of neighboring frames improve the recognition performance by more than 10% when compared with the method without post processing.

A Study on the Improved Post-Analysis Development System in the Naval Combat System

  • Seo, Chang-Won
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.12
    • /
    • pp.197-207
    • /
    • 2022
  • The Naval Combat System operates in multiple software components for efficient functional processing. Data transmission and reception between components is performed in real time using DDS(Data Distribution Service). Reliable Post-Analysis requires the collection of all DDS messages. However, Software workload and development costs increase because common functions for all messages must be developed directly. In the paper, We propose an improved Post-Analysis based on the Feature Model and a new development system using it. Functions for the modified message were applied as variable domains of the Feature Model. When Build Center updates Post-Analysis, it automatically processes all software tasks associated with Post-Analysis. The proposed development system simplified the overall work procedure, and work time was significantly reduced compared to the existing development system.

News Data Analysis Using Acoustic Model Output of Continuous Speech Recognition (연속음성인식의 음향모델 출력을 이용한 뉴스 데이터 분석)

  • Lee, Kyong-Rok
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.10
    • /
    • pp.9-16
    • /
    • 2006
  • In this paper, the acoustic model output of CSR(Continuous Speech Recognition) was used to analyze news data News database used in this experiment was consisted of 2,093 articles. Due to the low efficiency of language model, conventional Korean CSR is not appropriate to the analysis of news data. This problem could be handled successfully by introducing post-processing work of recognition result of acoustic model. The acoustic model more robust than language model in Korean environment. The result of post-processing work was made into KIF(Keyword information file). When threshold of acoustic model's output level was 100, 86.9% of whole target morpheme was included in post-processing result. At the same condition, applying length information based normalization, 81.25% of whole target morpheme was recognized. The purpose of normalization was to compensate long-length morpheme. According to experiment result, 75.13% of whole target morpheme was recognized KIF(314MB) had been produced from original news data(5,040MB). The decrease rate of absolute information met was approximately 93.8%.

  • PDF

The Development of Modularized Post Processing GPS Software Receiving Platform using MATLAB Simulink

  • Kim, Ghang-Ho;So, Hyoung-Min;Jeon, Sang-Hoon;Kee, Chang-Don;Cho, Young-Su;Choi, Wansik
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.9 no.2
    • /
    • pp.121-128
    • /
    • 2008
  • Modularized GPS software defined radio (SDR) has many advantages of applying and modifying algorithm. Hardware based GPS receiver uses many hardware parts (such as RF front, correlators, CPU and other peripherals) that process tracked signal and navigation data to calculate user position, while SDR uses software modules, which run on general purpose CPU platform or embedded DSP. SDR does not have to change hardware part and is not limited by hardware capability when new processing algorithm is applied. The weakness of SDR is that software correlation takes lots of processing time. However, in these days the evolution of processing power of MPU and DSP leads the competitiveness of SDR against the hardware GPS receiver. This paper shows a study of modulization of GPS software platform and it presents development of the GNSS software platform using MATLAB Simulink™. We focus on post processing SDR platform which is usually adapted in research area. The main functions of SDR are GPS signal acquisition, signal tracking, decoding navigation data and calculating stand alone user position from stored data that was down converted and sampled intermediate frequency (IF) data. Each module of SDR platform is categorized by function for applicability for applying for other frequency and GPS signal easily. The developed software platform is tested using stored data which is down-converted and sampled IF data file. The test results present that the software platform calculates user position properly.

A Study of Choice for Analysis Method on Repeated Measures Clinical Data

  • Song, Jung
    • Korean Journal of Clinical Laboratory Science
    • /
    • v.45 no.2
    • /
    • pp.60-65
    • /
    • 2013
  • Data from repeated measurements are accomplished through repeatedly processing the same subject under different conditions and different points of view. The power of testing enhances the choice of pertinent analysis methods that agrees with the characteristics of data concerned and the situation involved. Along with the clinical example, this paper compares the analysis of the variance on ex-post tests, gain score analysis, analysis by mixed design and analysis of covariance employable for repeating measure. Comparing the analysis of variance on ex post test, and gain score analysis on correlations, leads to the fact that the latter enhances the power of the test and diminishes the variance of error terms. The concluded probability, identified that the gain score analysis and the mixed design on interaction between "between subjects factor" and "within subjects factor", are identical. The analysis of covariance, demonstrated better power of the test and smaller error terms than the gain score analysis. Research on four analysis method found that the analysis of covariance is the most appropriate in clinical data than two repeated test with high correlation and ex ante affects ex post.

  • PDF

The Performance Bottleneck of Subsequence Matching in Time-Series Databases: Observation, Solution, and Performance Evaluation (시계열 데이타베이스에서 서브시퀀스 매칭의 성능 병목 : 관찰, 해결 방안, 성능 평가)

  • 김상욱
    • Journal of KIISE:Databases
    • /
    • v.30 no.4
    • /
    • pp.381-396
    • /
    • 2003
  • Subsequence matching is an operation that finds subsequences whose changing patterns are similar to a given query sequence from time-series databases. This paper points out the performance bottleneck in subsequence matching, and then proposes an effective method that improves the performance of entire subsequence matching significantly by resolving the performance bottleneck. First, we analyze the disk access and CPU processing times required during the index searching and post processing steps through preliminary experiments. Based on their results, we show that the post processing step is the main performance bottleneck in subsequence matching, and them claim that its optimization is a crucial issue overlooked in previous approaches. In order to resolve the performance bottleneck, we propose a simple but quite effective method that processes the post processing step in the optimal way. By rearranging the order of candidate subsequences to be compared with a query sequence, our method completely eliminates the redundancy of disk accesses and CPU processing occurred in the post processing step. We formally prove that our method is optimal and also does not incur any false dismissal. We show the effectiveness of our method by extensive experiments. The results show that our method achieves significant speed-up in the post processing step 3.91 to 9.42 times when using a data set of real-world stock sequences and 4.97 to 5.61 times when using data sets of a large volume of synthetic sequences. Also, the results show that our method reduces the weight of the post processing step in entire subsequence matching from about 90% to less than 70%. This implies that our method successfully resolves th performance bottleneck in subsequence matching. As a result, our method provides excellent performance in entire subsequence matching. The experimental results reveal that it is 3.05 to 5.60 times faster when using a data set of real-world stock sequences and 3.68 to 4.21 times faster when using data sets of a large volume of synthetic sequences compared with the previous one.

A Development of Unicode-based Multi-lingual Namecard Recognizer (Unicode 기반 다국어 명함인식기 개발)

  • Jang, Dong-Hyeub;Lee, Jae-Hong
    • The KIPS Transactions:PartB
    • /
    • v.16B no.2
    • /
    • pp.117-122
    • /
    • 2009
  • We developed a multi-lingual namecard recognizer for building up a global client management systems. At first, we created the Unicode-based character image database for character recognition and learning of multi languages, and applied many color image processing techniques to get more correct data for namecard images which were acquired by various input devices. And by applying multi-layer perceptron neural network, individual character recognition applied for language types, and post-processing utilizing keyword databases made for individual languages, we increased a recognition rate for multi-lingual namecards.

Precise Positioning of Autonomous Underwater Vehicle in Post-processing Mode

  • Felski, Andrzej
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.1
    • /
    • pp.513-517
    • /
    • 2006
  • Autonomous Underwater Vehicles plays specific role in underwater investigation. Generally, this kind of vehicles will move along a planned path for sea bottom or underwater installations inspections, search for mineral deposits along shelves, seeking lost items including bottom mines or for hydrographic measurements. A crucial barrier for it remains the possibility of precise determination of their underwater position. Commonly used radionavigation systems do not work in such circumstances or do not guarantee the required accuracies. In the paper some new solution is proposed on the assumption that it is possible to increase the precision by certain processing of a combination of measurements conducted by means of different techniques. Objective of the paper is the idea of navigation of AUV which consists of two phases: firstly a trip of AUV along pre-planned route and after that postprocessed transformation of collected data in post-processing mode. During the processing of collected data the modern adjustment methods have been applied, mainly estimation by means of least squares and M-estimation. Application of these methods should be associated with the measuring and geometric conditions of navigational tasks and thus suited for specific scientific and technical problems of underwater navigation. The first results of computer aided investigation will be presented and the basic scope of these application and possible development directions will be indicated also. The paper is prepared as an partial results of the works carried out within a framework of the research Project: 'Improvement of the Precise Underwater Vehicle Navigation Methods' financed by the Polish Ministry of Education and Science (No 0 T00A 012 25).

  • PDF

Combined Service Subscription and Delivery Energy-Efficient Scheduling in Mobile Cloud Computing

  • Liu, Xing;Yuan, Chaowei;Peng, Enda;Yang, Zhen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.5
    • /
    • pp.1587-1605
    • /
    • 2015
  • Mobile cloud computing (MCC) combines mobile Internet and cloud computing to improve the performance of applications. In MCC, the data processing and storage for mobile devices (MDs) is provided on the remote cloud. However, MCC faces the problem of energy efficiency caused by randomly varying channels. In this paper, by introducing the Lyapunov optimization method, we propose a combined service subscription and delivery (CSSD) algorithm that can guide the users to subscribe to services reasonably. This algorithm can also determine whether to deliver the data and to whom data is sent in the current time unit based on the queue backlog and the channel state. Numerical results validate the correctness and effectiveness of our proposed CSSD algorithm.

PROPER ORTHOGONAL DECOMPOSITION OF DISCONTINUOUS SOLUTIONS WITH THE GEGENBAUER POST-PROCESSING

  • SHIN, BYEONG-CHUN;JUNG, JAE-HUN
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.23 no.4
    • /
    • pp.301-327
    • /
    • 2019
  • The proper orthogonal decomposition (POD) method for time-dependent problems significantly reduces the computational time as it reduces the original problem to the lower dimensional space. Even a higher degree of reduction can be reached if the solution is smooth in space and time. However, if the solution is discontinuous and the discontinuity is parameterized e.g. with time, the POD approximations are not accurate in the reduced space due to the lack of ability to represent the discontinuous solution as a finite linear combination of smooth bases. In this paper, we propose to post-process the sample solutions and re-initialize the POD approximations to deal with discontinuous solutions and provide accurate approximations while the computational time is reduced. For the post-processing, we use the Gegenbauer reconstruction method. Then we regularize the Gegenbauer reconstruction for the construction of POD bases. With the constructed POD bases, we solve the given PDE in the reduced space. For the POD approximation, we re-initialize the POD solution so that the post-processed sample solution is used as the initial condition at each sampling time. As a proof-of-concept, we solve both one-dimensional linear and nonlinear hyperbolic problems. The numerical results show that the proposed method is efficient and accurate.