ITE Technical Report
Online ISSN : 2424-1970
Print ISSN : 1342-6893
ISSN-L : 1342-6893
Search
Advanced search
OR
Browse
Search
24.79
Displaying 1-25 of 25 articles from this issue
Show all abstracts
    • |<
    • <
    • 1
    • >
    • >|
  • [title in Japanese]
    Article type: Cover
    Pages Cover1-
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_Cover1
    CONFERENCE PROCEEDINGS FREE ACCESS
    Download PDF (12K)
  • [title in Japanese]
    Article type: Index
    Pages Toc1-
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_Toc1
    CONFERENCE PROCEEDINGS FREE ACCESS
    Download PDF (85K)
  • Camera working parameter Extraction Methods using Motion vector information in MPEG2 video
    Kentaro DOBASHI, Akihisa KODATE, Ryuji SAITO, Hideyoshi TOMINAGA
    Article type: Article
    Session ID: BCS2000-77
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_1
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    Recently digital video cameras are getting popular, and video editing has become one of attractive applications even on home-use PCs with IEEE 1394. However video contents editing is still not very easy and some sorts of intelligent supporting system are requested, which realize semi-automatic editing or show contents information to editors. Therefore we focus on camera works that contain the intention of the users. As the first step, we have investigated a camera work scene(zooming and panning)extracting system including camera shakes. Additionally, scene distinction between camera work and camera shake has become possible, by considering motion vector charactersitics.
    View full abstract
    Download PDF (569K)
  • Efficient Video Mosaic Method Using Virtual Camera's 3D Point Tracking
    Daisuke SHIBUICHI, Shunichi TAKEUCHI, Hideyoshi TOMINAGA
    Article type: Article
    Session ID: BCS2000-78
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_7
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    Conventionally, the video mosaicing works according to the number of image frames in the video sequence. However, the conventional video mosaicing causes two problems. Firstly, the merged image cannot be of high quality because commulative error often occurs on processing numerous image frames. Secondly, the image mosaicing cannot work efficiently when there are many image frames that capture the same region of the object. To solve these problems, we propose the efficient video mosaicing method using virtual camera's 3D point tracking. The virtual camera's 3D points are used for classifying the image frames in the video sequence and selecting the best image frame in each cluster for reducing comulative error and obtaining the high quality merged image. In this paper, the concept, algorithm and experiments are described.
    View full abstract
    Download PDF (952K)
  • An objective measurement scheme for perceived picture quality degradation caused by MPEG encoding without reference pictures
    Osamu Sugimoto, Ryoichi Kawada, Masahiro Wada, Shuichi Matsumoto
    Article type: Article
    Session ID: BCS2000-79
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_13
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    The rapid progress in digital transmission technology has spurred demand for developing a technology that supports monitoring of video transmissions. Automating the picture quality assessment process is in particular demand because it currently depends on subjective assessments by human operators and places a heavy burden on them. The authors therefore propose an objective picture quality measurement method that works without reference pictures. In this proposed method, invisible markers are embedded into original pictures by use of the spread spectrum data hiding method. Since the markers are widely spread over the frequency domain, the degradation caused by MPEG compression can be estimated by detecting the extent of marker degradation. Our method is usable regardless of the kind of picture, bitrate, and number of stages of tandem codec connections. The degradation in picture quality caused by the embedded markers is quite small and not perceivable by the human eye. The proposed method is therefore applicable to a wide range of visual transmission services.
    View full abstract
    Download PDF (668K)
  • On the Mutual Adaptation of Multimedia Data Based on the Human Sensitivity
    Teruhisa HOCHIN, Tatsuo TSUJI
    Article type: Article
    Session ID: BCS2000-80
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_19
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    This paper presents a study on the mutual adaptation of multimedia data by using the human sensitivity factors. The factors of evaluation, activity, potency, brightness, and hardness are obtained for pictures. Those of evaluation, potency, brightness, and hardness are obtained for sounds and music clips. Those of activity, potency, brightness, hardness, and naturalness are obtained for video clips. As these factors resemble one another, different kinds of media data can be related by using these factors.
    View full abstract
    Download PDF (621K)
  • Improvement and Evaluation of the Compression Method Making Use of Block Similarity in JPEG Algorithm
    Toshiyasu SUGIO, Hirofumi FUJIMOTO, Noriyuki FUJIMOTO, Kenichi HAGIHAR ...
    Article type: Article
    Session ID: BCS2000-81
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_25
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    JPEG(Joint Photographic Coding Expert Group)is one of the still-picture image compression techniques. The JPEG algorithm divides a given image into a large number of blocks and compresses these blocks one by one in the same manner. At this time, some blocks may have the same pixel values. The first compressed block of these blocks is called a unique block, and the other blocks are called its same blocks. BCT(Block Comparator Technique)is a sophisticated method of JPEG algorithm that makes good use of block similarity. BCT records the relations among unique blocks and their same blocks into a BCT List, and stores it into the compressed data file, and then compresses unique blocks only. There is the possibility of being capable of reducing compressed data file size and decompressing time by replacing the compressed data of each same block as that of its unique block. However, BCT can not give an expected compression rate because of inefficient data structure of a BCT List. In this report, We improve BCT to solve these problems as follows. First, by huffman encoding for a BCT List, its size is reduced. Second, having payed attension that the number of same blocks increases after the quantization of JPEG compression process, we move the position of the BCT List creation step after quantization. Last, we extend BCT to be able to compress full color images. The result of our experiment with 117 pictures shows that the compressed data file sizes and decompressing times can be made smaller than those of JPEG without decreasing quality of images.
    View full abstract
    Download PDF (757K)
  • A Delay Control Method in a Network with Multiple Delay QoS
    Kazuhiro KAWAHARAYAMA, Tokuhiro KITAMI
    Article type: Article
    Session ID: BCS2000-82
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_31
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    This paper presents the performance of cell delay reduction control using the EDD buffer switch in a network with multiple delay QoS. The EDD buffer controls cell transfer based on the difference between the prescribed delay requirement and elapsed time in the switch for each cell. The simulation results include average delay, delay variance, 99.9% delay, and critical load. The authors reveal that the proposed control method enables to increase critical loads where the specified delay QoSs are satisfied.
    View full abstract
    Download PDF (472K)
  • Performance Evaluation of Hybrid Type Capacity Control Scheme
    Tomofumi Izumi, Tokuhiro Kitami
    Article type: Article
    Session ID: BCS2000-83
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_37
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    This paper proposes a hybrid type capacity control mechanism that combines both VP-level and VC-level capacity control in a variable capacity ATM network. In the proposed scheme, the authors examine the evaluation measure to judge validity of capacity allocation for the hybrid type capacity control scheme. This paper also prsents an aggregated preformance evoluation including bandwidth efficiency, fairness and queue length. The simulation results show the effectiveness of the evaluation measure for fair share.
    View full abstract
    Download PDF (578K)
  • Cell Loss Performance for Input-Output Control Type Back Pressure Switch
    Kota Aizawa, Tokuhiro Kitami
    Article type: Article
    Session ID: BCS2000-84
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_43
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    This paper evaluates cell loss performance for input-output control type back pressure switch. The proposed switch has different thresholds for input-buffer and output-buffer, respectively, and controls cell transfer using the overall information of queue length in both side buffers. The simulation results shows that the proposed switch effectively decreases cell loss rate at higher traffic load.
    View full abstract
    Download PDF (448K)
  • Optical flow estimation by clustering of intersection group of constraint lines in a velocity space
    Shunsuke HAYASHI, Hiroki IMAMURA, Yukiko KENMOCHI, Kazunori KOTANI
    Article type: Article
    Session ID: BCS2000-85
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_49
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    The current optical flow estimation method produced a large estimation error caused by a plural of movement of the objects in the image. This paper shows a new method of optical flow estimation using clustering algorithm for scatterd intersection group of constraint lines in a velocity space. The clustering of intersectcion can separate and focused the regions of different movements, it can estimate well a optical flow especially for boundary of objects, complex movements and broad image conditions.
    View full abstract
    Download PDF (988K)
  • Test Images for Determining Coding Parameters of MPEG.
    Masashi YAMADA, Toshiaki FUJII, Tadahiko KIMOTO, Masayuki TANIMOTO
    Article type: Article
    Session ID: BCS2000-86
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_55
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    In MPEG encoding, there are many variable coding parameters designers can change freely. Many experiments are needed to determine optimal coding parameters for natural images. In this paper, we propose test images with which the coding parameters can be adjusted easily. We can adjust them by observing the degraded position of reconstructed test images. We made test images for adjusting an inter quantization matrix and search range of motion vector. The experiments show that the parameters adjested to test images can be applied to natural images.
    View full abstract
    Download PDF (892K)
  • An Analysis of Video Searching Methods from Temporal Characteristics
    Hidekazu TAKAHASHI, Mei KODAMA, Kazufumi KANEDA, Hideo YAMASHITA
    Article type: Article
    Session ID: BCS2000-87
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_61
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    Today, we often use the video data in user personal equipment in multimedia communication services. Therefore, we consider the matching method of using the temporal characteristics in video searching system. In this paper, we pay attention to the luminance variances and the correlation value of the luminance variances between current frame and next frame. In addition, we propose matching algorithm the grouping correlation value by threshold and matching time can be short. Finally, we consider the structure of group and matching results in query video which have scene changes and not have ones.
    View full abstract
    Download PDF (435K)
  • A Study on the Video Matching Methods using Spatial Characteristcis in Temporal Domain
    Mei KODAMA, Tomoji IKEDA, Hidekazu TAKAHASHI
    Article type: Article
    Session ID: BCS2000-88
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_67
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    We had indicated communication services using multimedia scalability packages(MSP), which can provide multimedia information accoding to functionality and availability for users. In this paper, we propose the MSP video search system as one of the MSP multimedia services. It is that users can retrieve searching results using exchanging MSP data through network. In this paper, searching video data, we indicate the effective searching features and methods of spatial and temporal extension. After we also consider the methods from the viewpoints of the process time and matching numbers by experimental results, they shows that video search is able to be realized efficiently by temporal extension method. Finally, we show the flexibility of our search system as video searching systems.
    View full abstract
    Download PDF (593K)
  • A Study on Telelecturing System based on MSP Communication System
    Mei KODAMA, Tomoji IKEDA, Hidekazu TAKAHASHI, Masashi MURASAKI
    Article type: Article
    Session ID: BCS2000-89
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_73
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    We had already proposed "Multimedia Scalability Package:MSP" as structure data in integrated multimedia services. In this paper, we proposed a Tele-lecturing System based on MSP communication system. We considered these system using proceedings data and video contents. In these system, to unpack MSP data realized the virtual tele-lecturing system between presenter's and users' terminals. And then, these system overview was shown. Finally, the system architecture, MSP data procedures and MSP data structure are explained in this system.
    View full abstract
    Download PDF (532K)
  • Multiple-Symbol Differential Detection Considering Autocorrelation over Rayleigh Fading Channel
    Yusuke OKANO, Shiro HANDA, Fumihito SASAMORI, Shinjiro OSHITA
    Article type: Article
    Session ID: BCS2000-90
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_79
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    In this paper, we apply Multiple-Symbol Differential Detection which uses the decision rule considering autocorrelation of received sequence in estimating the transmitted signals over Rayleigh Fading Channel. It is confirmed that as the number of symbols of observe sequence increases, SER performances show good approximation to that of the ideal coherent detection by computer simulation. Then, we apply M algorithm to reduce the number of tree path search and can increase the number of symbols of observe sequence. It is confirmed that with the M algorithm the calculation of the likelihood function becomes much simpler and as more the number of symbols of observe sequence increase, SER performances shows even closer to that of the ideal coherent detection.
    View full abstract
    Download PDF (594K)
  • A Dynamic Channel Assignment Method for TDMA/FDMA Packet Transimission Cellular Systems
    Ryo TOMOKIYO, Yoshihiko AKAIWA
    Article type: Article
    Session ID: BCS2000-91
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_85
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    In packet transmission TDMA/FDMA cellular system with a small number of carrier frequencies, assignment of carrier frequencies becomes important issue for efficient use of frequency resource. In microcellular systems, it is difficult to assign channel in advance because of irregularity of radio wave propagation. Therefore, system where channels are assigned in a distributed manner is desired. In this paper, we propose a method in which each base station dynamically assigns frequency-division channel as well as time-division channel in a distributed manner. The performance of the proposed method is evaluated by computer simulation. The proposed method shows efficient channel usage both in time-domain and frequency-domain.
    View full abstract
    Download PDF (525K)
  • An Adaptive Predistortion Method for Linear Power Amplifiers
    Yoshitaka SETO, Shinji MIZUTA, Yoshihiko AKAIWA
    Article type: Article
    Session ID: BCS2000-92
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_91
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    A basestation power amplifier requires high linearity and stable operation for common amplication of a multiplexed wideband signal. Nonlinearity compensation techniques with the feedforward or predistorter are useful for this purpose. This paper presents a predistortion amplifier with automatic control at RF band for application at a basestation. In this method, the predistorter distortes a RF input signal by referring to a look-up table(LUT)corresponding to the input power. Out-of-band radiation power are directly monitored at IF band to determine the LUT. A DSP with an iterative algorithm updates the content of the LUT to minimize the out-of-band radiation power. Computer simulation experiment is carried out. Out-of-band spectral density is suppressed below -80dB. This predistorter can cope with imperfect characteristics of the device used in the predistorter.
    View full abstract
    Download PDF (553K)
  • MAI Mitigation by Repetitional Cyclic-Shifted Sequences in Optical CDMA Systems
    Toshio Sonoda, Katsuhiro Kamakura, Tomoaki Ohtsuki, Iwao Sasase
    Article type: Article
    Session ID: BCS2000-93
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_97
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    In this paper optical code-division multiple-access(CDMA)systems with repetitional cyclic-shifted sequences(RCS)is proposed for mitigation of multiple access interferece(MAI). When the number of reptition is k, a user transmit k sequeces in each frame, and the k sequences are generated by arbitrary cyclic-shifting a code assigned to each user. At the receiver side the outputs from the correlators over k sequences are summed as the desired signal. RCS/CDMA system can mitigate MAI because the peak power of the desired signal in the RCS/CDMA is k times larger than that in the system without RCS, while the interference probability of each frame is almost same as that of the system without RCS for the variety of the numbers of cyclic-shift sequences among the users. We evaluate the bit error probability of on-off keying(OOK)-RCS/CDMA system and pulse-position modulation(PPM)-RCS/CDMA system with k = 2 by the theoretical analysis and compare with the conventional system. We show that the RCS can improve the bit error probability of the conventional system.
    View full abstract
    Download PDF (639K)
  • ITS and Spread Spectrum Communication Technology
    Kiyoshi MIZUI
    Article type: Article
    Session ID: BCS2000-94
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_103
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    Recently, ITS(Intelligent Transport Systems)are studied and developed. They aim safe driving supports, optimum traffic management, and efficient road management, etc. On the other hand, Spread Spectrum(SS)Communication Technologies are also done because SS system has many advantages whose examples are it is robust against interference and it can measure a distance. This report surveys applications of SS Technologies to ITS.
    View full abstract
    Download PDF (707K)
  • Outdoor Optical Wireless Link Using Turbo Codes
    Tomoaki Ohtsuki
    Article type: Article
    Session ID: BCS2000-95
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_109
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    We propose two turbo-coded atmospheric optical systems: a turbo-coded atmospheric optical subcarrier phase-shift keying(PSK)system and a turbo-coded atmospheric optical pulse position modulation(PPM)system. We obtain upper bounds on the bit-error rate(BER)for maximum-likelihood(ML)decoding of both turbo-coded systems on atmospheric optical channels where the effects of the scintillation exist by using the transfer function bounding techniques. We show that turbo-codes are effective for the atmospheric optical systems to improve the BER performance. We also show that the turbo-coded atmospheric optical subcarrier PSK system has better performance than the turbo-coded atmospheric optical PPM systems.
    View full abstract
    Download PDF (568K)
  • Object-based Coding based upon Block Pattern Information
    Kenji ONO, Ryuji HAMABE
    Article type: Article
    Session ID: BCS2000-96
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_115
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    This paper presents an object-based video coding, which combines object region merging technique using variable block patterns with VLMVQ(Variable-block Learning Motion Vector Quantization)for coding. In object region merging for segmentation, first, each variable block is detected whether it may be edge block or not. Next, each block is classified and labeled according to edge and block-size information. In VLMVQ, we prepare a codebook for each object. Since the codebooks learn the texture of variable blocks together with coding, quality may be improved. Experimental results show the image segmentation and comparison VLMVQ with BMA from the view point of SNR & bit rate.
    View full abstract
    Download PDF (893K)
  • Coding Scheme for Interlaced Scanning Pictures Using Progressive Conversion of Reference Pictures
    Kenji Sugiyama, Gou Obara, Seiichiro Hangai
    Article type: Article
    Session ID: BCS2000-97
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_121
    CONFERENCE PROCEEDINGS FREE ACCESS
    Show abstractHide abstract
    In digital broadcast, many kind of picture format are used. However, interlaced scanning TV receiver is still used in most homes. We have thus developed a broadcast system that uses common bit stream for the 480i and the 480p formats as a source picture and the 480i format for the receiver. We take new coding for the 480i pictures which include a conversion from interlaced scanning to progressive scanning of the P and I-picture only. We discuss a scanning conversion and use motion compensated adaptive interpolation. Experimental results showed that the proposed coding scheme performs better than interlaced scanning coding in MPEG-2.
    View full abstract
    Download PDF (623K)
  • [title in Japanese]
    Article type: Appendix
    Pages App1-
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_App1
    CONFERENCE PROCEEDINGS FREE ACCESS
    Download PDF (74K)
  • [title in Japanese]
    Article type: Cover
    Pages Cover2-
    Published: December 15, 2000
    Released on J-STAGE: June 23, 2017
    DOIhttps://doi.org/10.11485/itetr.24.79.0_Cover2
    CONFERENCE PROCEEDINGS FREE ACCESS
    Download PDF (60K)
    • |<
    • <
    • 1
    • >
    • >|
feedback
 Top