Abstract: A method of generating hash codes from a query vector. An ordering of dimensions is determined for a lattice hole in an A* lattice, the lattice hole being located nearest to the query vector and the ordering of dimensions represents a mapping applied to transform a canonical hole of the A* lattice to the lattice hole. An initial hash code is determined for a first point in the A* lattice, based on the query vector, using a plurality of predetermined constants. A subsequent hash code is generated for a second point in the A* lattice, from the initial hash code by modifying the initial hash code by a multiple of a constant. The constant is selected from the plurality of predetermined constants using the determined ordering of dimensions.

Abstract: A method and associated imaging system for classifying at least one concept type in a video segment is disclosed. The method associates an object concept type in the video segment with a spatio-temporal segment of the video segment. The method then associates a plurality of action concept types with the spatio-temporal segment, where each action concept type of the plurality of action concept types is associated with a subset of the spatio-temporal segment associated with the object concept type. The method then classifies the action concept types and the object concept types associated with the video segment using a conditional Markov random field (CRF) model where the CRF model is structured with the plurality of action concept types being independent and indirectly linked via a global concept type assigned to the video segment, and the object concept type is linked to the global concept type.

Abstract: A system and method for linking a hash code to a portion of an image. A plurality of lattice points is selected in a multidimensional lattice to form a smallest enclosing region about a feature vector representing the portion of the image and a lattice point is determined from the selected plurality of lattice points according to a distribution criteria. The determined lattice point is common to the smallest enclosing region and a region of the lattice adjacent to the smallest enclosing region located within a query radius distance of the feature vector. When the feature vector is located within the query radius of a query vector the feature vector is considered a match. The method assigns the feature vector to the determined lattice point and stores a link between a hash code associated with the determined lattice point and the portion of the image.

Abstract: An image processing system for identifying content within image data. The image processing system comprises a processor that is arranged to: arrange image data in a Markov random field (MRF); and calculate state upper bound values of pairs of variables in the image data that are associated with an edge. The calculation of the state upper bound values is performed by the processor assigning the maximum state values of all of the states of a first variable of the pair of variables to the states of a second variable of the pair of variables, identifying the first and second variables from the pair of variables based on a number of states within each of the first and second variables, and determining a single state solution for identifying content in the image data based on the calculation of the state upper bound values.

Abstract: A computer-implementable method of analyzing tissues of a retina. A polarization-sensitive (PS-OCT) image data set of the retina is received from a polarization-sensitive device, each element in the polarization-sensitive image data set being associated with an intensity value ({I1, . . . , IL}) and a polarization direction ({P1, . . . , PL}). A likelihood score is determined for each element of the polarization-sensitive image data set based on the intensity value of the element and a degree of divergence (?*TP or D2) of the polarization direction associated with the element from a reference polarization direction (?*) associated with the polarization sensitive image data set, wherein the likelihood score indicates whether said element is drawn from a directionally polarized distribution or a depolarizing distribution, Elements of the polarization-sensitive image data set are classified using the determined likelihood scores to analyze tissues of the retina.

Abstract: A method and associated imaging system for classifying at least one concept type in a video segment is disclosed. The method associates an object concept type in the video segment with a spatio-temporal segment of the video segment. The method then associates a plurality of action concept types with the spatio-temporal segment, where each action concept type of the plurality of action concept types is associated with a subset of the spatio-temporal segment associated with the object concept type. The method then classifies the action concept types and the object concept types associated with the video segment using a conditional Markov random field (CRF) model where the CRF model is structured with the plurality of action concept types being independent and indirectly linked via a global concept type assigned to the video segment, and the object concept type is linked to the global concept type.

Abstract: A method of generating hash codes from a query vector. An ordering of dimensions is determined for a lattice hole in an A* lattice, the lattice hole being located nearest to the query vector and the ordering of dimensions represents a mapping applied to transform a canonical hole of the A* lattice to the lattice hole. An initial hash code is determined for a first point in the A* lattice, based on the query vector, using a plurality of predetermined constants. A subsequent hash code is generated for a second point in the A* lattice, from the initial hash code by modifying the initial hash code by a multiple of a constant. The constant is selected from the plurality of predetermined constants using the determined ordering of dimensions.

Abstract: An image processing system for identifying content within image data. The image processing system comprises a processor that is arranged to: arrange image data in a Markov random field (MRF); and calculate state upper bound values of pairs of variables in the image data that are associated with an edge. The calculation of the state upper bound values is performed by the processor assigning the maximum state values of all of the states of a first variable of the pair of variables to the states of a second variable of the pair of variables, identifying the first and second variables from the pair of variables based on a number of states within each of the first and second variables, and determining a single state solution for identifying content in the image data based on the calculation of the state upper bound values.

