default search action
T. Yung Kong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j25]Krzysztof Chris Ciesielski, Gabor T. Herman, T. Yung Kong:
General Theory of Fuzzy Connectedness Segmentations. J. Math. Imaging Vis. 55(3): 304-342 (2016) - 2015
- [c10]Gabor T. Herman, T. Yung Kong, Krzysztof Chris Ciesielski:
Fuzzy Connectedness Segmentation: A Brief Presentation of the Literature. IWCIA 2015: 21-30 - 2014
- [c9]Lucas M. Oliveira, Gabor T. Herman, Tat Yung Kong, Paul Gottlieb, Al Katz:
Using a Topological Descriptor to Investigate Structures of Virus Particles. IWCIA 2014: 62-75 - 2012
- [j24]Gabor T. Herman, T. Yung Kong, Lucas M. Oliveira:
Tree representation of digital picture embeddings. J. Vis. Commun. Image Represent. 23(6): 883-891 (2012)
2000 – 2009
- 2008
- [j23]T. Yung Kong:
Minimal non-deletable sets and minimal non-codeletable sets in binary images. Theor. Comput. Sci. 406(1-2): 97-118 (2008) - 2007
- [j22]T. Yung Kong, Punam K. Saha
, Azriel Rosenfeld:
Strongly normal sets of contractible tiles in N dimensions. Pattern Recognit. 40(2): 530-543 (2007) - 2006
- [c8]T. Yung Kong:
Minimal Non-simple and Minimal Non-cosimple Sets in Binary Images on Cell Complexes. DGCI 2006: 169-188 - [c7]Deniz Sariöz, T. Yung Kong, Gabor T. Herman:
History Trees as Descriptors of Macromolecular Structures. ISVC (1) 2006: 263-272 - 2005
- [j21]Bruno M. Carvalho
Simultaneous fuzzy segmentation of multiple objects. Discret. Appl. Math. 151(1-3): 55-77 (2005) - 2004
- [j20]Sébastien Fourey, Gabor T. Herman, T. Yung Kong, Azriel Rosenfeld:
Preface. Discret. Appl. Math. 139(1-3): 1-3 (2004) - [j19]Sébastien Fourey, T. Yung Kong, Gabor T. Herman:
Generic axiomatized digital surface-structures. Discret. Appl. Math. 139(1-3): 65-93 (2004) - [c6]T. Yung Kong, Chyi-Jou Gau:
Minimal Non-simple Sets in 4-Dimensional Binary Images with (8, 80)-Adjacency. IWCIA 2004: 318-333 - 2003
- [j18]Chyi-Jou Gau, T. Yung Kong:
Minimal non-simple sets in 4D binary images. Graph. Model. 65(1-3): 112-130 (2003) - [j17]Bruno M. Carvalho
Simultaneous Fuzzy Segmentation of Multiple Objects. Electron. Notes Discret. Math. 12: 3-22 (2003) - [j16]T. Yung Kong:
The Khalimsky topologies are precisely those simply connected topologies on Zn whose connected sets include all 2n-connected sets but no (3n-1)-disconnected sets. Theor. Comput. Sci. 305(1-3): 221-235 (2003) - 2002
- [j15]T. Yung Kong:
Topological adjacency relations on Zn. Theor. Comput. Sci. 283(1): 3-28 (2002) - [c5]Chyi-Jou Gau, T. Yung Kong:
4D Minimal Non-simple Sets. DGCI 2002: 81-91 - 2001
- [c4]Sébastien Fourey, T. Yung Kong, Gabor T. Herman:
Generic axiomatized digital surface-structures. IWCIA 2001: 73-92 - [c3]Punam K. Saha
Strongly normal sets of tiles in N dimensions. IWCIA 2001: 309-320 - [c2]Sébastien Fourey, Gabor T. Herman, T. Yung Kong:
Preface. IWCIA 2001: 430-431 - [e1]Sébastien Fourey, Gabor T. Herman, T. Yung Kong:
8th International Workshop on Combinatorial Image Analysis, IWCIA 2001, Philadelphia, PA, USA, August 23-24, 2001. Electronic Notes in Theoretical Computer Science 46, Elsevier 2001 [contents]
1990 – 1999
- 1999
- [j14]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): 485-502 (1999) - 1998
- [j13]Azriel Rosenfeld, T. Yung Kong, Akira Nakamura:
Topology-Preserving Deformations of Two-Valued Digital Pictures. Graph. Model. Image Process. 60(1): 24-34 (1998) - [j12]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): 118-125 (1998) - 1997
- [c1]T. Yung Kong:
Topology-Preserving Deletion of 1's from 2-, 3- and 4-Dimensional Binary Images. DGCI 1997: 3-18 - 1995
- [j11]T. Yung Kong:
On Topology Preservation in 2-D and 3-D Thinning. Int. J. Pattern Recognit. Artif. Intell. 9(5): 813-844 (1995) - 1992
- [j10]T. Yung Kong, Jayaram K. Udupa:
A justification of a fast surface tracking algorithm. CVGIP Graph. Model. Image Process. 54(2): 162-170 (1992) - 1991
- [j9]Azriel Rosenfeld, T. Yung Kong, Angela Y. Wu:
Digital surfaces. CVGIP Graph. Model. Image Process. 53(4): 305-312 (1991) - 1990
- [j8]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): 231-232 (1990)
1980 – 1989
- 1989
- [j7]T. Yung Kong:
A digital fundamental group. Comput. Graph. 13(2): 159-166 (1989) - [j6]T. Yung Kong, Azriel Rosenfeld:
Digital topology: Introduction and survey. Comput. Vis. Graph. Image Process. 48(3): 357-393 (1989) - 1988
- [j5]T. Yung Kong, David M. Mount, A. W. Roscoe:
The Decomposition of a Rectangle into Rectangles of Minimal Perimeter. SIAM J. Comput. 17(6): 1215-1231 (1988) - 1987
- [j4]T. Yung Kong, David M. Mount, Michael Werman:
The decomposition of a square into rectangles of minimal perimeter. Discret. Appl. Math. 16(3): 239-243 (1987) - 1986
- [j3]Michael Werman, Shmuel Peleg
Bipartite Graph Matching for Points on a Line or a Circle. J. Algorithms 7(2): 277-284 (1986) - 1985
- [j2]T. Yung Kong, A. W. Roscoe:
Continuous analogs of axiomatized digital surfaces. Comput. Vis. Graph. Image Process. 29(1): 60-86 (1985) - [j1]T. Yung Kong, A. W. Roscoe:
A theory of binary digital pictures. Comput. Vis. Graph. Image Process. 32(2): 221-243 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: