• Title/Summary/Keyword: Processing Map

Search Result 1,473, Processing Time 0.025 seconds

Efficient Browsing Method based on Metadata of Video Contents (동영상 컨텐츠의 메타데이타에 기반한 효율적인 브라우징 기법)

  • Chun, Soo-Duck;Shin, Jung-Hoon;Lee, Sang-Jun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.5
    • /
    • pp.513-518
    • /
    • 2010
  • The advancement of information technology along with the proliferation of communication and multimedia has increased the demand of digital contents. Video data of digital contents such as VOD, NOD, Digital Library, IPTV, and UCC are getting more permeated in various application fields. Video data have sequential characteristic besides providing the spatial and temporal information in its 3D format, making searching or browsing ineffective due to long turnaround time. In this paper, we suggest ATVC(Authoring Tool for Video Contents) for solving this issue. ATVC is a video editing tool that detects key frames using visual rhythm and insert metadata such as keywords into key frames via XML tagging. Visual rhythm is applied to map 3D spatial and temporal information to 2D information. Its processing speed is fast because it can get pixel information without IDCT, and it can classify edit-effects such as cut, wipe, and dissolve. Since XML data save key frame information via XML tag and keyword information, it can furnish efficient browsing.

RDFS Rule based Parallel Reasoning Scheme for Large-Scale Streaming Sensor Data (대용량 스트리밍 센서데이터 환경에서 RDFS 규칙기반 병렬추론 기법)

  • Kwon, SoonHyun;Park, Youngtack
    • Journal of KIISE
    • /
    • v.41 no.9
    • /
    • pp.686-698
    • /
    • 2014
  • Recently, large-scale streaming sensor data have emerged due to explosive supply of smart phones, diffusion of IoT and Cloud computing technology, and generalization of IoT devices. Also, researches on combination of semantic web technology are being actively pushed forward by increasing of requirements for creating new value of data through data sharing and mash-up in large-scale environments. However, we are faced with big issues due to large-scale and streaming data in the inference field for creating a new knowledge. For this reason, we propose the RDFS rule based parallel reasoning scheme to service by processing large-scale streaming sensor data with the semantic web technology. In the proposed scheme, we run in parallel each job of Rete network algorithm, the existing rule inference algorithm and sharing data using the HBase, a hadoop database, as a public storage. To achieve this, we implement our system and evaluate performance through the AWS data of the weather center as large-scale streaming sensor data.

Merge and Split of Players under MeanShift Tracking in Baseball Videos (야구 비디오에 대한 민시프트 추적 하에서 선수 병합 분리)

  • Choi, Hyeon-yeong;Hong, Sung-hwa;Ko, Jae-pil
    • Journal of Advanced Navigation Technology
    • /
    • v.21 no.1
    • /
    • pp.119-125
    • /
    • 2017
  • In this paper, we propose a method that merges and splits players in the MeanShift tracking framework. The MeanShift tracking moves the center of tracking window to the maximum probability location given the target probability distribution. This tracking method has been widely used for real-time tracking problems because of its fast processing speed. However, it hardly handles occlusions in multiple object tracking systems. Occlusions can be usually solved by applying data association methods. In this paper, we propose a method that can be applied before data association methods. The proposed method automatically merges and splits the overlapped players by adjusting the each player's tracking map. We have compared the tracking performance of the MeanSfhit tracking algorithm and the proposed method.

A Study on the Method of Measuring Accessibility to Urban Open Spaces (도시 오픈스페이스의 접근성 측정에 관한 연구)

  • 안동만;최형석;김인호;조형준
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.18 no.4
    • /
    • pp.17-28
    • /
    • 1991
  • The purpose of this study is to investigate and present a method for measuring public accessibility to urban open spaces. A basic assumption is that, for urban open space policies, accessibility is more important than per capita area. In this study, for the purpose of simplicity, a residential area is assumed to have access to open space if it is within a certain distance from an urban open space. Official city planning map is overlayed with a 200m grid and each cell of dwelling area is checked whether it is within a certain distance from a cell categorized as urban open space. A computer program for widely commercialized personal computer is developed for data processing so that local governments without access to more sophisticated systems can carry out similar studies for their own jurisdictions. Five cities, big, small, old and new, are selected to test the proposed method. Dwelling areas of Ansan new Town have highest accessibility to open spaces(93.4% of dwelling cells have open space cell within 500m). Seoul (91.2%), Suwon(78.2%), Pusan(73.8%), and Inchon(61.4%) have less accessibility. If we assume the Ansan City residents are evenly distributed over the dwelling area, 93.4% of the population has open spaces within walking distance of 500m. However, if we consider physical barriers such as arterial roads, railroads, and streams that reduce the accessibility, less than 93.4% of Ansan city residents enjoy good access to open spaces. Though a further detailed analysis is needed to picture the microscopic accessibility, this method can serve as a useful tool for urban open space policy and open space alternatives evaluations.

  • PDF

Addressing Big Data solution enabled Connected Vehicle services using Hadoop (Hadoop을 이용한 스마트 자동차 서비스용 빅 데이터 솔루션 개발)

  • Nkenyereye, Lionel;Jang, Jong-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.3
    • /
    • pp.607-612
    • /
    • 2015
  • As the amount of vehicle's diagnostics data increases, the actors in automotive ecosystem will encounter difficulties to perform a real time analysis in order to simulate or to design new services according to the data gathered from the connected cars. In this paper, we have conducted a study of a Big Data solution that expresses the essential deep analytics to process and analyze vast quantities of vehicles on board diagnostics data generated by cars. Hadoop and its ecosystems have been deployed to process a large data and delivered useful outcomes that may be used by actors in automotive ecosystem to deliver new services to car owners. As the Intelligent transport system is involved to guarantee safety, reduce rate of crash and injured in the accident due to speed, addressing big data solution based on vehicle diagnostics data is upcoming to monitor real time outcome from it and making collection of data from several connected cars, facilitating reliable processing and easier storage of data collected.

