Web searches for a specific topic can result in multiple document references for the topic, where information on the
topic is redundantly presented across the document set. This can make it difficult for the user to locate a unique piece of
information from the document set, or to comprehend the full scope of the information, without examining one
document after another in the hope of discovering that new or interesting fact. Summarization techniques reduce the
redundancy but often at the cost of information loss. Aggregation is difficult and may present information out of
context. This paper presents a method for navigating the document set such that the facts or concepts and their
redundant presentations are identified. The user can gain an overview of the concepts, and can locate where they are
presented. The user can then view a desired concept as presented in the context of the document of choice. The
approach also allows the user to move from concept to concept apart from the sequence of any one particular document.
Navigation is accomplished via a graph structure in which redundant material is grouped into nodes. Sequential material
unique to a document can also be clustered into a node for a more compact graph representation. Methods for
identification of redundant content and for the construction of the navigation graph are discussed.
In order to present most XML documents for human consumption, formatting information must be introduced and
applied. Formatting is typically done through a style sheet, however, it is conceivable that one could wish to view the
document without having a style sheet (either because a style sheet does not exist, or is unavailable, or is inappropriate
for the display device). This paper describes a method for formatting structured documents without a provided style
sheet. The idea is to first analyze the document to determine structures and features that might be relevant to style
decisions. A transformation can be constructed to convert the original document to a generic form that captures the
semantics that will be expressed through formatting and style. In the second stage styling is applied to the structures and
features that have been discovered by applying a pre-defined style sheet for the generic form. The document instance,
and if available, the corresponding schema or DTD can be analyzed in order to construct the transformation. This paper
will describe the generic form used for formatting and techniques for generating transformations to it.
With the dynamic generation of documents and their presentation on various output devices, it is valuable to automatically adjust their layout and style. Measures for layout desirability have typically focused on document aesthetics (making the document look good). But other values are also important. This paper explores measures for the effectiveness with which style and layout convey the document's logical structure. This primarily contributes to the document's ease of use. The measures described are the group identity, separability and distinguishablity of elements. These measures are defined as combinations of simpler, properties that are practical to calculate.
Several improved algorithms to map color information to color or black texture are introduced. The new algorithms are based on pattern mixing and halftoning. The detailed algorithms are described along with the comparative analysis of their implementation. The analysis and the experiment result show that the halftone based algorithms described in this paper have advantages over the pattern mixing algorithm.
Color error diffusion can be classified into two types, namely, vector error diffusion and scalar error diffusion, according to the underlying quantization methods. Compared to scalar error diffusion, vector error diffusion is superior in image quality. However, it requires significantly more computation, and can introduce artifacts due to accumulation of the errors in output device space. In this paper, we propose a new quantization algorithm for CMY color error diffusion. The algorithm, which we call semi- vector quantization, has a low computational complexity and a high stability as similar to scalar error diffusion, but yields superb quality images close to those generated from vector error diffusion.
When a full-color document is printed on a black-and-white printer (such as when producing black-and-white handouts for a talk that uses colored slides) there can be a substantial loss of information. Usually the colors are mapped to shades of gray according to their luminance. This is fairly effective in the case of pictorial images where most of the useful information is in the luminance channel, but can be less successful for graphical images where hue and saturation may play a more important role. One way to preserve more of the color information is to map colors into visible textures. This paper describes an algorithmic method of performing such a mapping. The technique is an extension of halftoning and produces a binary bitmap for the image. The method accepts and processes any color value, mapping similar colors to similar textures. The texture patterns can be designed so as to preserve the luminance of their corresponding color. Decisions are made locally on a pixel basis, allowing the textured binary image to be incrementally constructed or modified.
In black-and-white printing the page image can be represented within a computer as an array of binary values indicating whether or not pixels should be inked. The Boolean operators of AND, OR, and EXCLUSIVE-OR are often used when adding new objects to the image array. For color printing the page may be
represented as an array of "continuous-tone" color values, and the generalization of these logic functions to gray-scale or full-color images is, in general, not defined or understood. When incrementally
composing a page image, new colors can replace old in an image buffer, or new colors and old can be combined according to some mixing function to form a composite color, which is stored. This paper examines the properties of the Boolean operations and suggests
full-color functions thatpreserve the desired properties. These functions can be used to combine colored images in ways that preserve information about object shapes when the shapes overlap.
The relationships between the proposed functions and physical models of color mixing are also discussed.
In black-and-white printing the page image can be represented within a computer as an array of binary values
indicating whether or not pixels should be inked. The Boolean operators ofAND, OR, and EXCLUSIVE-OR are
often used when adding new objects to the image array. For color printing the page may be represented as an
array of "continuous tone" color values, and the generalization of these logic functions to gray-scale or full-color
images is, in general, not defined or understood. When incrementally composing a page image new colors can
replace old in an image buffer, or new colors and old can be combined according to some mixing function to form a
composite color which is stored. This paper examines the properties of the Boolean operations and suggests fullcolor
mixing functions which preserve the desired properties. These functions can be used to combine colored
images, giving various transparency effects. The relationships between the mixing functions and physical
models of color mixing are also discussed.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.