The multimedia rapture has held out hopes for advancements in user-centric computing. At the same time, however, there is a move towards autonomous software (cf. intelligent filters, mobile and distributed agents, etc.), leaving users with an uncomfortable lack of knowledge about and control over ?what these components are doing behind their backs?. Visualization of both autonomous agent action and user-agent interaction becomes a crucial issue if these conflicting trends are to be harmonized. We present a system service for comic actor animation, which can be used as a representation of agents of all kinds. A second use case is for rapid authoring of animations which augment multimedia presentations or off-the-shelf software. Our focus is on the reuse of the necessary artwork, using a modular and flexible building-block approach. As a preliminary step, this approach requires a set of elementary animation sequences to be created by a professional graphic artist,once per character. These sequences can be repeatedly combined in custom animated cartoons by easy-to-use commands at runtime. Our Comic Actor Editor Engine CAeditEngine uses a sophisticated approach for combining the elementary building blocks to form complete animations. Our Comic Actor Playing Engine CAplayEngine uses a digital chroma keying technique in combination with layering to display the animations on top of any graphical user interface and any interactive software. The system runs under MS Windows NT, a first version was used in a public interactive exhibit of multimedia and animation techniques and showed excellent performance.
{"title":"An open architecture for comic actor animation","authors":"Knut Manske, M. Mühlhäuser","doi":"10.1145/266180.266376","DOIUrl":"https://doi.org/10.1145/266180.266376","url":null,"abstract":"The multimedia rapture has held out hopes for advancements in\u0000user-centric computing. At the same time, however, there is a\u0000move towards autonomous software (cf. intelligent filters, mobile\u0000and distributed agents, etc.), leaving users with an uncomfortable\u0000lack of knowledge about and control over ?what these components\u0000are doing behind their backs?. Visualization of both autonomous\u0000agent action and user-agent interaction becomes a crucial issue if\u0000these conflicting trends are to be harmonized. We present a system\u0000service for comic actor animation, which can be used as a representation of agents of all kinds. A second use case is for rapid\u0000authoring of animations which augment multimedia presentations\u0000or off-the-shelf software. Our focus is on the reuse of the necessary artwork, using a modular and flexible building-block approach.\u0000As a preliminary step, this approach requires a set of elementary\u0000animation sequences to be created by a professional graphic artist,once per character. These sequences can be repeatedly combined\u0000in custom animated cartoons by easy-to-use commands at runtime.\u0000Our Comic Actor Editor Engine CAeditEngine uses a sophisticated approach for combining the elementary building blocks to\u0000form complete animations.\u0000Our Comic Actor Playing Engine CAplayEngine uses a digital\u0000chroma keying technique in combination with layering to display\u0000the animations on top of any graphical user interface and any\u0000interactive software.\u0000The system runs under MS Windows NT, a first version was used\u0000in a public interactive exhibit of multimedia and animation techniques and showed excellent performance.","PeriodicalId":250198,"journal":{"name":"MULTIMEDIA '97","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122681569","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}
The paper addresses how relevance feedback can be used to improve the performance of content-based image retrieval. We present two supervised learning methods: learning the query and learning the metric. We combine the learning methods with the recently proposed color correlograms for image indexing/retrieval. Our results on a large image database of over 20; 000 images suggest that these learning methods are quite effective for content-based image retrieval.
{"title":"Combining supervised learning with color correlograms for content-based image retrieval","authors":"Jing Huang, Ravi Kumar, Mandar Mitra","doi":"10.1145/266180.266383","DOIUrl":"https://doi.org/10.1145/266180.266383","url":null,"abstract":"The paper addresses how relevance feedback can be used to improve the performance of content-based image retrieval. We present two supervised learning methods: learning the query and learning the metric. We combine the learning methods with the recently proposed color correlograms for image indexing/retrieval. Our results on a large image database of over 20; 000 images suggest that these learning methods are quite effective for content-based image retrieval.","PeriodicalId":250198,"journal":{"name":"MULTIMEDIA '97","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128455111","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}
L. Rutledge, J. V. Ossenbruggen, L. Hardman, D. Bulterman
Being able to author a hypermedia document once for presentation under a wide variety of potential circumstances requires that it be stored in a manner that is adaptable to these circumstances. Since the nature of these circumstances is not always known at authoring time, specifying how a document adapts to them must be a process that can be performed separately from its original authoring. These distinctions include the porting of the document to different platforms and formats and the adapting of the document’s presentation to suit the needs of the user and of the current state of the presentation environment. In this paper we discuss extensions to our CMIF hypermedia authoring and presentation environment that provide adaptability through this distinction between authoring and presentation specification. This extension includes the use of HyTime for document representation and of DSSSL for presentation specification. We also discuss the Berlage architecture, our extension to HyTime that specifies the encoding of certain hypermedia concepts useful for presentation specification.
{"title":"A framework for generating adaptable hypermedia documents","authors":"L. Rutledge, J. V. Ossenbruggen, L. Hardman, D. Bulterman","doi":"10.1145/266180.266348","DOIUrl":"https://doi.org/10.1145/266180.266348","url":null,"abstract":"Being able to author a hypermedia document once for presentation under a wide variety of potential circumstances requires that it be stored in a manner that is adaptable to these circumstances. Since the nature of these circumstances is not always known at authoring time, specifying how a document adapts to them must be a process that can be performed separately from its original authoring. These distinctions include the porting of the document to different platforms and formats and the adapting of the document’s presentation to suit the needs of the user and of the current state of the presentation environment. In this paper we discuss extensions to our CMIF hypermedia authoring and presentation environment that provide adaptability through this distinction between authoring and presentation specification. This extension includes the use of HyTime for document representation and of DSSSL for presentation specification. We also discuss the Berlage architecture, our extension to HyTime that specifies the encoding of certain hypermedia concepts useful for presentation specification.","PeriodicalId":250198,"journal":{"name":"MULTIMEDIA '97","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123960306","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}
Constraints can be used to specify the desired layout of a web document, and also the behaviour of embedded applets. We present a system architecture in which both the author and the viewer can impose page layout constraints, some required and some preferential. The final appearance of the web page is thus the result of negotiation between author and viewer, where this negotiation is carried out by solving the set of required and preferential constraints imposed by both parties. We identify two plausible system architectures, based on different ways of dividing the work of constraint solving between web server and web client. Finally, we describe an implementation of a prototype constraintbased web authoring system and viewer, which also provides constraint-based embedded applets.
{"title":"Constraints for the web","authors":"A. Borning, Richard Kuang-Hsu Lin, K. Marriott","doi":"10.1145/266180.266361","DOIUrl":"https://doi.org/10.1145/266180.266361","url":null,"abstract":"Constraints can be used to specify the desired layout of a web document, and also the behaviour of embedded applets. We present a system architecture in which both the author and the viewer can impose page layout constraints, some required and some preferential. The final appearance of the web page is thus the result of negotiation between author and viewer, where this negotiation is carried out by solving the set of required and preferential constraints imposed by both parties. We identify two plausible system architectures, based on different ways of dividing the work of constraint solving between web server and web client. Finally, we describe an implementation of a prototype constraintbased web authoring system and viewer, which also provides constraint-based embedded applets.","PeriodicalId":250198,"journal":{"name":"MULTIMEDIA '97","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121849997","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}
Current Internet multicast conferencing tools treat all sources with equal importance in that they either statically allocate a fixed bandwidth to each source in a session, or they automatically adapt each source’s transmission rate independently of all other sources. But not all sources are of equal interest to all receivers. We believe that to effectively support human to human communication, this disparity in receiver interest should be reflected in the rate-adaptation process. To this end, we propose a protocol called “SCUBA” that enables media sources to intelligently account for receiver interest in their rate-adjustment algorithms. SCUBA is orthogonal to and complements existing rate-adaptation schemes and can interoperate with either senderor receiverdirected control systems. To scale the SCUBA protocol with multicast session size, we decouple the receiver-feedback process from the session size through sampling. This approach introduces a “tunable” tradeoff between convergence time and sampling accuracy that for large sessions is solely dependent on the control traffic bandwidth. In addition to its applicability in video conferencing, our control scheme can be combined with media transcoders to intelligently manage a bottleneck link at a well-known and fixed location in the network. We implemented SCUBA within our video conferencing tool vie and our media gateway rtpgw and feedback from their preliminary deployment indicates that the efficacy of the overall multimedia communication system has been greatly enhanced.
{"title":"Receiver-driven bandwidth adaptation for light-weight sessions","authors":"E. Amir, S. McCanne, R. Katz","doi":"10.1145/266180.266395","DOIUrl":"https://doi.org/10.1145/266180.266395","url":null,"abstract":"Current Internet multicast conferencing tools treat all sources with equal importance in that they either statically allocate a fixed bandwidth to each source in a session, or they automatically adapt each source’s transmission rate independently of all other sources. But not all sources are of equal interest to all receivers. We believe that to effectively support human to human communication, this disparity in receiver interest should be reflected in the rate-adaptation process. To this end, we propose a protocol called “SCUBA” that enables media sources to intelligently account for receiver interest in their rate-adjustment algorithms. SCUBA is orthogonal to and complements existing rate-adaptation schemes and can interoperate with either senderor receiverdirected control systems. To scale the SCUBA protocol with multicast session size, we decouple the receiver-feedback process from the session size through sampling. This approach introduces a “tunable” tradeoff between convergence time and sampling accuracy that for large sessions is solely dependent on the control traffic bandwidth. In addition to its applicability in video conferencing, our control scheme can be combined with media transcoders to intelligently manage a bottleneck link at a well-known and fixed location in the network. We implemented SCUBA within our video conferencing tool vie and our media gateway rtpgw and feedback from their preliminary deployment indicates that the efficacy of the overall multimedia communication system has been greatly enhanced.","PeriodicalId":250198,"journal":{"name":"MULTIMEDIA '97","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115230338","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}
In order to support multiple real time applications on a sin gle platform the operating system must provide Quality of Service QoS guarantees so that the system resources can be provisioned among applications to achieve desired levels of predictable performance The traditional QoS pa rameters include fairness delay and throughput In this paper we introduce a new QoS criterion called cumulative service The cumulative service criterion relates the total service obtained by a process under a scheduling policy to the ideal service that the process would have accumulated by executing on each resource at a reserved rate We say that a scheuling policy provides a cumulative service guar antee if the performance of the real system di ers from the ideal system by at most a constant amount A cumulative service guarantee is vital for applications e g a continous media le service that require multiple resources and de mand predictable aggregated throughput over all these re sources Existing scheduling algorithms that guarantee tra ditional QoS paramaters do not provide cumulative service guarantees We present a new scheduling algorithm called Move To Rear List Scheduling which provides a cumulative service guarantee as well as the traditional guarantees such as fairness proportional sharing and bounded delay The complexity of MTR LS is O ln n where n is the number
为了在单一平台上支持多个实时应用程序，操作系统必须提供服务质量QoS保证，以便系统资源可以在应用程序之间进行配置，以达到期望的可预测性能水平。传统的QoS参数包括公平性、延迟和吞吐量。本文引入了一个新的QoS标准，称为累积服务，累积服务标准涉及进程在a下获得的总服务调度策略的理想服务过程会对每个资源积累通过执行速度保留我们说scheuling政策提供了一个累积服务瓜尔保证如果真实系统的性能迪人的理想系统最多一个常数累计服务保障是至关重要的应用程序数量e g连续媒体le服务需要多个资源和需求预测的聚合对所有这些资源现有吞吐量本文提出了一种新的调度算法Move To Rear List scheduling，该算法在提供公平性、比例共享和有界延迟等传统调度保证的同时，也提供了累积的服务保证
{"title":"Move-to-rear list scheduling: a new scheduling algorithm for providing QoS guarantees","authors":"J. Bruno, E. Gabber, Banu Özden, A. Silberschatz","doi":"10.1145/266180.266336","DOIUrl":"https://doi.org/10.1145/266180.266336","url":null,"abstract":"In order to support multiple real time applications on a sin gle platform the operating system must provide Quality of Service QoS guarantees so that the system resources can be provisioned among applications to achieve desired levels of predictable performance The traditional QoS pa rameters include fairness delay and throughput In this paper we introduce a new QoS criterion called cumulative service The cumulative service criterion relates the total service obtained by a process under a scheduling policy to the ideal service that the process would have accumulated by executing on each resource at a reserved rate We say that a scheuling policy provides a cumulative service guar antee if the performance of the real system di ers from the ideal system by at most a constant amount A cumulative service guarantee is vital for applications e g a continous media le service that require multiple resources and de mand predictable aggregated throughput over all these re sources Existing scheduling algorithms that guarantee tra ditional QoS paramaters do not provide cumulative service guarantees We present a new scheduling algorithm called Move To Rear List Scheduling which provides a cumulative service guarantee as well as the traditional guarantees such as fairness proportional sharing and bounded delay The complexity of MTR LS is O ln n where n is the number","PeriodicalId":250198,"journal":{"name":"MULTIMEDIA '97","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129646942","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}
Browsing is a fundamental function in multimedia systems. This paper presents PanoramaExcerpts a video browsing interface that shows a catalogue of two types of video icons: panoramic and keyframe icons. A panoramic icon is synthesized from a video segment taken with camera pan or tilt, and extracted using a camera operation estimation technique. A keyframe icon is extracted to supplement the panoramic icons; a shot-change detection algorithm is used. A panoramic icon represents the entire visible contents of a scene extended with camera pan or tilt, which is difficult to summarize using a single keyframe. For the automatic generation of PanoramaExcerpts, we propose an approach to integrate the following: (a) a shot-change detection method that detects instantaneous cuts as well as dissolves, with adaptive control over the sampling rate for efficient processing; (b) a method for locating segments that contain smooth camera pans or tilts, from which the panoramic icons can be synthesized; and (c) a layout method for packing icons in a space-efficient manner. We also describe the experimental results of the above three methods and the potential applications of PanoramaExcerpts.
{"title":"PanoramaExcerpts: extracting and packing panoramas for video browsing","authors":"Y. Taniguchi, Akihito Akutsu, Yoshinobu Tonomura","doi":"10.1145/266180.266396","DOIUrl":"https://doi.org/10.1145/266180.266396","url":null,"abstract":"Browsing is a fundamental function in multimedia systems. This paper presents PanoramaExcerpts a video browsing interface that shows a catalogue of two types of video icons: panoramic and keyframe icons. A panoramic icon is synthesized from a video segment taken with camera pan or tilt, and extracted using a camera operation estimation technique. A keyframe icon is extracted to supplement the panoramic icons; a shot-change detection algorithm is used. A panoramic icon represents the entire visible contents of a scene extended with camera pan or tilt, which is difficult to summarize using a single keyframe. For the automatic generation of PanoramaExcerpts, we propose an approach to integrate the following: (a) a shot-change detection method that detects instantaneous cuts as well as dissolves, with adaptive control over the sampling rate for efficient processing; (b) a method for locating segments that contain smooth camera pans or tilts, from which the panoramic icons can be synthesized; and (c) a layout method for packing icons in a space-efficient manner. We also describe the experimental results of the above three methods and the potential applications of PanoramaExcerpts.","PeriodicalId":250198,"journal":{"name":"MULTIMEDIA '97","volume":"145 38","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120971567","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}
G. Parulkar, L. Rowe, D. Hutchison, J. Walpole, Raj Yavatkar
This panel is motivated by three emerging trends: (1) multimedia applications represent an important class ‘of distributed and networking applications; (2) middleware has become a valuable software layer/system which allows users to develop large complex distributed applications without having to deal with details of underlying networking and operating system; and (3) object-oriented methodology has matured to the point that it has become a De-facto standard for software design and development. The last two trends also explain rapidly increasing commercial interest in OMG’s proposed middleware standard Common Object Request Broker Architecture (CORBA) and associated Object Request Broker (ORB) implementations. It is claimed that distributed object oriented middleware eliminates many tedious, error-prone and non-portable aspects of developing and maintaining distributed applications by automating common network programming tasks such as object location, object activation, parameter marshaling, fault recovery, and security. These three trends together motivate a need for an Object-Oriented middleware that can especially support distributed and networked multimedia applications. Several groups have already initiated efforts aimed at extending CORBA and associated ORBS to make them more suitable for multimedia applications. Others argue that multimedia applications have different requirements in that they require periodic processing and transmission of continuous streams of data, and that CORBA is the wrong middleware to extend for distributed multimedia applications.
{"title":"Middleware for distributed multimedia (panel): need a new direction?","authors":"G. Parulkar, L. Rowe, D. Hutchison, J. Walpole, Raj Yavatkar","doi":"10.1145/266180.266385","DOIUrl":"https://doi.org/10.1145/266180.266385","url":null,"abstract":"This panel is motivated by three emerging trends: (1) multimedia applications represent an important class ‘of distributed and networking applications; (2) middleware has become a valuable software layer/system which allows users to develop large complex distributed applications without having to deal with details of underlying networking and operating system; and (3) object-oriented methodology has matured to the point that it has become a De-facto standard for software design and development. The last two trends also explain rapidly increasing commercial interest in OMG’s proposed middleware standard Common Object Request Broker Architecture (CORBA) and associated Object Request Broker (ORB) implementations. It is claimed that distributed object oriented middleware eliminates many tedious, error-prone and non-portable aspects of developing and maintaining distributed applications by automating common network programming tasks such as object location, object activation, parameter marshaling, fault recovery, and security. These three trends together motivate a need for an Object-Oriented middleware that can especially support distributed and networked multimedia applications. Several groups have already initiated efforts aimed at extending CORBA and associated ORBS to make them more suitable for multimedia applications. Others argue that multimedia applications have different requirements in that they require periodic processing and transmission of continuous streams of data, and that CORBA is the wrong middleware to extend for distributed multimedia applications.","PeriodicalId":250198,"journal":{"name":"MULTIMEDIA '97","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115768735","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}
In this paper, we propose a method that reduces the computational requirements of the encoder, while still upholding picture fidelity and remaining compatible with the H.263 bitstream standard. Our method is motivated by our observation that, often, a substantial number of inter-macroblocks in the encoder are reduced to all-zero values after quantization. We have developed a method of predicting when those macroblocks will quantize to zeros, which in turn allows us to eliminate the computation that would normally be required for those macroblocks. For our performance studies, we utilized the latest software version of H.263 written by Telenor Permission 10 t~~~ke digit:dhrd copies ofnll or pa11 ofthis mnterinl for
{"title":"Performance enhancement of H.263 encoder based on zero coefficient prediction","authors":"A. Yu, R. Lee, M. Flynn","doi":"10.1145/266180.266326","DOIUrl":"https://doi.org/10.1145/266180.266326","url":null,"abstract":"In this paper, we propose a method that reduces the computational requirements of the encoder, while still upholding picture fidelity and remaining compatible with the H.263 bitstream standard. Our method is motivated by our observation that, often, a substantial number of inter-macroblocks in the encoder are reduced to all-zero values after quantization. We have developed a method of predicting when those macroblocks will quantize to zeros, which in turn allows us to eliminate the computation that would normally be required for those macroblocks. For our performance studies, we utilized the latest software version of H.263 written by Telenor Permission 10 t~~~ke digit:dhrd copies ofnll or pa11 ofthis mnterinl for","PeriodicalId":250198,"journal":{"name":"MULTIMEDIA '97","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128371733","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}
We describe a novel system “3DSketch” which demonstrates a two-handed 31) sketching paradigm for 3D modeling by casually digitizing an existing object. The conceptual model of the interface is based on the everyday experience in sketching with a pen on a piece of paper, but in our system, the user holds a 3D digitizing stylus as a 3D pen to sketch in 3D space. We call the pen a “smart pen”, since in the Prototyper module, the userjust sketches a few strokes on the object, and immediately sees a 3D prototype made of clay lumps; then, in the Retiner module, when the user adds more random strokes over the object, the prototype surface automatically adapts to follow the pen, and the surface features (edges and comers) dig21 with the user specified ones, as if the pen tip applied magnetic attractive force to the prototype: in the autoTracer module, the user sketches over smooth regions, and the system performs intelligent reasoning to infer smooth surfaces, and also extract discontinuity edges and comers from the user’s inaccurate and fragmented strokes. The internal surface representation is triangular splines (TriBezier, TriB, TYiNURElS), whose advantages in arbitrary triangulation and local subdivision make it flexible to model general surfaces.
{"title":"3DSketch: modeling by digitizing with a smart 3D pen","authors":"Song Han, G. Medioni","doi":"10.1145/266180.266331","DOIUrl":"https://doi.org/10.1145/266180.266331","url":null,"abstract":"We describe a novel system “3DSketch” which demonstrates a two-handed 31) sketching paradigm for 3D modeling by casually digitizing an existing object. The conceptual model of the interface is based on the everyday experience in sketching with a pen on a piece of paper, but in our system, the user holds a 3D digitizing stylus as a 3D pen to sketch in 3D space. We call the pen a “smart pen”, since in the Prototyper module, the userjust sketches a few strokes on the object, and immediately sees a 3D prototype made of clay lumps; then, in the Retiner module, when the user adds more random strokes over the object, the prototype surface automatically adapts to follow the pen, and the surface features (edges and comers) dig21 with the user specified ones, as if the pen tip applied magnetic attractive force to the prototype: in the autoTracer module, the user sketches over smooth regions, and the system performs intelligent reasoning to infer smooth surfaces, and also extract discontinuity edges and comers from the user’s inaccurate and fragmented strokes. The internal surface representation is triangular splines (TriBezier, TriB, TYiNURElS), whose advantages in arbitrary triangulation and local subdivision make it flexible to model general surfaces.","PeriodicalId":250198,"journal":{"name":"MULTIMEDIA '97","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127748983","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
扫码关注我们
求助内容：
应助结果提醒方式：