12537942
Deformable shape detection and description via model-based region grouping
A method for deformable shape detection and recognition is described. Deformable shape templates are used to partition the image into a globally consistent interpretation, determined in part by the minimum description length principle. Statistical shape models enforce the prior probabilities on global, parametric deformations for each object class. Once trained, the system autonomously segments deformed shapes from the background, while not merging them with adjacent objects or shadows. The formulation can be used to group image regions based on any image homogeneity predicate; e.g., texture, color or motion. The recovered shape models can be used directly in object recognition. Experiments with color imagery are reported.
32876579
Medical image segmentation and retrieval via deformable models
A new method based on deformable shape models for medical image segmentation is described. Experiments for blood cell micrographs have been conducted to verify the accuracy of the shape model-based segmentation and object shape description method. The cell segmentation method does not require user input for initialization. Coherence information between cells is utilized via a globally consistent cost function. The proposed segmentation method can be used in automated analysis for images of stained blood smear and segmentation of other medical structures. A method for shape population-based retrieval is also described. Results of population-based image queries for a database of blood cell micrographs are shown.
45704904
Automatic Deformable Shape Segmentation for Image Database Search Applications
A method for shape based image database indexing is described. Deformable shape templates are used to group color image regions into globally consistent configurations. A statistical shape model is used to enforce the prior probabilities on global, parametric deformations for each object class. The segmentation is determined in part by the minimum description length (MDL) principle. Once trained, the system autonomously segments deformed shapes from the background, while not merging them with adjacent objects or shadows. The formulation can be used to group image regions based on any image homogeneity predicate; e.g., texture, color, or motion. Preliminary experiments in color segmentation and shape-based retrieval are reported.
46350551
Adaptation Space: A Design Framework for Adaptive Web Services
5950046
A theory of Gaussian belief functions
Abstract A Gaussian belief function can be intuitively described as a Gaussian distribution over a hyperplane, whose parallel subhyperplanes are the focal elements. This paper elaborates on the idea of Dempster and Shafer and formally represents a Gaussian belief function as a wide-sense inner product and a linear functional over a variable space, and as their duals over a hyperplane in a sample space. By adapting Dempster's rule to the continuous case, it derives a rule of combination and proves its equivalence to its geometric description by Dempster. It illustrates by examples how mixed knowledge involving linear equations, multivariate Gaussian distributions, and partial ignorance can be represented and combined as Gaussian belief functions.
12726241
Automatic detection of fragments in dynamically generated web pages
Dividing web pages into fragments has been shown to provide significant benefits for both content generation and caching. In order for a web site to use fragment-based content generation, however, good methods are needed for dividing web pages into fragments. Manual fragmentation of web pages is expensive, error prone, and unscalable. This paper proposes a novel scheme to automatically detect and flag fragments that are cost-effective cache units in web sites serving dynamic content. We consider the fragments to be interesting if they are shared among multiple documents or they have different lifetime or personalization characteristics. Our approach has three unique features. First, we propose a hierarchical and fragment-aware model of the dynamic web pages and a data structure that is compact and effective for fragment detection. Second, we present an efficient algorithm to detect maximal fragments that are shared among multiple documents. Third, we develop a practical algorithm that effectively detects fragments based on their lifetime and personalization characteristics. We evaluate the proposed scheme through a series of experiments, showing the benefits and costs of the algorithms. We also study the impact of adopting the fragments detected by our system on disk space utilization and network bandwidth consumption.
8242993
Designing Web-Based Systems in Social Context: A Goal and Scenario Based Approach
In order to design a better web-based system, a designer would like to have notations to visualize how design experts’ know-how can be applied according to one’s specific social and technology situation. We propose the combined use of a goal-oriented language GRL and a scenarios-oriented notation UCM for representing design knowledge of web-based systems and information systems in general. Goals are used to depict business objectives, functional and non-functional system requirements. Tasks are used in the exploration of alternative technologies and their operationalizations into system constructs. Actors are used to do role-based analysis on social relationships. Scenarios are used to describe elaborated business processes or workflow. The approach is illustrated with an example of designing a web-based training system.
2470562
Stretch-based tetrahedral mesh manipulation
We present a novel least scaling distortion metric to measure the deformation distortion for tetrahedral meshes. The stretch-like metric is a combination of Jacobian matrix norm and tetrahedron volume and has the properties of good shape preservation and rotation invariance. Based on our metric, we propose a uniform non-linear optimization solution to a variety of tetrahedral mesh manipulation applications including shape deformation, interpolation, deformation transfer, and deformation learning. Our approach can produce volume preserving and flip free tetrahedral mesh results, which performs much better than the previous tetrahedral manipulation approaches. We also demonstrate an efficient and practical application using free-form deformation technique. The object is embedded in a rough control tetrahedral mesh and deformed by editing the tetrahedral mesh with various constraints. Each vertex of the object can be obtained by its barycentric coordinates according to its embedding tetrahedron of the control tetrahedral mesh.