Method and system for image processing, and program
    1.
    发明专利
    Method and system for image processing, and program 有权
    图像处理方法与系统及程序

    公开(公告)号:JP2002366895A

    公开(公告)日:2002-12-20

    申请号:JP2001163376

    申请日:2001-05-30

    CPC classification number: G06K9/2054 G06K2209/01

    Abstract: PROBLEM TO BE SOLVED: To provide technology which can stably discriminate a document by generating a stable virtual page mark even for a non-OCR document.
    SOLUTION: To detect the virtual page mark, a key segment which can stably be detected in the document is previously defined and on the basis of the key segment, the virtual page mark (circumscribed rectangle) is generated. Redundancy is given to the detection of the key segment and even if the key segment can not be detected because of a stain, absence, etc., an alternative segment is defined to generate the virtual page mark on the basis of the alternative segment. The selected key segment meets conditions; (1) a segment which is thick enough to be tolerant of faintness of the document, (2) a segment which is at a sufficient distance from the circumference of the document and stable against skew and the absence of a document end, and (3) a segment which does not overlap with a fold of the original paper of the document.
    COPYRIGHT: (C)2003,JPO

    Abstract translation: 要解决的问题:提供即使对于非OCR文档也可以通过生成稳定的虚拟页标记来稳定地区分文档的技术。 解决方案:为了检测虚拟页面标记,先前定义了可以稳定地检测到的文档中的关键段,并且基于关键段,生成虚拟页面标记(外接矩形)。 给予关键段的检测冗余,即使由于污点,缺失等而无法检测到关键段,也可以定义替代段,以便在替代段的基础上生成虚拟页标记。 所选关键段满足条件; (1)足够厚以容忍文件微弱的部分,(2)与文件圆周距离足够远的部分,并且稳定地抵抗歪斜和文档端部的缺失,(3) )不与文件的原始纸张的折叠重叠的片段。

    SERVER, RECRUITING METHOD PARTICPANT AND RECORDING MEDIUM

    公开(公告)号:JP2002215765A

    公开(公告)日:2002-08-02

    申请号:JP2000397046

    申请日:2000-12-27

    Applicant: IBM

    Abstract: PROBLEM TO BE SOLVED: To efficiently execute intermediary business by officially announcing participant recruiting work and the applying state at any time. SOLUTION: This intermediary server 100 is connected to a network to provide information according to access from a member client 300 made through this network, and is provided with a job offer information database 150 for storing job offer information classified with every work, an application accepting part 130 for accepting an application for the work in this job offer information made by a member client 300 terminal, and a job offer information/applying state editing part 120 for presenting information on a pre-applicant to a new applicant with every work in this job offer information together with this job offer information when accepting a new application.

    PROCESSING METHOD AND PROCESSOR OF BIT MAP IMAGE AND STORAGE MEDIUM STORING IMAGE PROCESSING PROGRAM TO PROCESS BIT MAP IMAGE

    公开(公告)号:JPH11143986A

    公开(公告)日:1999-05-28

    申请号:JP28570997

    申请日:1997-10-17

    Applicant: IBM

    Abstract: PROBLEM TO BE SOLVED: To enable the specification of a character frame and character recognition of a business form without a page mark and a reference mark even with a scanner incapable of detecting an edge of the business form and to simultaneously increase the speed of a discrimination processing of a bit map image by comparing images based on a externally contacted rectangle, etc., formed from horizontal segments capable of being detected at high speed. SOLUTION: When the bit map image including the horizontal segments like character frames 323, 327 and ruled lines 301, 303 on the business form is discriminated as in the case that the business form 300 with the black character frame and without the page mark is discriminated and the character is recognized by an OCR, the horizontal segments are extracted as characteristics of the business form, the circumscribed rectangle 350 is formed in an area to be generated from the horizontal segments and the circumscribed rectangle 350 is defined as information to discriminate an estimation standard of a position of the character frame and a kind of the business form. Even the business form without the page mark and the reference mark is recognized by adapting the information to the OCR. In addition, the business form is more exactly discriminated by comparing the extracted horizontal segments themselves with the horizontal segment of a preliminarily registered business form definition body and comparing similarity.

    NEIGHBORHOOD-POINT DETECTION METHOD AND PATTERN RECOGNITION APPARATUS

    公开(公告)号:JPH0944602A

    公开(公告)日:1997-02-14

    申请号:JP19041495

    申请日:1995-07-26

    Applicant: IBM

    Abstract: PROBLEM TO BE SOLVED: To detect the most proximate point at high speed with high precision. SOLUTION: A characteristic space is divided into groups for every characteristics more than one or two and it is discriminated whether a distance value calculated in each group exceeds a threshold THR-MIX for each group or not. In this case, the THR-MIX is set at the average value of a threshold set, based on a cumulative characteristic amount and a threshold set, based on a dimensional number. When the distance value for each group exceeds the threshold THR-MIX, the first phase of screening is performed for excluding a prototype applying this distance value from the following distance calculation. Further concerning the group as the object of the first phase of screening, a threshold THR-RATE is calculated from the minimum, value of distance value to that group and the second phase of screening is performed.

    PICTURE CUTTING-OUT DEVICE AND CHARACTER RECOGNITION DEVICE

    公开(公告)号:JPH08287184A

    公开(公告)日:1996-11-01

    申请号:JP7210495

    申请日:1995-03-29

    Applicant: IBM

    Abstract: PURPOSE: To shorten a processing time without deteriorating detecting precision by calculating pixel distribution by scanning picture elements in each range, detecting the positions of the up and down and right and left inside walls of a character frame based on each pixel distribution, and separating the character frame from the image data in the character frame based on the inside walls of the character frame. CONSTITUTION: A scanner 12 scans while a paper is irradiated with a white light, quantizes the intensity of the reflected light, converts an original image 11 into digital image data, and inputs the data through a scanner I/F control circuit 14 to a CPU 16. Pixel distribution in each range is calculated by the range setting means of the CPU 16, and the positions of the up and down and right and left inside walls of the character frame are detected by an inside wall detecting means based on each calculated pixel distribution. The character frame is separated from the image data in the character frame based on the detected inside walls of the character frame. Thus, a processing time can be sharply shortened without deteriorating detecting precision.

    TREE GROWTH SYSTEM AND METHOD
    6.
    发明专利

    公开(公告)号:JPH04278634A

    公开(公告)日:1992-10-05

    申请号:JP5554391

    申请日:1991-02-28

    Applicant: IBM

    Abstract: PURPOSE: To enable a user to easily describe a tree and also to generate a data structure showing the tree in a memory by showing the attributes to be given to the nodes of the tree in every type of them. CONSTITUTION: A table contains the columns of the levels (depth), the node type names and plural attributes, and a user writes the necessary information into these columns. For example, 0 is written in the level column for a node A that is positioned at the highest part of a tree together with 1 written for nodes B to E as the children of A and the sequence relation of the children reflected on the upper-lower relation respectively. The number of nodes, for example, is written in the attribute column, and a tree shown by this table includes the nodes belonging to the types B to E as the children of the node A as long as both maximum and minimum value are set to 1. In other words, the pointer data can be generated through such interpretation as mentioned above and the user can easily input the pointer data by means of a text editor.

    CHARACTER RECOGNITION EQUIPMENT
    7.
    发明专利

    公开(公告)号:JPS6472294A

    公开(公告)日:1989-03-17

    申请号:JP22423387

    申请日:1987-09-09

    Applicant: IBM

    Abstract: PURPOSE: To improve the efficiency at recognition time by generating a recognition dictionary in tree structure which considers redundancy by using not binary feature quantities such as whether a pixel is black or white, but multi-valued feature quantities having maximum and minimum values. CONSTITUTION: A system consists of a personal computer 1, a bit map display 2, a scanner 3 and an auxiliary storage device 4, and a recognition part 5, a postprocessing part 6, and a user interface part 7 which are encircled with a broken line are actualized as software. Then the tree-structured dictionary is searched by using a multi-valued feature quantity extracted from an unknown input character pattern, an upper-limit or lower-limit value is assigned to at least one branch in the tree-structured dictionary, and the search of the tree- structured dictionary is quit when the multi-valued feature quantity extracted from the unknown input character pattern for the branching deviates from the upper-limit or lower-limit value. Consequently, the tree-structured dictionary need not be searched unnecessarily and a character can be recognized fast.

    IMAGE PROCESSING METHOD, DETECTING METHOD FOR RELATIVE DENSITY, AND IMAGE PROCESSOR

    公开(公告)号:JP2001312721A

    公开(公告)日:2001-11-09

    申请号:JP2000126707

    申请日:2000-04-26

    Applicant: IBM

    Abstract: PROBLEM TO BE SOLVED: To segment a character or the like, which is written with a pen or the like, relatively darker than a background in a multi-level image at a high speed to be used for the preprocessing of character recognition or the like, and to perform binarization by emphasizing an object so as not to impair the discriminability of characters or graphics. SOLUTION: While paying attention to the fact that the character written with a pen or the like is relatively darker than the background, a density relative to the periphery is found, the binarization is performed and the object such as character is emphasized. Namely, this device is provided with a meshing part 13 for meshing an inputted image with a sub-image, an average density detecting part 14 for calculating the density of each of meshes, an attentional pixel weight coefficient storage part 18 for determining the degree of influence upon an attentional pixel of a mesh adjacent to the mesh, to which an attentional pixel belongs, a relative density calculating part 19 for detecting the relative density on the basis of the density and the degree of influence, an absolute density storage part 17 for detecting and storing the absolute density of the attentional pixel, and output density calculating part 21 for calculating the output value of the attentional pixel on the basis of the relative density and the absolute density.

    METHOD AND DEVICE FOR IMAGE PROCESSING AND STORAGE MEDIUM STORED WITH IMAGE PROCESSING PROGRAM

    公开(公告)号:JPH1173497A

    公开(公告)日:1999-03-16

    申请号:JP23304897

    申请日:1997-08-28

    Applicant: IBM

    Abstract: PROBLEM TO BE SOLVED: To increase the processing speed when the outline of a figure is smoothed by performing the smoothing process by using only logical operation without using 'if then else' or 'switch' syntax of a conditional judgement and a branch instruction as an element causing a decrease in the processing speed. SOLUTION: Process units (t bits) are put one over another, a pattern (process object s bits) for writing a process result is loaded in the center part of an (r)-bit regsiter, and contiguous patterns of a source image are loaded to right and left adjacent parts and processed. Here, a process unit (t) consists of 64 bits the process object (s) which is processed and written consists of 48 bits. When a figure and characters drawn in a bit pattern is smoothed, not the if then else' or 'switch' syntax of a conditional judgement and a branch instruction as an element causing a decrease in process speed, but only logical operations for shifting a bit array, NOT, AND, OR, etc., are used to perform a process for smoothing.

Patent Agency Ranking