| Project/Area Number |
16500001
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Tohoku University |
|---|
Principal Investigator |
TOKUYAMA Takeshi Tohoku University, Graduate School of Information Sciences, Professor, 大学院・情報科学研究科, 教授 (40312631)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
KAWARABAYASHI Kenichi Tohoku University, Graduate School of Information Sciences, Research Associate, 大学院・情報科学研究科, 助手 (40361159)
|
|---|
| Project Period (FY) |
2004 – 2005
|
| Project Status |
Completed (Fiscal Year 2005)
|
| Budget Amount *help |
¥3,500,000 (Direct Cost: ¥3,500,000)
Fiscal Year 2005: ¥1,600,000 (Direct Cost: ¥1,600,000)
Fiscal Year 2004: ¥1,900,000 (Direct Cost: ¥1,900,000)
|
|---|
| Keywords | Algorithms / combinatorics / graph theory / Discrepancy / digitization / computational geometry |
|---|
| Research Abstract |
The research pursue the generation of high-quality digitization (rounding) of analogue data with respect to quality measures based on discrete mathematical concept of graphs and hypergraphs.
Such research has important applications to digital halftoning that is a major topic in image processing, as well as other many digitization applications.
In particular, we consider discrepancy distances associated with hypergraphs and investigate on the space of global roundings that have the discrepancy distance at most one from the input.
The most important outputs are given in the category of mathematical investigation of the combinatorial structure of the space of global roundings. We have given a conjecture that for the hypergraph generated from the shortest path metric of a connected graph, the space of global roundings is indeed a simplex. We have affirmatively proven this conjecture for several classes of graphs such as paths, cycles, mesh, series-parallel graphs, uniform k-trees, and so on.
As byproducts, we have designed efficient polynomial-time algorithm for enumerating global roundings for such hypergraphs. Also we have proven a similar property for several range spaces considered in computational geometry.
Moreover, we have investigated several properties/algorithms on graphs defined by minors, since it seems that our conjecture will be proven on such graphs by using graph-minor theory. We have published 10 international journal papers and several cnference papers during the period.
We have also investigated lower/upper bounds of discrepancies of hypergraphs corresponding to submatrices of a matrix that are important in application to digital halftoning. We have done some experiments on digital halftoning instances by using our methodology.
|
