Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jun Tsukamoto

dblp:94/4303 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorSystems, architecture and hardware · 1Software engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Computational photography and imaging · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational photography and imaging
projector-camera systems
0.212015
Radiometric Compensation for Cooperative Distributed Multi-Projection System Through 2-DOF Distributed Control · IEEE Trans. Vis. Comput. Graph. 2015
Computational photography and imaging › projector-camera systems
radiometric compensation
0.212015
Radiometric Compensation for Cooperative Distributed Multi-Projection System Through 2-DOF Distributed Control · IEEE Trans. Vis. Comput. Graph. 2015
Distributed systems
distributed optimization
0.112015
Radiometric Compensation for Cooperative Distributed Multi-Projection System Through 2-DOF Distributed Control · IEEE Trans. Vis. Comput. Graph. 2015

Methods — techniques the papers use, named apart from their topics

distributed optimization · 0.42-DOF control · 0.4feedforward control · 0.2feed-forward control · 0.2
YearPublicationVenuePosition
2017 Distributed Optimization Framework for Shadow Removal in Multi-Projection Systems
abstract
Abstract This paper proposes a novel shadow removal technique for cooperative projection system based on spatiotemporal prediction. In our previous work, we proposed a distributed feedback algorithm, which is implementable in cooperative projection environments subject to data transfer constraints between components. A weakness of this scheme is that the compensation is conducted in each pixel independently. As a result, spatiotemporal information of the environmental change cannot be utilized even if it is available. In view of this, we specifically investigate the situation where some of the projectors are occluded by a moving object whose one‐frame‐ahead behaviour is predictable. In order to remove the resulting shadow, we propose a novel error propagating scheme that is still implementable in a distributed manner and enables us to incorporate the prediction information of the obstacle. It is demonstrated theoretically and experimentally that the proposed method significantly improves the shadow removal performance in comparison to the previous work.
Jun Tsukamoto, Daisuke Iwai, Kenji Kashima
Comput. Graph. Forum1
2015 Radiometric Compensation for Cooperative Distributed Multi-Projection System Through 2-DOF Distributed Control
abstract
This paper proposes a novel radiometric compensation technique for cooperative projection system based-on distributed optimization. To achieve high scalability and robustness, we assume cooperative projection environments such that 1. each projector does not have information about other projectors as well as target images, 2. the camera does not have information about the projectors either, while having the target images, and 3. only a broadcast communication from the camera to the projectors is allowed to suppress the data transfer bandwidth. To this end, we first investigate a distributed optimization based feedback mechanism that is suitable for the required decentralized information processing environment. Next, we show that this mechanism works well for still image projection, however not necessary for moving images due to the lack of dynamic responsiveness. To overcome this issue, we propose to implement an additional feedforward mechanism. Such a 2 Degree Of Freedom (2-DOF) control structure is well-known in control engineering community as a typical method to enhance not only disturbance rejection but also reference tracking capability, simultaneously. We theoretically guarantee and experimentally demonstrate that this 2-DOF structure yields the moving image projection accuracy that is overwhelming the best achievable performance only by the distributed optimization mechanisms.
Jun Tsukamoto, Daisuke Iwai, Kenji Kashima
IEEE Trans. Vis. Comput. Graph.1
2014 Design and evaluation of fine-grained power-gating for embedded microprocessors
abstract
Power-performance efficiency is still remaining a primary concern for microprocessor designers. One of the sources of power inefficiency for recent LSI chips is increasing leakage power consumption. Power-gating is a well known technique to reduce leakage power consumption by switching off the power supply to idle logic blocks. Recently, fine-grained power-gating is emerged as a technique to minimize leakage current during the active processor cycles by switching on and off a logic blocks in much finer temporal/spatial granularity. Though fine-grained power-gating is useful, a comprehensive evaluation and analysis has not been conducted on a real LSI chips. In this paper, we evaluate fine-grained run-time power-gating for microprocessors' functional units using a real embedded microprocessor. We also introduce an architecture and compiler co-operative power-gating scheme which mitigates negative power reduction caused by the energy overhead associated with finegrained power-gating. The experimental results with a fabricated core shows that a hardware-based scheme saves power consumption of functional units by 44% and hardware compiler co-operative scheme further improves power efficiency by 5.9% when core temperature is 25 ˚C.
Masaaki Kondo, Hiroaki Kobayashi, Ryuichi Sakamoto, Motoki Wada, Jun Tsukamoto, Mitaro Namiki, Hideharu Amano, Kensaku Matsunaga, Masaru Kudo, Kimiyoshi Usami, Toshiya Komoda, Hiroshi Nakamura
DATE5
2007 Design and Evaluation of Intervehicle Dissemination Protocol for Propagation of Preceding Traffic Information
abstract
In this paper, we propose an intervehicle information dissemination protocol called received message-dependent protocol (RMDP) that propagates the preceding traffic information to the following vehicles and discuss its performance. The proposed protocol autonomously changes the dissemination interval, depending on the number of reception messages and detected reception errors, in order to avoid message collision among vehicles. We have constructed a realistic simulation environment of intervehicle communication by combining a traffic-flow simulator and an ad hoc network simulator. Our simulation results show that, by using RMDP, a lot of vehicles can acquire their preceding traffic information within short periods at both the conditions with light and heavy traffic. In addition, we have also shown that selection policy of disseminated data affects preceding-traffic-information acquisition time. Each vehicle holds other vehicles' traces for some period. Depending on the number of preserved other vehicles' traces and their preserved periods, the propagation ratio of the preceding traffic information varies. Some simulation results are explained.
Masashi Saito, Jun Tsukamoto, Takaaki Umedu, Teruo Higashino
IEEE Trans. Intell. Transp. Syst.2
2005 Evaluation of Inter-Vehicle Ad Hoc Communication Protocol
abstract
In this paper, we propose an inter-vehicle ad-hoc communication protocol called RMDP (received message dependent protocol) which disseminates and propagates the preceding traffic information to the following vehicles, and discuss its performance. Our proposed protocol dynamically changes the dissemination interval depending on the number of reception messages for avoiding message collision in heavy traffic jam conditions. We design the parameters of the protocol based on the simulation results. Our simulation results show that by using RMDP, a lot of vehicles can acquire the preceding traffic information within very short periods. In addition, we have also shown that selection of disseminate data affects preceding traffic information acquiring time. Each vehicle holds other vehicles' tracks for some period. Depending on the number of preserved other vehicles' tracks and their preserved period, propagation ratio of the preceding traffic information varies. Some simulation results are explained.
Masashi Saito, Jun Tsukamoto, Takaaki Umedu, Teruo Higashino
AINA2