公开(公告)号：US20150242710A1

公开(公告)日：2015-08-27

申请号：US14698528

申请日：2015-04-28

Applicant: QUALCOMM Incorporated

Inventor： Pawan Kumar Baheti ,  Kishor K. Barman ,  Raj Kumar Krishna Kumar

IPC: G06K9/72

CPC classification number: G06K9/72 ,  G06K2209/01

Abstract: Systems, apparatuses, and methods to relate images of words to a list of words are provided. A trellis based word decoder analyses a set of OCR characters and probabilities using a forward pass across a forward trellis and a reverse pass across a reverse trellis. Multiple paths may result, however, the most likely path from the trellises has the highest probability with valid links. A valid link is determined from the trellis by some dictionary word traversing the link. The most likely path is compared with a list of words to find the word closest to the most.

Abstract translation: 提供了将词的图像与词列表相关联的系统，装置和方法。 基于网格的字解码器使用前向网格的正向传递和跨反向网格的反向传递来分析一组OCR字符和概率。 可能会导致多个路径，但是，来自网格的最可能的路径具有有效链接的最高概率。 通过一些通过链接的字典字词从网格确定有效的链接。 最可能的路径与单词列表进行比较，以找到最接近的单词。

公开(公告)号：US20130195360A1

公开(公告)日：2013-08-01

申请号：US13791188

申请日：2013-03-08

Applicant: QUALCOMM Incorporated

Inventor： Raj Kumar Krishna Kumar ,  Pawan Kumar Baheti

IPC: G06K9/78

CPC classification number: G06K9/78 ,  G06K9/32 ,  G06K2209/01 ,  G06K2209/013

Abstract: Systems, apparatus and methods for extracting lower modifiers from a word image, before performing optical character recognition (OCR), based on a plurality of tests comprising a first test, a second test and a third test are presented. The method obtains the word image and performing a plurality of tests (e.g., a first test, a second test and a third test). The first test determines whether a vertical line spanning the height of the word image exists. The second test determines whether a jump of a number of components in the lower portion of the word image exists. The third test determines sparseness in a lower portion of the word image. The plurality of tests may run sequentially and/or in parallel. Results from the plurality of tests are used to decide whether a lower modifier exists by comparing and accumulating test results from the plurality of tests.

Abstract translation: 提出了基于包括第一测试，第二测试和第三测试的多个测试之前，在执行光学字符识别（OCR）之前从单词图像中提取下修改器的系统，设备和方法。 该方法获得单词图像并执行多个测试（例如，第一测试，第二测试和第三测试）。 第一个测试确定是否存在跨越单词图像的高度的垂直线。 第二个测试确定是否存在单词图像下部的一些组件的跳转。 第三个测试确定单词图像下部的稀疏度。 多个测试可以顺序地和/或并行地运行。 多个测试的结果用于通过比较和累积来自多个测试的测试结果来决定是否存在较低的修饰符。

公开(公告)号：US09047540B2

公开(公告)日：2015-06-02

申请号：US13829960

申请日：2013-03-14

Applicant: QUALCOMM Incorporated

Inventor： Pawan Kumar Baheti ,  Kishor K. Barman ,  Raj Kumar Krishna Kumar

IPC: G06K9/34 ,  G06K9/72

CPC classification number: G06K9/72 ,  G06K2209/01

Abstract: Systems, apparatuses, and methods to relate images of words to a list of words are provided. A trellis based word decoder analyses a set of OCR characters and probabilities using a forward pass across a forward trellis and a reverse pass across a reverse trellis. Multiple paths may result, however, the most likely path from the trellises has the highest probability with valid links. A valid link is determined from the trellis by some dictionary word traversing the link. The most likely path is compared with a list of words to find the word closest to the most.

Abstract translation: 提供了将词的图像与词列表相关联的系统，装置和方法。 基于网格的字解码器使用前向网格的正向传递和跨反向网格的反向传递来分析一组OCR字符和概率。 可能会导致多个路径，但是，来自网格的最可能的路径具有有效链接的最高概率。 通过一些通过链接的字典字词从网格确定有效的链接。 最可能的路径与单词列表进行比较，以找到最接近的单词。

公开(公告)号：US20140023273A1

公开(公告)日：2014-01-23

申请号：US13829960

申请日：2013-03-14

Applicant: QUALCOMM INCORPORATED

Inventor： Pawan Kumar Baheti ,  Kishor K. Barman ,  Raj Kumar Krishna Kumar

IPC: G06K9/72

CPC classification number: G06K9/72 ,  G06K2209/01

