Tae-wan Kim 0001

dblp:26/3105-1 · DBLP profile ↗
← Back
28ranked-venue papers
1as first author
1since 2021 · last 2021
0000-0002-3385-4657ORCID · verified

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

Graphics, computer vision, multimedia, augmented reality and games · 24 · 1 first-authorArtificial intelligence and machine learning · 2 · 1 since 2021Systems, architecture and hardware · 2 · 1 since 2021Theory of computation · 2Applied, interdisciplinary, general and emerging computing · 2

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
12 papers
Geometric modeling and processing · 97% Computational fabrication · 3%
Network and information security
2 papers
Digital forensics and information hiding · 100%
Artificial intelligence
1 paper
Robot manipulation · 75% Legged, aerial and field robots · 25%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › shape modeling › parametric modeling › spline surfaces
t-spline surface
0.312018
Local T-spline surface skinning with shape preservation · Comput. Aided Des. 2018
Digital forensics and information hiding
watermarking
0.222011
Blind digital watermarking of rational Bézier and B-spline curves and surfaces with robustness against affine transformations and Möbius reparameterization · Comput. Aided Des. 2011
Digital watermarking of polygonal meshes with linear operators of scale functions · Comput. Aided Des. 2010
Geometric modeling and processing
spline spaces
0.212014
Iterative refinement of hierarchical T-meshes for bases of spline spaces with highest order smoothness · Comput. Aided Des. 2014
Geometric modeling and processing
point cloud processing
0.222010
Adaptive triangular-mesh reconstruction by mean-curvature-based refinement from point clouds using a moving parabolic approximation · Comput. Aided Des. 2010
Moving parabolic approximation of point clouds · Comput. Aided Des. 2007
Geometric modeling and processing › shape modeling › parametric modeling › spline surfaces
bézier surfaces
0.112012
Constructing G1 Bézier surfaces over a boundary curve network with T-junctions · Comput. Aided Des. 2012
Geometric modeling and processing
curve fitting
0.112012
Fitting G2 multispiral transition curve joining two straight lines · Comput. Aided Des. 2012
Geometric modeling and processing › shape modeling › parametric modeling › curve design
transition curves
0.112012
Fitting G2 multispiral transition curve joining two straight lines · Comput. Aided Des. 2012
Geometric modeling and processing
computer-aided design
0.112010
Design of a teaching pendant program for a mobile shipbuilding welding robot using a PDA · Comput. Aided Des. 2010
Geometric modeling and processing › surface reconstruction
mesh reconstruction
0.112010
Adaptive triangular-mesh reconstruction by mean-curvature-based refinement from point clouds using a moving parabolic approximation · Comput. Aided Des. 2010
Geometric modeling and processing
surface reconstruction
0.112010
Adaptive triangular-mesh reconstruction by mean-curvature-based refinement from point clouds using a moving parabolic approximation · Comput. Aided Des. 2010
Geometric modeling and processing › shape representation › mesh representation
triangle mesh
0.112010
Adaptive triangular-mesh reconstruction by mean-curvature-based refinement from point clouds using a moving parabolic approximation · Comput. Aided Des. 2010
Digital forensics and information hiding › watermarking
3d mesh watermarking
0.112010
Digital watermarking of polygonal meshes with linear operators of scale functions · Comput. Aided Des. 2010
Geometric modeling and processing › surface fitting
surface skinning
0.112018
Local T-spline surface skinning with shape preservation · Comput. Aided Des. 2018
Geometric modeling and processing › curve fitting
conic approximation
0.112009
Finding the best conic approximation to the convolution curve of two compatible conics based on Hausdorff distance · Comput. Aided Des. 2009
Geometric modeling and processing › surface fitting
implicit surface fitting
0.112009
High-order approximation of implicit surfaces by G1 triangular spline surfaces · Comput. Aided Des. 2009
Geometric modeling and processing
registration
0.112009
Simultaneous registration of multiple views with markers · Comput. Aided Des. 2009
Geometric modeling and processing › surface processing
surface intersection
0.112009
Approximation of surface-to-surface intersection curves within a prescribed error bound satisfying G2 continuity · Comput. Aided Des. 2009
Robotics › Legged, aerial and field robots
field robotics
0.112008
Development and application of a novel rail runner mechanism for double hull structures of ships · ICRA 2008
Robotics › Robot manipulation
mobile manipulation
0.112008
Development and application of a novel rail runner mechanism for double hull structures of ships · ICRA 2008
Robotics › Robot manipulation › robot design
robot mechanism design
0.112008
Development and application of a novel rail runner mechanism for double hull structures of ships · ICRA 2008
Robotics › Robot manipulation › industrial robot
welding robot
0.112008
Development and application of a novel rail runner mechanism for double hull structures of ships · ICRA 2008
Geometric modeling and processing › model fitting
curve and surface fitting
0.112007
Moving parabolic approximation of point clouds · Comput. Aided Des. 2007
Geometric modeling and processing
surface fitting
0.112007
Moving parabolic approximation of point clouds · Comput. Aided Des. 2007
Geometric modeling and processing › shape modeling › curve and surface modeling
geometric continuity
0.012012
Constructing G1 Bézier surfaces over a boundary curve network with T-junctions · Comput. Aided Des. 2012
Interaction techniques and input
mobile interaction
0.012010
Design of a teaching pendant program for a mobile shipbuilding welding robot using a PDA · Comput. Aided Des. 2010
Geometric modeling and processing › mesh processing
error-bounded approximation
0.012009
Approximation of surface-to-surface intersection curves within a prescribed error bound satisfying G2 continuity · Comput. Aided Des. 2009
Geometric modeling and processing › 3d reconstruction
multi-view reconstruction
0.012009
Simultaneous registration of multiple views with markers · Comput. Aided Des. 2009
Computational geometry › distance measures
hausdorff distance
0.012009
Finding the best conic approximation to the convolution curve of two compatible conics based on Hausdorff distance · Comput. Aided Des. 2009

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

