A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Filters
Improving Leaf Classification Rate via Background Removal and ROI Extraction
2016
Journal of Image and Graphics
That is, the proposed method includes color transformation, preprocessing (background removal and ROI extraction), feature extraction and description, and classification. ...
To overcome problems occurring due to noisy image quality, background removal is done before extracting features from the image. ...
Jeffrey Lee and Walter Slo-combe, who assisted editing the English language for this article. ...
doi:10.18178/joig.4.2.93-98
fatcat:kcmlow7rynec7jq4kthihks6ge
Visual Correspondence Grouping via Local Consistent Neighborhood
2013
IEICE transactions on information and systems
We first extract visual keypoints from images and establish initial point correspondences between two images by comparing their descriptors. ...
A relational graph of a point is constructed by thresholding geometric and topological distances between the point and its neighboring points. ...
A relational graph is built as follows: First, Delaunay triangulation is constructed from a set of keypoints over an image. ...
doi:10.1587/transinf.e96.d.1351
fatcat:m3poq7mp4rbcvm47ws4vx5khli
Weakly supervised learning from scale invariant feature transform keypoints: an approach combining fast eigendecompostion, regularization, and diffusion on graphs
2014
Journal of Electronic Imaging (JEI)
First, we propose a spectral graph embedding of the SIFT points for dimensionality reduction, which provides efficient keypoints transcription into a Euclidean manifold. ...
Then, we describe a variational framework for manifold denoising based on p-Laplacian to enhance keypoints classification, thereby lessening the negative impact of outliers onto our variational shape framework ...
We also would like the thank Professor Abder Elmoataz for discussions about the discrete p-regularization and its constructive remarks. ...
doi:10.1117/1.jei.23.1.013009
fatcat:k6vplew62nbtnhytg5d5bhe4re
Annotated Free-Hand Sketches for Video Retrieval Using Object Semantics and Motion
[chapter]
2012
Lecture Notes in Computer Science
Whilst visually expressive, such systems present an imprecise vehicle for conveying the semantics (e.g. object types) within a scene. ...
The locations of SIFT keypoints are transformed using the inverse homography to effect compensate for camera motion during the clip. ...
The interframe homography is estimated via MAPSAC using the keypoint correspondences. ...
doi:10.1007/978-3-642-27355-1_44
fatcat:vzjecfksnjeqzlwolka2p4azli
ObjectMatch: Robust Registration using Canonical Object Correspondences
[article]
2023
arXiv
pre-print
In this work, we propose to leverage indirect correspondences obtained via semantic object identification. ...
We present ObjectMatch, a semantic and object-centric camera pose estimator for RGB-D SLAM pipelines. ...
Another related direction is feature hallucination by leveraging image and object semantics. ...
arXiv:2212.01985v2
fatcat:agmlebtyejhhppqwiakwepky4e
An Advanced Rotation Invariant Descriptor for SAR Image Registration
2017
Remote Sensing
The SIFT-like algorithms maintain rotation invariance by assigning a dominant orientation for each keypoint, while the calculation of dominant orientation is not robust due to the effect of speckle noise ...
The Scale-Invariant Feature Transform (SIFT) algorithm and its many variants have been widely used in Synthetic Aperture Radar (SAR) image registration. ...
Acknowledgments: The authors would like to thank Zelian Wen from Xidian University for providing the source code of SAR-SIFT algorithm and comments from the anonymous reviewers. ...
doi:10.3390/rs9070686
fatcat:33pzzmtp3vf2pfjws57dpcmivm
DGC-GNN: Leveraging Geometry and Color Cues for Visual Descriptor-Free 2D-3D Matching
[article]
2024
arXiv
pre-print
In this paper, we introduce DGC-GNN, a novel algorithm that employs a global-to-local Graph Neural Network (GNN) that progressively exploits geometric and color cues to represent keypoints, thereby improving ...
Matching 2D keypoints in an image to a sparse 3D point cloud of the scene without requiring visual descriptors has garnered increased interest due to its low memory requirements, inherent privacy preservation ...
We acknowledge the computational resources provided by the CSC-IT Center for Science, Finland. ...
arXiv:2306.12547v2
fatcat:vhsxulg2pje6vnhyqulctib4vy
An Ensemble Approach to Image Matching Using Contextual Features
2015
IEEE Transactions on Image Processing
(HOG information in top right image is colored according to the dominant gradient direction for each cell.) Linear and HOG information is used to verify new matches. ...
Top: The majority of the SIFT (green) and linearly-verified (red) keypoint matches for this pair are incorrect and cannot be used to align the images. ...
Bottom Right: HOG descriptors for cells in the neighborhood. Cells are colored according to dominant gradient direction. ...
doi:10.1109/tip.2015.2456498
pmid:26186783
fatcat:grxkak7gjjditjp5t7uo4ylamu
Superpixel-Based Feature Tracking for Structure from Motion
2019
Applied Sciences
Second, the superpixel-based approach is used to generate labels for the input image. ...
Third, we combine the Speed Up Robust Feature and binary test in the generated label regions to produce a set of combined descriptors for the detected keypoints. ...
For a given image in CIELAB color space, the candidate keypoints, K slic , could be obtained by SLIC algorithm as described in Section 3. ...
doi:10.3390/app9152961
fatcat:zsk6pmnvczhshehevdxt4bguze
Fast and robust 3D feature extraction from sparse point clouds
2016
2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
We evaluate the performance of our algorithm on an autonomous car at the MCity Test Facility using a Velodyne HDL-32E, and we compare our results against the state-of-theart NARF keypoint detector. ...
Fig. 6 shows an example of optimization of two graphs constructed by using the output features of our method, and the NARF keypoints. ...
The right image of Fig. 6 , instead, depicts the optimized graph when using NARF keypoints. ...
doi:10.1109/iros.2016.7759604
dblp:conf/iros/SerafinOG16
fatcat:ysamoer7ezb6jhvdurt3xjtkfe
Multiple Hypotheses Image Segmentation and Classification With Application to Dietary Assessment
2015
IEEE journal of biomedical and health informatics
Finally, in [12], color, Gabor filters, LBP, and SIFT features are encoded using sparse coding and classified using multiclass SVM. ...
In [10], automatic food identification is achieved by integrating three sets of features namely color, texture, and scale invariant feature transform (SIFT) descriptors. ...
128/keypoint
0.44
0.48
Red-SIFT
Local
128/keypoint
0.45
0.48
Green-SIFT
Local
128/keypoint
0.44
0.49
Blue-SIFT
Local
128/keypoint
0.47
0.47
SURE
Local
128/keypoint
0.43
0.45 ...
doi:10.1109/jbhi.2014.2304925
pmid:25561457
pmcid:PMC5027140
fatcat:eaym6kd3hbai7izxozuv6w2ywy
Who's Afraid of Adversarial Queries? The Impact of Image Modifications on Content-based Image Retrieval
[article]
2019
arXiv
pre-print
Our experiments also compare PIRE (a neural approach) with existing keypoint removal and injection approaches (which modify local features). ...
We introduce an innovative neural image perturbation approach, called Perturbations for Image Retrieval Error (PIRE), that is capable of blocking neural-feature-based CBIR. ...
ACKNOWLEDGMENTS This work is part of the Open Mind research program, financed by the Netherlands Organization for Scientific Research (NWO). ...
arXiv:1901.10332v3
fatcat:e6hgwcniynau7dvnya2e3qx25e
C^3Fusion: Consistent Contrastive Colon Fusion, Towards Deep SLAM in Colonoscopy
[article]
2022
arXiv
pre-print
Given {T ij }, we construct a pose-graph [13] with vertices {f i } and edges T ij . ...
each frame, and extracts their deep feature representations z = φ(kp), where kp is a SIFT keypoint in 2D pixel coordinates. ...
We center-crop the synthetic images to 400×400 to remove vignetting effects. The Colon10k images are provided in an un-distorted and center-cropped version of 270x216 pixels. ...
arXiv:2206.01961v1
fatcat:q7vwuwsp7rdznm6wc37jdhgdte
3D reconstruction of underwater scenes from uncalibrated video sequences
2009
2009 IEEE 17th Signal Processing and Communications Applications Conference
Graph Construction The structure of the graph is determined by the current labeling and the label α . The red marks on images in the right part shows the occlusions. ...
coordinates ,
Re-converting the Color Space and Equalizing Color Mean The image is converted from YCbCr color space back to RGB. ...
The weights of the edges are: Table 10 The weights of the edges in the graph.
Edge Weight Reason Any cut C on graph G must contain one t-link for each pixel. ...
doi:10.1109/siu.2009.5136343
fatcat:zcuzlr7kxrgn3cm2w6gu5itqjq
EMCM: A Novel Binary Edge-Feature-Based Maximum Clique Framework for Multispectral Image Matching
2019
Remote Sensing
strong edge binary feature descriptor, (2) a new correspondence-ranking algorithm based on keypoint distinctiveness analysis algorithms in the feature space of the graph, and (3) a false match removal ...
algorithm based on maximum clique searching in the correspondence space of the graph considering both position and angle consistency. ...
Ma Tao for providing the experimental results of HOSM to us, the anonymous reviewers for their valuable comments, and the members of the editorial team for their hard work. ...
doi:10.3390/rs11243026
fatcat:r3gbnwa6sjfwzhtalubxhmqefu
« Previous
Showing results 1 — 15 out of 559 results