Advanced Hough-based method for on-device document localization
- URL: http://arxiv.org/abs/2106.09987v1
- Date: Fri, 18 Jun 2021 08:17:45 GMT
- Title: Advanced Hough-based method for on-device document localization
- Authors: D.V. Tropin, A.M. Ershov, D.P. Nikolaev and V.V. Arlazarov
- Abstract summary: In this work, we consider document location in an image without prior knowledge of the document content or its internal structure.
We propose an advanced Hough-based method which accounts for the geometric invariants of the central projection model.
When evaluated on a more challenging MIDV-500 dataset, the proposed algorithm guaranteed the best precision compared to published methods.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The demand for on-device document recognition systems increases in
conjunction with the emergence of more strict privacy and security
requirements. In such systems, there is no data transfer from the end device to
a third-party information processing servers. The response time is vital to the
user experience of on-device document recognition. Combined with the
unavailability of discrete GPUs, powerful CPUs, or a large RAM capacity on
consumer-grade end devices such as smartphones, the time limitations put
significant constraints on the computational complexity of the applied
algorithms for on-device execution.
In this work, we consider document location in an image without prior
knowledge of the document content or its internal structure. In accordance with
the published works, at least 5 systems offer solutions for on-device document
location. All these systems use a location method which can be considered
Hough-based. The precision of such systems seems to be lower than that of the
state-of-the-art solutions which were not designed to account for the limited
computational resources.
We propose an advanced Hough-based method. In contrast with other approaches,
it accounts for the geometric invariants of the central projection model and
combines both edge and color features for document boundary detection. The
proposed method allowed for the second best result for SmartDoc dataset in
terms of precision, surpassed by U-net like neural network. When evaluated on a
more challenging MIDV-500 dataset, the proposed algorithm guaranteed the best
precision compared to published methods. Our method retained the applicability
to on-device computations.
Related papers
- HeteroEdge: Addressing Asymmetry in Heterogeneous Collaborative
Autonomous Systems [1.274065448486689]
We propose a self-adaptive optimization framework for a testbed comprising two Unmanned Ground Vehicles (UGVs) and two NVIDIA Jetson devices.
This framework efficiently manages multiple tasks (storage, processing, computation, transmission, inference) on heterogeneous nodes concurrently.
It involves compressing and masking input image frames, identifying similar frames, and profiling devices to obtain boundary conditions for optimization.
arXiv Detail & Related papers (2023-05-05T02:43:16Z) - Task-Oriented Over-the-Air Computation for Multi-Device Edge AI [57.50247872182593]
6G networks for supporting edge AI features task-oriented techniques that focus on effective and efficient execution of AI task.
Task-oriented over-the-air computation (AirComp) scheme is proposed in this paper for multi-device split-inference system.
arXiv Detail & Related papers (2022-11-02T16:35:14Z) - Task-Oriented Sensing, Computation, and Communication Integration for
Multi-Device Edge AI [108.08079323459822]
This paper studies a new multi-intelligent edge artificial-latency (AI) system, which jointly exploits the AI model split inference and integrated sensing and communication (ISAC)
We measure the inference accuracy by adopting an approximate but tractable metric, namely discriminant gain.
arXiv Detail & Related papers (2022-07-03T06:57:07Z) - Device-independent Quantum Fingerprinting for Large Scale Localization [6.141741864834815]
We present QHFP, a device-independent quantum fingerprint matching algorithm.
In particular, we present a quantum algorithm with a complexity that is exponentially better than the classical techniques.
Results confirm the ability of QHFP to obtain the correct estimated location with an exponential improvement in space and running time.
arXiv Detail & Related papers (2022-06-22T04:35:17Z) - ZippyPoint: Fast Interest Point Detection, Description, and Matching
through Mixed Precision Discretization [71.91942002659795]
We investigate and adapt network quantization techniques to accelerate inference and enable its use on compute limited platforms.
ZippyPoint, our efficient quantized network with binary descriptors, improves the network runtime speed, the descriptor matching speed, and the 3D model size.
These improvements come at a minor performance degradation as evaluated on the tasks of homography estimation, visual localization, and map-free visual relocalization.
arXiv Detail & Related papers (2022-03-07T18:59:03Z) - Benchmarking Quality-Dependent and Cost-Sensitive Score-Level Multimodal
Biometric Fusion Algorithms [58.156733807470395]
This paper reports a benchmarking study carried out within the framework of the BioSecure DS2 (Access Control) evaluation campaign.
The campaign targeted the application of physical access control in a medium-size establishment with some 500 persons.
To the best of our knowledge, this is the first attempt to benchmark quality-based multimodal fusion algorithms.
arXiv Detail & Related papers (2021-11-17T13:39:48Z) - Are we ready for beyond-application high-volume data? The Reeds robot
perception benchmark dataset [3.781421673607643]
This paper presents a dataset, called Reeds, for research on robot perception algorithms.
The dataset aims to provide demanding benchmark opportunities for algorithms, rather than providing an environment for testing application-specific solutions.
arXiv Detail & Related papers (2021-09-16T23:21:42Z) - Quantum verification and estimation with few copies [63.669642197519934]
The verification and estimation of large entangled systems represents one of the main challenges in the employment of such systems for reliable quantum information processing.
This review article presents novel techniques focusing on a fixed number of resources (sampling complexity) and thus prove suitable for systems of arbitrary dimension.
Specifically, a probabilistic framework requiring at best only a single copy for entanglement detection is reviewed, together with the concept of selective quantum state tomography.
arXiv Detail & Related papers (2021-09-08T18:20:07Z) - Approach for Document Detection by Contours and Contrasts [0.0]
This paper considers arbitrary document detection performed on a mobile device.
We propose a modification of the contour-based method, in which the competing contour location hypotheses are ranked according to the contrast between the areas inside and outside the border.
The proposed method provides unmatched state-of-the-art performance on the open MIDV-500 dataset, and it demonstrates results comparable with state-of-the-art performance on the SmartDoc dataset.
arXiv Detail & Related papers (2020-08-06T12:44:40Z) - PrimiTect: Fast Continuous Hough Voting for Primitive Detection [49.72425950418304]
Our method classifies points into different geometric primitives, such as planes and cones, leading to a compact representation of the data.
We use a local, low-dimensional parameterization of primitives to determine type, shape and pose of the object that a point belongs to.
This makes our algorithm suitable to run on devices with low computational power, as often required in robotics applications.
arXiv Detail & Related papers (2020-05-15T10:16:07Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.