Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Po-Hua Huang

dblp:74/4735 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0003-3526-7971ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Geometric modeling and processing · 67% Visual content generation and editing · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Geometric modeling and processing
correspondence estimation
0.012003
Fast and Intuitive Metamorphosis of 3D Polyhedral Models Using SMCC Mesh Merging Scheme · IEEE Trans. Vis. Comput. Graph. 2003
Visual content generation and editing › image editing
image morphing
0.012003
Fast and Intuitive Metamorphosis of 3D Polyhedral Models Using SMCC Mesh Merging Scheme · IEEE Trans. Vis. Comput. Graph. 2003
Geometric modeling and processing › shape deformation
shape evolution
0.012003
Fast and Intuitive Metamorphosis of 3D Polyhedral Models Using SMCC Mesh Merging Scheme · IEEE Trans. Vis. Comput. Graph. 2003

Methods — techniques the papers use, named apart from their topics

linear-time merging · 0.0SMCC mesh merging · 0.0
YearPublicationVenuePosition
2022 Using both Stable and Unstable SRAM Bits for the Physical Unclonable Function
Zhi-Wei Lai, Po-Hua Huang, Kuen-Jong Lee
J. Electron. Test.2
2003 Fast and Intuitive Metamorphosis of 3D Polyhedral Models Using SMCC Mesh Merging Scheme
abstract
A very fast and intuitive approach to generate the metamorphosis of two genus 0 3D polyhedral models is presented. There are two levels of correspondence specified by animators to control morphs. The higher level requires the animators to specify scatter features to decompose the input models into several corresponding patches. The lower level optionally allows the animators to specify extra features on each corresponding patch for finer correspondence control. Once these two levels of correspondence are established, the proposed schemes automatically and efficiently establish a complete one-to-one correspondence between two models. We propose a novel technique called SMCC (Structures of Minimal Contour Coverage) to efficiently and robustly merge corresponding embeddings. The SMCC scheme can compute merging in linear time. The performance of the proposed methods is comparable to or better than state-of-the-art 3D polyhedral metamorphosis. We demonstrate several examples of aesthetically pleasing morphs, which can be created very quickly and intuitively.
Tong-Yee Lee, Po-Hua Huang
IEEE Trans. Vis. Comput. Graph.2