Abstract: Systems, apparatuses, and methods to relate images of words to a list of words are provided. A trellis based word decoder analyses a set of OCR characters and probabilities using a forward pass across a forward trellis and a reverse pass across a reverse trellis. Multiple paths may result, however, the most likely path from the trellises has the highest probability with valid links. A valid link is determined from the trellis by some dictionary word traversing the link. The most likely path is compared with a list of words to find the word closest to the most.

Abstract translation: 提供了将词的图像与词列表相关联的系统，装置和方法。 基于网格的字解码器使用前向网格的正向传递和跨反向网格的反向传递来分析一组OCR字符和概率。 可能会导致多个路径，但是，来自网格的最可能的路径具有有效链接的最高概率。 通过一些通过链接的字典字词从网格确定有效的链接。 最可能的路径与单词列表进行比较，以找到最接近的单词。

公开(公告)号：US20240250744A1

公开(公告)日：2024-07-25

申请号：US18159640

申请日：2023-01-25

Applicant: QUALCOMM Incorporated

Inventor： Venkatesh Bhat ,  Manikandan Chandrasekar ,  Raj Kumar Krishna Kumar

IPC: H04B7/145 ,  H04W76/27

CPC classification number: H04B7/145 ,  H04W76/27

Abstract: Methods, systems, and devices for wireless communications are described. Techniques described herein provide for passive beamforming for Wi-Fi. A first wireless device communicating in an active session via a first bandwidth with a second wireless device may use a passive beamforming technique to identify a transmission sector of the second wireless device and/or a receive sector for communications on a second bandwidth, while the first wireless device is in an inactive session state for the second bandwidth. The second wireless device may transmit beacons in the second bandwidth via directional transmission sectors while the first wireless device is in the inactive session state for the second bandwidth. The first wireless device may receive the beacons and may select a transmission sector based on the beacons. The first wireless device may indicate the selected transmission sector to the second wireless device. The first wireless device may select a receive sector based on the beacons.

公开(公告)号：US10098095B2

公开(公告)日：2018-10-09

申请号：US13898398

申请日：2013-05-20

Applicant: QUALCOMM Incorporated

Inventor： Raj Kumar Krishna Kumar ,  Kapil Bhattad ,  Dhananjay Ashok Gore ,  Yongbin Wei

IPC: H04W72/04 ,  H04L1/00 ,  H04L1/16 ,  H04L1/18

Abstract: When a UE does not completely decode a packet transmitted from a base station, the UE may send ACK/NACK to the base station, upon which the base station may retransmit the packet based on the ACK/NACK. However, the ACK/NACK fails to provide the base station with information needed by the UE for completely decoding the packet. Accordingly, a method, an apparatus, and a computer program product for wireless communication are provided. The apparatus receives a packet from a base station having a first MCS, determines information to provide to the base station, wherein the information comprises CQI relating to a channel condition and/or interference condition corresponding to time-frequency resources allocated for the received packet, and sends the information to the base station. Thereafter, the apparatus re-receives the packet from the base station, the re-received packet having a second MCS according to the information sent to the base station.

公开(公告)号：US09639783B2

公开(公告)日：2017-05-02

申请号：US14698528

申请日：2015-04-28

Applicant: QUALCOMM Incorporated

Inventor： Pawan Kumar Baheti ,  Kishor K. Barman ,  Raj Kumar Krishna Kumar

IPC: G06K9/34 ,  G06K9/72

CPC classification number: G06K9/72 ,  G06K2209/01

Abstract: Systems, apparatuses, and methods to relate images of words to a list of words are provided. A trellis based word decoder analyses a set of OCR characters and probabilities using a forward pass across a forward trellis and a reverse pass across a reverse trellis. Multiple paths may result, however, the most likely path from the trellises has the highest probability with valid links. A valid link is determined from the trellis by some dictionary word traversing the link. The most likely path is compared with a list of words to find the word closest to the most.

公开(公告)号：US09262699B2

公开(公告)日：2016-02-16

申请号：US13828060

申请日：2013-03-14

Applicant: QUALCOMM Incorporated

Inventor： Kishor K. Barman ,  Pawan Kumar Baheti ,  Raj Kumar Krishna Kumar

IPC: G06K9/62 ,  G06K9/78 ,  G06K9/72 ,  G06K9/34

CPC classification number: G06K9/78 ,  G06K9/344 ,  G06K9/723 ,  G06K2209/01 ,  G06K2209/013

