检索结果-内蒙古大学图书馆

International Conference on computer Vision (ICCV)

作者： Simakov Frolova Basri Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

We present a method for shape reconstruction from several images of a moving object. The reconstruction is dense (up to image resolution). The method assumes that the motion is known, e.g., by tracking a small number of feature points on the object. The object is assumed Lambertian (completely matte), light sources should not be very close to the object but otherwise arbitrary, and no knowledge of lighting conditions is required. An object changes its appearance significantly when it changes its orientation relative to light sources, causing violation of the common brightness constancy assumption. While a lot of effort is devoted to deal with this violation, we demonstrate how to exploit it to recover 3D structure from 2D images. We propose a new correspondence measure that enables point matching across views of a moving object. The method has been tested both on computer simulated examples and on a real object.

关键词： Shape Image reconstruction Brightness Light sources Stereo vision Information resources Cameras Calibration computer science Image resolution

来源：评论

学校读者我要写书评

暂无评论

Degeneracies, dependencies and their implications in multi-body and multi-sequence factorizations

Degeneracies, dependencies and their implications in multi-b...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： L. Zelnik-Manor M. Irani Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

The body of work on multi-body factorization separates between objects whose motions are independent. In this work we show that in many cases objects moving with different 3D motions will be captured as a single object using these approaches. We analyze what causes these degeneracies between objects and suggest an approach for overcoming some of them. We further show that in the case of multiple sequences linear dependencies can supply information for temporal synchronization of sequences and for spatial matching of points across sequences.

关键词： Layout Character generation Cameras Shape Bismuth computer science Subspace constraints Video sequences Stacking

来源：评论

学校读者我要写书评

暂无评论

Determining a scene's atmosphere by film grammar rules

Determining a scene's atmosphere by film grammar rules

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： A. Aner-Wolf Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

A new approach for bridging over the semantic gap is presented. This approach is based solely on the extraction of low-level illumination features, and by using well defined film rules regarding scene lighting, it generates high level semantic descriptors for scenes. These illumination descriptors could be further combined with other descriptors like motion and shot tempo, to generate a more complete automatic semantic analysis of video media.

关键词： Atmosphere Layout Lighting Motion analysis Mood computer science Rhythm Atmospheric modeling Art Eyes

来源：评论

学校读者我要写书评

暂无评论

On the (In)security of the Fiat-Shamir paradigm

On the (In)security of the Fiat-Shamir paradigm

引用

Annual IEEE Symposium on Foundations of computer science

作者： S. Goldwasser Y.T. Kalai Department of Computer Science and Electrical Engineering Massachusetts Institute of Technology USA Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

In 1986, Fiat and Shamir proposed a general method for transforming secure 3-round public-coin identification schemes into digital signature schemes. The idea of the transformation was to replace the random message of the verifier in the identification scheme, with the value of some deterministic hash function evaluated on various quantities in the protocol and on the message to be signed. The Fiat-Shamir methodology for producing digital signature schemes quickly gained popularity as it yields efficient and easy to implement digital signature schemes. The most important question however remained open: are the digital signatures produced by the Fiat-Shamir methodology secure? We answer this question negatively. We show that there exist secure 3-round public-coin identification schemes for which the Fiat-Shamir transformation yields insecure digital signature schemes for any hash function used by the transformation. This is in contrast to the work of Pointcheval and Stern which proved that the Fiat-Shamir methodology always produces digital signatures secure against chosen message attack in the "Random Oracle Model" - when the hash function is modeled by a random oracle. Among other things, we make new usage of Barak's technique for taking advantage of nonblack-box access to a program, this time in the context of digital signatures.

关键词： Digital signatures Protocols computer science Law Legal factors Cryptography Design methodology computer security Forgery Cost function

来源：评论

学校读者我要写书评

暂无评论

Direct methods for matrix Sylvester and Lyapunov equations

引用

Journal of applied mathematics 2003年第6期2003卷 277-303页

作者： Sorensen, Danny C. Zhou, Yunkai Department of Computational and Applied Mathematics Rice University Houston TX 77005-1892 United States Department of Computational and Applied Mathematics Rice University Houston TX 77005-1892 United States Argonne National Laboratory Math and Computer Science Division Argonne IL 60439 United States

We revisit the two standard dense methods for matrix Sylvester and Lyapunov equations: The Bartels-Stewart method for A1X+XA2+D=0 and Hammarling's method for AX+XAT+BBT=0 with A stable. We construct three schemes for solving the unitarily reduced quasitriangular systems. We also construct a new rank-1 updating scheme in Hammarling's method. This new scheme is able to accommodate a B with more columns than rows as well as the usual case of a B with more rows than columns, while Hammarling's original scheme needs to separate these two cases. We compared all of our schemes with the Matlab Sylvester and Lyapunov solver lyap.m;the results show that our schemes are much more efficient. We also compare our schemes with the Lyapunov solver sllyap in the currently possibly the most efficient control library package SLICOT;numerical results show our scheme to be competitive. © 2003 Hindawi Publishing Corporation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A novel robust adaptive fuzzy controller

