检索结果-内蒙古大学图书馆

49th IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Eichermueller, Lena Chaudhari, Gaurang Katsavounidis, Ioannis Lei, Zhijun Tmar, Hassene Herglotz, Christian Kaup, Andre Friedrich Alexander Univ Erlangen Nurnberg Multimedia Communicat & Signal Proc Erlangen Germany Meta Menlo Pk CA USA

ISBN: (纸本)9798350344868;9798350344851

The share of online video traffic in global carbon dioxide emissions is growing steadily. To comply with the demand for video media, dedicated compression techniques are continuously optimized, but at the expense of increasingly higher computational demands and thus rising energy consumption at the video encoder side. In order to find the best tradeoff between compression and energy consumption, modeling encoding energy for a wide range of encoding parameters is crucial. We propose an encoding time and energy model for SVT-AV1 based on empirical relations between the encoding time and video parameters as well as encoder configurations. Furthermore, we model the influence of video content by established content descriptors such as spatial and temporal information. We then use the predicted encoding time to estimate the required energy demand and achieve a prediction error of 19.6% for encoding time and 20.9% for encoding energy.

关键词： SVT-AV1 encoding energy encoding time video complexity

来源：评论

学校读者我要写书评

暂无评论

A Motion Estimation based Algorithm for encoding time Reduction in HEVC

引用

DEFENCE SCIENCE JOURNAL 2022年第1期72卷 56-66页

作者： Sairam, S. Karthik Muralidhar, P. Natl Inst Technol Warangal 506004 Andhra Pradesh India

High Efficiency Video Coding (HEVC) is a video compression standard that offers 50% more efficiency at the expense of high encoding time contrasted with the H.264 Advanced Video Coding (AVC) standard. The encoding time must be reduced to satisfy the needs of real-time applications. This paper has proposed the MultiLevel Resolution Vertical Subsampling (MLRVS) algorithm to reduce the encoding time. The vertical subsampling minimises the number of Sum of Absolute Difference (SAD) computations during the motion estimation process. The complexity reduction algorithm is also used for fast coding the coefficients of the quantised block using a flag decision. Two distinct search patterns are suggested: New Cross Diamond Diamond (NCDD) and New Cross Diamond Hexagonal (NCDH) search patterns, which reduce the time needed to locate the motion vectors. In this paper, the MLRVS algorithm with NCDD and MLRVS algorithm with NCDH search patterns are simulated separately and analysed. The results show that the encoding time of the encoder is decreased by 55% with MLRVS algorithm using NCDD search pattern and 56% with MLRVS using NCDH search pattern compared to HM16.5 with Test Zone (TZ) search algorithm. These results are achieved with a slight increase in bit rate and negligible deterioration in output video quality.

关键词： Test zone search Vertical subsampling encoding time Search pattern Complexity Motion vector

来源：评论

学校读者我要写书评

暂无评论

Dissociating effects of stimulus identity and load on working memory attentional guidance: Lengthening encoding time eliminates the effect of load but not identity

引用

QUARTERLY JOURNAL OF EXPERIMENTAL PSYCHOLOGY 2012年第8期65卷 1475-1483页

作者： Tsvetanov, Kamen A. Arvanitis, Theodoros N. Humphreys, Glyn W. Univ Birmingham Sch Psychol Birmingham B15 2TT W Midlands England Univ Birmingham Sch Elect Elect & Comp Engn Birmingham B15 2TT W Midlands England Univ Oxford Dept Expt Psychol Oxford OX1 3UD England

Effects of the identity and load of items in working memory (WM) on visual attention were examined. With a short interval between the WM item and a subsequent search task, there were effects of both load (slowed overall reaction times, RTs, in a WM condition relative to a mere repetition baseline) and identity (search RTs were affected by re-presentation of the item in WM in the search display). As the time to encode the initial display increased, the effects of load decreased while the effect of identity remained. The data indicate that the identity of stimuli in WM can affect the subsequent deployment of attention even when time is allowed for consolidation of the stimuli in WM, and that the WM effects are not causally related to the presence of cognitive load. The results are consistent with the identity of stimuli in WM modulating attention post the memory consolidation stage.

关键词： Working memory Attention Vision encoding time

来源：评论

学校读者我要写书评

暂无评论

Visual Recognition Memory Test Performance was Improved in Older Adults by Extending encoding time and Repeating Test Trials

引用

JOURNAL OF OCCUPATIONAL HEALTH 2014年第6期56卷 453-460页

作者： Theppitak, Chalermsiri Lai, Viet Izumi, Hiroyuki Higuchi, Yoshiyuki Kumudini, Ganga Movahed, Mehrnoosh Kumashiro, Masaharu Fujiki, Nobuhiro Univ Occupat & Environm Hlth Dept Ergon Kitakyushu Fukuoka 8078555 Japan Fukuoka Univ Educ Dept Phys & Hlth Educ Fukuoka Japan

