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

Satoshi Oshima

dblp:162/8163 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2016
—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-author

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
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing › color image processing
color space transformation
0.212016
Modeling, Measuring, and Compensating Color Weak Vision · IEEE Trans. Image Process. 2016
Image and video processing › perceptual modeling › visual perception modeling
color vision
0.212016
Modeling, Measuring, and Compensating Color Weak Vision · IEEE Trans. Image Process. 2016

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

riemann geometry · 0.2color-matching experiment · 0.2
YearPublicationVenuePosition
2016 Modeling, Measuring, and Compensating Color Weak Vision
abstract
We use methods from Riemann geometry to investigate transformations between the color spaces of color-normal and color-weak observers. The two main applications are the simulation of the perception of a color weak observer for a color-normal observer, and the compensation of color images in a way that a color-weak observer has approximately the same perception as a color-normal observer. The metrics in the color spaces of interest are characterized with the help of ellipsoids defined by the just-noticeable-differences between the colors which are measured with the help of color-matching experiments. The constructed mappings are the isometries of Riemann spaces that preserve the perceived color differences for both observers. Among the two approaches to build such an isometry, we introduce normal coordinates in Riemann spaces as a tool to construct a global color-weak compensation map. Compared with the previously used methods, this method is free from approximation errors due to local linearizations, and it avoids the problem of shifting locations of the origin of the local coordinate system. We analyze the variations of the Riemann metrics for different observers obtained from new color-matching experiments and describe three variations of the basic method. The performance of the methods is evaluated with the help of semantic differential tests.
Satoshi Oshima, Rika Mochizuki, Reiner Lenz, Jinhui Chao
IEEE Trans. Image Process.1
2012 Color-Weakness Compensation Using Riemann Normal Coordinates
abstract
We introduce normal coordinates in Riemann spaces as a tool to construct color-weak compensation methods. We use them to compute color stimuli for a color weak observers that result in the same color perception as the original image presented to a color normal observer in the sense that perceived color-differences are identical for both. The compensation is obtained through a color-difference-preserving map, i.e. an isometry between the 3D color spaces of a color-normal and any given color-weak observer. This approach uses discrimination threshold data and is free from approximation errors due to local linearization. The performance is evaluated with the help of semantic differential (SD) tests.
Satoshi Oshima, Rika Mochizuki, Reiner Lenz, Jinhui Chao
ISM1