Refine your search
Collections
Co-Authors
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Anand, S.
- Simulated Annealing Algorithm for Modern VLSI Floorplanning Problem
Abstract Views :183 |
PDF Views:0
Authors
Affiliations
1 Department of Electronics and Communication Engineering, V V College of Engineering, IN
2 Department of Electrical and Electronics Engineering, V V College of Engineering, IN
1 Department of Electronics and Communication Engineering, V V College of Engineering, IN
2 Department of Electrical and Electronics Engineering, V V College of Engineering, IN
Source
ICTACT Journal on Microelectronics, Vol 2, No 1 (2016), Pagination: 175-181Abstract
In floorplanning, our aim is to determine the relative locations of the blocks in the chip and the objective is to minimize the floorplan area, wirelength. Generally, there are so many strategies in VLSI floorplanning like area optimization, wirelength optimization, power optimization, temperature optimization and etc. This paper concentrates on area optimization. The goal of the physical design process is to design the VLSI chip with minimum area. The primary idea is to minimize the floorplan area by reshaping the blocks which are present inside the floorplan in order to attain the minimum area with less computational time. Proposed problem is redefined with an efficient meta-heuristic as Simulated Annealing algorithm which will provide optimal solution with less computation time. The proposed algorithm has been tested by using set of benchmarks of Microelectronics Centre of North Carolina (MCNC).The performance of the proposed algorithm is compared with other stochastic algorithms reported in the literature and is found to be efficient in producing floorplan with minimal area. The performance of the proposed algorithm seems to be better than the existing algorithms.Keywords
VLSI, Floorplanning, Optimization, Deadspace, Meta-Heuristic, Simulated Annealing.
- An Efficient and Effective Technique for Marker Detection and Pose Estimation using a Monocular Calibrated Camera
Abstract Views :217 |
PDF Views:0
Authors
Affiliations
1 Department of Electronics and Communication Engineering, Mar Baselios College of Engineering and Technology, IN
1 Department of Electronics and Communication Engineering, Mar Baselios College of Engineering and Technology, IN
Source
ICTACT Journal on Image and Video Processing, Vol 9, No 4 (2019), Pagination: 1981-1985Abstract
The basic idea of all image processing methods is to process images captures by the camera device. Using image processing techniques, it is possible to find and process markers, faces, natural objects, simple shapes and other objects. One of the techniques is based on the use of markers, both artificial and natural. Markers on image are used for determining objects around or about the current location of the user. This method is also known as marker-based tracking. Markers in this method can provide a reference coordinate system for producing graphical overlays over the real components on the images. Marker identification is an important part of marker-based tracking process. A good marker is considered to be a marker that can be easily and reliably detected under different circumstances. The process of marker detection consists of two stages: Image pre-processing and Identification of potential markers. Marker processing algorithm and steps related to image processing and detection of potential marker stages are: Acquisition of a source image, Image pre-processing and Detection of potential markers. This paper discusses a simple marker detection algorithm and its simulation in MATLAB for verification. A potential application of marker detection to estimate the pose of the marker in real time is also implemented and the results are discussed.Keywords
Marker, Processing, Detection, Tracking, Matlab.References
- C.R. Jung and R. Schramm, “Rectangle Detection based on a Windowed Hough Transform”, Proceedings of 17th Brazilian Symposium on Computer Graphics and Image Processing, pp. 20-24, 2004.
- Martin Hirzer, “Marker Detection for Augmented Reality Applications”, Technical Report, Institute for Computer Graphics and Vision, Graz University of Technology, 2008.
- Vadim Beglov, “Object Information based on Marker Recognition”, Master Thesis, Department of Computer Science, University of Eastern Finland, 2013.
- Sanni Siltanen, “Theory and Applications of Marker-based Augmented Reality”, Available at: https://www.vtt.fi/inf/pdf/science/2012/S3.pdf.
- Oliver Toole and Dave Dolben, “Marker Detection and Tracking for Augmented Reality Applications”, Available at: https://stacks.stanford.edu/file/druid:hg315sw1225/Toole_Dolben.pdf
- Stefan Hinterstoisser, Selim Benhimane and Nassir Navab, “N3M: Natural 3D Markers for Real-Time Object Detection and Pose Estimation”, Proceedings of IEEE 11th International Conference on Computer Vision, pp. 14-21, 2007.
- E. Olson, “Apriltag: A Robust and Flexible Visual Fiducial System”, Proceedings of IEEE 11th International Conference on Robotics and Automation, pp. 3400-3407, 2011.
- K.M. Yi, E. Trulls, V. Lepetit and P. Fua, “Lift: Learned Invariant Feature Transform”, Proceedings of IEEE International Conference on Computer Vision, pp. 467-483, 2016.
- K. He, G. Gkioxari, P. Dollar and R. Girshick, “Mask R-CNN”, Proceedings of IEEE International Conference on Computer Vision, pp. 2980-2988, 2017.
- T. Simon, H. Joo, I.A. Matthews and Y. Sheikh, “Hand Key Point Detection in Single Images using Multiview Bootstrapping”, Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition, pp. 1145-1153, 2017.