• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.10
• /
• pp.4807-4813
• /
• 2012

Since the existing methods of segmenting target objects from various images mainly use 2-dimensional features, they have several constraints due to the shortage of 3-dimensional information. In this paper, we therefore propose a new method of accurately segmenting target objects from three dimensional stereoscopic images using 2D and 3D feature clustering. The suggested method first estimates depth features from stereo images by using a stereo matching technique, which represent the distance between a camera and an object from left and right images. It then eliminates background areas and detects foreground areas, namely, target objects by effectively clustering depth and color features. To verify the performance of the proposed method, we have applied our approach to various stereoscopic images and found that it can accurately detect target objects compared to other existing 2-dimensional methods.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.775-778
• /
• 2008

Augmented Reality is a growing area in virtual reality research, The world environment around us provides a wealth of information that is difficult to duplicate in a computer. This evidenced by the worlds used in virtual environments. An augmented reality system generates a composite view for the user. It is a combination of the real scene viewed by the user and a virtual scene generated by the computer that augments the scene with addition information. The registration method represent to the user enhances that person's performance in and perception of the world. It decide the direction and location between real world and 3D graphic objects. The registration method devide two method, Model based tracking and Move-Matching. This paper researched at to generate a commerce correlation using a tracking object method, using at a color distribution and information, in the sequence scene.

• Journal of Satellite, Information and Communications
• /
• v.12 no.1
• /
• pp.101-106
• /
• 2017

In this paper, we present Emergency exit signs are installed to provide escape routes or ways in buildings like shopping malls, hospitals, industry, and government complex, etc. and various other places for safety purpose to aid people to escape easily during emergency situations. In case of an emergency situation like smoke, fire, bad lightings and crowded stamped condition at emergency situations, it's difficult for people to recognize the emergency exit signs and emergency doors to exit from the emergency building areas. This paper propose an automatic emergency exit sing recognition to find exit direction using a smart device. The proposed approach aims to develop an computer vision based smart phone application to detect emergency exit signs using the smart device camera and guide the direction to escape in the visible and audible output format. In this research, a CAMShift object tracking approach is used to detect the emergency exit sign and the direction information extracted using template matching method. The direction information of the exit sign is stored in a text format and then using text-to-speech the text synthesized to audible acoustic signal. The synthesized acoustic signal render on smart device speaker as an escape guide information to the user. This research result is analyzed and concluded from the views of visual elements selecting, EXIT appearance design and EXIT's placement in the building, which is very valuable and can be commonly referred in wayfinder system.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.5 s.311
• /
• pp.45-51
• /
• 2006

Recently, the IDS(Intrusion Detection System) using a video camera is an important part of the home security systems which start gaining popularity. However, the video intruder detection has not been widely used in the home surveillance systems due to its unreliable performance in the environment with abrupt illumination change. In this paper, we propose an effective moving edge extraction algerian from a sequence image. The proposed algorithm extracts edge segments from current image and eliminates the background edge segments by matching them with reference edge list, which is updated at every frame, to find the moving edge segments. The test results show that it can detect the contour of moving object in the noisy environment with abrupt illumination change.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.4
• /
• pp.113-120
• /
• 2004

In this paper, we propose an efficient feature extraction and image retrieval algorithm for content-based retrieval method. First, we extract the object using Gaussian edge detector for input image which is key frames of MPEG video and extract the object features that are location feature, distributed dimension feature and invariant moments feature. Next, we extract the characteristic color feature using the proposed HAQ(Histogram Analysis md Quantization) algorithm. Finally, we implement an retrieval of four features in sequence with the proposed matching method for query image which is a shot frame except the key frames of MPEG video. The purpose of this paper is to propose the novel content-based image retrieval algerian which retrieves the key frame in the shot boundary of MPEG video belonging to the scene requested by user. The experimental results show an efficient retrieval for 836 sample images in 10 music videos using the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1946-1956
• /
• 2001

In this paper, we propose a novel 2-D partial matching algorithm based on model-based stochastic analysis of feature correspondences in a relation vector space, which is quite robust to shape variations as well as invariant to geometric transformations. We represent an object using the ARG (Attributed Relational Graph) model with features of a set of relation vectors. In addition, we statistically model the partial occlusion or noise as the distortion of the relation vector distribution in the relation vector space. Our partial matching algorithm consists of two-phases. First, a finite number of candidate sets areselected by using logical constraint embedding local and structural consistency Second, the feature loss detection is done iteratively by error detection and voting scheme thorough the error analysis of relation vector space. Experimental results on real images demonstrate that the proposed algorithm is quite robust to noise and localize target objects correctly even inseverely noisy and occluded scenes.

• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.201-213
• /
• 2006

A time-series database is a set of time-series data sequences, each of which is a list of changing values of the object in a given period of time. Subsequence matching is an operation that searches for such data subsequences whose changing patterns are similar to a query sequence from a time-series database. This paper addresses a performance issue of time-series subsequence matching. First, we quantitatively examine the performance degradation caused by the window size effect, and then show that the performance of subsequence matching with a single index is not satisfactory in real applications. We argue that index interpolation is fairly useful to resolve this problem. The index interpolation performs subsequence matching by selecting the most appropriate one from multiple indexes built on windows of their inherent sizes. For index interpolation, we first decide the sites of windows for multiple indexes to be built. In this paper, we solve the problem of selecting optimal window sizes in the perspective of physical database design. For this, given a set of query sequences to be peformed in a target time-series database and a set of window sizes for building multiple indexes, we devise a formula that estimates the cost of all the subsequence matchings. Based on this formula, we propose an algorithm that determines the optimal window sizes for maximizing the performance of entire subsequence matchings. We formally Prove the optimality as well as the effectiveness of the algorithm. Finally, we perform a series of extensive experiments with a real-life stock data set and a large volume of a synthetic data set. The results reveal that the proposed approach improves the previous one by 1.5 to 7.8 times.

• The KIPS Transactions:PartB
• /
• v.11B no.1
• /
• pp.27-34
• /
• 2004

This paper proposes a method to trace and interpret a moving object based on the information which can be directly obtained from MPEG-2 compressed video stream without decoding process. In the proposed method, the motion flow is constructed from the motion vectors included in compressed video. We calculate the amount of pan, tilt, and zoom associated with camera operations using generalized Hough transform. The local object motion can be extracted from the motion flow after the compensation with the parameters related to the global camera motion. Initially, a moving object to be traced is designated by user via bounding box. After then automatic tracking Is performed based on the accumulated motion flows according to the area contributions. Also, in order to reduce the cumulative tracking error, the object area is reshaped in the first I-frame of a GOP by matching the DCT coefficients. The proposed method can improve the computation speed because the information can be directly obtained from the MPEG-2 compressed video, but the object boundary is limited by macro-blocks rather than pixels. Also, the proposed method is proper for approximate object tracking rather than accurate tracing of an object because of limited information available in the compressed video data.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.170-178
• /
• 2008

A high performance object recognition algorithm using Fourier description of the 3D information of the objects is proposed. Object boundaries contain sufficient information for recognition in most of objects. However, it is not well utilized as the key solution of the object recognition since obtaining the accurate boundary information is not easy. Also, object boundaries vary highly depending on the size or orientation of object. The proposed object recognition algorithm is based on 1) the accurate object boundaries extracted from the 3D shape which is obtained by the laser scan device, and 2) reduction of the required database using the size and rotational invariant feature of the Fourier Descriptor. Such Fourier information is compared with the database and the recognition is done by selecting the best matching object. The experiments have been done on the rich database of MPEG 7 Part B.

• Journal of Cadastre & Land InformatiX
• /
• v.50 no.1
• /
• pp.215-229
• /
• 2020

In response to the recent 4th industrial revolution, the demand for 3D object models in the latest fields of digital twin, autonomous driving, and VR/AR, as well as the existing fields such as city, construction, transportation, and energy has increased significantly. It is expected that the demand for 3D object models with various precision from LOD1 to LOD4 will increase more and more in various industry fields. However, the Ministry of Land, Infrastructure and Transport, and the local government and the private sector have partially built 3D object models of different precisions for some specific regions because of the huge cost. Therefore, this study proposes a feasible plan that can solve the cost problem in generating 3D object models for the whole territory. For our purpose, we first analyzed usage, demand, generation technology and generation cost for 3D object models. Afterwards, we proposed LOD3 model generation plan for all territory using automatic 3D object model generation technology based on image matching. Additionally, we supplemented the proposed plan by using LOD4 generation plan for landmarks and LOD2 generation plan non-urban area. In the near future, we expect this would be a great help in establishing a feasible and effective 3D object model generation plan for the whole country.