Jove
Visualize
联系我们
JoVE
x logofacebook logolinkedin logoyoutube logo
关于 JoVE
概览领导团队博客JoVE 帮助中心
作者
出版流程编辑委员会范围与政策同行评审常见问题投稿
图书馆员
用户评价订阅访问资源图书馆顾问委员会常见问题
研究
JoVE JournalMethods CollectionsJoVE Encyclopedia of Experiments存档
教育
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab Manual教师资源中心教师网站
使用条款与条件
隐私政策
政策

相关概念视频

Associative Learning01:27

Associative Learning

370
Associative learning is a fundamental concept in behavioral psychology, wherein a connection is established between two stimuli or events, leading to a learned response. This process is critical in understanding how behaviors are acquired and modified. Conditioning, the mechanism through which associations are formed, can be divided into two main types: classical conditioning and operant conditioning, each elucidating different aspects of associative learning.
Classical conditioning, also known...
370
Multiple Bar Graph01:07

Multiple Bar Graph

5.2K
As the name suggests, a multiple bar graph is the same as a bar graph but has multiple bars to depict relationships between different data values. One can include as many parameters as possible. However, each parameter must have the same unit of measurement.
Each bar or column in the multiple bar graph represents a data value. These graphs are used primarily in interrelating two or more sets of data. The categories of different kinds of data are listed along the horizontal or x-axis, whereas...
5.2K
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

128
The Wilcoxon signed-rank test for matched pairs evaluates the null hypothesis by combining the ranks of differences with their signs. It essentially tests whether the median of the differences in a population of matched pairs is zero. Since the test incorporates more information than the sign test, it generally yields more trustable conclusions. This test also does not require the data to follow a normal distribution, but two conditions must be met for it to be applicable: (1) the data must...
128
Sign Test for Matched Pairs01:17

Sign Test for Matched Pairs

131
The sign test for matched pairs offers a robust method for comparing two paired samples, often for the effects of an intervention in one of them. This method is very useful in situations where the underlying distribution of the data is unknown. The test compares two related samples—often pre- and post-treatment measurements on the same subjects—to determine if there are significant differences in their median values.
To conduct the sign test, we first calculate the differences in...
131
Time-Series Graph00:54

Time-Series Graph

4.4K
A time-series graph is a line graph with repeated measurements taken at successive intervals of time. It is also called a time series chart. To construct a time-series graph, one must look at both pieces of a paired data set. The horizontal axis is used to plot the time increments, and the vertical axis is used to plot the values of the variable that one is measuring. By using the axes in this way, each point on the graph will correspond to time and a measured quantity. The points on the graph...
4.4K
Bar Graph01:07

Bar Graph

16.5K
A bar graph is also called a bar chart and consists of bars that are separated from each other. It either uses horizontal or vertical bars to show comparisons among categories. The bars can be rectangles, or they can be rectangular boxes (used in three-dimensional plots). One axis of the graph represents the specific categories being compared, and the other axis shows a discrete value. In this graph, the length of the bar for each category is proportional to the number or percent of individuals...
16.5K

您也可能阅读

相关文章

通过共同作者、期刊和引用图与本文相关的文章。

排序
Same author

First-in-human evaluation of [<sup>18</sup>F]-AlF-NOTA-neurotensin for NTSR1-targeted imaging of prostate cancer: a head-to-head comparison with [<sup>68</sup>Ga]Ga-PSMA-617.

Annals of medicine·2026
Same author

Comprehensive genomics and functional analyses identify <i>SMARCAL1</i> as a key oncogenic regulator in lung adenocarcinoma.

Translational cancer research·2026
Same author

Starch-Based Conductive Hydrogels for Wearable Sensors: Preparation Methods, Conductive Structures, and Key Performance Enhancement Strategies.

ACS applied materials & interfaces·2026
Same author

Mixed reality assisted target localization for transcranial magnetic stimulation navigation: a feasibility study.

Journal of neuroengineering and rehabilitation·2026
Same author

Effects of Exercise Interventions on Radiation-Induced Trismus and Dysphagia in Patients With Nasopharyngeal Carcinoma: A Systematic Review and Meta-Analysis of Randomized Controlled Trials.

Cancer nursing·2026
Same author

Non-invasive radiogenomic mapping of the SMARCAL1-driven ferroptotic niche is associated with longitudinal MRD-negative surveillance in early-stage NSCLC.

