Polyhedral Conic Classifiers for Computer Vision Applications and Open Set Recognition

2021 ◽  
Vol 43 (2) ◽  
pp. 608-622
Author(s):  
Hakan Cevikalp ◽  
Halil Saglamlar
2021 ◽  
pp. 1-14
Author(s):  
Prathibha Varghese ◽  
G. Arockia Selva Saroja

Nature-inspired computing has been a real source of motivation for the development of many meta-heuristic algorithms. The biological optic system can be patterned as a cascade of sub-filters from the photoreceptors over the ganglion cells in the fovea to some simple cells in the visual cortex. This spark has inspired many researchers to examine the biological retina in order to learn more about information processing capabilities. The photoreceptor cones and rods in the human fovea resemble hexagon more than a rectangular structure. However, the hexagonal meshes provide higher packing density, consistent neighborhood connectivity, and better angular correction compared to the rectilinear square mesh. In this paper, a novel 2-D interpolation hexagonal lattice conversion algorithm has been proposed to develop an efficient hexagonal mesh framework for computer vision applications. The proposed algorithm comprises effective pseudo-hexagonal structures which guarantee to keep align with our human visual system. It provides the hexagonal simulated images to visually verify without using any hexagonal capture or display device. The simulation results manifest that the proposed algorithm achieves a higher Peak Signal-to-Noise Ratio of 98.45 and offers a high-resolution image with a lesser mean square error of 0.59.


2021 ◽  
Author(s):  
Shuyuan Xu ◽  
Linsen Li ◽  
Hangjun Yang ◽  
Junhua Tang

2013 ◽  
pp. 381-421 ◽  
Author(s):  
Mario Vento ◽  
Pasquale Foggia

Many computer vision applications require a comparison between two objects, or between an object and a reference model. When the objects or the scenes are represented by graphs, this comparison can be performed using some form of graph matching. The aim of this chapter is to introduce the main graph matching techniques that have been used for computer vision, and to relate each application with the techniques that are most suited to it.


Author(s):  
Mario Vento ◽  
Pasquale Foggia

Many computer vision applications require a comparison between two objects, or between an object and a reference model. When the objects or the scenes are represented by graphs, this comparison can be performed using some form of graph matching. The aim of this chapter is to introduce the main graph matching techniques that have been used for computer vision, and to relate each application with the techniques that are most suited to it.


Sign in / Sign up

Export Citation Format

Share Document