Publications

Detailed Information

Correspondence Matching Algorithm Based on Mutual Information Similarity for Multi-View Video Sequences

DC Field Value Language
dc.contributor.advisor이상욱-
dc.contributor.author이순영-
dc.date.accessioned2017-07-13T06:53:23Z-
dc.date.available2017-07-13T06:53:23Z-
dc.date.issued2012-08-
dc.identifier.other000000003344-
dc.identifier.urihttps://hdl.handle.net/10371/118848-
dc.description학위논문 (박사)-- 서울대학교 대학원 : 전기·컴퓨터공학부, 2012. 8. 이상욱.-
dc.description.abstractThe multi-view video sequences are essentially used for many computer vision applications such as surveillance system. For these applications, the correspondence matching that identifies the corresponding positions of one view to another is essentially required. The correspondence matching has been fundamentally researched for a long time, however, it is still challenging for multi-view video sequences. In this dissertation, the correspondence matching algorithm and its applications for the multi-view video sequences are presented.

First, an accurate and robust similarity measure for the correspondence matching of multi-view video sequences captured by arbitrarily positioned cameras is proposed. We use an activity vector, which represents the temporal occurrence pattern of moving foreground objects at a pixel position, as an invariant feature for correspondence matching. Activity vectors are derived from a moving object detection algorithm, so it is robust to illumination changes and additive noises. Then, we devise a novel similarity measure between two activity vectors by considering the joint and individual behavior of the activity vectors. Specifically, we define random variables associated with the activity vectors and represent the similarity between them using the mutual information based similarity (MIBS) measure. Because the MIBS measure adaptively explains the behaviors between two activity vectors, it outperforms other conventional similarity measures of binary vectors especially for a correspondence matching problem.

Then, the framework for finding correspondence matching between two multi-view surveillance sequences is proposed. In order to achieve a more accurate and robust inter-view homography, three practical techniques are utilized. The first technique is the adaptive activity area refinement which represents actual ground regions touched by foreground objects moving on the ground plane. It reduces the discrepancy between objects areas and actual ground surfaces, so that the activity vectors can effectively feature geometry surfaces in the scenes. In addition, we propose the consistent pixel positions on which the MIBS measure is reliably evaluated. At consistent pixel positions, the maximum MIBS criterion is satisfied backward and forward, therefore, we can yield more accurate correspondence matchings. Finally, the correspondence at multiple pixel positions are determined by minimizing a matching cost function associated with the MIBS measure and structure preservation terms.

The proposed correspondence matching algorithm is robust to various positions of cameras and illumination/color differences between cameras. Moreover, the proposed MIBS measure reliably represents the similarity of two binary vectors even under the additive noises. Therefore, the results of proposed algorithm demonstrate the correspondences between two different views are more accurately and reliably estimated than the conventional state-of-the-art algorithm with a relatively small computational complexity. These results indicate that the proposed algorithm is a very promising technique for various multi-view video applications for a visual surveillance such as homograpy estimation and panoramic view synthesis.
-
dc.description.tableofcontents1 Introduction 1
1.1 Background and Research Issues 1
1.1.1 Multi-view Video Sequences 1
1.1.2 Correspondence Problem 3
1.2 Outline of the Dissertation 5
2 Preliminaries 7
2.1 Binary Similarity Measures 7
2.1.1 Non-correlation Based Similarity Measures 9
2.1.2 Correlation Based Similarity Measures 14
2.2 Mutual Information 17
3 Mutual Information based Similarity Measure for Binary Activity Vectors 21
3.1 Introduction 21
3.2 Similarity Measure for Correspondence Matching 23
3.2.1 Activity Based Correspondence Matching 24
3.2.2 Generalized SimilarityMeasure for Activity 27
3.2.3 Mutual Information Based Similarity Measure 29
3.3 Experimental Results 33
3.3.1 Test Sample Sequences 33
3.3.2 Performance ofMIBSMeasure 37
3.3.3 Comparison to Other Similarity Measures 44
3.4 Conclusion 44
4 Correspondence Matching for Multi-View Surveillance Video Sequences using MIBS measure 51
4.1 Introduction 51
4.2 Related Works 54
4.2.1 Correspondence Matching of Images 54
4.2.2 Correspondence Matching of Videos 55
4.3 Proposed Algorithm 56
4.3.1 Adaptive Activity Area 56
4.3.2 Selection of Consistent Pixel Positions 61
4.3.3 MRF-Based Optimization 64
4.3.4 Additional Color Information 66
4.4 Experimental results 70
4.4.1 Performance Evaluation of Adaptive Activity Area 70
4.4.2 MRF Optimization with Consistent Pixel Positions 72
4.4.3 Application to Panoramic View Synthesis 80
4.5 Conclusion 84
5 Conclusions 85
Bibliography 88
-
dc.formatapplication/pdf-
dc.format.extent15246468 bytes-
dc.format.mediumapplication/pdf-
dc.language.isoen-
dc.publisher서울대학교 대학원-
dc.subjectmulti-view video-
dc.subjectcorrespondence matching-
dc.subjectmutual information-
dc.subject.ddc621-
dc.titleCorrespondence Matching Algorithm Based on Mutual Information Similarity for Multi-View Video Sequences-
dc.typeThesis-
dc.contributor.AlternativeAuthorLee, Soon-Young-
dc.description.degreeDoctor-
dc.citation.pagesxvii, 96-
dc.contributor.affiliation공과대학 전기·컴퓨터공학부-
dc.date.awarded2012-08-
Appears in Collections:
Files in This Item:

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share