All issues
Predecessor
21.78
Displaying 1-17 of 17 articles from this issue
- |<
- <
- 1
- >
- >|
-
Article type: Cover
Pages Cover1-
Published: December 12, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSDownload PDF (14K) -
Article type: Index
Pages Toc1-
Published: December 12, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSDownload PDF (74K) -
Arei Kobayashi, Hiroyuki Honda, Miki Haseyama, Hideo KitajimaArticle type: Article
Pages 1-6
Published: December 12, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSThis paper proposes the use of a genetic algorithm for factal block image coding. The conventional method effects of quantization error increase when the image is reconstructed. A genetic algorithm is constructed to cope with the problem. The proposed method quantizes fractal parameters their statistical properties. The proposed method uses a various block size. Results of exeriments are included to show the effectiveness of the proposed method.View full abstractDownload PDF (888K) -
Makoto Hoshino, Miki Haseyama, Hideo KitajimaArticle type: Article
Pages 7-12
Published: December 12, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSThis paper proposes lossless image coding using Hadamard transform residue patterns. Hadamard transform reidue patterns for N×N block of pixels are computed by dividing its coefficients by N×N. The proposed method improves coding efficiency by using the fact that the number of residue patterns is limited. The paper also proposes quasilossless coding by further limiting residue patterns.View full abstractDownload PDF (553K) -
Hiroaki Maki, Miki Haseyama, Hideo KitajimaArticle type: Article
Pages 13-18
Published: December 12, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSThis paper proposes identification of scene change types for image sequences. The proposed method evaluates frame similarities through motion estimation. It can detect gradual shot changes such as dissolve and wipe, where other methods often fail. The proposed method identifies shot change types based on similarities. The effectiveness of the proposed method is verified by experiments.View full abstractDownload PDF (512K) -
Takahiro Usuda, Miki Haseyama, Hideo KitajimaArticle type: Article
Pages 19-24
Published: December 12, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSThis paper describes a study of improvement for cut detection of video signals. The existent methods often fail to detect cut positions at fading in, out, or wiping scenes. The proposed algorithm improves them by using a fuzzy c-means clustering method. The clustered targets are PARCOR coefficients computed from audio signals corresponding to the video ones. The obtained cluster values are varied regardless of the failures if the audio signals are alternated. Therefore, it is expected that the alteration of the cluster values can assist the cut detection effectively.View full abstractDownload PDF (518K) -
Riichiroh Koike, Miki Haseyama, Hideo KitajimaArticle type: Article
Pages 25-30
Published: December 12, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSThis paper proposes motion-compensated prediction using a new motion model. The conventional block matching method does not consider motion in a 3-D space. The proposed method expresses motions using a sphere moving in a 3-D space. Results of some experiments show to verify the effect of proposed method.View full abstractDownload PDF (683K) -
Masateru Kumagai, Miki Haseyama, Hideo KitajimaArticle type: Article
Pages 31-36
Published: December 12, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSThis paper proposes a restoration method of images of which areas are contaminated by different variances of noises. When an image is restored by the Kalman filter algorithm, an image model and parameters (i.e. a noise variance, and a variance of the original image) are used. Therefore, when some areas of the image are contaminated by noises with different variances, the Kalmu filter algorithm cannot restore accurately. The proposed method can estimate the noise variances in the areas of the image by using region segmentation results, and restore it more accurately than the previous Kalman filter algorithm does.View full abstractDownload PDF (738K) -
Shin'ichi Shiraishi, Miki Haseyama, Hideo KitajimaArticle type: Article
Pages 37-42
Published: December 12, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSThis paper presents a method for a transformation of a CORDIC ARMA lattice filter into a signal synthesis filter. By using CORDIC processors, the proposed signal synthesis filter can be efficiently implemented without multipliers. Since the obtained signal synthesis filter consists of dedicated CORDIC processors, this filter keeps the advantage of the CORDIC ARMA lattice filter, that is a simp1e structure.View full abstractDownload PDF (795K) -
Mikako Ichioka, Hiroyuki Honda, Miki Haseyama, Hideo KitajimaArticle type: Article
Pages 43-47
Published: December 12, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSOne restoration filter for images contaminated with pulse noise is a median filter. This filter often smoothes complex structure in the image. When the density of pulse noise is low, IFS image restoration methods which we previously proposed can keep complexity of structure in the image. However when the density of pulse noise is high, the restorated image is affected the noise. We propose in this paper an improved IFS image restoration method to changeView full abstractDownload PDF (673K) -
Kazunori KOTANI, Yoshiko FURUSHO, Yuukou HORITA, Makoto MIYAHARAArticle type: Article
Pages 49-53
Published: December 12, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSThis paper shows the picture quality model for evaluation of JPEG coded color picture based on spatial feature of CLE Lab color difference. The distortion models are consist of fundermental quality factors that are obtaind by Multivariate Analysis of coded errors and distortions. This model evaluates the picture quality with high accuracy and estimates Mean Opinion Score well (85% accuracy).View full abstractDownload PDF (629K) -
Yasuyuki SAITO, Kazunori KOTANIArticle type: Article
Pages 55-60
Published: December 12, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSThis paper describes the method of extraction and removal of eyeglasses in facial images. If facial images contain eyeglasses, mustache and etc., expression analysis is difficult because eyes are coverd with eyeglasses. But, there are a lot of people who use eyeglasses in Japan. Therefore, it is necessary to research into the method of expression analysis for eyeglassed facial images. We estimate roughly the position and shape of eyeglasses using the contour detectd and binarized low resolution image, then extract eyeglasses in detail using parametric eyeglaases model. And replace gray level of eyeglasses to around skin gray level, finally perform region segmentation. The Results can avoid effect of eyeglasses frame.View full abstractDownload PDF (831K) -
Takeo Wakisaka, Takeshi Ogihara, Yukio KanedaArticle type: Article
Pages 61-66
Published: December 12, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSThe style of cryptography, in which secret data is embedded into an image not to be noticed outside is called Video Steganography. Some video steganography methods use orthogonal transform to embed data. This technique has two problems ; round error of orthogonal transform componets and pixel overflow. Because of these problems, embedded data could not be decoded correctly. In this paper, we propose new technique to embed a lot of data into an image with less distortion, where we use discrete cosine transform (DCT) as orthogonal transform. Considering local characteristics of the image, the technique can adjust the amount of data embedded. Finally, we show the effectiveness of our technique by subjective evaluation.View full abstractDownload PDF (774K) -
kai Yang, Hiroyuki Kudo, Tsuneo SaitouArticle type: Article
Pages 67-72
Published: December 12, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSWavelet transform has some localization properties both in space and frequency, which allows to compact the signal energy both in space and frequency. This paper addresses the problems of how to exploit the spatial and frequency compaction property of the wavelet transform, and how to design a wavelet transform coding system optimally in the rate and distortion sense. We formulate the optimization problem and propose a novel approach to solve it. A new coding algorithm is developed for the new scheme. We suggest that the spatial compaction exploitation leads to an efficient coding in the sense that we can exploit the frequency compaction property based on the result of the spatial compaction exploitation. Experimental results demonstrate that the performance of the coding system is competitive with those of other current coding systems.View full abstractDownload PDF (820K) -
Mei KODAMA, Hideyoshi TOMINAGAArticle type: Article
Pages 73-78
Published: December 12, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSWe had already proposed "Multimedia Proceedings Package : MPP" as structured data in multimedia services, such as ATM Mini-bar system and "Multimedia Proceesings : MP". In this paper, we proposed "Multimedia Scalability" as the structuring mothods with users' functionality in multimedia information base on the scalability concept. Next, from the requirements as MPP structured data, "Scalability Profile" was indicated. The functions in MP by these profile are explained. The data transformation methods using scalability of moving pictures are taken up as the methods to edit and process MPP data by profile, and we showed that these were more effective than the transcoding method.View full abstractDownload PDF (792K) -
Satoshi NISHIMURA, Mei KODAMA, Hideyoshi TOMINAGAArticle type: Article
Pages 79-84
Published: December 12, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSIn this paper, we propose the hierarchical video coding architecture considering information managements. It is possible to retrieve information from image database by this method. In this case, as temporal feature information especially, we indicate the procedure and the realization in this scheme using signal histograms among continuously temporal input sources. And as an application of this method, we take up the searching schemes by still image. In searching scheme base on feature information in this structure, it is shown that the serarching process is less than non-hierarchical structure.View full abstractDownload PDF (742K) -
Article type: Appendix
Pages App1-
Published: December 12, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSDownload PDF (76K)
- |<
- <
- 1
- >
- >|