Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Convolution Properties II01:17

Convolution Properties II

586
The important convolution properties include width, area, differentiation, and integration properties.
The width property indicates that if the durations of input signals are T1 and T2, then the width of the output response equals the sum of both durations, irrespective of the shapes of the two functions. For instance, convolving two rectangular pulses with durations of 2 seconds and 1 second results in a function with a width of 3 seconds.
The area property asserts that the area under the...
586
Convolution Properties I01:20

Convolution Properties I

595
Convolution computations can be simplified by utilizing their inherent properties.
The commutative property reveals that the input and the impulse response of an LTI (Linear Time-Invariant) system can be interchanged without affecting the output:
595
Ogive Graph01:07

Ogive Graph

6.8K
An ogive graph is sometimes called a cumulative frequency polygon. It is one type of frequency polygon that shows cumulative frequency. In other words, the cumulative percentages are added to the graph from left to right. An ogive graph plots cumulative frequency on the vertical y-axis and class boundaries along the horizontal x-axis. It’s very similar to a histogram; only instead of rectangles, an ogive displays a single point where the top right of the rectangle would be. Creating this...
6.8K
Graphing Antiderivatives01:30

Graphing Antiderivatives

69
The concept of an antiderivative is fundamental in calculus, describing how a function's values accumulate over time. This process is closely related to physical motion, such as the movement of a rolling ball. As the ball progresses, its position changes in response to variations in velocity, just as an antiderivative graph reflects the cumulative effect of the original function's values.Graphing an antiderivative requires interpreting how a function's values influence the shape of its...
69
Bar Graph01:07

Bar Graph

22.2K
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...
22.2K
Graphs of Functions01:30

Graphs of Functions

333
Graphs of functions provide a visual representation of how output values change in response to varying inputs. Each point on the graph corresponds to an ordered pair, where the x-coordinate (independent variable) determines the horizontal position and the y-coordinate (dependent variable) determines the vertical position. Linear functions like y = x give a straight line, indicating a constant rate of change.Nonlinear functions display more complex behaviors. Even power functions generate...
333

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Hierarchical Consistency Learning for Test-Time Adaptation in Camouflage Perception.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same author

Knowledge Diffusion-Based Adaptive Alignment with Hierarchical Context for Video Temporal Grounding.

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

OmniCharacter++: Towards Comprehensive Benchmark for Realistic Role-Playing Agents.

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

Vision-Language Collaborative Representation Learning for Action Quality Assessment.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same author

DepMatch: Boosting Semi-Supervised Semantic Segmentation by Exploring Depth Difference Knowledge.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same author

From Channel Bias to Feature Redundancy: Uncovering the "Less Is More" Principle in Few-Shot Learning.

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

Relaxed Stability Conditions for Model Predictive Control of Hybrid Dynamical Systems Using Hybrid Recurrent Neural Networks.

IEEE transactions on cybernetics·2026
Same journal

An Evolutionary Algorithm Assisted by an Ensemble of Pareto-Optimal Surrogate Models.

IEEE transactions on cybernetics·2026
Same journal

A Quantum Self-Attention Neural Network Model on Quantum Circuits.

IEEE transactions on cybernetics·2026
Same journal

Semi-Explicit Solution of Some Discrete-Time Higher-Order-Cost Mean-Field-Type Control.

IEEE transactions on cybernetics·2026
Same journal

A Novel One-Step Small Object Detector for Autonomous Aerial Vehicles.

IEEE transactions on cybernetics·2026
Same journal

Online Data-Driven-Based Optimal Output Tracking Control Without Initial Stabilizing Policy.

IEEE transactions on cybernetics·2026
See all related articles

Related Experiment Video

Updated: Jan 31, 2026

Soft Pneumatic Robot Modulates Graph Theory Metrics of Brain Network for Hand Rehabilitation After Stroke
05:30

Soft Pneumatic Robot Modulates Graph Theory Metrics of Brain Network for Hand Rehabilitation After Stroke

Published on: October 10, 2025

489

Graph Convolutional Network Hashing.

Xiang Zhou, Fumin Shen, Li Liu

    IEEE Transactions on Cybernetics
    |December 21, 2018
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces GCNH, a scalable graph convolutional network for image retrieval. It efficiently generates similarity-preserving binary codes using an asymmetric graph convolutional layer, outperforming existing methods in semi-supervised scenarios.

    More Related Videos

    Network Analysis of the Default Mode Network Using Functional Connectivity MRI in Temporal Lobe Epilepsy
    12:09

    Network Analysis of the Default Mode Network Using Functional Connectivity MRI in Temporal Lobe Epilepsy

    Published on: August 5, 2014

    18.5K

    Related Experiment Videos

    Last Updated: Jan 31, 2026

    Soft Pneumatic Robot Modulates Graph Theory Metrics of Brain Network for Hand Rehabilitation After Stroke
    05:30

    Soft Pneumatic Robot Modulates Graph Theory Metrics of Brain Network for Hand Rehabilitation After Stroke

    Published on: October 10, 2025

    489
    Network Analysis of the Default Mode Network Using Functional Connectivity MRI in Temporal Lobe Epilepsy
    12:09

    Network Analysis of the Default Mode Network Using Functional Connectivity MRI in Temporal Lobe Epilepsy

    Published on: August 5, 2014

    18.5K

    Area of Science:

    • Computer Vision
    • Machine Learning
    • Graph Neural Networks

    Background:

    • Graph-based hashing methods are vital for large-scale image retrieval.
    • Existing methods often rely on computationally expensive binary quadratic programs, limiting scalability.
    • There's a need for efficient and scalable graph hashing techniques.

    Purpose of the Study:

    • To propose a novel graph convolutional network-based hashing framework (GCNH) for scalable image retrieval.
    • To address the limitations of traditional graph hashing methods regarding scalability and out-of-sample extension.
    • To demonstrate the effectiveness of GCNH in semi-supervised hashing scenarios.

    Main Methods:

    • Developed a graph convolutional network-based hashing framework (GCNH).
    • Introduced an asymmetric graph convolutional (AGC) layer for efficient spectral convolution.
    • Applied GCNH to image sets and affinity graphs for similarity-preserving binary embedding.

    Main Results:

    • GCNH demonstrates superior scalability compared to traditional methods.
    • The framework effectively handles out-of-sample extension.
    • Consistent advantages observed in semi-supervised hashing evaluations on CIFAR-10, NUS-WIDE, and ImageNet datasets.

    Conclusions:

    • GCNH offers a scalable and effective solution for graph-based hashing in image retrieval.
    • The asymmetric graph convolutional layer is key to GCNH's performance.
    • GCNH shows significant promise for semi-supervised learning tasks with limited labeled data.