Objectives: The aim of this study was to investigate whether the combination of extension of the encoding time and repetition of a test trial would improve the visual recognition memory performance in older adults. Methods: We evaluated visual memory performance in young and older adults on a Yes-No recognition memory test under four different conditions. The conditions consisted of combinations of encoding times of two and four seconds (E2 and E4) and first and second retrieval practice test trials (T1 and T2): E2T1, E2T2, E4T1 and E4T2. Performance was evaluated by measuring hit rates, false alarm rates, discrimination ability and response bias. Results: Older adults showed better improvement of hit rate and discrimination ability under the E4T2 conditions whereas young adults showed better memory performance under the E2T2 conditions. Conclusions: A longer encoding time and repetition of the test was effective in improving the visual memory performance in terms of the hit rates and discrimination ability of older adults. The results suggest that this strategy should be useful in providing a suitable work environment for older workers.

关键词： Aging Discrimination encoding time Recognition memory Repeating test Response bias

来源：评论

学校读者我要写书评

暂无评论

The effect of encoding time on retention by infants and young children

引用

INFANT BEHAVIOR & DEVELOPMENT 2006年第4期29卷 599-602页

作者： Morgan, Kirstie Hayne, Harlene Univ Otago Dept Psychol Dunedin New Zealand

Using a Visual Recognition Memory (VRM) procedure, we examined the effect of encoding time on retention by 1- and 4-year olds. Irrespective of age, shorter familiarization time reduced retention, and longer familiarization time prolonged retention. The amount of familiarization that yielded retention after a given delay decreased as a function of age. (c) 2006 Elsevier Inc. All rights reserved.

关键词： Visual Recognition Memory encoding time infants

来源：评论

学校读者我要写书评

暂无评论

encoding time and signs exposure time in the representation of diagrammatic deontic meanings

引用

ACTA PSYCHOLOGICA 2011年第1期137卷 106-114页

作者： Vargas, Cristina Moreno-Rios, Sergio Castro, Candida Underwood, Geoffrey Univ Granada Dpto Psicol Social & Metodol Ciencias Comportamie Fac Psicol Sch Psychol Granada 18011 Spain Univ Nottingham Sch Psychol Nottingham NG7 2RD England

It has been proposed that prohibition and obligation be represented in different ways in reasoning with deontic information (Bucciarelli & Johnson-Laird, 2005). Obligations are salient in permissible situations and prohibitions in impermissible situations. In some specific cases, differential initial representations are also consistently predicted from the comprehension of negations, if prohibition is considered as the negation of an obligation. Three experiments evaluate whether traffic signs of prohibition and obligation speed up the response time to the proposed direction represented and whether this advantage remains when people have more time to think. When making judgements about the manoeuvre performed by a vehicle, participants' response times are consistent with the predicted representation when they have a short time (i.e., 300 ms) to understand the premise. In this case they represent what is permissible by obligatory signs and also what is impermissible by prohibitory signs. However, if they have more time (i.e., 1000 ms) to understand the premise, they still represent what is permissible by obligatory signs but they seem to change their initial representations to what is permissible by prohibitory signs. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Deontics Negation Mental models Deductive reasoning Diagrammatic premise encoding time Traffic signs

来源：评论

学校读者我要写书评

暂无评论

The rise and fall of memories: Temporal dynamics of visual working memory

引用

MEMORY & COGNITION 2025年 1-18页

作者： Sahakian, Andre Gayet, Surya Paffen, Chris L. E. Van der Stigchel, Stefan Univ Utrecht Helmholtz Inst Expt Psychol Heidelberglaan 1 NL-3584 CS Utrecht Netherlands

Visual working memory (VWM) is a cognitive system, which temporarily stores task-relevant visual information to enable interactions with the environment. In everyday VWM use, we typically decide how long we look to encode information, and how long we wait before acting on the memory. In contrast, VWM is typically studied in unnaturally rigid paradigms that keep presentation times and delays fixed. Here, we ask how visual memories build up over self-paced viewing times, and how they decay over self-paced delays, in a task that naturally engages VWM. We employed a copying task in which participants were tasked to recreate an "example" arrangement of items in an adjacent empty "workspace". We tracked their unconstrained viewing and copying behavior at the level of individual items' viewing times and the time to successful placements (i.e., delay). Our results show that performance monotonically increased for viewing times up to 1 s (per item), and plateaued afterwards. Interestingly, while views exceeding 1 s did not strongly improve performance for short (2-s) delays, views beyond 1-s did improve performance for longer delays. In contrast, this pattern was not observed in Experiments 2A and 2B, where viewing and delay times were experimentally manipulated (i.e., in more typical, rigid paradigms). These findings showcase the importance of considering aspects of naturalistic behavior, like decision-making, when studying VWM. We suggest that in everyday situations, short glances are sufficient for immediate use from VWM, but long views are required for effective delayed use.

关键词： Visual working memory Copying task encoding time Retention time Active vision

来源：评论

学校读者我要写书评

暂无评论

Fast fractal image compression algorithm using specific update search

引用

IET IMAGE PROCESSING 2020年第9期14卷 1733-1739页

作者： Zheng, Yunping Li, Xiangpeng Sarem, Mudar South China Univ Technol Sch Comp Sci & Engn Guangzhou Peoples R China Huazhong Univ Sci & Technol Sch Software Engn Wuhan Peoples R China Gen Org Remote Sensing Damascus Syria

The fractal image compression (FIC) algorithm is difficult to be widely used in real-time applications due to the huge consumption of its encoding time. Inspired by the fact that in the decoding process, for any original image, a fixed point is generated by the iterations of the fractal codes, the authors propose a specific update search FIC (SUSFIC) algorithm, which uses a scale number to control the update times of the fractal codes and to find acceptable matching domain blocks rather than the best ones in the selected domain blocks pool. To further reduce the computation time, in their proposed algorithm, the image blocks created by the equidistant sampling in the range of the original blocks are used to replace themselves when calculating the correlation coefficients as the distances between the adjacent domain blocks. The experimental results presented show that their proposed SUSFIC algorithm has a significant improvement in encoding time under the premise of setting an appropriate search update threshold and maintaining image quality when compared with the state-of-the-art FIC algorithms. Therefore, it is a better FIC algorithm.

关键词： fractals image coding image reconstruction data compression adjacent domain blocks SUSFIC algorithm encoding time appropriate search update threshold maintaining image quality state-of-the-art FIC algorithms fast fractal image compression algorithm real-time applications encoding process reconstructed image decoding process fractal codes specific update search FIC algorithm update times acceptable matching domain blocks selected domain blocks pool computation time image blocks original blocks

来源：评论

学校读者我要写书评

暂无评论

Light Field Multi-View Video Coding With Two-Directional Parallel Inter-View Prediction

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2016年第11期25卷 5104-5117页

作者： Wang, Gengkun Xiang, Wei Pickering, Mark Chen, Chang Wen Univ Southern Queensland Sch Mech & Elect Engn Toowoomba Qld 4350 Australia James Cook Univ Coll Sci Technol & Engn Cairns Qld 4870 Australia UNSW Sch Engn & Informat Technol Canberra ACT 2600 Australia SUNY Buffalo Dept Comp Sci & Engn Buffalo NY 14260 USA

Light field (LF) technology has been popularly adopted by a wide range of conventional industries. However, one problem when dealing with LFs is the sheer size of data volume. There have been many multi-view video coding (MVC)-based LF video coding methods reported in the literature, aiming at finding the best prediction structure for LF video coding. It is clear that the number of possible prediction structures is unlimited, and it is also observed that the coding bit-rate can be reduced by increasing the number of bi-directionally encoded views in the prediction structure. However, none work has been conducted to analyze the relationship of the prediction structure with its coding performance. In light of this observation, we first design a new LF-MVC prediction structure by extending the inter-view prediction into a two-directional parallel structure. Analytical models for source coding rate and encoding time are developed to analyze their relationships with the prediction structure, and are proven to be well-matched to our experimental results. Experimental evaluation of two LF video sequences demonstrates that the proposed LF-MVC prediction structure can achieve a factor of 26% bit-rate reduction against the conventional MVC prediction structure for an LF video with 5 x 5 views, and a further 34% bit-rate reduction for an LF video with a larger 10 x 10 views. Compared with the state-of-the-art MVC-based LF video coding prediction structures in the literature, LF-MVC can achieve the best coding performance, and with its high encoding efficiency, is well suited for deployment in practical LF-based 3D systems.

关键词： Light field video multi-view video coding prediction structure source coding rate encoding time

来源：评论

学校读者我要写书评

暂无评论

Fractal image compression using a fast affine transform and hierarchical classification scheme

引用

VISUAL COMPUTER 2022年第11期38卷 3867-3880页

作者： Nandi, Utpal Vidyasagar Univ Dept Comp Sci Midnapore 721102 W Bengal India

Fractal image compression is one of the efficient structure-based methods in applications where images are compressed only once but decoded several times due to its resolution-independent feature and fast reconstruction time. However, it has high computational complexity restricting practical use most of the time. Although several methods have been developed to speed up the compression process, these do not satisfy the compression time or the decoded image quality requirements. The affine transforms of image blocks used in fractal coding require a huge number of multiplications and additions and are very expensive in computation that may also slow down the compression process. This paper presents a novel fractal image compression using a fast affine transform and hierarchical classification scheme. The applied affine transform computation algorithm of image blocks uses relationships among neighboring pixels of transformed image block that significantly reduces the number of multiplication and addition operations. Then, this strategy with hierarchical classification and class-wise domain sorting is applied in fractal coding with quad-tree and horizontal vertical partitioning schemes to reduce compression time. Experimental results show that the quad-tree-based fractal coding with the proposed scheme can significantly speed up the compression process keeping image quality and compression ratio almost unchanged.

关键词： Fractal image compression Affine transform encoding time Compression ratio Image quality Iterated function system

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：