T. Yung Kong

According to our database, T. Yung Kong authored at least 33 papers between 1985 and 2016.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2016

General Theory of Fuzzy Connectedness Segmentations.

Krzysztof Chris Ciesielski, Gabor T. Herman, T. Yung Kong

J. Math. Imaging Vis., 2016

2015

Fuzzy Connectedness Segmentation: A Brief Presentation of the Literature.

Gabor T. Herman, T. Yung Kong, Krzysztof Chris Ciesielski

Proceedings of the Combinatorial Image Analysis - 17th International Workshop, 2015

2014

Using a Topological Descriptor to Investigate Structures of Virus Particles.

Lucas M. Oliveira, Gabor T. Herman, Tat Yung Kong, Paul Gottlieb, Al Katz

Proceedings of the Combinatorial Image Analysis - 16th International Workshop, 2014

2012

Tree representation of digital picture embeddings.

Gabor T. Herman, T. Yung Kong, Lucas M. Oliveira

J. Vis. Commun. Image Represent., 2012

2008

Minimal non-deletable sets and minimal non-codeletable sets in binary images.

T. Yung Kong

Theor. Comput. Sci., 2008

2007

Strongly normal sets of contractible tiles in N dimensions.

T. Yung Kong, Punam K. Saha, Azriel Rosenfeld

Pattern Recognit., 2007

2006

History Trees as Descriptors of Macromolecular Structures.

Deniz Sariöz, T. Yung Kong, Gabor T. Herman

Proceedings of the Advances in Visual Computing, Second International Symposium, 2006

Minimal Non-simple and Minimal Non-cosimple Sets in Binary Images on Cell Complexes.

T. Yung Kong

Proceedings of the Discrete Geometry for Computer Imagery, 13th International Conference, 2006

2005

Simultaneous fuzzy segmentation of multiple objects.

Bruno M. Carvalho, Gabor T. Herman, T. Yung Kong

Discret. Appl. Math., 2005

2004

Generic axiomatized digital surface-structures.

Sébastien Fourey, T. Yung Kong, Gabor T. Herman

Discret. Appl. Math., 2004

Preface.

Sébastien Fourey, Gabor T. Herman, T. Yung Kong, Azriel Rosenfeld

Discret. Appl. Math., 2004

Minimal Non-simple Sets in 4-Dimensional Binary Images with (8, 80)-Adjacency.

T. Yung Kong, Chyi-Jou Gau

Proceedings of the Combinatorial Image Analysis, 10th InternationalWorkshop, 2004

2003

The Khalimsky topologies are precisely those simply connected topologies on Zⁿ whose connected sets include all 2n-connected sets but no (3n-1)-disconnected sets.

T. Yung Kong

Theor. Comput. Sci., 2003

Minimal non-simple sets in 4D binary images.

Chyi-Jou Gau, T. Yung Kong

Graph. Model., 2003

2002

Topological adjacency relations on Zn.

T. Yung Kong

Theor. Comput. Sci., 2002

4D Minimal Non-simple Sets.

Chyi-Jou Gau, T. Yung Kong

Proceedings of the Discrete Geometry for Computer Imagery, 10th International Conference, 2002

2001

Strongly normal sets of tiles in N dimensions.

Punam K. Saha, T. Yung Kong, Azriel Rosenfeld

Proceedings of the 8th International Workshop on Combinatorial Image Analysis, 2001

Preface.

Sébastien Fourey, Gabor T. Herman, T. Yung Kong

Proceedings of the 8th International Workshop on Combinatorial Image Analysis, 2001

1999

Minimal Nonsimple Sets of Voxels in Binary Images on A Face-Centered Cubic Grid.

Chyi-Jou Gau, T. Yung Kong

Int. J. Pattern Recognit. Artif. Intell., 1999

1998

On which grids can tomographic equivalence of binary pictures be characterized in terms of elementary switching operations?

T. Yung Kong, Gabor T. Herman

Int. J. Imaging Syst. Technol., 1998

Topology-Preserving Deformations of Two-Valued Digital Pictures.

Azriel Rosenfeld, T. Yung Kong, Akira Nakamura

Graph. Model. Image Process., 1998

1997

Topology-Preserving Deletion of 1's from 2-, 3- and 4-Dimensional Binary Images.

T. Yung Kong

Proceedings of the Discrete Geometry for Computer Imagery, 1997

1995

On Topology Preservation in 2-D and 3-D Thinning.

T. Yung Kong

Int. J. Pattern Recognit. Artif. Intell., 1995

1992

A justification of a fast surface tracking algorithm.

T. Yung Kong, Jayaram K. Udupa

CVGIP Graph. Model. Image Process., 1992

1991

Digital surfaces.

Azriel Rosenfeld, T. Yung Kong, Angela Y. Wu

CVGIP Graph. Model. Image Process., 1991

1990

If we use 4- or 8-connectedness for both the objects and the background, the Euler characteristics is not locally computable.

T. Yung Kong, Azriel Rosenfeld

Pattern Recognit. Lett., 1990

1989

Digital topology: Introduction and survey.

T. Yung Kong, Azriel Rosenfeld

Comput. Vis. Graph. Image Process., 1989

A digital fundamental group.

T. Yung Kong

Comput. Graph., 1989

1988

The Decomposition of a Rectangle into Rectangles of Minimal Perimeter.

T. Yung Kong, David M. Mount, A. W. Roscoe

SIAM J. Comput., 1988

1987

The decomposition of a square into rectangles of minimal perimeter.

T. Yung Kong, David M. Mount, Michael Werman

Discret. Appl. Math., 1987

1986

Bipartite Graph Matching for Points on a Line or a Circle.

Michael Werman, Shmuel Peleg, Robert A. Melter, T. Yung Kong

J. Algorithms, 1986

1985

A theory of binary digital pictures.

T. Yung Kong, A. W. Roscoe

Comput. Vis. Graph. Image Process., 1985

Continuous analogs of axiomatized digital surfaces.

T. Yung Kong, A. W. Roscoe

Comput. Vis. Graph. Image Process., 1985