ABSTRACT Locating the minimum number of sensors able to see at the same time the entire surface o... more ABSTRACT Locating the minimum number of sensors able to see at the same time the entire surface of an object is an important practical problem. Most work presented in this area is restricted to 2D objects. In this paper we present a sensor location algorithms with the following properties. In principle, the algorithm could be extended to 3D objects. The solution given by the algorithm converges toward the optimal solution when increasing the resolution of the object. Limitations due to real sensors can be easily taken into account.
2006 IEEE International Conference on Robotics and Biomimetics, 2006
Locating sensors in 2D can be modeled as an art gallery problem, which asks to locate the minimum... more Locating sensors in 2D can be modeled as an art gallery problem, which asks to locate the minimum number of omnidirectional sensors, or "guards" to "cover" a polygonal floor map. The problem is NP-hard, and no finite algorithm, even exponential, is known for its exact solution. The approximate algorithms in the literature are polynomial in the worst case, but their
Locating the minimum number of sensors able to see at the same time the entire surface of an obje... more Locating the minimum number of sensors able to see at the same time the entire surface of an object is an important practical problem. Most work presented in this area is restricted to 2D objects. In this paper we present an optimal 3D sensor location algorithms that can locate sensors into a polyhedral environment that are able to see the features of the objects in their entirety. Limitations due to real sensors can be easily taken into account. The algorithm has been implemented, and examples are also given.
Plastic surgery plays a major role in today health care. Planning plastic face surgery requires d... more Plastic surgery plays a major role in today health care. Planning plastic face surgery requires dealing with the elusive concept of attractiveness for evaluating feasible beautification of a particular face. The existing computer tools essentially allow to manually warp 2D images or 3D face scans, in order to produce images simulating possible surgery outcomes. How to manipulate faces, as well as the evaluation of the results, are left to the surgeons judgement. We propose a new quantitative approach able to automatically suggest effective patient-specific improvements of facial attractiveness. The general idea is to compare the face of the patient with a large database of attractive faces, excluding the facial feature to be improved. Then, the feature of the faces more similar is applied, with a suitable morphing, to the face of the patient. In this paper we present a first application of the general idea in the field of nose surgery. Aesthetically effective rhinoplasty is suggeste...
Reconstructing 3D shapes from 2D silhouettes is a common technique in computer vision. It require... more Reconstructing 3D shapes from 2D silhouettes is a common technique in computer vision. It requires knowing the position of the viewpoints with respect to the object. But what can we say when this information is not available? This paper provides a first insight into the problem, introducing the problem of understanding 3D shapes from silhouettes when the relative positions of the viewpoints are unknown. In particular, the case of orthographic silhouettes with viewing directions parallel to the same plane is thoroughly discussed. Also we introduce sets of inequalities, which describe all the possible solution sets and a paving technique to calculate the feasible solution space of each set.
In this paper we propose a non intrusive tracking system able to capture simple hand gestures in ... more In this paper we propose a non intrusive tracking system able to capture simple hand gestures in a fast and reliable way. Our device uses the images taken from a single camera to capture the 3D position and orientation of the hand of the user. In particular, the 3D position of the forefinger tip is used as a 3D marker, and the posture of the hand is used to input simple commands. The proposed approach combines several computer vision algorithms in order to exploit their strengths trying to minimize their drawbacks. The result is a real time system that is very robust against noise and cluttered backgrounds. An evaluation of the quality of the proposed approach is also presented.
... Page 6. 720 A. Laurentini, A. Bottino, and M. De Simone Fig. ... 39–48. IEEE Computer Society... more ... Page 6. 720 A. Laurentini, A. Bottino, and M. De Simone Fig. ... 39–48. IEEE Computer Society Press, Washington, DC, USA (1991), doi: http://dx.doi.org/10.1109/SFCS.1991.185346 5. Kahn, J., Klawe, M., Kleitman, D.: Traditional galleries require fewer watchmen. ...
ABSTRACT Locating the minimum number of sensors able to see at the same time the entire surface o... more ABSTRACT Locating the minimum number of sensors able to see at the same time the entire surface of an object is an important practical problem. Most work presented in this area is restricted to 2D objects. In this paper we present a sensor location algorithms with the following properties. In principle, the algorithm could be extended to 3D objects. The solution given by the algorithm converges toward the optimal solution when increasing the resolution of the object. Limitations due to real sensors can be easily taken into account.
2006 IEEE International Conference on Robotics and Biomimetics, 2006
Locating sensors in 2D can be modeled as an art gallery problem, which asks to locate the minimum... more Locating sensors in 2D can be modeled as an art gallery problem, which asks to locate the minimum number of omnidirectional sensors, or "guards" to "cover" a polygonal floor map. The problem is NP-hard, and no finite algorithm, even exponential, is known for its exact solution. The approximate algorithms in the literature are polynomial in the worst case, but their
Locating the minimum number of sensors able to see at the same time the entire surface of an obje... more Locating the minimum number of sensors able to see at the same time the entire surface of an object is an important practical problem. Most work presented in this area is restricted to 2D objects. In this paper we present an optimal 3D sensor location algorithms that can locate sensors into a polyhedral environment that are able to see the features of the objects in their entirety. Limitations due to real sensors can be easily taken into account. The algorithm has been implemented, and examples are also given.
Plastic surgery plays a major role in today health care. Planning plastic face surgery requires d... more Plastic surgery plays a major role in today health care. Planning plastic face surgery requires dealing with the elusive concept of attractiveness for evaluating feasible beautification of a particular face. The existing computer tools essentially allow to manually warp 2D images or 3D face scans, in order to produce images simulating possible surgery outcomes. How to manipulate faces, as well as the evaluation of the results, are left to the surgeons judgement. We propose a new quantitative approach able to automatically suggest effective patient-specific improvements of facial attractiveness. The general idea is to compare the face of the patient with a large database of attractive faces, excluding the facial feature to be improved. Then, the feature of the faces more similar is applied, with a suitable morphing, to the face of the patient. In this paper we present a first application of the general idea in the field of nose surgery. Aesthetically effective rhinoplasty is suggeste...
Reconstructing 3D shapes from 2D silhouettes is a common technique in computer vision. It require... more Reconstructing 3D shapes from 2D silhouettes is a common technique in computer vision. It requires knowing the position of the viewpoints with respect to the object. But what can we say when this information is not available? This paper provides a first insight into the problem, introducing the problem of understanding 3D shapes from silhouettes when the relative positions of the viewpoints are unknown. In particular, the case of orthographic silhouettes with viewing directions parallel to the same plane is thoroughly discussed. Also we introduce sets of inequalities, which describe all the possible solution sets and a paving technique to calculate the feasible solution space of each set.
In this paper we propose a non intrusive tracking system able to capture simple hand gestures in ... more In this paper we propose a non intrusive tracking system able to capture simple hand gestures in a fast and reliable way. Our device uses the images taken from a single camera to capture the 3D position and orientation of the hand of the user. In particular, the 3D position of the forefinger tip is used as a 3D marker, and the posture of the hand is used to input simple commands. The proposed approach combines several computer vision algorithms in order to exploit their strengths trying to minimize their drawbacks. The result is a real time system that is very robust against noise and cluttered backgrounds. An evaluation of the quality of the proposed approach is also presented.
... Page 6. 720 A. Laurentini, A. Bottino, and M. De Simone Fig. ... 39–48. IEEE Computer Society... more ... Page 6. 720 A. Laurentini, A. Bottino, and M. De Simone Fig. ... 39–48. IEEE Computer Society Press, Washington, DC, USA (1991), doi: http://dx.doi.org/10.1109/SFCS.1991.185346 5. Kahn, J., Klawe, M., Kleitman, D.: Traditional galleries require fewer watchmen. ...
Uploads