Papers with Code · CC BY-SA 4.0

데이터셋 탐색

데이터셋의 설명·홈페이지를 찾고, 관련 태스크의 평가 기록을 살펴보세요.

관련 논문 32편

SHape REtrieval Contest

SHREC
SHREC 설명 보기

The SHREC dataset contains 14 dynamic gestures performed by 28 participants (all participants are right handed) and captured by the Intel RealSense short range depth camera. Each gesture is performed between 1 and 10 times by each participant in two way: using one finger and the whole hand. Therefore, the dataset is composed by 2800 sequences captured. The depth image, with a resolution of 640x480, and the coordinates of 22 joints (both in the 2D depth image space and in the 3D world space) are saved for each frame of each sequence in the dataset. Source: Exploiting Recurrent Neural Networks and Leap Motion Controller for Sign Language and Semaphoric Gesture Recognition Image Source: http://tosca.cs.technion.ac.il/book/shrec.html

관련 논문 20편

SHREC'19 track Matching Humans with Different Connectivity

SHREC'19
SHREC'19 설명 보기

Shape matching plays an important role in geometry processing and shape analysis. In the last decades, much research has been devoted to improve the quality of matching between surfaces. This huge effort is motivated by several applications such as object retrieval, animation and information transfer just to name a few. Shape matching is usually divided into two main categories: rigid and non rigid matching. In both cases, the standard evaluation is usually performed on shapes that share the same connectivity, in other words, shapes represented by the same mesh. This is mainly due to the availability of a “natural” ground truth that is given for these shapes. Indeed, in most cases the consistent connectivity directly induces a ground truth correspondence between vertices. However, this standard practice obviously does not allow to estimate the robustness of a method with respect to different connectivity. With this track, we propose a benchmark to evaluate the performance of point-to-point matching pipelines when the shapes to be matched have different connectivity (see Figure 1). We consider the concurrent presence of 1) different meshing, 2) rigid transformation in 3D space, 3) non-rigid deformations, 4) different vertex density, ranging from 5K to more than 50K, and 5) topological changes induced by mesh gluing in areas of contact. The correspondence between these shapes is obtained through the recently proposed registration pipeline FARM [1]. This method provides a high-quality registration of the SMPL model [2] to a large set of human meshes coming from different datasets from which we obtain a well-defined correspondence for all the meshes registered and SMPL itself.

관련 논문 1편

SHREC 2016 TRACK: PARTIAL MATCHING OF DEFORMABLE SHAPES

SHREC'16 Partial Benchmark
SHREC'16 Partial Benchmark 설명 보기

Finding a correspondence between two shapes is a fundamental task in computer graphics and geometry processing with applications ranging from texture mapping to animation. A particularly challenging and widely studied setting is when shapes are allowed to undergo quasi-isometric deformations, as it happens when we consider articulated bodies in different poses. An even more interesting scenario is partial correspondence, where one is shown only a subset of the shape, and has to match it with a deformable version thereof. Partial correspondence problems arise in numerous applications that involve real data acquisition by 3D sensors, which inevitably leads to missing parts due to occlusions and partial views. We propose a benchmark to evaluate the performance of algorithms for establishing correspondences between a full shape and its deformed versions, under the presence of different amounts and kinds of partiality.