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 Experiment Videos

Supervised hashing using graph cuts and boosted decision trees.

Guosheng Lin, Chunhua Shen, Anton van den Hengel

    IEEE Transactions on Pattern Analysis and Machine Intelligence
    |October 7, 2015
    PubMed
    Summary
    This summary is machine-generated.

    Related Concept Videos

    Survival Tree01:19

    Survival Tree

    496
    Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
     Building a Survival Tree
    Constructing a...
    496

    You might also read

    Related Articles

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

    Sort by
    Same author

    Integrating SAM Supervision for 3D Weakly Supervised Point Cloud Segmentation.

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

    Determination of non-volatile metabolic profiles and their sensory relevance in different grades of brandy through widely targeted metabolomics.

    Food chemistry: X·2026
    Same author

    For Intermediate-Size Sessile Serrated Lesions, Durable Clearance Should Remain the Decisive Endpoint.

    United European gastroenterology journal·2026
    Same author

    Therapeutic potential of wogonoside in hypertension-induced cardiac injury: Targeting apoptosis and MAPK signaling pathway.

    The Journal of nutritional biochemistry·2026
    Same author

    Atlas of predicted protein complex structures across kingdoms.

    Nature communications·2026
    Same author

    The Clinical Utility of Whole-Exome Sequencing in the Prenatal Diagnosis of Fetal Skeletal Dysplasia.

    International journal of women's health·2026
    Same journal

    Relation DETR+: Exploring Explicit Position Relation Prior for Dense Prediction.

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

    RBF++: Quantifying and Optimizing Reasoning Boundaries across Measurable and Unmeasurable Capabilities for Chain-of-Thought Reasoning.

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

    CAFE: Cross-View Adaptive Fusion and Cluster Center Enhancement for Robust Multi-View Clustering.

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

    DIVER: Reinforced Diffusion Breaks Imitation Bottlenecks in End-to-End Autonomous Driving.

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

    Ethics-Aware Safe Reinforcement Learning for Rare-Event Risk Control in Interactive Urban Driving.

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

    Learning Shape Anchors for Holistic Indoor Scene Understanding.

    IEEE transactions on pattern analysis and machine intelligence·2026
    See all related articles

    This study introduces a flexible framework for supervised hashing in image retrieval. It simplifies developing new methods and significantly improves performance on high-dimensional data.

    Area of Science:

    • Computer Science
    • Machine Learning
    • Image Retrieval

    Background:

    • Supervised hashing maps image features to binary codes for efficient retrieval.
    • Existing methods often use inflexible, tightly coupled hash functions and optimization processes.
    • This limits adaptability and can lead to complex optimization challenges.

    Purpose of the Study:

    • To develop a flexible framework for supervised hashing that accommodates diverse loss and hash functions.
    • To simplify the development of new, problem-specific hashing methods.
    • To improve the performance and scalability of query-by-example image retrieval systems.

    Main Methods:

    • Decomposed the hashing learning problem into binary code learning and hash function learning.
    • Formulated binary code learning as submodular binary quadratic problems solvable with graph cuts.

    Related Experiment Videos

  • Employed boosted decision trees as nonlinear, descriptive, and efficient hash functions.

    • Main Results:

    • The proposed framework accommodates various existing and new hashing approaches.
    • Efficient graph cut methods are applicable for large-scale binary code inference.
    • Boosted decision trees offer speed and effectiveness on high-dimensional data.

    Conclusions:

    • The novel framework significantly outperforms state-of-the-art methods, particularly on high-dimensional datasets.
    • The approach enhances flexibility and simplifies the creation of supervised hashing techniques.
    • This work advances large-scale query-by-example image retrieval systems.