• Title/Summary/Keyword: 일괄처리

Search Result 308, Processing Time 0.027 seconds

A Suitable User Group Management method for SVC(Scalable Video Coding) in IPTV (IPTV SVC환경에 알맞은 사용자 그룹 관리 방법)

  • Lee, Jung-Hee;Oh, Heekuck
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.04a
    • /
    • pp.828-830
    • /
    • 2010
  • IPTV 환경에서는 콘텐츠를 수신하는 디바이스가 여러 종류가 있더라도 한번의 인코딩으로 콘텐츠 제공을 할 수 있는 Video Coding 기술인 SVC(Scalable Video Coding) 기술이 제공된다. SVC의 특징으로는 콘텐츠를 여러 계층으로 나뉘어 하나의 Base 계층과 여러 개의 Enhancement 계층을 가지게 되는데 상위계층은 하위 계층에 대해 더 추가적인 정보를 담고 있기 때문에 더 많은 계층이 전송될수록 데이터의 품질이 좋아지게 된다. 이러한 IPTV SVC환경의 그룹관리에 대해서 SVC의 특징인 계층간 순차적 관계를 적용한 안전한 사용자 그룹의 구성과 빈번한 가입과 탈퇴에 대해서 효율적인 그룹키 갱신에 대한 방법이 필요하다. 따라서 본 논문에서는 SVC의 특징인 계층간 순차적 관계를 지키는 사용자 그룹을 구성하고, 빈번한 가입/ 탈퇴에 대해서 효율적으로 처리하기 위한 일괄적인 그룹 키 갱신방법을 제안한다.

Fast Sequential Bundle Adjustment Algorithm for Real-time High-Precision Image Georeferencing (실시간 고정밀 영상 지오레퍼런싱을 위한 고속 연속 번들 조정 알고리즘)

  • Choi, Kyoungah;Lee, Impyeong
    • Korean Journal of Remote Sensing
    • /
    • v.29 no.2
    • /
    • pp.183-195
    • /
    • 2013
  • Real-time high-precision image georeferencing is important for the realization of image based precise navigation or sophisticated augmented reality. In general, high-precision image georeferencing can be achieved using the conventional simultaneous bundle adjustment algorithm, which can be performed only as post-processing due to its processing time. The recently proposed sequential bundle adjustment algorithm can rapidly produce the results of the similar accuracy and thus opens a possibility of real-time processing. However, since the processing time still increases linearly according to the number of images, if the number of images are too large, its real-time processing is not guaranteed. Based on this algorithm, we propose a modified fast algorithm, the processing time of which is maintained within a limit regardless of the number of images. Since the proposed algorithm considers only the existing images of high correlation with the newly acquired image, it can not only maintain the processing time but also produce accurate results. We applied the proposed algorithm to the images acquired with 1Hz. It is found that the processing time is about 0.02 seconds at the acquisition time of each image in average and the accuracy is about ${\pm}5$ cm on the ground point coordinates in comparison with the results of the conventional simultaneous bundle adjustment algorithm. If this algorithm is converged with a fast image matching algorithm of high reliability, it enables high precision real-time georeferencing of the moving images acquired from a smartphone or UAV by complementing the performance of position and attitude sensors mounted together.

Incremental Generation of A Decision Tree Using Global Discretization For Large Data (대용량 데이터를 위한 전역적 범주화를 이용한 결정 트리의 순차적 생성)

  • Han, Kyong-Sik;Lee, Soo-Won
    • The KIPS Transactions:PartB
    • /
    • v.12B no.4 s.100
    • /
    • pp.487-498
    • /
    • 2005
  • Recently, It has focused on decision tree algorithm that can handle large dataset. However, because most of these algorithms for large datasets process data in a batch mode, if new data is added, they have to rebuild the tree from scratch. h more efficient approach to reducing the cost problem of rebuilding is an approach that builds a tree incrementally. Representative algorithms for incremental tree construction methods are BOAT and ITI and most of these algorithms use a local discretization method to handle the numeric data type. However, because a discretization requires sorted numeric data in situation of processing large data sets, a global discretization method that sorts all data only once is more suitable than a local discretization method that sorts in every node. This paper proposes an incremental tree construction method that efficiently rebuilds a tree using a global discretization method to handle the numeric data type. When new data is added, new categories influenced by the data should be recreated, and then the tree structure should be changed in accordance with category changes. This paper proposes a method that extracts sample points and performs discretiration from these sample points to recreate categories efficiently and uses confidence intervals and a tree restructuring method to adjust tree structure to category changes. In this study, an experiment using people database was made to compare the proposed method with the existing one that uses a local discretization.

