58,520 research outputs found
Classification Committee for Active Deep Object Detection
In object detection, the cost of labeling is much high because it needs not
only to confirm the categories of multiple objects in an image but also to
accurately determine the bounding boxes of each object. Thus, integrating
active learning into object detection will raise pretty positive significance.
In this paper, we propose a classification committee for active deep object
detection method by introducing a discrepancy mechanism of multiple classifiers
for samples' selection when training object detectors. The model contains a
main detector and a classification committee. The main detector denotes the
target object detector trained from a labeled pool composed of the selected
informative images. The role of the classification committee is to select the
most informative images according to their uncertainty values from the view of
classification, which is expected to focus more on the discrepancy and
representative of instances. Specifically, they compute the uncertainty for a
specified instance within the image by measuring its discrepancy output by the
committee pre-trained via the proposed Maximum Classifiers Discrepancy Group
Loss (MCDGL). The most informative images are finally determined by selecting
the ones with many high-uncertainty instances. Besides, to mitigate the impact
of interference instances, we design a Focus on Positive Instances Loss (FPIL)
to make the committee the ability to automatically focus on the representative
instances as well as precisely encode their discrepancies for the same
instance. Experiments are conducted on Pascal VOC and COCO datasets versus some
popular object detectors. And results show that our method outperforms the
state-of-the-art active learning methods, which verifies the effectiveness of
the proposed method
Hypergraph Modelling for Geometric Model Fitting
In this paper, we propose a novel hypergraph based method (called HF) to fit
and segment multi-structural data. The proposed HF formulates the geometric
model fitting problem as a hypergraph partition problem based on a novel
hypergraph model. In the hypergraph model, vertices represent data points and
hyperedges denote model hypotheses. The hypergraph, with large and
"data-determined" degrees of hyperedges, can express the complex relationships
between model hypotheses and data points. In addition, we develop a robust
hypergraph partition algorithm to detect sub-hypergraphs for model fitting. HF
can effectively and efficiently estimate the number of, and the parameters of,
model instances in multi-structural data heavily corrupted with outliers
simultaneously. Experimental results show the advantages of the proposed method
over previous methods on both synthetic data and real images.Comment: Pattern Recognition, 201
- …