arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0311051cs.AI
收藏

整合现有的圆锥形和基于投影的基本方向关系和TCSP类可判定推广

Integrating existing cone-shaped and projection-based cardinal direction relations and a TCSP-like decidable generalisation

Amar Isli

摘要:

我们认为现有的锥形和投影为基础的结石的基本方向关系,众所周知的QSR的整合。我们考虑的更一般的集成语言基于定性形式$r(x,y)$的凸约束,$r$是锥形或基于投影的基本方向原子关系,或者基于定量形式$(α,β)(x,y)$的凸约束,具有$α,β\in [0,2π)$和$(β-α)\in [0,π]$:具体地,定量约束的含义是点$x$属于以$y$为根的(凸)锥形区域,并以角度$α$和$β$为界。约束的一般形式是$[r_1\vee...\vee r_{n_1}\vee (α_1,β_1)\vee...\vee (α_{n_2},β_{n_2})](x,y)$形式的析取,其中$r_i(x,y)$、$i=1... n_1$和$(α_i,β_i)(x,y)$、$i=1... n_2$是如上所述的凸约束:这种一般约束的含义是,对于某些$i=1... n_1$,$r_i(x,y)$成立,或者对于某些$i=1... n_2$,$(α_i,β_i)(x,y)$成立。这样的一般约束的结合是类似$\tcsp$的CSP,我们将其称为$\scsp$(空间约束满足问题)。将描述用于$\scsp$的有效解搜索算法,其使用(1)基于要定义的合成运算的约束传播作为搜索期间的过滤方法,以及(2)在搜索树的叶子处保证完整性的单纯形算法。该方法特别适合于大规模的高级视觉,例如,对一个地理区域进行类似卫星的监视。

英文摘要:

We consider the integration of existing cone-shaped and projection-based calculi of cardinal direction relations, well-known in QSR. The more general, integrating language we consider is based on convex constraints of the qualitative form $r(x,y)$, $r$ being a cone-shaped or projection-based cardinal direction atomic relation, or of the quantitative form $(α,β)(x,y)$, with $α,β\in [0,2π)$ and $(β-α)\in [0,π]$: the meaning of the quantitative constraint, in particular, is that point $x$ belongs to the (convex) cone-shaped area rooted at $y$, and bounded by angles $α$ and $β$. The general form of a constraint is a disjunction of the form $[r_1\vee...\vee r_{n_1}\vee (α_1,β_1)\vee...\vee (α_{n_2},β_{n_2})](x,y)$, with $r_i(x,y)$, $i=1... n_1$, and $(α_i,β_i)(x,y)$, $i=1... n_2$, being convex constraints as described above: the meaning of such a general constraint is that, for some $i=1... n_1$, $r_i(x,y)$ holds, or, for some $i=1... n_2$, $(α_i,β_i)(x,y)$ holds. A conjunction of such general constraints is a $\tcsp$-like CSP, which we will refer to as an $\scsp$ (Spatial Constraint Satisfaction Problem). An effective solution search algorithm for an $\scsp$ will be described, which uses (1) constraint propagation, based on a composition operation to be defined, as the filtering method during the search, and (2) the Simplex algorithm, guaranteeing completeness, at the leaves of the search tree. The approach is particularly suited for large-scale high-level vision, such as, e.g., satellite-like surveillance of a geographic area.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