Loading…

Centroid Distance Keypoint Detector for Colored Point Clouds

Keypoint detection serves as the basis for many computer vision and robotics applications. Despite the fact that colored point clouds can be readily obtained, most existing keypoint detectors extract only geometry-salient keypoints, which can impede the overall performance of systems that intend to...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2023-06
Main Authors: Teng, Hanzhe, Chatziparaschis, Dimitrios, Kan, Xinyue, Roy-Chowdhury, Amit K, Karydis, Konstantinos
Format: Article
Language:English
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Teng, Hanzhe
Chatziparaschis, Dimitrios
Kan, Xinyue
Roy-Chowdhury, Amit K
Karydis, Konstantinos
description Keypoint detection serves as the basis for many computer vision and robotics applications. Despite the fact that colored point clouds can be readily obtained, most existing keypoint detectors extract only geometry-salient keypoints, which can impede the overall performance of systems that intend to (or have the potential to) leverage color information. To promote advances in such systems, we propose an efficient multi-modal keypoint detector that can extract both geometry-salient and color-salient keypoints in colored point clouds. The proposed CEntroid Distance (CED) keypoint detector comprises an intuitive and effective saliency measure, the centroid distance, that can be used in both 3D space and color space, and a multi-modal non-maximum suppression algorithm that can select keypoints with high saliency in two or more modalities. The proposed saliency measure leverages directly the distribution of points in a local neighborhood and does not require normal estimation or eigenvalue decomposition. We evaluate the proposed method in terms of repeatability and computational efficiency (i.e. running time) against state-of-the-art keypoint detectors on both synthetic and real-world datasets. Results demonstrate that our proposed CED keypoint detector requires minimal computational time while attaining high repeatability. To showcase one of the potential applications of the proposed method, we further investigate the task of colored point cloud registration. Results suggest that our proposed CED detector outperforms state-of-the-art handcrafted and learning-based keypoint detectors in the evaluated scenes. The C++ implementation of the proposed method is made publicly available at https://github.com/UCR-Robotics/CED_Detector.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2721474106</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2721474106</sourcerecordid><originalsourceid>FETCH-proquest_journals_27214741063</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSwcU7NKynKz0xRcMksLknMS05V8E6tLMjPzCtRcEktSU0uyS9SSANi5_yc_KLUFIUAsJRzTn5pSjEPA2taYk5xKi-U5mZQdnMNcfbQLSjKLyxNLS6Jz8ovLcoDSsUbmRsZmpibGBqYGROnCgAqGzdY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2721474106</pqid></control><display><type>article</type><title>Centroid Distance Keypoint Detector for Colored Point Clouds</title><source>Publicly Available Content Database</source><creator>Teng, Hanzhe ; Chatziparaschis, Dimitrios ; Kan, Xinyue ; Roy-Chowdhury, Amit K ; Karydis, Konstantinos</creator><creatorcontrib>Teng, Hanzhe ; Chatziparaschis, Dimitrios ; Kan, Xinyue ; Roy-Chowdhury, Amit K ; Karydis, Konstantinos</creatorcontrib><description>Keypoint detection serves as the basis for many computer vision and robotics applications. Despite the fact that colored point clouds can be readily obtained, most existing keypoint detectors extract only geometry-salient keypoints, which can impede the overall performance of systems that intend to (or have the potential to) leverage color information. To promote advances in such systems, we propose an efficient multi-modal keypoint detector that can extract both geometry-salient and color-salient keypoints in colored point clouds. The proposed CEntroid Distance (CED) keypoint detector comprises an intuitive and effective saliency measure, the centroid distance, that can be used in both 3D space and color space, and a multi-modal non-maximum suppression algorithm that can select keypoints with high saliency in two or more modalities. The proposed saliency measure leverages directly the distribution of points in a local neighborhood and does not require normal estimation or eigenvalue decomposition. We evaluate the proposed method in terms of repeatability and computational efficiency (i.e. running time) against state-of-the-art keypoint detectors on both synthetic and real-world datasets. Results demonstrate that our proposed CED keypoint detector requires minimal computational time while attaining high repeatability. To showcase one of the potential applications of the proposed method, we further investigate the task of colored point cloud registration. Results suggest that our proposed CED detector outperforms state-of-the-art handcrafted and learning-based keypoint detectors in the evaluated scenes. The C++ implementation of the proposed method is made publicly available at https://github.com/UCR-Robotics/CED_Detector.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Centroids ; Color ; Computational efficiency ; Computer vision ; Computing time ; Detectors ; Eigenvalues ; Reproducibility ; Robotics ; Run time (computers) ; Salience ; Sensors</subject><ispartof>arXiv.org, 2023-06</ispartof><rights>2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2721474106?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,37012,44590</link.rule.ids></links><search><creatorcontrib>Teng, Hanzhe</creatorcontrib><creatorcontrib>Chatziparaschis, Dimitrios</creatorcontrib><creatorcontrib>Kan, Xinyue</creatorcontrib><creatorcontrib>Roy-Chowdhury, Amit K</creatorcontrib><creatorcontrib>Karydis, Konstantinos</creatorcontrib><title>Centroid Distance Keypoint Detector for Colored Point Clouds</title><title>arXiv.org</title><description>Keypoint detection serves as the basis for many computer vision and robotics applications. Despite the fact that colored point clouds can be readily obtained, most existing keypoint detectors extract only geometry-salient keypoints, which can impede the overall performance of systems that intend to (or have the potential to) leverage color information. To promote advances in such systems, we propose an efficient multi-modal keypoint detector that can extract both geometry-salient and color-salient keypoints in colored point clouds. The proposed CEntroid Distance (CED) keypoint detector comprises an intuitive and effective saliency measure, the centroid distance, that can be used in both 3D space and color space, and a multi-modal non-maximum suppression algorithm that can select keypoints with high saliency in two or more modalities. The proposed saliency measure leverages directly the distribution of points in a local neighborhood and does not require normal estimation or eigenvalue decomposition. We evaluate the proposed method in terms of repeatability and computational efficiency (i.e. running time) against state-of-the-art keypoint detectors on both synthetic and real-world datasets. Results demonstrate that our proposed CED keypoint detector requires minimal computational time while attaining high repeatability. To showcase one of the potential applications of the proposed method, we further investigate the task of colored point cloud registration. Results suggest that our proposed CED detector outperforms state-of-the-art handcrafted and learning-based keypoint detectors in the evaluated scenes. The C++ implementation of the proposed method is made publicly available at https://github.com/UCR-Robotics/CED_Detector.</description><subject>Algorithms</subject><subject>Centroids</subject><subject>Color</subject><subject>Computational efficiency</subject><subject>Computer vision</subject><subject>Computing time</subject><subject>Detectors</subject><subject>Eigenvalues</subject><subject>Reproducibility</subject><subject>Robotics</subject><subject>Run time (computers)</subject><subject>Salience</subject><subject>Sensors</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSwcU7NKynKz0xRcMksLknMS05V8E6tLMjPzCtRcEktSU0uyS9SSANi5_yc_KLUFIUAsJRzTn5pSjEPA2taYk5xKi-U5mZQdnMNcfbQLSjKLyxNLS6Jz8ovLcoDSsUbmRsZmpibGBqYGROnCgAqGzdY</recordid><startdate>20230615</startdate><enddate>20230615</enddate><creator>Teng, Hanzhe</creator><creator>Chatziparaschis, Dimitrios</creator><creator>Kan, Xinyue</creator><creator>Roy-Chowdhury, Amit K</creator><creator>Karydis, Konstantinos</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20230615</creationdate><title>Centroid Distance Keypoint Detector for Colored Point Clouds</title><author>Teng, Hanzhe ; Chatziparaschis, Dimitrios ; Kan, Xinyue ; Roy-Chowdhury, Amit K ; Karydis, Konstantinos</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_27214741063</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Centroids</topic><topic>Color</topic><topic>Computational efficiency</topic><topic>Computer vision</topic><topic>Computing time</topic><topic>Detectors</topic><topic>Eigenvalues</topic><topic>Reproducibility</topic><topic>Robotics</topic><topic>Run time (computers)</topic><topic>Salience</topic><topic>Sensors</topic><toplevel>online_resources</toplevel><creatorcontrib>Teng, Hanzhe</creatorcontrib><creatorcontrib>Chatziparaschis, Dimitrios</creatorcontrib><creatorcontrib>Kan, Xinyue</creatorcontrib><creatorcontrib>Roy-Chowdhury, Amit K</creatorcontrib><creatorcontrib>Karydis, Konstantinos</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Teng, Hanzhe</au><au>Chatziparaschis, Dimitrios</au><au>Kan, Xinyue</au><au>Roy-Chowdhury, Amit K</au><au>Karydis, Konstantinos</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Centroid Distance Keypoint Detector for Colored Point Clouds</atitle><jtitle>arXiv.org</jtitle><date>2023-06-15</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>Keypoint detection serves as the basis for many computer vision and robotics applications. Despite the fact that colored point clouds can be readily obtained, most existing keypoint detectors extract only geometry-salient keypoints, which can impede the overall performance of systems that intend to (or have the potential to) leverage color information. To promote advances in such systems, we propose an efficient multi-modal keypoint detector that can extract both geometry-salient and color-salient keypoints in colored point clouds. The proposed CEntroid Distance (CED) keypoint detector comprises an intuitive and effective saliency measure, the centroid distance, that can be used in both 3D space and color space, and a multi-modal non-maximum suppression algorithm that can select keypoints with high saliency in two or more modalities. The proposed saliency measure leverages directly the distribution of points in a local neighborhood and does not require normal estimation or eigenvalue decomposition. We evaluate the proposed method in terms of repeatability and computational efficiency (i.e. running time) against state-of-the-art keypoint detectors on both synthetic and real-world datasets. Results demonstrate that our proposed CED keypoint detector requires minimal computational time while attaining high repeatability. To showcase one of the potential applications of the proposed method, we further investigate the task of colored point cloud registration. Results suggest that our proposed CED detector outperforms state-of-the-art handcrafted and learning-based keypoint detectors in the evaluated scenes. The C++ implementation of the proposed method is made publicly available at https://github.com/UCR-Robotics/CED_Detector.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2023-06
issn 2331-8422
language eng
recordid cdi_proquest_journals_2721474106
source Publicly Available Content Database
subjects Algorithms
Centroids
Color
Computational efficiency
Computer vision
Computing time
Detectors
Eigenvalues
Reproducibility
Robotics
Run time (computers)
Salience
Sensors
title Centroid Distance Keypoint Detector for Colored Point Clouds
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T02%3A11%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Centroid%20Distance%20Keypoint%20Detector%20for%20Colored%20Point%20Clouds&rft.jtitle=arXiv.org&rft.au=Teng,%20Hanzhe&rft.date=2023-06-15&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2721474106%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_27214741063%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2721474106&rft_id=info:pmid/&rfr_iscdi=true