Pub Date : 2001-08-22DOI: 10.1109/ICME.2001.1237875
C. J. Kuo, Zhi W. Huang
Modified network architecture for sorting data of any size is presented in this paper. The proposed VLSI archi- tecture is directly modified from the Batcher's odd-even merge-sort network. The major advantage of the proposed architecture is its modular approach, simple and regular interconnection and easy implementation by VLSI technol- ogy.
{"title":"Modified odd-even merge-sort network for arbitrary number of inputs","authors":"C. J. Kuo, Zhi W. Huang","doi":"10.1109/ICME.2001.1237875","DOIUrl":"https://doi.org/10.1109/ICME.2001.1237875","url":null,"abstract":"Modified network architecture for sorting data of any size is presented in this paper. The proposed VLSI archi- tecture is directly modified from the Batcher's odd-even merge-sort network. The major advantage of the proposed architecture is its modular approach, simple and regular interconnection and easy implementation by VLSI technol- ogy.","PeriodicalId":405589,"journal":{"name":"IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125028437","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-08-22DOI: 10.1109/ICME.2001.1237806
S. Fels
People have aesthetic experiences when they manipulate objects skillfully. Highly skilled performance with an object requires forming a highly intimate relationship with it. Aesthetics flow from this intimacy. This paper discusses three works that illustrate how intimacy and embodiment can be useful concepts for designing human-machine interfaces. The three works include: Iamascope, Glove-TalkII and the Forklift Ballet.
{"title":"Intimacy and embodiment issues for human-computer interaction design","authors":"S. Fels","doi":"10.1109/ICME.2001.1237806","DOIUrl":"https://doi.org/10.1109/ICME.2001.1237806","url":null,"abstract":"People have aesthetic experiences when they manipulate objects skillfully. Highly skilled performance with an object requires forming a highly intimate relationship with it. Aesthetics flow from this intimacy. This paper discusses three works that illustrate how intimacy and embodiment can be useful concepts for designing human-machine interfaces. The three works include: Iamascope, Glove-TalkII and the Forklift Ballet.","PeriodicalId":405589,"journal":{"name":"IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123910204","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-08-22DOI: 10.1109/ICME.2001.1237946
Beom-Ryeol Lee, Dong-Il Go, Jong-Sung Kim, Jae-Jeong Hwang
In the fields of networked virtual environments we meet the limitation of real-time event processing in the shared virtual workspace for massively and globally participated users on the internet. In this paper, we design an architecture of event servers that supports light-weight event messaging and guarantees real-time event processing for distributed virtual environments on the internet with large scale workspace and multi-participants. In the design concept of event servers we focus on the event server components in the part of distributed virtual environments. Using the stand alone event server on the internet we maintain the information of multiple user connections and the shared states information for real-time event management. The event server component will be able to apply the distributed virtual workspace server to the scalable server architecture for maintaining the consistency of shared workspace and real-time updating of shared state information in the virtual worlds.
{"title":"An event server architecture for the large scaled virtual cooperative envirinment on the internet","authors":"Beom-Ryeol Lee, Dong-Il Go, Jong-Sung Kim, Jae-Jeong Hwang","doi":"10.1109/ICME.2001.1237946","DOIUrl":"https://doi.org/10.1109/ICME.2001.1237946","url":null,"abstract":"In the fields of networked virtual environments we meet the limitation of real-time event processing in the shared virtual workspace for massively and globally participated users on the internet. In this paper, we design an architecture of event servers that supports light-weight event messaging and guarantees real-time event processing for distributed virtual environments on the internet with large scale workspace and multi-participants. In the design concept of event servers we focus on the event server components in the part of distributed virtual environments. Using the stand alone event server on the internet we maintain the information of multiple user connections and the shared states information for real-time event management. The event server component will be able to apply the distributed virtual workspace server to the scalable server architecture for maintaining the consistency of shared workspace and real-time updating of shared state information in the virtual worlds.","PeriodicalId":405589,"journal":{"name":"IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127416850","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-08-22DOI: 10.1109/ICME.2001.1237790
Lie Lu, Hong You, HongJiang Zhang
In this paper, we present a method for querying desired songs from music database by humming a tune. Since errors are inevitable in humming, tolerance should be considered. In order to suit or adapt to people’s humming habit, a new melody representation and new hierarchical matching method are proposed in this paper. Query processing and database processing algorithm are also described in detail. The proposed approach achieves high performance in experimental evaluation. For 88% queries, the correct song can be retrieved among the top 10 matches.
{"title":"A new approach to query by humming in music retrieval","authors":"Lie Lu, Hong You, HongJiang Zhang","doi":"10.1109/ICME.2001.1237790","DOIUrl":"https://doi.org/10.1109/ICME.2001.1237790","url":null,"abstract":"In this paper, we present a method for querying desired songs from music database by humming a tune. Since errors are inevitable in humming, tolerance should be considered. In order to suit or adapt to people’s humming habit, a new melody representation and new hierarchical matching method are proposed in this paper. Query processing and database processing algorithm are also described in detail. The proposed approach achieves high performance in experimental evaluation. For 88% queries, the correct song can be retrieved among the top 10 matches.","PeriodicalId":405589,"journal":{"name":"IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127423484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-08-22DOI: 10.1109/ICME.2001.1237854
Jian Wang, Ze-Nian Li
This paper proposes a Locale-based Multiple Cue (LMC) algorithm to solve the problem of segmenting foregroundmoving objects from the background scene. The major cue used for object segmentation is the motion information obtained from a novel locale-based motion estimation and clustering algorithm. At first, locales are classified according to color and intensity. The motion estimation is applied on the tiles of 16 x 16 pixels, which are the building blocks of locales. After motion estimation, camera motions are detected using a 2D affine motion model. Then the locales are grown from the tile level to the frame level in a pyramidal way using motion, color, and centroid variance constraint. The resulting locales, with tiles homogeneous in motion and color, are post-processed to recover the object boundary. Experimental results show that LMC combines temporal and spatial information in a graceful way, which enables it to segment the moving objects under different camera motions. Future work includes object tracking over multiple frames and utilization of texture information.
本文提出了一种基于区域的多线索(LMC)算法来解决从背景场景中分割前景运动物体的问题。目标分割的主要线索是通过一种新的基于区域的运动估计和聚类算法获得的运动信息。首先，根据颜色和强度对区域进行分类。运动估计应用于16 x 16像素的贴图，这是区域的构建块。运动估计后，使用二维仿射运动模型检测相机运动。然后使用运动、颜色和质心方差约束以金字塔的方式将区域从贴图级别扩展到框架级别。产生的区域，具有相同的运动和颜色的瓷砖，被后处理以恢复对象边界。实验结果表明，LMC能很好地结合时间和空间信息，在不同的摄像机运动状态下分割出运动物体。未来的工作包括多帧对象跟踪和纹理信息的利用。
{"title":"Locale-based multiple cue algorithm for object segmentation","authors":"Jian Wang, Ze-Nian Li","doi":"10.1109/ICME.2001.1237854","DOIUrl":"https://doi.org/10.1109/ICME.2001.1237854","url":null,"abstract":"This paper proposes a Locale-based Multiple Cue (LMC) algorithm to solve the problem of segmenting foregroundmoving objects from the background scene. The major cue used for object segmentation is the motion information obtained from a novel locale-based motion estimation and clustering algorithm. At first, locales are classified according to color and intensity. The motion estimation is applied on the tiles of 16 x 16 pixels, which are the building blocks of locales. After motion estimation, camera motions are detected using a 2D affine motion model. Then the locales are grown from the tile level to the frame level in a pyramidal way using motion, color, and centroid variance constraint. The resulting locales, with tiles homogeneous in motion and color, are post-processed to recover the object boundary. Experimental results show that LMC combines temporal and spatial information in a graceful way, which enables it to segment the moving objects under different camera motions. Future work includes object tracking over multiple frames and utilization of texture information.","PeriodicalId":405589,"journal":{"name":"IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121018688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-08-22DOI: 10.1109/ICME.2001.1237894
A. Bonzanini, R. Leonardi, P. Migliorati
In this paper we present a semantic video indexing algorithm based on finite-state machines and low-level motion indices extracted from the MPEG compressed bit-stream. The problem of semantic video indexing is actually of great interest due to the wide diffusion of large video databases. In literature we can find many video indexing algorithms, based on various types of low-level features, but the problem of semantic indexing is less studied and surely it is a great challenging one. The proposed algorithm is an example of solution to the problem of finding a semantic relevant event (e.g., scoring of a goal in a soccer game) in case of specific categories of audio-visual programmes. The simulation results show that the proposed algorithm can effectively detect the presence of goals and other relevant events in sport programs.
{"title":"Event recognition in sport programs using low-level motion indices","authors":"A. Bonzanini, R. Leonardi, P. Migliorati","doi":"10.1109/ICME.2001.1237894","DOIUrl":"https://doi.org/10.1109/ICME.2001.1237894","url":null,"abstract":"In this paper we present a semantic video indexing algorithm based on finite-state machines and low-level motion indices extracted from the MPEG compressed bit-stream. The problem of semantic video indexing is actually of great interest due to the wide diffusion of large video databases. In literature we can find many video indexing algorithms, based on various types of low-level features, but the problem of semantic indexing is less studied and surely it is a great challenging one. The proposed algorithm is an example of solution to the problem of finding a semantic relevant event (e.g., scoring of a goal in a soccer game) in case of specific categories of audio-visual programmes. The simulation results show that the proposed algorithm can effectively detect the presence of goals and other relevant events in sport programs.","PeriodicalId":405589,"journal":{"name":"IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122635502","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-08-22DOI: 10.1109/ICME.2001.1237763
Chung-wei Lee, Jonathan C. L. Liu, Randy Chow, R. Newman
Effective use of limited network resources is crucial in supporting network-based multimedia applications. A K-metric altruistic Qos routing algorithm is proposed to tackle the issue of network resource overcommitmnent. based on this algorithm, a multimedia dispersion scheme is developed to alleviate the high blocking ratio problem caused by high bandwidth requirement. Our evaluation shows that the proposed scheme is capable of achieving at 30% improvement in terms of reducing the average blocking ratio.
{"title":"Altruistic QoS routing with multimedia dispersion","authors":"Chung-wei Lee, Jonathan C. L. Liu, Randy Chow, R. Newman","doi":"10.1109/ICME.2001.1237763","DOIUrl":"https://doi.org/10.1109/ICME.2001.1237763","url":null,"abstract":"Effective use of limited network resources is crucial in supporting network-based multimedia applications. A K-metric altruistic Qos routing algorithm is proposed to tackle the issue of network resource overcommitmnent. based on this algorithm, a multimedia dispersion scheme is developed to alleviate the high blocking ratio problem caused by high bandwidth requirement. Our evaluation shows that the proposed scheme is capable of achieving at 30% improvement in terms of reducing the average blocking ratio.","PeriodicalId":405589,"journal":{"name":"IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124003548","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-08-22DOI: 10.1109/ICME.2001.1237672
T. Tsai, Ya-Chau Yang
MPEG Layer III (MP3) Audio decoding algorithm is involved in several complex-coding techniques and is therefore difficult to create an efficient architecture design for. This paper presents an effective method that reduces the amount of required operation significantly. Based on the computation analysis, a novel architecture was developed, which performs two main functions, IMDCT with dynamic windowing and subband Synthesis efficiently with pipeline operation. The decoder was designed based on simplicity and low-cost, while retaining the high-efficiency requirement
{"title":"A novel architecture design for MP3 audio decoder","authors":"T. Tsai, Ya-Chau Yang","doi":"10.1109/ICME.2001.1237672","DOIUrl":"https://doi.org/10.1109/ICME.2001.1237672","url":null,"abstract":"MPEG Layer III (MP3) Audio decoding algorithm is involved in several complex-coding techniques and is therefore difficult to create an efficient architecture design for. This paper presents an effective method that reduces the amount of required operation significantly. Based on the computation analysis, a novel architecture was developed, which performs two main functions, IMDCT with dynamic windowing and subband Synthesis efficiently with pipeline operation. The decoder was designed based on simplicity and low-cost, while retaining the high-efficiency requirement","PeriodicalId":405589,"journal":{"name":"IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132537008","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-08-22DOI: 10.1109/ICME.2001.1237640
K. Ntalianis, N. Doulamis, S. Kollias, A. Doulamis
In this paper, an efficient scheme for video object segmentation is proposed. The scheme is based on a multiresolution Gradient Vector Flow field (M-GVF) and a Motion Geometric Space (MGS) formulation. In particular the proposed scheme is initialized from an object approximation which can be provided either (a) automatically (unsupervised case) based on a depth map estimation method or (b) semi-automatically by user interaction. In the following, several feature points are estimated on the initial object contour (i.e. depth object) and an M-GVF adapted MGS is created to determine the direction that a feature point is allowed to move to. In this framework, each feature point moves onto its MGS in order to locate the contour of the physical video object. Experimental results are presented to indicate the reliable performance of the proposed scheme on real life stereoscopic and monocular video sequences.
{"title":"Multiresolution gradient vector flow field: a fast implementation towards video object plane segmentation","authors":"K. Ntalianis, N. Doulamis, S. Kollias, A. Doulamis","doi":"10.1109/ICME.2001.1237640","DOIUrl":"https://doi.org/10.1109/ICME.2001.1237640","url":null,"abstract":"In this paper, an efficient scheme for video object segmentation is proposed. The scheme is based on a multiresolution Gradient Vector Flow field (M-GVF) and a Motion Geometric Space (MGS) formulation. In particular the proposed scheme is initialized from an object approximation which can be provided either (a) automatically (unsupervised case) based on a depth map estimation method or (b) semi-automatically by user interaction. In the following, several feature points are estimated on the initial object contour (i.e. depth object) and an M-GVF adapted MGS is created to determine the direction that a feature point is allowed to move to. In this framework, each feature point moves onto its MGS in order to locate the contour of the physical video object. Experimental results are presented to indicate the reliable performance of the proposed scheme on real life stereoscopic and monocular video sequences.","PeriodicalId":405589,"journal":{"name":"IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130959007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-08-22DOI: 10.1109/ICME.2001.1237676
J. Hart, T. Ray, K. Shimohara
Different threads of multithreaded digital organisms are found to cluster into tissues which differ in patterns of code execution. Evolution in a network environment has led to the differentiation of new tissues. Some new tissues emerge through a process of gene duplication followed by divergence and specialization in function of different copies of the gene.
{"title":"Evolution of new tissues through gene duplication and divergence in multithreaded digital organisms","authors":"J. Hart, T. Ray, K. Shimohara","doi":"10.1109/ICME.2001.1237676","DOIUrl":"https://doi.org/10.1109/ICME.2001.1237676","url":null,"abstract":"Different threads of multithreaded digital organisms are found to cluster into tissues which differ in patterns of code execution. Evolution in a network environment has led to the differentiation of new tissues. Some new tissues emerge through a process of gene duplication followed by divergence and specialization in function of different copies of the gene.","PeriodicalId":405589,"journal":{"name":"IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130993696","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：