000			02872nam a2200277 a 4500
005			20260817161123.0
008
035			_a.b12339507
100	1		_aSakol Kitkasiwat
245	1	0	_a2D irregular shape parts recognition for automatic assembly
260			_aPathumthani: _bAsian Institute of Technology, _c2014
300			_e1 online resource
500			_aThe degree of Master of Engineering in Mechatronics, School of Engineering and Technology
520			_aThis thesis is to develop matching algorithm for assembling 2D irregular shape parts. The algorithm was implemented based on a real process. The algorithm focuses on parts identification and matching. Given parts are always placed to a working area of assembling process randomly. This system has to assemble any parts following a design. In order to achieve this process, there are three main procedures as follow: image enhancement, part recognition and toolpath generation. Firstly, image enhancement, a given image and a designing image is transformed to one-pixel wide closed contour binary image to analyze the contour information after the both of them are acquired by capturing from a working area of an assembling process. This algorithm can extract contour information from raw images. Secondly, part recognition, the purposed algorithm of this process is to create index descriptions and match parts from index information. The parts images initially, are traced to create group of contours with x,y coordinates. Then the algorithm generates four index descriptions in which can specify the parts differences under a polygon-like concept. The index descriptions can show the estimated detail of each object shape. By using the index description, the algorithm then matches the given parts to a design and makes matched pairs. Lastly, toolpath generation, this technique has been developed to search a efficient toolpath of assembly. There are two sections for calculation in this process. the first section is to manipulate the part orientation in order to make a machine assemble part in a correct angle. The second section is to select a suitable toolpath of assembly. This study attempts to investigate the performance of the algorithm by testing with several types of part. The result of all experiments shows the efficiency of the algorithm for assembling polygon and non-polygon.
650		0	_aAssembly -line method
650		0	_aShapes
700	0		_aPisut Koomsap, _eChairperson
700	1		_aBohez, Erik L.J., _eExamination Committee
700	0		_aManukid Parnichkun, _eExamination Committee
710	2		_aAIT Fellowship, _eScholarship donor
856			_3Full-Text _uhttp://203.159.5.9/ait-thesis/detail.php?q=B04684
907			_a.b12339507 _bmnait _cj
902			_a240423
998			_b0 _c200108 _dm _ea _fj _g0
999			_c21 _d21