hausdorff distance · 0.2g2 multispiral fitting · 0.1möbius reparameterization · 0.1affine transformation · 0.1moving parabolic approximation · 0.1mean-curvature-based refinement · 0.1serial manipulator design · 0.1kinematic simulation · 0.1
YearPublicationVenuePosition
2021 Efficient Multimodal Belief Propagation for Robust SLAM Using Clustering Based Reparameterization
abstract
Due to the presence of ambiguities caused by sensor noise and structural similarity, simultaneous localization and mapping (SLAM) observation models are typically multimodal. The multimodal inference process can be directly dealt with by belief propagation (BP) using weighted Gaussian mixture messages, but for efficiency, a combinatorial explosion of the complexity must be suitably relaxed. In this study, we present an effective multimodal BP SLAM for robust inference with ambiguities. Using Gaussian bandwidth mean shift and cluster-based reparameterization, we reduce the number of Gaussian components in each message due to the BP nature. The proposed algorithm reduces the number of components of the product by summarizing indistinguishable modes in weighted Gaussian mixtures and keeping only the significant modes, making BP computationally efficient.
Tae-wan Kim 0001
IROS2
2018 Local T-spline surface skinning with shape preservation
Min-jae Oh, Myung-Il Roh, Tae-wan Kim 0001
Comput. Aided Des.3
2018 G1 Bézier surface interpolation with T-junctions at a 3-valent singular vertex
Min-jae Oh, Myung-Il Roh, Tae-wan Kim 0001
Comput. Aided Geom. Des.3
2017 Visualization and analysis of regions of monotonic curvature for interpolating segments of extended sectrices of Maclaurin
Rushan Ziatdinov, Norimasa Yoshida, Tae-wan Kim 0001
Comput. Aided Geom. Des.3
2014 Iterative refinement of hierarchical T-meshes for bases of spline spaces with highest order smoothness
Dmitry Berdinsky, Tae-wan Kim 0001, Cesare Bracco, Durkbin Cho, Min-jae Oh, Yeong-Hwa Seo, Sutipong Kiatpanichgij
Comput. Aided Des.2
2012 Constructing G1 Bézier surfaces over a boundary curve network with T-junctions
Min-jae Oh, Kittichai Suthunyatanakit, Sung Ha Park, Tae-wan Kim 0001
Comput. Aided Des.4
2012 Fitting G2 multispiral transition curve joining two straight lines
Rushan Ziatdinov, Norimasa Yoshida, Tae-wan Kim 0001
Comput. Aided Des.3
2012 Analytic parametric equations of log-aesthetic curves in terms of incomplete gamma functions
Rushan Ziatdinov, Norimasa Yoshida, Tae-wan Kim 0001
Comput. Aided Geom. Des.3
2012 On the problem of instability in the dimension of a spline space over a T-mesh
Dmitry Berdinsky, Min-jae Oh, Tae-wan Kim 0001, Bernard Mourrain
Comput. Graph.3
2012 Development of a simple model for batch and boundary information updation for a similar ship's block model
Hyeon-deok Lee, Myeong-Jo Son, Min-jae Oh, Hyung-Woo Le, Tae-wan Kim 0001
Sci. China Inf. Sci.5
2011 Blind digital watermarking of rational Bézier and B-spline curves and surfaces with robustness against affine transformations and Möbius reparameterization
Song-Hwa Kwon, Tae-wan Kim 0001, Hyeong In Choi, Hwan Pyo Moon, Sung Ha Park, Heon-Ju Shin, JungKyo Sohn
Comput. Aided Des.2
2010 G1 Bézier Surface Generation from Given Boundary Curve Network with T-Junction
Min-jae Oh, Sung Ha Park, Tae-wan Kim 0001
GMP3
2010 Digital watermarking of polygonal meshes with linear operators of scale functions
Hyeong In Choi, Tae-wan Kim 0001, Song-Hwa Kwon, Hwan Pyo Moon, Sung Ha Park, Heon-Ju Shin, JungKyo Sohn
Comput. Aided Des.2
2010 Design of a teaching pendant program for a mobile shipbuilding welding robot using a PDA
Min-jae Oh, Sang-Moo Lee, Tae-wan Kim 0001, Kyu-Yeul Lee, JongWon Kim 0002
Comput. Aided Des.3
2010 Adaptive triangular-mesh reconstruction by mean-curvature-based refinement from point clouds using a moving parabolic approximation
Zhouwang Yang, Yeong-Hwa Seo, Tae-wan Kim 0001
Comput. Aided Des.3
2010 The eccentricity of conic sections formulated as rational Bézier quadratics
Chendong Xu, Tae-wan Kim 0001, Gerald E. Farin
Comput. Aided Geom. Des.2
2009 Finding the best conic approximation to the convolution curve of two compatible conics based on Hausdorff distance
Seok Hur, Tae-wan Kim 0001
Comput. Aided Des.2
2009 Approximation of surface-to-surface intersection curves within a prescribed error bound satisfying G2 continuity
Seok Hur, Min-jae Oh, Tae-wan Kim 0001
Comput. Aided Des.3
2009 Simultaneous registration of multiple views with markers
Tae-wan Kim 0001, Yeong-Hwa Seo, Sangchul Lee, Zhouwang Yang, Minho Chang
Comput. Aided Des.1
2009 High-order approximation of implicit surfaces by G1 triangular spline surfaces
Wei-hua Tong, Tae-wan Kim 0001
Comput. Aided Des.2
2009 Classification and resolution of critical cases in Grandine and Klein's topology determination using a perturbation method
Seok Hur, Min-jae Oh, Tae-wan Kim 0001
Comput. Aided Geom. Des.3
2008 Reconstructing a Mesh from a Point Cloud by Using a Moving Parabolic Approximation
Zhouwang Yang, Yeong-Hwa Seo, Tae-wan Kim 0001
GMP3
2008 Development and application of a novel rail runner mechanism for double hull structures of ships
abstract
Welding is very difficult and dangerous for manual welders. The double hull structures found in ships are very hazardous environments, and as such the shipbuilding industry demands a safer, autonomous system to perform the welding rather than deploy manual welders. This paper describes the design of a new mechanism, called the 'Rail Runner', which is able to autonomously travel within the double hull structure. The design of a 3P3R serial manipulator for welding is also described in this paper. As an application of the 'Rail Runner' mechanism, we combine the 'Rail Runner' platform and the 3P3R serial manipulator for autonomous welding. The mechanical system of this robot is composed of a six-axes (3P3R) manipulator for achieving the welding function and a six-axes mobile platform for traveling within the double hull structure. This robot is able to autonomously travel between longitudinal structures, with transverse direction, and is capable of welding in double hull structures. The 'Rail Runner' can raise the efficiency of the welding process, as compared to manual welders. This in turn raises the international competitiveness of the shipbuilding industry.
Donghun Lee 0002, Sungcheul Lee, Namkuk Ku, Chaemook Lim, Kyu-Yeul Lee, Tae-wan Kim 0001, JongWon Kim 0002
ICRA6
2007 High-tilt parallel positioning mechanism development and cutter path simulation for laser micro-machining
Changsun Ahn, JongWon Kim 0002, Tae-wan Kim 0001
Comput. Aided Des.4
2007 Moving parabolic approximation of point clouds
Zhouwang Yang, Tae-wan Kim 0001
Comput. Aided Des.2
2006 Generation of Discrete Bicubic G1 B-Spline Ship Hullform Surfaces from a Given Curve Network Using Virtual Iso-Parametric Curves
Joong-Hyun Rhim, Doo-Yeoun Cho, Kyu-Yeul Lee, Tae-wan Kim 0001
J. Comput. Sci. Technol.4
2003 Polygonal mesh regularization for subdivision surfaces interpolating meshes of curves
Ahmad H. Nasri, Tae-wan Kim 0001, Kunwoo Lee
Vis. Comput.2
2001 Fairing Recursive Subdivision Surfaces with Curve Interpolation Constraints
abstract
Given a polygonal mesh with a set of tagged control polygons, a subdivision surface that interpolates the B-spline curves of these control polygons can be obtained by constructing a set of polygonal complexes, each of which converges to one of the given curves. The construction process will geometrically and topologically disturb the initial and/or the subdivided polygonal meshes in the vicinity of the polygonal complexes. This may result in poorly shaped surfaces across the interpolated curves. Based on signal fairing, this paper describes a method to fair such a surface and paves the way to achieve further constraints such as interpolating curves with predefined tangent plane or cross curvature.
Ahmad H. Nasri, Tae-wan Kim 0001, Kunwoo Lee
Shape Modeling International2