partial 3d shape retrieval - university of groningenjiri/papers/16takodoposter.pdf · results show...

1
Abstract Retrieving appropriate 3D objects from a data- base given only partial information such as point clouds, range scans or sketches is a chal- lenge. We address this problem in three ways: a novel saliency method for keypoint de- tection on point clouds an evaluation of how salient points affect retrieval a novel semantic-based descriptor for 3D shapes, range scans, sketches and images. Flora P. Tasse 1 Partial 3D Shape Retrieval Jiří Kosinka 1,2 Neil Dodgson 1,3 1 Rainbow Group, University of Cambridge, United Kingdom, flora.ponjou-tasse (at) cl.cam.ac.uk 2 Scientific Visualization and Computer Graphics, University of Groningen, Netherlands, j.kosinka (at) rug.nl 3 Computer Graphics, Victoria University of Wellington, New Zealand, neil.dodgson (at) vuw.ac.nz Part 2: How well do salient features perform for bag of features shape retrieval? (Computer & Graphics, 2016) Part 1: Cluster-based point set saliency for keypoint detection (ICCV, 2015) Adaptive fuzzy clustering Keypoint detection We present a method for computing cluster and point saliency from a set of fuzzy clusters. Saliency is based on uniqueness and distribution of Fast Point Feature Histograms [1]. We apply the proposed saliency to keypoint extraction, and show it is robust to noise. Part 3: Shape2Vec, semantic-based descriptors for 3D shapes, range scans, hand-drawn sketches and natural images We investigate how sparse features based on saliency models affect retrieval. Random features and ground-truth salient features are eval- uated, as well as state-of-the-art saliency models for keypoint detection. Results show that random features outperform salient features even when as few as 50 points are used per shape. Poor performance on range scan queries suggests that Bag of features is not suitable for partial queries. We propose a supervised method for generating shape descriptors that are embedded in a word vector space, making it possible to support shape-based and text-based queries. The same tech- nique is used for sketches, color images and RGB-D images, which allows assessment of cross-mod- al similarities. Sketch-based shape retrieval using Shape2Vec outperforms state-of-the-art, by a mean average precision difference of 49% (22.8% to 74.8%), on the SHREC14 Sketch-based Retrieval benchmark. Point saliency Cluster saliency Ground-truth [2] mAP = 0.79 Random mAP= 0.9 Mesh saliency [3] mAP= 0.77 Point set saliency mAP = 0.65 Range scan-based retrieval using random local features and VLAD encoding. [1] R. B. Rusu, N. Blodow and M. Beetz, "Fast Point Feature Histograms (FPFH) for 3D registration," ICRA2009. [2] Xiaobai Chen, Abulhair Saparov, Bill Pang, and Thomas Funkhouser, "Schelling Points on 3D Surface Meshes", SIG- GRAPH 2012. [3] Ran Song, Yonghuai Liu, Ralph R. Martin, and Paul L. Rosin, “Mesh saliency via spectral processing”, ACM Trans- actions on Graphics 2014.

Upload: trankhanh

Post on 29-Jun-2018

216 views

Category:

Documents


0 download

TRANSCRIPT

Abstract

Retrieving appropriate 3D objects from a data-base given only partial information such as point clouds, range scans or sketches is a chal-lenge.

We address this problem in three ways:

• a novel saliency method for keypoint de-tection on point clouds

• an evaluation of how salient points a�ect retrieval

• a novel semantic-based descriptor for 3D shapes, range scans, sketches and images.

Flora P. Tasse1

Partial 3D Shape Retrieval

Jiří Kosinka1,2 Neil Dodgson1,3

1Rainbow Group, University of Cambridge, United Kingdom, �ora.ponjou-tasse (at) cl.cam.ac.uk2Scienti�c Visualization and Computer Graphics, University of Groningen, Netherlands, j.kosinka (at) rug.nl3Computer Graphics, Victoria University of Wellington, New Zealand, neil.dodgson (at) vuw.ac.nz

Part 2: How well do salient features perform for bag of features shape retrieval? (Computer & Graphics, 2016)

