Restricting Scalability with Granularity

نویسنده

  • H. R. Schmidtke
چکیده

Granularity as described by Hobbs [5] is a parameter of context that restricts a) the available objects and b) the categories and properties for characterizing objects. Geographic spatial granularity is mainly determined by size, and surfaces in geography as scale-dependency. Goodchild [4] points out that one main specialty of geographic attributes is scale-specificity : A region that is assigned the attribute urban is linked to a specific scale. Zooming in on the region should result in details being displayed; the urban region dissolves into city blocks, parks, streets, etc. Zooming out, the region will disappear and an annotated dot will represent the city visually. Spatial information systems are often ignorant on issues of spatial granularity. Vector graphics are supposed to be arbitrarily scalable, and consequently arbitrarily exact. Geographic entities—as objects determined by approximative measurement—are therefore not accurately represented by data formats like vector graphics, if we cannot restrict scalability. Bennett [2] introduces a concept of forest as dependent on levels of granularity. The forest is a good example for a geographic entity which is not arbitrarily scalable: We may be uncertain about whether a certain given tree at the border of a forest still belongs to the forest, but it seems odd to ask whether a certain leaf on a tree belongs to the forest. An answer of common sense could be: yes, if the tree belongs to the forest; no, if not. The trees constitute the forest, and the region of the forest is derived from the locations of the trees. The common sense concepts of forest and tree depend on human object recognition: We know when we are in a forest. One could conclude that we know where the region of the forest is, because we obviously seem to know whether the region we occupy is inside the region of the forest. But do we then also know whether some arbitrarily small portion of space belongs to this region? Is a breach in the branches of a tree a hole in the forest? The two questions obviously contain an error in granularity which is closely linked to the scale-specificity of geographic information in general. We can decide whether a region of a given minimal grain size is inside the forest, but not whether a smaller region or even a point belongs to the region, because there is a procedure that determines the

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

ثبت نام

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

منابع مشابه

Fine-granularity spatially scalable video coding

In this paper, we proposed a novel architecture for spatially scalable video coding, namely, Fine-Granularity Spatially Scalable (FGSS) coding. The traditional layered spatially scalable coding provides only coarse scalability in which bit-stream can be decoded only at a few fixed resolution, but not something in between. The proposed FGSS scheme provides fine-granularity property to the spatia...

متن کامل

An Efficient Fine Granularity Scalable Coding Scheme Using Adaptive Leaky Prediction

In this paper, we propose a novel method, which makes use of the advantages of bit-plane coding technique of Fine Granularity Scalability (FGS) video coding scheme, and applies adaptive leaky factors for the enhancement layer prediction to further improve the coding efficiency. A flexible method that can dynamically determine the leaky factor values is also presented. Experimental results show ...

متن کامل

Dynamic fragmentation and query translation based security framework for distributed databases

The existing security models for distributed databases suffer from several drawbacks viz. tight coupling with the choice of database; lack of dynamism, granularity and flexibility; non scalability and vulnerability to intrusion attacks. There is a lack of an integrated flexible and interoperable security framework that can dynamically control access to table, row, column and field level data en...

متن کامل

Granularity of QoS Routing in MPLS Networks

This study investigates how the Constraint-based routing decision granularity signi cantly a ects the scalability and blocking performance of QoS routing in MPLS network. The coarse-grained granularity, such as per-destination, has lower storage and computational overheads but is only suitable for best-e ort traÆc. On the other hand, the negrained granularity, such as perow, provides lower bloc...

متن کامل

QoS Routing Granularity in MPLS Networks

This study investigates how constraint-based routing decision granularity significantly affects the scalability and blocking performance of QoS routing in an MPLS network. Coarse granularity, such as per-destination, has lower storage and computational overheads but is only suitable for best effort traffic. On the other hand, fine granularity, such as per-flow, provides lower blocking probabili...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2003