نتایج جستجو برای: character space

تعداد نتایج: 559453  

2012
Nicholas C. Firth Nathan Brown Julian Blagg

We describe a computational method, plane of best fit (PBF), to quantify and characterize the 3D character of molecules. This method is rapid and amenable to analysis of large diverse data sets. We compare PBF with alternative literature methods used to assess 3D character and apply the method to diverse data sets of fragment-like, drug-like, and natural product compound libraries. We show that...

2005
Lijuan Wang Yong Zhao Min Chu Yining Chen Frank Soong Zhigang Cao

In this paper, an audio-book, in which a professional voice talent performs multiple characters, is exploited to investigate the expressiveness of speech. The expressive speech space of the sole speaker is explored by finding the distances between acoustic models of multiple characters and the perceived proximity between their speech utterances. Using the speech of ten characters as test data, ...

Journal: :CoRR 2018
Jean Cardinal Timothy M. Chan John Iacono Stefan Langerman Aurélien Ooms

For most algorithms dealing with sets of points in the plane, the only relevant information carried by the input is the combinatorial configuration of the points: the orientation of each triple of points in the set (clockwise, counterclockwise, or collinear). This information is called the order type of the point set. In the dual, realizable order types and abstract order types are combinatoria...

2007
Hubert Cecotti Abdel Belaïd

In this paper we present a new method for fusing classifiers output for problems with a number of classes M > 2. We extend the well-known Behavior Knowledge Space method with a hierarchical approach of the different cells. We propose to add the ranking information of the classifiers output for the combination. Each cell can be divided into new sub-spaces in order to solve ambiguities. We show t...

1997
Atsushi Imiya

Gaussian scale-space is considered to be a modern bottom-up tool in computer vision. The Amer-ican and European vision community, however, is unaware of the fact that Gaussian scale-space has already been axiomatically derived in 1959 in a Japanese paper by Taizo Iijima. This result formed the starting point of an entire world of linear scale-space research in Japan ranging from various axiomat...

2005
S. Nomura T. Shiose H. Kawakami O. Katai K. Yamanaka

In this paper we propose “sound visualization” which provides a learning process for listeners considered as perceptual systems to perceive “character-related” sounds in a virtual 3D acoustic space. “Character-related” sound represents the most appropriate sound event to be perceived (“read”) even by the visually impaired. The test data (characters) used in our experiments were segmented from d...

1969
Shou-chuan Yang Charlotte W. Yang

' ABSTRACT O A major harrier to the human communication is attributed to the fact that there is no compatible typewriter, as in the Western World, for any non-alphabetic language outside of the Western World. This paper~11 describe how a plotter can be used through programming, as a universal graphic character writer for all non-alphabetic as well as alphabetic languages in place of the typewri...

Journal: :EURASIP J. Adv. Sig. Proc. 2013
Andrej Ikica Peter Peer

In this article, we propose a novel stroke width transform (SWT) voting-based color reduction method for detecting text in natural scene images. Unlike other text detection approaches that mostly rely on either text structure or color, the proposed method combines both by supervising text-oriented color reduction process with additional SWT information. SWT pixels mapped to color space vote in ...

1999
Amol Dattatraya Mali Subbarao Kambhampati

Recently, casting planning as propositional satisfiability has been shown to be a very promising technique for plan synthesis. Although encodings based both on statespace planning and on plan-space (causal) planning have been proposed, most implementations and trade-off evaluations primarily use state-based encodings. This is surprising given both the prominence of plan-space planners in tradit...

Journal: :Pattern Recognition Letters 1998
Luisa Micó José Oncina

Ž . Recently some fast methods LAESA and TLAESA have been proposed to find nearest neighbours in metric spaces. The average number of distances computed by these algorithms does not depend on the number of prototypes and they show linear space complexity. These results where obtained through vast experimentation using only artificial data. In this paper, we corroborate this behaviour when appli...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید