8,211 research outputs found
Deep Shape Matching
We cast shape matching as metric learning with convolutional networks. We
break the end-to-end process of image representation into two parts. Firstly,
well established efficient methods are chosen to turn the images into edge
maps. Secondly, the network is trained with edge maps of landmark images, which
are automatically obtained by a structure-from-motion pipeline. The learned
representation is evaluated on a range of different tasks, providing
improvements on challenging cases of domain generalization, generic
sketch-based image retrieval or its fine-grained counterpart. In contrast to
other methods that learn a different model per task, object category, or
domain, we use the same network throughout all our experiments, achieving
state-of-the-art results in multiple benchmarks.Comment: ECCV 201
Shape matching and clustering
Generalising knowledge and matching patterns is a basic human trait in re-using past experiences. We often cluster (group) knowledge of similar attributes as a process of learning and or aid to manage the complexity and re-use of experiential knowledge [1, 2]. In conceptual design, an ill-defined shape may be recognised as more than one type. Resulting in shapes possibly being classified differently when different criteria are applied. This paper outlines the work being carried out to develop a new technique for shape clustering. It highlights the current methods for analysing shapes found in computer aided sketching systems, before a method is proposed that addresses shape clustering and pattern matching. Clustering for vague geometric models and multiple viewpoint support are explored
Recommended from our members
Shape matching and clustering in design
Generalising knowledge and matching patterns is a basic human trait in re-using past experiences. We often cluster (group) knowledge of similar attributes as a process of learning and or aid to manage the complexity and re-use of experiential knowledge [1, 2]. In conceptual design, an ill-defined shape may be recognised as more than one type. Resulting in shapes possibly being classified differently when different criteria are applied. This paper outlines the work being carried out to develop a new technique for shape clustering. It highlights the current methods for analysing shapes found in computer aided sketching systems, before a method is proposed that addresses shape clustering and pattern matching. Clustering for vague geometric models and multiple viewpoint support are explored
Perceptually Motivated Shape Context Which Uses Shape Interiors
In this paper, we identify some of the limitations of current-day shape
matching techniques. We provide examples of how contour-based shape matching
techniques cannot provide a good match for certain visually similar shapes. To
overcome this limitation, we propose a perceptually motivated variant of the
well-known shape context descriptor. We identify that the interior properties
of the shape play an important role in object recognition and develop a
descriptor that captures these interior properties. We show that our method can
easily be augmented with any other shape matching algorithm. We also show from
our experiments that the use of our descriptor can significantly improve the
retrieval rates
Shape matching by curve modelling and alignment
Automatic information retrieval in the eld of shape recognition has been widely covered by many
research elds. Various techniques have been developed using different approaches such as intensity-based, modelbased
and shape-based methods. Whichever is the way to represent the objects in images, a recognition method
should be robust in the presence of scale change, translation and rotation. In this paper we present a new recognition
method based on a curve alignment technique, for planar image contours. The method consists of various phases
including extracting outlines of images, detecting signicant points and aligning curves. The dominant points can
be manually or automatically detected. The matching phase uses the idea of calculating the overlapping indices
between shapes as similarity measures. To evaluate the effectiveness of the algorithm, two databases of 216 and
99 images have been used. A performance analysis and comparison is provided by precision-recall curves
Guiding Eye Movements For Feature Based Shape Matching
We introduce a novel method for shape-based image database search that uses saccadic targeting for local feature choice. A simulated multiresolution sensor is directed toward salient regions of an image in a series of saccadic movements. At each fixation point 1 a region of the retinal image is stored for later matching by correlation. The utility of this approach is demonstrated on an 86 image database
Shape matching scheduler
Scheduling jobs with different CPU and memory requirements often leads to resources being stranded or underutilized across at least one dimension e.g., CPU or memory. This leads to sub-optimal utilization of data center or cloud infrastructure and wastage of valuable resources. Solutions to address the resource stranding problem that involve pooling resources across different machines are complex and impose extra hardware requirements. This disclosure describes a shape matching optimization technique that is a flexible software-based solution to preferentially allocate jobs to machines by matching the shape of the job to the available shape of the machine. The shape matching scheduler improves resource utilization
- …