8330560
Shape Comparison of the Hippocampus Using a Multiresolution Representation and ICP Normalization
It is known that deformation of the hippocampus shape is involved with several neurological diseases. In this paper, we propose a hybrid shape representation scheme, which consists of multiresolution skeletons, voxels and meshes for the shape analysis of the hippocampus. Initially, a hippocampal surface model is reconstructed from MRI and then it is placed into a canonical coordinate system, where the position, orientation and scaling are normalized. From the voxel representation of the hippocampus, multiresolution skeletons are extracted and Iterative Closest Point normalization is carried out. Then the shape similarity of two hippocampal models is computed with a hierarchical fashion. In addition, we have implemented a neural network based classifier to discriminate whether a hippocampal model is normal or not. Results indicate that the proposed hybrid representation and the skeleton-based normalization using ICP are very effective in 3D shape analysis of the hippocampus.
33372839
3-D Facial Expression Recognition-Synthesis on PDA Incorporating Emotional Timing
This paper describes a pipeline by which facial expression of the face is recognized and then 3-D facial animation is synthesized in the remote place based upon timing information of the facial. The system first detects a facial area within the given image and then classifies its facial expression into 7 emotional weightings. Such weighting information, transmitted to the PDA via a mobile network, is used for non-photorealistic facial expression animation. A cartoon-like shading is used to render a 3-D avatar that conveys a familiar and yet unique facial character, even without employing extensive polygons. It turns out that facial expression animation using emotional curves is more effective in expressing the timing of an expression comparing to the linear interpolation method. The emotional avatar embedded on a mobile platform has some potential in conveying emotion between peoples in Internet.
43684392
Wavelet Analysis Based Blind Watermarking for 3-D Surface Meshes
As most previous wavelet analysis based 3-D mesh watermarking methods embed the watermark information into wavelet coefficients arranged in a certain order, they have not been used as blind schemes since the connectivity information must be exactly known in the watermark extraction process. In this paper, we propose a blind watermarking method based on wavelet analysis for 3-D mesh model. Two new techniques are introduced. One is to exploit the statistical features of scale coefficients on an approximation (low resolution) level for watermark embedding. Another is to extract the hidden watermark, not from the same resolution level as used in embedding process, but directly from the spatial domain. As the proposed watermark detection does not require the wavelet analysis, any pre-processing such as registration and re-sampling, is not needed. These techniques allow to detect the watermark without referring to the original meshes. In addition, the proposed are applicable directly to irregular meshes by using irregular wavelet analysis. Through simulations, we prove that our method is fairly robust against various attacks including topological ones.
18865506
Watermarking of 3D Irregular Meshes Based on Wavelet Multiresolution Analysis
In this paper, we propose a robust watermarking method for 3-D triangle surface meshes. Most previous methods based on the wavelet analysis can process only semi-regular meshes. Our proposal can be applied to irregular as well as regular meshes by using recently introduced irregular wavelet analysis scheme. L2-Norm of the wavelet coefficients is modified in various multi-resolution levels to embed the watermark. We also introduced a vertex and face re-ordering process as pre-processing in both watermark embedding and extraction for the robustness against connectivity reordering attacks. In addition, our proposal employs blind watermark detection scheme, which can extract the watermark without reference of cover mesh model. Through the simulations, we prove that our approach is robust against connectivity reordering as well as various kinds of geometrical attacks such as lossy compression and affine transform.
3207967
ArrayXPath: mapping and visualizing microarray gene-expression data with integrated biological pathway resources using Scalable Vector Graphics
Biological pathways can provide key information on the organization of biological systems. ArrayXPath (http://www.snubi.org/software/ArrayXPath/) is a web-based service for mapping and visualizing microarray gene-expression data for integrated biological pathway resources using Scalable Vector Graphics (SVG). By integrating major bio-databases and searching pathway resources, ArrayXPath automatically maps different types of identifiers from microarray probes and pathway elements. When one inputs gene-expression clusters, ArrayXPath produces a list of the best matching pathways for each cluster. We applied Fisher's exact test and the false discovery rate (FDR) to evaluate the statistical significance of the association between a cluster and a pathway while correcting the multiple-comparison problem. ArrayXPath produces Javascript-enabled SVGs for web-enabled interactive visualization of pathways integrated with gene-expression profiles.
7386649
Genetic Representations for Evolutionary Minimization of Network Coding Resources
We demonstrate how a genetic algorithm solves the problem of minimizing the resources used for network coding, subject to a throughput constraint, in a multicast scenario. A genetic algorithm avoids the computational complexity that makes the problem NP-hard and, for our experiments, greatly improves on sub-optimal solutions of established methods. We compare two different genotype encodings, which tradeoff search space size with fitness landscape, as well as the associated genetic operators. Our finding favors a smaller encoding despite its fewer intermediate solutions and demonstrates the impact of the modularity enforced by genetic operators on the performance of the algorithm.
6738575
Agent-oriented software modeling
Due to the increased applications of agents, agent-oriented software becomes large and complex. To support systematic developments of such software, the agent-oriented software development methodology needs to be developed. This paper focuses on the modeling phase of agent-oriented software development. For agent-oriented software modeling, the Agent Elicitation method, Intra and Inter Agent modeling method are proposed. Agent Elicitation shows how to extract agents from classes in the real world. Modeling methods of agent's characteristics-Goal, Belief, Plan and Capability-are proposed for Intra Agent modeling. Methods of agent's mobility and communication in multiagent systems are proposed for Inter Agent modeling.