A tolerant approach to reconstruct topology from unorganized trimmed surfaces

Presented in this paper is a topology reconstruction algorithm from a set of unorganized trimmed surfaces. Error-prone small geometric elements are handled to give proper topological information. It gives complete topology to topologically complete models, and it is also tolerant to incomplete models. The proposed algorithm is vertex-based in that clues for topological information are searched from the set of vertices first, not from that of edges.     

Robust adaptive spot segmentation of DNA microarray images

The rapid advancement of DNA chip (microarray) technology has revolutionalized genetic research in bioscience. However, the enormous amount of data produced from a microarray image makes automatic computer analysis indispensable. An important first step in analyzing microarray image is the accurate determination of the DNA spots in the image. We report here a novel spot segmentation method for DNA microarray images. The algorithm makes use of adaptive thresholding and statistical intensity modeling to: (i) generate the grid structure automatically, where each subregion in the grid contains only one spot, and (ii) to segment the spot, if any, within each subregion. The algorithm is fully automatic, robust, and can aid in the high throughput computer analysis of microarray data.     

Object representation and recognition in shape spaces

In this paper, we describe a shape space based approach for invariant object representation and recognition. In this approach, an object and all its similarity transformed versions are identified with a single point in a high-dimensional manifold called the shape space. Object recognition is achieved by measuring the geodesic distance between an observed object and a model in the shape space. This approach produced promising results in 2D object recognition experiments: it is invariant to similarity transformations and is relatively insensitive to noise and occlusion. Potentially, it can also be used for 3D object recognition.     

A new method for representing and matching shapes of natural objects

A new method for the representation and comparison of irregular two-dimensional shapes is presented. This method uses a polar transformation of the contour points about the geometric centre of the object. The distinctive vertices of the shape are extracted and used as comparative parameters to minimize the difference of contour distance from the centre. Experiments are performed, more than 39 000 comparisons of database shapes, provided by Sebastian et al. (ICCV (2001) 755), are made and the results are compared to those obtained therein. In addition, 450 comparisons of leaf shape are made and leaves of very similar shape are accurately distinguished. The method is shown to be invariant to translation, rotation and scaling and highly accurate in shape distinction. The method shows more tolerance to scale variation than that of Sebastian et al. (ICCV (2001) 755) and is less computationally intense.     

Data decomposition using independent component analysis with prior constraints

In many data analysis problems, it is useful to consider the data as generated from a set of unknown (latent) generators or sources. The observations we make of a system are then taken to be related to these sources through some unknown function. Furthermore, the (unknown) number of underlying latent sources may be less than the number of observations. Recent developments in independent component analysis (ICA) have shown that, in the case where the unknown function linking sources to observations is linear, such data decomposition may be achieved in a mathematically elegant manner. In this paper, we extend the general ICA paradigm to include a very flexible source model, prior constraints and conditioning on sets of intermediate variables so that ICA forms one part of a hierarchical system. We show that such an approach allows for efficient discovery of hidden representation in data and for unsupervised data partitioning.     

Topology preservation of template-based 6-subiteration reduction operations

Generally, a reduction operation (e.g., thinning and shrinking) on 3D binary images can be represented as a set of reduction templates where every object voxel of the image satisfying any template is turned to a background voxel. Generally, it is rather difficult, error-prone and time-consuming for verifying the topological soundness of a 3D parallel reduction operation. This paper proposes sufficient conditions of time complexity O(n) for verifying the topological soundness of 3D parallel 6-subiteration reduction operations of n templates where such a kind of 3D reduction operations is performed alternatively from the six orthogonal directions to turn object voxels to background voxels. By such sufficient conditions, the topology soundness of a 3D 6-subiteration parallel reduction operation can be verified by checking each and every of its templates.     

Authenticated encryption schemes with message linkages for message flows

Two efficient authenticated encryption schemes with message linkages are proposed. One is a basic scheme, that it has the better performance in comparison with the all previously proposed schemes in terms of the communication and the computation costs. However, it has a property as same as the previously proposed schemes, that the message blocks can be recovered only after the entire signature blocks have been received. Therefore, the basic scheme is applicable to encrypt all-or-nothing flow. Thus, we improve the basic scheme and also propose a generalized scheme, which allows the receiver to recover the partial message blocks before receiving the entire signature blocks. That is, the receiver may perform the receiving and the recovering processes simultaneously. Therefore, the generalized scheme is applicable to message flows. The generalized scheme requires smaller bandwidth and computational time as compared to the previously proposed authenticated encryption schemes with message linkages for message flows.     

How international is Computers and Composition?

In this article, I examine to what extent Computers and Composition: An International Journal for Teachers of Writing is international. My analysis of several aspects of the journal indicates limited international scope. I also discuss two issues important when considering the potential international scope of computers and writing research and practices: the differing uses of computers for writing by different language users and the differing concepts of identity and self in different cultures in relation to writing. I conclude with concrete suggestions for broadening our perspectives on computers and writing and making this journal truly international.