A novel robust adaptive fuzzy controller

引用

Proceedings of the 4th World Congress on Intelligent Control and Automation

作者： Liu, Xiaohua Wang, Xiuhong Fen, Enmin Dept. of Math. and Computer Science Yantai Normal University Yantai 264025 China Department of Applied Mathematics Dalian University of Technology Dalian 112064 China

ISBN: (纸本)0780372689

For a class of continuous - time nonlinear system, a novel robust adaptive fuzzy controller is proposed by using of Lyapunov method. It is proven that the control algorithm is globally stable, the output tracking - error of the system can convergence to a domain of zero under the assumptions. As a result, the system controled has stronger robustness for disturbance and modeling error.

关键词： Fuzzy control

来源：评论

学校读者我要写书评

暂无评论

Arbitrary source models and Bayesian codebooks in rate-distortion theory

Arbitrary source models and Bayesian codebooks in rate-disto...

引用

IEEE International Symposium on Information Theory

作者： L. Kontoyiannis Junshan Zhang Division of Applied Math & Department of Computer Science Brown University USA Department of Electrical Engineering Arizona State University USA

We give a development of universal lossy data compression based on a lossy version of the Kraft inequality. As an application, we evaluate the performance of universal mixture codebooks.

关键词： Bayesian methods Rate-distortion Distortion measurement Decoding World Wide Web Loss measurement computer science Data compression Application software Probability distribution

来源：评论

学校读者我要写书评

暂无评论

Asynchronous resource discovery in peer to peer networks

Asynchronous resource discovery in peer to peer networks

引用

Reliable Distributed Systems

作者： S. Kutten D. Peleg Faculty of Industrial Engineering & Management Technion-Israel Institute of Technology Haifa Israel Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

The resource discovery problem arises in the context of peer to peer (P2P) networks, where at any point of time a peer may be placed at or removed from any location over a general purpose network (e.g., an Internet site). A vertex (peer) can communicate with another vertex directly if and only if it knows a certain routing information to that other vertex. Hence, it is critical for peers to convey this routing information to each other. The problem was formalized by Harchol-Balter et al. (1999). The routing information needed for a vertex to reach another peer is that peer's identifier (e.g., IP address). A logical directed edge represents the fact that the peer at the tail of the edge knows the IP address of the one at its head. A number of algorithms were developed by Harchol-Balter et al. for this problem in the model of a synchronous network over a weakly connected directed graph. The best of these algorithms was randomized. Subsequently, a deterministic algorithm for the problem on synchronous networks with improved complexity was presented by Kutten et al. (2001). The current paper extends this deterministic algorithm to the environment of asynchronous networks, maintaining similar complexities (translated to the asynchronous model). These are lower than the complexities that would be needed to synchronize the system. The main technical difficulty in a directed, weakly connected system is to ensure that vertices take consistent steps, even if their knowledge about each other is not symmetric, and even if there is no timeout mechanism (which does exist in synchronous systems) to assist in that.

关键词： Intelligent networks Routing Web server IP networks Context Tail Peer to peer computing Internet computer industry computer network management

来源：评论

学校读者我要写书评

暂无评论

Parallel coin-tossing and constant-round secure two-party computation

引用

21st Annual International Cryptology Conference, CRYPTO 2001

作者： Lindell, Yehuda Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

ISBN: (纸本)3540424563

In this paper we show that any two-party functionality canbe securely computed in a constant number of rounds, where security isobtained against malicious adversaries that may arbitrarily deviate fromthe protocol specification. This is in contrast to Yao's constant-roundprotocol that ensures security only in the face of semi-honest adversaries,and to its malicious adversary version that requires a polynomial numberof *** order to obtain our result, we present a constant-round protocol forsecure coin-tossing of polynomially many coins (in parallel). We thenshow how this protocol can be used in conjunction with other existingconstructions in order to obtain a constant-round protocol for securelycomputing any two-party functionality. On the subject of coin-tossing,we also present a constant-round perfect coin-tossing protocol, where by"perfect" we mean that the resulting coins are guaranteed to be statis-tically close to uniform (and not just pseudorandom). © Springer-Verlag Berlin Heidelberg 2001.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Session-key generation using human passwords only

引用

21st Annual International Cryptology Conference, CRYPTO 2001

作者： Goldreich, Oded Lindell, Yehuda Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

ISBN: (纸本)3540424563

We present session-key generation protocols in a model where the legitimate parties share only a human-memorizable password. The security guarantee holds with respect to probabilistic polynomial-time adversaries that control the communication channel (between the parties), and may omit, insert and modify messages at their choice. Loosely speaking, the effect of such an adversary that attacks an execution of our protocol is comparable to an attack in which an adversary is only allowed to make a constant number of queries of the form "is w the password of Party A". We stress that the result holds also in case the passwords are selected at random from a small dictionary so that it is feasible (for the adversary) to scan the entire directory. We note that prior to our result, it was not clear whether or not such protocols were attainable without the use of random oracles or additional setup assumptions. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：