Part 1: Cluster-based point set saliency for keypoint detection (ICCV, 2015)

Adaptive fuzzy clustering Keypoint detection

We present a method for computing cluster and point saliency from a set of fuzzy clusters. Saliency is based on uniqueness and distribution of Fast Point Feature Histograms [1].

We apply the proposed saliency to keypoint extraction, and show it is robust to noise.

Part 3: Shape2Vec, semantic-based descriptors for 3D shapes, range scans, hand-drawn sketches and natural images

We investigate how sparse features based on saliency models a�ect retrieval. Random features and ground-truth salient features are eval-uated, as well as state-of-the-art saliency models for keypoint detection.

Results show that random features outperform salient features even when as few as 50 points are used per shape. Poor performance on range scan queries suggests that Bag of features is not suitable for partial queries.

We propose a supervised method for generating shape descriptors that are embedded in a word vector space, making it possible to support shape-based and text-based queries. The same tech-nique is used for sketches, color images and RGB-D images, which allows assessment of cross-mod-al similarities.

Sketch-based shape retrieval using Shape2Vec outperforms state-of-the-art, by a mean average precision di�erence of 49% (22.8% to 74.8%), on the SHREC14 Sketch-based Retrieval benchmark.

Point saliencyCluster saliency

Ground-truth [2] mAP = 0.79

RandommAP= 0.9

Mesh saliency [3] mAP= 0.77

Point set saliencymAP = 0.65

Range scan-based retrieval using random local features and VLAD encoding.

[1] R. B. Rusu, N. Blodow and M. Beetz, "Fast Point Feature Histograms (FPFH) for 3D registration," ICRA2009.[2] Xiaobai Chen, Abulhair Saparov, Bill Pang, and Thomas Funkhouser, "Schelling Points on 3D Surface Meshes", SIG-GRAPH 2012.[3] Ran Song, Yonghuai Liu, Ralph R. Martin, and Paul L. Rosin, “Mesh saliency via spectral processing”, ACM Trans-actions on Graphics 2014.

24 B A C K G R O U N D

Figure 2.2: Retrieved 3D meshes in a database, given a single-view range scan query. Note thathow the query contains additional points in its background, which illustrates chal-lenges faced by range scan queries. The results are based on my feature-based re-trieval method described in Chapter 4.

time, the range scan descriptor is compared with these pre-computed descriptors usinga suitable distance function such as the Kullback-Leibler Divergence [106]. 3D modelswith views that are closest to the query are returned as relevant matches.

It is important to note an implicit assumption in such methods: the range scan queryrepresents a single canonical object. This is a fair assumption to make since users caneither choose to scan a scene featuring a single object, or segment out the irrelevantobjects from the query. In a purely automated system, where the background is seg-mented automatically, the cleaning process may not be thorough as shown in Figure2.2.

Even the use of range scans for querying still limits users to objects that they canaccess, and not those they can conceptualize. A more flexible retrieval system will allowusers to query with abstract representations of objects of interest.

2.1.4 Sketch-based

Sketch-based modeling interfaces such as FiberMesh [104] have increasingly becomepopular for novice users, since they allow rapid prototyping with little training. Sketch-ing to represent abstract ideas is a skill that human beings learn from early childhood.Thus, sketch-based retrieval systems have seen tremendous progress in recent years[38, 42, 78, 153]. They match a 2D query sketch to 3D objects of the same class. Thesketch typically consists of complex curves that represents silhouettes, contours andsometimes skeleton lines depending on the artist style.

The view-based retrieval framework described in the previous section (2.1.3), pop-ular for range scan queries, is also the default pipeline for sketch-based query inter-faces. For instance, Eitz et al. [38] generate line drawings from multiple views for each3D model in their database, and then describe each drawing with image descriptorsbased on Gabor filters. Such methods that match sketches to 2D projections have sev-eral drawbacks:

• These techniques rely on a good line rendering algorithm, which is still a researchproblem.

• Hand-drawn sketches vary widely in the drawing style and level of abstraction.They can differ significantly from line renderings depending on the artist.