Design and Implementation of a Flood Disaster Safety System Using Realtime Weather Big Data (실시간 기상 빅데이터를 활용한 홍수 재난안전 시스템 설계 및 구현)

  • Kim, Yeonwoo;Kim, Byounghoon;Ko, Geonsik;Choi, Minwoong;Song, Heesub;Kim, Gihoon;Yoo, Seunghun;Lim, Jongtae;Bok, Kyungsoo;Yoo, Jaesoo
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.1
    • /
    • pp.351-362
    • /
    • 2017
  • Recently, analysis techniques to extract new meanings using big data analysis and various services using them have been developed. A disaster safety service among such services has been paid attention as the most important service. In this paper, we design and implement a flood disaster safety system using real time weather big data. The proposed system retrieves and processes vast amounts of information being collected in real time. In addition, it analyzes risk factors by aggregating the collected real time and past data and then provides users with prediction information. The proposed system also provides users with the risk prediction information by processing real time data such as user messages and news, and by analyzing disaster risk factors such a typhoon and a flood. As a result, users can prepare for potential disaster safety risks through the proposed system.

ICT Standardization Strategy Item Analysis for Smart Farming and Livestock Farming (스마트 농축산업을 위한 ICT 표준화 중점항목 분석)

  • Kim, Dong-il
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.3
    • /
    • pp.607-612
    • /
    • 2017
  • IT convergence with agriculture and livestock farming are expected to bring more efficiency and quality improvement in producing, distributing, consuming of agricultural products with the aid of information processing and autonomous control technologies of the IT area. The standardization work for smart farming and livestock farming based on networks is just at the beginning stage. And also, it is capable of coping with environment and technical problems with the actualized IT convergence case for agriculture. Hence, more studies on each point are required to finish the works including amendments and enhancements. More interests are expected to attain the successful results that ultimately contribute to innovate in the lifestyle. In this paper, it is analyzed strategy item and consider the actualized IT convergence case for agriculture and livestock, namely Smart Farming and Smart livestock Farming as a solution to cope the presented problems. In addition, suggest to ICT standardization road map for future planning.

Development of Localization Tracking System and User Interface of Guiding Robot for the Visually Impaired (시각장애인 유도 로봇의 자기 위치 추적 시스템 및 사용자 인터페이스 개발)

  • Ryu Je-Goon;Shen Dong-Fan;Kwon Oh-Sang;Kim Nack-Hwan;Lee Sang-Moo;Lee Eung-Hyuk;Hong Seung-Hong
    • The KIPS Transactions:PartD
    • /
    • v.12D no.3 s.99
    • /
    • pp.481-492
    • /
    • 2005
  • To guide the guiding robot for the visually impaired carefully, the digital map to be used to search a path must be detailed and has some information about dangerous spots. It also has to search not only safe but also short path through the position data by GPS and INS sensors. In this paper, as the difference of the ability that the visually unpaired can recognize, we have developed the localization tracking system so that it can make a movement path and verify position information, and the global navigation system for the visually impaired using the GPS and INS. This system can be used when the visually impaired move short path relatively. We had also verified that the system was able to correct the position as the assistant navigation system of the GPS on the outside.

Implementation of Multiview Calibration System for An Effective 3D Display (효과적인 3차원 디스플레이를 위한 다시점 영상왜곡 보정처리 시스템 구현)

  • Bae Kyung-Hoon;Park Jae-Sung;Yi Dong-Sik;Kim Eun-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.1C
    • /
    • pp.36-45
    • /
    • 2006
  • In this paper, multiview calibration system for an effective 3D display is proposed. This system can be obtain 4-view image from multiview camera system. Also it can be rectify lens and camera distortion, error of bright and color, and it can be calibrate distortion of geometry. In this paper, we proposed the signal processing skill to calibrate the camera distortions which are able to take place from the acquisited multiview images. The discordance of the brightness and the colors are calibrated the color transform by extracting the feature point, correspondence point. And the difference of brightness is calibrated by using the differential map of brightness from each camera image. A spherical lens distortion is corrected by extracting the pattern of the multiview camera images. Finally the camera error and size among the multiview cameras is calibrated by removing the distortion. Accordingly, this proposed rectification & calibration system enable to effective 3D display and acquire natural multiview 3D image.

Dynamic Directory Table: On-Demand Allocation of Directory Entries for Active Shared Cache Blocks (동적 디렉터리 테이블 : 공유 캐시 블록의 디렉터리 엔트리 동적 할당)

  • Bae, Han Jun;Choi, Lynn
    • Journal of KIISE
    • /
    • v.44 no.12
    • /
    • pp.1245-1251
    • /
    • 2017
  • In this study we present a novel directory architecture that can dynamically allocate a directory entry for a cache block on demand at runtime only when the block is shared by more than one core. Thus, we do not maintain coherence for private blocks, substantially reducing the number of directory entries. Even for shared blocks, we allocate directory entry dynamically only when the block is actively shared, further reducing the number of directory entries at runtime. For this, we propose a new directory architecture called dynamic directory table (DDT), which is implemented as a cache of active directory entries. Through our detailed simulation on PARSEC benchmarks, we show that DDT can outperform the expensive full-map directory by a slight margin with only 17.84% of directory area across a variety of different workloads. This is achieved by its faster access and high hit rates in the small directory. In addition, we demonstrate that even smaller DDTs can give comparable or higher performance compared to recent directory optimization schemes such as SPACE and DGD with considerably less area.