Yu-Sung Chang

Learn More
Reconstruction of missing or damaged portions of images is an ancient practice used extensively in artwork restoration. Recently, a few digital inpainting models based on the use of partial differential equations have been proposed. Unfortunately, these algorithms are computationally expensive, usually taking a few minutes to restore small portions of an(More)
During the past twenty years, much research has been undertaken to study surface representations based on B-splines and box splines. In contrast, volumetric splines have received much less attention as an effective and powerful solid modeling tool. In this paper, we propose a novel solid subdivision scheme based on tri-variate box splines over tetrahedral(More)
Subdivision has gained popularity in computer graphics and shape modeling during the past two decades, yet volu-metric subdivision has received much less attention. In this paper, we develop a new subdivision scheme which can interpolate all of the initial control points in 3D and generate a continuous volume in the limit. We devise a set of solid(More)
This paper presents a new unified subdivision scheme that is defined over a k-simplicial complex in n-D space with k ≤ 3. We first present a series of definitions to facilitate topological inquiries during the subdivision process. The scheme is derived from the double (k + 1)-directional box splines over k-simplicial domains. Thus, it guarantees a certain(More)
This paper presents DigitalSculpture, an interactive sculpting framework founded upon iso-surfaces extracted from recursively subdivided, 3D irregular grids. Our unique implicit surface model arises from an interpolatory, volumetric subdivision scheme that is C 1 continuous across the domains defined by arbitrary 3D irregular grids. We assign scalar(More)
Recent studies in sparse representations show a variety of applications in the field of image processing. Such as in image denoising, inpainting, compression and more. But always the size of the dictionary has a trade off between the approximation speed and accuracy. In this paper, a moving k-means based dictionary pruning algorithm is applied to the(More)
  • 1