-
[show abstract]
[hide abstract]
ABSTRACT: Astronomical cross-matching is a basic method for aggregating the observational data of different wavelengths. By data aggregation,
the properties of astronomical objects can be understood comprehensively. Aiming at decreasing the time consumed on I/O operations,
several improved methods are introduced, including a processing flow based on the boundary growing model, which can reduce
the database query operations; a concept of the biggest growing block and its determination which can improve the performance
of task partition and resolve data-sparse problem; and a fast bitwise algorithm to compute the index numbers of the neighboring
blocks, which is a significant efficiency guarantee. Experiments show that the methods can effectively speed up cross-matching
on both sparse datasets and high-density datasets.
Keywordsastronomical cross-matching–boundary growing model–HEALPix–task partition–data-sparse problem
Transactions of Tianjin University 04/2012; 17(1):62-67.
-
IEEE 3rd International Conference on Cloud Computing Technology and Science, CloudCom 2011, Athens, Greece, November 29 - December 1, 2011; 01/2011
-
Methods and Tools of Parallel Programming Multicomputers - Second Russia-Taiwan Symposium, MTPP 2010, Vladivostok, Russia, May 16-19, 2010, Revised Selected Papers; 01/2010
-
The Visual Computer. 01/2010; 26:761-768.
-
[show abstract]
[hide abstract]
ABSTRACT: We introduce a novel parallel combined classifiers method for the problems of protein classification and remote homology detection. The method use parallel computing idea to rebuild the high accuracy SVM-based algorithm and the complete coverage nearest neighbor algorithm. We run the two classifiers simultaneously and combine the output result together to reduce the running time and improve the classification accuracy. The remote homology detection experiments based on the SCOP database are presented to show that the parallel combined classifiers outperform all recently presented classifiers. The parallel speedup experiments show that the parallel methods achieved an ideal acceleration effect in share memory mode and message-passing mode.
Natural Computation, 2009. ICNC '09. Fifth International Conference on; 09/2009
-
[show abstract]
[hide abstract]
ABSTRACT: This paper proposes a hierarchical perception model for simulation of crowd perception in different density. In this model, there are two tiers: the low density and high density perception modules. They are both composed of perceptual filters, short-term and long-term memory. However, considering the changes of the perception as the density increases, we adopt different methods to model them. We also take into account the impact of the human subjective factors on the selection of the object the virtual agent focuses. Our hierarchical perception model can well reflect the characteristics of the human perception; moreover, it can provide more plausible information for the virtual human among the crowd to respond properly to certain event.
Computer Graphics, Imaging and Visualization, 2009. CGIV '09. Sixth International Conference on; 09/2009
-
Proceedings of the 8th International Conference on Virtual Reality Continuum and its Applications in Industry, VRCAI 2009, Yokohama, Japan, December 14-15, 2009; 01/2009
-
CSIE 2009, 2009 WRI World Congress on Computer Science and Information Engineering, March 31 - April 2, 2009, Los Angeles, California, USA, 7 Volumes; 01/2009
-
Sixth International Conference on Computer Graphics, Imaging and Visualization: New Advances and Trends, CGIV 2009, 11-14 August 2009, Tianjin, China; 01/2009
-
Sixth International Conference on Computer Graphics, Imaging and Visualization: New Advances and Trends, CGIV 2009, 11-14 August 2009, Tianjin, China; 01/2009
-
The Visual Computer. 01/2009; 25:687-696.
-
Algorithms and Architectures for Parallel Processing, 9th International Conference, ICA3PP 2009, Taipei, Taiwan, June 8-11, 2009. Proceedings; 01/2009
-
[show abstract]
[hide abstract]
ABSTRACT: Monte Carlo is the only choice of physically correct method to compute the problem of global illumination in the field of realistic image synthesis. Adaptive sampling is an appealing tool to eliminate noise, which is one of the main problems of Monte Carlo based global illumination algorithms. In this paper, we investigate the use of entropy in the domain of information theory to measure pixel quality and to do adaptive sampling. Especially we explore the nonextensive Tsallis entropy, in which a real number q is introduced as the entropic index that presents the degree of nonextensivity, to evaluate pixel quality. By utilizing the least-squares design, an entropic index q can be obtained systematically to run adaptive sampling effectively. Implementation results show that the Tsallis entropy driven adaptive sampling significantly outperforms the existing methods. To our knowledge, this may be the first try on the systematic choice of an appropriate entropic index to Tsallis entropy in the engineering fields.
Computer-Aided Design and Computer Graphics, 2007 10th IEEE International Conference on; 11/2007
-
[show abstract]
[hide abstract]
ABSTRACT: Fast display of realistic dynamic cloud scene is a challenging task for researchers in computer graphics. This paper describes a novel method of simulating animations of cloud. We first model the motion of cloud based on the physical theory of cloud formation. Then, the physical model of cloud is solved in discrete sparse grids. Thus, we can get approximate motion of cloud. Next, we advect texture image using the calculated velocity field to add the local detail of dynamic cloud scene. Here the texture image we used is Perlin noise map. The color of arbitrary point in the simulation space is got by calculating the product of the density texture and the regenerated Perlin noise texture. Finally, by changing different noise maps, realistic dynamic cloud scenes in different light environment are generated at high rendering rates.
Computer-Aided Design and Computer Graphics, 2007 10th IEEE International Conference on; 11/2007
-
[show abstract]
[hide abstract]
ABSTRACT: The Xuan-paper modeling, the most basic problem in Chinese painting simulating, is explored in this paper. An effective thickness Xuan-paper model is presented. The important influence of paper thickness to water holding and water transmitting is considered; also the complexity of mathematic solving caused by 3D paper model is avoided. The experimental results demonstrate that the model is simple and effective, and the model can simulate the different quality Xuan-papers by controlling the corresponding parameters. The effective Xuan-paper model establishes the foundation for simulating of water and ink moving in future.
Computer Graphics, Imaging and Visualisation, 2007. CGIV '07; 09/2007
-
[show abstract]
[hide abstract]
ABSTRACT: Water-ink moving in xuan-paper modeling is the key problem in Chinese painting simulation. In this text, based on the effective thickness xuan-paper model, the mechanics of fluids in porous media and soil-water dynamics are introduced to the research of water and ink motion in xuan-paper. The physics process of forming Chinese painting special effect is presented by building water and ink motion model. The simulating result demonstrates that the model grounded on the theory can bring the satisfied results for different solutions of water and ink and different papers.
Image and Graphics, International Conference on. 08/2007;
-
Image Vision Comput. 01/2007; 25:1249-1254.
-
Computational Science and Its Applications - ICCSA 2007, International Conference, Kuala Lumpur, Malaysia, August 26-29, 2007. Proceedings. Part III; 01/2007
-
Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part V; 01/2006
-
[show abstract]
[hide abstract]
ABSTRACT: Originating from information theory, mutual information, as a measure for image registration, has drawn much attention and has been shown to be successful. Mutual information should be maximal when the two different images are perfectly aligned. There exist many optimization schemes applied to mutual information matching problems, most of which are local and require a starting point. In this paper, we propose an improved genetic algorithm as a search engine to overcome this problem. To reduce the search data size, multi-resolution optimization strategy is adopted; meanwhile, adaptive sizes of the crossover and the mutation pools along with the changes of resolution are proposed to prevent the process from stalling at a local maximum, accordingly improve the capability with the local search of genetic algorithm. Experiments show our algorithm is a robust and efficient method which can yield accurate registration results.
Computer Graphics, Imaging and Vision: New Trends, 2005. International Conference on; 08/2005
