Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kia-Fock Loe

dblp:08/2138 · DBLP profile ↗
← Back
26ranked-venue papers
4as first author
0since 2021 · last 2006
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 16 · 2 first-authorArtificial intelligence and machine learning · 15 · 2 first-authorSystems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1Human-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
10 papers
Segmentation and scene understanding · 21% Probabilistic and Bayesian machine learning · 19% Face, body and person analysis · 16%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 18 heaviest of 24, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › Segmentation and scene understanding
video segmentation
0.232006
A Dynamic Conditional Random Field Model for Foreground and Shadow Segmentation · IEEE Trans. Pattern Anal. Mach. Intell. 2006
Spatiotemporal video segmentation based on graphical models · IEEE Trans. Image Process. 2005
Video Segmentation Based on Graphical Models · CVPR (2) 2003
Machine learning › Probabilistic and Bayesian machine learning › structured prediction
graphical model segmentation
0.112005
Spatiotemporal video segmentation based on graphical models · IEEE Trans. Image Process. 2005
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
bayesian network
0.012003
Video Segmentation Based on Graphical Models · CVPR (2) 2003
Computer vision › Face, body and person analysis
face detection
0.012003
S-AdaBoost and Pattern Detection in Complex Environment · CVPR (1) 2003
Computer vision › Face, body and person analysis › face recognition
face identification
0.012003
Boosting Face Identification in Airports · IJCAI 2003
Computer vision › Face, body and person analysis
face recognition
0.012003
Boosting Face Identification in Airports · IJCAI 2003
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.012003
Video Segmentation Based on Graphical Models · CVPR (2) 2003
Computer vision › Video understanding and tracking
multi-object tracking
0.012003
Joint Region Tracking with Switching Hypothesized Measurements · ICCV 2003
Machine learning › Trustworthy machine learning › robustness
outlier robustness
0.012003
S-AdaBoost and Pattern Detection in Complex Environment · CVPR (1) 2003
Machine learning › Trustworthy machine learning
robustness
0.012003
S-AdaBoost and Pattern Detection in Complex Environment · CVPR (1) 2003
Computer vision › Image recognition and object detection › character recognition
handwritten digit recognition
0.012000
Handwritten Digit Recognition with a Novel Vision Model that Extracts Linearly Separable Features · CVPR 2000
Machine learning › Optimization for machine learning
hyperparameter optimization
0.012000
Selection of Support Vector Kernel Parameters for Improved Generalization · ICML 2000
Machine learning › Kernel, tree and ensemble methods
kernel methods
0.012000
Selection of Support Vector Kernel Parameters for Improved Generalization · ICML 2000
Machine learning › Learning theory
model selection
0.012000
Selection of Support Vector Kernel Parameters for Improved Generalization · ICML 2000
Machine learning › Kernel, tree and ensemble methods
support vector machine
0.012000
Selection of Support Vector Kernel Parameters for Improved Generalization · ICML 2000
Information retrieval
image retrieval
0.011999
A New Approach for Image Classification and Retrieval (poster abstract) · SIGIR 1999
Computer vision › Video understanding and tracking
motion analysis
0.012003
Video Segmentation Based on Graphical Models · CVPR (2) 2003
Computer vision › Image recognition and object detection
scene recognition
0.011999
Learning primitive and scene semantics of images for classification and retrieval · ACM Multimedia (2) 1999

Methods — techniques the papers use, named apart from their topics

