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.

Akitoshi Yoshida

dblp:70/2779 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 1997
0000-0001-8923-525XORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 2Computer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 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 coding · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 100%
Theoretical computer science
1 paper
Computational complexity · 77% Computational geometry · 23%

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

TopicWeightPapersLastEvidence papers
Image and video coding
transform coding
0.011994
Optical computing techniques for image/video compression · Proc. IEEE 1994
Image and video coding › quantization
vector quantization
0.011994
Optical computing techniques for image/video compression · Proc. IEEE 1994
Emerging computing paradigms
optical computing
0.011994
Optical computing techniques for image/video compression · Proc. IEEE 1994
Image and video coding › video compression
interframe coding
0.011994
Optical computing techniques for image/video compression · Proc. IEEE 1994

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

photorefractive holography · 0.0multiple exposure holograms · 0.0computability analysis · 0.0
YearPublicationVenuePosition
1997 MOWS: Distributed Web and Cache Server in Java
Akitoshi Yoshida
Comput. Networks1
1994 Computability and Complexity of Ray Tracing
John H. Reif, J. D. Tygar, Akitoshi Yoshida
Discret. Comput. Geom.3
1994 Optical computing techniques for image/video compression
abstract
The advantage of optics is its capability of providing highly parallel operations in a three-dimensional space. In this paper, we propose optical architectures to execute various image compression techniques. We optically implement the following compression techniques: transform coding, vector quantization, video coding. We show many generally used transform coding methods, for example, the cosine transform, can be implemented by a simple optical system. The transform coding can be carried out in constant time. Most of this paper is concerned with an innovative optical system for vector quantization using holographic associative matching. Limitations of conventional vector quantization schemes are caused by a large number of sequential searches through a large vector space. Holographic associative matching provided by multiple exposure holograms can offer advantageous techniques for vector-quantization-based compression schemes. Photorefractive crystals, which provide high-density recording in real time, are used as our holographic media. The reconstruction alphabet can be dynamically constructed through training or stored in the photorefractive crystal in advance. Encoding a new vector can be carried out by holographic associative matching in constant time. An extension to interframe coding using optical block matching methods is also discussed.>
Akitoshi Yoshida, John H. Reif
Proc. IEEE1
1992 Optical Techniques for Image Compression
abstract
Optical computing has recently become a very active research field. The advantage of optics is its capability of providing highly parallel operations in a three dimensional space. The authors propose optical architectures to execute various image compression techniques. They optically implement the following compression techniques: transform coding; vector quantization; and interframe coding; They show many generally used transform coding methods, for example, the cosine transform, can be implemented by a simple optical system. The transform coding can be carried out in constant time. Most of this paper is concerned with a sophisticated optical system for vector quantization using holographic associative matching. Holographic associative matching provided by multiple exposure holograms can offer advantageous techniques for vector quantization based compression schemes. Photorefractive crystals, which provide high density recording in real time, are used as the holographic media. The reconstruction alphabet can be dynamically constructed through training or stored in the photorefractive crystal in advance. Encoding a new vector can be carried out by holographic associative matching in constant time. An extension to interframe coding is also discussed.>
John H. Reif, Akitoshi Yoshida
Data Compression Conference2
1990 The Computability and Complexity of Optical Beam Tracing
abstract
The ray-tracing problem is considered for optical systems consisting of a set of refractive or reflective surfaces. It is assumed that the position and the tangent of the incident angle of the initial light ray are rational. The computability and complexity of the ray-tracing problems are investigated for various optical models. The results show that, depending on the optical model, ray tracing is sometimes undecidable, sometimes PSPACE-hard, and sometimes in PSPACE.>
John H. Reif, J. D. Tygar, Akitoshi Yoshida
FOCS3