Commun. Inf. Syst.最新文献_第10页

Wide-Sense Estimation on the Special Orthogonal Group 特殊正交群的广义估计

Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/CIS.2008.V8.N3.A1

A. Chiuso, G. Picci, Stefano Soatto

引用次数: 28

Indefinite stochastic LQ controls with Markovian jumps in a finite time horizon 有限时间范围内马尔可夫跳变的不定随机LQ控制

Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/CIS.2002.V2.N3.A4

Xun Li, X. Zhou

引用次数: 44

Invariants of pseudo-random number generators 伪随机数生成器的不变量

Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/CIS.2008.V8.N1.A3

C. Martin, Mara D. Neusel

引用次数: 0

Multi-foreground objects segmentation based on RGB-D image 基于RGB-D图像的多前景目标分割

Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/cis.2023.v23.n1.a2

Yan Li, Di Zhu, Hui Chen, Jing Nie, Jiaju Liu, Changhe Tu, Haikun Li

{"title":"Multi-foreground objects segmentation based on RGB-D image","authors":"Yan Li, Di Zhu, Hui Chen, Jing Nie, Jiaju Liu, Changhe Tu, Haikun Li","doi":"10.4310/cis.2023.v23.n1.a2","DOIUrl":"https://doi.org/10.4310/cis.2023.v23.n1.a2","url":null,"abstract":"Silhouette extraction of foreground objects appears frequently in various real-world applications, such as Advanced Driving Assistant System, Intelligent Monitoring System, and movie production. Plenty of solutions have been developed to extract silhouette in RGB image with only color information. Since those color based silhouette extraction methods still have difficulties to separate overlapping foreground objects and eliminate excessive segmentation, this paper proposes a novel object segmentation method using color and depth information in RGB-D images. Firstly, we remove the ground plane using the normal map of depth image. Secondly, to separate foreground objects at different distances completely and correctly, the deep Residual Network (ResNets) and Otsu’s multi-thresholding method are combined to divide the depth image into multiple layers. Each depth layer contains only one foreground object or objects at same distance. Finally the outline of foreground object is extracted directly from its depth layer, and refined with color information. Experimental results demonstrate that our method has a better performance than those using color or depth information only, and extracts more types of objects than neural networks.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125231801","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}

引用次数: 0

Layered black-box, behavioral interconnection perspective and applications to problems in communications, Part II: stationary sources satisfying $psi$-mixing criterion 分层黑箱，行为互连视角及其在通信问题中的应用，第二部分:满足$psi$混合准则的固定源

Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/CIS.2017.V17.N4.A2

Mukul Agarwal, S. Mitter, A. Sahai

引用次数: 1

Contact detection algorithm for needle puncturing robot 刺针机器人的接触检测算法

Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/cis.2022.v22.n4.a3

T. Matsuno, N. Kido, T. Kamegawa, Takao Hiraki, T. Fukuda

引用次数: 0

Asymptotic behavior of minima and mountain pass solutions for a class of Allen-Cahn models 一类Allen-Cahn模型的最小解和山口解的渐近性质

Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/CIS.2013.V13.N1.A3

Jaeyoung Byeon, P. Rabinowitz

{"title":"Asymptotic behavior of minima and mountain pass solutions for a class of Allen-Cahn models","authors":"Jaeyoung Byeon, P. Rabinowitz","doi":"10.4310/CIS.2013.V13.N1.A3","DOIUrl":"https://doi.org/10.4310/CIS.2013.V13.N1.A3","url":null,"abstract":"where G(u) = u2(1 − u)2 is a double well potential, ε > 0, and Aε(x) = 1+A(x)/ε with 0 ≤ A ∈ C1(Rn), 1−periodic in x1, · · · , xn, Ω is the support of A|[0,1]n and has a smooth boundary, and Ω ⊂ (0, 1)n. A main result of [9] is that there is an ε0 > 0 such that for any finite set T ⊂ Zn and ε ∈ (0, ε0], (1.1) has a solution, Uε,T with 0 < Uε,T < 1, Uε,T is near 1 on A T ≡ T +Ω and near 0 on BT ≡ (ZnT )+Ω. Moreover as ε → 0, Uε,T → 1 uniformly on AT and Uε,T → 0 uniformly on BT . When T is finite, Uε,T is characterized as the minimizer of a constrained variational problem associated with (1.1). Although Uε,T may not be unique, the set of such minimizers, Mε(T ), is ordered. The setting of [9] was further treated in [10] where it was shown that for each finite T , there is an ε1(T ) > 0 such that for ε ∈ (0, ε1(T )), (1.1) has a solution, Vε,T of mountain pass type with 0 < Vε,T < Uε,T . The main goal of this note is to study the setting of when T is finite and consists of two widely separated subsets, that is, T = T1 ∪ (l + T2) ≡ Tl for T1, T2 ⊂ Zn, l ∈ Zn and large |l| > 0. In particular we are interested in the asymptotic behavior as l → ∞ of the minimizers, Uε,Tl , and the mountain pass solutions, as well as the corresponding critical values. To describe our","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134310120","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}

引用次数: 6

Computation of curvatures using conformal parameterization 用保形参数化计算曲率

Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/CIS.2008.V8.N1.A1

Jeffrey Kwan, L. Lui, Yalin Wang, S. Yau

引用次数: 7

Code and parse tree for lossless source encoding 代码和解析树无损源编码

Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/CIS.2001.V1.N2.A1

J. Abrahams

{"title":"Code and parse tree for lossless source encoding","authors":"J. Abrahams","doi":"10.4310/CIS.2001.V1.N2.A1","DOIUrl":"https://doi.org/10.4310/CIS.2001.V1.N2.A1","url":null,"abstract":"This paper surveys the theoretical literature on fixed-to-variable-length lossless source code trees, called code trees, and on variable-length-to-fixed lossless sounce code trees, called parse trees. Huffman coding [ l ] is the most well known code tree problem, but there are a number of interesting variants of the problem formulation which lead to other combinatorial optimization problems. Huffman coding as an instance of combinatorial search has been highlighted in the books by Ahlswede and Wegener [2] and Aigner [3]. See also the papers of Hinderer and Stieglitz [4] and Hassin and Henig [5] for overviews of the combinatorial search literature. Tunstall parsing [6] is the most well known parse tree problem for a probability-based source model, although parsing based directly on source data is very familiar as Lempel Ziv parsing [7-81, a family of techniques which is outside the scope of this survey. Similarly, adaptive, data-based variants of Huffman coding, e.g. [9-1:2] will not be treated here. Rather, the assumption here is that the source model is given as a sequence of independent and identically distributed (iid) random variables for some known discrete distribution, although on occasion it is possible that only partial information about the source is available. These lossless source encoding techniques comprise a subset of data compression techniques, and broader surveys of the data compression literature are available [ 13-21].","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133365581","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}

引用次数: 54

ZMP-based fall prevention assist for lower-limb exoskeletons during dynamic walking 基于zmp的跌倒预防辅助下肢外骨骼在动态行走

Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/cis.2022.v22.n4.a4

Oybek Rashidov, K. Kiguchi

引用次数: 0