Graph-Based Object Hypothesis

نویسندگان

  • Steven Mills
  • Kevin L. Novins
چکیده

Reasoning about three-dimensional scenes involves the analysis of large amounts of complex, time-varying information. This paper presents a novel representation for storing such information that provides a unified, intuitive framework for reasoning about rigid objects. The core structure is a graph that represents features of the scene as vertices, and stores distances between these features at the edges. These relationships evolve over time, as more information is presented to the system, and an approach to dealing with uncertain information using interval arithmetic is proposed. An algorithm for rigid object extraction is presented, based on this graph. The graph structure can also be used in support of some low-level tasks, and the problem of tracking three-dimensional features is considered. Results are presented for both artificial and real scenes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Method for Characterization of Biological Particles in Microscopic Videos: Hypothesis Testing Based on a Combination of Stochastic Modeling and Graph Theory

Introduction Studying motility of biological objects is an important parameter in many biomedical processes. Therefore, automated analyzing methods via microscopic videos are becoming an important step in recent researches. Materials and Methods In the proposed method of this article, a hypothesis testing function is defined to separate biological particles from artifact and noise in captured v...

متن کامل

A comparative performance of gray level image thresholding using normalized graph cut based standard S membership function

In this research paper, we use a normalized graph cut measure as a thresholding principle to separate an object from the background based on the standard S membership function. The implementation of the proposed algorithm known as fuzzy normalized graph cut method. This proposed algorithm compared with the fuzzy entropy method [25], Kittler [11], Rosin [21], Sauvola [23] and Wolf [33] method. M...

متن کامل

Marker-less Vision Based Tracking for Mobile Augmented Reality

In this paper an object recognition and tracking approach for the mobile, marker-less and PDA-based augmented reality system AR-PDA is described. For object recognition and localization 2D features are extracted from images and compared with a priori known 3D models. The system consists of a 2D graph matching, 3D hypothesis generation and validation and an additional texture based val-

متن کامل

Coarse-to-Fine Object Recognition Using Shock Graphs

Shock graphs have emerged as a powerful generic 2-D shape representation. However, most approaches typically assume that the silhouette has been correctly segmented. In this paper, we present a framework for shock graph-based object recognition in less contrived scenes. The approach consists of two steps, beginning with the construction of a region adjacency graph pyramid. For a given region, w...

متن کامل

Tracking with Graph Cuts: Treating Clutter with Adaptive Penalties

Many techniques for tracking based on gradient descent cannot follow objects as they undergo large movements or deformation. On the other hand, multi-hypothesis trackers capable of handling such behavior are computationally expensive. The standard graph cut technique offers a middle ground, quickly capturing objects anywhere in the image; however, because of its global nature, it is prone to ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999