Han-Mu Park

  • Citations Per Year
Learn More
The problems in computer vision of finding the global correspondences across a set of images can be formulated as a multiple graph matching problem consisting of pairwise matching problems. In the multiple graph matching problem, matching consistency is as important as matching accuracy for preventing the contrariety among matched results. Unfortunately,(More)
Multi-attributed graph matching is a problem of finding correspondences between two sets of data while considering their complex properties described in multiple attributes. However, the information of multiple attributes is likely to be oversimplified during a process that makes an integrated attribute, and this degrades the matching accuracy. For that(More)
Recent advances in three-dimensional (3D) video technology have extended the range of our experience while providing various 3D applications to our everyday life. Nevertheless, the so-called visual discomfort (VD) problem inevitably degrades the quality of experience in stereoscopic 3D (S3D) displays. Meanwhile, electroencephalography (EEG) has been(More)
  • 1