Abstract:
The present invention relates to generating texture maps for use in rendering visual output. According to a first aspect, there is provided a method for generating textures for use in rendering visual output, the method comprising the steps of: generating, using a first hierarchical algorithm, a first texture from one or more sets of initialisation data; and selectively refining the first texture, using one or more further hierarchical algorithms, to generate one or more further textures from at least a section of the first texture and one or more sets of further initialisation data; wherein at least a section of each of the one or more further textures differs from the first texture.
Abstract:
In general, techniques are described for performing a vocabulary-based visual search using multi-resolution feature descriptors. A device may comprise one or more processors configured to perform the techniques. The processors may generate a hierarchically arranged data structure to be used when classifying objects included within a query image based on multi-resolution query feature descriptor extracted from the query image at a first scale space resolution and a second scale space resolution. The hierarchically arranged data structure may represent a first query feature descriptor of the multi-resolution feature descriptor extracted at the first scale space resolution and a second corresponding query feature descriptor of the multi-resolution feature descriptor extracted at the second scale space resolution hierarchically arranged according to the first scale space resolution and the second scale space resolution. The processors may then perform a visual search based on the generated data structure.
Abstract:
Image deblurring is described, for example, to remove blur from digital photographs captured at a handheld camera phone and which are blurred due to camera shake. An estimate of blur in an image is available from a blur estimator and a trained machine learning system is available to compute parameter values of a blur function from the blurred image. The blur function is obtained from a probability distribution relating a sharp image, a blurred image and a fixed blur estimate. For example, the machine learning system is a regression tree field trained using pairs of empirical sharp images and blurred images calculated from the empirical images using artificially generated blur kernels.
Abstract:
Image labeling is described, for example, to recognize body organs in a medical image, to label body parts in a depth image of a game player, to label objects in a video of a scene. In various embodiments an automated classifier uses geodesic features of an image, and optionally other types of features, to semantically segment an image. For example, the geodesic features relate to a distance between image elements, the distance taking into account information about image content between the image elements. In some examples the automated classifier is an entangled random decision forest in which data accumulated at earlier tree levels is used to make decisions at later tree levels. In some examples the automated classifier has auto-context by comprising two or more random decision forests. In various examples parallel processing and look up procedures are used.
Abstract:
A system for determining piles comprises an interface and a processor. The interface is configured to receive an image. The processor is configured to determine one or more attributes of the image; to determine whether the image is a member of a top of a hierarchy based at least in part on the attributes. In the event it is determined that the image is a member of the top of the hierarchy,: determine a set of elements of the hierarchy the image is a member of, based at least in part on the attributes and determine which of the set of entities are piles.
Abstract:
Methods, systems, and computer readable media with executable instructions, and/or logic are provided for incremental image clustering. An example method for incremental image clustering can include identifying, via a computing device, a number of candidate nodes from among evaluated leaf image cluster (LIC) nodes on an image cluster tree (ICT) based on a similarity between a feature of a new image and an average feature of each of the evaluated LIC nodes. The evaluated nodes include at least one node along each path from a root node to either a leaf node or a node having a similarity exceeding a first threshold. A most-similar node can be determined, via the computing device, from among the number of candidate nodes. The new image can be inserted to a node associated with the determined most-similar node, via the computing device.
Abstract:
Method for determining similarities between a first user and a second user in a network, including receiving one or more Global Positioning System (GPS) logs from each user in the network, constructing a first hierarchal graph for the first user's GPS log and a second hierarchical graph for the second user's GPS log, and calculating a similarity score between the first user and the second user based on the first hierarchal graph and the second hierarchical graph.
Abstract:
In a method for the determination of clusters (8a, 8b, 8c, 9a, 9b, 9c) in sensor data by means of an embedded system, the formation of the clusters (8a, 8b, 8c, 9a, 9b, 9c) is carried out sequentially in order to reduce the consumption of resources, wherein the clusters (8a, 8b, 8c, 9a, 9b, 9c) formed are modified as a function a further property space dimension when forming new clusters (8a, 8b, 8c, 9a, 9b, 9c).
Abstract:
A data clustering method involves techniques for improving the speed of generation of clustering data representing hierarchical clustering of a set of data samples. The techniques include the selection of clusters in increasing size for selecting the nearest other cluster for merging, ordering the data samples according to absolute distance from a reference and searching for nearest neighbours within a restricted index range, and making distance comparisons by summing the contributions from components in each dimension in turn in order of the interquartile ranges of components of the data samples in each dimension. A data classification method involves calculating a rank value for a test sample in relation to a cluster of data samples, by taking into account the dissimilarities of the data samples at either end of the closest edge to the data sample and/or by calculating as a function of a test sample dissimilarity of the test sample to the most similar data sample within the cluster, unless the test sample dissimilarity is less than the dissimilarity of an edge in a minimum spanning tree which has the greatest dissimilarity less than an edge connected to the most similar data sample. The applications of the methods include data compression, feature extraction, unmixing, data mining and browsing, network design and pattern recognition.