• Title/Summary/Keyword: Overlapped Objects

Search Result 67, Processing Time 0.025 seconds

Object Tracking Using Template Based on Adaptive 3-Frame Difference (적응적 3 프레임 차분 방법 기반 템플릿을 이용한 객체 추적)

  • Kim, Hun-Ki;Lee, Jin-Hyung;Cho, Seong-Won;Chung, Sun-Tae;Kim, Jae-Min
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.3
    • /
    • pp.349-354
    • /
    • 2007
  • To generate the template of a detected object and to track the overlapped object and the object covered by other objects correctly are important research problems in visual surveillance. The frame difference is not capable of generating the template of slowly moving object. To get around the drawback of the conventional frame difference, we propose a new algorithm for generating a template using adaptive 3-frame difference.

Real-Time Monitoring and Buffering Strategy of Moving Object Databases on Cluster-based Distributed Computing Architecture (클러스터 기반 분산 컴퓨팅 구조에서의 이동 객체 데이타베이스의 실시간 모니터링과 버퍼링 기법)

  • Kim, Sang-Woo;Jeon, Se-Gil;Park, Seung-Yong;Lee, Chung-Woo;Hwang, Jae-Il;Nah, Yun-Mook
    • Journal of Korea Spatial Information System Society
    • /
    • v.8 no.2 s.17
    • /
    • pp.75-89
    • /
    • 2006
  • LBS (Location-Based Service) systems have become a serious subject for research and development since recent rapid advances in wireless communication technologies and position measurement technologies such as global positioning system. The architecture named the GALIS (Gracefully Aging Location Information System) has been suggested which is a cluster-based distributed computing system architecture to overcome performance losses and to efficiently handle a large volume of data, at least millions. The GALIS consists of SLDS and LLDS. The SLDS manages current location information of moving objects and the LLDS manages past location information of moving objects. In this thesis, we implement a monitoring technique for the GALIS prototype, to allow dynamic load balancing among multiple computing nodes by keeping track of the load of each node in real-time during the location data management and spatio-temporal query processing. We also propose a buffering technique which efficiently manages the query results having overlapped query regions to improve query processing performance of the GALIS. The proposed scheme reduces query processing time by eliminating unnecessary query execution on the overlapped regions with the previous queries.

  • PDF

Design and implementation of a time-based R-tree for indexing moving objects (이동체의 색인을 위한 시간 기반 R-트리의 설계 및 구현)

  • 전봉기;홍봉희
    • Journal of KIISE:Databases
    • /
    • v.30 no.3
    • /
    • pp.320-335
    • /
    • 2003
  • Location-Based Services(LBS) give rise to location-based queries of which results depend on the locations of moving objects. One of important applications of LBS is to examine tracks of continuously moving objects. Moving objects databases need to provide 3-dimensional indexing for efficiently processing range queries on the movement of continuously changing positions. An extension of the 2-dimensional R-tree to include time dimension shows low space utilization and poor search performance, because of high overlap of index nodes and their dead space. To solve these problems, we propose a new R-tree based indexing technique, namely TR-tree. To increase storage utilization, we assign more entries to the past node by using the unbalanced splitting policy. If two nodes are highly overlapped, these nodes are forcibly merged. It is the forced merging policy that reduces the dead space and the overlap of nodes. Since big line segments can also affect the overlap of index nodes to be increased, big line segments should be clipped by the clipping policy when splitting overfull nodes. The TR-tree outperforms the 3DR-tree and TB-tree in all experiments. Particularly, the storage utilization of the TR-tree is higher than the R-tree and R*-tree.

Implementation of Traditional Architectural Heritage Using Augmented Reality (증강현실을 이용한 건축문화유산 구현)

  • Lee, Kang-Hoon;Cho, Sae-Hong
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.1
    • /
    • pp.131-139
    • /
    • 2012
  • Many researches are actively doing for digital implementation of traditional architectural heritage using multimedia and virtual reality technologies. In addition, various attempts are progressed to utilize the digitally implemented traditional architectural heritage as "contents." Nowadays, the digitally implemented traditional architectural heritage can be displayed on through the Internet and/or many multimedia appliances by these attempts. Recently, virtual reality technology, especially augmented reality technology, begins to grab the attention for digitally implementing architectural heritage. Augmented reality is a technology that makes possible to show the overlapped contents by piling up the virtual objects on the real world. Many studies for augmented reality are progressed because it has an advantage in interacting with virtual objects and information. This study proposes the method of digital implementation of traditional architectural heritage by using augmented reality technology. We presented the method and process of digital implementation of traditional architectural heritage with augmented reality technology. Moreover, digitally implemented traditional architectural heritage with augmented reality is compared with the contents implemented by other computer technologies. We, also, presented how to utilize the traditional architectural heritage contents by using augmented reality.