Adsorption Characteristics of Pb(II) and Cr(III) onto C-Methylcalix[4]resorcinarene (C-Metylcalix[4]resorcinarene에서 Pb(II)와 Cr(III)의 흡착 특징)

  • Jumina, Jumina;Sarjono, Ratnaningsih Eko;Siswanta, Dwi;Santosa, Sri Juari;Ohto, Keisuke
    • Journal of the Korean Chemical Society
    • /
    • v.55 no.3
    • /
    • pp.454-462
    • /
    • 2011
  • A study on the adsorption characteristics of Pb(II) and Cr(III) cations onto C-methylcalix[4]resorcinarene (CMCR) has been conducted. CMCR was produced by one step synthesis from resorcinol, acetaldehyde, and HCl. Most parameters in batch system confirm that CMCR is a good adsorbent for Pb(II) and Cr(III). Cr(III) uptake was bigger than that of Pb(II), but Cr(III) adsorption rate was slower than Pb(II). The adsorption kinetic of Pb(II) and Cr(III) adsorptions in batch followed pseudo $2^{nd}$ order kinetics model, but the kinetic of Pb(II) adsorption in fixed bed column system followed first order model. Desorption studies to recover the adsorbed Pb(II) was performed sequentially with distilled water and HCl, and the results showed that the adsorption was dominated by chemisorption.

A Development of Multi-Period Bus Scheduling Model (다시간대에 대한 버스 스케줄링 모형 개발)

  • 고종섭;고승영
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.4
    • /
    • pp.47-58
    • /
    • 1999
  • The Purpose of this Paper is to develop a multi-period bus scheduling model, in which a decomposition technique is applied. In general a bus scheduling requires a vast amount of calculation. Thus, a bus scheduling is a very complicated problem even with a single depot and is almost unable to obtain the optimal solution theoretically with many depots. In this paper in order to simplify the problem, the whole operating hours of a day are partitioned into several time periods. In one period, the same headways are maintained. For one period, the bus scheduling is simple and the solution applying the FIFO(First-In, First-Out) Principle is the optimal. However, connection between Periods remains as another scheduling Problem with a reduced problem size. This paper suggests how to connect bus schedules of consecutive periods efficiently, minimizing the operating cost. Through case studies for multiple routes with a single depot, this decomposition technique is proved to be effective practically.

  • PDF

Online Monaural Ambient Sound Extraction based on Nonnegative Matrix Factorization Method for Audio Contents (오디오 컨텐츠를 위한 비음수 행렬 분해 기법 기반의 실시간 단일채널 배경 잡음 추출 기법)

  • Lee, Seokjin
    • Journal of Broadcast Engineering
    • /
    • v.19 no.6
    • /
    • pp.819-825
    • /
    • 2014
  • In this paper, monaural ambient component extraction algorithm based on nonnegative matrix factorization (NMF) is described. The ambience component extraction algorithm in this paper is developed for audio upmixing system; Recent researches have shown that they can enhance listener envelopment if the extracted ambient signal is applied into the multichannel audio upmixing system. However, the conventional method stores all of the audio signal and processes all at once, so it cannot be applied to streaming system and digital signal processor (DSP) system. In this paper, the ambient component extraction algorithm based on on-line nonnegative matrix factorization is developed and evaluated to solve the problem. As a result of analysis of the processed signal with spectral flatness measures in the experiment, it was shown that the developed system can extract the ambient signal similarly with the conventional batch process system.

