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

Akira Shiozaki

dblp:19/4455 · DBLP profile ↗
← Back
11ranked-venue papers
9as first author
0since 2021 · last 2010
0000-0001-6705-6955ORCID · corroborated

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

Theory of computation · 5 · 3 first-authorComputer networks · 3 · 3 first-authorSecurity and privacy · 2Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorSystems, architecture and hardware · 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.

Theoretical computer science
7 papers
Coding theory · 100%
Computer networks
3 papers
Vehicular, aerial and satellite networks · 39% Internet architecture and protocols · 32% Physical-layer communications · 29%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › forward error correction
adaptive forward error correction
0.021996
Adaptive type-II hybrid broadcast ARQ system · IEEE Trans. Commun. 1996
A hybrid ARQ scheme with adaptive forward error correction for satellite communications · IEEE Trans. Commun. 1991
Coding theory › error-correcting codes
hybrid ARQ
0.021996
Adaptive type-II hybrid broadcast ARQ system · IEEE Trans. Commun. 1996
A hybrid ARQ scheme with adaptive forward error correction for satellite communications · IEEE Trans. Commun. 1991
Coding theory › error-correcting codes
reed-solomon codes
0.021991
A hybrid ARQ scheme with adaptive forward error correction for satellite communications · IEEE Trans. Commun. 1991
Decoding of redundant residue polynomial codes using Euclid's algorithm · IEEE Trans. Inf. Theory 1988
Coding theory
error-correcting codes
0.031988
Decoding of redundant residue polynomial codes using Euclid's algorithm · IEEE Trans. Inf. Theory 1988
Construction for binary asymmetric error-correcting codes · IEEE Trans. Inf. Theory 1982
Single Asymmetric Error-Correcting Cyclic AN Codes · IEEE Trans. Computers 1982
Coding theory › error-correcting codes
convolutional codes
0.011989
Unequal error protection of PCM signals by self-orthogonal convolutional codes · IEEE Trans. Commun. 1989
Coding theory › error-correcting codes › code construction
self-orthogonal convolutional codes
0.011989
Unequal error protection of PCM signals by self-orthogonal convolutional codes · IEEE Trans. Commun. 1989
Coding theory › error-correcting codes
unequal error protection
0.011989
Unequal error protection of PCM signals by self-orthogonal convolutional codes · IEEE Trans. Commun. 1989
Coding theory › error-correcting codes
decoding
0.011988
Decoding of redundant residue polynomial codes using Euclid's algorithm · IEEE Trans. Inf. Theory 1988
Coding theory › error-correcting codes › cyclic codes
BCH codes
0.011996
Adaptive type-II hybrid broadcast ARQ system · IEEE Trans. Commun. 1996
Coding theory › error-correcting codes
asymmetric error-correcting codes
0.021982
Construction for binary asymmetric error-correcting codes · IEEE Trans. Inf. Theory 1982
Single Asymmetric Error-Correcting Cyclic AN Codes · IEEE Trans. Computers 1982
Vehicular, aerial and satellite networks
satellite communication
0.011991
A hybrid ARQ scheme with adaptive forward error correction for satellite communications · IEEE Trans. Commun. 1991
Coding theory › error-correcting codes › arithmetic codes
cyclic AN-codes
0.011982
Single Asymmetric Error-Correcting Cyclic AN Codes · IEEE Trans. Computers 1982
Physical-layer communications › modulation › pulse modulation
PCM transmission
0.011989
Unequal error protection of PCM signals by self-orthogonal convolutional codes · IEEE Trans. Commun. 1989
Coding theory › error-correcting codes
concatenated codes
0.011988
Decoding of redundant residue polynomial codes using Euclid's algorithm · IEEE Trans. Inf. Theory 1988

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