markov random field · 0.1distance transformation · 0.1conditional random field · 0.1approximate filtering · 0.1bayesian network · 0.1s-adaboost · 0.0divide-and-conquer · 0.0conditional probability optimization · 0.0adaptive reference image update · 0.0adaboost · 0.0supervised learning · 0.0self-organizing patch semantics · 0.0
YearPublicationVenuePosition
2006 A Dynamic Conditional Random Field Model for Foreground and Shadow Segmentation
abstract
This paper proposes a dynamic conditional random field (DCRF) model for foreground object and moving shadow segmentation in indoor video scenes. Given an image sequence, temporal dependencies of consecutive segmentation fields and spatial dependencies within each segmentation field are unified by a dynamic probabilistic framework based on the conditional random field (CRF). An efficient approximate filtering algorithm is derived for the DCRF model to recursively estimate the segmentation field from the history of observed images. The foreground and shadow segmentation method integrates both intensity and gradient features. Moreover, models of background, shadow, and gradient information are updated adaptively for nonstationary background processes. Experimental results show that the proposed approach can accurately detect moving objects and their cast shadows even in monocular grayscale video sequences.
Yang Wang 0002, Kia-Fock Loe, Jian-Kang Wu
IEEE Trans. Pattern Anal. Mach. Intell.2
2005 A probabilistic approach for foreground and shadow segmentation in monocular image sequences
Yang Wang 0002, Tele Tan, Kia-Fock Loe, Jian-Kang Wu
Pattern Recognit.3
2005 Spatiotemporal video segmentation based on graphical models
abstract
This paper proposes a probabilistic framework for spatiotemporal segmentation of video sequences. Motion information, boundary information from intensity segmentation, and spatial connectivity of segmentation are unified in the video segmentation process by means of graphical models. A Bayesian network is presented to model interactions among the motion vector field, the intensity segmentation field, and the video segmentation field. The notion of the Markov random field is used to encourage the formation of continuous regions. Given consecutive frames, the conditional joint probability density of the three fields is maximized in an iterative way. To effectively utilize boundary information from the intensity segmentation, distance transformation is employed in local objective functions. Experimental results show that the method is robust and generates spatiotemporally coherent segmentation results. Moreover, the proposed video segmentation approach can be viewed as the compromise of previous motion based approaches and region merging approaches.
Yang Wang 0002, Kia-Fock Loe, Tele Tan, Jian-Kang Wu
IEEE Trans. Image Process.2
2004 Knowledge-driven segmentation of the central sulcus from human brain MR images
abstract
This paper presents a knowledge-driven algorithm to identify and segment the central sulcus (CS) from human brain MR images. The dataset is reformatted along the anterior and posterior commissures (AC-PC) plane first. Then, the 3D region within the two coronal planes passing through the AC and PC is defined as the region of interest (ROl) to search for all the sulci within it. The CS is the sulcus with the largest volume within the ROI. Together with the sulci, grey matter (GM) is included for the region growing in order to deal with the partial volume effect. The GM is removed through skeletonization. Experimental results are given.
Wei Zuo, Qingmao Hu, Aamer Aziz, Kia-Fock Loe, Wieslaw Lucjan Nowinski
ICIP4
2003 S-AdaBoost and Pattern Detection in Complex Environment
abstract
S-AdaBoost is a new variant of AdaBoost and is more effective than the conventional AdaBoost in handling outliers in pattern detection and classification in real world complex environment. Utilizing the divide and conquer principle, S-AdaBoost divides the input space into a few sub-spaces and uses dedicated classifiers to classify patterns in the sub-spaces. The final classification result is the combination of the outputs of the dedicated classifiers. S-AdaBoost system is made up of an AdaBoost divider, an AdaBoost classifier, a dedicated classifier for outliers, and a non-linear combiner. In addition to presenting face detection test results in a complex airport environment, we have also conducted experiments on a number of benchmark databases to test the algorithm. The experiment results clearly show S-AdaBoost's effectiveness in pattern detection and classification.
Jiang Liu 0001, Kia-Fock Loe
CVPR (1)2
2003 Video Segmentation Based on Graphical Models
abstract
This paper proposes a unified framework for spatiotemporal segmentation of video sequences. A Bayesian network is presented to model the interactions among the motion vector field, the intensity segmentation field, and the video segmentation field. The notions of distance transformation and Markov random field are used to express spatiotemporal constraints. Given consecutive frames, an optimization method is proposed to maximize the conditional probability density of the three fields in an iterative way. Experimental results show that the approach is robust and generates spatiotemporally coherent segmentation results.
Yang Wang 0002, Tele Tan, Kia-Fock Loe
CVPR (2)3
2003 Joint Region Tracking with Switching Hypothesized Measurements
abstract
We propose a switching hypothesized measurements (SHM) model supporting multimodal probability distributions and present the application of the model in handling potential variability in visual environments when tracking multiple objects jointly. For a set of occlusion hypotheses, a frame is measured once under each hypothesis, resulting in a set of measurements at each time instant. A computationally efficient SHM filter is derived for online joint region tracking. Both occlusion relationships and states of the objects are recursively estimated from the history of hypothesized measurements. The reference image is updated adaptively to deal with appearance changes of the objects. The SHM model is generally applicable to various dynamic processes with multiple alternative measurement methods.
Yang Wang 0002, Tele Tan, Kia-Fock Loe
ICCV3
2003 A probabilistic method for foreground and shadow segmentation
abstract
This paper presents a probabilistic method for foreground segmentation that distinguishes moving objects from their cast shadows in monocular indoor image sequences. The models of background, shadow, and edge information are set up and adaptively updated. A Bayesian framework is proposed to describe the relationships among the segmentation label, background, intensity, and edge information. A Markov random field is used to boost the spatial connectivity of the segmented regions. The solution is obtained by maximizing the posterior probability density of the segmentation field.
Yang Wang 0002, Tele Tan, Kia-Fock Loe
ICIP (3)3
2003 Boosting Face Identification in Airports
Jiang Liu 0001, Kia-Fock Loe
IJCAI2
2003 Switching Hypothesized Measurements: A Dynamic Model with Applications to Occlusion Adaptive Joint Tracking
Yang Wang 0002, Tele Tan, Kia-Fock Loe
IJCAI3
2002 Robust vision-based features and classification schemes for off-line handwritten digit recognition
Loo-Nin Teow, Kia-Fock Loe
Pattern Recognit.2
2000 Handwritten Digit Recognition with a Novel Vision Model that Extracts Linearly Separable Features
abstract
We use well-established results in biological vision to construct a novel vision model for handwritten digit recognition. We show empirically that the features extracted by our model are linearly separable over a large training set (MNIST). Using only a linear classifier on these features, our model is relatively simple yet outperforms other models on the same data set.
Loo-Nin Teow, Kia-Fock Loe
CVPR2
2000 Selection of Support Vector Kernel Parameters for Improved Generalization
Loo-Nin Teow, Kia-Fock Loe
ICML2
2000 An Uncertainty Framework for Classification
Loo-Nin Teow, Kia-Fock Loe
UAI2
1999 A Method for Deforming Polygonal Shapes into Smooth Spline Surface Models
abstract
The paper describes a new spline formulation that supports deformation of polygonal shapes into smooth spline surface models. Once a polygonal shape with underlying rectangular topology is specified by the user, it is deformed into a smooth surface that interpolates all the polygonal vertices. The user can then modify the default smooth surface by increasing or decreasing the amount of deformation, either globally or locally. This is accomplished by interactively controlling the shape parameters associated with the polygonal vertices. This modeling paradigm is conceptually simple, and allows C/sup 2/ continuous surfaces to be easily designed, even by a novice user.
Chiew-Lan Tai, Kia-Fock Loe, Brian A. Barsky, Yim-Hung Chan
IV2
1999 Learning primitive and scene semantics of images for classification and retrieval
abstract
We present a learning-based semantics approach for classifying and retrieving images.Our approach defines semantics at two levels: (1) primitive semantics at the patch level, extracted automatically from pixel characteristics of patches with supervised learning; and (2) scene semantics at the image level, recognized from the association of primitive semantics of the patches in a self-organizing manner.Images are classified and retrieved according to the similarity in scene semantics.Our experiments so far have yielded highly accurate scene classification results and very promising retrieval performance on a set of diverse natural scene images.
Cheong Yiu Fung, Kia-Fock Loe
ACM Multimedia (2)2
1999 A New Approach for Image Classification and Retrieval (poster abstract)
abstract
No abstract available.
Cheong Yiu Fung, Kia-Fock Loe
SIGIR2
1999 Alpha-spline: A C2 Continuous Spline with Weights and Tension Control
abstract
The /spl beta/-spline provides bins and tension control facilities for creating geometrically continuous curves and surfaces. Although geometric continuity is a more appropriate geometric measurement of smoothness than parametric continuity, parametric continuity is still necessary in some applications. The paper proposes a new C/sup 2/ continuous spline scheme called the /spl alpha/-spline which provides weights and tension control. The new scheme is based on blending a sequence of singular reparametrized line segments with a piecewise NURBS curve. The idea is extended to produce /spl alpha/-spline surfaces.
Chiew-Lan Tai, Kia-Fock Loe
Shape Modeling International2
1998 Effective learning in recurrent max-min neural networks
Loo-Nin Teow, Kia-Fock Loe
Neural Networks2
1997 An Effective Learning Method for Max-Min Neural Networks
Loo-Nin Teow, Kia-Fock Loe
IJCAI2
1997 Speed-up fractal image compression with a fuzzy classifier
Kia-Fock Loe, W. G. Gu, K. H. Phua
Signal Process. Image Commun.1
1996 Topographical mapping forms of objects into gaussian elastic net
Kia-Fock Loe
Neurocomputing1
1996 alpha-B-spline: a linear singular blending B-spline
Kia-Fock Loe
Vis. Comput.1
1996 Surface design via deformation of periodically swept surfaces
Chiew-Lan Tai, Kia-Fock Loe
Vis. Comput.2
1989 Embedding of Binary Trees into Hypercubes
Thomas Bier, Kia-Fock Loe
J. Parallel Distributed Comput.2
1988 An object-oriented language for neural network simulation
Kia-Fock Loe, Loke-Soo Hsu, Sing-Chai Chan, H. B. Low
Neural Networks1