A Comparison of Orbit Determination Performance for the KOMPSAT-2 using Batch Filter and Sequential Filter (아리랑위성 2호 데이터를 이용한 연속추정필터와 배치필터 처리 결과 비교)

  • Cho, Dong-Hyun;Kim, Hae-Dong
    • Aerospace Engineering and Technology
    • /
    • v.11 no.2
    • /
    • pp.149-157
    • /
    • 2012
  • In this paper, the performance of the sequential filter for a space debris collision management system is analyzed by using the flight data of KOMPSAT-2. To analyze the performance of the sequential filter, the results of batch filter used in the orbit determination system of the KOMPSAT-2 ground station is used as reference data. The overlap method is also used to evaluate the orbit accuracy. This paper shows that the orbit determination accuracy of the sequential filter is similar to that of the KOMPSAT-2 ground station, but dissimilar characteristics exist due to the filter difference. In addition, it is also shown that the orbit determination accuracy is order of 1m root mean square by using 30 hour GPS navigation solutions and 6 hour comparison period for the overlap method.

The Digital Drawing Production Using Digital Camera (디지털 카메라를 이용한 수치도면작성)

  • Choi, Seung-Pil;Park, Jong-Sun;Choi, Chul-Soon
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.12 no.3 s.30
    • /
    • pp.91-97
    • /
    • 2004
  • As for the former analogue method of photogrammetry, We have obtained final digital drawing by creating the stereo model from overlapped images through orientation process using plotting instrument and processing restitution procedure. However, digital photogrammetry batch processes such using small computer system thus We make an attempt automatization of the procedures. And without the production of stereo model, We could obtain 3D digital data through analysis method. Therefore, an objective of this study was to implement a surveying system that could 3D surveying positions using the digital image to reduce limitations of control point surveying and photographing conditions more efficiently to produce digital drawing. By the result, photogrammetry can practice and make out digital drawing to a computer by digital camera of a comparative low-cost. Small scale area can become practical use to drawing production etc. for facilities management because area can make out digital drawing economically than general surveying.

  • PDF

An Incremental Method Using Sample Split Points for Global Discretization (전역적 범주화를 위한 샘플 분할 포인트를 이용한 점진적 기법)

  • 한경식;이수원
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.7
    • /
    • pp.849-858
    • /
    • 2004
  • Most of supervised teaming algorithms could be applied after that continuous variables are transformed to categorical ones at the preprocessing stage in order to avoid the difficulty of processing continuous variables. This preprocessing stage is called global discretization, uses the class distribution list called bins. But, when data are large and the range of the variable to be discretized is very large, many sorting and merging should be performed to produce a single bin because most of global discretization methods need a single bin. Also, if new data are added, they have to perform discretization from scratch to construct categories influenced by the data because the existing methods perform discretization in batch mode. This paper proposes a method that extracts sample points and performs discretization from these sample points in order to solve these problems. Because the approach in this paper does not require merging for producing a single bin, it is efficient when large data are needed to be discretized. In this study, an experiment using real and synthetic datasets was made to compare the proposed method with an existing one.

An Improvement of Hospital Reception System using Web Socket (웹소켓을 이용한 병원 접수시스템 개선에 관한 연구)

  • Son, Man-Geun;Park, Ki-Seong;Kong, Yong-Hae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.1
    • /
    • pp.185-195
    • /
    • 2015
  • During hospital peak times of outpatients, an effective mechanism that informs the newly receipted patient information to corresponding medical departments is lacking in current hospital reception systems. Since every department repeatedly searches entire patient reception database in sequential manner to acquire its reception information, this is a significant performance degradation factor in hospital information system. To improve hospital reception system efficiency, we developed two web socket based systems, a primary key transmitting batch system and a reception information transmitting real time system. The former reduced database access time compared to sequential search system as well as kept search time low regardless of receipted patient number. The latter effectively reduced waiting list updating time in request/response patient reception system by eliminating database access.