Nahum Kiryati

Dr. Nahum Kiryati


Research Focus & Metrics

Academic Career Length

38Years (1989-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 1991 in Pattern Recognition
Verified
Journal Article
Closed access
NKNahum Kiryati
Nahum Kiryati
YEY. Eldar
Y. Eldar
ABA.M. Bruckstein
A.M. Bruckstein

1 May 1998 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
DCD. Caspi
D. Caspi
NKNahum Kiryati
Nahum Kiryati
JSJ. Shamir
J. Shamir
In range sensing with time-multiplexed structured light, there is a trade-off between accuracy, robustness and the acquisition period. The acquisition period is lower bounded by the product of the number of projection patterns and the time needed for acquiring a single image. In this paper a novel structured light method is described. Adaptation of the number and form of the projection patterns to the characteristics of the scene takes place as part of the acquisition process. Noise margins are matched to the actual noise level, thus reducing the number of projection patterns to the necessary minimum. Color is used for light plane labeling. The dimension of the pattern space (and the noise margins) are thus increased without raising the number of projection patterns. It is shown that the color of an impinging light plane can be identified from the image of the illuminated scene, even with colorful scenes. Identification is local and does not rely on spatial color sequences. Therefore, in comparison to other color structured light techniques, assumptions about smoothness and color neutrality of the scene can be relaxed. The suggested approach has been implemented and the theoretical results are supported by experiments.

1 June 2002 in Magnetic Resonance Imaging
Verified
Journal Article
Closed access
HGH. Greenspan
H. Greenspan
GOG. Oz
G. Oz
NKNahum Kiryati
Nahum Kiryati
SPS. Peled
S. Peled

7 August 2002 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
GZG. Zigelman
G. Zigelman
RKR. Kimmel
R. Kimmel
NKNahum Kiryati
Nahum Kiryati
Presents a novel technique for texture mapping on arbitrary surfaces with minimal distortion by preserving the local and global structure of the texture. The recent introduction of the fast marching method on triangulated surfaces has made it possible to compute a geodesic distance map from a given surface point in O(n lg n) operations, where n is the number of triangles that represent the surface. We use this method to design a surface flattening approach based on multi-dimensional scaling (MDS). MDS is a family of methods that map a set of points into a finite-dimensional flat (Euclidean) domain, where the only data given is the corresponding distance between every pair of points. The MDS mapping yields minimal changes of the distances between the corresponding points. We then solve an "inverse" problem and map a flat texture patch onto a curved surface while preserving the structure of the texture.

1 September 2000 in International Journal of Computer Vision
Verified
Journal Article
Closed access
PDF file
YSYoav Y. Schechner
Yoav Y. Schechner
NKNahum Kiryati
Nahum Kiryati

1 November 1995 in Computer Vision and Image Understanding
Verified
Journal Article
Closed access
RKRon Kimmel
Ron Kimmel
DSDoron Shaked
Doron Shaked
NKNahum Kiryati
Nahum Kiryati
ABAlfred M. Bruckstein
Alfred M. Bruckstein