CPAMI research seminars - Yun-Qian Miao and Samaneh Hosseini SemnaniExport this event to calendar

Wednesday, November 19, 2014 — 4:00 PM EST

Speaker (4:00 - 4:30)

Yun-Qian Miao

Topic

Discriminative Density Ratio for Classification Domain Adaptation

Abstract

Domain adaptation deals with the challenging problem that has arisen from the distribution difference between the training and the test data. An effective approach is to reweight the training samples to minimize that discrepancy. To be specific, many methods are based on developing Density-ratio (DR) estimation techniques and then applying cost-sensitive learning algorithms to the reweighted data. Although these methods work well for regression problems, their performance on classification problems is unsatisfactory. This is due to the fact that these methods focus on matching the sample marginal distributions without paying attention to preserving the separation between classes in the reweighted space. In this paper, we propose a novel method for Discriminative Density-ratio (DDR) estimation that addresses the aforementioned problem by estimating the density ratio of joint distributions in a class-wise manner. Our approach combines three learning objectives: minimizing generalized risk on the reweighted training data, minimizing class-wise distribution discrepancy, and maximizing the separation margin on the test data. To solve the complex DDR problem, two implementations are presented on the basis of block-coordinate update method. We provide analysis on the theoretical convergence of the presented implementations and demonstrate their effectiveness with extensive experiments conducted on sampling bias scenarios and cross-dataset tasks.


Speaker (4:30 - 5:00)

Samaneh Hosseini Semnani

Topic

Multi-Target Tracking in Large-Scale Surveillance Systems

Abstract

Sensor Networks is an emerging field of study that is expected to touch many aspects of our life. Sensor Networks are well studied and efficiently used in mobile surveillance applications. One key challenge in large-scale surveillance systems is the mobility control and coordination of sensors. One of the most powerful algorithms that has attracted many researchers in the field of mobility control in recent years is the Flocking algorithm . Flocking is a form of cooperative behavior of large number of autonomous interacting agents able to show coordinated group behavior. The self-organizing feature and local communication requirement of flocks can provide deeper insight into the management of sensors in sensor networks.

This work discusses two flocking-based mobility control models, Flocking and Anti- Flocking, used to organize multi-mobile sensor networks in a surveillance area. Although each of these approaches has positive characteristics, each also has its special drawbacks in a surveillance application. Flocking algorithm focuses only on target coverage, while Anti-Flocking algorithm focuses only on area coverage. Semi-Flocking algorithm is presented in this work to fill this gap. The main idea of Semi-Flocking algorithm is to create small flocks of sensors around each target while still leaving some sensors free to search the environment for detection of new targets. The proposed Semi-Flocking algorithm exhibits outstanding performance in meeting the objectives of surveillance application.

Location 
E5 building
Room 5106

,

S M T W T F S
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
4
5
  1. 2019 (218)
    1. December (1)
    2. November (1)
    3. October (5)
    4. September (21)
    5. August (26)
    6. July (40)
    7. June (24)
    8. May (23)
    9. April (35)
    10. March (25)
    11. February (9)
    12. January (10)
  2. 2018 (150)
    1. December (13)
    2. November (25)
    3. October (12)
    4. September (13)
    5. August (7)
    6. July (23)
    7. June (9)
    8. May (6)
    9. April (9)
    10. March (16)
    11. February (10)
    12. January (7)
  3. 2017 (212)
  4. 2016 (242)
  5. 2015 (242)
  6. 2014 (268)
  7. 2013 (192)
  8. 2012 (31)