Improved duplicate and near-duplicate detection techniques may assign a number of fingerprints to a given document by (i) extracting parts from the document, (ii) assigning the extracted parts to one or more of a predetermined number of lists, and (iii) generating a fingerprint from each of the populated lists. Two documents may be considered to be near-duplicates if any one of their fingerprints match.

Detecting duplicate and near-duplicate files

Systems and methods are described for obtaining and acting upon information indicative of circulatory health and related phenomena in human beings or other subjects.

Circulatory monitoring systems and methods

A method for encoding XML tree data that includes the step of encoding the semi-structured data into strings of arbitrary length in a way that maintains non-structural and structural information about the XML data, and enables indexing the encoded XML data in a way that facilitates efficient search and browsing.

Encoding semi-structured data for efficient search and browsing

An encoding device includes a color component separating unit for separating an input bit stream for the respective color components, a block dividing unit for dividing an input color component signal into blocks to generate a signal of an encoding unit area, a predicted image generating unit for generating a predicted image for the signal, a determining unit for determining a prediction mode used for encoding according to a prediction efficiency of the predicted image, a prediction error encoding unit for encoding a difference between the predicted image corresponding to the prediction mode determined by the determining unit and the input color component signal, and an encoding unit for variable length-coding the prediction mode, an output from the prediction error encoding unit, and a color component identification flag indicating the color component to which the input bit stream belongs as a result of the color component separation.

Image encoding device, image decoding device, image encoding method, and image decoding method

A Universal Geographic Database (“UGD”) is provided that includes a real-time, automated registry/clearinghouse for the publication and retrieval of real-world locations and location-related information for businesses and other entities By this registry, entities may publish their location and location-related information in a single place, and information services and their users can refer to this single place, via telecommunications devices, to obtain static, real-time location and location-based information about the registered locations Each UGD record is keyed by a proprietary location address (PLA) based on the World Geographic Referencing System (WGRS) PLAs may be used as key reference and addressing terms, eg, imbedded in digital documents, websites, GPS devices, or other information services to provide links to maps, directions, and information in the registry related to such locations PLAs may also provide a concise, user-friendly notation for location naming and designating real-world locations and on all types of location-sensitive electronic devices

Unified geographic database and method of creating, maintaining and using the same

Multi-dimensional data contained in very large databases is efficiently and accurately clustered to determine patterns therein and extract useful information from such patterns. Conventional computer processors may be used which have limited memory capacity and conventional operating speed, allowing massive data sets to be processed in a reasonable time and with reasonable computer resources. The clustering process is organized using a clustering feature tree structure wherein each clustering feature comprises the number of data points in the cluster, the linear sum of the data points in the cluster, and the square sum of the data points in the cluster. A dense region of data points is treated collectively as a single cluster, and points in sparsely occupied regions can be treated as outliers and removed from the clustering feature tree. The clustering can be carried out continuously with new data points being received and processed, and with the clustering feature tree being restructured as necessary to accommodate the information from the newly received data points.

/pdf/method-and-system-for-data-clustering-for-very-large-511z3l5nxa.pdf

Method and system for data clustering for very large databases

We describe the RD-OPT algorithm for DCT quantization optimization, which can be used as an efficient tool for near-optimal rate control in DCT-based compression techniques, such as JPEG and MPEG. RD-OPT measures DCT coefficient statistics for the given image data to construct rate/distortion-specific quantization tables with nearly optimal tradeoffs.

An efficient algorithm for optimizing DCT quantization

A digital image compression preprocessor for use in a discrete cosine transform-based digital image compression device is provided. The preprocessor includes a gathering mechanism for determining discrete cosine transform statistics from input digital image data. A computing mechanism is operatively coupled to the gathering mechanism to calculate a image distortion array and a rate of image compression array based upon the discrete cosine transform statistics for each possible quantization value. A dynamic programming mechanism is operatively coupled to the computing mechanism to optimize the rate of image compression array against the image distortion array such that a rate-distortion-optimal quantization table is derived. In addition, a discrete cosine transform-based digital image compression device and a discrete cosine transform-based digital image compression and decompression system are provided. Also, a method for generating a rate-distortion-optimal quantization table, using discrete cosine transform-based digital image compression, and operating a discrete cosine transform-based digital image compression and decompression system are provided.

Image compression system and method having optimized quantization tables

We show that it is desirable to use data-specific or customized quantization tables for scaling the spatial frequency coefficients obtained using the Discrete Cosine Transform (DCT). DCT is widely used for image and video compression (MP89, PM93) but applications typically use default quantization matrices. Using actual scientific data gathered from divers sources such as spacecrafts and electron-microscopes, we show that the default compression/quality tradeoffs can be significantly improved upon by using customized tables. We also show that significant improvements are possible for the standard test images Lena and Baboon. This work is part of an effort to develop a practical scheme for optimizing quantization matrices for any given image or video stream, under any given quality or compression constraints.

Miron Livny

Papers

Method and system for data clustering for very large databases

An efficient algorithm for optimizing DCT quantization

Image compression system and method having optimized quantization tables

Performance of customized DCT quantization tables on scientific data