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

Joon H. Han

dblp:58/4888 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
0since 2021 · last 2006
—ORCID · none

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

Artificial intelligence and machine learning · 6 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-authorSystems, architecture and hardware · 1Applied, interdisciplinary, general and emerging 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
3 papers
Image recognition and object detection · 34% Probabilistic and Bayesian machine learning · 34% 3D vision · 25%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Computer graphics and multimedia
2 papers
Image and video processing · 100%

Topics — the 10 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning
fuzzy classification
0.011999
A Fuzzy K-NN Algorithm Using Weights from the Variance of Membership Values · CVPR 1999
Computer vision › Image recognition and object detection
image classification
0.011999
A Fuzzy K-NN Algorithm Using Weights from the Variance of Membership Values · CVPR 1999
Data mining
clustering
0.011999
A Fuzzy K-NN Algorithm Using Weights from the Variance of Membership Values · CVPR 1999
Data mining › predictive modeling › classification
nearest neighbor classification
0.011999
A Fuzzy K-NN Algorithm Using Weights from the Variance of Membership Values · CVPR 1999
Image and video processing › industrial inspection
surface inspection
0.011991
Classification of complex patterns for surface inspection · ICRA 1991
Computer vision › 3D vision › range sensing
range image analysis
0.011990
Detection of convex and concave discontinuous points in a plane curve · ICCV 1990
Image and video processing
feature detection
0.011990
Detection of convex and concave discontinuous points in a plane curve · ICCV 1990
Computer vision › 3D vision
3d scene understanding
0.011988
Region grouping from a range image · CVPR 1988
Computer vision › 3D vision › range sensing
range image segmentation
0.011988
Region grouping from a range image · CVPR 1988
Computer vision › Segmentation and scene understanding › image segmentation › region-based segmentation
region merging
0.011988
Region grouping from a range image · CVPR 1988

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

variance weighting · 0.0membership values · 0.0second derivative of gaussian · 0.0impulse response analysis · 0.0statistical pattern recognition · 0.0organizational feature set · 0.0region boundary graph · 0.0convex region set · 0.0
YearPublicationVenuePosition
2006 Outlier correction from uncalibrated image sequence using the Triangulation method
Jae-Hak Kim, Joon H. Han
Pattern Recognit.2
2005 Correlation and prediction of gene expression level from amino acid and dipeptide composition of its protein
abstract
BACKGROUND: A large number of papers have been published on analysis of microarray data with particular emphasis on normalization of data, detection of differentially expressed genes, clustering of genes and regulatory network. On other hand there are only few studies on relation between expression level and composition of nucleotide/protein sequence, using expression data. There is a need to understand why particular genes/proteins express more in particular conditions. In this study, we analyze 3468 genes of Saccharomyces cerevisiae obtained from Holstege et al., (1998) to understand the relationship between expression level and amino acid composition. RESULTS: We compute the correlation between expression of a gene and amino acid composition of its protein. It was observed that some residues (like Ala, Gly, Arg and Val) have significant positive correlation (r > 0.20) and some other residues (Like Asp, Leu, Asn and Ser) have negative correlation (r < -0.15) with the expression of genes. A significant negative correlation (r = -0.18) was also found between length and gene expression. These observations indicate the relationship between percent composition and gene expression level. Thus, attempts have been made to develop a Support Vector Machine (SVM) based method for predicting the expression level of genes from its protein sequence. In this method the SVM is trained with proteins whose gene expression data is known in a given condition. Then trained SVM is used to predict the gene expression of other proteins of the same organism in the same condition. A correlation coefficient r = 0.70 was obtained between predicted and experimentally determined expression of genes, which improves from r = 0.70 to 0.72 when dipeptide composition was used instead of residue composition. The method was evaluated using 5-fold cross validation test. We also demonstrate that amino acid composition information along with gene expression data can be used for improving the function classification of proteins. CONCLUSION: There is a correlation between gene expression and amino acid composition that can be used to predict the expression level of genes up to a certain extent. A web server based on the above strategy has been developed for calculating the correlation between amino acid composition and gene expression and prediction of expression level http://kiwi.postech.ac.kr/raghava/lgepred/. This server will allow users to study the evolution from expression data.
Gajendra P. S. Raghava, Joon H. Han
BMC Bioinform.2
2001 A corner preserving surface inference algorithm using 3D convolution
Jae-Hak Kim, Joon H. Han
Pattern Recognit. Lett.2
1999 A Fuzzy K-NN Algorithm Using Weights from the Variance of Membership Values
abstract
In this paper, a new fuzzy K-nearest neighbor (K-NN) algorithm, called "Variance Weighted Fuzzy K-NN", is proposed. The main idea of this method is in giving weights to neighbors according to the standard deviation of their class membership values which reflect the value of a discriminant function. The classification results of 32 classes of complex images are given. Compared to the K-NN and fuzzy K-NN algorithms, our method shows an improved classification rate for various conditions.
Joon H. Han, Yoon K. Kim
CVPR1
1991 Classification of complex patterns for surface inspection
abstract
The authors propose a method of statistical visual pattern recognition with an optimum organizational feature set which can be applied to the classification of complex 2D shapes. This method can be applied to the classification of complicated patterns present on the surfaces of materials. The advantages of this method come from the organizational feature set, which partitions a pattern vector in such a way as to minimize the loss of information caused by the partitioning, and from the paradigmatic representations of object classes, which contain probabilities of all states of the feature vectors of the classes. Classification performance showed that the proposed method is superior to the method which uses randomly selected features.>
Kwang J. Cho, Joon H. Han
ICRA2
1990 Detection of convex and concave discontinuous points in a plane curve
abstract
A simple and reliable method is presented for detecting concave and convex discontinuous points in plane curves. The method can be applied to detect feature points in 2-D binary images or it can be used in detecting surface boundaries in range images. The author also shows that the impulse response of the detection method is similar to that of the second derivative of a Gaussian operator. Some experimental results are given with 2-D images and range images.>
Joon H. Han
ICCV1
1988 Region grouping from a range image
abstract
A novel method is presented for grouping range image regions such that each group of regions represents a meaningful part of an object. The set of regions, defined as a convex region set (CRS), is obtained by analyzing the boundary types between a pair of regions. The boundary types are classified as convex, concave and jump boundaries. If two regions share a convex boundary it is assumed that they are inseparable regions, thus describing the same part (object). The CRSs are determined by a region boundary graph (RBG) which is defined as a graph whose nodes represent regions, and the edges represent boundaries: convex and concave. Since jump boundaries represent no physical contact in 3-D, they are represented as null edges. A CRS is defined as a set of regions (or nodes in an RBG) such that for each pair of regions in the set, there is a path, which is represented only by convex edges. The physical interpretation is that a CRS represents part of an object such that the regions in the set cannot be separated.>
Joon H. Han, Richard A. Volz
CVPR1