Shi-min Hu | Tsinghua University (original) (raw)
Papers by Shi-min Hu
Lecture Notes in Computer Science, 2005
Bookmarks Related papers MentionsView impact
Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001, 2001
Bookmarks Related papers MentionsView impact
Proceedings the Eighth Pacific Conference on Computer Graphics and Applications, 2000
Bookmarks Related papers MentionsView impact
Proceedings of the 2006 ACM symposium on Solid and physical modeling - SPM '06, 2006
Bookmarks Related papers MentionsView impact
Graphical Models, 2013
ABSTRACT Solid textures require large storage and are computationally expensive to synthesize. In... more ABSTRACT Solid textures require large storage and are computationally expensive to synthesize. In this paper, we propose a novel solid representation called gradient solids to compactly represent solid textures, including a tricubic interpolation scheme of colors and gradients for smooth variation and a region-based approach for representing sharp boundaries. We further propose a novel approach to directly synthesize gradient solid textures from exemplars. Compared to existing methods, our approach avoids the expensive step of synthesizing the complete solid textures at voxel level and produces optimized solid textures using our representation. This avoids significant amount of unnecessary computation and storage involved in the voxel-level synthesis while producing solid textures with comparable quality to the state of the art. The algorithm is much faster than existing approaches for solid texture synthesis and makes it feasible to synthesize high-resolution solid textures in full. We also propose a novel application—instant editing propagation on full solids.
Bookmarks Related papers MentionsView impact
Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Non-Photorealistic Animation and Rendering - NPAR '11, 2011
Bookmarks Related papers MentionsView impact
Science China Information Sciences, 2011
Bookmarks Related papers MentionsView impact
IEEE transactions on visualization and computer graphics, Jan 10, 2012
Harmonic functions are the critical points of a Dirichlet energy functional, the linear projectio... more Harmonic functions are the critical points of a Dirichlet energy functional, the linear projections of conformal maps. They play an important role in computer graphics, particularly for gradient-domain image processing and shape-preserving geometric computation. We propose Poisson coordinates, a novel transfinite interpolation scheme based on the Poisson integral formula, as a rapid way to estimate a harmonic function on a certain domain with desired boundary values. Poisson coordinates are an extension of the Mean Value coordinates (MVCs) which inherit their linear precision, smoothness, and kernel positivity. We give explicit formulae for Poisson coordinates in both continuous and 2D discrete forms. Superior to MVCs, Poisson coordinates are proved to be pseudo-harmonic (i.e., they reproduce harmonic functions on n-dimensional balls). Our experimental results show that Poisson coordinates have lower Dirichlet energies than MVCs on a number of typical 2D domains (particularly convex...
Bookmarks Related papers MentionsView impact
Science in China Series F: Information Sciences, 2009
Bookmarks Related papers MentionsView impact
The Visual Computer, 2005
Bookmarks Related papers MentionsView impact
Computer Graphics Forum, 2014
ABSTRACT
Bookmarks Related papers MentionsView impact
ABSTRACT
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
ABSTRACT This paper proposes an image-enhancement method to optimize photograph composition by re... more ABSTRACT This paper proposes an image-enhancement method to optimize photograph composition by rearranging foreground objects in the photograph. To adjust objects' positions while keeping the original scene content, we first perform a novel structure dependence analysis on the image to obtain the dependencies between all background regions. To determine the optimal positions for foreground objects, we formulate an optimization problem based on widely used heuristics for aesthetically pleasing pictures. Semantic relations between foreground objects are also taken into account during optimization. The final output is produced by moving foreground objects, together with their dependent regions, to optimal positions. The results show that our approach can effectively optimize photographs with single or multiple foreground objects without compromising the original photograph content.
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2005
Bookmarks Related papers MentionsView impact
Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001, 2001
Bookmarks Related papers MentionsView impact
Proceedings the Eighth Pacific Conference on Computer Graphics and Applications, 2000
Bookmarks Related papers MentionsView impact
Proceedings of the 2006 ACM symposium on Solid and physical modeling - SPM '06, 2006
Bookmarks Related papers MentionsView impact
Graphical Models, 2013
ABSTRACT Solid textures require large storage and are computationally expensive to synthesize. In... more ABSTRACT Solid textures require large storage and are computationally expensive to synthesize. In this paper, we propose a novel solid representation called gradient solids to compactly represent solid textures, including a tricubic interpolation scheme of colors and gradients for smooth variation and a region-based approach for representing sharp boundaries. We further propose a novel approach to directly synthesize gradient solid textures from exemplars. Compared to existing methods, our approach avoids the expensive step of synthesizing the complete solid textures at voxel level and produces optimized solid textures using our representation. This avoids significant amount of unnecessary computation and storage involved in the voxel-level synthesis while producing solid textures with comparable quality to the state of the art. The algorithm is much faster than existing approaches for solid texture synthesis and makes it feasible to synthesize high-resolution solid textures in full. We also propose a novel application—instant editing propagation on full solids.
Bookmarks Related papers MentionsView impact
Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Non-Photorealistic Animation and Rendering - NPAR '11, 2011
Bookmarks Related papers MentionsView impact
Science China Information Sciences, 2011
Bookmarks Related papers MentionsView impact
IEEE transactions on visualization and computer graphics, Jan 10, 2012
Harmonic functions are the critical points of a Dirichlet energy functional, the linear projectio... more Harmonic functions are the critical points of a Dirichlet energy functional, the linear projections of conformal maps. They play an important role in computer graphics, particularly for gradient-domain image processing and shape-preserving geometric computation. We propose Poisson coordinates, a novel transfinite interpolation scheme based on the Poisson integral formula, as a rapid way to estimate a harmonic function on a certain domain with desired boundary values. Poisson coordinates are an extension of the Mean Value coordinates (MVCs) which inherit their linear precision, smoothness, and kernel positivity. We give explicit formulae for Poisson coordinates in both continuous and 2D discrete forms. Superior to MVCs, Poisson coordinates are proved to be pseudo-harmonic (i.e., they reproduce harmonic functions on n-dimensional balls). Our experimental results show that Poisson coordinates have lower Dirichlet energies than MVCs on a number of typical 2D domains (particularly convex...
Bookmarks Related papers MentionsView impact
Science in China Series F: Information Sciences, 2009
Bookmarks Related papers MentionsView impact
The Visual Computer, 2005
Bookmarks Related papers MentionsView impact
Computer Graphics Forum, 2014
ABSTRACT
Bookmarks Related papers MentionsView impact
ABSTRACT
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
ABSTRACT This paper proposes an image-enhancement method to optimize photograph composition by re... more ABSTRACT This paper proposes an image-enhancement method to optimize photograph composition by rearranging foreground objects in the photograph. To adjust objects' positions while keeping the original scene content, we first perform a novel structure dependence analysis on the image to obtain the dependencies between all background regions. To determine the optimal positions for foreground objects, we formulate an optimization problem based on widely used heuristics for aesthetically pleasing pictures. Semantic relations between foreground objects are also taken into account during optimization. The final output is produced by moving foreground objects, together with their dependent regions, to optimal positions. The results show that our approach can effectively optimize photographs with single or multiple foreground objects without compromising the original photograph content.
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact