Abstract: In order to determine an easily perceived display image for a driver assistance system, in particular a distance-measuring system or a parking assistant, a method makes use of the determination of Bezier curves on the basis of measured distance values on various measuring lines. Wherein different variants for the selection of the reference points and the curve edge points are available for the modeling and parameterization of the Bezier curves taking into account the respective current situation. It is also possible for object positions not to be taken into account under certain conditions in order to obtain smooth illustrative curves.

Abstract: If the processing time of a labeling process performed on a target rectangle found to be an image of a character/line drawing is equal to or longer than a given threshold, an unprocessed region of the target rectangle which has not yet been labeled is analyzed (S401). In accordance with the analytical result, a color reducing process or resolution reducing process is performed on the unprocessed region (S402, S403, S404). A labeling process is performed on the processing result (S302). Vector data is generated on the basis of the labeling process result (S306).

Abstract: In an image processing method, contour information is extracted on the basis of terminal points and intersections included in a thinned line drawing, the contour information being extracted for each of closed curves and line elements connecting the terminal points and the intersections included in the line drawing, and skeletonized vector data is generated on the basis of the contour information. Start and end terminal points in the skeletonized vector data are determined. Artificial vectors to be inserted between the determined start and end terminal points are generated, and artificial-vector-inserted vector data including the generated artificial vectors is generated. A smoothing process is performed for the artificial-vector-inserted vector data, and then smoothed, non-circumference vector data is generated on the basis of the start and end terminal points. The thinned line drawing is raster-scanned in units of a pixel matrix.

Abstract: This invention provides an image processing system and image processing method which allow a user to easily confirm conversion result information when image information is converted into vector data. Image information input from an input device (113) is vectorized by a data processing device (115). Vector data which has successfully been vectorized is converted into image data. The input image information and the converted image data are combined to generate and output combined image data.

Abstract: An image processing apparatus is made up of a processing target area specification section for specifying a processing target area; a circumferential direction specification section for specifying the circumferential direction of a contour circle in the processing target area; an edge detection region specification section for specifying three or more regions made different in position in the circumferential direction in the processing target area as edge detection regions based on the processing target area and the circumferential direction; an edge position identification section for identifying edge positions with respect to the radial direction based on the intensity distribution in the edge detection regions; and a contour circle determination section for determining a contour circle based on the edge positions identified relative to the edge detection regions.

Abstract: A pattern data examination method and system capable of accurately and speedily examining a circuit pattern without failing to extract pattern contour data are provided. While pattern comparison is ordinarily made by using a secondary electron image, a contour of a pattern element is extracted by using a backscattered electron image said to be suitable for observation and examination of a three dimensional configuration of a pattern element, and pattern inspection is executed by using the extracted contour of the pattern element. More specifically, pattern inspection is executed by comparing a contour of a pattern element with design data such as CAD data to measure a difference between the contour and the data, and by computing, for example, the size of the circuit pattern element from the contour of a pattern.

Abstract: Methods and apparatus for removing a background image from a captured image are provided. The background is removed by computing a set of representative values (e.g., median values) based on component values of pixels within a portion of interest of the captured image. The captured image is divided into a plurality of sub-blocks. For each sub-block, it is determined whether a predetermined minimum number of similar pixels are found, a similar pixel having component values within a predetermined threshold of the representative values. If the minimum number of similar pixels is found, it is assumed that the sub-block does not comprise part of the background and is retained. If the minimum number of similar pixels is not found, it is assumed that the sub-block comprises part of the background and component values of pixels of the sub-block are set to predetermined values.

Abstract: An image (e.g., a sprite) having at least three textures is compressed by generating a map which represents boundaries separating regions in the image, and generating pointers that associate each of the regions with one of the textures. The resulting data structure may be used in decompressing the image.

Abstract: A Bezier curve constituting outline font data represents a curve by four coordinate values of a start point, an end point, and two control points. The curve is represented by two coordinates of the start point and the end point in collinear approximation, and by three coordinates of the start point, an intersecting point of two lines, and the end point in bi-linear approximation. In curve pattern approximation, when 32 curve patterns are prepared, the curve is represented by 5-bit data of two coordinates of the start point and the end point, and a pattern number. By effectively employing these three kinds of processes, it is possible to represent a Bezier curve constituting the outline font data with a reduced data volume.

Abstract: The present invention is related to routines for the processing of quantized vector data into one or more arrays of integers whose values are closer to zero than the integers in the quantized vector data. The arrays are input to a compression engine resulting in compressed bytes of data that may be transferred to a computing device for the decompression of the data. The quantized vector data can include vertices expressed as a pair of integer values that may represent geometric, spatial elements, such as points, interconnected lines (polylines), and polygons. These geometric objects may be representative of information on a map. The compressed bytes may be grouped according to grids, wherein each grid represents a distinct geographic area of a map, so that a consumer can store and decompress only the portion of the map data which is of interest.

Abstract: A method of compressing a digital ink input including a sequence of strokes is provided in which each stroke is represented as a series of digital words representing x and y co-ordinates, at least one reference co-ordinate of each stroke is expressed in absolute terms, and a co-ordinate other than the at least one reference co-ordinate is expressed as an offset from a preceding co-ordinate. The co-ordinate other than the at least one reference co-ordinate is represented as a combination of an estimate determined from the previous m co-ordinates and a residual error value.

Abstract: An image processing apparatus holds a compressed image without being subjected to edging, or holds an edged image of the image after the image is subjected to edging, depending on predetermined conditions. The image processing apparatus creates an image on the basis of an edged image created from the compressed image held by a holding unit or on the basis of the held edged image held by the holding unit. Therefore, an optimal performance suitable for the capability of the image processing apparatus is realized.

Abstract: Today's computer programs that convert raster images into vector-based images do not optimize/compress the vector representation of the vector-based images. Instead, they simply keep all of the complex edges for the vector objects within the vector-based images. The present invention described herein functions to create a compressed vector-based image by simplifying the shapes of common complex edges which are shared by adjacent vector objects. The compression (lossless compression) of the vector objects is done without affecting the perceived quality of the vector-based image.

Abstract: In a wireless keyboard-video-mouse (“KVM”) system in which a remote computer accesses the video output data of a target computer, a method of providing video data from the target computer to the remote computer, a method includes compressing at least some of the video data using a line fitting compression scheme to produce at least one sequence of absolute coded pixel segments and relative coded pixel segments which combine to represent the video data; and providing the sequence of absolute coded pixel segments and relative coded pixel segments to the remote computer.

Abstract: The purpose of the invention is to improve the Bezier approximation accuracy with relatively high speed processing so far as data amount permits, and to provide an image processing device and image processing method thereof which improves the Bezier approximation accuracy within the predetermined processing time.

Abstract: A print control apparatus is connected to a printing device, and includes: a generation unit that generates first vector data for printing an image on a single sheet and second vector data for enlarging the image and printing the enlarged image on a plurality of sheets in a divisional manner; an conversion unit that converts the first vector data and the second vector data generated by the generation unit into first bitmap data and second bitmap data, respectively; a division unit that divides the second bitmap data into units corresponding to each of the plurality of sheets; and an output control unit that outputs the first bitmap data and the divided second bitmap data to the printing device.

Abstract: A method, system, computer-readable medium, and apparatus for identifying a boundary of a cluster in a bitmap, the bitmap having at least one initially set bit, for applying an expansion shape to each of the initially set bits in the bitmap and identifying vertex bits on the boundary of the cluster formed by at least one expansion shape. A method system, computer-readable medium, and apparatus for identifying vertex bits in a bitmap having at least two adjacent bits with non-zero values forming a boundary of a cluster, the interior bits of the cluster having a zero value, including starting from a current non-zero bit, evaluating at least a first adjacent bit and a second adjacent bit, setting an adjacent non-zero bit as the new current bit, and identifying the current bit as a vertex bit if a direction of motion from the current bit to the new current bit changes.

Abstract: An image processing method for reducing jaggy effect, which is applied in an image output device, is provided. Firstly, a continuous tone image is generated, and continuous tone pixels are defined according to a first addressing space. Then, a halftone image is generated. After that, the continuous tone image is low-pass filtered to generate a low-pass filtered image. Next, determine whether a position of the low-pass filtered image whose density is approximate to a pre-determined density. If so, generate a set of second addressing space co-ordinates of a key point corresponding to the position. Then, a moving vector corresponding to the key point is generated so as to regulate the position of a display point of the halftone pixel. Afterward, output the display point according to the position after regulation.

Abstract: Systems and methods are presented for correcting contours of alphanumeric characters. At least one string of numbers that characterizes a given contour of an alphanumeric character is generated. Each number within the string of numbers represents a direction of transition between consecutive pixels in the contour. Sets of consecutive numbers within the string that represent defects in the contour are identified. The identified sets of consecutive numbers are replaced with corrected sets of at least one consecutive number to produce a corrected at least one string of numbers.

Abstract: A method determines a warping function between a first image and a second image. For each pixel in each scan-line of the first image, a distance matrix is constructed which represents distances between the pixel and a plurality of corresponding pixels of a second image. The distance matrices are ordered according a scan-line order of the pixels.

Abstract: An image processing system. An input/output device receives information for pixels in an image corresponding to an object, wherein the information specifies optical properties. A storage device stores the information. A processor determines an image of preliminary contour of the object based on the information. For pixels located on the preliminary contour are assigned as primary pixels, wherein anchor points determined by the location of the primary pixels, and the reference pixels determine modification vectors according to the information corresponding to the primary and reference pixels, and adjusts the positions of the anchor points according to the modification vectors. These processes are applied on every pixels or selected pixels located on the preliminary contour repeatedly to determine the final modified contour with sub-pixel accuracy.

Abstract: Disclosed are a chain code generating apparatus and a method thereof. In accordance with an embodiment of the present invention, the chain code generating apparatus can include an image input unit, receiving an image signal from a camera and converting the received image signal to a digital image signal, and separating a synchronizing signal from the digital image signal and outputting the synchronizing signal; an image storing unit, storing image data corresponding to an active image section of the digital image signal in units of frame based on the synchronizing signal; and a code generating unit, reading the image data stored in the image storing unit and performing an outline search of the analysis portion, and generating a chain code according to a correlation between adjacent pixels forming an outline of the analysis portion in accordance with the searched result.

Abstract: A method of compressing digital ink input including a sequence of strokes is provided. Each stroke is represented as a series of digital words representing x and y co-ordinates. The compressed digital ink data includes, for each stroke, at least one reference co-ordinate expressed in absolute terms, with subsequent co-ordinates being expressed in terms of an offset from a co-ordinate, estimated using linear prediction, such that a given co-ordinate may be determined on the basis of the previous m co-ordinates as: ? ~ n = ? i = 1 m ? c i ? ? n - i where ? represents either an x or a y co-ordinate of the digital ink input and ci are coefficients calculated as: c=A†? where A† is the pseudo inverse matrix of sample co-ordinates used for the linear prediction.

Abstract: Methods and apparatus reduce data transmission in a wireless client-server navigation system. A request for data representative of a map-related feature is received at a central server from a mobile unit. Data describing the feature is obtained in the form of line segments interconnecting points having coordinates such as a shapefile or other format. An operation is performed on the data describing the feature to generate data representative of the feature in a data-reduced format, and the data representative of the feature in the data-reduced format is forwarded to the mobile unit issuing the request. The operation responsible for producing the data-reduced format includes the steps of: receiving data describing a map; partitioning the map into a plurality of tiles; designating a reference point within each tile; representing the feature in the form of offsets from the reference points; and wherein the data-reduced format is based upon the reference points and offsets.

Abstract: It is desirable to provide a bitstream format for compressed data that would allow multiple processors to access and decompress different parts of the data in parallel. Compressed images are usually defined in terms of macroblocks that have a width less than the image width and a height less than the image height. Thus, an image is divided several bands of multiple lines, and each band of multiple lines is divided into a macroblock. The set of macroblocks that define a band is called herein a macroblock rasterscan. The bit stream format includes, for each image, a picture header followed by image scan data. The image scan data includes data corresponding to a plurality of macroblock rasterscans. The data for each macroblock rasterscan includes data for a plurality of macroblocks for a band of lines in the image followed by padding. The padding ensures that data for each macroblock rasterscan terminates on a data boundary.

Abstract: In one embodiment, the present invention is directed to a method for processing boundary information of a graphical object. The method may comprise: receiving a graphical image that comprises the graphical object, wherein the graphical object is defined by at least the boundary information; determining a plurality of vertices from the boundary information; and creating an approximated boundary utilizing at least the plurality of vertices, the graphical image, and a predetermined function that is operable to detect a contour between a pair of vertices by analyzing the graphical image.

Abstract: Aspects of a method and system for digital image contour removal (DCR) are provided. Digital image contours resulting from video compression may be detected in a portion of a video image by determining a variance within a search window. The variance may be compared to a threshold value for selecting the appropriate search window size. The variance may be adjusted to account for image brightness via a programmable offset value. A low pass filter having a window size that matches that of the selected search window size may be utilized to remove the detected digital image contours. Half-toning may be utilized to smooth out results for 8-bit digital video outputs. Half-toning may be based on a combination of ordered and random dither. Removal of digital image contours in video images may be performed in combination with the removal of mosquito noise and/or block noise in the video image.

Abstract: Digital signals are transmitted on a bus at given instants selectively in a non-encoded format and an encoded format. The decision whether to transmit the signals in non-encoded format or in encoded format is taken in part, based on a comparison of the signal to be transmitted on the bus for an instant of the aforesaid given instants with the signal transmitter on the bus for the preceding instant, so as to minimize switching activity on the bus.

Abstract: An iterative method for segmentation of an object appearing in a digital image, where the object is defined by a difference in intensity from its immediate surrounding region. The method may also be used for segmenting tissue masses found in a digital image, including masses found in digital mammography.

Abstract: An alpha-map encoding apparatus includes a first down-sampling circuit (21) for down-sampling an alpha-map signal which represents the shape of an object and the position in the frame of the object at a down-sampling ratio based on size conversion ratio information, an up-sampling circuit (23) for up-sampling the alpha-map signal at an up-sampling ratio based on size conversion ratio information given to restore the down-sampled alpha-map signal to an original size, and outputting a local decoded alpha-map signal, a motion estimation/compensation circuit (25) for generating a motion estimation/compensation signal on the basis of the previous decoded video signal and a motion vector signal, a second down-sampling circuit (26) for down-sampling the motion estimation/compensation signal at the down-sampling ratio, a binary image encoder for encoding the alpha-map signal down-sampled by the first down-sampling circuit to a binary image in accordance with the motion estimation/compensation signal down-sampled by t

Abstract: A method of compressing a digital ink input is disclosed. The digital ink includes a sequence of strokes, each stroke being represented as a series of digital words representing x and y co-ordinates, the compressed digital ink data including, for each stroke, at least one reference co-ordinate expressed in absolute terms, with subsequent co-ordinates being expressed in terms of an offset from a co-ordinate, estimated using linear prediction, such that a given co-ordinate may be determined on the basis of the previous m co-ordinates as formula (1); where are coefficients dependent on the nature of the digital ink, and ? represents either an x or a y co-ordinate.

Abstract: In a method of encoding/decoding a video sequence, which is composed of video frames, at least one video frame is divided into a set of coding blocks, and at least one of the coding blocks is encoded by intra-coding. Then a first reliable region that comprises at least one intra-coded coding block is determined, and the first reliable region in the video sequence is encoded such that creation of an information dependency between the first reliable region and coding blocks outside the first reliable region is prevented.

Abstract: A system and method for compressing digital pen stroke data utilizing curve simplification. Digital pen stroke images (ink images) generate a relatively large amount of data to preserve the ink image generated on a device. Current ink compression algorithms utilize lossless compression algorithm that have limited success. The invention provides a lossy compression algorithm to reduce the amount of data required to store and transmit ink data. The invention utilizes a two-part algorithm to reduce and compress the number of data points representing the ink data. The invention also utilizes curve splines to reconstruct and smooth the lossy ink data image.

