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.

Young C. Park

dblp:34/6148 · DBLP profile ↗
← Back
8ranked-venue papers
6as first author
0since 2021 · last 1996
—ORCID · none

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

Artificial intelligence and machine learning · 6 · 4 first-authorSystems, architecture and hardware · 3 · 3 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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
Robot manipulation · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation › grasping
multifingered grasping
0.031990
Grasp synthesis of polygonal objects · ICRA 1990
Optimal grasping using a multifingered robot hand · ICRA 1990
Finger force computation for manipulation of an object by a multifingered robot hand · ICRA 1989
Robotics › Robot manipulation › grasping
grasp quality evaluation
0.021990
Optimal grasping using a multifingered robot hand · ICRA 1990
Grasp synthesis of polygonal objects · ICRA 1990
Robotics › Robot manipulation › grasping › grasp planning
grasp synthesis
0.011990
Grasp synthesis of polygonal objects · ICRA 1990

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

optimization · 0.0heuristic search · 0.0computational geometry · 0.0generalized matrix inverse · 0.0
YearPublicationVenuePosition
1996 Markov random field based English Part-Of-Speech tagging system
Sung-Young Jung, Young C. Park, Key-Sun Choi, Youngwhan Kim
COLING2
1996 Efficient Inferencing for Sigmoid Bayesian Networks by Reducing Sampling Space
Young S. Han, Young C. Park, Key-Sun Choi
Appl. Intell.2
1996 Automatic Thesaurus Construction Using Bayesian Networks
Young C. Park, Key-Sun Choi
Inf. Process. Manag.1
1995 Automatic Thesaurus Construction Using Bayesian Networks
abstract
Automaticthesaurus construction is accomplished by extracting term relations mechanically.A popular method uses statistical anaJysis to discover the term relations.For low frequency terms, however, the statistical information of the terms cannot be reliably used for deciding the relationship of terms.This problem is generally referred as data sparseness problem.Unfortunately, many studies have been said that the low frequency terms are of most use in information retrieval.In this paper, we formalize the statistical behaviors of terms by using inference network.A formal approach for the data sparseness problem which is crucial in constructing a thesaurus is developed.The validity of this approach is shown by experiments.
Young C. Park, Young S. Han, Key-Sun Choi
CIKM1
1993 Adaptive implementation of optimum MTI processor
Young C. Park, Won K. Kim, Dae Hee Youn
ICASSP (3)1
1990 Optimal grasping using a multifingered robot hand
abstract
Two different grasp indices, the uncertainty grasp index and the task compatibility grasp index, are proposed as a measure of grasp quality. When a robot hand grasps an object, error can occur due to various uncertainties. The uncertainty grasp index represents the effect of grasp position error on stable grasping. Also, when the hand grasps an object, the object will usually be used to accomplish a task. For such a task-oriented grasp, the hand should grasp an object in such a manner that it is stable and at the same time can accomplish the task most effectively. The task compatibility grasp index is formulated to represent how well the identified grasp can perform the task. An optimization problem is formulated to compute the grasp index, and the solution procedure is also presented.>
Young C. Park, Gregory P. Starr
ICRA1
1990 Grasp synthesis of polygonal objects
abstract
A simple and efficient algorithm is presented to find the best force closure grasp on a planar polygon with a three-fingered robot hand. In searching for the best grasp, force closure grasps on each feasible combination of edges and/or vertices are constructed using computational geometry. A heuristic function formulated from the consideration of uncertainty in grasping is used to evaluate the quality of each grasp. A test of the algorithm on several different polygons shows that the resulting grasp is realistic and fast enough for real-time use.>
Young C. Park, Gregory P. Starr
ICRA1
1989 Finger force computation for manipulation of an object by a multifingered robot hand
abstract
The authors present an efficient computational procedure to determine the finger force of a three-fingered robot hand in object manipulation. They first define initial grasping force as the force needed to hold a massless object. Then grasping force and contact normal during manipulation are determined from initial grasping force and initial contact normal by tracking the object displacement. Manipulation force, the finger force required to manipulate an object and to compensate for object weight, is computed by the generalized matrix inverse method. Optimal internal force, when necessary, is determined from the grasping force during manipulation without explicitly solving the optimization problem. The computational burden for determining finger force is less than that of previous methods.>
Young C. Park, Gregory P. Starr
ICRA1