throughput analysis · 0.0incremental redundancy · 0.0frame efficiency evaluation · 0.0orthogonal check sums · 0.0error protection analysis · 0.0euclid's algorithm · 0.0puncturing · 0.0expurgating · 0.0
YearPublicationVenuePosition
2010 Digital watermarking method for tamper detection and recovery of JPEG images
abstract
Digital watermarking is a technique that embeds additional data into digital contents so that the distortion by embedding them is imperceptible, where the additional data are called watermark. One of the applications of digital watermarking is tamper detection and recovery. The digital watermarking methods for tamper detection and recovery can detect the tampered region in a tampered image and recover it. In this application, the digital watermarking methods solve the problem that digital contents can be tampered so that the falsification is not detected. In this manuscript, we propose a new method for tamper detection and recovery of JPEG images by using a RS code. The proposed method embeds the check symbols corresponding to an information-reduced original image into the LSBs of the quantized DCT coefficients in a JPEG image directly. Therefore the method completely extracts the embedded data from watermarked JPEG images. We investigated the performance of the proposed method in view of the image quality and the ability of tamper detection and recovery. The experiments of the image quality confirmed the imperceptibility of watermarked images and images used for recovery. The experiments of the ability of tamper detection and recovery confirmed the maximum size of recoverable tampered region and the difficulty of undetectable falsification.
Motoi Iwata, Tomoki Hori, Akira Shiozaki, Akio Ogihara
ISITA3
2010 An audio watermarking method by using automatic music transcription information
abstract
The objective of this work is to embed watermark information into digital audio data as the deterioration of sound quality is not perceivable to human ears. Hence, we consider that watermark information is embedded in the consonance to melody line or bass line. Generally, unison, octave, perfect fifth and perfect fourth are called consonance and human ears can hardly feel annoyed for consonance. Hence, we focus on perfect fifth and perfect fourth in the consonance. For decision of embedding positions, we need to estimate tone pitches, and we use spectrogram analysis as a technique of automatic music transcription. We embed watermark information with perfect fifth or perfect fourth of consonance from the pitch which is estimated by spectrogram analysis, and we aim at good sound quality of watermarked audio signal without sense of discomfort. Therefore, we propose an audio watermarking method by using automatic music transcription information.
Harumi Murata, Akio Ogihara, Motoi Iwata, Akira Shiozaki
ISITA4
1996 Adaptive type-II hybrid broadcast ARQ system
abstract
In this letter, a type-II hybrid broadcast automatic-repeat-request (ARQ) scheme with adaptive forward error correction (AFEC) using BCH codes is proposed and analyzed. The basic idea in the proposed scheme is to increase the error correcting capability of BCH codes according to each channel state using incremental redundancy. The numerical results for the analysis and the simulation show that the proposed scheme maintains high throughput even if channels become noisy and the number of receivers is large.
Akira Shiozaki
IEEE Trans. Commun.1
1991 A hybrid ARQ scheme with adaptive forward error correction for satellite communications
abstract
A hybrid automatic-repeat-request system combined with adaptive forward error correction (ARQ/AFEC) which adaptively alters the error-correcting capability according to channel state using a nonsystematic Reed-Solomon code is presented. lt is shown that the system can alter the error-correcting capability by varying the number of information symbols fed to the decoder only, and not change the hardware of the encoder. Performance evaluations indicate that the ARQ/AFEC system has much higher frame efficiency than ARQ without AFEC for low-bit error rate and has high frame efficiency in a wide range of bit error rates.>
Akira Shiozaki, Kiyoshi Okuno, Katsufumi Suzuki, Tetsuro Segawa
IEEE Trans. Commun.1
1989 Unequal error protection of PCM signals by self-orthogonal convolutional codes
abstract
In the PCM (pulse-code modulation) transmission system discussed, the influence of bit errors on the demodulated signal-to-noise ratio differs in the erroneous bit position. The demodulated signal-to-noise ratio can be improved when the PCM signals are protected so that the decoded bit error rate in more important bit position may be lower. Assigning a different number of orthogonal check sums to each information bit of self-orthogonal convolutional code provides a different error protection capability to each information bit. The author presents an unequal error protection self-orthogonal convolutional code with different error protection capability for each information bit, and discusses the condition that makes the demodulated signal-to-noise ratio of PCM signals maximum.>
Akira Shiozaki
IEEE Trans. Commun.1
1988 Decoding of redundant residue polynomial codes using Euclid's algorithm
abstract
A decoding method is proposed for the redundant residue polynomial codes, a class that includes Reed-Solomon codes. The method is based on properties of Euclid's algorithm. The advantage of the method is that the computation of both the error-locator polynomial and the error-evaluator polynomial needed in conventional decoding methods can be avoided. The method is suitable for decoding concatenated codes whose outer codes are redundant residue polynomial codes, since they are easily decoded by ignoring erasures detected in the inner codes.>
Akira Shiozaki
IEEE Trans. Inf. Theory1
1986 Edge extraction using entropy operator
Akira Shiozaki
Comput. Vis. Graph. Image Process.1
1983 Image enhancement in a dithered picture
Akira Shiozaki
Comput. Vis. Graph. Image Process.1
1982 Single Asymmetric Error-Correcting Cyclic AN Codes
abstract
A class of single asymmetric error-correcting cyclic AN codes is proposed. These codes are designed for use on asymmetric channels, such as LSI memory protection. It is shown that they are equivalent to the Constantin–Rao codes generted by a prime field in which 2 is a primitive element. The advantage of these AN codes is that error correction can be easily made using arithmetic operations.
Akira Shiozaki
IEEE Trans. Computers1
1982 Construction for binary asymmetric error-correcting codes
abstract
A construction method of asymmetric error-correcting codes is proposed. In this method, at-fold asymmetric error-correcting code of lengthn-1is constructed by expurgating and puncturing anyt-fold symmetric error-correcting code of lengthn. These codes are designed for use on binary asymmetric channels, such as large-scale integration (LSI) memory protection, on which transition is one-way.
Akira Shiozaki
IEEE Trans. Inf. Theory1
1981 Proposal of a New Coding Pattern in Orchard Scheme
Akira Shiozaki
Inf. Control.1