All issues
Predecessor
26.24
Displaying 1-16 of 16 articles from this issue
- |<
- <
- 1
- >
- >|
-
Article type: Cover
Pages Cover1-
Published: March 05, 2002
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSDownload PDF (18K) -
Article type: Index
Pages Toc1-
Published: March 05, 2002
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSDownload PDF (57K) -
Xiaotong Hu, Makoto Fujimura, Yoko Maemura, Hideo KurodaArticle type: Article
Session ID: MIP2002-88
Published: March 05, 2002
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSIn the current system using centers of gravity of image blocks for fractal image coding, since centers of gravity of image blocks were expressed with 2-dimensional coordinates, processes of defining the range of searching the best matching domain block consumed time. In order to improve this problem, in this paper, we use 1-dimensional coordinate expression for centers of gravity of image blocks, and domain blocks are sorted in order of centers of gravity, as a result the high-speed processing method for searching the best matching domain block is realized.View full abstractDownload PDF (757K) -
Hideaki TOKUYAMA, Shuji YAMASAKI, Xiaotong Hu, Makoto Fujimura, Yoko M ...Article type: Article
Session ID: MIP2002-89
Published: March 05, 2002
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSFractal image coding processing searches for the best matching domain block, by pattern matching out of the domain pool that divided into plurality. For this reason, we propose an improvement of the construction of a domain pool from the viewpoint of processing time shortening. By the conventional method, a pattern index is valued by pulling the average value of every block from a pixel value, and domain pools are divided with the pattern matching which settles by its' value becomes positive or negative. On the other hand, proposed method pulls average value from the pixel value, furthermore, the value called distributed pattern block is pulled to calculate pattern index. With the result of a simulation experiment, it is shown that the amount of calculation is reduced sharply.View full abstractDownload PDF (651K) -
Miki Abe, Hisakazu Hada, Masakazu Imai, Hideki SunaharaArticle type: Article
Session ID: MIP2002-90
Published: March 05, 2002
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSFor museum exhibitions, curators select articles with their knowledge, and they plan scenario and the design of the exhibition. It helps visitor's learning. With the appearance of digital museum, people can retrieve and appreciate based on their interest from amount of data. But in many of digital museum sites, order of search results is not considered. In this paper, we propose the system that supplies one of the important roles of curator, making exhibition scenario. We calculate relationships between articles, and an order is decided by the score. The system automatically makes a scenario of an exhibition which has the flow.View full abstractDownload PDF (752K) -
Hisashi MIYAMORIArticle type: Article
Session ID: MIP2002-91
Published: March 05, 2002
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSThis paper studies a method of automatic database creation and effective summary display, of vaulting horse class. The study aims at establishing content creation method which can provide practical functions such as content-based retrieval and summarization. The system records the scenes of vaulting actions in the class using the camera fixed beside the vaulting horse. Then it automatically extracts each jumping behavior, put indices on key actions, and register them onto the database. Indexing on key actions is done, by analyzing spatial relations and their temporal transitions between feature points of the student's circumscribed rectangle and those of vaulting horse model. Experimental results show that the database registration of student ID according to the predefined recording order enables easy access and display of well-performed actions and of specific vaulting actions for comparison. They also indicate that the summarized display of key action's thumbnails promotes visual and objective understanding and confirmation of individual jumping forms and other key points for better performance.View full abstractDownload PDF (1124K) -
Shuichi AOKI, Terumasa AOKI, Hiroshi YASUDAArticle type: Article
Session ID: MIP2002-92
Published: March 05, 2002
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSWe propose portrait retrieval from moving pictures with symbolic rough sketch, which is drawn frequently. The posture of target people is shown by symbolic rough sketch. And lines around the symbolic rough sketch show the movement of target people. In addition, we take some descriptors of MPEG-7 as metadata to calculate similarity between drawn query rough sketch and compared image in database. We also propose a discriminative conversion algorithm to make it possible that symbolic rough sketch drawn by users reflects their intention more precisely. Experimental results on an indigested home video, one of the practical applications of portrait retrieval, show that our algorithm improves the value of similarity between rough sketch and user's targeted image and that we can retrieve our target portrait with symbolic rough sketch.View full abstractDownload PDF (853K) -
Hideo Kuroda, Shuji YAMASAKI, Hideaki TOKUYAMA, Xiaotong Hu, Makoto Fu ...Article type: Article
Session ID: MIP2002-93
Published: March 05, 2002
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSImportnt things for Image coding are efficiency of coding bit rate, quality of reconstructed image and processing time. In the encoding process of fractal image compression, the best matching domain block which is most similar to a given range block is selected from the domain pool including a lot of domain blocks by pattern matching. In the process scaling-factor, which is shown by ratio between the standard deviation of range block and the standard deviation of domain block, have important effects upon efficiency of coding bit rate, quality of reconstructed image and processing time. In this paper, we discuss scaling-factor in fractal image coding.View full abstractDownload PDF (661K) -
Hideki KOKUBUN, Tadashi ISOBE, Yuzuru TSUCHIYA, Takeshi KIMURA, Mikihi ...Article type: Article
Session ID: MIP2002-94
Published: March 05, 2002
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSWe have been studying integrated internet and broadcasting services to be offered by digital terrestrial broadcasting services that will start from 2003 in Japan. We have developed an experimental simulator for services using portable and mobile terminals. The first step in this study focused on display panels and the operation keys of portable terminals. A mobile phone and a PDA were displayed on a PO LCD display, and interactive operations were carried out with the clicking action of a mouse. The paper describes the variety of integrated services planned and gives an overview of the simulator.View full abstractDownload PDF (622K) -
Tadashi ISOBE, Hideki KOKUBUN, Yuzuru TSUCHIYA, Takeshi KIMURA, Mikihi ...Article type: Article
Session ID: MIP2002-95
Published: March 05, 2002
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSAdvanced information services which are integrated the Internet and broadcasting are studied. New Internet services are developing based on IPv6 and the terrestrial digital broadcasting services will start in 2003. Taking advantages of both features, various integrated services were studied, using mobile and portable user terminal. Several contents of different types have been experimentally produced and their servicing functions evaluated using the service simulation system. Subjective evaluation tests have also been conducted with the telecommunication transmission lines on the switching operation of the "seamless reception" complementary to the broadcasting services.View full abstractDownload PDF (1055K) -
Jun Watanabe, Madoka Hasegawa, Shigeo KatoArticle type: Article
Session ID: MIP2002-96
Published: March 05, 2002
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSMany digital watermarking methods have been proposed for copyright protection. Especially, methods to add a watermark in the frequency domain are often used. In those methods, only a few components of frequencies are changed according to watermark information, so that the pixel values sometimes exceed the dynamic range. This even occurs without attacks like image processing. In this paper, we propose two methods to prevent loss of watermark information, applicable to such cases, it is said that, one is the method called "inversion of increase and decrease" and another is "conservation of amounts of changes". We can extract the watermark information correctly under the condition of no attacks by using these proposed methods.View full abstractDownload PDF (681K) -
Ken-ichi TANAKAArticle type: Article
Session ID: MIP2002-97
Published: March 05, 2002
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSIn order to make easily to display, both the digital half toning and the computer generated holography have the binarization process. The error diffusion method is commonly utilized to binarization process for both the digital halftoning and the digital holography. Error diffusion method using Hilbert scan for the halftoning and for the computer generated hologram. In this article, Hilbert scan is effectiveness compared with other scans (i.e. raster scan, prime order scan, spiral scan and Morton scan).View full abstractDownload PDF (1147K) -
Yoko MAEMURA, Xiatong HU, Makoto FUJIMURA, Hideo KURODAArticle type: Article
Session ID: MIP2002-98
Published: March 05, 2002
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSWe are now developing to apply the parameters of fractal image coding which are based on the construction of the image. These coding parameters show the correlations between the range blocks and the best matched domain blocks. Therefore, the information of addresses of best match domain blocks seems to make characteristics of their original images and we try to use them to authentication of the images. By the optimization of partitioned block sizes (range blocks and domain blocks), we obtain more accurate coding parameters even after applying the attacks based on the geometric distortions like a Stirmark attack.View full abstractDownload PDF (702K) -
Makoto Fujimura, Hideo KurodaArticle type: Article
Session ID: MIP2002-99
Published: March 05, 2002
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSIn very low bit-rate video coding, error recovery algorithm is important because of robustness. In this paper we propose the interframe leaky prediction scheme for robust video transmission. In proposed scheme significant blocks are coded by interframe leaky prediction. The leaky prediction coefficient is used as interframe correlation. Insignificant blocks are not transmitted as well as interframe complete prediction scheme. Simulation results demonstrate that interframe leaky prediction is good for low bit-rate trans- mission. Error recovery was good result for human .because of moving regions were recovery.View full abstractDownload PDF (598K) -
Article type: Appendix
Pages App1-
Published: March 05, 2002
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSDownload PDF (72K) -
Article type: Appendix
Pages App2-
Published: March 05, 2002
Released on J-STAGE: June 23, 2017
CONFERENCE PROCEEDINGS FREE ACCESSDownload PDF (72K)
- |<
- <
- 1
- >
- >|