An Efficient Processing of Continuous Range Queries on High-Dimensional Spatial Data (고차원 공간 데이터를 위한 연속 범위 질의의 효율적인 처리)

  • Jang, Su-Min;Yoo, Jae-Soo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.6
    • /
    • pp.397-401
    • /
    • 2007
  • Recent applications on continuous queries on moving objects are extended quickly to various parts. These applications need not only 2-dimensional space data but also high-dimensional space data. If we use previous index for overlapped continuous range queries on high-dimensional space data, as the number of continuous range queries on a large number of moving objects becomes larger, their performance degrades significantly. We focus on stationary queries, non-exponential increase of storage cost and efficient processing time for large data sets. In this paper, to solve these problems, we present a novel query indexing method, denoted as PAB(Projected Attribute Bit)-based query index. We transfer information of high-dimensional continuous range query on each axis into one-dimensional bit lists by projecting technique. Also proposed query index supports incremental update for efficient query processing. Through various experiments, we show that our method outperforms the CES(containment-encoded squares)-based indexing method which is one of the most recent research.

Interactive Colision Detection for Deformable Models using Streaming AABBs

  • Zhang, Xinyu;Kim, Young-J.
    • 한국HCI학회:학술대회논문집
    • /
    • 2007.02c
    • /
    • pp.306-317
    • /
    • 2007
  • We present an interactive and accurate collision detection algorithm for deformable, polygonal objects based on the streaming computational model. Our algorithm can detect all possible pairwise primitive-level intersections between two severely deforming models at highly interactive rates. In our streaming computational model, we consider a set of axis aligned bounding boxes (AABBs) that bound each of the given deformable objects as an input stream and perform massively-parallel pairwise, overlapping tests onto the incoming streams. As a result, we are able to prevent performance stalls in the streaming pipeline that can be caused by expensive indexing mechanism required by bounding volume hierarchy-based streaming algorithms. At run-time, as the underlying models deform over time, we employ a novel, streaming algorithm to update the geometric changes in the AABB streams. Moreover, in order to get only the computed result (i.e., collision results between AABBs) without reading back the entire output streams, we propose a streaming en/decoding strategy that can be performed in a hierarchical fashion. After determining overlapped AABBs, we perform a primitive-level (e.g., triangle) intersection checking on a serial computational model such as CPUs. We implemented the entire pipeline of our algorithm using off-the-shelf graphics processors (GPUs), such as nVIDIA GeForce 7800 GTX, for streaming computations, and Intel Dual Core 3.4G processors for serial computations. We benchmarked our algorithm with different models of varying complexities, ranging from 15K up to 50K triangles, under various deformation motions, and the timings were obtained as 30~100 FPS depending on the complexity of models and their relative configurations. Finally, we made comparisons with a well-known GPU-based collision detection algorithm, CULLIDE [4] and observed about three times performance improvement over the earlier approach. We also made comparisons with a SW-based AABB culling algorithm [2] and observed about two times improvement.

  • PDF

Object Tracking Framework of Video Surveillance System based on Non-overlapping Multi-camera (비겹침 다중 IP 카메라 기반 영상감시시스템의 객체추적 프레임워크)

  • Han, Min-Ho;Park, Su-Wan;Han, Jong-Wook
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.21 no.6
    • /
    • pp.141-152
    • /
    • 2011
  • Growing efforts and interests of security techniques in a diverse surveillance environment, the intelligent surveillance system, which is capable of automatically detecting and tracking target objects in multi-cameras environment, is actively developing in a security community. In this paper, we propose an effective visual surveillance system that is avaliable to track objects continuously in multiple non-overlapped cameras. The proposed object tracking scheme consists of object tracking module and tracking management module, which are based on hand-off scheme and protocol. The object tracking module, runs on IP camera, provides object tracking information generation, object tracking information distribution and similarity comparison function. On the other hand, the tracking management module, runs on video control server, provides realtime object tracking reception, object tracking information retrieval and IP camera control functions. The proposed object tracking scheme allows comprehensive framework that can be used in a diverse range of application, because it doesn't rely on the particular surveillance system or object tracking techniques.