Frontiers in immunology·2026
Same journal

HardFlow: Hard-Constrained Sampling for Flow-Matching Models Via Trajectory Optimization.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Industrial Brain: Self-Evolving Neuro-Symbolic Autonomy with Causal Resilience for Cyber-Physical Systems.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Adaptive Hardness-Driven Dictionary Distillation for Incomplete Streaming View Clustering.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Mixture of Global and Local Experts with Diffusion Transformer for Controllable Face Generation.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Task-KV: Task-aware KV Cache Optimization via Semantic Differentiation of Attention Heads.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Achieving Text-based Person Retrieval with Any Granularity.

IEEE transactions on pattern analysis and machine intelligence·2026
查看所有相关文章

相关实验视频

Updated: Jul 4, 2025

A Knowledge Graph Approach to Elucidate the Role of Organellar Pathways in Disease via Biomedical Reports
07:35

A Knowledge Graph Approach to Elucidate the Role of Organellar Pathways in Disease via Biomedical Reports

Published on: October 13, 2023

1.7K

可学习的图形匹配:数据关联的实用范式.

Jiawei He, Zehao Huang, Naiyan Wang

    IEEE transactions on pattern analysis and machine intelligence
    |February 6, 2024
    PubMed
    概括
    此摘要是机器生成的。

    本研究介绍了一种新的可学习图形匹配方法,用于计算机视觉任务,如对象跟踪. 它有效地整合了内部视图上下文和优化,在多个基准中实现了最先进的结果.

    更多相关视频

    A Virtual Machine Platform for Non-Computer Professionals for Using Deep Learning to Classify Biological Sequences of Metagenomic Data
    09:34

    A Virtual Machine Platform for Non-Computer Professionals for Using Deep Learning to Classify Biological Sequences of Metagenomic Data

    Published on: September 25, 2021

    4.0K
    A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
    08:12

    A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

    Published on: March 1, 2022

    2.5K

    相关实验视频

    Last Updated: Jul 4, 2025

    A Knowledge Graph Approach to Elucidate the Role of Organellar Pathways in Disease via Biomedical Reports
    07:35

    A Knowledge Graph Approach to Elucidate the Role of Organellar Pathways in Disease via Biomedical Reports

    Published on: October 13, 2023

    1.7K
    A Virtual Machine Platform for Non-Computer Professionals for Using Deep Learning to Classify Biological Sequences of Metagenomic Data
    09:34

    A Virtual Machine Platform for Non-Computer Professionals for Using Deep Learning to Classify Biological Sequences of Metagenomic Data

    Published on: September 25, 2021

    4.0K
    A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
    08:12

    A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

    Published on: March 1, 2022

    2.5K

    科学领域:

    • 计算机视觉 计算机视觉
    • 机器学习 机器学习
    • 图形理论 图形理论

    背景情况:

    • 数据关联对于计算机视觉任务至关重要,例如多个对象跟踪 (MOT),图像匹配和点云注册.
    • 现有的方法往往忽略了视图内文本,或未能将深度学习与基于优化的分配相结合.
    • 目前的方法要么从端到端训练深度模型,要么仅依靠预训练的网络来提取特征.

    研究的目的:

    • 为增强数据关联提出一个通用的,可学习的图形匹配方法.
    • 通过结合内部视图背景和优化优势来解决当前方法的局限性.
    • 开发一个端到端可差分的框架用于计算机视觉中的图形匹配.

    主要方法:

    • 模型内视图关系作为一个非定向图,将数据关联转化为图匹配问题.
    • 将图形匹配问题放松到连续的二次编程中,以实现端到端的可微分性.
    • 将训练纳入深图神经网络,使用KarushKuhnTucker (KKT) 条件和隐式函数定理.

    主要成果:

    • 在多个多重对象跟踪 (MOT) 数据集上实现了最先进的性能.
    • 在ScanNet室内数据集上的图像匹配中超越了现有的方法.
    • 在点云注册任务中表现出有竞争力的结果.

    结论:

    • 拟议的可学习图形匹配方法为计算机视觉中的数据关联提供了一个强大的解决方案.
    • 图形建模,优化和深度学习的整合在各种任务中产生了卓越的性能.
    • 这种方法有效地利用内部视图上下文和优化,以提高准确性和通用性.