US 2014/0180470 A1Published application

Bin allocation method of point light sources for constructing light source sets

AssigneeNational Cheng Kung University

InventorsHaw-Ching YANG, Hung-Wei CHEN, Fan-Tien CHENG

Life of this patent

Estimating the term…

Loading patent…

Abstract

A bin allocation method of point light sources for constructing light source sets is provided. In this method, a matching matrix corresponding to each light source set product is provided for showing feasible combinations of bin codes of the point light sources which can be used for constructing the light source sets. Then, for reducing computation loading, the original matching matrix is reduced to a simplified matching matrix according to effective inventories of point light sources. Thereafter, the simplified matching matrix of each light source set product is applied to search for low exchangeable bin codes of the point tight sources among the light source set products. Then, the point light sources with the low exchangeable bin codes are precedently used for constructing the light source set products.

A bin allocation method of point light sources for constructing light source, the bin allocation method comprising:

providing a plurality of bin codes corresponding to a plurality of point light sources, wherein characteristics of the point light sources are distributed into a plurality of zones, and the bin codes represent the characteristics of the point light sources corresponding to the zones respectively;
providing a p number of zero-one matrices,
C
k
o
=
[
b
11
…
b
1

n
⋮
b
ij
⋮
b
n


1
…
b
nn
]
,
corresponding to p types of light source set products respectively, wherein 1≦k≦p;1≦i,j≦n;
Cko represents the zero-one matrix corresponding the kth type of light source set product;
a represents the number of the bin codes;
if bij is 1, it means that the ith bin code and the jth bin code are a feasible combination for forming the kth type of light source set product;
and if bij is 0, it means that the ith bin code and the jth bin code are an infeasible combination for forming the kth type of light source set product;
providing a p number of mask matrices,
C
k
M
=
[
v
11
…
v
1

n
⋮
v
ij
⋮
v
n


1
…
v
nn
]
corresponding to p types of light source set products respectively, wherein CkM represents the mask matrix corresponding the kth type of light source set product;
if inventories of the point light sources with the ith bin code or the jth bin code are invalid inventories, vij is set to 0;
and if inventories of the point light sources with the ith bin code and the jth bin code are valid inventories, vij is set to 1:
performing a simplifying step on each of the types of light source set products:
CkR=Cko∘CkM, wherein the symbol “∘” is defined as a mask operation:
if entries of a row and a column in CkM at which an element is addressed are 0 simultaneously, it represents that the point light source with a first bin code corresponding to the element does not have a valid inventory, and the row and the column corresponding to the first bin code of the element in Cko are deleted simultaneously, thereby obtaining a simplified matching matrix
C
k
R
=
[
c
11
…
c
1

m
⋮
c
st
⋮
c
m


1
…
c
mm
]
,
wherein 1≦s,t≦m;
m represents the amount of the bin codes with valid inventories;
m<n;
and cst is corresponding to bij in the original Cko;
stacking and adding the p number of CkR to form a side-bin matching matrix
C
SB
=
∑
k
=
1
P

C
k
R
=
[
c
11
′
…
c
1

m
′
⋮
c
st
′
⋮
c
m


1
′
…
c
mm
′
]
;
when 1≦c′st≦η, selecting the point light sources with the ith bin code and the jth bin code in the original Cko corresponding to c′st as a plurality of side-bin point light sources, wherein is a threshold value;
and
performing a zeroth-level allocation for precedently using the side-bin point light sources to assemble the light source set products.

136 more elements

Abstract

Claims5