• 検索結果がありません。

Message from the Guest Editors-In-Chief

N/A
N/A
Info
ダウンロード
Protected

Academic year: 2021

シェア "Message from the Guest Editors-In-Chief"

Copied!
1
0
0

読み込み中.... (全文を見る)

今ダウンロードする ( 1 ページ )

全文

(1)

IPSJ Transactions on Computer Vision and Applications Vol. 1 82 (Mar. 2009)

Preface

Message from the Guest Editors-In-Chief

Hideo Saito

†1

and In So Kweon

†2

We are happy to issue the special issue of invited papers of MIRU2008, held in July 2008. MIRU is the largest domestic conference in the field of computer vision and pattern recognition in Japan. MIRU maintains a good reputation by continuing to have high quality academic papers presented, which is a result of the peer review effort given by the program committees. Recently, the organizing members of MIRU have tried to make MIRU contain a more international aspect, so that high quality research presented in MIRU will be known to people who share the same research interest outside of Japan.

For example, during MIRU2007, the Area Chairs of ACCV2007 were invited to the special workshop and the main conference of MIRU2007, so that they could enjoy the presentations on Japanese research activities. In addition, the organization committee of MIRU2008 invited Professor Tsuhan Chen (Carnegie Mellon University, now Cornell University), who is one of the leading professors of multimedia, to give the keynote talk of MIRU2008. We also had the MIRU International Workshop on Computer Vision 2008 (MIRU-IWCV2008), in which four distinguished computer vision area researchers were invited to give talks.

In this special issue on IPSJ transactions on Computer Vision and Applications, we are very happy to publish the four invited papers that were contributed by the invited speakers of MIRU2008 and MIRU-IWCV2008. For each submission of the invited papers, we assigned an associate editor and two reviewers to decide the final acceptance. Even though all papers were accepted, the authors gave additional effort to improve the quality of their papers based on the comments

†1 Keio University †2 KAIST

given by the reviewers. Through this review process, we are confident that all the invited papers are of excellent quality and give significant contributions to all the readers in this research field.

We would like to thank all the reviewers and associate editors of the invited papers in this special issue for their efforts in reviewing process.

Guest Editors in Chief:

Hideo Saito Keio University In So Kweon KAIST

参照

今ダウンロードする ( PDF - 1 ページ - 30.00 KB )

関連したドキュメント

Also, we work under a crucial assumption that dictates the memory response in the interior of the domain matches that on the boundary

(4) The basin of attraction for each exponential attractor is the entire phase space, and in demonstrating this result we see that the semigroup of solution operators also admits

We cannot use LAN in the hall

“Breuil-M´ezard conjecture and modularity lifting for potentially semistable deformations after

(3.) In the statement of the criterion

Then it follows immediately from a suitable version of “Hensel’s Lemma” [cf., e.g., the argument of [4], Lemma 2.1] that S may be obtained, as the notation suggests, as the m A

and universality in the matrix model

[Mag3] , Painlev´ e-type differential equations for the recurrence coefficients of semi- classical orthogonal polynomials, J. Zaslavsky , Asymptotic expansions of ratios of

On the Invariant Theory of the B´ ezoutiant

We study the classical invariant theory of the B´ ezoutiant R(A, B) of a pair of binary forms A, B.. We also describe a ‘generic reduc- tion formula’ which recovers B from R(A, B)

(1)ON THE DENSITY OF HAPPY NUMBERS J

After performing a computer search we find that the density of happy numbers in the interval [10 403 , 10 404 − 1] is at least .185773; thus, there exists a 404-strict

On the Distinguishing Features of the Dobrakov Integral

For X-valued vector functions the Dinculeanu integral with respect to a σ-additive scalar measure on P (see Note 1) is the same as the Bochner integral and hence the Dinculeanu

The algorithm appears to run in average time that is softly quadratic and we prove that this is the case for almost all of the steps

But in fact we can very quickly bound the axial elbows by the simple center-line method and so, in the vanilla algorithm, we will work only with upper bounds on the axial elbows..