T. Yung Kong

Publication Activity (10 Years)

Years Active: 1985-2016
Publications (10 Years): 2

Top Topics

Image Segmentation Algorithms

Tree Representation

Top Venues

J. Vis. Commun. Image Represent.

J. Math. Imaging Vis.

Publications

Krzysztof Chris Ciesielski, Gabor T. Herman, T. Yung Kong
General Theory of Fuzzy Connectedness Segmentations. J. Math. Imaging Vis. 55 (3) (2016)
Gabor T. Herman, T. Yung Kong, Krzysztof Chris Ciesielski
Fuzzy Connectedness Segmentation: A Brief Presentation of the Literature. IWCIA (2015)
Gabor T. Herman, T. Yung Kong, Lucas M. Oliveira
Tree representation of digital picture embeddings. J. Vis. Commun. Image Represent. 23 (6) (2012)
T. Yung Kong
Minimal non-deletable sets and minimal non-codeletable sets in binary images. Theor. Comput. Sci. 406 (1-2) (2008)
T. Yung Kong, Punam K. Saha, Azriel Rosenfeld
Strongly normal sets of contractible tiles in N dimensions. Pattern Recognit. 40 (2) (2007)
T. Yung Kong
Minimal Non-simple and Minimal Non-cosimple Sets in Binary Images on Cell Complexes. DGCI (2006)
Deniz Sariöz, T. Yung Kong, Gabor T. Herman
History Trees as Descriptors of Macromolecular Structures. ISVC (1) (2006)
Bruno M. Carvalho, Gabor T. Herman, T. Yung Kong
Simultaneous fuzzy segmentation of multiple objects. Discret. Appl. Math. 151 (1-3) (2005)
Sébastien Fourey, T. Yung Kong, Gabor T. Herman
Generic axiomatized digital surface-structures. Discret. Appl. Math. 139 (1-3) (2004)
T. Yung Kong, Chyi-Jou Gau
Minimal Non-simple Sets in 4-Dimensional Binary Images with (8, 80)-Adjacency. IWCIA (2004)
Sébastien Fourey, Gabor T. Herman, T. Yung Kong, Azriel Rosenfeld
Preface. Discret. Appl. Math. 139 (1-3) (2004)
T. Yung Kong
whose connected sets include all 2n-connected sets but no (3n-1)-disconnected sets. Theor. Comput. Sci. 305 (1-3) (2003)
Chyi-Jou Gau, T. Yung Kong
Minimal non-simple sets in 4D binary images. Graph. Model. 65 (1-3) (2003)
Bruno M. Carvalho, Gabor T. Herman, T. Yung Kong
Simultaneous Fuzzy Segmentation of Multiple Objects. Electron. Notes Discret. Math. 12 (2003)
T. Yung Kong
Topological adjacency relations on Zn. Theor. Comput. Sci. 283 (1) (2002)
Chyi-Jou Gau, T. Yung Kong
4D Minimal Non-simple Sets. DGCI (2002)
Punam K. Saha, T. Yung Kong, Azriel Rosenfeld
Strongly normal sets of tiles in N dimensions. Electron. Notes Theor. Comput. Sci. 46 (2001)
Sébastien Fourey, Gabor T. Herman, T. Yung Kong
Preface. Electron. Notes Theor. Comput. Sci. 46 (2001)
Sébastien Fourey, T. Yung Kong, Gabor T. Herman
Generic axiomatized digital surface-structures. Electron. Notes Theor. Comput. Sci. 46 (2001)
Chyi-Jou Gau, T. Yung Kong
Minimal Nonsimple Sets of Voxels in Binary Images on A Face-Centered Cubic Grid. Int. J. Pattern Recognit. Artif. Intell. 13 (4) (1999)
Azriel Rosenfeld, T. Yung Kong, Akira Nakamura
Topology-Preserving Deformations of Two-Valued Digital Pictures. Graph. Model. Image Process. 60 (1) (1998)
T. Yung Kong, Gabor T. Herman
On which grids can tomographic equivalence of binary pictures be characterized in terms of elementary switching operations? Int. J. Imaging Syst. Technol. 9 (2-3) (1998)
T. Yung Kong
Topology-Preserving Deletion of 1's from 2-, 3- and 4-Dimensional Binary Images. DGCI (1997)
T. Yung Kong
On Topology Preservation in 2-D and 3-D Thinning. Int. J. Pattern Recognit. Artif. Intell. 9 (5) (1995)
T. Yung Kong, Jayaram K. Udupa
A justification of a fast surface tracking algorithm. CVGIP Graph. Model. Image Process. 54 (2) (1992)
Azriel Rosenfeld, T. Yung Kong, Angela Y. Wu
Digital surfaces. CVGIP Graph. Model. Image Process. 53 (4) (1991)
T. Yung Kong, Azriel Rosenfeld
If we use 4- or 8-connectedness for both the objects and the background, the Euler characteristics is not locally computable. Pattern Recognit. Lett. 11 (4) (1990)
T. Yung Kong
A digital fundamental group. Comput. Graph. 13 (2) (1989)
T. Yung Kong, Azriel Rosenfeld
Digital topology: Introduction and survey. Comput. Vis. Graph. Image Process. 48 (3) (1989)
T. Yung Kong, David M. Mount, A. W. Roscoe
The Decomposition of a Rectangle into Rectangles of Minimal Perimeter. SIAM J. Comput. 17 (6) (1988)
T. Yung Kong, David M. Mount, Michael Werman
The decomposition of a square into rectangles of minimal perimeter. Discret. Appl. Math. 16 (3) (1987)
Michael Werman, Shmuel Peleg, Robert A. Melter, T. Yung Kong
Bipartite Graph Matching for Points on a Line or a Circle. J. Algorithms 7 (2) (1986)
T. Yung Kong, A. W. Roscoe
Continuous analogs of axiomatized digital surfaces. Comput. Vis. Graph. Image Process. 29 (1) (1985)
T. Yung Kong, A. W. Roscoe
A theory of binary digital pictures. Comput. Vis. Graph. Image Process. 32 (2) (1985)