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

Min-Wen Chao

dblp:68/7527 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2012
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 3 first-author

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
Multimedia analysis and retrieval · 50% Computer animation and physical simulation · 50%
Network and information security
1 paper
Digital forensics and information hiding · 100%

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

TopicWeightPapersLastEvidence papers
Computer animation and physical simulation › motion capture
motion capture data processing
0.112012
Human Motion Retrieval from Hand-Drawn Sketch · IEEE Trans. Vis. Comput. Graph. 2012
Multimedia analysis and retrieval › multimedia retrieval › content-based retrieval
motion retrieval
0.112012
Human Motion Retrieval from Hand-Drawn Sketch · IEEE Trans. Vis. Comput. Graph. 2012
Digital forensics and information hiding
steganography
0.112009
A High Capacity 3D Steganography Algorithm · IEEE Trans. Vis. Comput. Graph. 2009

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

spherical harmonic encoding · 0.1hierarchical encoding · 0.1multilayered embedding · 0.1
YearPublicationVenuePosition
2012 Human Motion Retrieval from Hand-Drawn Sketch
abstract
The rapid growth of motion capture data increases the importance of motion retrieval. The majority of the existing motion retrieval approaches are based on a labor-intensive step in which the user browses and selects a desired query motion clip from the large motion clip database. In this work, a novel sketching interface for defining the query is presented. This simple approach allows users to define the required motion by sketching several motion strokes over a drawn character, which requires less effort and extends the users’ expressiveness. To support the real-time interface, a specialized encoding of the motions and the hand-drawn query is required. Here, we introduce a novel hierarchical encoding scheme based on a set of orthonormal spherical harmonic (SH) basis functions, which provides a compact representation, and avoids the CPU/processing intensive stage of temporal alignment used by previous solutions. Experimental results show that the proposed approach can well retrieve the motions, and is capable of retrieve logically and numerically similar motions, which is superior to previous approaches. The user study shows that the proposed system can be a useful tool to input motion query if the users are familiar with it. Finally, an application of generating a 3D animation from a hand-drawn comics strip is demonstrated.
Min-Wen Chao, Chao-Hung Lin, Jackie Assa, Tong-Yee Lee
IEEE Trans. Vis. Comput. Graph.1
2011 A graph-based shape matching scheme for 3D articulated objects
abstract
Abstract In this paper, a novel graph‐based shape matching scheme for three‐dimensional articulated objects is introduced. The underlying graph structure of a given 3D model is composed of its topological skeleton and local geometric features. Matching two graph structures is generally an NP‐hard combinatorial optimization problem. To reduce computation cost, two graphs are embedded on a high‐dimensional space, and then matched based on an extension of Earth Mover's Distance (EMD). Furthermore, the symmetric components of an articulated object are determined by a voting algorithm with a self‐matching strategy to refine the matching correspondences. Experimental results show that the proposed approach is robust, even when the models are under the surface disturbances of noise addition, smoothing, simplification, similarity transformation, and pose deformation. In addition, the proposed approach is capable of handling both global and partial shape matching. Copyright © 2011 John Wiley & Sons, Ltd.
Min-Wen Chao, Chao-Hung Lin, Chih-Chieh Chang, Tong-Yee Lee
Comput. Animat. Virtual Worlds1
2010 A novel semi-blind-and-semi-reversible robust watermarking scheme for 3D polygonal models
Chao-Hung Lin, Min-Wen Chao, Chan-Yu Liang, Tong-Yee Lee
Vis. Comput.2
2009 A High Capacity 3D Steganography Algorithm
abstract
In this paper, we present a very high-capacity and low-distortion 3D steganography scheme. Our steganography approach is based on a novel multilayered embedding scheme to hide secret messages in the vertices of 3D polygon models. Experimental results show that the cover model distortion is very small as the number of hiding layers ranges from 7 to 13 layers. To the best of our knowledge, this novel approach can provide much higher hiding capacity than other state-of-the-art approaches, while obeying the low distortion and security basic requirements for steganography on 3D models.
Min-Wen Chao, Chao-Hung Lin, Cheng-Wei Yu, Tong-Yee Lee
IEEE Trans. Vis. Comput. Graph.1