2021 IEEE International Conference on Acoustics, Speech and Signal Processing

6-11 June 2021 • Toronto, Ontario, Canada

Extracting Knowledge from Information

2021 IEEE International Conference on Acoustics, Speech and Signal Processing

6-11 June 2021 • Toronto, Ontario, Canada

Extracting Knowledge from Information
Login Paper Search My Schedule Paper Index Help

My ICASSP 2021 Schedule

Note: Your custom schedule will not be saved unless you create a new account or login to an existing account.
  1. Create a login based on your email (takes less than one minute)
  2. Perform 'Paper Search'
  3. Select papers that you desire to save in your personalized schedule
  4. Click on 'My Schedule' to see the current list of selected papers
  5. Click on 'Printable Version' to create a separate window suitable for printing (the header and menu will appear, but will not actually print)

Paper Detail

Paper IDIVMSP-2.6
Paper Title UNSUPERVISED COMMON PARTICULAR OBJECT DISCOVERY AND LOCALIZATION BY ANALYZING A MATCH GRAPH
Authors Makoto Okuda, National Institute of Information and Communications Technology, Japan; Shin'ichi Satoh, National Institute of Informatics, Japan; Yoichi Sato, University of Tokyo, Japan; Yutaka Kidawara, National Institute of Information and Communications Technology, Japan
SessionIVMSP-2: Object Detection 2
LocationGather.Town
Session Time:Tuesday, 08 June, 13:00 - 13:45
Presentation Time:Tuesday, 08 June, 13:00 - 13:45
Presentation Poster
Topic Image, Video, and Multidimensional Signal Processing: [IVARS] Image & Video Analysis, Synthesis, and Retrieval
IEEE Xplore Open Preview  Click here to view in IEEE Xplore
Abstract Although the unsupervised discovery and localization of common objects from within a set of images has received considerable attention, the difficulty of this task means that current methods are not sufficiently accurate. This paper describes an unsupervised method that more accurately discovers and localizes common particular objects within a set of images. First, our method constructs a match graph that precisely represents the relationship among particular object proposals extracted from images. The match graph necessarily contains communities, i.e., subgraphs where object proposals with identical subjects are densely connected by edges, indicating matches between local image features in the proposals. Our method determines the common particular objects by scoring the object proposals using a novel node centrality measure for graphs with a community structure, which we call the restrained random-walk centrality. Experiments demonstrate that our method is considerably more accurate than previous approaches on a particular object image set.