Titlebook: Discrete Geometry for Computer Imagery; 13th International C Attila Kuba,László G. Nyúl,Kálmán Palágyi Conference proceedings 2006 Springer

cerebral-cortex

書目名稱Discrete Geometry for Computer Imagery影響因子(影響力)




書目名稱Discrete Geometry for Computer Imagery影響因子(影響力)學(xué)科排名




書目名稱Discrete Geometry for Computer Imagery網(wǎng)絡(luò)公開度




書目名稱Discrete Geometry for Computer Imagery網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Discrete Geometry for Computer Imagery被引頻次




書目名稱Discrete Geometry for Computer Imagery被引頻次學(xué)科排名




書目名稱Discrete Geometry for Computer Imagery年度引用




書目名稱Discrete Geometry for Computer Imagery年度引用學(xué)科排名




書目名稱Discrete Geometry for Computer Imagery讀者反饋




書目名稱Discrete Geometry for Computer Imagery讀者反饋學(xué)科排名

OWL

Neutral-Spine

Duality and Geometry Straightness, Characterization and EnvelopeDuality applied to geometrical problems is widely used in many applications in computer vision or computational geometry. A classical example is the Hough Transform to detect linear structures in images. In this paper, we focus on two kinds of duality/polarity applied to geometrical problems: digital straightness detection and envelope computation.

lambaste

思鄉(xiāng)病

instructive

Geometry of Neighborhood Sequences in Hexagonal Gridtain values 1, 2 and 3. The grid is coordinatized by three coordinates in a symmetric way. Digital circles are classified based on digital distances using neighborhood sequences. They can be triangle, hexagon, enneagon and dodecagon. The corners of the convex hulls of these polygons are computed.

instructive

具體

Anonymous

A Network Flow Algorithm for Binary Image Reconstruction from Few Projections, black-and-white) that do . have an intrinsic lattice structure from a small number of projections. We describe how the reconstruction problem from only two projections can be formulated as a network flow problem in a graph, which can be solved efficiently. When only two projections are used, the r

危機(jī)