Papers with Code 아카이브

3D Dense Shape Correspondence

태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.

하위 태스크
0
평가표
1
보존된 평가 기록
11

Finding a meaningful correspondence between two or more shapes is one of the most fundamental shape analysis tasks. The problem can be generally stated as: given input shapes S1,S2,...,SN, find a meaningful relation (or mapping) between their elements. Under different contexts, the problem has also been referred to as registration, alignment, or simply, matching. Shape correspondence is a key algorithmic component in tasks such as 3D scan alignment and space-time reconstruction, as well as an indispensable prerequisite in diverse applications including attribute transfer, shape interpolation, and statistical modeling.

평가 결과

데이터셋과 평가 조건을 선택해 성능·논문·코드를 비교하세요. 보존된 Papers with Code 기록으로, 최신 순위는 아닙니다.

SHREC'19

원본 태스크: 3D Shape Representation / 3D Dense Shape Correspondence

평가 기록 11건

출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.