This paper analyzes the problem of shape modeling using the principle of active geometric deformable models. While the basic modeling technique already exists in the literature, we highlight many of its drawbacks and discuss their source and steps to overcome them. We propose a new stopping criterion to address the stopping problem. We also propose to apply a level set algorithm to implement th...

Statistical Geometric Features (SGF) have recently been proposed for the classification of image textures. The SGF method is easily extended to use other geometric properties of connected regions. Following a brief review of the method, we propose such an extension to the set of SGF features for the purpose of classifying cervical cell textures. The resulting method proves to be as powerful as ...

background: gold nanoparticles (gnps) have been shown as a good radiosensitizer. in combination with radiotherapy, several studies with orthovoltage x-rays have shown considerable dose enhancement effects. this paper reports the dose enhancement factor (def) due to gnps in 18 megavoltage (mv) beams. materials and methods: different geometrical 50-nm gnps configurations at a concentration of 5 m...

This paper presents an approach tomodel the solvent-excluded surface (SES) of 3D protein molecular structures using the geometric PDE-based level-set method. The level-set method embeds the shape of 3D molecular objects as an isosurface or level set corresponding to some isovalue of a scattered dense scalar field, which is saved as a discretely-sampled, rectilinear grid, i.e., a volumetric grid...

In this paper, we consider saliency detection problems from a unique perspective. We provide an implicit representation for the saliency map using level set evolution (LSE), and then combine LSE approach with energy functional minimization (EFM). Instead of introducing sophisticated segmentation procedures, we propose a flexible and lightweight LSE-EFM framework for saliency detection. The expe...

In many applications it is necessary to track a moving and deforming boundary on the plane from infrequent, sparse measurements. For instance, each of a set of mobile observers may be able to tell the position of a point on the boundary. Often boundary components split, merge, appear, and disappear over time. Data are typically sparse and noisy and the underlying dynamics is uncertain. To addre...

Traditional texture mapping uses sampled images of limited resolution to represent patterns on surfaces. Sampling inherently assumes that the underlying pattern is band limited, which in plain language means that it must not contain any crisp edges. Unfortunately, most real world patterns violate that constraint, and the result is that texture mapped surfaces appear either artificially pixelate...

tetrazole-containing compounds have been the subject of much recent research because of theirpotential as high energy density materials (hedms). in this work, theoretical studies on the 1htetrazolylderivatives of tetrahedrane were done at the density functional theory (dft) method withthe 6-31g(d) basis set without any symmetrical restrictions in order to find the structural andenergetically pr...

We study a generalization of the Set Cover problem called the Partial Set Cover in the context of geometric set systems. The input to this problem is a set system (X ,S), where X is a set of elements and S is a collection of subsets of X , and an integer k ≤ |X |. The goal is to cover at least k elements of X by using a minimum-weight collection of sets from S. In the geometric version, X typic...

We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of points that hit all geometric objects. The problem is known to be strongly NP-hard even for simple geometric objects like unit disks in the plane. Therefore, unless P=NP, it is not possible to get Fully Polynomial Time ...