• 제목/요약/키워드: Moving Objects Data Model

검색결과 72건 처리시간 0.023초

Development of Prototype and Model about the Moving Picture Searching System based on MPEG-7 and KEM (MPEG-7과 KEM 기반의 동영상 검색 시스템 모델 및 프로토타입의 개발)

  • Choe, HyunJong
    • The Journal of Korean Association of Computer Education
    • /
    • 제12권3호
    • /
    • pp.75-83
    • /
    • 2009
  • Moving picture has become the important media in education with expanded e-learning paradigm, but Korea Educational Metadata has limitation about representing information of lots of events and objects in moving picture. Announcing the MPEG-7 specification the information of lots of events and objects in it can be presented in terms of semantic and structural description of moving pictures. In this paper moving picture searching system model that integrates two metadata specifications, such as KEM and MPEG-7, is proposed. In this model one ontology to combine two metadata specifications is designed, and the other ontology about knowledge of a subject matter is added to search efficiently in searching system. As some moving picture data from Edunet were selected and stored in our server, our prototype of searching system using MPEG-7 and KEM shows the results that we are expected.

  • PDF

Estimation of Uncertain Moving Object Location Data

  • Ahn Yoon-Ae;Lee Do-Yeol;Hwang Ho-Young
    • Journal of the Korea Computer Industry Society
    • /
    • 제6권3호
    • /
    • pp.495-508
    • /
    • 2005
  • Moving objects are spatiotemporal data that change their location or shape continuously over time. Their location coordinates are periodically measured and stored i3l the application systems. The linear function is mainly used to estimate the location information that is not in the system at the query time point. However, a new method is needed to improve uncertainties of the location representation, because the location estimation by linear function induces the estimation error. This paper proposes an application method of the cubic spline interpolation in order to reduce deviation of the location estimation by linear function. First, we define location information of the moving object on the two-dimensional space. Next, we apply the cubic spline interpolation to location estimation of the proposed data model and describe algorithm of the estimation operation. Finally, the precision of this estimation operation model is experimented. The experimentation comes out more accurate results than the method by linear function.

  • PDF

Analysis of Human Spatial Behavior with GPS and Visual OLAP Technology (GPS와 시각적 OLAP 기술을 이용한 공간행태분석 연구)

  • Cho, Jae-Hee;Seo, Il-Jung
    • Information Systems Review
    • /
    • 제11권1호
    • /
    • pp.181-196
    • /
    • 2009
  • New domains in the analysis of the behavior of moving objects, particularly within human social settings, are generating research interest due to significant advances in the accuracy and production cost of global positioning system (GPS) devices. However, although potential applications have been described in multiple research areas, practical and viable business implementations of GPS technology remain challenging. This paper combines the potential of GPS capabilities with the analytical power of OLAP and data visualization to examine data on the movements of visitors in a zoological garden. Based on this example, the benefits and limitations of the application of GPS technology to the analysis of human spatial behavior are discussed.

A Study on Kohenen Network based on Path Determination for Efficient Moving Trajectory on Mobile Robot

  • Jin, Tae-Seok;Tack, HanHo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제10권2호
    • /
    • pp.101-106
    • /
    • 2010
  • We propose an approach to estimate the real-time moving trajectory of an object in this paper. The object's position is obtained from the image data of a CCD camera, while a state estimator predicts the linear and angular velocities of the moving object. To overcome the uncertainties and noises residing in the input data, a Extended Kalman Filter(EKF) and neural networks are utilized cooperatively. Since the EKF needs to approximate a nonlinear system into a linear model in order to estimate the states, there still exist errors as well as uncertainties. To resolve this problem, in this approach the Kohonen networks, which have a high adaptability to the memory of the inputoutput relationship, are utilized for the nonlinear region. In addition to this, the Kohonen network, as a sort of neural network, can effectively adapt to the dynamic variations and become robust against noises. This approach is derived from the observation that the Kohonen network is a type of self-organized map and is spatially oriented, which makes it suitable for determining the trajectories of moving objects. The superiority of the proposed algorithm compared with the EKF is demonstrated through real experiments.

Multidimensional Model for Spatiotemporal Data Analysis and Its Visual Representation (시공간데이터 분석을 위한 다차원 모델과 시각적 표현에 관한 연구)

  • Cho Jae-Hee;Seo Il-Jung
    • Journal of Information Technology Applications and Management
    • /
    • 제13권1호
    • /
    • pp.137-147
    • /
    • 2006
  • Spatiotemporal data are records of the spatial changes of moving objects over time. Most data in corporate databases have a spatiotemporal nature, but they are typically treated as merely descriptive semantic data without considering their potential visual (or cartographic) representation. Businesses such as geographical CRM, location-based services, and technologies like GPS and RFID depend on the storage and analysis of spatiotemporal data. Effectively handling the data analysis process may be accomplished through spatiotemporal data warehouse and spatial OLAP. This paper proposes a multidimensional model for spatiotemporal data analysis, and cartographically represents the results of the analysis.

  • PDF

Formal Representation and Query for Digital Contents Data

  • Khamis, Khamis Abdul-Latif;Song, Huazhu;Zhong, Xian
    • Journal of Information Processing Systems
    • /
    • 제16권2호
    • /
    • pp.261-276
    • /
    • 2020
  • Digital contents services are one of the topics that have been intensively studied in the media industry, where various semantic and ontology techniques are applied. However, query execution for ontology data is still inefficient, lack of sufficient extensible definitions for node relationships, and there is no specific semantic method fit for media data representation. In order to make the machine understand digital contents (DCs) data well, we analyze DCs data, including static data and dynamic data, and use ontology to specify and classify objects and the events of the particular objects. Then the formal representation method is proposed which not only redefines DCs data based on the technology of OWL/RDF, but is also combined with media segmentation methods. At the same time, to speed up the access mechanism of DCs data stored under the persistent database, an ontology-based DCs query solution is proposed, which uses the specified distance vector associated to a surveillance of semantic label (annotation) to detect and track a moving or static object.

Codebook-Based Foreground Extraction Algorithm with Continuous Learning of Background (연속적인 배경 모델 학습을 이용한 코드북 기반의 전경 추출 알고리즘)

  • Jung, Jae-Young
    • Journal of Digital Contents Society
    • /
    • 제15권4호
    • /
    • pp.449-455
    • /
    • 2014
  • Detection of moving objects is a fundamental task in most of the computer vision applications, such as video surveillance, activity recognition and human motion analysis. This is a difficult task due to many challenges in realistic scenarios which include irregular motion in background, illumination changes, objects cast shadows, changes in scene geometry and noise, etc. In this paper, we propose an foreground extraction algorithm based on codebook, a database of information about background pixel obtained from input image sequence. Initially, we suppose a first frame as a background image and calculate difference between next input image and it to detect moving objects. The resulting difference image may contain noises as well as pure moving objects. Second, we investigate a codebook with color and brightness of a foreground pixel in the difference image. If it is matched, it is decided as a fault detected pixel and deleted from foreground. Finally, a background image is updated to process next input frame iteratively. Some pixels are estimated by input image if they are detected as background pixels. The others are duplicated from the previous background image. We apply out algorithm to PETS2009 data and compare the results with those of GMM and standard codebook algorithms.

Moving Object Detection Using Sparse Approximation and Sparse Coding Migration

  • Li, Shufang;Hu, Zhengping;Zhao, Mengyao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권5호
    • /
    • pp.2141-2155
    • /
    • 2020
  • In order to meet the requirements of background change, illumination variation, moving shadow interference and high accuracy in object detection of moving camera, and strive for real-time and high efficiency, this paper presents an object detection algorithm based on sparse approximation recursion and sparse coding migration in subspace. First, low-rank sparse decomposition is used to reduce the dimension of the data. Combining with dictionary sparse representation, the computational model is established by the recursive formula of sparse approximation with the video sequences taken as subspace sets. And the moving object is calculated by the background difference method, which effectively reduces the computational complexity and running time. According to the idea of sparse coding migration, the above operations are carried out in the down-sampling space to further reduce the requirements of computational complexity and memory storage, and this will be adapt to multi-scale target objects and overcome the impact of large anomaly areas. Finally, experiments are carried out on VDAO datasets containing 59 sets of videos. The experimental results show that the algorithm can detect moving object effectively in the moving camera with uniform speed, not only in terms of low computational complexity but also in terms of low storage requirements, so that our proposed algorithm is suitable for detection systems with high real-time requirements.

PROFILE MANAGEMENT FOR MOVING OBJECTS

  • Kim, Jae-Chul;Lee, Seong-Ho;Park, Jong-Hyun
    • Proceedings of the KSRS Conference
    • /
    • 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
    • /
    • pp.81-84
    • /
    • 2007
  • In this research, we will accomplish the investigation of the devices and data models which are used in the existing indoor and outdoor systems. Based on the investigation, we will seize the additional requirements for the integration of the legacy system and then we will propose the various methods which support the additional requirements. By applying the various methods in the heterogeneous environments, we will solve the legacy problems and propose the methods for the final goal that is to provide the seamless moving object tracking. The scope of this research is to propose the integration methods, developing the actual location tracking system model without modifying the legacy infrastructures.

  • PDF

Moving Object Trajectory based on Kohenen Network for Efficient Navigation of Mobile Robot

  • Jin, Tae-Seok
    • Journal of information and communication convergence engineering
    • /
    • 제7권2호
    • /
    • pp.119-124
    • /
    • 2009
  • In this paper, we propose a novel approach to estimating the real-time moving trajectory of an object is proposed in this paper. The object's position is obtained from the image data of a CCD camera, while a state estimator predicts the linear and angular velocities of the moving object. To overcome the uncertainties and noises residing in the input data, a Extended Kalman Filter(EKF) and neural networks are utilized cooperatively. Since the EKF needs to approximate a nonlinear system into a linear model in order to estimate the states, there still exist errors as well as uncertainties. To resolve this problem, in this approach the Kohonen networks, which have a high adaptability to the memory of the input-output relationship, are utilized for the nonlinear region. In addition to this, the Kohonen network, as a sort of neural network, can effectively adapt to the dynamic variations and become robust against noises. This approach is derived from the observation that the Kohonen network is a type of self-organized map and is spatially oriented, which makes it suitable for determining the trajectories of moving objects. The superiority of the proposed algorithm compared with the EKF is demonstrated through real experiments.