Dong‐Seok Jeong

Dong‐Seok Jeong

Auto-generated profile, based on publicly available information

Dong‐Seok Jeong

Department of Electronic Engineering, Inha University, Incheon 22212, Korea

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 December 2010 in ETRI Journal
Verified
Journal Article
Closed access
PDF file
ACAyoung Cho
Ayoung Cho
WYWon‐Keun Yang
Won‐Keun Yang
WOWeon‐Geun Oh
Weon‐Geun Oh
DJDong‐Seok Jeong
Dong‐Seok Jeong

10 February 2017 in Symmetry
Verified
Journal Article
Open access
PDF file
JJJae Hyup Jeong
Jae Hyup Jeong
IWInsu Won
Insu Won
HYHunjun Yang
Hunjun Yang
BLBowon Lee
Bowon Lee
DJDongseok Jeong
Dongseok Jeong
Deformable objects have changeable shapes and they require a different method of matching algorithm compared to rigid objects. This paper proposes a fast and robust deformable object matching algorithm. First, robust feature points are selected using a statistical characteristic to obtain the feature points with the extraction method. Next, matching pairs are composed by the feature point matching of two images using the matching method. Rapid clustering is performed using the BST (Binary Search Tree) method by obtaining the geometric similarity between the matching pairs. Finally, the matching of the two images is determined after verifying the suitability of the composed cluster. An experiment with five different image sets with deformable objects confirmed the superior robustness and independence of the proposed algorithm while demonstrating up to 60 times faster matching speed compared to the conventional deformable object matching algorithms.

21 July 2016 in Symmetry
Verified
Journal Article
Open access
PDF file
IWInsu Won
Insu Won
JJJae Hyup Jeong
Jae Hyup Jeong
HYHunjun Yang
Hunjun Yang
JKJangwoo Kwon
Jangwoo Kwon
DJDongseok Jeong
Dongseok Jeong
We propose an efficient image-matching method for deformable-object image matching using discrimination of deformable objects and geometric similarity clustering between feature-matching pairs. A deformable transformation maintains a particular form in the whole image, despite local and irregular deformations. Therefore, the matching information is statistically analyzed to calculate the possibility of deformable transformations, and the images can be identified using the proposed method. In addition, a method for matching deformable object images is proposed, which clusters matching pairs with similar types of geometric deformations. Discrimination of deformable images showed about 90% accuracy, and the proposed deformable image-matching method showed an average 89% success rate and 91% accuracy with various transformations. Therefore, the proposed method robustly matches images, even with various kinds of deformation that can occur in them.

31 October 2011 in Journal of Korea Multimedia Society
Verified
Journal Article
Closed access
IWInsu Won
Insu Won
JCJu-Hee Cho
Ju-Hee Cho
SNSang-Il Na
Sang-Il Na
JJJu-Kyong Jin
Ju-Kyong Jin
JJJae-Hyup Jeong
Jae-Hyup Jeong
DJDong-Seok Jeong
Dong-Seok Jeong

8 August 2011 in ETRI Journal
Verified
Journal Article
Open access
PDF file
WYWon-Keun Yang
Won-Keun Yang
ACAyoung Cho
Ayoung Cho
WOWeon‐Geun Oh
Weon‐Geun Oh
DJDong‐Seok Jeong
Dong‐Seok Jeong
This paper presents an image description and matching scheme using synthetic features for a recommendation service. The recommendation service is an example of smart search because it offers something before a user's request. In the proposed extraction scheme, an image is described by synthesized spatial and statistical features. The spatial feature is designed to increase the discriminability by reflecting delicate variations. The statistical feature is designed to increase the robustness by absorbing small variations. For extracting spatial features, we partition the image into concentric circles and extract four characteristics using a spatial relation. To extract statistical features, we adapt three transforms into the image and compose a 3D histogram as the final statistical feature. The matching schemes are designed hierarchically using the proposed spatial and statistical features. The result shows that each feature is better than the compared algorithms that use spatial or statistical features. Additionally, if we adapt the proposed whole extraction and matching scheme, the overall performance will become 98.44% in terms of the correct search ratio.

1 April 2013 in ETRI Journal
Verified
Journal Article
Open access
PDF file
SNSang-Il Na
Sang-Il Na
WOWeon‐Geun Oh
Weon‐Geun Oh
DJDong‐Seok Jeong
Dong‐Seok Jeong
A video signature is a set of feature vectors that compactly represents and uniquely characterizes one video clip from another for fast matching. To find a short duplicated region, the video signature must be robust against common video modifications and have a high discriminability. The matching method must be fast and be successful at finding locations. In this paper, a frame‐based video signature that uses the spatial information and a two‐stage matching method is presented. The proposed method is pair‐wise independent and is robust against common video modifications. The proposed two‐stage matching method is fast and works very well in finding locations. In addition, the proposed matching structure and strategy can distinguish a case in which a part of the query video matches a part of the target video. The proposed method is verified using video modified by the VCE7 experimental conditions found in MPEG‐7. The proposed video signature method achieves a robustness of 88.7% under an independence condition of 5 parts per million with over 1,000 clips being matched per second.