Abstract: In an image processing method, contour information is extracted on the basis of terminal points and intersections included in a thinned line drawing, the contour information being extracted for each of closed curves and line elements connecting the terminal points and the intersections included in the line drawing, and skeletonized vector data is generated on the basis of the contour information. Start and end terminal points in the skeletonized vector data are determined. Artificial vectors to be inserted between the determined start and end terminal points are generated, and artificial-vector-inserted vector data including the generated artificial vectors is generated. A smoothing process is performed for the artificial-vector-inserted vector data, and then smoothed, non-circumference vector data is generated on the basis of the start and end terminal points. The thinned line drawing is raster-scanned in units of a pixel matrix.

Abstract: A method for processing data is described. In one embodiment, the method includes decompressing a plurality of sets of compressed data, including performing detiling on a first set of compressed data using neighbor information from at least one other set of compressed data, and recombining the plurality of decompressed tiles into an image.

Abstract: A quantization error compensation includes a dividing unit to divide an input current image signal into a first high-frequency signal and a low-frequency signal; a changing unit to replace bits of the first high-frequency signal with a predetermined signal to output a second high-frequency signal; an adding unit to add the low-frequency signal and the second high-frequency signal to create a composite signal; a quantization unit to cut n number of bits of the composite signal and to output the cut composite signal and the n number of bit signal; an equalizing unit to output a brightness equalizing value of the cut composite signal; a calculating unit to calculate a compensation value using the n number of the bit signal and a difference between brightness equalizing values with respect to a current and next brightness levels; and a compensation unit to add the compensation and the current brightness equalizing values.

Abstract: A method for inspecting electrical circuits, and a system for carrying out the method, generating a representation of boundaries of elements in an image of an electrical circuit which is under inspection, and analyzing at least some locations of at least some boundaries in the representation of boundaries of elements to identify defects in the electrical circuit.

Abstract: The present invention includes a method for matching a stored template with an image of an object. This is a final stage identification device in the at least one candidate array is received from a prescreener and/or intermediate discriminator. The candidate array includes a respective plurality of direction values at least partially defining a respective contour of an object within a two-dimensional image containing a possible target. The candidate array is compared with at least one stored template array. The stored template array includes a respective plurality of direction values at least partially defining an outline of a predetermined object of interest. The template array may include a plurality of template segment arrays such that various portions of the overall template are compared one at a time with the entire candidate array. The match between candidate and stored template may be scored based upon how well the template segments correspond to the candidate.

Abstract: The present invention includes a method for analyzing an image to screen for target candidates wherein an edge-follower detects straight segments within a plurality of longer edges and detects also from the longer edges, contours that go around areas that are the right size. The invention also contemplates starting the edge-follower from seeds on the image and terminating the edge-following process if the edge meanders too much to ever become an acceptable contour. In accordance with another embodiment, the straight segments can be further screened by measuring the gradient direction and then noting the deviation from the mean of those direction values. The highly straight edges thus found, in confluence with each other, or near a correct size contour define likely candidates.

Abstract: One embodiment relates to an apparatus for image processing. The apparatus includes a candidate edge chain identifier for identifying candidate edge chains in an image being processed, means for calculating a dynamic chain-based threshold function that is dependent on at least one characteristic of the image being processed, and a threshold applicator for applying the dynamic chain-based threshold function to the candidate edge chains. The characteristic of the image being processed may be global in that it is determined from the overall image being processed. A system may include an encoder or a decoder, both of which include the above apparatus. Another embodiment relates to a method for image processing. The method determines a dynamic chain-based threshold function that is dependent on at least one characteristic of the image being processed and applies the dynamic threshold to a candidate edge chain.

Abstract: The present invention concerns a way of compressing an initial data structure that defines an image as an array of pixel elements. The method includes generating a new data structure that defines contours at least some of which are contours having a constant color value to within a tolerance.

