• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.415-418
• /
• 2003

칼라 히스토그램 인터섹션 방법은 칼라 분포간의 유사도를 측정하는데 널리 사용된다 하지만 이 방법은 칼라 공간을 고정된 칼라수로 양자화시킨 경우에만 유효하므로 칼라 공간에 대한 분할 문제와 양자화 레벨의 결정 문제를 내포하고 있다. 이에, 본 논문에서는 고정 양자화된 칼라 분포뿐만 아니라 적응적 양자화되어 상이한 칼라분포를 갖는 영상간의 정합에 적용 가능한 확장 칼라 히스토그램 인터섹션 방법을 제안한다. 제안된 방법은 생산자가 생산된 상품을 소비자에게 공급하는 동안 생산효율을 계산하여 경제적 이익을 최대화 시키기 위한 생산자-소비자 모델로 간주되어질 수 있다 실험을 통해 우리는 제안된 방법이 두 칼라 분포간의 유사도를 효과적으로 측정할 수 있음을 확인하였다

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.1
• /
• pp.101-109
• /
• 2011

This paper describes the attempts to improve the performance of an image matching method for multiple image. Typically, matching between two images is performed by using correlation between a reference and corresponding images. The proposed multiple image matching algorithm performs matching in an object space, chooses the image closest to the true vertical image as a reference image, calculates the correlation based on the chosen reference image. The algorithm also detects occluded regions automatically and keep them from matching. We could find that it is possible to create high quality DEM by this method, regardless of the location of image. From the performance improvement experiments through the occlusion detection, we could confirm the possibility of a more accurate representation of 3D information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.4
• /
• pp.701-711
• /
• 1994

In this paper, we design wavelet matched filters using Wavelet Transform available in the field of time-frequency analysis, for the optical patter recognition, and study optical correlation properites according to variations of the dilation factor of wavelet functions, which were compared with conventional matched filter and POF. We have found that the wavelet matched filters depend upon the shapes if used input patterns and dilation factors of the wavelet function in order to have the best dicriminability. Also, we show the edge enhanced effects of 2-D image, which is one of the properities of the wavelet transform. If has been found that the wavelet matched filter can discriminate better than the conventional matched filter and POF owing to their bandpass properties, and found that the proposed wavelet matched filters have more sensitive correlation response than POF.

• Korean Journal of Remote Sensing
• /
• v.30 no.6
• /
• pp.787-795
• /
• 2014

This paper presents an image registration using Triangulation-based Local Transformation (TLT) applied to the remaining matched points after elimination of the matched points with gross error. The corners extracted using geometric mean-based corner detector are matched using Pearson's correlation coefficient and then accepted as initial matched points only when they satisfy the Left-Right Consistency (LRC) check. We finally accept the remaining matched points whose RANdom SAmple Consensus (RANSAC)-based global transformation (RGT) errors are smaller than a predefined outlier threshold. After Delaunay triangulated irregular networks (TINs) are created using the final matched points on reference and sensed images, respectively, affine transformation is applied to every corresponding triangle and then all the inner pixels of the triangles on the sensed image are transformed to the reference image coordinate. The proposed algorithm was tested using KOMPSAT-2 images and the results showed higher image registration accuracy than the RANSAC-based global transformation.

• Journal of Navigation and Port Research
• /
• v.32 no.5
• /
• pp.355-361
• /
• 2008

Stereo matching is one of the most active research areas in computer vision. In this paper, we propose a stereo matching scheme using genetic algorithm for object depth recognition. The proposed approach considers the matching environment as an optimization problem and finds the optimal solution by using an evolutionary strategy. Accordingly, genetic operators are adapted for the circumstances of stereo matching. An individual is a disparity set. Horizontal pixel line of image is considered as a chromosome. A cost function is composed of certain constraints which are commonly used in stereo matching. Since the cost function consists of intensity, similarity and disparity smoothness, the matching process is considered at the same time in each generation. The LoG(Laplacian of Gaussian) edge is extracted and used in the determination of the chromosome. We validate our approach with experimental results on stereo images.

