879 research outputs found

    μ˜μƒ 기반 동일인 νŒλ³„μ„ μœ„ν•œ λΆ€λΆ„ μ •ν•© ν•™μŠ΅

    Get PDF
    ν•™μœ„λ…Όλ¬Έ (박사)-- μ„œμšΈλŒ€ν•™κ΅ λŒ€ν•™μ› : κ³΅κ³ΌλŒ€ν•™ 전기·정보곡학뢀, 2019. 2. 이경무.Person re-identification is a problem of identifying the same individuals among the persons captured from different cameras. It is a challenging problem because the same person captured from non-overlapping cameras usually shows dramatic appearance change due to the viewpoint, pose, and illumination changes. Since it is an essential tool for many surveillance applications, various research directions have been exploredhowever, it is far from being solved. The goal of this thesis is to solve person re-identification problem under the surveillance system. In particular, we focus on two critical components: designing 1) a better image representation model using human poses and 2) a better training method using hard sample mining. First, we propose a part-aligned representation model which represents an image as the bilinear pooling between appearance and part maps. Since the image similarity is independently calculated from the locations of body parts, it addresses the body part misalignment issue and effectively distinguishes different people by discriminating fine-grained local differences. Second, we propose a stochastic hard sample mining method that exploits class information to generate diverse and hard examples to use for training. It efficiently explores the training samples while avoiding stuck in a small subset of hard samples, thereby effectively training the model. Finally, we propose an integrated system that combines the two approaches, which is benefited from both components. Experimental results show that the proposed method works robustly on five datasets with diverse conditions and its potential extension to the more general conditions.동일인 νŒλ³„λ¬Έμ œλŠ” λ‹€λ₯Έ μΉ΄λ©”λΌλ‘œ 촬영된 각각의 μ˜μƒμ— 찍힌 두 μ‚¬λžŒμ΄ 같은 μ‚¬λžŒμΈμ§€ μ—¬λΆ€λ₯Ό νŒλ‹¨ν•˜λŠ” λ¬Έμ œμ΄λ‹€. μ΄λŠ” κ°μ‹œμΉ΄λ©”λΌμ™€ λ³΄μ•ˆμ— κ΄€λ ¨λœ λ‹€μ–‘ν•œ μ‘μš© λΆ„μ•Όμ—μ„œ μ€‘μš”ν•œ λ„κ΅¬λ‘œ ν™œμš©λ˜κΈ° λ•Œλ¬Έμ— μ΅œκ·ΌκΉŒμ§€ λ§Žμ€ 연ꡬ가 이루어지고 μžˆλ‹€. κ·ΈλŸ¬λ‚˜ 같은 μ‚¬λžŒμ΄λ”λΌλ„ μ‹œκ°„, μž₯μ†Œ, 촬영 각도, μ‘°λͺ… μƒνƒœκ°€ λ‹€λ₯Έ ν™˜κ²½μ—μ„œ 찍히면 μ˜μƒλ§ˆλ‹€ λ³΄μ΄λŠ” λͺ¨μŠ΅μ΄ λ‹¬λΌμ§€λ―€λ‘œ νŒλ³„μ„ μžλ™ν™”ν•˜κΈ° μ–΄λ ΅λ‹€λŠ” λ¬Έμ œκ°€ μžˆλ‹€. λ³Έ λ…Όλ¬Έμ—μ„œλŠ” 주둜 κ°μ‹œμΉ΄λ©”λΌ μ˜μƒμ— λŒ€ν•΄μ„œ, 각 μ˜μƒμ—μ„œ μžλ™μœΌλ‘œ μ‚¬λžŒμ„ κ²€μΆœν•œ 후에 κ²€μΆœν•œ 결과듀이 μ„œλ‘œ 같은 μ‚¬λžŒμΈμ§€ μ—¬λΆ€λ₯Ό νŒλ‹¨ν•˜λŠ” 문제λ₯Ό ν’€κ³ μž ν•œλ‹€. 이λ₯Ό μœ„ν•΄ 1) μ–΄λ–€ λͺ¨λΈμ΄ μ˜μƒμ„ 잘 ν‘œν˜„ν• κ²ƒμΈμ§€ 2) 주어진 λͺ¨λΈμ„ μ–΄λ–»κ²Œ 잘 ν•™μŠ΅μ‹œν‚¬μˆ˜ μžˆμ„μ§€ 두 가지 μ§ˆλ¬Έμ— λŒ€ν•΄μ„œ μ—°κ΅¬ν•œλ‹€. λ¨Όμ € 벑터 곡간 μƒμ—μ„œμ˜ 거리가 이미지 μƒμ—μ„œ λŒ€μ‘λ˜λŠ” νŒŒνŠΈλ“€ μ‚¬μ΄μ˜ μƒκΉ€μƒˆ 차이의 ν•©κ³Ό 같아지도둝 ν•˜λŠ” 맀핑 ν•¨μˆ˜λ₯Ό μ„€κ³„ν•¨μœΌλ‘œμ¨ κ²€μΆœλœ μ‚¬λžŒλ“€ 사이에 신체 λΆ€λΆ„λ³„λ‘œ μƒκΉ€μƒˆλ₯Ό 비ꡐλ₯Ό 톡해 효과적인 νŒλ³„μ„ κ°€λŠ₯ν•˜κ²Œ ν•˜λŠ” λͺ¨λΈμ„ μ œμ•ˆν•œλ‹€. λ‘λ²ˆμ§Έλ‘œ ν•™μŠ΅ κ³Όμ •μ—μ„œ 클래슀 정보λ₯Ό ν™œμš©ν•΄μ„œ 적은 κ³„μ‚°λŸ‰μœΌλ‘œ μ–΄λ €μš΄ μ˜ˆμ‹œλ₯Ό 많이 보도둝 ν•¨μœΌλ‘œμ¨ 효과적으둜 ν•¨μˆ˜μ˜ νŒŒλΌλ―Έν„°λ₯Ό ν•™μŠ΅ν•˜λŠ” 방법을 μ œμ•ˆν•œλ‹€. μ΅œμ’…μ μœΌλ‘œλŠ” 두 μš”μ†Œλ₯Ό κ²°ν•©ν•΄μ„œ μƒˆλ‘œμš΄ 동일인 νŒλ³„ μ‹œμŠ€ν…œμ„ μ œμ•ˆν•˜κ³ μž ν•œλ‹€. λ³Έ λ…Όλ¬Έμ—μ„œλŠ” μ‹€ν—˜κ²°κ³Όλ₯Ό 톡해 μ œμ•ˆν•˜λŠ” 방법이 λ‹€μ–‘ν•œ ν™˜κ²½μ—μ„œ κ°•μΈν•˜κ³  효과적으둜 λ™μž‘ν•¨μ„ 증λͺ…ν•˜μ˜€κ³  보닀 일반적인 ν™˜κ²½μœΌλ‘œμ˜ ν™•μž₯ κ°€λŠ₯성도 확인 ν•  수 μžˆμ„ 것이닀.Abstract i Contents ii List of Tables v List of Figures vii 1. Introduction 1 1.1 Part-Aligned Bilinear Representations . . . . . . . . . . . . . . . . . 3 1.2 Stochastic Class-Based Hard Sample Mining . . . . . . . . . . . . . 4 1.3 Integrated System for Person Re-identification . . . . . . . . . . . . . 5 2. Part-Aligned Bilinear Represenatations 6 2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.3 Our Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.3.1 Two-Stream Network . . . . . . . . . . . . . . . . . . . . . . 10 2.3.2 Bilinear Pooling . . . . . . . . . . . . . . . . . . . . . . . . 12 2.3.3 Loss . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 2.4 Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 2.4.1 Part-Aware Image Similarity . . . . . . . . . . . . . . . . . . 13 2.4.2 Relationship to the Baseline Models . . . . . . . . . . . . . . 15 2.4.3 Decomposition of Appearance and Part Maps . . . . . . . . . 15 2.4.4 Part-Alignment Effects on Reducing Misalignment Issue . . . 19 2.5 Implementation Details . . . . . . . . . . . . . . . . . . . . . . . . . 21 2.6 Experiments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22 2.6.1 Datasets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22 2.6.2 Evaluation Metrics . . . . . . . . . . . . . . . . . . . . . . . 23 2.6.3 Comparison with the Baselines . . . . . . . . . . . . . . . . . 24 2.6.4 Comparison with State-of-the-Art Methods . . . . . . . . . . 25 2.7 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 3. Stochastic Class-Based Hard Sample Mining 35 3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 3.2 Related Works . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 3.3 Deep Metric Learning with Triplet Loss . . . . . . . . . . . . . . . . 40 3.3.1 Triplet Loss . . . . . . . . . . . . . . . . . . . . . . . . . . . 40 3.3.2 Efficient Learning with Triplet Loss . . . . . . . . . . . . . . 41 3.4 Batch Construction for Metric Learning . . . . . . . . . . . . . . . . 42 3.4.1 Neighbor Class Mining by Class Signatures . . . . . . . . . . 42 3.4.2 Batch Construction . . . . . . . . . . . . . . . . . . . . . . . 44 3.4.3 Scalable Extension to the Number of Classes . . . . . . . . . 50 3.5 Loss . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53 3.6 Feature Extractor . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53 3.7 Experiments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54 3.7.1 Datasets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54 3.7.2 Implementation Details . . . . . . . . . . . . . . . . . . . . . 55 3.7.3 Evaluation Metrics . . . . . . . . . . . . . . . . . . . . . . . 56 3.7.4 Effect of the Stochastic Hard Example Mining . . . . . . . . 59 3.7.5 Comparison with the Existing Methods on Image Retrieval Datasets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65 3.8 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .70 4. Integrated System for Person Re-identification 71 4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 4.2 Hard Positive Mining . . . . . . . . . . . . . . . . . . . . . . . . . . 72 4.3 Integrated System for Person Re-identification . . . . . . . . . . . . . 75 4.4 Experiments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75 4.4.1 Comparison with the baselines . . . . . . . . . . . . . . . . . 75 4.4.2 Comparison with the existing works . . . . . . . . . . . . . . 80 4.5 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80 5.Conclusion 83 5.1 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83 5.2 Future Works . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 84 Abstract (In Korean) 94Docto
    • …
    corecore