Abstract: The present invention includes a method for analyzing an image wherein elements defining a path within a two-dimensional image are received from a prescreener. A Sobel operator may be applied to the region around each of the elements of the chain to obtain a corresponding array of gradient directions. An angle correction may be applied to any of the gradient directions that goes beyond the highest value (in radian measure; the Pi ?Pi transition), to obtain an array of gradient directions free of any artificial jumps in value. The gradient direction array (Sobel chaincode) can have its bandwidth taken to determine a single number of straightness so as to identify extremely straight edges, (manmade objects) from less straight edges (natural objects). A similar process can be used to analyze contours for straight sections, which are also parallel. These two and other filters applied to the gradient array can be part of a feature suite, for feature space analysis.

Abstract: The present invention relates to a method compressing image data, more particularly to a method for compressing image data by using characteristic values. At first, input image data are executed by using a pre-processing process of the present invention. The pre-processing process is to use a mathematical calculation method, a filter, or a database to differentiate outlines of objects and to classify different objects of the image data. Then different colors, which are in the outlines of the different objects, are acquired by using a color classifying method and the different colors are used to be different characteristic values of the image data. At last, the different characteristic values are saved individually in a memory to finish the method for compressing image data by classifying colors.

Abstract: An apparatus for image processing including a region detector, a density conversion unit, a compression unit, and an expansion unit. The region detector detects an edge region in an image data. The density conversion unit reduces a density difference within the edge region detected by the region detector. The compression unit compresses the image data within the edge region where the density difference is reduced by the density conversion unit, using the discrete cosine transform. The expansion unit expands the image data compressed by the compression unit.

Abstract: The invention provides techniques for thinning halftone dots in a halftone dot bit map. A bit map filter may be used to thin the dots. For example, a target glyph may passed over the bit map. If any subsets of bits within the bit map match the target glyph, the subsets of bits can be replaced with bits defined by a thinned glyph. In this manner, the ink of a halftone print can be reduced in a manner that enhances the visual appearance of the print.

Abstract: The invention relates to a method of coding segmented pictures, or partitions, divided into homogeneous regions. Said method, called intra-mode coding process, comprises, for each successive partition, the steps of translating the picture of the labels associated to the regions into a description in terms of a contour element chain in which the elements are defined by means of their movements through successive basic cells, tracking inside each successive cell each contour from its initial contour point, previously extracted, to its end by storing chain symbols corresponding both to input, internal and output contour elements of said cell and to priorities between possible multiple outputs elements, and repeating these steps up to the end of each successive contour segment of the concerned partition.

Abstract: A system and method of automatically creating a NIMA certified line drawing from a National Imagery Transmission Format (NITF) image file. A grayscale (electro-optical) image and its associated metadata from a NITF file is input into the computer based system. Pre-screening operations are performed on the metadata prior to image processing to ensure that National Imagery and Mapping Agency (NIMA) requirements and criteria are met. Image processing algorithms then perform filtering, encoding, edge detection, and custom edge pattern classification procedures to create a declassified line drawing. The line drawing can then be saved in any number of standard commercial file formats.

Abstract: One embodiment relates to an apparatus for image processing. The apparatus includes a candidate edge chain identifier for identifying candidate edge chains in an image being processed, means for calculating a dynamic chain-based threshold function that is dependent on at least one characteristic of the image being processed, and a threshold applicator for applying the dynamic chain-based threshold function to the candidate edge chains. The characteristic of the image being processed may be local in that it is calculated from the vicinity of each candidate chain. A system may include an encoder or a decoder, both of which include the above apparatus. Another embodiment relates to a method for image processing. The method determines a dynamic chain-based threshold function that is dependent on at least one characteristic of the image being processed and applies the dynamic threshold to a candidate edge chain.

Abstract: The present invention relates to digital image sensors and in particular to contour filters (ZSB, 7) preventing green non-uniformity in the contour signal of the RGB Bayer image sensors. A set of rules is specified for designing the filter coefficients in the filter, whereby green non-uniformity is prevented.

Abstract: In a shape manipulation method, relocation information is received indicative of an intended change in position of a target location on a Bezier shape, the contour of the Bezier shape being governed by control points. In response to the relocation information, new positions are determined for canonical locations on the shape based on predefined intended behaviors of the canonical locations.