Abstract: A method of generating a feature vector for an image is disclosed. Values are determined from a plurality of points in a region of the image, each of the values being determined using at least two of the plurality of points. A periodic sequence of the determined values is determined based on an order of the plurality of points. The periodic sequence is phase variant to a starting point of the ordered plurality of points, the order of the plurality of points being determined according to a predetermined rule. The feature vector for one of the points is generated from a frequency domain representation of the periodic sequence, the feature vector being invariant to rotation with respect to the plurality of points.

Abstract: A method of determining a hash code representing a portion of an image, is disclosed. A Delaunay region (e.g., 450) enclosing an image feature point (e.g., 210) representing at least the portion of the image is determined. The Delaunay region is determined from A* lattice points. A mapping transforming the Delaunay region to a predetermined canonical form is determined A point of the Delaunay region is received. The received point defines a plane containing the A* lattice points of the Delaunay region excluding the received point. A normal of the plane is determined by setting at least two co-ordinates of the normal to predetermined non-zero values, the two co-ordinates being selected according to the determined mapping. The hash code representing a portion of the image is determined according to a distance determined using the normal.

Abstract: An assistance method for selecting a program using a display device (112) is disclosed. The method (1200) selects one or more attributes associated with a first program, the one or more attributes being selected dynamically by a processor associated with the display device (112) according to one or more predetermined criteria. The method searches for a second program associated with one or more of the selected attributes. The second program and the one or more attributes associated therewith are displayed on the display device, according to the search for the second program.

Abstract: Disclosed is a method of determining one or more event subsets within a plurality of images. Each image is associated with time and location data specifying the time and location of capture of the image. The method determines a time variable for each adjacent pair of images in a capture time ordered list of the plurality of images. A distance variable for each adjacent pair of images in the ordered list of images is then determined. The method determines speed data of the image capture device at the time and location of capture of each image. The ordered list of images is then partitioned into one or more event subsets on the basis of a cost function, the cost function being determined in accordance with a normalization of the time variable and distance variable, wherein the time variable and the distance variable are weighted relative to the speed data.

Abstract: “A system and method for linking a hash code to a portion of an image. A plurality of lattice points is selected in a multidimensional lattice to form a smallest enclosing region about a feature vector representing the portion of the image and a lattice point is determined from the selected plurality of lattice points according to a distribution criteria. The determined lattice point is common to the smallest enclosing region and a region of the lattice adjacent to the smallest enclosing region located within a query radius distance of the feature vector. When the feature vector is located within the query radius of a query vector the feature vector is considered a match. The method assigns the feature vector to the determined lattice point and stores a link between a hash code associated with the determined lattice point and the portion of the image.

Abstract: A method of generating a feature vector for an image is disclosed. Values are determined from a plurality of points in a region of the image, each of the values being determined using at least two of the plurality of points. A periodic sequence of the determined values is determined based on an order of the plurality of points. The periodic sequence is phase variant to a starting point of the ordered plurality of points, the order of the plurality of points being determined according to a predetermined rule. The feature vector for one of the points is generated from a frequency domain representation of the periodic sequence, the feature vector being invariant to rotation with respect to the plurality of points.

Abstract: A method of determining a hash code representing a portion of an image, is disclosed. A Delaunay region (e.g., 450) enclosing an image feature point (e.g., 210) representing at least the portion of the image is determined. The Delaunay region is determined from A* lattice points. A mapping transforming the Delaunay region to a predetermined canonical form is determined A point of the Delaunay region is received. The received point defines a plane containing the A* lattice points of the Delaunay region excluding the received point. A normal of the plane is determined by setting at least two co-ordinates of the normal to predetermined non-zero values, the two co-ordinates being selected according to the determined mapping. The hash code representing a portion of the image is determined according to a distance determined using the normal.

Abstract: Disclosed is a method of determining one or more event subsets within a plurality of images. Each image is associated with time and location data specifying the time and location of capture of the image. The method determines a time variable for each adjacent pair of images in a capture time ordered list of the plurality of images. A distance variable for each adjacent pair of images in the ordered list of images is then determined. The method determines speed data of the image capture device at the time and location of capture of each image. The ordered list of images is then partitioned into one or more event subsets on the basis of a cost function, the cost function being determined in accordance with a normalisation of the time variable and distance variable, wherein the time variable and the distance variable are weighted relative to the speed data.

Abstract: An assistance method for selecting a program using a display device (112) is disclosed. The method (1200) selects one or more attributes associated with a first program, the one or more attributes being selected dynamically by a processor associated with the display device (112) according to one or more predetermined criteria. The method searches for a second program associated with one or more of the selected attributes. The second program and the one or more attributes associated therewith are displayed on the display device, according to the search for the second program.