نتایج جستجو برای: frame algorithm

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

Journal: :sahand communications in mathematical analysis 2015
mehdi rashidi-kouchi akbar nazari

in this paper we proved that every g-riesz basis for hilbert space $h$ with respect to $k$ by adding a condition is a riesz basis for hilbert $b(k)$-module $b(h,k)$. this is an extension of [a. askarizadeh,m. a. dehghan, {em g-frames as special frames}, turk. j. math., 35, (2011) 1-11]. also, we derived similar results for g-orthonormal and orthogonal bases. some relationships between dual fram...

2016
Won-Dong Jang Chang-Su Kim

An online video segmentation algorithm, based on short-term hierarchical segmentation (STHS) and frame-by-frame Markov random field (MRF) optimization, is proposed in this work. We develop the STHS technique, which generates initial segments by sliding a short window of frames. In STHS, we apply spatial agglomerative clustering to each frame, and then adopt inter-frame bipartite graph matching ...

2014
Saad Nsaif Jong-Myung Rhee

The high-availability seamless redundancy (HSR) protocol, a potential candidate for substation automation system (SAS) networks, provides duplicated frame copies of each sent frame, with zero fault-recovery time. This means that even in the case of node or link failure, the destination node will receive at least one copy of the sent frame. Consequently, there is no network operation down time. ...

  The unprecedented growth of competition in the banking technology has raised the importance of retaining current customers and acquires new customers so that is important analyzing Customer behavior, which is base on bank databases. Analyzing bank databases for analyzing customer behavior is difficult since bank databases are multi-dimensional, comprised of monthly account records and daily t...

B. Vababzadeh, Ch Gheyratmand, S. Gholizadeh ,

A new meta-heuristic algorithm is proposed for optimal design of reinforced concrete (RC) frame structures subject to combinations of gravity and lateral static loads based on ACI 318-08 design code. In the present work, artificial bee colony algorithm (ABCA) is focused and an improved ABCA (IABCA) is proposed to achieve the optimization task. The total cost of the RC frames is minimized during...

B. Kamali Janfada, M. R. Ghasemi,

This paper proposes a GA-based reduced search space technique (GA-RSS) for the optimal design of steel moment frames. It tries to reduce the computation time by focusing the search around the boundaries of the constraints, using a ranking-based constraint handling to enhance the efficiency of the algorithm. This attempt to reduce the search space is due to the fact that in most optimization pro...

Journal: :Briefings in bioinformatics 2002
M. V. Baytaluk Mikhail S. Gelfand Andrey A. Mironov

It is known that while the programs used to find genes in prokaryotic genomes reliably map protein-coding regions, they often fail in the exact determination of gene starts. This problem is further aggravated by sequencing errors, most notably insertions and deletions leading to frame-shifts. Therefore, the exact mapping of gene starts and identification of frame-shifts are important problems o...

2015
Kai Xiang Shihong Chen Yuanyuan Zeng

In this paper, we propose an improved frame error concealment algorithm for TCX-based audio coders in order to improve the quality of decoded audio at the receiver. Conventional TCX-based frame error concealment algorithms in the AMR-WB+ audio codec are usually unable to adaptively adjust gain control according to changes in the magnitude of the correct frame before lost frames. Thus, we propos...

2002
Janko Calic Ebroul Izquierdo

Content based video indexing and retrieval has its foundations in the analyses of the prime video temporal structures. Consequently, technologies for video segmentation and key-frame extraction have become crucial for the development of advanced digital video systems. Conventional algorithms for video partitioning and keyframe extraction are mainly implemented autonomously. By focusing the anal...

1998
Kjersti Engan Sven Ole Aase John Håkon Husøy

A technique for designing frames to use with vector selection algorithms, for example Matching Pursuits (MP), is presented. The design algorithm is iterative and requires a training set of signal vectors. An MP algorithm chooses frame vectors to approximate each training vector. Each vector in the frame is then adjusted by using the residuals for the training vectors which used that particular ...

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

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