�\�t�g�E�F�A

Higher-Order Clique Reduction �\�t�g�E�F�A (C++�\�[�X�R�[�h)

Version 1.02aJ (2011/11/30; URL�X�V�̂݁B)
�_�E�����[�h: HOCR1.02aJ.zip

�Q�l�ϐ� x1, ..., xn �̍��K�֐����ŏ������邽�߂̃\�t�g�E�F�A(C++�\�[�X�R�[�h)�ł��B ���̊֐������̌`�̂P�K��MRF�i���邢�͂Q���[�u�[���֐��j�ɕϊ����܂��B

E(x1, ..., xn, ..., xm) = Σi Ei(xi) + Σi,j Eij(xi, xj),

���̕ϊ��ɂ���ĂP�K�ɂȂ邽��QPBO��BP�Ȃǂ̃A���S���Y�����K�p�”\�ƂȂ�܂��B �K���팸�̂��߂ɂQ�l�ϐ� xn+1, ..., xm ��lj����܂��B ���̐��͊K���ɂ‚��Ďw���I�ɑ������܂��B

���̎�@�͎��̘_���ɐ�������Ă��܂��F

�ΐ� ��. “���K�O���t�J�b�g.” PDF ��12�� �摜�̔F���E�����V���|�W�E�� (MIRU2009), 2009�N7��20-22��, ���]�s.

Hiroshi Ishikawa. “Higher-Order Clique Reduction in Binary Graph Cut.” PDF
In CVPR2009: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Miami Beach, Florida. June 20-25, 2009.

Hiroshi Ishikawa. “Transformation of General Binary MRF Minimization to the First Order Case.” PDF
IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 6, pp. 1234-1249, June 2011.

�R�K�� Fields of Experts ���g���ăm�C�Y����������f���v���O�����������Ă��܂��B

���̃\�t�g�E�F�A�́AVladimir Kolmogorov�̃y�[�W�������ł��� QPBO�\�t�g�E�F�A�ƈꏏ�Ɏg���ƕ֗��Ȃ悤�ɏ����Ă���܂��B