To see the other types of publications on this topic, follow the link: Bloch frames.
Journal articles on the topic 'Bloch frames'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Bloch frames.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Cornean, Horia D., Domenico Monaco, and Stefan Teufel. "Wannier functions and ℤ2 invariants in time-reversal symmetric topological insulators." Reviews in Mathematical Physics 29, no. 02 (February 2017): 1730001. http://dx.doi.org/10.1142/s0129055x17300011.
Full textAbstract:
We provide a constructive proof of exponentially localized Wannier functions and related Bloch frames in 1- and 2-dimensional time-reversal symmetric (TRS) topological insulators. The construction is formulated in terms of periodic TRS families of projectors (corresponding, in applications, to the eigenprojectors on an arbitrary number of relevant energy bands), and is thus model-independent. The possibility to enforce also a TRS constraint on the frame is investigated. This leads to a topological obstruction in dimension 2, related to [Formula: see text] topological phases. We review several proposals for [Formula: see text] indices that distinguish these topological phases, including the ones by Fu–Kane [16], Prodan [33], Graf–Porta [24] and Fiorenza–Monaco–Panati [27]. We show that all these formulations are equivalent. In particular, this allows to prove a geometric formula for the [Formula: see text] invariant of 2-dimensional TRS topological insulators, originally indicated in [16], which expresses it in terms of the Berry connection and the Berry curvature.
2
Ahmadi, Ahmadi. "Phototactic Response and Morphometric Characteristic of Climbing Perch Anabas testudineus (Bloch, 1792) Under Culture System." Croatian Journal of Fisheries 76, no. 4 (December 1, 2018): 164–73. http://dx.doi.org/10.2478/cjf-2018-0020.
Full textAbstract:
Abstract Phototaxis in climbing perch (Anabas testudineus) was investigated by subjecting fish to LED light traps (blue, green, yellow, orange, red, white) and control (total 13 traps). The trap was constructed of polyamide (PA) nylon monofilament (31.75 mm mesh size), fastened around two wire ring frames (∅ 490 mm) with a net height of 270 mm. A lamp was placed on the bottom of the trap. 96 individuals, consisting of 34 males and 62 females, were analysed. Both continuous and blinking light traps were considerably higher in the number of catch compared to the control. The body size of catch ranged from 76-135 mm TL and 8.00-55.00 g W. The mean YPUEs (yield per unit effort) for male and female were 4.00 ± 2.25 and 7.00 ± 4.50 g trap−1 trial-1, respectively. The CPUEs (catch per unit effort) for continuous, blinking light traps and the control ranged from 0.43 to 0.93, 0.21 to 0.86, and 0.21 fish trap−1night−1, respectively. The mean condition factor (K) values of 2.10 ± 0.40 for males and 2.13 ± 0.34 for females indicate fish with better condition. Positive group responses of fish were more pronounced in the middle size classes between 90 and 109 mm TL. Negative allometric growth pattern (b) (1.7271-1.8828) was observed, indicating that the culture system should be refined. A. testudineus showed positive phototaxis to the “colors of light”. In addition, efforts to collect climbing perch from the wild for breeding and commercial purposes may benefit from this study.
3
Шевяков, Ю. І., В. В. Ларін, є. л. Казаков, and Ахмед Абдалла. "The video processing features research in computer systems and special purpose networks." Системи озброєння і військова техніка, no. 4(64), (December 17, 2020): 126–32. http://dx.doi.org/10.30748/soivt.2020.64.16.
Full textAbstract:
For a typical low complexity video sequence, the weight of each P-frame in the stream is approximately three times smaller than the I-frame weight. However, taking into account the number of P-frames in the group, they make the main contribution to the total video data amount. Therefore, the possibility of upgrading coding methods for P-frames is considered on preliminary blocks' type identification with the subsequent formation of block code structures. As the correlation coefficient between adjacent frames increases, the compression ratio of the differential-represented frame's binary mask increases. The compression ratio of the differential-represented frame's binary mask varies from 3 to 21 depending on the correlation coefficient between adjacent frames. The most preferable method for constructing the compact representation technology of the binary masks of frames represented in a differential form is the approach. This is based on the identification and description of the lengths of one-dimensional binary series. A binary series is a consecutive binary elements sequence with the same value. In this case, sequences of identical binary elements are replaced by their lengths.
4
Chugh, Renu, S. K. Sharma, and Shashank Goel. "Block sequences and g-frames." International Journal of Wavelets, Multiresolution and Information Processing 13, no. 02 (March 2015): 1550009. http://dx.doi.org/10.1142/s0219691315500095.
Full textAbstract:
Casazza and Kutyniok [Frames of subspaces, in Wavelets, Frames and Operator Theory, Contemporary Mathematics, Vol. 345 (American Mathematical Society, Providence, RI, 2004), pp. 87–113] defined fusion frames in Hilbert spaces to split a large frame system into a set of (overlapping) much smaller systems and being able to process the data effectively locally within each sub-system. In this paper, we handle this problem using block sequences and generalized block sequences with respect to g-frames. Examples have been given to show their existence. A necessary and sufficient condition for a block sequence with respect to a g-frame to be a g-frame has been given. Finally, a sufficient condition for a generalized block sequence with respect to a g-frame to be a g-frame has been given.
5
JAIN, P. K., S. K. KAUSHIK, and NISHA GUPTA. "ON NEAR EXACT BANACH FRAMES IN BANACH SPACES." Bulletin of the Australian Mathematical Society 78, no. 2 (October 2008): 335–42. http://dx.doi.org/10.1017/s0004972708000889.
Full textAbstract:
AbstractNear exact Banach frames are introduced and studied, and examples demonstrating the existence of near exact Banach frames are given. Also, a sufficient condition for a Banach frame to be near exact is obtained. Further, we consider block perturbation of retro Banach frames, and prove that a block perturbation of a retro Banach frame is also a retro Banach frame. Finally, it is proved that if E and F are both Banach spaces having Banach frames, then the product space E×F has an exact Banach frame.
6
Pathak, H. K., and Mayur Puri Goswami. "Some characterizations of fusion Banach frames." International Journal of Wavelets, Multiresolution and Information Processing 13, no. 03 (May 2015): 1550015. http://dx.doi.org/10.1142/s0219691315500150.
Full textAbstract:
Near exact fusion Banach frames have been discussed with the help of examples. Further, it has been proved that if a Banach space has a fusion Banach frame then it has a normalized tight and exact fusion Banach frame. In the sequel, we consider block perturbation of fusion Banach frames and proved that a block perturbation of a fusion Banach frame is also a fusion Banach frame. Some stability results for fusion Banach frames have also been obtained. Finally, we give an application of near exact fusion Banach frame.
7
Feng, Hong Cai, Yong Gong, and Wei Gang Hu. "A New Algorithm of Video Key Frame Extraction Based on the Block of Frame Image." Advanced Materials Research 532-533 (June 2012): 1670–74. http://dx.doi.org/10.4028/www.scientific.net/amr.532-533.1670.
Full textAbstract:
In order to improve the stability and effectiveness of the key frame extraction, we devise a key frame extraction algorithm based on frame image block. It get the local characteristics of the image frame information by partitioning frame image, then calculate the non-correlation coefficient, and extract key frames reflecting more diversified information. Experimental results show that the algorithm for the lens of key frames of extraction efficiency is higher and extraction of key frames can effectively reflect lens content.
8
ZHENG, YAN, and SHIBAO ZHENG. "AN EFFICIENT OVERLAPPING BLOCK SELECTION METHOD IN MULTI-FRAME SKIPPING TRANSCODING." Journal of Circuits, Systems and Computers 18, no. 02 (April 2009): 325–37. http://dx.doi.org/10.1142/s0218126609005095.
Full textAbstract:
This paper presents an overlapping block selection method to determine the dominant macroblock (MB) in multi-frame skipping transcoding to improve picture quality. A non-intra MB in a non-skipped frame should be predicted by a block in another non-skipped frame. The re-constructed motion vector (MV) between two non-skipped frames accumulates prediction error. As the number of frames between two non-skipped frames is increased, such prediction error, or called mismatch error, is also increased. To reduce the impact on the transcoding quality caused by the prediction error, we improve the traditional overlapping block selection method, and propose a most approximate overlapping block to help to determine a dominant MB. In the proposed method, the location of an overlapping block is calculated by adding the accumulated MVs and the position of the current MB. The accumulated MVs are not the real MVs for MBs but the approximate vectors for 16 × 16 overlapping blocks. Simulation shows that the proposed method has a higher performance than the traditional method.
9
Lu, Ta Te. "Significant Features Selection Resistant to Temporal Distortions." Applied Mechanics and Materials 284-287 (January 2013): 3154–58. http://dx.doi.org/10.4028/www.scientific.net/amm.284-287.3154.
Full textAbstract:
Most patterns in continuous video sequences are similar. Temporal distortion, e.g. frames dropping, insertions, transposition, is a challenging issue for video reconstruction to find the actual missing positions in video sequences. The aim of this paper is to raise the detection accuracy and synchronize video frames back to original positions following temporal synchronization distortions. The successive video frames have similar statistics but the statistics in some local regions may differ from one another. Therefore, the block partition is partitioned into non-overlapping blocks by each frame, and then the local variance is calculated and taken as the block feature in each block. For most of the video frames, the pixels within the frame blocks are correlated and the maximum eigenvalue will be far from other eigenvalues. In this case, the maximum eigenvalue is set as the dominated block feature. For less correlated blocks, the values of the eigenvalues will be a little closer. In this case, the mean value of the eigenvalues represents the dominated block feature. Then, the sum of variance is regarded as the frame feature to calculate from these selective dominated blocks. Simulation results show the proposed methods are robust in evaluating the missing positions against temporal distortions.
10
Aydin, Yildiz, and Bekir Dizdaroğlu. "Blotch Detection in Archive Films Based on Visual Saliency Map." Complexity 2020 (April 7, 2020): 1–17. http://dx.doi.org/10.1155/2020/5965387.
Full textAbstract:
Degradations frequently occur in archive films that symbolize the historical and cultural heritage of a nation. In this study, the problem of detection blotches commonly encountered in archive films is handled. Here, a block-based blotch detection method is proposed based on a visual saliency map. The visual saliency map reveals prominent areas in an input frame and thus enables more accurate results in the blotch detection. A simple and effective visual saliency map method is taken into consideration in order to reduce computational complexity for the detection phase. After the visual saliency maps of the given frames are obtained, blotch regions are estimated by considered spatiotemporal patches—without the requirement for motion estimation—around the saliency pixels, which are subjected to a prethresholding process. Experimental results show that the proposed block-based blotch detection method provides a significant advantage with reducing false alarm rates over HOG feature (Yous and Serir, 2017), LBP feature (Yous and Serir, 2017), and regions-matching (Yous and Serir, 2016) methods presented in recent years.
11
Zheng, Xianwei, Shouzhi Yang, Yuan Yan Tang, and Youfa Li. "Parseval transforms for finite frames." International Journal of Wavelets, Multiresolution and Information Processing 16, no. 03 (May 2018): 1850014. http://dx.doi.org/10.1142/s0219691318500145.
Full textAbstract:
The relationship between frames and Parseval frames is an important topic in frame theory. In this paper, we investigate Parseval transforms, which are linear transforms turning general finite frames into Parseval frames. We introduce two classes of transforms in terms of the right regular and left Parseval transform matrices (RRPTMs and LPTMs). We give representations of all the RRPTMs and LPTMs of any finite frame. Two important LPTMs are discussed in this paper, the canonical LPTM (square root of the inverse frame operator) and the RGS matrix, which are obtained by using row’s Gram–Schmidt orthogonalization. We also investigate the relationship between the Parseval frames generated by these two LPTMs. Meanwhile, for RRPTMs, we verify the existence of invertible RRPTMs for any given finite frame. Finally, we discuss the existence of block diagonal RRPTMs by taking the graph structure of the frame elements into consideration.
12
Rees, Rolf S., and Douglas R. Stinson. "Frames with Block Size Four." Canadian Journal of Mathematics 44, no. 5 (October 1, 1992): 1030–49. http://dx.doi.org/10.4153/cjm-1992-063-x.
Full textAbstract:
AbstractWe investigate the spectrum for frames with block size four, and discuss several applications to the construction of other combinatorial designs.Our main result is that a frame of type hu, having blocks of size four, exists if and only if u ≥ 5, h ≡ 0 mod 3 and h(u — 1) ≡ 0 mod 4, except possibly where(i)h = 9 and u ∈ ﹛13,17,29,33,93,113,133,153,173,193﹜;(ii)h ≡ 0 mod 12 and u ∈ ﹛8,12﹜,h = 36 and u ∈ ﹛7,18,23,28,33,38,43,48﹜,h = 24 or 120 and u ∈ ﹛7﹜,h = 72 and u ∈ 2Z+ U ﹛n : n ≡ 3 mod4 and n ≤527﹜ U ﹛563﹜; or(iii)h ≡ 6mod l2 and u ∈ (﹛17,29,33,563﹜ U ﹛n : n ≡ 3 or 11 mod 12 and n ≤ 527﹜ U ﹛n : n ≡ 7 mod 12 and n ≤ 259﹜), h = 18.Additionally, we give a new recursive construction for resolvable group-divisible designs from frames: if there is a resolvable k-GDD of type gu, a k-frame of type ﹛mg)v where u ≥ m + 1, and a resolvable TD(k, mv) then there is a resolvable k-GDD of type (mg)uv. We use this to construct some new resolvable GDDs with group size three and block size four.
13
Liu, Li Chang, Jong Chih Chien, and Yu Wei Hsu. "A Generalized Frame-Level FSBM FLSA Architecture." Applied Mechanics and Materials 284-287 (January 2013): 2915–20. http://dx.doi.org/10.4028/www.scientific.net/amm.284-287.2915.
Full textAbstract:
Block-based motion estimation plays important roles in video applications such as video compression to detect movements as well as remove temporal redundancies between successive frames. Full-search block-matching (FSBM) is the preferred algorithm for accurate motion estimation. Frame-level pipelined systolic array (FLSA) FSBM architectures have advantages over block-level pipelined architectures in their simpler control and reduced number of memory accesses. In this paper, a frame-level pipelined FSBM motion estimation architecture using array processor for any square, N×N, block size is presented in full detail.
14
Hwang, Ho Young. "Analysis of Throughput and Delay for an Underwater Multi-DATA Train Protocol with Multi-RTS Reception and Block ACK." Sensors 20, no. 22 (November 12, 2020): 6473. http://dx.doi.org/10.3390/s20226473.
Full textAbstract:
We propose an underwater multi-DATA train protocol with multi-RTS reception and block ACK (BACK) for underwater acoustic sensor networks. Due to long underwater acoustic propagation delay, some RTS frames may not overlap at a sink node, even if the RTS frames were sent to the sink node simultaneously by different sensor nodes. We consider that our underwater sink node can recover these nonoverlapping RTS frames. Since our RTS frame contains ID of the RTS sending node and a timestamp, the sink node calculates the propagation delay between the RTS sending node and the sink node, then broadcasts a CTS frame. Since our CTS frame contains when each RTS sending node can transmit a DATA frame to the sink node, multiple DATA frames transmitted by different sensor nodes can be formed as a train at the sink node. We also propose an underwater BACK protocol which is analogous to our proposed underwater multi-DATA train protocol. We analyze normalized throughput and mean access delay of our proposed protocols and the conventional protocols. The analytical and simulation results show that our analysis is accurate and our proposed protocols outperform the conventional protocols. Our proposed protocol can shorten the delay and increase the throughput via the multi-DATA train, multi-RTS reception, and BACK.
15
Zuo, Chenglin, Yu Liu, Xin Tan, Wei Wang, and Maojun Zhang. "Video Denoising Based on a Spatiotemporal Kalman-Bilateral Mixture Model." Scientific World Journal 2013 (2013): 1–10. http://dx.doi.org/10.1155/2013/438147.
Full textAbstract:
We propose a video denoising method based on a spatiotemporal Kalman-bilateral mixture model to reduce the noise in video sequences that are captured with low light. To take full advantage of the strong spatiotemporal correlations of neighboring frames, motion estimation is first performed on video frames consisting of previously denoised frames and the current noisy frame by using block-matching method. Then, current noisy frame is processed in temporal domain and spatial domain by using Kalman filter and bilateral filter, respectively. Finally, by weighting the denoised frames from Kalman filtering and bilateral filtering, we can obtain a satisfactory result. Experimental results show that the performance of our proposed method is competitive when compared with state-of-the-art video denoising algorithms based on both peak signal-to-noise-ratio and structural similarity evaluations.
16
Yue, Ya Feng, and Dong Zhao. "Experimental Research on Mechanical Properties of Fundamental Frame Units in Multi-Ribbed Composite Wallboard." Applied Mechanics and Materials 166-169 (May 2012): 3174–79. http://dx.doi.org/10.4028/www.scientific.net/amm.166-169.3174.
Full textAbstract:
The fundamental frame units were taken from the multi-ribbed composite wallboard. 1/2 scale model specimens including bare frame (FD Series) and infilled frame (IFD Series) were loaded in the diagonal direction. By changing the section size of a frame beam and column, the mechanical properties of multi-frames under vertical and horizontal loads were studied. Through comparing and analyses, contributions and interaction between frame and infilled block were investigated. The results show that the frame section stiffness influences the mechanical properties remarkably and the interaction between frame and infill is significant.
17
Тимочко, О. І., В. В. Ларін, Ю. І. Шевяков, and А. Абдалла. "Investigation of the mechanism for processing predicted frames in the technology of compression of transformed images in computer systems and special purpose networks." Системи обробки інформації, no. 4(163), (October 28, 2020): 87–93. http://dx.doi.org/10.30748/soi.2020.163.09.
Full textAbstract:
The analysis of image processing technologies shows the main practice way to improve the quality of image processing. It is a preliminary analysis and subsequent image processing. It depends on the result of the preliminary analysis (filtration, sharpening, noise reduction, etc.). However, when selection of the method of preliminary analysis, an intermediate evaluation of results, selection of the subsequent processing method, etc. decision makers involved. This is not acceptable for practical implementation in automatic processing and transmission of video information systems. The main difficulties in working with video are large volumes of transmitted information and sensitivity to delays in the video information transmission. Therefore, in order to eliminate the maximum redundancy amount in the formation of the video sequence, 3 types of frames are used: I, P and B which form a frame group. Therefore, the possibility of upgrading coding methods for P-frames is considered on preliminary blocks' type identification with the subsequent formation of block code structures. As the correlation coefficient between adjacent frames increases, the compression ratio of the differential-represented frame's binary mask increases. A mechanism for processing predicted frames in the technology of compression of transformed images in computer systems and special purpose networks has been created. It based on the using of filter masks and the definition of complexity structural indicators of video fragments. It allows us to increase the efficiency of contours detection, namely, the accuracy of the allocation and localization of the semantic component up to 30% with an insignificant increase in the total processing time (no more than 5%).
18
Wang, Wei, Jianming Wang, and Jianhua Chen. "Adaptive Block-Based Compressed Video Sensing Based on Saliency Detection and Side Information." Entropy 23, no. 9 (September 8, 2021): 1184. http://dx.doi.org/10.3390/e23091184.
Full textAbstract:
The setting of the measurement number for each block is very important for a block-based compressed sensing system. However, in practical applications, we only have the initial measurement results of the original signal on the sampling side instead of the original signal itself, therefore, we cannot directly allocate the appropriate measurement number for each block without the sparsity of the original signal. To solve this problem, we propose an adaptive block-based compressed video sensing scheme based on saliency detection and side information. According to the Johnson–Lindenstrauss lemma, we can use the initial measurement results to perform saliency detection and then obtain the saliency value for each block. Meanwhile, a side information frame which is an estimate of the current frame is generated on the reconstruction side by the proposed probability fusion model, and the significant coefficient proportion of each block is estimated through the side information frame. Both the saliency value and significant coefficient proportion can reflect the sparsity of the block. Finally, these two estimates of block sparsity are fused, so that we can simultaneously use intra-frame and inter-frame correlation for block sparsity estimation. Then the measurement number of each block can be allocated according to the fusion sparsity. Besides, we propose a global recovery model based on weighting, which can reduce the block effect of reconstructed frames. The experimental results show that, compared with existing schemes, the proposed scheme can achieve a significant improvement in peak signal-to-noise ratio (PSNR) at the same sampling rate.
19
Xin, Jingwei, Nannan Wang, Jie Li, Xinbo Gao, and Zhifeng Li. "Video Face Super-Resolution with Motion-Adaptive Feedback Cell." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 07 (April 3, 2020): 12468–75. http://dx.doi.org/10.1609/aaai.v34i07.6934.
Full textAbstract:
Video super-resolution (VSR) methods have recently achieved a remarkable success due to the development of deep convolutional neural networks (CNN). Current state-of-the-art CNN methods usually treat the VSR problem as a large number of separate multi-frame super-resolution tasks, at which a batch of low resolution (LR) frames is utilized to generate a single high resolution (HR) frame, and running a slide window to select LR frames over the entire video would obtain a series of HR frames. However, duo to the complex temporal dependency between frames, with the number of LR input frames increase, the performance of the reconstructed HR frames become worse. The reason is in that these methods lack the ability to model complex temporal dependencies and hard to give an accurate motion estimation and compensation for VSR process. Which makes the performance degrade drastically when the motion in frames is complex. In this paper, we propose a Motion-Adaptive Feedback Cell (MAFC), a simple but effective block, which can efficiently capture the motion compensation and feed it back to the network in an adaptive way. Our approach efficiently utilizes the information of the inter-frame motion, the dependence of the network on motion estimation and compensation method can be avoid. In addition, benefiting from the excellent nature of MAFC, the network can achieve better performance in the case of extremely complex motion scenarios. Extensive evaluations and comparisons validate the strengths of our approach, and the experimental results demonstrated that the proposed framework is outperform the state-of-the-art methods.
20
Calderbank, Robert, Andrew Thompson, and Yao Xie. "On block coherence of frames." Applied and Computational Harmonic Analysis 38, no. 1 (January 2015): 50–71. http://dx.doi.org/10.1016/j.acha.2014.03.003.
Full text
21
Bhusal, SJ, and RB Thapa. "Response of Colony Strength to Honey Production: Regression and Correlation Analysis." Journal of the Institute of Agriculture and Animal Science 27 (May 1, 2006): 133–37. http://dx.doi.org/10.3126/jiaas.v27i0.706.
Full textAbstract:
An experiment was conducted using Randomized Complete Block (RCB) design to find the effects of initial colony strength of Apis mellifera L. on honey production with four levels of initial populations: 4 frames (9,800), 6 frames (14,700), 8 frames (19,600) and 10 frames (24,500) of adult honeybees per colony replicating 5 times during litchi flowering season (February to April, 2003) in Chitwan. This study revealed the exponential increase in honey production {Y = 4.22 – 0.7325 X + 0.09625 X2 (4 ≤X ≤ 10 comb covered by bees per colony) and Y = 4.22 – 0.000299 X + 0.000000016 X2 (9,800 ≤ X ≤ 24,500 honeybees per colony), n = 4} producing 2.32, 1.59 and 1.18 times more honey from initially 10-, 8- and 6-frame colonies as compared to the honey production of 2.82 kg/colony from 4-frame colonies. There was significantly positive linear correlation among colony attributes like colony strength, brood rearing, comb building, foraging activity and honey production.
Key words: Apis mellifera, honey bee population, colony attributes
J. Inst. Agric. Anim. Sci. 27:133-137 (2006)
22
Ebrahim, Mansoor, Syed Hasan Adil, Kamran Raza, and Syed Saad Azhar Ali. "Block Compressive Sensing Single-View Video Reconstruction Using Joint Decoding Framework for Low Power Real Time Applications." Applied Sciences 10, no. 22 (November 10, 2020): 7963. http://dx.doi.org/10.3390/app10227963.
Full textAbstract:
Several real-time visual monitoring applications such as surveillance, mental state monitoring, driver drowsiness and patient care, require equipping high-quality cameras with wireless sensors to form visual sensors and this creates an enormous amount of data that has to be managed and transmitted at the sensor node. Moreover, as the sensor nodes are battery-operated, power utilization is one of the key concerns that must be considered. One solution to this issue is to reduce the amount of data that has to be transmitted using specific compression techniques. The conventional compression standards are based on complex encoders (which require high processing power) and simple decoders and thus are not pertinent for battery-operated applications, i.e., VSN (primitive hardware). In contrast, compressive sensing (CS) a distributive source coding mechanism, has transformed the standard coding mechanism and is based on the idea of a simple encoder (i.e., transmitting fewer data-low processing requirements) and a complex decoder and is considered a better option for VSN applications. In this paper, a CS-based joint decoding (JD) framework using frame prediction (using keyframes) and residual reconstruction for single-view video is proposed. The idea is to exploit the redundancies present in the key and non-key frames to produce side information to refine the non-key frames’ quality. The proposed method consists of two main steps: frame prediction and residual reconstruction. The final reconstruction is performed by adding a residual frame with the predicted frame. The proposed scheme was validated on various arrangements. The association among correlated frames and compression performance is also analyzed. Various arrangements of the frames have been studied to select the one that produces better results. The comprehensive experimental analysis proves that the proposed JD method performs notably better than the independent block compressive sensing scheme at different subrates for various video sequences with low, moderate and high motion contents. Also, the proposed scheme outperforms the conventional CS video reconstruction schemes at lower subrates. Further, the proposed scheme was quantized and compared with conventional video codecs (DISCOVER, H-263, H264) at various bitrates to evaluate its efficiency (rate-distortion, encoding, decoding).
23
Sun, Fan, and Xuedong Tian. "Lecture Video Automatic Summarization System Based on DBNet and Kalman Filtering." Mathematical Problems in Engineering 2022 (August 31, 2022): 1–10. http://dx.doi.org/10.1155/2022/5303503.
Full textAbstract:
Video summarization for educational scenarios aims to extract and locate the most meaningful frames from the original video based on the main contents of the lecture video. Aiming at the defect of existing computer vision-based lecture video summarization methods that tend to target specific scenes, a summarization method based on content detection and tracking is proposed. Firstly, DBNet is introduced to detect the contents such as text and mathematical formulas in the static frames of these videos, which is combined with the convolutional block attention module (CBAM) to improve the detection precision. Then, frame-by-frame data association of content instances is performed using Kalman filtering, the Hungarian algorithm, and appearance feature vectors to build a tracker. Finally, video segmentation and key frame location extraction are performed according to the content instance lifelines and content deletion events constructed by the tracker, and the extracted key frame groups are used as the final video summary result. Experimenting on a variety of scenarios of lecture video, the average precision of content detection is 89.1%; the average recall of summary results is 92.1%.
24
Pan, Wen Jun, Xian Guo Ye, and Lei Chang. "Application of QR Method for Analysis of Spatial-Mega Frame Structure." Advanced Materials Research 243-249 (May 2011): 6049–52. http://dx.doi.org/10.4028/www.scientific.net/amr.243-249.6049.
Full textAbstract:
With the generalized displacement parameters of spline knots chosen as basic unknowns, the node displacement functions of spatial mega frames were built up, then element node displacements could be expressed by these parameters. New stiffness equation of spatial mega frame was deduced according to energy variational principle. The nodal displacement and nodal forces were worked out by the displacement parameters of spline knots. Process of block assembling for spline-discretization matrix was introduced briefly. One spatial mega frame was calculated by QR method and different finite element softwares. Comparation among the results and those of references proves that QR method is exactly an economical, effective and reliable method for computation of spatial mega frames. It provides a new approach for simplified calculation to spatial mega structures, so has good theoretical and practical value.
25
Yang, Yixin, Zhiqang Xiang, and Jianbo Li. "Research on Low Frame Rate Video Compression Algorithm in the Context of New Media." Security and Communication Networks 2021 (September 27, 2021): 1–10. http://dx.doi.org/10.1155/2021/7494750.
Full textAbstract:
When using the current method to compress the low frame rate video animation video, there is no frame rate compensation for the video image, which cannot eliminate the artifacts generated in the compression process, resulting in low definition, poor quality, and low compression efficiency of the compressed low frame rate video animation video. In the context of new media, the linear function model is introduced to study the frame rate video animation video compression algorithm. In this paper, an adaptive detachable convolutional network is used to estimate the offset of low frame rate video animation using local convolution. According to the estimation results, the video frames are compensated to eliminate the artifacts of low frame rate video animation. After the frame rate compensation, the low frame rate video animation video is divided into blocks, the CS value of the image block is measured, the linear estimation of the image block is carried out by using the linear function model, and the compression of the low frame rate video animation video is completed according to the best linear estimation result. The experimental results show that the low frame rate video and animation video compressed by the proposed algorithm have high definition, high compression quality under different compression ratios, and high compression efficiency under different compression ratios.
26
Setyono, Andik, and De Setiadi. "Robust Video Watermarking using Tchebichef Transform and Singular Value Decomposition on the Selected Frame Based YCbCr Color Space." International Journal of Intelligent Engineering and Systems 13, no. 6 (December 31, 2020): 432–41. http://dx.doi.org/10.22266/ijies2020.1231.38.
Full textAbstract:
Watermarking is a copyright authentication technique. This research proposes a robust watermarking method with a combination of Tchebichef transformation and singular value decomposition (SVD). To maintain imperceptibility, embedding is done on one of the selected frames. Frames are randomly selected to increase watermark security. Frame selection is based on two integer keys processed by a linear congruential generator (LCG). The selected frame is then converted to its color space from RGB to YCbCr. Y channel (luminance) was selected to be processed by Tchebichef transformation based on block 8 × 8, the coefficient 0.0 for each block of the transformed results was selected and collected on a matrix. This matrix is then transformed with SVD and a singular matrix is selected for watermark embedding, this method is done to increase robustness. Based on the test results, the imperceptibility value is very good with an average value of 50.952dB, based on the PSNR as a measuring tool. Whereas in the robustness aspect, a value of 0.927 is generated based on the results of the measurement of the correlation between the watermark and the original watermark, where these results are the average extraction results without and with various attacks.
27
Sari, Ilmiyati, Asep Juarna, Suryadi Harmanto, and Djati Kerami. "Background Estimation Using Principal Component Analysis Based on Limited Memory Block Krylov Subspace Optimization." International Journal of Electrical and Computer Engineering (IJECE) 8, no. 5 (October 1, 2018): 2847. http://dx.doi.org/10.11591/ijece.v8i5.pp2847-2856.
Full textAbstract:
<p>Given a video of 𝑀 frames of size ℎ × 𝑤. Background components of a video are the elements matrix which relative constant over 𝑀 frames. In PCA (principal component analysis) method these elements are referred as “principal components”. In video processing, background subtraction means excision of background component from the video. PCA method is used to get the background component. This method transforms 3 dimensions video (ℎ × 𝑤 × 𝑀) into 2 dimensions one (𝑁 × 𝑀), where 𝑁 is a linear array of size ℎ × 𝑤. The principal components are the dominant eigenvectors which are the basis of an eigenspace. The limited memory block Krylov subspace optimization then is proposed to improve performance the computation. Background estimation is obtained as the projection each input image (the first frame at each sequence image) onto space expanded principal component. The procedure was run for the standard dataset namely SBI (Scene Background Initialization) dataset consisting of 8 videos with interval resolution [146 150, 352 240], total frame [258,500]. The performances are shown with 8 metrics, especially (in average for 8 videos) percentage of error pixels (0.24%), the percentage of clustered error pixels (0.21%), multiscale structural similarity index (0.88 form maximum 1), and running time (61.68 seconds). </p>
28
Likhobabenko, M. A. "BLOCK FRAMES IN THE ℓ2 SPACE." Vestnik of Samara University. Natural Science Series 17, no. 2 (June 16, 2017): 38–45. http://dx.doi.org/10.18287/2541-7525-2011-17-2-38-45.
Full text
29
JHA, NARENDRA NARAYAN, and SHALU SHARMA. "Block sequences of Retro Banach Frames." Poincare Journal of Analysis and Applications 7, no. 2 (December 30, 2020): 267–74. http://dx.doi.org/10.46753/pjaa.2020.v07i02.010.
Full text
30
Klimek, Maciej, Masaya Matsuura, and Yasunori Okabe. "Stochastic flows and finite block frames." Journal of Mathematical Analysis and Applications 342, no. 2 (June 2008): 816–29. http://dx.doi.org/10.1016/j.jmaa.2007.12.015.
Full text
31
Cao, H., Y. Wu, and H. Zhou. "Modified frames with block size 3." Journal of Combinatorial Designs 16, no. 5 (September 2008): 351–63. http://dx.doi.org/10.1002/jcd.20166.
Full text
32
Dawe, J. L., Y. Liu, and C. K. Seah. "A parametric study of masonry infilled steel frames." Canadian Journal of Civil Engineering 28, no. 1 (February 1, 2001): 149–57. http://dx.doi.org/10.1139/l00-084.
Full textAbstract:
A previously developed computer model was used to investigate the effects of a wide range of parameters applicable to concrete block masonry infilled steel frames. Height to length panel aspect ratios were varied from 0.5 to 1.5 to reflect how other parameters were affected by these values. Eight different types of parameters were studied. The method of applying horizontal load was found to have little effect. Isolation gaps between panel and beam reduced both the stiffness and strength of the infilled frame. While panel-to-column ties generated an increase in peak load, local stress concentrations caused by the ties resulted in additional deterioration of the panel. Strength was found to vary with mortar joint bond strength, with the effects being more significant at higher aspect ratios. Increasing beam stiffness increased strength for low aspect ratio frames, and increasing column stiffness had a similar effect for high aspect ratio frames. Gravity loading was beneficial in increasing shear resistance up to a limit where it caused crushing of the masonry infill. The increases in strength of infilled frames were found to be disproportionate to increases in the strength of the masonry.Key words: masonry, steel, infill, frame, analytical, variables, shear, strength, deflection, interaction.
33
Xi, Kailin, and Boquan Liu. "Seismic Performance and Finite Element Analysis of Reinforced Concrete Frames Considering a Masonry-Infilled Wall." Advances in Materials Science and Engineering 2022 (October 10, 2022): 1–16. http://dx.doi.org/10.1155/2022/6832624.
Full textAbstract:
This study investigated the seismic performance of a 1/3 scale, three-story, and three-span RC frame subjected to static cyclic lateral loading. The failure process and mode were analyzed using the digital image correlation (DIC) method. Based on the test, finite element (FE) models were developed and verified. Using the proposed FE models, the parametric study was performed to investigate the influence of the opening rate, the position of infill walls, and the block strength on the seismic performance of the frame. Test results indicated that FE simulation results are correspondent to the testing results. The infilled wall increased the horizontal bearing capacity of the structure and the energy dissipation capacity. The opening masonry-infilled wall reduced the energy consumption capacity and the initial stiffness of the structure. Removing the infill walls on the first floor would change the failure mode of the frame. Improving the block strength could improve the bearing capacity of frames but has little effect on the energy dissipation capacity of the frame.
34
Wararuksajja, Wongsa, Jarun Srechai, and Sutat Leelataviwat. "Seismic design of RC moment-resisting frames with concrete block infill walls considering local infill-frame interactions." Bulletin of Earthquake Engineering 18, no. 14 (August 31, 2020): 6445–74. http://dx.doi.org/10.1007/s10518-020-00942-9.
Full text
35
Madav, Brahmadesam T. "Low Complex Block Level Correlation and Registration for Video Frame Interpolation." Revista Gestão Inovação e Tecnologias 11, no. 3 (June 30, 2021): 449–62. http://dx.doi.org/10.47059/revistageintec.v11i3.1949.
Full text
36
Prasad Arya, Govind, Devendra Prasad, and Sandeep Singh Rana. "An Improved Page Replacement Algorithm Using Block Retrieval of Pages." International Journal of Engineering & Technology 7, no. 4.5 (September 22, 2018): 32. http://dx.doi.org/10.14419/ijet.v7i4.5.20004.
Full textAbstract:
The computer programmer write programming codes of any length without keeping in mind the available primary memory. This is possible if we use the concept of virtual memory. As the name suggests, virtual memory is a concept of executing a programming code of any size even having a primary memory of smaller size than the size of program to be executed. The virtual memory can be implemented using the concept of paging. The operating system allocates a number of memory frames to each program while loading into the memory. The programming code is equally divided into pages of same size as frame size. The size of pages and memory frames are retained equal for the better utilization of the memory. During the execution of program, every process is allocated limited number of memory frames; hence there is a need of page replacements. To overcome this limitation, a number of page replacement techniques had suggested by the researchers. In this paper, we have proposed an modified page replacement technique, which is based on the concept of block reading of pages from the secondary storage. The disc access is very slow as compared to the access from primary memory. Whenever there is a page fault, the required page is retrived from the secondary storage. The numerous page faults increase the execution time of process. In the proposed methodology, a number of pages, which is equal to the allotted memory frames, are read every time when there is a page fault instead of reading a single page at a time. If a block of pages has fetched from secondary storage, it will definitely increases the possibilities of page hit and as a result, it will improve the hit ratio for the processes.
37
Li, Peiyong, Zheng Tang, Yuwen Huang, Yunpeng Wang, and Chong Wang. "Distortion Control and Prevention by Fabrication Techniques in Cold Bent Steel Frame with Perforated Web." Journal of Ship Production and Design 37, no. 01 (February 17, 2021): 37–44. http://dx.doi.org/10.5957/jspd.07190038.
Full textAbstract:
Cutouts are widely used in ships and offshore structures. Cutouts of big size are used mainly for inspection, passing pipes, and weight reduction. Some cutouts of small size may be used for various purposes, such as water hole in the web of stiffeners. The stiffeners with perforated web are the most commonly adopted structure members in the shipbuilding industry, and they are mainly fabricated by cutting and bending the frame to meet the requirements of desired design configuration. In ship production, the manufacture of the curved stiffener with holes is desirable to perforate first and then to bend the frame. This fabrication procedure is adopted for efficient production because of the layout of the production line. However, structural distortion and damage may occur during cold bending of the frames with perforated web, such as necking, wrinkling, and even crack initiation. This problem should be solved in ship production. In this study, cold bending experiments and finite element simulations were performed to analyze the deformation characteristics of curved frames with cutouts. A fabrication method is proposed to control the deformation in the cutouts during the bending process. In this method, the block cut out during the first step is filled in the hole and afterward the frame is bent. The results show that this method can control well the deformation localized around the hole during the bending process. It offers an important guidance for cold bending steel frames in ship production.
38
Kim, Chang-Su, and Sang-Uk Lee. "Fractal Coding of Video Sequence by Circular Prediction Mapping." Fractals 05, supp01 (April 1997): 75–88. http://dx.doi.org/10.1142/s0218348x97000656.
Full textAbstract:
We propose a novel algorithm for fractal video sequence coding, based on the Circular Prediction Mapping (CPM), in which each range block is approximated by a domain block in the circularly previous frame. In our approach, the size of the domain block is set to be same as that of the range block for exploiting the high temporal correlation between the adjacent frames, while most other fractal coders use the domain block larger than the range block. Therefore the domain-range mapping in the CPM becomes similar to the block matching algorithm in the motion compensation techniques, and the advantages from this similarity are discussed. Also the modified collage theorem, which yields better prediction method for the CPM than the conventional collage theorem, is provided by linear systematic analysis. The computer simulation results on real video-conferencing image sequences demonstrate that the average compression ratios ranging from 60 to 70 can be obtained with good subjective quality.
39
Yang, Biao, Jinmeng Cao, and Ling Zou. "Moving object detection based on on-line block-robust principal component analysis decomposition." Modern Physics Letters B 31, no. 19-21 (July 27, 2017): 1740040. http://dx.doi.org/10.1142/s0217984917400401.
Full textAbstract:
Robust principal component analysis (RPCA) decomposition is widely applied in moving object detection due to its ability in suppressing environmental noises while separating sparse foreground from low rank background. However, it may suffer from constant punishing parameters (resulting in confusion between foreground and background) and holistic processing of all input frames (leading to bad real-time performance). Improvements to these issues are studied in this paper. A block-RPCA decomposition approach was proposed to handle the confusion while separating foreground from background. Input frame was initially separated into blocks using three-frame difference. Then, punishing parameter of each block was computed by its motion saliency acquired based on selective spatio-temporal interesting points. Aiming to improve the real-time performance of the proposed method, an on-line solution to block-RPCA decomposition was utilized. Both qualitative and quantitative tests were implemented and the results indicate the superiority of our method to some state-of-the-art approaches in detection accuracy or real-time performance, or both of them.
40
Shah, Nehal N., Harikrishna Singapuri, and Upena D. Dalal. "Hardware Efficient Architecture with Variable Block Size for Motion Estimation." Journal of Electrical and Computer Engineering 2016 (2016): 1–11. http://dx.doi.org/10.1155/2016/5091519.
Full textAbstract:
Video coding standards such as MPEG-x and H.26x incorporate variable block size motion estimation (VBSME) which is highly time consuming and extremely complex from hardware implementation perspective due to huge computation. In this paper, we have discussed basic aspects of video coding and studied and compared existing architectures for VBSME. Various architectures with different pixel scanning pattern give a variety of performance results for motion vector (MV) generation, showing tradeoff between macroblock processed per second and resource requirement for computation. Aim of this paper is to design VBSME architecture which utilizes optimal resources to minimize chip area and offer adequate frame processing rate for real time implementation. Speed of computation can be improved by accessing 16 pixels of base macroblock of size 4 × 4 in single clock cycle using z scanning pattern. Widely adopted cost function for hardware implementation known as sum of absolute differences (SAD) is used for VBSME architecture with multiplexer based absolute difference calculator and partial summation term reduction (PSTR) based multioperand adders. Device utilization of proposed implementation is only 22k gates and it can process 179 HD (1920 × 1080) resolution frames in best case and 47 HD resolution frames in worst case per second. Due to such higher throughput design is well suitable for real time implementation.
41
Li, Ning, and Shuai Wan. "Research on Fast Compensation Algorithm for Interframe Motion of Multimedia Video Based on Manhattan Distance." Journal of Mathematics 2022 (January 5, 2022): 1–10. http://dx.doi.org/10.1155/2022/3468475.
Full textAbstract:
To improve the video quality, aiming at the problems of low peak signal-to-noise ratio, poor visual effect, and low bit rate of traditional methods, this paper proposes a fast compensation algorithm for the interframe motion of multimedia video based on Manhattan distance. The absolute median difference based on wavelet transform is used to estimate the multimedia video noise. According to the Gaussian noise variance estimation result, the active noise mixing forensics algorithm is used to preprocess the original video for noise mixing, and the fuzzy C-means clustering method is used to smoothly process the noisy multimedia video and obtain significant information from the multimedia video. The block-based motion idea is to divide each frame of the video sequence into nonoverlapping macroblocks, find the best position of the block corresponding to the current frame in the reference frame according to the specific search range and specific rules, and obtain the relative Manhattan distance between the current frame and the background of multimedia video using the Manhattan distance calculation formula. Then, the motion between the multimedia video frames is compensated. The experimental results show that the algorithm in this paper has a high peak signal-to-noise ratio and a high bit rate, which effectively improves the visual effect of the video.
42
Firouzianhaji, Ahmad, Nima Usefi, Bijan Samali, and Peyman Mehrabi. "Shake Table Testing of Standard Cold-Formed Steel Storage Rack." Applied Sciences 11, no. 4 (February 18, 2021): 1821. http://dx.doi.org/10.3390/app11041821.
Full textAbstract:
Full-scale shake table investigations are strongly required to understand the actual performance of storage racks and to improve the rack design guidelines. This paper presents the results of full-scale shake table tests on New Zealand standard storage rack frames with two-bay and two-level to determine the dynamic characteristics of a standard rack structure and to measure the damping of the system. The experimental program was conducted in three phases. First, the identification parameters including the natural frequency and damping of the system were determined through a series of preliminary tests. Then, shake table tests were performed to capture the inelastic response of rack frames under low to medium intensities of El-Centro ground motion. Finally, the shake-table tests were repeated with scaling down the time domain and broader ranges of ground motion intensities to consider the performance of taller rack systems. In addition, a comprehensive discussion on the damping of the system is also provided based on the test results. The performance of the rack frame is described through an extensive set of measurements, including rack displacement, pallet sliding, the acceleration of a concrete block and rack frame and the damping of the system in the down-aisle direction. The results indicate that the standard rack frames are able to endure large inelastic deformations without loss of stability.
43
Hou, Chien-Yuan, Yung-Feng Lee, and Yen-Hao Peng. "Fatigue damage analysis of steel components subjected to earthquake loadings." International Journal of Structural Integrity 10, no. 1 (February 4, 2019): 25–40. http://dx.doi.org/10.1108/ijsi-05-2018-0028.
Full textAbstract:
PurposeExamination of steel moment resisting frames after the 1994 Northridge earthquake showed fatigue cracks presented in the beam–column connections of the frames. These observations indicate that fatigue failure may occur in the steel components of building structures in an earthquake event. To apply the fatigue design approach using the Palmgren–Miner’s rule for steel components of the moment resisting frames requires the knowledge regarding the damage index value at fatigue failure. The purpose of this paper is to perform fatigue tests to give the first damage values of steel components subjected to real earthquake-induced loadings.Design/methodology/approachThe added-damping-and-stiffness steel plates which are used in building structures for earthquake mitigation were fabricated and tested by constant amplitude, SAC block and earthquake-induced loadings to failure. The earthquake loadings were obtained from the dynamic analysis of a steel frame with the mentioned plates. The load cycles of the SAC block and the calculated earthquake loadings were counted using the rainflow-counting method, and the damage index value of each specimen were calculated using the Palmgren–Miner’s rule.FindingsReverse stiffness obtained from cyclic load-displacement loops is a robust and consistent parameter that can be used for determining fatigue failure of tested components. The Palmgren–Miner’s damage values at failure, caused by earthquake loadings, are smaller than 1, and in addition, are also smaller than those obtained from the tests of the SAC block loading. The large-amplitude cycles in the earthquake loading produce large damage on the specimens, and intermediate range cycles also produce damage that should not be neglected in the fatigue analysis.Originality/valueToday’s building design code allows large plastic deformation to occur in steel frames during an earthquake. However, the pre-Northridge earthquake steel frames showed fatigue cracks without the expected substantial plastic deformation at beam flanges. Proposed solutions to this problem were the reduced beam section neglecting the existence of the cracks at beam–column connections. This study considered the fatigue phenomenon in steel frames and provided the first set of tested fatigue damage values for steel components subjected to realistic earthquake loadings, which offered a possible method of dealing with fatigue cracks in the steel components of a building structure.
44
Park, Joseph Sung-Yul. "Framing, stance, and affect in Korean metalinguistic discourse." Pragmatics. Quarterly Publication of the International Pragmatics Association (IPrA) 21, no. 2 (June 1, 2011): 265–82. http://dx.doi.org/10.1075/prag.21.2.05par.
Full textAbstract:
Studies on language and affect have identified displays of emotions and feelings as important means through which speakers negotiate their social relations and cultural positions. Extending the findings of those studies, this paper discusses how affect must be seen as an important building block for framing, a resource that allows participants to construct frames that have specific grounding in identifiable social meaning. I make this point by illustrating how interactional management of affect contributes to the constitution of frames via the work of stancetaking, based on a discussion of several examples from a specific discursive context - Koreans’ metalinguistic talk about English. While Koreans are commonly known to show much ‘anxiety’ or ‘uneasiness’ about their own English language skills, I demonstrate that such display of affect may be understood as part of an interactional frame for speaking (about) English that allows speakers to position themselves in relation to English and to each other in a culturally and socially appropriate way. The analysis shows that the semiotic resources that speakers employ in their affective displays allow participants to negotiate specific stances that they should take, and to jointly construct a frame for interpreting the interactional import of the ongoing talk.
45
Hanuman, A. Sai, and G. Prasanna Kumar. "Survey Analysis of Robust and Real-Time Multi-Lane and Single Lane Detection in Indian Highway Scenarios." E3S Web of Conferences 309 (2021): 01117. http://dx.doi.org/10.1051/e3sconf/202130901117.
Full textAbstract:
Studies on lane detection Lane identification methods, integration, and evaluation strategies square measure all examined. The system integration approaches for building a lot of strong detection systems are then evaluated and analyzed, taking into account the inherent limits of camera-based lane detecting systems. Present deep learning approaches to lane detection are inherently CNN's semantic segmentation network the results of the segmentation of the roadways and the segmentation of the lane markers are fused using a fusion method. By manipulating a huge number of frames from a continuous driving environment, we examine lane detection, and we propose a hybrid deep architecture that combines the convolution neural network (CNN) and the continuous neural network (CNN) (RNN). Because of the extensive information background and the high cost of camera equipment, a substantial number of existing results concentrate on vision-based lane recognition systems. Extensive tests on two large-scale datasets show that the planned technique outperforms rivals' lane detection strategies, particularly in challenging settings. A CNN block in particular isolates information from each frame before sending the CNN choices of several continuous frames with time-series qualities to the RNN block for feature learning and lane prediction.
46
Furino, Steven, Sanpei Kageyama, Alan C.H. Ling, Ying Miao, and Jianxing Yin. "Frames with block size four and index three." Journal of Statistical Planning and Inference 106, no. 1-2 (August 2002): 117–24. http://dx.doi.org/10.1016/s0378-3758(02)00207-0.
Full text
47
Nguyen, V. A., and Y. P. Tan. "Fast Block-Based Motion Estimation Using Integral Frames." IEEE Signal Processing Letters 11, no. 9 (September 2004): 744–47. http://dx.doi.org/10.1109/lsp.2004.833500.
Full text
48
Simmons, Harold. "Regularity, Fitness, and the Block Structure of Frames." Applied Categorical Structures 14, no. 1 (February 2006): 1–34. http://dx.doi.org/10.1007/s10485-005-9010-7.
Full text
49
Dua, Mohit, Drishti Makhija, Pilla Yamini Lakshmi Manasa, and Prashant Mishra. "3D chaotic map-cosine transformation based approach to video encryption and decryption." Open Computer Science 12, no. 1 (January 1, 2022): 37–56. http://dx.doi.org/10.1515/comp-2020-0225.
Full textAbstract:
Abstract Data security is vital for multimedia communication. A number of cryptographic algorithms have been developed for the secure transmission of text and image data. Very few contributions have been made in the area of video encryption because of the large input data size and time constraints. However, due to the massive increase in digital media transfer within networks, the security of video data has become one of the most important features of network reliability. Block encryption techniques and 1D-chaotic maps have been previously used for the process of video encryption. Although the results obtained by using 1D-chaotic maps were quite satisfactory, the approach had many limitations as these maps have less dynamic behavior. To overcome these drawbacks, this article proposes an Intertwining Logistic Map (ILM)-Cosine transformation-based video encryption technique. The first step involved segmenting the input video into multiple frames based on the frames per second (FPS) value and the length of the video. Next, each frame was selected, and the correlation among the pixels was reduced by a process called permutation/scrambling. In addition, each frame was rotated by 90° in the anticlockwise direction to induce more randomness into the encryption process. Furthermore, by using an approach called the random order substitution technique, changes were made in each of the images, row-wise and column-wise. Finally, all the encrypted frames were jumbled according to a frame selection key and were joined to generate an encrypted video, which was the output delivered to the user. The efficiency of this method was tested based on the state of various parameters like Entropy, Unified Average Change in Intensity (UACI), and correlation coefficient (CC). The presented approach also decrypts the encrypted video, and the decryption quality was checked using parameters such as mean square error (MSE) and peak signal-to-noise ratio (PSNR).
50
Putra, Arief Bramanto Wicaksono, Achmad Fanany Onnilita Gaffar, Muhammad Taufiq Sumadi, and Lisa Setiawati. "Intra-frame Based Video Compression Using Deep Convolutional Neural Network (DCNN)." JOIV : International Journal on Informatics Visualization 6, no. 3 (September 30, 2022): 650. http://dx.doi.org/10.30630/joiv.6.3.1012.
Full textAbstract:
In principle, a video codec is built by implementing various algorithms and their development. The next generation of codecs involves more artificial intelligence applications and their development. DCNN (Deep Convolutional Neural Network) is a multi-layer NN concept with a deep learning approach in the field of artificial intelligence development. This study has proposed a DCNN with three hidden layers for intra-frame-based video compression. DCT and fractal methods were used to compare the performance of the proposed method. The training image (obtained from the average of all down-sampled frames) is divided into several square blocks using the square block shift operation until all parts of the image are fulfilled. All pixels in each block act as input data patterns. After the training process, the trained proposed DCNN was then used to construct the feature and sub-feature image obtained through the max function operation in the feature bank and sub-feature bank. These feature and sub-feature images were then a spatial redundancy minimizer with specific manipulation techniques and simultaneously a quantizer without converting the frame's pixels to a bit-stream. The result of this process is a compressed image. Experiments on the entire dataset resulted in AAPR (Average Approximate Performance Ratio) of 147.71%, or an average of 1.5 times better than other methods. For further studies, the performance improvement of the proposed DCNN is performed by modifying its structure so that the output is direct in the form of feature and sub-feature images. Another way is to combine it with the DCT or fractal method to improve the performance of the result.