Testing the Consistency of Unified Scheme of Seyfert Galaxies

  • Iyida, Evaristus U.;Eya, Innocent O.;Eze, Christian I.
    • Journal of Astronomy and Space Sciences
    • /
    • v.39 no.2
    • /
    • pp.43-50
    • /
    • 2022
  • The unified scheme of Seyfert galaxies hypothesizes that the observed differences between the two categories of Seyfert galaxies, type 1 (Sy1) and type 2 (Sy2) are merely due to the difference in the orientation of the toroidal shape of the obscuring material in the active galactic nuclei. We used in this paper, a sample consisting of 120 Seyfert galaxies at 1.40 × 109 Hz in radio, 2.52 × 1017 Hz in X-ray and 2.52 × 1023 Hz in γ-ray luminosities observed by the Fermi Large Area Telescope (Fermi-LAT) in order to test the unified scheme of radio-quiet Seyfert galaxies. Our main results are as follows: (i) We found that the distributions of multiwave luminosities (Lradio, LX-ray, and Lγ-ray) of Sy1 and Sy2 are completely overlapped with up to a factor of 4. The principal component analysis result reveals that Sy1 and Sy2 also occupy the same parameter spaces, which agrees with the notion that Sy1 and Sy2 are the same class objects. A Kolmogorov-Smirnov test performed on the sub-samples indicates that the null hypothesis (both are from the same population) cannot be rejected with chance probability p ~ 0 and separation distance K = 0.013. This result supports the fact that there is no statistical difference between the properties of Sy1 and Sy2 (ii) We found that the coefficient of the best-fit linear regression equation between the common properties of Sy1 and Sy2 is significant (r > 0.50) which plausibly implies that Sy1 and Sy2 are the same type of objects observed at different viewing angle.

Algorithmic Proposal of Optimal Loading Pattern and Obstacle-Avoidance Trajectory Generation for Robot Palletizing Simulator (로봇 팔레타이징 시뮬레이터를 위한 적재 패턴 생성 및 시변 장애물 회피 알고리즘의 제안)

  • Yu, Seung-Nam;Lim, Sung-Jin;Kim, Sung-Rak;Han, Chang-Soo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.13 no.11
    • /
    • pp.1137-1145
    • /
    • 2007
  • Palletizing tasks are necessary to promote efficient storage and shipping of boxed products. These tasks, however, involve some of the most monotonous and physically demanding labor in the factory. Thus, many types of robot palletizing systems have been developed, although many robot motion commands still depend on the teach pendant. That is, the operator inputs the motion command lines one by one. This is very troublesome and, most importantly, the user must know how to type the code. We propose a new GUI(Graphic User Interface) for the palletizing system that is more convenient. To do this, we used the PLP "Fast Algorithm" and 3-D auto-patterning visualization. The 3-D patterning process includes the following steps. First, an operator can identify the results of the task and edit them. Second, the operator passes the position values of objects to a robot simulator. Using those positions, a palletizing operation can be simulated. We chose a widely used industrial model and analyzed the kinematics and dynamics to create a robot simulator. In this paper we propose a 3-D patterning algorithm, 3-D robot-palletizing simulator, and modified trajectory generation algorithm, an "overlapped method" to reduce the computing load.

Tracking and Face Recognition of Multiple People Based on GMM, LKT and PCA

  • Lee, Won-Oh;Park, Young-Ho;Lee, Eui-Chul;Lee, Hee-Kyung;Park, Kang-Ryoung
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.4
    • /
    • pp.449-471
    • /
    • 2012
  • In intelligent surveillance systems, it is required to robustly track multiple people. Most of the previous studies adopted a Gaussian mixture model (GMM) for discriminating the object from the background. However, it has a weakness that its performance is affected by illumination variations and shadow regions can be merged with the object. And when two foreground objects overlap, the GMM method cannot correctly discriminate the occluded regions. To overcome these problems, we propose a new method of tracking and identifying multiple people. The proposed research is novel in the following three ways compared to previous research: First, the illuminative variations and shadow regions are reduced by an illumination normalization based on the median and inverse filtering of the L*a*b* image. Second, the multiple occluded and overlapped people are tracked by combining the GMM in the still image and the Lucas-Kanade-Tomasi (LKT) method in successive images. Third, with the proposed human tracking and the existing face detection & recognition methods, the tracked multiple people are successfully identified. The experimental results show that the proposed method could track and recognize multiple people with accuracy.