• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.63-69
• /
• 2013

A feature-based image recognition method, using features of an object, can be performed faster than a template matching technique. Invariant feature-based panoramic image generation, an application of image recognition, requires large amount of time to match features between two images. This paper proposes a speed-up method of feature matching using feature strength information. Our algorithm extracts features in images, computes their feature strength information, and selects strong features points which are used to match the selected features. The strong features can be referred to as meaningful ones than the weak features. In the experiments, it was shown that our method speeded up over 40% of processing time than the technique without using feature strength information.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.385-388
• /
• 2013

In this paper, we show the weakness of the image matching method by using MPEG-7 EHD(Edge Histogram Descriptor) and suggest how to improve this weakness by using image normalization. EHD algorithm is an image matching technique that collects edge's slope of distribution and same distribution. However, the EHD error rate is high because EHD is sensitive for changes of object distortion and rotation that will be matched. We improve matching performance by accurately extract edge information in image by using normalization. We compare and analyze the normalized EHD algorithm by using distortion and rotation and it shows robustness for changes of the size and rotation.

• Journal of Biomedical Engineering Research
• /
• v.20 no.1
• /
• pp.59-68
• /
• 1999

In this paper, we propose an algorithm to locate the corpus callosum automatically from midsagittal brain MR images using the statistical characteristics and shape information of the corpus callosum. In the proposed algorithm, we first extract regions satisfying the statistical characteristics of the corpus callosum and then find a region matching the shape information. In order to match the shape information, a new directed window region-growing algorithm is proposed instead of using conventional contour matching algorithms. Using the proposed algorithm, we adaptively relax the statistical requirement until we find a region matching the shape information. Experiments show promising results.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.166-169
• /
• 2017

Currently, studies using Deep Learning are actively carried out showing good results in many fields. A template matching method is mainly used to recognize parts mounted on PCB(Printed Circuit Board). However, template matching should have multiple templates depending on the shape, orientation and brightness. And it takes long time to perform matching because it searches for the entire image. And there is also a disadvantage that the recognition rate is considerably low. In this paper, we use the Faster-RCNN method for recognizing PCB components as machine learning for classifying several objects in one image. This method performs better than the template matching method, execution time and recognition.

• Journal of Internet Computing and Services
• /
• v.21 no.1
• /
• pp.33-43
• /
• 2020

Retrieving a 3D model from a 3D database and augmenting the retrieved model in the Augmented Reality system simultaneously became an issue in developing the plausible AR environments in a convenient fashion. It is considered that the sketch-based 3D object retrieval is an intuitive way for searching 3D objects based on human-drawn sketches as query. In this paper, we propose a novel deep learning based approach of retrieving a sketch-based 3D object as for an Augmented Reality Model. For this work, we introduce a new method which uses Sketch CNN, Wasserstein CNN and Wasserstein center loss for retrieving a sketch-based 3D object. Especially, Wasserstein center loss is used for learning the center of each object category and reducing the Wasserstein distance between center and features of the same category. The proposed 3D object retrieval and augmentation consist of three major steps as follows. Firstly, Wasserstein CNN extracts 2D images taken from various directions of 3D object using CNN, and extracts features of 3D data by computing the Wasserstein barycenters of features of each image. Secondly, the features of the sketch are extracted using a separate Sketch CNN. Finally, we adopt sketch-based object matching method to localize the natural marker of the images to register a 3D virtual object in AR system. Using the detected marker, the retrieved 3D virtual object is augmented in AR system automatically. By the experiments, we prove that the proposed method is efficiency for retrieving and augmenting objects.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.1
• /
• pp.27-40
• /
• 2006

The exchange of parameterized feature-based CAD models is important for product data sharing among different organizations and automation systems. The role of feature-based modeling is to gonerate the shape of product and capture design intends In a CAD system. A feature is generated by referring to topological entities in a solid. Identifying referenced topological entities of a feature is essential for exchanging feature-based CAD models through a neutral format. If the CAD data contains the modification history in addition to the construction history, a matching mechanism is also required to find the same entity in the new model (post-edit model) corresponding to the entity in the old model (preedit model). This problem is known as the persistent naming problem. There are additional problems arising from the exchange of parameterized feature-based CAD models. Authors have analyzed previous studies with regard to persistent naming and characteristics for the exchange of parameterized feature-based CAD models, and propose a solution to the persistent naming problem. This solution is comprised of two parts: (a) naming of topological entities based on the object spore information (OSI) and secondary name (SN); and (b) name matching under the proposed naming.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.3
• /
• pp.83-91
• /
• 2011

Recently, many researchers in the world are concentrated to develop the robot platform which is to reduce the developing cost by reusing existing softwares. In this paper, we describe that the 3 dimension recognition object components for OPRoS (Open Platform for Robotic Services) which is developed in Korea. We present that the structure of the component, disparity map and depth map algorithm for recognizing 3 dimension space. We used stereo matching and block matching method to produce the disparity map. We test the component on the computer with OPRoS platform and show the results of accuracy and performance time.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2000.11b
• /
• pp.279-286
• /
• 2000

The objective of this research is to detect the papaya fruits on tree in an orchard. The detection of papaya on natural background is difficult because colors of fruits and background such as leaves are similarly green. We cannot separate it from leaves by color information. Therefore, this research will use shape information instead. First, we detect an interested object by detecting its boundary using edge detection technique. However, the edge detection will detect every objects boundary in the image. Therefore, shape description technique will be used to describe which one is the interested object boundary. The good shape description should be invariant in scaling, rotating, and translating. The successful concept is to use Fourier series, which is called "Fourier Descriptors". Elliptic Fourier Descriptors can completely represent any shape, which is selected to describe the shape of papaya. From the edge detection image, it takes a long time to match every boundary directly. The pre-processing task will reduce non-papaya edge to speed up matching time. The deformable template is used to optimize the matching. Then, clustering the similar shapes by the distance between each centroid, papaya can be completely detected from the background.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.1
• /
• pp.19-26
• /
• 2004

In this paper, we suggest a 3D vision inspection method which use only one camera. If we have the database of pattern and can recognize the object, and also estimate the rotated shape of the parts, we can inspect the parts using only one image. We used the 3D database and the 2D geometrical pattern matching, and the rotation transition theory about the algorithm. As the results, we could have the capability of the recognition and inspection of the rotated object through the estimation of rotation an81e. We applied our suggested algorithm to the inspection of typical IC and capacitor, and compared our suggested algorithm with the conventional 2D inspection method and the feature space trajectory method.

• Journal of Korea Multimedia Society
• /
• v.19 no.9
• /
• pp.1647-1658
• /
• 2016

RGB+D database has been widely used in object recognition, object tracking, robot control, to name a few. While rapid advance of active depth sensing technologies allows for the widespread of indoor RGB+D databases, there are only few outdoor RGB+D databases largely due to an inherent limitation of active depth cameras. In this paper, we propose a novel method used to build outdoor RGB+D databases. Instead of using active depth cameras such as Kinect or LIDAR, we acquire a pair of stereo image using high-resolution stereo camera and then obtain a depth map by applying stereo matching algorithm. To deal with estimation errors that inevitably exist in the depth map obtained from stereo matching methods, we develop an approach that estimates confidence of depth maps based on unsupervised learning. Unlike existing confidence estimation approaches, we explicitly consider a spatial correlation that may exist in the confidence map. Specifically, we focus on refining confidence feature with the assumption that the confidence feature and resultant confidence map are smoothly-varying in spatial domain and are highly correlated to each other. Experimental result shows that the proposed method outperforms existing confidence measure based approaches in various benchmark dataset.