Patent application number | Description | Published |
20080270769 | PROCESS FOR RUNNING PROGRAMS ON PROCESSORS AND CORRESPONDING PROCESSOR SYSTEM - Programs having a given instruction-set architecture are executed on a multiprocessor system comprising a plurality of processors, for example of a VLIW type, each of said processors being able to execute, at each processing cycle, a respective maximum number of instructions. The instructions are compiled as instruction words of given length executable on a first processor. At least some of the instruction words of given length are converted into modified-instruction words executable on a second processor. The operation of modifying comprises in turn at least one operation chosen in the group consisting of: splitting the instruction words into modified-instruction words; and entering no-operation instructions in the modified-instruction words. | 10-30-2008 |
20090147016 | METHOD FOR DETECTING BORDER TILES OR BORDER PIXELS OF A PRIMITIVE FOR TILE-BASED RENDERING - A method detects border tiles or border pixels of a primitive corresponding to an object to be displayed on a display screen. The detecting includes: calculating the number of border tiles or pixels covered by an edge of the primitive; identifying a plurality of vertices that divide the edge in a plurality of segments of equal length; calculating coordinates of the vertices; and associating a tile or pixel with the coordinates of each vertex. The number of vertices for the edge is greater than or equal to the number of border tiles or pixels. | 06-11-2009 |
20130163836 | COMPUTING THE MASS OF AN OBJECT - The mass of an object may be estimated based on intersection points of a representation of a surface in an image space with cubes defining the image space, the surface representing a surface of an object. The representation may be, for example, based on marching cubes. The mass may be estimated by estimating a mass contribution of a first set of cubes contained entirely within the representation of the surface, estimating a mass contribution of a second set of cubes having intersection points with the representation of the surface, and summing the estimated mass contribution of the first set of cubes and the estimated mass contribution of the second set of cubes. The object may be segmented from other portions of an image prior to estimating the mass of the object. | 06-27-2013 |
20130216097 | IMAGE-FEATURE DETECTION - An embodiment is a method for detecting image features, the method including extracting a stripe from a digital image, the stripe including of a plurality of blocks; processing the plurality of blocks for localizing one or more keypoints; and detecting one or more image features based on the one or more localized keypoints. | 08-22-2013 |
20130216135 | VISUAL SEARCH SYSTEM ARCHITECTURES BASED ON COMPRESSED OR COMPACT DESCRIPTORS - An embodiment of a visual search system includes at least one imaging device, each imaging device operable to capture a corresponding image, a feature extraction device coupled to each imaging device, each feature extraction device operable to generate feature descriptors from the image received from the corresponding imaging device. A descriptor encoding device is coupled to each feature extraction device and operable to generate compressed feature descriptors from the received feature descriptors. An application processor is coupled to each descriptor encoding device. The application processor is operable to process the received compressed feature descriptors to generate output information as a function of the processed compressed feature descriptors. | 08-22-2013 |
20130216143 | SYSTEMS, CIRCUITS, AND METHODS FOR EFFICIENT HIERARCHICAL OBJECT RECOGNITION BASED ON CLUSTERED INVARIANT FEATURES - One embodiment is a method for selecting and grouping key points extracted by applying a feature detector on a scene being analyzed. The method includes grouping the extracted key points into clusters that enforce a geometric relation between members of a cluster, scoring and sorting the clusters, identifying and discarding clusters that are comprised of points which represent the background noise of the image, and sub-sampling the remaining clusters to provide a smaller number of key points for the scene. | 08-22-2013 |
20130279762 | ADAPTIVE SEARCH WINDOW CONTROL FOR VISUAL SEARCH - Image-processing apparatus and methods to adaptively control a size and/or location of a visual search window used for feature matching in a machine-vision system are described. A search window controller may receive motion vector data and image recognition rate data, and compute a search window size and/or search window location based on the received data. The computed search window size may be a portion of an image frame. The motion vector data and image recognition rate data may be computed from one or more images in a video image sequence. By adaptively controlling search window size and location, an appreciable reduction in data processing burden for feature matching may be achieved. | 10-24-2013 |
20140133310 | METHOD FOR EXTRACTING FEATURES FROM A FLOW OF DIGITAL VIDEO FRAMES, AND CORRESPONDING SYSTEM AND COMPUTER PROGRAM PRODUCT - In an embodiment, digital video frames in a flow are subjected to a method of extraction of features including the operations of: extracting from the video frames respective sequences of pairs of keypoints/descriptors limiting to a threshold value the number of pairs extracted for each frame; sending the sequences extracted from an extractor module to a server for processing with a bitrate value variable in time; receiving the aforesaid bitrate value variable in time at the extractor as target bitrate for extraction; and limiting the number of pairs extracted by the extractor to a threshold value variable in time as a function of the target bitrate. | 05-15-2014 |
20140133550 | METHOD OF ENCODING AND DECODING FLOWS OF DIGITAL VIDEO FRAMES, RELATED SYSTEMS AND COMPUTER PROGRAM PRODUCTS - A first video frame and a second video frame in a flow of digital video frames are encoded by extracting for the frames in question respective sets of keypoints and descriptors, with each descriptor including a plurality of orientation histograms regarding a patch of pixels centred on the respective keypoint. Once a pair of linked descriptors has been identified, one for the first frame and one for the second frame, which have a minimum distance from among the distances between any one of the descriptors of the first frame and any one of the descriptors of the second frame, the differences of the histograms of the descriptors linked in said pair are calculated, and the descriptors linked in said pair are encoded as the set including one of the linked descriptors and the aforesaid histogram differences by subjecting the histogram differences to a thesholding setting at zero all the differences below a certain threshold, to quantization, and to an encoding of a run-length type. The run-length encoding is followed by a further encoding chosen from among a Huffman encoding, an arithmetical encoding, and a type encoding. | 05-15-2014 |
20140185949 | EFFICIENT COMPACT DESCRIPTORS IN VISUAL SEARCH SYSTEMS - Disclosed embodiments are directed to methods, systems, and circuits of generating compact descriptors for transmission over a communications network. A method according to one embodiment includes receiving an uncompressed descriptor, performing zero-thresholding on the uncompressed descriptor to generate a zero-threshold-delimited descriptor, quantizing the zero-threshold-delimited descriptor to generate a quantized descriptor, and coding the quantized descriptor to generate a compact descriptor for transmission over a communications network. The uncompressed and compact descriptors may be 3D descriptors, such as where the uncompressed descriptor is a SHOT descriptor. The operation of coding can be ZeroFlag coding, ExpGolomb coding, or Arithmetic coding, for example. | 07-03-2014 |
20140198995 | METHOD AND APPARATUS FOR COMPUTING IMAGE PYRAMIDS AND RELATED COMPUTER PROGRAM PRODUCT - An embodiment of a method for computing pyramids of input images (I) in a transformed domain, e.g., for search and retrieval purposes, includes:—arranging input images in blocks to produce input image blocks,—subjecting the input image blocks to block processing including: transform into a transformed domain, subjecting the image blocks transformed into a transformed domain to filtering, subjecting the image blocks transformed into a transformed domain and filtered to inverse transform implementing an inverse transform with respect to the previous transform into a transformed domain, thus producing a set of processed blocks. The set of processed blocks, which is recomposeable to an image pyramid, may be used, e.g., in detecting extrema points in images in the pyramid, extracting a patch of given size around the extrema points detected, and processing the patch to obtain local descriptors such as SIFT descriptors of a feature. | 07-17-2014 |