Taejung Park

Learn More
We sought to validate the feasibility of preserving a functioning recurrent laryngeal nerve (RLN) invaded by papillary thyroid carcinoma (PTC) using a shaving technique followed by high-dose radioactive iodine (RAI) therapy. A retrospective review of 34 patients with locally invasive PTC who had exclusive tumor involvement of a functioning RLN was(More)
BACKGROUND The impact of minimal extrathyroidal extension (mETE) to the prognosis of patients with papillary thyroid carcinoma (PTC) is controversial. In this study, we investigated whether mETE is related to the aggressive biology of metastatic lymph node (LN) in patients with PTC. METHODS A retrospective review of 369 patients who had biopsy-confirmed(More)
We present a simple yet robust signed distance field (SDF) generator based on recent GPU architectures. In our approach, the squared Euclidean distance is calculated for each triangle face in parallel, and then an optimized stream reduction process is used to find the shortest distance. During this process, the stream reduction operation acts like a(More)
This paper presents a new automated behavior analysis system using a trajectory clustering method for massive multiplayer online games (MMOGs). The description of a player’s behavior is useful information in MMOG development, but the monitoring and evaluation cost of player behavior is expensive. In this paper, we suggest an automated behavior analysis(More)
This paper presents analytic solutions to the integral moving least squares (MLS) equations originally proposed by Shen et al. by choosing another specific weighting function that renders the numerator in the MLS equation unitless. In addition, we analyze the original method to show that their approximation surfaces (i.e., enveloping surfaces with nonzero(More)
We address the computational resource requirements of 3D example-based synthesis with an adaptive synthesis technique that uses a tree-based synthesis map. A signed-distance field (SDF) is determined for the 3D exemplars, and then new models can be synthesized as SDFs by neighborhood matching. Unlike voxel synthesis approach, our input is posed in the real(More)
We present a new geometry compression algorithm for manifold 3D meshes based on octree coding. For a given mesh, regular volume grids are built with an adaptive octree. For each grid point, a binary sign, which indicates inside or outside of the mesh, is generated based on the distance to the mesh. In each leaf cell having a vertex, a least square fitting(More)