• The KIPS Transactions:PartB
• /
• v.19B no.2
• /
• pp.113-122
• /
• 2012

This paper presents a new stereo matching technique which is based on the matching of feature windows and feature links. The proposed method uses the FAST feature detector to find image features in stereo images and determines the correspondences of the detected features in the stereo images. We define a feature window which is an image region containing several image features. The proposed technique consists of two matching steps. First, a feature window is defined in a standard image and its correspondence is found in a reference image. Second, the corresponding features between the matched windows are determined by using the feature link technique. If there is no correspondence for an image feature in the standard image, it's disparity is interpolated by neighboring feature sets. We evaluate the accuracy of the proposed technique by comparing our results with the ground truth of in a stereo image database. We also compare the matching accuracy and computation time with two conventional feature-based stereo matching techniques.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.125-133
• /
• 2003

In this paper we propose an efficient content-based image retrieval method using the color and wavelet based texture features. The color features are obtained from soft-color histograms of the global image and the wavelet-based texture features are obtained from the invariant moments of the high-pass sub-band through the spatial-frequency analysis of the wavelet transform. The proposed system, called a color and texture based two-step retrieval(CTBTR), is composed of two-step query operations for an efficient image retrieval. In the first-step matching operation, the color histogram features are used to filter out the dissimilar images quickly from a large image database. The second-step matching operation applies the wavelet based texture features to the retained set of images to retrieve all relevant images successfully. The experimental results show that the proposed algorithm yields more improved retrieval accuracy with computationally efficiency than the previous methods.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.1
• /
• pp.1-9
• /
• 2013

This paper proposes a matching algorithm to find corresponding polygon feature sets between heterogeneous digital maps. The algorithm finds corresponding sets in terms of optimizing their shape similarities based on the assumption that the feature sets describing the same entities in the real world are represented in similar shapes. Then, by using a binary code, it is represented that a polygon feature is chosen for constituting a corresponding set or not. These codes are combined into a binary string as a candidate solution of the matching problem. Starting from initial candidate solutions, a genetic algorithm iteratively optimizes the candidate solutions until it meets a termination condition. Finally, it presents the solution with the highest similarity. The proposed method is applied for the topographical and cadastral maps of an urban region in Suwon, Korea to find corresponding polygon feature sets for block areas, and the results show its feasibility. The results were assessed with manual detection results, and showed overall accuracy of 0.946.

• Journal of Korea Multimedia Society
• /
• v.16 no.8
• /
• pp.927-933
• /
• 2013

Face detection algorithm of OpenCV recognizes the faces by Haar matching between input image and Haar features which are learned through a set of training images consisting of many front faces. Therefore the face detection method by Haar matching yields a high face detection rate for the front faces but not in the case of the pan and deformed faces. On the assumption that distributional characteristics of color histogram is similar even if deformed or side faces, a face detection method using the histogram pattern matching is proposed in this paper. In the case of the missed detection and false detection caused by Haar matching, the proposed face detection algorithm applies the histogram pattern matching with the correct detected face area of the previous frame so that the face region with the most similar histogram distribution is determined. The experiment for evaluating the face detection performance reveals that the face detection rate was enhanced about 8% than the conventional method.

• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.610-617
• /
• 2003

Similarity matching in video database is of growing importance in many new applications such as video clustering and digital video libraries. In order to provide efficient access to relevant data in large databases, there have been many research efforts in video indexing with diverse spatial and temporal features. however, most of the previous works relied on sequential matching methods or memory-based inverted file techniques, thus making them unsuitable for a large volume of video databases. In order to resolve this problem, this paper proposes an effective and scalable indexing technique using a trie, originally proposed for string matching, as an index structure. For building an index, we convert each frame into a symbol sequence using a window order heuristic and build a disk-resident trie from a set of symbol sequences. For query processing, we perform a depth-first search on the trie and execute a temporal segmentation. To verify the superiority of our approach, we perform several experiments with real and synthetic data sets. The results reveal that our approach consistently outperforms the sequential scan method, and the performance gain is maintained even with a large volume of video databases.