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

Toyomichi Yamada

dblp:83/5461 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1990
—ORCID · none

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

Artificial intelligence and machine learning · 1Computer networks · 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%

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

TopicWeightPapersLastEvidence papers
Image and video coding › document image compression
facsimile coding
0.011979
Edge-Difference Coding-A New, Efficient Redundancy Reduction Technique for Facsimile Signals · IEEE Trans. Commun. 1979
Image and video coding › image compression
two-dimensional coding
0.011979
Edge-Difference Coding-A New, Efficient Redundancy Reduction Technique for Facsimile Signals · IEEE Trans. Commun. 1979
Image and video coding › lossless compression
run-length coding
0.011979
Edge-Difference Coding-A New, Efficient Redundancy Reduction Technique for Facsimile Signals · IEEE Trans. Commun. 1979

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

entropy coding · 0.0computer simulation · 0.0
YearPublicationVenuePosition
1990 MARIS: map recognition input system
Toyomichi Yamada
Pattern Recognit.2
1979 Edge-Difference Coding-A New, Efficient Redundancy Reduction Technique for Facsimile Signals
abstract
This paper describes an efficient redundancy reduction coding scheme for bi-level facsimile signals and field test results of a Group 3 facsimile machine applying this technique. The bi-level signal obtained by scanning documents is characterized by white-to-black or black-to-white edges. These edges cross successive scan lines smoothly in most cases. This scheme makes use of two-dimensional correlation by coding the difference in positions where an edge crosses successive scan lines. The performance of this scheme has been evaluated by computer simualtions for eight CCITT SG.XIV test documents scanned at an 8 lines/mm rate. This scheme reduces the entropy by 24 to 60 percent over the conventional run-length coding scheme and 2 to 10 percent over one of the currently proposed two-dimensional coding schemes, respectively. In a newly fabricated prototype model of a Group 3 machine using this technique, a run-length coded line is inserted everyKlines to prevent error propagation. In accordance with subjective test results,Kis set equal to two in that machine for the case of 3.85 lines/mm resolution and equal to four for the case of 7.7 lines/mm resolution. For these two levels of resolution, the average transmission times for the eight CCITT test documents are roughly equal to 49 s and 70 s, respectively, at a transmission rate of 4800 bits/s.
Toyomichi Yamada
IEEE Trans. Commun.1