# US 2013/0153663 A1 · Method and Apparatus for Locating Bar Codes Including QR Codes

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2013/0153663 A1
- Document ID: US20130153663A1
- Status: Published application
- Kind: A1
- Application number: 13/602,485
- Filed: 2012-09-04
- Published: 2013-06-20
- Earliest claimed: 2011-12-20
- Assignees: Seiko Epson Corporation
- Inventors: Yang Yang; Eunice Poon
- Web page: https://patentgrep.com/patent/US20130153663A1

## CPC

- G06K 7/1443: {locating of the code in an image}
- G06K: GRAPHICAL DATA READING (image or video recognition or understanding G06V); PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS

## Abstract

A method for identifying a QR code in an image includes inputting an image, and using one or more computer processor to identify edges in the image; create an edge count image; label connected regions in the edge count image; create a candidate region list; for each individual candidate in the candidate region list: find regions that overlap with the region in the individual candidate; group regions that overlap into a group of overlapped regions; for each group: merge the overlapped regions into a merged region; add each merged region to the candidate region list to form a new candidate region list; and perform decoding of a QR code in each region in the new candidate region list.

## Claims

### Claim 1

A method for identifying a QR code in an image, comprising:
inputting an image;
using a processor to:
identify edges in the image;
create an edge count image;
label connected regions in the edge count image;
create a candidate region list;
for each individual candidate in the candidate region list:
find regions that overlap with the region in the individual candidate;
group regions that overlap into a group of overlapped regions;
for each group:
merge the overlapped regions into a merged region;
add each merged region to the candidate region list to form a new candidate region list; and
perform decoding of a QR code in each region in the new candidate region list.

### Claim 2 (depends on 1)

A method for identifying a QR code in an image as in claim 1, wherein finding regions that overlap with the region in the individual candidate comprises:
finding horizontal overlap between two regions, region1 and region2 as follows
DisCx
=

cx


2
-
cx


1

,

W


1
=
width


of


region


1
2
,

W


2
=
width


of


region


2
2
If


(
DisCx
<
W


1
+
W


2
)


then


two


regions


are


overlapped
where cx1 is the center of region1 in the x direction and cx2 is the center of region2 in the x direction.

### Claim 3 (depends on 1)

A method for identifying a QR code in an image as in claim 1, wherein finding regions that overlap with the region in the individual candidate comprises:
finding vertical overlap between two regions, region1 and region2 as follows
DisCy
=

cy


2
-
cy


1

,

H


1
=
height


of


region


1
2
,

H


2
=
height


of


region


2
2
If


(
DisCy
<
H


1
+
H


2
)


then


two


regions


are


overlapped
where cy1 is the center of region1 in the y direction and cy2 is the center of region2 in the y direction.

### Claim 4

A method for identifying at least two barcodes in the same image with one barcode being rotated with respect to another barcode, comprising:
inputting an image;
using a processor to:
decode a horizontal or vertical barcode in the image;
next, decode a rotated barcode in the image, the rotated barcode being rotated with respect to the horizontal or vertical barcode.

### Claim 5 (depends on 4)

A method for identifying at least two barcodes in the same image as in claim 4, wherein decoding a horizontal or vertical barcode includes decoding a PDF417 barcode.

### Claim 6 (depends on 4)

A method for identifying at least two barcodes in the same image as in claim 4, further comprising:
after decoding the rotated barcode in the image, then decoding a 2D barcode.

### Claim 7 (depends on 6)

A method for identifying at least two barcodes in the same image as in claim 6, wherein the 2d barcode is a QR code and further comprising:
using the processor to:
identify edges in the image;
create an edge count image;
label connected regions in the edge count image;
create a candidate region list;
for each individual candidate in the candidate region list:
find regions that overlap with the region in the individual candidate;
group regions that overlap into a group of overlapped regions;
for each group:
merge the overlapped regions into a merged region;
add each merged region to the candidate region list to form a new candidate region list; and
perform decoding of a QR code in each region in the new candidate region list.

### Claim 8

A device for identifying a QR code in an image, comprising:
a unit for inputting an image;
a processor that:
identifies edges in the image;
creates an edge count image;
labels connected regions in the edge count image;
creates a candidate region list;
for each individual candidate in the candidate region list:
finds regions that overlap with the region in the individual candidate;
groups regions that overlap into a group of overlapped regions;
for each group:
merges the overlapped regions into a merged region;
adds each merged region to the candidate region list to form a new candidate region list; and
performs decoding of a QR code in each region in the new candidate region list.

### Claim 9 (depends on 8)

A device for identifying a QR code in an image as in claim 8, wherein finding regions that overlap with the region in the individual candidate comprises:
finding horizontal overlap between two regions, region1 and region2 as follows
DisCx
=

cx


2
-
cx


1

,

W


1
=
width


of


region


1
2
,

W


2
=
width


of


region


2
2
If


(
DisCx
<
W


1
+
W


2
)


then


two


regions


are


overlapped
where cx1 is the center of region1 in the x direction and cx2 is the center of region2 in the x direction.

### Claim 10 (depends on 8)

A device for identifying a QR code in an image as in claim 8, wherein finding regions that overlap with the region in the individual candidate comprises:
finding vertical overlap between two regions, region1 and region2 as follows
DisCy
=

cy


2
-
cy


1

,

H


1
=
height


of


region


1
2
,

H


2
=
height


of


region


2
2
If


(
DisCy
<
H


1
+
H


2
)


then


two


regions


are


overlapped
where cy1 is the center of region1 in the y direction and cy2 is the center of region2 in the y direction.

### Claim 11 (depends on 8)

A device for identifying a QR code in an image as in claim 8, wherein the unit for inputting an image is a scanner.

### Claim 12 (depends on 8)

A device for identifying a QR code in an image as in claim 8, further comprising a memory for storing the image.
