Abstract: A bracket assembly 2 for providing an attachment point on a surface for supporting an article. The bracket assembly 2 includes a body member 6 arranged so as to be held against a region of the surface by way of magnetic association therewith. The body member has a support region 7 from which the article may be supported. The body member 6 may be arranged so that, when in use, the support region 7 is spaced from the surface.

Abstract: Embodiments related to coding data using an optimal codebook and/or dictionary, and selection of the entries for the optimal dictionary are disclosed.

Abstract: Embodiments of methods, apparatuses, systems and/or devices for passive biometric spectroscopy are disclosed.

Abstract: Embodiments related to enhancing data are disclosed.

Abstract: Embodiments related to biometric identification are disclosed.

Abstract: A method of comparing a test iris image with a candidate iris image comprises generating test and candidate lists representative of measured image values along respective curves around the pupils. Treating these list as periodic, a relative displacement is calculated at which one list best matches the other list. This determines the amount of rotation required for best match of the iris images. The method may be used either alone or in combination with other identity verification systems.

Abstract: A method of generating a code representative of a passage of text uses in the preferred embodiment the character spacing between respective occurrences of a selected key symbol string within the text. The string may be fixed, or may encompass a variety of different forms. By comparing the known code of a target text passage with the code generated from a sample text passage, it is easy to determine whether the target text has been used within the sample. The method may be integrated within a copying device such as a photocopier, allowing the device report automatically whenever a user attempts to copy a document bearing one of a predefined list of sensitive or controlled text passages.

Abstract: Embodiments related to coding and/or decoding data, including for example image data, using wavelet transform and matching pursuits are disclosed.

Abstract: Embodiments related to coding data using a transform, and matching pursuits utilizing a relatively low complexity dictionary are disclosed.

Abstract: Embodiments related to utilizing substantially optimal entries for a relatively low complexity dictionary for matching pursuits coding is disclosed.

Abstract: Embodiments related to coding and/or decoding data, including for example image data, using wavelet transform and matching pursuits are disclosed.

Abstract: Embodiments related to coding data using a motion compensated transform, and replicated matching pursuits are disclosed.

Abstract: A method of data compression, for example for images or audio signals, comprises encoding the data using a transform such as a wavelet transform or a DCT, grouping the transform coefficients by most significant bit, and/or bit value, and transmitting them group by group. Where the transform uses a code book, such as matching pursuits, the coefficients may further be grouped by code book value. In one embodiment, the method allows the data to be described entirely by the positions of the coefficients, and the groupings, without any need to store or transmit any coefficient value information whatsoever.

Abstract: A method of video motion estimation is described for determining the dominant motion in a video image. The dominant motion is defined by a parametric transform, for example a similarity transform. In the preferred embodiment, selected pairs of blocks in one frame are traced by a block matching algorithm into a subsequent frame, and their change in position determined. From that information, an individual parameter estimate is determined. The process is repeated for many pairs of blocks, to create a large number of parameter estimates. These estimates are then sorted into an ordered list, the list is preferably differentiated, and the best global value for the parameter is determined from the differentiated list. One approach is to take the minimum value of the differentiated list, selected from the longest run of values which fall below a threshold value. Alternatively, the ordered list may be examined for flat areas, without explicit differentiation.