Abstract: An electronic device and method identify a block of text in a portion of an image of real world captured by a camera of a mobile device, slice sub-blocks from the block and identify characters in the sub-blocks that form a first sequence to a predetermined set of sequences to identify a second sequence therein. The second sequence may be identified as recognized (as a modifier-absent word) when not associated with additional information. When the second sequence is associated with additional information, a check is made on pixels in the image, based on a test specified in the additional information. When the test is satisfied, a copy of the second sequence in combination with the modifier is identified as recognized (as a modifier-present word). Storage and use of modifier information in addition to a set of sequences of characters enables recognition of words with or without modifiers.

Abstract translation: 电子设备和方法识别由移动设备的相机捕获的真实世界的图像的一部分中的文本块，从块中切片子块，并将形成第一序列的子块中的字符识别为 用于识别其中的第二序列的预定序列集合。 当不与附加信息相关联时，第二序列可以被识别为被识别（作为不包含修饰词的词）。 当第二个序列与附加信息相关联时，将根据附加信息中指定的测试对图像中的像素进行检查。 当测试被满足时，与修饰符组合的第二个序列的拷贝被识别为识别（作为修饰语现在的词）。 修改器信息的存储和使用除了一组字符序列之外，还可以识别具有或不具有修饰符的单词。

公开(公告)号：US09141874B2

公开(公告)日：2015-09-22

申请号：US13789549

申请日：2013-03-07

Applicant: QUALCOMM Incorporated

Inventor： Raj Kumar Krishna Kumar ,  Pawan Kumar Baheti ,  Dhananjay Ashok Gore

IPC: G06K9/46

CPC classification number: G06K9/4671 ,  G06K9/4647 ,  G06K2209/01

Abstract: An image of real world is processed to identify blocks as candidates to be recognized. Each block is subdivided into sub-blocks, and each sub-block is traversed to obtain counts, in a group for each sub-block. Each count in the group is either of presence of transitions between intensity values of pixels or of absence of transition between intensity values of pixels. Hence, each pixel in a sub-block contributes to at least one of the counts in each group. The counts in a group for a sub-block are normalized, based at least on a total number of pixels in the sub-block. Vector(s) for each sub-block including such normalized counts may be compared with multiple predetermined vectors of corresponding symbols in a set, using any metric of divergence between probability density functions (e.g. Jensen-Shannon divergence metric). Whichever symbol has a predetermined vector that most closely matches the vector(s) is identified and stored.

Abstract translation: 处理真实世界的图像以识别块作为要被识别的候选。 每个块被细分为子块，并且每个子块被遍历以在每个子块的组中获得计数。 组中的每个计数是存在像素的强度值之间的转换或像素的强度值之间不存在转换。 因此，子块中的每个像素有助于每个组中的至少一个计数。 至少基于子块中的像素总数，子块中的计数被归一化。 可以使用概率密度函数（例如，Jensen-Shannon散度度量）之间的任何度量的度量，将包括这种归一化计数的每个子块的向量与集合中的相应符号的多个预定向量进行比较。 无论哪个符号具有与矢量最接近匹配的预定向量被识别和存储。

公开(公告)号：US09064191B2

公开(公告)日：2015-06-23

申请号：US13791188

申请日：2013-03-08

Applicant: QUALCOMM Incorporated

Inventor： Raj Kumar Krishna Kumar ,  Pawan Kumar Baheti

IPC: G06K9/78 ,  G06K9/32

CPC classification number: G06K9/78 ,  G06K9/32 ,  G06K2209/01 ,  G06K2209/013

Abstract: Systems, apparatus and methods for extracting lower modifiers from a word image, before performing optical character recognition (OCR), based on a plurality of tests comprising a first test, a second test and a third test are presented. The method obtains the word image and performing a plurality of tests (e.g., a first test, a second test and a third test). The first test determines whether a vertical line spanning the height of the word image exists. The second test determines whether a jump of a number of components in the lower portion of the word image exists. The third test determines sparseness in a lower portion of the word image. The plurality of tests may run sequentially and/or in parallel. Results from the plurality of tests are used to decide whether a lower modifier exists by comparing and accumulating test results from the plurality of tests.

Abstract translation: 提出了基于包括第一测试，第二测试和第三测试的多个测试之前，在执行光学字符识别（OCR）之前从单词图像中提取下修改器的系统，设备和方法。 该方法获得单词图像并执行多个测试（例如，第一测试，第二测试和第三测试）。 第一个测试确定是否存在跨越单词图像的高度的垂直线。 第二个测试确定是否存在单词图像下部的一些组件的跳转。 第三个测试确定单词图像下部的稀疏度。 多个测试可以顺序地和/或并行地运行。 多个测试的结果用于通过比较和累积来自多个测试的测试结果来决定是否存在较低的修饰符。