All issues
Predecessor
21.77
Displaying 1-17 of 17 articles from this issue
- |<
- <
- 1
- >
- >|
-
Article type: Cover
Pages Cover1-
Published: December 11, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSDownload PDF (14K) -
Article type: Bibliography
Pages Misc1-
Published: December 11, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSDownload PDF (51K) -
Article type: Index
Pages Toc1-
Published: December 11, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSDownload PDF (65K) -
Kan TOYOSHIMA, Yutaka WATANABE, Kazuhiro HAYASHIArticle type: Article
Pages 1-8
Published: December 11, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSThe recent increasing traffic of Internet/Intra-net/Extra-net services and estimation result of those traffic require a new high-speed data transfer method suitable for long and variable length packets, e.g. IP packets and MAC frames. This paper first researches the history of variable length packets transfer method. One of the key to realize high-speed transfer method is periodic processing by hardware. The processing unit is almost same as cell length now. Problems are listed when transferring packets by ATM network. These problems are caused by too short cell length against packet length and no or less bit assignment of functions needed. The proposed method has a data length field that allows multiple data length of basic data length.View full abstractDownload PDF (927K) -
Kouichi Suto, Kazunari Irie, Tomohiro Kumagai, Genichi Nishio, Hisao T ...Article type: Article
Pages 9-14
Published: December 11, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSA regional personal computer (PC) communication network system is developed that offers a LAN environment to residential customers and small business users. The aim of the system is taking role as an infrastructure for PC communication and providing new convenience of PC communication service in a community. This paper describes design and performance of a newly developed group management server (GMS) and low-end-card (LEC). A packet filtering table creation algorithm to shorten the renewal time in GMS is also described, which is required in practical use system in order to improve maintenance and operability.View full abstractDownload PDF (712K) -
Katsuhiko Sano, Kazunari Irie, Kouichi Suto, Norihisa Ohta, Hisao Tsuj ...Article type: Article
Pages 15-20
Published: December 11, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSWe have researched the cost-effective regional Personal-Computer (PC) communication network system and its realization. PC group communication services to regional community members have been proposed. The experimental system has been developed and applied to the trial. This paper presents a newly developed mutliplex-port brouter which can accommodate a large capacity of subscribers and its performance. It describes the system configuration and the brouter architecture. The measuring scheme simulating the multiple access is presented. The evaluated brouter performance using the PCs connected via the subscriber network system is shown.View full abstractDownload PDF (778K) -
Kazuyoshi Hayase, Kazunari Irie, Norihisa OhtaArticle type: Article
Pages 21-26
Published: December 11, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSThe authors have proposed a regional community PC network system which supports group communication and have been developing the system. Although the developing system is based on STM network, high speed communication needs like multimedia application should require a new network system which covers a wide range of communication rate in the future. In this paper, we investigate new network architectures based on MAC over ATM. At first, we show two architectures of our group communication network based on the developing STM system and LAN Emulation. We, then, propose a new architecture in which the network center transmits packets within ATM layer. Furthermore, an improvement is proposed for flows of continuous packets. A traffic simulation result is also given.View full abstractDownload PDF (635K) -
Ryoko MORI, Yasunori NAGASAKA, Nobuo SUZUMURAArticle type: Article
Pages 27-32
Published: December 11, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSIn this paper, we propose a method to extract obstacles and to estimate the positions by stereo images. left and right images are divided into many small areas. Then the corresponding areas are find out by calculating correspondences of pixels. Distances are estimated by the gap of two corresponding areas. Using the various sizes of small area, reliability was improved. Then labeling is carried out and the areas which has same label are combined. The combined areas which has particular distance are only detected as obstacles. Following the obstacles, keeping appropriate interval of cameras based on the previously estimated results became possible. The correctness of extraction was improved by this.View full abstractDownload PDF (807K) -
Masaki HARADA, Toshiaki FUJII, Tadahiko KIMOTO, Masayuki TANIMOTOArticle type: Article
Pages 33-38
Published: December 11, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSFractal image coding based on Iterated Function system (IFS) performs compression by using the self-similarity included in an image. However, even if the exact self-similarity of an image is found at the encoder, it hardly holds at the decoder because a domain pool of the encoder is different from that of the decoder. In this paper, we propose a fractal image coding scheme by using domain pools replaced with decoded or transformed values to reduce the difference between the domain pools of the encoder and that of the decoder. The experimental results show the effectiveness of the proposed scheme.View full abstractDownload PDF (934K) -
Ho-Cheon WEY, Masayuki KAWAMATAArticle type: Article
Pages 39-44
Published: December 11, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSThis paper proposes an ITT image coding method using fractal dimension (FD)-based block classification. The blocks taken from the original images are first classified into two classes based on their fractal dimensions. Then the range-domain comparison is carried out only within the blocks that belong to the same class. Moreover, the number of the searched blocks can be further decreased by exploiting the fractal signature distance as a criteria to determine whether the calculation of the correlation between the range block and domain blocks should be carried out or not. Experimental results show that the proposed method offers a 10-20 times faster compression speed than the full search method with only a PSNR loss of about 0.5 dB.View full abstractDownload PDF (690K) -
Masato Tsukahara, Miki Haseyama, Hideo KitajimaArticle type: Article
Pages 45-49
Published: December 11, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSImage coding using adaptive KL bases that reflect edge properties is investigated. Images are partitioned into blocks of pixels. The pixel blocks are classified into subsets of blocks according to their edge contents and orientations. Adaptive KL bases that reflect edge features are designed for each class. In practice, images are separated into two frequency components, that are low and high frequency components. Adaptive KL bases are designed for edge images (high frequency components), and then edge images are coded. The method is compared with a conventional method using the DCT and the effativeness of using adaptive KL bases is examined.View full abstractDownload PDF (608K) -
Satoshi ASAMIZU, Miki HASEYAMA, Hideo KITAJIMAArticle type: Article
Pages 51-56
Published: December 11, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSThis paper proposes motion compensation based on motion-table lookup. Various motion patterns are put into a motion-table. The proposed method selects the motion to minimize prediction error from the motion-table. A pair of motion-tables sets up by distinct methods are compared.View full abstractDownload PDF (743K) -
Hiroyuki Honda, Miki Haseyama, Hideo KitajimaArticle type: Article
Pages 57-62
Published: December 11, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSThis paper proposes image interpolation using fractal dimensions. This method calculates fractal dimensions from image. Since fractal dimensions correlate closely with roughness of images, this interpolation can generate images which have lower error rather than images generated ty linear and spline interpolations. These interpolations lose high frequency components. And loss of the components cause error of the interpolated images. Fractal interpolations have been used for generation of geographical images. We change the interpolation in order to apply to other images.View full abstractDownload PDF (773K) -
Tetsuya Arai, Miki Haseyama, Hideo KitajimaArticle type: Article
Pages 63-68
Published: December 11, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSThis paper proposes a region segmentation method for extracting moving objects. In the proposed algorithm, after segmentation with a simple region growing algorithm. the centroid of each region is computed. the centroids are used as the initial values of the k-mean clustering. These regions the existent method for extracting moving objects with a fuzzy reasoning. It is verified that the proposed method can effectively extract moving objects by some experiments.View full abstractDownload PDF (858K) -
Jun Inagaki, Miki Haseyama, Hideo KitajimaArticle type: Article
Pages 69-74
Published: December 11, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSThis paper proposes a method of searching the shortest route through several designated points using a genetic algorithm. The proposed method not only searches the shortest route but also selects the shortest route through several designated points. Current methods, such as the Dijkstra's method, are the algorithms only for routing the shortest route. If the shortest route through several designated points is searched by these methods, its computational cost is O(N^2) where N is the number of the designated points. Therefore, the more the designated points increase, the more the routing demands computational cost. The proposed algorithm can obtain the shortest route through the points by an only search, and is more useful for this kind of routing than the other methods.View full abstractDownload PDF (542K) -
Gaku SHIBATA, Shiro HANDA, Shinjiro OSHITAArticle type: Article
Pages 75-80
Published: December 11, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSIn this paper, arithmetic coding of gray scale images using two methods is proposed. They are adaptive coding using variable model for each bit of a pixel and non-coding in which less significant bits of a pixel are partially not coded. Our proposed method is applied to some medical images of 12 bits/pixel and compression characteristics are considered. The MDL criterion is used in adapting and judging coding/non-coding.View full abstractDownload PDF (594K) -
Article type: Appendix
Pages App1-
Published: December 11, 1997
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSDownload PDF (76K)
- |<
- <
- 1
- >
- >|